Filters








219,471 Hits in 2.7 sec

Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise

Jialing Liu, V. Yadav, H. Sehgal, J.M. Olson, Haifeng Liu, N. Elia
2008 IEEE Transactions on Automatic Control  
We propose a simple discrete-time model in which a group of non-mobile agents form either a fixed connected graph or a random graph process, and each agent, taking bipolar value either +1 or -1, updates  ...  The phase transition occurs for any dimension. Finally, we demonstrate the phase transition behavior and all analytic results using simulations.  ...  Second, the phase transition on a random graph is also simpler than the phase transition on a random graph observed in [2] .  ... 
doi:10.1109/tac.2008.929382 fatcat:7p6oq3uqcjbqzivfht2ceiw63i

Automatic construction of a minimum size motion graph

Liming Zhao, Aline Normoyle, Sanjeev Khanna, Alla Safonova
2009 Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation - SCA '09  
The performance of motion graph based approaches, however, relies heavily on selecting a good set of motions used to build the graph.  ...  Our approach especially benefits novice users who desire simple and fully automatic motion synthesis tools, such as motion graph-based techniques.  ...  The BestOrder will be computed based on the transition quality instead of the transition length.  ... 
doi:10.1145/1599470.1599474 dblp:conf/sca/ZhaoNKS09 fatcat:pbtwahowbffknaan7skx2yj6cy

Automatic segmentation of salient objects using iterative reversible graph cut

Chanho Jung, Beomjoon Kim, Changick Kim
2010 2010 IEEE International Conference on Multimedia and Expo  
An iterative reversible graph cut method is introduced to overcome the problem inherent in the saliency-based seed extraction method.  ...  In the iterative self-adaptive framework, bidirectional state transitions are iteratively involved to reduce the misclassified pixels.  ...  In the graph cut algorithms, hard constraints are imposed Automatic seed extraction using saliency detection: (a) input images, (b) saliency maps [6] , and (c) automatically extracted seeds based on the  ... 
doi:10.1109/icme.2010.5582577 dblp:conf/icmcs/JungKK10 fatcat:ozy36fyol5eujo7qel2qgysgam

Snap-together motion

Michael Gleicher, Hyun Joon Shin, Lucas Kovar, Andrew Jepsen
2003 ACM Transactions on Graphics  
The key difference is that our graphs are constructed opportunistically based on a provided data corpus and some user guidance on how to form a usable graph.  ...  The result is a simple graph structure that allows clips to be connected into longer motions. All transition generation and cleanup operations are performed automatically by our system.  ...  The key difference is that our graphs are constructed opportunistically based on a provided data corpus and some user guidance on how to form a usable graph.  ... 
doi:10.1145/882262.882333 fatcat:wv5h4obtunfntdjtpbauars66a

A Graphical Environment For Petri Nets Ina Tool Based On Meta-Modelling And Graph Grammars

Raida El Mansouri, Elhillali Kerkouche, Allaoua Chaoui
2008 Zenodo  
In this paper, we propose an approach based on the combined use of Meta-modelling and Graph Grammars to automatically generate a visual modelling tool for INA for analysis purposes.  ...  We have also proposed a graph grammar to automatically generate INA description of the graphically specified Petri net models.  ...  Rule4: genTC(priority 4): is applied to generate the appropriate Maude syntax depending on the TC of the transition, and mark the transition as visited.  ... 
doi:10.5281/zenodo.1074810 fatcat:abo54vwq5rdabotyzjjfofgm5i

Interactive 3D Animation Creation and Viewing System based on Motion Graph and Pose Estimation Method

Masayuki Furukawa, Yasuhiro Akagi, Yukiko Kawai, Hiroshi Kawasaki
2014 Proceedings of the ACM International Conference on Multimedia - MM '14  
The data of skeleton models of human motion estimated by Kinect is processed to generate Motion Graph and finally restructure the data automatically for 3D character models.  ...  ., in the field of such as education, medicine and so on, we propose a system using Kinect.  ...  Automatic Motion Graph creation Motion Graph is created by self-loop and transition edge. Figure 3 shows the examples of detected self-loop and transitionedge on captured sequences.  ... 
doi:10.1145/2647868.2655055 dblp:conf/mm/FurukawaAKK14 fatcat:vniolzcbtraxbfgkqgkblfmk6q

Cool: A control-flow generator for system analysis [chapter]

Volker Braun, Jens Knoop, Dirk Koschützki
1998 Lecture Notes in Computer Science  
It uniformly supports the automatic generation of transition systems and flow graphs from process algebra terms and programs of programming languages.  ...  Basically, it relies on "unrolling" its argument according to transition rules resembling structural operational semantic rules.  ...  The windows on the right complement this presentation by showing the flow graphs generated by Cool for the program displayed in the central window by feeding its output into the automatical graph-layout  ... 
doi:10.1007/bfb0026442 fatcat:nnuxqtmp45hrpgoiksmasbyieq

A State-Space Based Model-Checking Framework for Embedded System Controllers Specified Using IOPT Petri Nets [chapter]

Fernando Pereira, Filipe Moutinho, Luís Gomes
2012 IFIP Advances in Information and Communication Technology  
The framework is composed of an automatic software code generator, a state-space generator and a query engine, used to define queries applied to the resulting state-space graphs.  ...  state-space generation, the tools collect information required to enable the efficient implementation of hardware/software controllers, including place bounds, deadlocks and conflicts between concurrent transitions  ...  The graph displays no deadlocks and one node painted with magenta denotes a conflict, which will be later solved with different transition priorities.  ... 
doi:10.1007/978-3-642-28255-3_14 fatcat:u6bli4glrjeenfih2ejlowcgge

Extenics-based Test Case Generation for UML Activity Diagram

Liping Li, Xingsen Li, Tao He, Jie Xiong
2013 Procedia Computer Science  
This paper for the first time combines software testing with Extenices and proposes an automatic approach to generating test cases from UML activity diagrams based on Extension Theory (Extenics).  ...  In order to find more defects in software system by minimized test cases, we design algorithm to construct the Euler circuit and generates test sequences automatically by Euler circuit algorithm.  ...  After step 3, the graph can be covered by one path.  ... 
doi:10.1016/j.procs.2013.05.151 fatcat:ilb3hisuy5dztl5jzfr72pnkxi

Specifying behavioral semantics of UML diagrams through graph transformations

Jun Kong, Kang Zhang, Jing Dong, Dianxiang Xu
2009 Journal of Systems and Software  
Based on the graph grammar, the execution of a set of non-conflict state transitions is interpreted by a sequence of graph transformations.  ...  In our approach, a graph grammar is derived automatically from a state machine to summarize the hierarchy of states.  ...  Based on the automatically derived graph grammar and a set of algebraic structures, Figs. 19-22 give the details of executing a state transition.  ... 
doi:10.1016/j.jss.2008.06.030 fatcat:7xis77mmyfah7galnilflg3ywq

Partitioning and optimizing controllers synthesized from hierarchical high-level descriptions

Andrew Seawright, Wolfgang Meyer
1998 Proceedings of the 35th annual conference on Design automation conference - DAC '98  
This method is based on the observation that the re-encoding of state graphs is effective for state graphs below a certain size.  ...  However, the number of states in the pruned state graph is just n, as only one register in X M can be set at a time based on the sequential behavior of the input start.  ... 
doi:10.1145/277044.277239 dblp:conf/dac/SeawrightM98 fatcat:f2zg4dbxrrbtjio57vqorkjiku

The synthesis of Petri nets from path-automatic specifications

E. Badouel, Ph. Darondeau
2004 Information and Computation  
Path-automatic specifications are rational presentations of sets of finite or infinite graphs. A specification is made of a regular set of paths and rational relations on this set.  ...  We show that it is decidable whether some model of a path-automatic specification may be realized by some finite Petri net with transitions in bijection with the specified actions.  ...  the rational relations used in path-automatic specifications to be asynchronous.  ... 
doi:10.1016/j.ic.2004.04.004 fatcat:hllpjgblkrc6hciai4v5ufyvvq

Isolated word recognition in the Sigma cognitive architecture

Himanshu Joshi, Paul S. Rosenbloom, Volkan Ustun
2014 Biologically Inspired Cognitive Architectures  
Figure 11 : Automatically generated conditional for processing the spectral observation. The Predict-Current-Phone predicate is automatically generated via diachronic processing.  ...  The Perception predicate is automatically generated for the perception function.  ...  The Transition predicate is automatically generated for the transition function. reinforcement learning and SLAM.  ... 
doi:10.1016/j.bica.2014.11.001 fatcat:6akpfnx3zbcf7nzwmgwniqifoa

Extending and enhancing GT-ITM

K. Calvert, J. Eagan, S. Merugu, A. Namjoshi, J. Stasko, E. Zegura
2003 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research - MoMeTools '03  
GT-ITM is a collection of software tools for creation, manipulation, and analysis of graph models of internet topology.  ...  This paper describes the features of a new release of GT-ITM, including enhanced visualization capabilities; a routing and forwarding module for use with large graphs; and support for modeling of interdomain  ...  The fully-automatic mode will construct the entire topology automatically, placing transit domains on a circle and fairly far apart from one another, then surrounding a transit domain with its associated  ... 
doi:10.1145/944777.944778 fatcat:hj5xwazi5ndilm5phmgpshejje

Extending and enhancing GT-ITM

K. Calvert, J. Eagan, S. Merugu, A. Namjoshi, J. Stasko, E. Zegura
2003 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research - MoMeTools '03  
GT-ITM is a collection of software tools for creation, manipulation, and analysis of graph models of internet topology.  ...  This paper describes the features of a new release of GT-ITM, including enhanced visualization capabilities; a routing and forwarding module for use with large graphs; and support for modeling of interdomain  ...  The fully-automatic mode will construct the entire topology automatically, placing transit domains on a circle and fairly far apart from one another, then surrounding a transit domain with its associated  ... 
doi:10.1145/944773.944778 fatcat:y4p4mwbepfbhvlneh5sm6cawke
« Previous Showing results 1 — 15 out of 219,471 results