Filters








2,785 Hits in 7.1 sec

Constraint-based automatic symmetry detection

Shao Jie Zhang, Jun Sun, Chengnian Sun, Yang Liu, Junwei Ma, Jin Song Dong
2013 2013 28th IEEE/ACM International Conference on Automated Software Engineering (ASE)  
We present an automatic approach to detecting symmetry relations for general concurrent models.  ...  To the best of our knowledge, our method is the first approach that can automatically detect both process and data symmetries as demonstrated via a number of systems.  ...  Acknowledgements We thank the anonymous reviewers for their invaluable comments.  ... 
doi:10.1109/ase.2013.6693062 dblp:conf/kbse/Zhang0SLMD13 fatcat:qkmutrv5q5anvpf2i55cyr7lwa

Information dissemination in VANETs based upon a tree topology

Patricia Ruiz, Bernabé Dorronsoro, Pascal Bouvry, Lorenzo Tardón
2012 Ad hoc networks  
We first assess the feasibility of relying on a tree-based topology management structure for mobile ad hoc networks and in particular for VANETs.  ...  Next, we enhance DAGRS, an existing decentralized model for enabling distributed tree management and build BODYF on it, an efficient broadcast algorithm.  ...  The same procedure starts again in step 8 in order to merge other nodes into one single tree. The token is traversing the tree following a Depth First Search (DFS).  ... 
doi:10.1016/j.adhoc.2011.06.005 fatcat:vyewg5347bcpnm3vj5t3rwqhj4

Silent self-stabilizing scheme for spanning-tree-like constructions

Stéphane Devismes, David Ilcinkas, Colette Johnen
2019 Proceedings of the 20th International Conference on Distributed Computing and Networking - ICDCN '19  
Scheme is self-stabilizing and silent and, despite its generality, is also efficient.  ...  Among the vast self-stabilizing literature, many works (see [2] for a survey) focus on spanning-tree-like constructions, i.e. constructions of specific distributed spanning tree-or forest-shaped data structures  ...  DFS token circulations given in [37, 38] execute each wave in O(n) rounds and O(n 2 ) steps using O(n · log n) space per process for the former, and O(n 3 ) rounds and O(n 3 ) steps using O(log n) space  ... 
doi:10.1145/3288599.3288607 dblp:conf/icdcn/DevismesIJ19 fatcat:ykapos56cnhbjfifyukdj53gbu

The expressive power of snap-stabilization

Alain Cournier, Ajoy K. Datta, Stéphane Devismes, Franck Petit, Vincent Villain
2016 Theoretical Computer Science  
Most notably, numerous papers on snapstabilization deal with the Propagation of Information with Feedback (PIF) and depth-first token circulation problems.  ...  Let A self (resp., A snap ) be a self-stabilizing (resp., snap-stabilizing) algorithm for detecting the termination of some distributed algorithm X . Let p be any process.  ...  For example, the depth-first token circulation can be seen as successive depth-first traversals of the network, each of them starts upon receiving an external request.  ... 
doi:10.1016/j.tcs.2016.01.036 fatcat:hrcwmxhq4rfb3h4ofbbcj4omjy

Transformers in Vision: A Survey [article]

Salman Khan, Muzammal Naseer, Munawar Hayat, Syed Waqas Zamir, Fahad Shahbaz Khan, Mubarak Shah
2021 arXiv   pre-print
Different from convolutional networks, Transformers require minimal inductive biases for their design and are naturally suited as set-functions.  ...  We start with an introduction to fundamental concepts behind the success of Transformers i.e., self-attention, large-scale pre-training, and bidirectional encoding.  ...  We would also like to thank Mohamed Afham for his help with a figure.  ... 
arXiv:2101.01169v4 fatcat:ynsnfuuaize37jlvhsdki54cy4

Evolution Theory of the Utilization Breadth and Depth Space of Human Development Resources (English Version)

YI-MING CAI
2018 DEStech Transactions on Engineering and Technology Research  
Firstly, the division of breadth space resources and depth space resources and their time concepts are elaborated.  ...  The history and further of utilization of breadth space resources and depth space resources are divided into six parts: the history and future of breadth space resources utilization are divided into three  ...  Jianhua Xu who did final proofreading for this paper.  ... 
doi:10.12783/dtetr/ecame2017/18491 fatcat:nkoeqzw6afdu7kdemszgo7wgha

Research on Emergency Logistics Model of Agricultural Products Based on Coupling of Petri Net and Blockchain

Huimin Ge, Haisheng Liu, Rui Wang, Shuai Zhu, Linbei Shao
2021 Promet (Zagreb)  
It is hoped that this study can provide a reference direction for agricultural emergency logistics.  ...  This paper first shows the operation mechanism of the petri dish network and blockchain coupling in the form of a graph and then uses the culture network modelling and simulation tool PIPE to directly  ...  coefficient space.  ... 
doi:10.7307/ptt.v33i6.3845 fatcat:pryoifuezvfkjckye4rye2pw24

Virtual Multicast [chapter]

Petr Holub, Eva Hladk
2010 Trends in Telecommunications Technologies  
The mechanism is called Fast Circulating Token (FCT) since the token is not held for the entire time period of data sending as usual in the token ring networks.  ...  We can see that the network-centric approach is highly efficient, but very slow in adopting new features and rather unfriendly to users.  ...  The book also contains chapters that deal with transport issues, and namely protocols and policies for efficient and guaranteed transmission characteristics while transferring demanding data applications  ... 
doi:10.5772/8498 fatcat:xjnj6toatzcf7fipnkhtvlpwgu

Knowledge Discovery in Cryptocurrency Transactions: A Survey

Xiao Fan Liu, Xin-Jian Jiang, Si-Hao Liu, Chi Kong Tse
2021 IEEE Access  
Finally, we outline several gaps and trends for future investigation in this research area.  ...  For each aspect, we present the problems, summarize the methodologies, and discuss major findings in the literature.  ...  ERC20 and ERC777 tokens are fungible, which means that each token can have a certain amount of distribution, and proportions of the whole amount can circulate among blockchain addresses independently.  ... 
doi:10.1109/access.2021.3062652 fatcat:6nlq3wv4kbg53leejeby4iyxty

Performance Evaluation and Design Trade-Offs for Network-on-Chip Interconnect Architectures

P.P. Pande, C. Grecu, M. Jones, A. Ivanov, R. Saleh
2005 IEEE transactions on computers  
To the best of our knowledge, this is the first effort in characterizing different NoC architectures with respect to their performance and design trade-offs.  ...  Multiprocessor system-on-chip (MP-SoC) platforms are emerging as an important trend for SoC design.  ...  ACKNOWLEDGMENTS The authors thank Micronet, PMC-Sierra, Gennum, and NSERC for their financial support and the CMC for providing access to CAD tools.  ... 
doi:10.1109/tc.2005.134 fatcat:xl2pkf22hvfvxpjggxdmtjrkr4

Optimizing global food supply chains: The case for blockchain and GSI standards [chapter]

John G. Keogh, Abderahman Rejeb, Nida Khan, Kevin Dean, Karen J. Hand
2020 Building the Future of Food Safety Technology  
Satoshi's blockchain was the first credible decentralized solution.  ...  Bitcoin as an application can be described as a first-to-file system: if one entity has 50 BTC, and simultaneously sends the same 50 BTC to A and to B, only the transaction that gets confirmed first will  ...  The approach may seem highly inefficient at first glance, because it needs to store the entire state with each block, but in reality efficiency should be comparable to that of Bitcoin.  ... 
doi:10.1016/b978-0-12-818956-6.00017-8 fatcat:ngqmqkmemjgkzerieqq3m3e5dq

The use of computational intelligence in intrusion detection systems: A review

Shelly Xiaonan Wu, Wolfgang Banzhaf
2010 Applied Soft Computing  
The findings of this review should provide useful insights into the current IDS literature and be a good source for anyone who is interested in the application of CI approaches to IDSs or related fields  ...  space, while no detectors may fit in the small area of non-self space, especially near the boundary between self and non-self.  ...  Diversity is necessary for ENSA because a set of solutions (detectors) collectively solves the problem (covering non-self space).  ... 
doi:10.1016/j.asoc.2009.06.019 fatcat:5ntbfbejrveyzhmmelfh34qkiy

Self-Stabilizing Distributed Cooperative Reset

Stephane Devismes, Colette Johnen
2019 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)  
Our reset algorithm allows to build efficient self-stabilizing solutions for various problems and settings. In particular, it applies to both static and dynamic specifications.  ...  As a matter of fact, we show that it applies to both static and dynamic specifications since we propose efficient self-stabilizing reset-based algorithms for the (1minimal) (f, g)-alliance (a generalization  ...  Selfstabilizing solutions have been proposed for many kinds of classical distributed problems, e.g., token circulation [34] , spanning tree construction [17] , clustering [14] , routing [27] , propagation  ... 
doi:10.1109/icdcs.2019.00045 dblp:conf/icdcs/DevismesJ19 fatcat:ysqlfy43xfdqldkmpyogehk4d4

Knowledge Discovery in Cryptocurrency Transactions: A Survey [article]

Xiao Fan Liu, Xin-Jian Jiang, Si-Hao Liu, Chi Kong Tse
2020 arXiv   pre-print
For each aspect, we present the problems, summarize the methodologies, and discuss major findings in the literature.  ...  ERC20 and ERC777 tokens are fungible, which means that each token can have a certain amount of distribution, and proportions of the whole amount can circulate among blockchain addresses independently.  ...  ., sending out tokens to investors for free, to gain awareness of their projects. Secondary market. Bitcoin was first publicly traded in online cryptocurrency exchanges in 2010.  ... 
arXiv:2010.01031v1 fatcat:igu5z2eftveenoxtjhjeczzw5a

Finding Structure in Dynamic Networks [article]

Arnaud Casteigts
2018 arXiv   pre-print
This document is the first part of the author's habilitation thesis (HDR), defended on June 4, 2018 at the University of Bordeaux.  ...  We hope they can serve as a broad introduction to the domain of highly dynamic networks, with a focus on temporal graph concepts and their interaction with distributed computing.  ...  The circulation of the token flips the direction of relations in the tree, so that the node having the token is always the root of its tree, and the tree is correctly rooted (all relations point towards  ... 
arXiv:1807.07801v1 fatcat:oh6e4eqhqbh3vabyqejptfz6cy
« Previous Showing results 1 — 15 out of 2,785 results