Log in

Relevant bibliographies by topics / Sequence diagrams / Journal articles

To see the other types of publications on this topic, follow the link: Sequence diagrams.

Journal articles on the topic 'Sequence diagrams'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Sequence diagrams.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Kulkarni, Dr R. N., and C. K. Srinivasa. "Novel approach to transform UML Sequence diagram to Activity diagram." Journal of University of Shanghai for Science and Technology 23, no. 07 (July 26, 2021): 1247–55. http://dx.doi.org/10.51201/jusst/21/07300.

Full text

Abstract:

Unified Modelling Language (UML) is currently accepted as a defacto standard language for modeling the software in the software industry. It will allow to implement object oriented concepts to model the software system. It provides a complete pictographic representation of software. Broadly these UML diagrams are classified into two groups viz. Structural diagrams and Behavioral diagrams. The sequence diagrams and Activity diagrams belongs to the second group i.e. behavioral diagrams. The sequence diagram represents the sequence of messages flowing from one object to another and activity diagram represents the flow of activities one after the other in a system. In this paper, we are proposing an automated tool which transforms the sequence diagram (which is represented in the table format) into activity diagram. The sequence diagram which is represented in the three column table called sequence table comprises various components of sequence diagram like objects, interactions, messages, alternations, iterations, loops, etc. The proposed tool reads the sequence table and converts the entire table components into the equivalent Activity table. Further the tool reads the activity table and then transforms to its equivalent activity diagram.

APA, Harvard, Vancouver, ISO, and other styles

2

HIGA, RYUJI, YASUTAKA NAKANISHI, SHIN SATOH, and TAKUTO YAMAMOTO. "CROSSING INFORMATION AND WARPING POLYNOMIALS ABOUT THE TREFOIL KNOT." Journal of Knot Theory and Its Ramifications 21, no. 12 (September 18, 2012): 1250117. http://dx.doi.org/10.1142/s0218216512501179.

Full text

Abstract:

We go along a knot diagram, and get a sequence of over- and under- crossing points. We will study which kinds of sequences are realized by diagrams of the trefoil knot. As an application, we will characterize the Shimizu warping polynomials for diagrams of the trefoil knot.

APA, Harvard, Vancouver, ISO, and other styles

3

Kurniawan, Tri Astoto, Lam-Son Lê, and Bayu Priyambadha. "Challenges in Developing Sequence Diagrams (UML)." Journal of Information Technology and Computer Science 5, no. 2 (July 29, 2020): 221. http://dx.doi.org/10.25126/jitecs.202052216.

Full text

Abstract:

During the object-oriented software design phase, the designers have to describe the dynamic aspect of the system under development through the most common interaction diagram variant in UML 2.0, i.e. sequence diagrams. Some novice designers, including undergraduate and postgraduate students, suffer from making inappropriate models due to insufficiently detailed guidance required to develop such sequence diagrams. This paper classifies some potential mistakes which are likely performed by such novice designers, and discusses the corresponding corrections. We summarized such mistakes based on our long experiences in teaching software modeling classes as well as software analysis and design classes. There were classified twenty-one potential mistakes with respect to the syntactical and semantical correctness of the developed models. It is concluded that novice designers have to be aware and take into account the identified mistakes in such a way they can produce correct sequence diagrams.

APA, Harvard, Vancouver, ISO, and other styles

4

XU, DIANXIANG, WEIFENG XU, and W. ERIC WONG. "TESTING ASPECT-ORIENTED PROGRAMS WITH UML DESIGN MODELS." International Journal of Software Engineering and Knowledge Engineering 18, no. 03 (May 2008): 413–37. http://dx.doi.org/10.1142/s0218194008003672.

Full text

Abstract:

The new constructs in aspect-oriented programming bring new types of programming faults with respect to crosscutting concerns, such as incorrect pointcuts and advice. This paper presents a UML-based approach to testing whether or not an aspect-oriented program conforms to its expected crosscutting behavior. We explore aspect-oriented UML design models to derive tests for exercising interactions between aspects and classes. Each aspect-oriented model consists of class diagrams, aspect diagrams, and sequence diagrams. For a method under test, we weave the sequence diagrams of the advice on the method into the method's sequence diagram. Based on the woven sequence diagram and class/aspect diagrams, we then generate an AOF (Aspect-Object Flow) tree by applying coverage criteria such as condition coverage, polymorphic coverage, and loop coverage to woven sequence diagrams. In the AOF tree, each path from the root to a leaf is an abstract message sequence, indicating a template of test cases. A concrete test case is obtained by creating objects that satisfy the collective constraints in the template. Our empirical study shows that the model-based testing approach is capable of revealing several types of aspect-specific faults, including incorrect advice type, incorrect (weaker or stronger) pointcut strengths, and incorrect aspect precedence.

APA, Harvard, Vancouver, ISO, and other styles

5

Singh, Gurpreet, and Rasbir Singh. "Generation of test cases using UML models." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 13, no. 7 (July 30, 2014): 4671–74. http://dx.doi.org/10.24297/ijct.v13i7.2511.

Full text

Abstract:

Software Testing plays an important role in Software development because it can minimize the development cost. UML is widely used in the software development, there consists of the designing and coding of the software. Designing phase is done with the help of the UML models, which consists of the sequence diagrams, activity diagrams, use case diagrams, state chart diagrams etc. After designing of the system, the next task is coding. Since the software development is time and human resource consuming, the reduction of consumption is done with the help of the code generation automatically. This work mainly focus on the UML sequence diagram and state chart diagram as the model. We Propose a Technique for Test Case Generation using UML Models. UML models give a lot of Â information that should not be ignored in testing. An innovative approach of generating test cases from the combination of UML design diagrams has been discussed in this paper. Present work used an approach where sequence diagram and state chart diagram has been used to generate test cases. The test cases thus generated are suitable for dynamic testing of system.

APA, Harvard, Vancouver, ISO, and other styles

6

Funahashi, Y., Y. Nakanishi, and S. Satoh. "A note on the OU sequences of a 2-bridge knot." Journal of Knot Theory and Its Ramifications 25, no. 13 (November 2016): 1671001. http://dx.doi.org/10.1142/s0218216516710012.

Full text

Abstract:

An OU sequence is a cyclically ordered sequence in symbols [Formula: see text] and [Formula: see text] such that the number of [Formula: see text]’s is equal to that of [Formula: see text]’s. Every knot diagram defines an O’U sequence by reading [Formula: see text] and [Formula: see text] at over- and under-crossings, respectively, appeared along the diagram. In this note, we determine the OU sequences for a [Formula: see text]-bridge knot arising from its diagrams with two over-bridges.

APA, Harvard, Vancouver, ISO, and other styles

7

Duzhin, Vasilii S., and Anastasia A. Chudnovskaya. "Search for Young diagrams with large dimensions." Computer tools in education, no. 4 (December 28, 2019): 33–43. http://dx.doi.org/10.32603/2071-2340-2019-4-33-43.

Full text

Abstract:

Search for Young diagrams with maximum dimensions or, equivalently, search for irreducible representations of the symmetric group $S(n)$ with maximum dimensions is an important problem of asymptotic combinatorics. In this paper, we propose algorithms that transform a Young diagram into another one of the same size but with a larger dimension. As a result of massive numerical experiments, the sequence of $10^6$ Young diagrams with large dimensions was constructed. Furthermore, the proposed algorithms do not change the first 1000 elements of this sequence. This may indicate that most of them have the maximum dimension. It has been found that the dimensions of all Young diagrams of the resulting sequence starting from the 75778th exceed the dimensions of corresponding diagrams of the greedy Plancherel sequence.

APA, Harvard, Vancouver, ISO, and other styles

8

Pelawi, Dewan. "Pembuatan Sistem Informasi dengan Analisis dan Perancangan Berorientasi Objek." ComTech: Computer, Mathematics and Engineering Applications 3, no. 2 (December 1, 2012): 740. http://dx.doi.org/10.21512/comtech.v3i2.2303.

Full text

Abstract:

Analysis of business processes by observing the existing system is the main issue to produce information systems according to the needs of the company. Any search of problem solutions when doing business process is performed by a system approach. Object Oriented Analysis and Design (OOAD) is one of the methods currently used to build information systems. The method includes the building of activity diagrams, event table, class diagram, usecase diagrams, usecase description, state chart diagrams, deployment and software architecture, first-cut design class diagram, simple sequence diagram (SSD), sequence diagram (first-cut, view layer, data access layer), communication diagram, updated design class diagram, package diagram, persistent object, and user interface. The results obtained after performing all phases of the method is an information system based on the needs of companies that is expected to improve the performance and effectiveness of the company's business processes and support the business goals.

APA, Harvard, Vancouver, ISO, and other styles

9

Lu, Lunjin, and Dae-Kyoo Kim. "Required behavior of sequence diagrams." ACM Transactions on Software Engineering and Methodology 23, no. 2 (March 2014): 1–28. http://dx.doi.org/10.1145/2523108.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cho, Seung Mo, Hyung Ho Kim, Sung Deok Cha, and Doo Hwan Bae. "A semantics of sequence diagrams." Information Processing Letters 84, no. 3 (November 2002): 125–30. http://dx.doi.org/10.1016/s0020-0190(02)00270-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Orejas, Fernando, and Sonia Pérez. "Architectural Connectors for Sequence Diagrams." Electronic Notes in Theoretical Computer Science 206 (April 2008): 111–31. http://dx.doi.org/10.1016/j.entcs.2008.03.078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Wei, Bingyang, Harry S. Delugach, and Yi Wang. "From state diagrams to sequence diagrams: a requirements acquisition approach." International Journal of Computers and Applications 41, no. 2 (December 12, 2017): 89–111. http://dx.doi.org/10.1080/1206212x.2017.1408982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Khaldi, Maha, and Mohamed Erradi. "Design and Development of an e-Learning Project Management System: Modelling and Prototyping." International Journal of Emerging Technologies in Learning (iJET) 15, no. 19 (October 5, 2020): 95. http://dx.doi.org/10.3991/ijet.v15i19.14595.

Full text

Abstract:

In this work, based on the results obtained concerning the analysis and the needs of our project which concerns the design and development of an e-Learning project management system, we present the modeling stage with UML. Based on one hand, on two diagrams: class diagram and use case diagram, for static modeling and on the other hand, based on three diagrams: activity diagram, sequence diagram, diagram transition state for dynamic modeling. Finally, we offer examples of models for our project.

APA, Harvard, Vancouver, ISO, and other styles

14

Rauzy, Antoine B. "Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees." Reliability Engineering & System Safety 96, no. 7 (July 2011): 785–92. http://dx.doi.org/10.1016/j.ress.2011.02.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Kim, Jieon, Yewon Joung, and Sang Youl Lee. "On generating sets of Yoshikawa moves for marked graph diagrams of surface-links." Journal of Knot Theory and Its Ramifications 24, no. 04 (April 2015): 1550018. http://dx.doi.org/10.1142/s0218216515500182.

Full text

Abstract:

A marked graph diagram is a link diagram possibly with marked 4-valent vertices. S. J. Lomonaco, Jr. and K. Yoshikawa introduced a method of representing surface-links by marked graph diagrams. Specially, K. Yoshikawa suggested local moves on marked graph diagrams, nowadays called Yoshikawa moves. It is now known that two marked graph diagrams representing equivalent surface-links are related by a finite sequence of these Yoshikawa moves. In this paper, we provide some generating sets of Yoshikawa moves on marked graph diagrams representing unoriented surface-links, and also oriented surface-links. We also discuss independence of certain Yoshikawa moves from the other moves.

APA, Harvard, Vancouver, ISO, and other styles

16

Nayak, Ashalatha, and Debasis Samanta. "Synthesis of Test Scenarios Using UML Sequence Diagrams." ISRN Software Engineering 2012 (June 17, 2012): 1–22. http://dx.doi.org/10.5402/2012/324054.

Full text

Abstract:

UML 2.0 sequence diagrams are used to synthesize test scenarios. A UML 2.0 sequence diagram usually consists of a large number of different types of fragments and possibly with nesting. As a consequence, arriving at a comprehensive system behavior in the presence of multiple, nested fragment is a complex and challenging task. So far the test scenario synthesis from sequence diagrams is concerned, the major problem is to extract an arbitrary flow of control. In this regard, an approach is presented here to facilitate a simple representation of flow of controls and its subsequent use in the test scenario synthesis. Also, the flow of controls is simplified on the basis of UML 2.0 control primitives and brought to a testable form known as intermediate testable model (ITM). The proposed approach leads to the systematic interpretation of control flows and helps to generate test scenarios satisfying a set of coverage criteria. Moreover, the ability to support UML 2.0 models leads to increased levels of automation than the existing approaches.

APA, Harvard, Vancouver, ISO, and other styles

17

Dynnikov, Ivan, and Vera Sokolova. "Multiflypes of rectangular diagrams of links." Journal of Knot Theory and Its Ramifications 30, no. 06 (May 2021): 2150038. http://dx.doi.org/10.1142/s0218216521500383.

Full text

Abstract:

We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and are not obtained from one another by any sequence of “simpler” moves not increasing the complexity of the diagram along the way.

APA, Harvard, Vancouver, ISO, and other styles

18

Robinson, W. N., and H. G. Woo. "Finding Reusable UML Sequence Diagrams Automatically." IEEE Software 21, no. 05 (September 2004): 60–67. http://dx.doi.org/10.1109/ms.2004.1331304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Zhou, Hang, Weiren Sun, Yu Jiang, and Yi Zhu. "Polymorphism Testing Frameworks of Sequence Diagrams." Advanced Science Letters 6, no. 1 (March 15, 2012): 851–54. http://dx.doi.org/10.1166/asl.2012.2303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Grønmo, Roy, Ragnhild Kobro Runde, and Birger Møller-Pedersen. "Confluence of aspects for sequence diagrams." Software & Systems Modeling 12, no. 4 (September 8, 2011): 789–824. http://dx.doi.org/10.1007/s10270-011-0212-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Yusufu, Munina, Hai Jun Zhang, Gulina Yusufu, Zhan Dong Liu, Pen Cheng, and Dilidaer Dilisati. "Modeling and Analysis of Complex System with UML: A Case Study." Applied Mechanics and Materials 513-517 (February 2014): 1346–51. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1346.

Full text

Abstract:

The Unified Modeling Language - UML - is the most used specification language, and the way the world models not only application structure, behavior, and architecture, but also business process and data structure. In this paper, we aim to demonstrate a system development methodology by generating the UML diagrams from the requirements of the Automatic Banking Machine (ABM) System and discuss their relationships, differences and suitability. The high-level requirements of the system are specified by using use-case diagram, activity diagram, state chart diagram, collaboration diagram, sequence diagram, and component diagram, and the low-level requirements of each component using class diagrams. We briefly introduce each diagram, their usage, their advantages and some limitations, and then we discuss the relationships and differences between two or more diagrams, and suitability for modeling the different parts of the system.

APA, Harvard, Vancouver, ISO, and other styles

22

Sukamto, Sukamto, Roni Salambue, Elfizar Elfizar, and Anna Kaswari. "Pembuatan Aplikasi Portal Akademik Berbasis Mobile (Studi Kasus: D3 Manajemen Informatika FMIPA Universitas Riau)." Digital Zone: Jurnal Teknologi Informasi dan Komunikasi 8, no. 2 (November 16, 2017): 147–59. http://dx.doi.org/10.31849/digitalzone.v8i2.640.

Full text

Abstract:

Abstrak- Penelitian ini membahas tentang aplikasi portal akademik berbasis mobile, studi kasus pada D3 Manajemen Informatika Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau. Aplikasi ini dapat mempermudah mahasiswa khususnya mahasiswa D3 Manajemen Informatika dalam melakukan pengisian Kartu Rencana Studi dengan menggunakan Smartphone Android. Pembuatan Aplikasi mobile ini menggunakan bahasa pemograman Java dan MySQL sebagai database. Sedangkan dalam perancangan aplikasi menggunakan Unified Modeling Language (UML) yaitu Use Case Diagram, Class Diagram, Activity Diagram, dan Sequence Diagram. Kata kunci: Aplikasi Portal Akademik, Mobile, Kartu Rencana Studi, Smartphone Android. Abstract- This research discusses about Portal Academic Application based Android Mobile with case at Diploma of Information Management the Faculty of Mathematics and Natural Sciences, University of Riau. This application can facilitate in particular the Student Information Management Diploma in charging Card Study Plan that has been using smartphones based on Android. Making mobile applications using the programming language Java, and PHP, and then MySQL as database. While the design of the application using the Unified Modeling Language (UML), Use Case Diagrams, Class Diagrams, Activity Diagrams, and Sequence. Keywords: Portal Academic Application, Android Mobile, Study Plan Card, Android Smatrphone

APA, Harvard, Vancouver, ISO, and other styles

23

Frohman, Charles, and Joanna Kania-Bartoszynska. "Dehn’s algorithm for simple diagrams." Journal of Knot Theory and Its Ramifications 24, no. 14 (December 2015): 1550074. http://dx.doi.org/10.1142/s0218216515500741.

Full text

Abstract:

Dehn gave an algorithm for deciding if two cyclic words in the standard presentation of the fundamental group of a closed oriented surface of positive genus represent the same conjugacy class. A simple diagram on a surface is a disjoint union of simple closed curves none of which bound a disk. If [Formula: see text] is a once punctured closed surface of negative Euler characteristic, simple diagrams are classified up to isotopy by their geometric intersection numbers with the edges of an ideal triangulation of [Formula: see text]. Simple diagrams on the unpunctured surface [Formula: see text] can be represented by simple diagrams on [Formula: see text]. The weight of a simple diagram is the sum of its geometric intersection numbers with the edges of the triangulation. We show that you can pass from any representative to a least weight representative via a sequence of elementary moves, that monotonically decrease weights. This leads to a geometric analog of Dehn’s algorithm for simple diagrams.

APA, Harvard, Vancouver, ISO, and other styles

24

Rathee, Nisha, and Rajender Singh Chhillar. "Optimization of Favourable Test Path Sequences Using Bio-Inspired Natural River System Algorithm." Journal of Information Technology Research 14, no. 2 (April 2021): 85–105. http://dx.doi.org/10.4018/jitr.2021040105.

Full text

Abstract:

Testing of software requires a great amount of time and effort. The tester's main aim is to design optimized test sequences with a minimum amount of time, effort, and with less redundancy. Testers have used artificial intelligence meta-heuristic algorithms for optimization of test sequences. The model-driven approach is helpful in the generation of test sequences at early designing phase only. The model-driven approach uses UML diagram to represent the system's behavior and design test cases for the system at design stage of software development life cycle. The proposed approach uses natural river system for optimizing favourable non-redundant test path sequences using UML activity diagrams and sequence diagrams. The implementation of proposed approach has been done using python and results show that the proposed approach provides full coverage of test paths with less redundant test nodes compared to other meta heuristic algorithms.

APA, Harvard, Vancouver, ISO, and other styles

25

KONG, JUN, DIANXIANG XU, and XIAOQIN ZENG. "UML-BASED MODELING AND ANALYSIS OF SECURITY THREATS." International Journal of Software Engineering and Knowledge Engineering 20, no. 06 (September 2010): 875–97. http://dx.doi.org/10.1142/s0218194010004980.

Full text

Abstract:

Poor design has been a major source of software security problems. Rigorous and designer-friendly methodologies for modeling and analyzing secure software are highly desirable. A formal method for software development, however, often suffers from a gap between the rigidity of the method and the informal nature of system requirements. To narrow this gap, this paper presents a UML-based framework for modeling and analyzing security threats (i.e. potential security attacks) rigorously and visually. We model the intended functions of a software application with UML statechart diagrams and the security threats with sequence diagrams, respectively. Statechart diagrams are automatically converted into a graph transformation system, which has a well-established theoretical foundation. Method invocations in a sequence diagram of a security threat are interpreted as a sequence of paired graph transformations. Therefore, the analysis of a security threat is conducted through simulating the state transitions from an initial state to a final state triggered by method invocations. In our approach, designers directly work with UML diagrams to visually model system behaviors and security threats while threats can still be rigorously analyzed based on graph transformation.

APA, Harvard, Vancouver, ISO, and other styles

26

Jeong, Myeong-Ju. "Reidemeister moves and parity polynomials of virtual knot diagrams." Journal of Knot Theory and Its Ramifications 26, no. 10 (September 2017): 1750051. http://dx.doi.org/10.1142/s0218216517500511.

Full text

Abstract:

When two virtual knot diagrams are virtually isotopic, there is a sequence of Reidemeister moves and virtual moves relating them. I introduced a polynomial [Formula: see text] of a virtual knot diagram [Formula: see text] and gave lower bounds for the number of Reidemeister moves in deformation of virtually isotopic knot diagrams by using [Formula: see text]. In this paper, I introduce bridge diagrams and polynomials of virtual knot diagrams based on parity of crossings, and show that the polynomials give lower bounds for the number of the third Reidemeister moves. I give an example which shows that the result is distinguished from that obtained from [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

27

Brosch, Petra, Martina Seidl, and Magdalena Widl. "Semantics-Aware Versioning Challenge: Merging Sequence Diagrams along with State Machine Diagrams." Softwaretechnik-Trends 33, no. 2 (May 2013): 84–86. http://dx.doi.org/10.1007/s40568-013-0058-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Clikeman, Miles, Rachel Morris, and Heather M. Russell. "Ineffective sets and the region crossing change operation." Journal of Knot Theory and Its Ramifications 29, no. 03 (February 25, 2020): 2050010. http://dx.doi.org/10.1142/s0218216520500108.

Full text

Abstract:

Region crossing change (RCC) is an operation on link diagrams in which all crossings incident to a selected region are changed. Two diagrams are called RCC-equivalent if one can be transformed to the other via a sequence of RCCs. RCC is an unknotting operation but not an unlinking operation. A set of regions of a diagram is called ineffective if RCCs at every region in that set have no net effect on the crossings of the diagram. The main result of this paper is a construction of the complete collection of ineffective sets for any link diagram. This involves a combination of linear algebraic and diagrammatic techniques including a generalization of checkerboard shading called tricoloring. Using this construction of ineffective sets, we provide sharp upper bounds on the maximum number of RCCs needed to transform between RCC-equivalent knot diagrams and reduced 2- and 3-component link diagrams with fixed underlying projections.

APA, Harvard, Vancouver, ISO, and other styles

29

MIYAZAKI, Hisashi, Tomoyuki YOKOGAWA, Sousuke AMASAKI, Kazuma ASADA, and Yoichiro SATO. "Synthesis and Refinement Check of Sequence Diagrams." IEICE Transactions on Information and Systems E95.D, no. 9 (2012): 2193–201. http://dx.doi.org/10.1587/transinf.e95.d.2193.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Tsiolakis, Aliki. "Integrating Model Information in UML Sequence Diagrams." Electronic Notes in Theoretical Computer Science 50, no. 3 (August 2001): 266–74. http://dx.doi.org/10.1016/s1571-0661(04)00178-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Dye, Thomas S., and Caitlin E. Buck. "Archaeological sequence diagrams and Bayesian chronological models." Journal of Archaeological Science 63 (November 2015): 84–93. http://dx.doi.org/10.1016/j.jas.2015.08.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Mitchell, B. "Characterizing Communication Channel Deadlocks in Sequence Diagrams." IEEE Transactions on Software Engineering 34, no. 3 (May 2008): 305–20. http://dx.doi.org/10.1109/tse.2008.28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Almendros-Jimenez, J. M., and L. Iribarne. "Describing Use-Case Relationships with Sequence Diagrams." Computer Journal 50, no. 1 (October 16, 2006): 116–28. http://dx.doi.org/10.1093/comjnl/bxl053.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Haugen, Øystein, Knut Eilif Husa, Ragnhild Kobro Runde, and Ketil Stølen. "STAIRS towards formal design with sequence diagrams." Software & Systems Modeling 4, no. 4 (October 28, 2005): 355–57. http://dx.doi.org/10.1007/s10270-005-0087-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Ebad, Shouki A., and Moataz A. Ahmed. "Functionality-based software packaging using sequence diagrams." Software Quality Journal 23, no. 3 (July 8, 2014): 453–81. http://dx.doi.org/10.1007/s11219-014-9245-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Cavarra, Alessandra, and Juliana Küster-Filipe. "Combining Sequence Diagrams and OCL for Liveness." Electronic Notes in Theoretical Computer Science 115 (January 2005): 19–38. http://dx.doi.org/10.1016/j.entcs.2004.09.025.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Niebrzydowski, Maciej. "Categories of diagrams with irreversible moves." Journal of Knot Theory and Its Ramifications 27, no. 03 (March 2018): 1840006. http://dx.doi.org/10.1142/s0218216518400060.

Full text

Abstract:

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition regarding the existence of certain morphisms in an associated category is satisfied for every move of the sequence. This conditional setting leads to a possibility of irreversible moves, terminal states, and to using functors more general than the ones used as knot invariants. Our main focus is the category of diagrams with a binary relation on the set of arcs, indicating which arc can move over another arc. We define homology of binary relations, and merge it with quandle homology, to obtain the homology for partial quandles with a binary relation. This last homology can be used to analyze link diagrams with a binary relation on the set of components.

APA, Harvard, Vancouver, ISO, and other styles

38

Jeong, Myeong-Ju. "Reidemeister moves and a polynomial of virtual knot diagrams." Journal of Knot Theory and Its Ramifications 24, no. 02 (February 2015): 1550010. http://dx.doi.org/10.1142/s0218216515500108.

Full text

Abstract:

In 2006 C. Hayashi gave a lower bound for the number of Reidemeister moves in deformation of two equivalent knot diagrams by using writhe and cowrithe. It can be naturally extended for two virtually isotopic virtual knot diagrams. We introduce a polynomial qK(t) of a virtual knot diagram K and give lower bounds for the number of Reidemeister moves in deformation of two virtually isotopic knots by using qK(t). We give an example which shows that the polynomial qK(t) is useful to map out a sequence of Reidemeister moves to deform a virtual knot diagram to another virtually isotopic one.

APA, Harvard, Vancouver, ISO, and other styles

39

Sundheim, Paul A. "Reidemeister's theorem for 3-manifolds." Mathematical Proceedings of the Cambridge Philosophical Society 110, no. 2 (September 1991): 281–92. http://dx.doi.org/10.1017/s0305004100070353.

Full text

Abstract:

The Reidemeister theorem describes the equivalence of links in terms of diagrams (this theorem was proven in detail by Alexander [1]). A diagram for a link in S3 can be found by projecting the link to any disc recording the over or under crossings. It was shown that two links are equivalent if and only if their diagrams are related by a sequence of so called Reidemeister moves and isotopy in the disc.

APA, Harvard, Vancouver, ISO, and other styles

40

YAMATO, Kohei, Hiroaki KATO, Tetsuo KATSURAGI, and Yoshimasa TAKAHASHI. "The Multiple Representation of Protein Sequence MotifsUsing Sequence Binary Decision Diagrams." Journal of Computer Chemistry, Japan 19, no. 1 (2020): 8–17. http://dx.doi.org/10.2477/jccj.2019-0028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Qian, Hui. "Optimization of Intelligent Management and Monitoring System of Sports Training Hall Based on Internet of Things." Wireless Communications and Mobile Computing 2021 (July 6, 2021): 1–11. http://dx.doi.org/10.1155/2021/1465748.

Full text

Abstract:

This paper provides an indepth analysis and research on the intelligent management and monitoring system of sports training hall through the Internet of Things. Firstly, it introduces the project background of the sports training base stadium service system, analyses the significance of the system development, and describes the related technology and the method of development. The paper then analyses the requirements of the management business of the system and describes the main business processes of the system with activity diagrams; the paper then analyses the functional requirements and data requirements of the system and describes the system with use case diagrams and thumbnail class diagrams, respectively. Based on this, the thesis designs the overall aspect of the system, giving the corresponding total package diagram, and designs all functions one by one, giving the corresponding class diagram, the corresponding sequence diagram, and the corresponding processing flow diagram. The thesis gives the design of database tables by designing entity property diagrams and entity-to-entity relationship diagrams according to the data requirements and system functions. Finally, the research of the thesis is summarized accordingly, stating what has been done, what results have been achieved, what problems still exist, and what further work needs to be done to make the outlook of the work.

APA, Harvard, Vancouver, ISO, and other styles

42

DJIDJEV, HRISTO N., and ANDRZEJ LINGAS. "ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS." International Journal of Computational Geometry & Applications 05, no. 03 (September 1995): 327–37. http://dx.doi.org/10.1142/s0218195995000192.

Full text

Abstract:

We show that the Voronoi diagram of a finite sequence of points in the plane which gives sorted order of the points with respect to two perpendicular directions can be computed in linear time. In contrast, we observe that the problem of computing the Voronoi diagram of a finite sequence of points in the plane which gives the sorted order of the points with respect to a single direction requires Ω(n log n) operations in the algebraic decision tree model. As a corollary from the first result, we show that the bounded Voronoi diagrams of simple n-vertex polygons which can be efficiently cut into the so called monotone histograms can be computed in o(n log n) time.

APA, Harvard, Vancouver, ISO, and other styles

43

Im, Young Ho, and Sera Kim. "A sequence of polynomial invariants for Gauss diagrams." Journal of Knot Theory and Its Ramifications 26, no. 07 (March 21, 2017): 1750039. http://dx.doi.org/10.1142/s0218216517500390.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

LIU, DONGLUN, STEVEN MACKEY, NEIL R. NICHOLSON, TYLER SCHROEDER, and KYLE THOMAS. "AVERAGE BRIDGE NUMBER OF SHADOW RESOLUTIONS." Journal of Knot Theory and Its Ramifications 22, no. 10 (September 2013): 1350064. http://dx.doi.org/10.1142/s0218216513500648.

Full text

Abstract:

A Gauss code for a virtual knot diagram is a sequence of crossing labels, each repeated twice and assigned a + or - symbol to identify over and undercrossings. Eliminate these symbols and what remains is a Gauss code for the shadow of the diagram, one type of virtual pseudodiagram. While it is now impossible to determine which particular virtual diagram the shadow resulted from, we can consider the collection of all diagrams, called resolutions of the shadow, that would yield such a code. We compute the average virtual bridge number over all these diagrams and show that for a shadow with n classical precrossings, the average virtual bridge number is [Formula: see text].

APA, Harvard, Vancouver, ISO, and other styles

45

TIMÁR, ÁDÁM. "Approximating Cayley Diagrams Versus Cayley Graphs." Combinatorics, Probability and Computing 21, no. 4 (January 4, 2012): 635–41. http://dx.doi.org/10.1017/s0963548311000733.

Full text

Abstract:

We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that converge to the same limit, and such that a Hamiltonian cycle in one of them has a limit that is not approximable by any subgraph of the other. We give an example where this holds, but convergence is meant in a stronger sense. This is related to whether having a Hamiltonian cycle is a testable graph property.

APA, Harvard, Vancouver, ISO, and other styles

46

Plavsic, Vera, and Emil Secerov. "Modeling of login procedure for wireless application with interaction overview diagrams." Computer Science and Information Systems 5, no. 1 (2008): 87–108. http://dx.doi.org/10.2298/csis0801087p.

Full text

Abstract:

In this paper we describe in details UML modeling of login procedure, which is a part of UserBarCodeReader application, developed for large stores and intended for use as a customer support during the shopping session. Login procedure is realized within access control system, in this case over a wireless network. Paper gives the whole modeling and implementation cycle of login procedure, from Use Case diagrams to the Java source code. Login procedure is modeled using interaction overview diagram, new in UML 2.0 which gives concise representation and divides complex sequence diagram into several smaller. The link between these diagrams is modeled with OCL postcondition and precondition expressions.

APA, Harvard, Vancouver, ISO, and other styles

47

JABŁONOWSKI, M. "KNOTTED SURFACES AND EQUIVALENCIES OF THEIR DIAGRAMS WITHOUT TRIPLE POINTS." Journal of Knot Theory and Its Ramifications 21, no. 03 (March 2012): 1250019. http://dx.doi.org/10.1142/s0218216511009790.

Full text

Abstract:

The singularity set of a generic standard projection to the three space of a closed surface linked in four space, consists of at most three types: double points, triple points or branch points. We say that this generic projection image is p-diagram if it does not contain any triple point. Two p-diagrams of equivalent surface links are called p-equivalent if there exist a finite sequence of local moves, such that each of them is one of the four moves taken from the seven on the well known Roseman list, that connects only p-diagrams. It is natural to ask that whether any of two p-diagrams of equivalent surface links always p-equivalent? We introduce an invariant of p-equivalent diagrams and an example of linked surfaces that answers our question negatively.

APA, Harvard, Vancouver, ISO, and other styles

48

Kerr, Deirdre. "Visualizing Changes in Strategy Use across Attempts via State Diagrams: A Case Study." International Journal of Computer Games Technology 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/8492312.

Full text

Abstract:

Game log data have great potential to provide actionable information about the in-game behavior of players. However, these low-level behavioral data are notoriously difficult to analyze due to the challenges associated with extracting meaning from sparse data stored at such a small grain size. This paper describes a three-step solution that uses cluster analysis to determine which strategies players use to solve levels in the game, sequence mining to identify changes in strategy across multiple attempts at the same level, and state transition diagrams to visualize the strategy sequences identified by the sequence mining. In the educational video game used in this case study, cluster analysis successfully identified 15 different in-game strategies. The sequence mining found an average of 40 different sequences of strategy use per level, which the state transition diagrams successfully displayed in an interpretable way.

APA, Harvard, Vancouver, ISO, and other styles

49

Oshiro, Kanako, Ayaka Shimizu, and Yoshiro Yaguchi. "Up–down colorings of virtual-link diagrams and the necessity of Reidemeister moves of type II." Journal of Knot Theory and Its Ramifications 26, no. 12 (October 2017): 1750073. http://dx.doi.org/10.1142/s0218216517500730.

Full text

Abstract:

We introduce an up–down coloring of a virtual-link (or classical-link) diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two [Formula: see text]-component virtual-link (or classical-link) diagrams. By using the notion of a quandle cocycle invariant, we give a method to detect the necessity of Reidemeister moves of type II between two given virtual-knot (or classical-knot) diagrams. As an application, we show that for any virtual-knot diagram [Formula: see text], there exists a diagram [Formula: see text] representing the same virtual-knot such that any sequence of generalized Reidemeister moves between them includes at least one Reidemeister move of type II.

APA, Harvard, Vancouver, ISO, and other styles

50

Eryshev, Vladimir, Nickolay Karpenko, and Artur Zhemchuyev. "INTEGRAL PARAMETERS OF CONCRETE DIAGRAMS FOR CALCULATIONS OF STRENGTH OF REINFORCED CONCRETE ELEMENTS USING THE DEFORMATION MODEL." International Journal for Computational Civil and Structural Engineering 16, no. 1 (March 24, 2020): 25–37. http://dx.doi.org/10.22337/2587-9618-2020-16-1-25-37.

Full text

Abstract:

In accordance with the requirements of regulatory documents, restrictions are introduced on stress levels at the end of the falling branch of the diagrams at the maximum normalized strain values. We have developed mathematical models that establish a uniform sequence for calculating the unambiguous values of deformations at the base points of concrete diagrams, taking into account the accepted functional relationships and the rules for their use according to the tables of normative documents. It was shown that for equal values of deformations and stresses at base points, analytical expressions of diagram recommended by regulatory documents, even if it differs in structure, give identical outlines, diagram branches coincide. The correlation between the calculation models by Russian and foreign regulatory documents was established by comparing the values of the integral parameters of the diagrams and the ultimate forces obtained by calculating the reinforced concrete element according to the deformation model. As integral parameters of concrete deformation diagrams, it was recommended to use areas bounded by diagram branches and diagram completeness coefficients. Analytical modeling of integral parameters allowed us to exclude the procedure for numerically summing stresses along elementary strips in a section and solving nonlinear equations by the method of successive approximations when calculating the strength of an element.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!