Search results for "oftware"
showing 10 items of 7396 documents
Low Degree of Separation Does Not Guarantee Easy Coordination
2012
In the times of increased global competition, software companies are forced to search for more effective development practices and often team up with onshore and offshore partners to develop faster and better products. In this paper we empirically explore a highly distributed onshore development project with a complex coordination structure. Our findings demonstrate that onshore development projects are not protected from coordination and communication challenges and task allocation complexities. Previously reported qualitative findings regarding organizational problems in this paper are supplemented with quantitative measurements of the true coordination delays and additional analysis of c…
Managerial Growth Challenges in Small Software Firms: A Multiple-Case Study of Growth-Oriented Enterprises
2010
Notwithstanding the importance of small software firms, research focusing on understanding the growth challenges faced by their management is close to non-existent. By taking a life-cycle approach and focusing on managerial challenges, the aim of this paper is to analyze the growth process of small software firms. After forming a synthesis of possible growth challenges from relevant literature, the results are reflected upon case software firms using thematic interviews and questionnaires. According to the analysis of four software firms, managing human resources represents the greatest challenge for software services firms. Additionally, other challenges stem from competition and sales-rel…
Vertical Integration due to Small Market Size and High Product Development and Integration Costs
2009
An independent software vendor (ISV) recovers the costs of software development and configuration through license fees. However, if the number of ISV's customers is limited, then either the license fees needed for recovering the software development investments may be too high (and hence the customer would prefer to develop the software internally), or the ISV's margin may have to be decreased. Given the costs of development and configuration, as well as the margins set by the ISVs, it is possible to estimate how many customers an ISV has to have in order to recover its costs. Furthermore, given a market of a specific size and the minimum number of ISV's customers, it is possible to assess …
Metamodelling architectures for complex data integration in systems biology
2010
Systems biology aims at deciphering the functioning of biological systems on the basis of the knowledge of their molecular components and the relations between such components. To address the issues involved, high-throughput technologies are used. Taking advantage of the standards that are being currently developed to achieve consensual representations of technological domains, we present a metamodelling architecture based on these standards. The proposed architecture organises standard-specific metamodels and models into a single hierarchy. Each metamodel describes a consensus that is shared by several models of applications. A metamodel construct for description of faceted element is prop…
Voxel-based General Voronoi Diagram for Complex Data with Application on Motion Planning
2020
One major challenge in Assembly Sequence Planning (ASP) for complex real-world CAD-scenarios is to find appropriate disassembly paths for all assembled parts. Such a path places demands on its length and clearance. In the past, it became apparent that planning the disassembly path based on the (approximate) General Voronoi Diagram (GVD) is a good approach to achieve these requirements. But for complex real-world data, every known solution for computing the GVD is either too slow or very memory consuming, even if only approximating the GVD.We present a new approach for computing the approximate GVD and demonstrate its practicability using a representative vehicle data set. We can calculate a…
Incremental Generalized Discriminative Common Vectors for Image Classification.
2015
Subspace-based methods have become popular due to their ability to appropriately represent complex data in such a way that both dimensionality is reduced and discriminativeness is enhanced. Several recent works have concentrated on the discriminative common vector (DCV) method and other closely related algorithms also based on the concept of null space. In this paper, we present a generalized incremental formulation of the DCV methods, which allows the update of a given model by considering the addition of new examples even from unseen classes. Having efficient incremental formulations of well-behaved batch algorithms allows us to conveniently adapt previously trained classifiers without th…
Data-Centric and Multimedia Components
2011
The content of XML documents is often primarily plain text, interspersed with various headers and perhaps some lists and tables. However, there are many applications for which the content of documents is not primarily narrative in nature, but instead includes (portions of) data records that are subject to storage and computational manipulation. The latter documents are sometimes referred to as data-centric or record-like, and they rely extensively on precise descriptions of the forms of data that can appear. In this chapter we first introduce the data type definition capabilities in XML Schema. We then consider the types of data very common in traditional databases: numeric data, dates, and…
On the Online Classification of Data Streams Using Weak Estimators
2016
In this paper, we propose a novel online classifier for complex data streams which are generated from non-stationary stochastic properties. Instead of using a single training model and counters to keep important data statistics, the introduced online classifier scheme provides a real-time self-adjusting learning model. The learning model utilizes the multiplication-based update algorithm of the Stochastic Learning Weak Estimator (SLWE) at each time instant as a new labeled instance arrives. In this way, the data statistics are updated every time a new element is inserted, without requiring that we have to rebuild its model when changes occur in the data distributions. Finally, and most impo…