Search

Context. The implementation of different use-cases may be performed by different development teams at different times. This results in a poorly structured code. The problem is exacerbated when developing medium and large projects in a short time. Objective. Since inheritance is one of the effective ways to structure and improve the quality of code, the aim of the study is to determine possible inheritance relationships for a variety of class models. Method. It is proposed to select from the entire set of classes representing the class model at a certain design stage, subsets for which a common parent class (in a particular case, an abstract class) is possible. To solve the problem, signs of the generality of classes have been formulated. The mathematical model of the conceptual class has been improved by including information about the responsibilities of the class, its methods and attributes. The connection of each class with the script items for which it is used has been established. A system of data types for class model elements is proposed. Description of class method signatures has been extended. A method for restructuring the class model, which involves 3 stages, has been developed. At the first stage, the proximity coefficients of classes are determined. At the second, subsets of possible child classes are created. At the third stage, an automated transformation of the class structure is performed, considering the identified inheritance relationships. Results. A software product for conducting experiments to identify possible inheritance relationships depending on the number of classes and the degree of their similarity has been developed. The results of the conducted tests showed the effectiveness of the decisions made. Conclusions. The method uses an algorithm for forming subsets of classes that can have one parent and an algorithm for automatically creating and converting classes to build a two-level class hierarchy. An experiment showed a threefold reduction in errors in detecting inheritance and a multiple reduction in time in comparison with the existing technology. [ABSTRACT FROM AUTHOR]

Software products are essential parts of many organizations on-going business up to a large extent. The main factors contributing to the successful delivery of a software product are its timely completion within the allocated budget and its quality compliance. Customer goodwill and profitability are very important for a software organization's continued business. A large proportion of software products are delivered late or go over-budget causing significant inconvenience to the customers. This work proposes an accurate development effort estimation approach for software products. The Class Point (CP) approach with regression analysis method has been used for estimation of the development effort. This work uses a two step estimation approach. In the first step, an enhanced CP approach is used to evaluate the development effort of the system. In the second step, regression analysis models are utilized to refine the estimated effort accuracy. The results derived by applying the proposed two step approach confirmed the validity and the accuracy of this approach. It was observed that the SVR with RBF kernel is providing the best accuracy compared to other approaches. [ABSTRACT FROM AUTHOR]

The software design model performs an important role in modern software engineering methods. Especially in Model-Driven Engineering (MDE), it is treated as an essential asset of software development; even programming language code is produced by the models. If the model has errors, then they can propagate into the code. Model verification tools check the presence of errors in the model. This paper shows how a UML class model verification tool has been built to support complex models and unsupported elements such as XOR constraints and dependency relationships. This tool uses ontology for verifying the UML class model. It takes a class model in XMI format and generates the OWL file. Performs verification of model in two steps: (1) uses the ontology-based algorithm to verify association multiplicity constraints; and (2) uses ontology reasoner for the verification of XOR constraints and dependency relationships. The results show the proposed tool improves the verification efficiency and supports the verification of UML class model elements that have not been supported by any existing tool. [ABSTRACT FROM AUTHOR]

The testing phase of Software Development Life Cycle (SDLC) is considered essential for delivering the quality expected from the software product. The quality of the software product determines its acceptability and preserves the reputation of the developing organization. Early estimation of test effort is a significant predicament faced by the software managers. An early estimation enables early test planning which helps the project to meet the timeline, as well as budgetary and quality goals. Early estimation of the test effort is a relatively unexplored territory with limited undertaken research work. Unified Modeling Language (UML) is a widely accepted standard for representing Object Oriented Systems (OOS) during different phases of SDLC. Selected UML models created with adequate amount of information can be utilized for early test effort estimation. This work proposes a simple, semi-automated two-stage approach to estimate system test effort from Use Case and Class models during requirements and design phases by using their inherent attributes as parameters. As per the experiments conducted on a number of Web-based projects, the approach presented in this work predicted the test efforts with reasonable accuracy. [ABSTRACT FROM AUTHOR]

Copyright of Ingénierie des Systèmes d'Information is the property of International Information & Engineering Technology Association (IIETA) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We propose a method for localization and classification of brand logos in natural images. The system has to overcome multiple challenges such as perspective deformations, warping, variations of the shape and colors, occlusions, background variations. To deal with perspective variation, we rely on homography matching between the SIFT keypoints of logo instances of the same class. To address the changes in color, we construct a weighted graph of logo interconnections that is further analyzed to extract potentially multiple instances of the class. The main instance is built by grouping the keypoints of the graph connected logos onto the central image. The secondary instance is needed for color inverted logos and is obtained by inverting the orientation of the main instance. The constructed logo recognition system is tested on two databases (FlickrLogos-32 and BelgaLogos), outperforming state of the art with more than 10 % accuracy. [ABSTRACT FROM AUTHOR]

In the current scenario, most of the applications are based upon graphical user interface and dependent upon the object-oriented technology. Software Industries are interested to convert old structured based softwares into object-oriented based softwares and also to reduce the lines of the code of application for reduction in the execution time of application. Therefore, it is a big challenge to reduce the execution time of the application based upon the objectoriented technology. The present work deals with the reduction of execution time for the superscalar machine by the use of object-oriented approach. A well known modeling language i.e. Unified Modeling Language (UML) is used to model the superscalar pipeline architecture. UML class and sequence models are designed before computations of the execution time and computed results are depicted in the form of tables and graphs. The comparisons are also made by taking the two object-oriented programming languages. [ABSTRACT FROM AUTHOR]

Classical location models fix an objective function and then attempt to find optimal points to this objective. In the last years a flexible approach, the ordered median problem, has been introduced. It handles a wide class of objectives, such as the median, the center and the centdian function. In this paper we present new properties of the ordered median problem such as solvability for the situation of attractive and repulsive locations. We also develop a new solution method that even yields local optimal points for non-convex objective functions. Furthermore, we discuss separability of ordered median problems without repulsion and derive a sufficient criterion. Finally, we introduce a useful model extension, the facility class model, which allows to deal with a wider range of real world problems in the ordered median setting. [ABSTRACT FROM AUTHOR]