The k differences approximate string matching problem specifies a text string of length n, a pattern string of length m, the number k of differences (insertions, deletions, substitutions) allowed in a match, and asks for every location in the text where a match occurs. Previous algorithms require at least O(nk) time. When k is as large as a fraction of m, no substantial progress has been made o...

Timed automata are a simple natural model of computation for the specification of timed behaviors [1]. They are finite automata extended with clocks, i.e. real-valued variables that increase with the passage of time. Timed automata have been used in a wide range of applications where real-time aspects of computation is important, and they are supported by a variety of efficient tools and model-...

Delay Tolerant Networks (DTNs) are wireless networks in which end-to-end connectivity is sporadic. Routing in DTNs uses past connectivity information to predict future node meeting opportunities. Recent research efforts consider the use of social network analysis (i.e., node communities, centralities etc.) for this forecast. However, most of these works focus on unicast. We believe that group c...

In Mobile IP, whether mobile nodes are moving or not, lots of messages have to be exchanged for various purposes. The frequent exchange of messages incurs overhead in several ways, especially in terms of energy use in mobile node. Of course, if fewer messages are delivered, issues related with authorization may become problematic. To deal with this situation properly, we propose new profile-bas...

In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respectively, the expected time to reach a target. These games are concurrent since at each step of the game both players choose a timed move (a time delay and action under their control), and the transition of the game is ...

In the classic asynchronous Byzantine agreement problem, communication is via asynchronous message-passing and the adversary is adaptive with full information. In particular, the adversary can adaptively determine which processors to corrupt and what strategy these processors should use as the algorithm proceeds; the scheduling of the delivery of messages is set by the adversary, so that the de...

We examine several (dynamic) graph and set intersection problems in the word-RAM model with word size w. We begin with Dynamic Connectivity where we need to maintain a fully dynamic graph G = (V,E) with n = |V | vertices while supporting (s, t)-connectivity queries. To do this, we provide a new simplified worst-case solution for the famous Dynamic Connectivity (which is interesting on its own m...

The aim of the present study was to investigate the relationship between perception of time and expected anxiety as well as perception of time and fear and hope in pregnant women and their partners. The population was all pregnant women and their partners who had visited a gynecologist in the city of Karaj, in Iran at 2015-2016. From this population, 120 participants (60 couples) were selected ...

Games of incomplete information, or Bayesian games, are an important gametheoretic model and have many applications in economics. We propose Bayesian action-graph games (BAGGs), a novel graphical representation for Bayesian games. BAGGs can represent arbitrary Bayesian games, and furthermore can compactly express Bayesian games exhibiting commonly encountered types of structure including symmet...