Improving novice analyst performance in modeling the sequence diagram in systems analysis: A cognitive complexity approach

The Unified Modeling Language (UML) has quickly become the industry standard for object-oriented software development. It is being widely used in organizations and institutions around the world. However, UML is often found to be too complex for novice systems analysts. Although prior research has identified difficulties novice analysts encounter in learning UML, no viable solution has been proposed to address these difficulties. Sequence-diagram modeling, in particular, has largely been overlooked. The sequence diagram models the behavioral aspects of an object-oriented software system in terms of interactions among its building blocks, i.e. objects and classes. It is one of the most commonly-used UML diagrams in practice. However, there has been little research on sequence-diagram modeling. The current literature scarcely provides effective guidelines for developing a sequence diagram. Such guidelines will be greatly beneficial to novice analysts who, unlike experienced systems analysts, do not possess relevant prior experience to easily learn how to develop a sequence diagram. There is the need for an effective sequence-diagram modeling technique for novices. This dissertation reports a research study that identified novice difficulties in modeling a sequence diagram and proposed a technique called CHOP (CHunking, Ordering, Patterning), which was designed to reduce the cognitive load by addressing the cognitive complexity of sequence-diagram modeling. The CHOP technique was evaluated in a controlled experiment against a technique recommended in a well-known textbook, which was found to be representative of approaches provided in many textbooks as well as practitioner literatures. The results indicated that novice analysts were able to perform better using the CHOP technique. This outcome seems have been enabled by pattern-based heuristics provided by the technique. Meanwhile, novice analysts rated the CHOP technique more useful although not significantly easier to use than the control technique. The study established that the CHOP technique is an effective sequence-diagram modeling technique for novice analysts.

Improving Novice Analyst Performance in Modeling the Sequence Diagram in Systems Analysis: A Cognitive Complexity Approach

The Unified Modeling Language (UML) has quickly become the industry standard for object-oriented software development. It is being widely used in organizations and institutions around the world. However, UML is often found to be too complex for novice systems analysts. Although prior research has identified difficulties novice analysts encounter in learning UML, no viable solution has been proposed to address these difficulties. Sequence-diagram modeling, in particular, has largely been overlooked. The sequence diagram models the behavioral aspects of an object-oriented software system in terms of interactions among its building blocks, i.e. objects and classes. It is one of the most commonly-used UML diagrams in practice. However, there has been little research on sequence-diagram modeling. The current literature scarcely provides effective guidelines for developing a sequence diagram. Such guidelines will be greatly beneficial to novice analysts who, unlike experienced systems analysts, do not possess relevant prior experience to easily learn how to develop a sequence diagram. There is the need for an effective sequence-diagram modeling technique for novices. This dissertation reports a research study that identified novice difficulties in modeling a sequence diagram and proposed a technique called CHOP (CHunking, Ordering, Patterning), which was designed to reduce the cognitive load by addressing the cognitive complexity of sequence-diagram modeling. The CHOP technique was evaluated in a controlled experiment against a technique recommended in a well-known textbook, which was found to be representative of approaches provided in many textbooks as well as practitioner literatures. The results indicated that novice analysts were able to perform better using the CHOP technique. This outcome seems have been enabled by pattern-based heuristics provided by the technique. Meanwhile, novice analysts rated the CHOP technique more useful although not significantly easier to use than the control technique. The study established that the CHOP technique is an effective sequence-diagram modeling technique for novice analysts.

Rétro-ingénierie des diagrammes de séquence par visualisation interactive

Nous proposons une approche semi-automatique pour la rétro-ingénierie des diagrammes de séquence d’UML. Notre approche commence par un ensemble de traces d'exécution qui sont automatiquement alignées pour déterminer le comportement commun du système. Les diagrammes de séquence sont ensuite extraits avec l’aide d’une visualisation interactive, qui permet la navigation dans les traces d'exécution et la production des opérations d'extraction. Nous fournissons une illustration concrète de notre approche avec une étude de cas, et nous montrons en particulier que nos diagrammes de séquence générés sont plus significatifs et plus compacts que ceux qui sont obtenus par les méthodes automatisées.

Dérivation de diagrammes de séquence UML compactes à partir de traces d’exécution en se basant des heuristiques.

Nous proposons une approche d’extraction des diagrammes de séquence à partir de programmes orientés objets en combinant l’analyse statique et dynamique. Notre objectif est d’extraire des diagrammes compacts mais contenant le plus d’informations possible pour faciliter la compréhension du comportement d’un programme. Pour cette finalité, nous avons défini un ensemble d’heuristiques pour filtrer les événements d’exécution les moins importants et extraire les structures de contrôles comme les boucles et la récursivité. Nous groupons aussi les objets en nous basant sur leurs types respectifs. Pour tenir compte des variations d’un même scénario, notre approche utilise plusieurs traces d’exécution et les aligne pour couvrir le plus possible le comportement du programme. Notre approche a été évaluée sur un système de simulation d’ATM. L’étude de cas montre que notre approche produit des diagrammes de séquence concis et informatifs.

GRAPHICAL REPRESENTATIONS of MESSAGE EXCHANGES INTO WEB SERVICE-BASED APPLICATIONS

Web service-based application is an architectural style, where a collection of Web services communicate to each other to execute processes. With the popularity increase of Web service-based applications and since messages exchanged inside of this applications can be complex, we need tools to simplify the understanding of interrelationship among Web services. This work present a description of a graphical representation of Web service-based applications and the mechanisms inserted among Web service requesters and providers to catch information to represent an application. The major contribution of this paper is to discus and use HTTP and SOAP information to show a graphical representation similar to a UML sequence diagram of Web service-based applications.

Implications of query caching for JXTA peers

This dissertation studies the caching of queries and how to cache in an efficient way, so that retrieving previously accessed data does not need any intermediary nodes between the data-source peer and the querying peer in super-peer P2P network. A precise algorithm was devised that demonstrated how queries can be deconstructed to provide greater flexibility for reusing their constituent elements. It showed how subsequent queries can make use of more than one previous query and any part of those queries to reconstruct direct data communication with one or more source peers that have supplied data previously. In effect, a new query can search and exploit the entire cached list of queries to construct the list of the data locations it requires that might match any locations previously accessed. The new method increases the likelihood of repeat queries being able to reuse earlier queries and provides a viable way of by-passing shared data indexes in structured networks. It could also increase the efficiency of unstructured networks by reducing traffic and the propensity for network flooding. In addition, performance evaluation for predicting query routing performance by using a UML sequence diagram is introduced. This new method of performance evaluation provides designers with information about when it is most beneficial to use caching and how the peer connections can optimize its exploitation.

Modified design procedure for a sparger reactor sequence

In an earlier communication[l] we have indicated a general graphical design procedure for a sequence of sparger reactors in which a second order liquid phase reaction proceeds in a stagewise fashion. The prediction of the reactant concentration in each stage and hence the conversion depended on a search procedure initiated along a straight line representing the mass balance equation at the given stage and drawn from the known feed stage located on the abscissa in a E-IU diagram for the given system.

Towards the main sequence: detailed analysis of weak line and post-T Tauri stars

A detailed study was performed for a sample of low-mass pre-main-sequence (PMS) stars, previously identified as weak-line T Tauri stars, which are compared to members of the Tucanae and Horologium Associations. Aiming to verify if there is any pattern of abundances when comparing the young stars at different phases, we selected objects in the range from 1 to 100 Myr, which covers most of PMS evolution. High-resolution optical spectra were acquired at European Southern Observatory and Observatorio do Pico dos Dias. The stellar fundamental parameters effective temperature and gravity were calculated by excitation and ionization equilibria of iron absorption lines. Chemical abundances were obtained via equivalent width calculations and spectral synthesis for 44 per cent of the sample, which shows metallicities within 0.5 dex solar. A classification was developed based on equivalent width of Li I 6708 angstrom and Ha lines and spectral types of the studied stars. This classification allowed a separation of the sample into categories that correspond to different evolutive stages in the PMS. The position of these stars in the Hertzsprung-Russell diagram was also inspected in order to estimate their ages and masses. Among the studied objects, it was verified that our sample actually contains seven weak-line T Tauri stars, three are Classical T Tauri, 12 are Fe/Ge PMS stars and 21 are post-T Tauri or young main-sequence stars. An estimation of circumstellar luminosity was obtained using a disc model to reproduce the observed spectral energy distribution. Most of the stars show low levels of circumstellar emission, corresponding to less than 30 per cent of the total emission.

Milky Way demographics with the VVV survey I. The 84-million star colour-magnitude diagram of the Galactic bulge

Context. The Milky Way (MW) bulge is a fundamental Galactic component for understanding the formation and evolution of galaxies, in particular our own. The ESO Public Survey VISTA Variables in the Via Lactea is a deep near-IR survey mapping the Galactic bulge and southern plane. Particularly for the bulge area, VVV is covering similar to 315 deg(2). Data taken during 2010 and 2011 covered the entire bulge area in the JHKs bands. Aims. We used VVV data for the whole bulge area as a single and homogeneous data set to build for the first time a single colour-magnitude diagram (CMD) for the entire Galactic bulge. Methods. Photometric data in the JHK(s) bands were combined to produce a single and huge data set containing 173 150 467 sources in the three bands, for the similar to 315 deg(2) covered by VVV in the bulge. Selecting only the data points flagged as stellar, the total number of sources is 84 095 284. Results. We built the largest colour-magnitude diagrams published up to date, containing 173.1+ million sources for all data points, and more than 84.0 million sources accounting for the stellar sources only. The CMD has a complex shape, mostly owing to the complexity of the stellar population and the effects of extinction and reddening towards the Galactic centre. The red clump (RC) giants are seen double in magnitude at b similar to -8 degrees-10 degrees, while in the inner part (b similar to -3 degrees) they appear to be spreading in colour, or even splitting into a secondary peak. Stellar population models show the predominance of main-sequence and giant stars. The analysis of the outermost bulge area reveals a well-defined sequence of late K and M dwarfs, seen at (J - K-s) similar to 0.7-0.9 mag and K-s greater than or similar to 14 mag. Conclusions. The interpretation of the CMD yields important information about the MW bulge, showing the fingerprint of its structure and content. We report a well-defined red dwarf sequence in the outermost bulge, which is important for the planetary transit searches of VVV. The double RC in magnitude seen in the outer bulge is the signature of the X-shaped MW bulge, while the spreading of the RC in colour, and even its splitting into a secondary peak, are caused by reddening effects. The region around the Galactic centre is harder to interpret because it is strongly affected by reddening and extinction.

Multiple DNA and protein sequence alignment based on segment-to-segment comparison.

In this paper, a new way to think about, and to construct, pairwise as well as multiple alignments of DNA and protein sequences is proposed. Rather than forcing alignments to either align single residues or to introduce gaps by defining an alignment as a path running right from the source up to the sink in the associated dot-matrix diagram, we propose to consider alignments as consistent equivalence relations defined on the set of all positions occurring in all sequences under consideration. We also propose constructing alignments from whole segments exhibiting highly significant overall similarity rather than by aligning individual residues. Consequently, we present an alignment algorithm that (i) is based on segment-to-segment comparison instead of the commonly used residue-to-residue comparison and which (ii) avoids the well-known difficulties concerning the choice of appropriate gap penalties: gaps are not treated explicity, but remain as those parts of the sequences that do not belong to any of the aligned segments. Finally, we discuss the application of our algorithm to two test examples and compare it with commonly used alignment methods. As a first example, we aligned a set of 11 DNA sequences coding for functional helix-loop-helix proteins. Though the sequences show only low overall similarity, our program correctly aligned all of the 11 functional sites, which was a unique result among the methods tested. As a by-product, the reading frames of the sequences were identified. Next, we aligned a set of ribonuclease H proteins and compared our results with alignments produced by other programs as reported by McClure et al. [McClure, M. A., Vasi, T. K. & Fitch, W. M. (1994) Mol. Biol. Evol. 11, 571-592]. Our program was one of the best scoring programs. However, in contrast to other methods, our protein alignments are independent of user-defined parameters.