In this paper, the relation between the Glushkov automaton (Apos) and the partial derivative automaton (Apd) of a given regular expression, in terms of transition complexity, is studied. The average transition complexity of Apos was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of Apos. Here ...

This paper examines the applicability of OSI conformance test methodology to Internet protocols. It summarizes the differences between them and introduces the Internet Reference Model along with a new abstract test method, which was designed for the practical purposes of conformance testing of TCP/IP protocols. Some interesting test cases and points, that were chosen from RIP, demonstrate the f...

SUMMARY Dynamic phasor modeling technique is mostly applied on power electronics devices. In this paper, application of the dynamic phasor modeling technique is extended to other major power system components. Starting from the detailed time-domain models, the dynamic phasor models for these components are derived and implemented. Further, an efficiency and accuracy comparison of the dynamic ph...

In this paper we investigate the relationship between capacity and network topology for Bluetooth scatternets. We start by considering the intrinsic capacity limits of a scatternet structure, and we show that capacity may be approached in the presence of very local traffic only and under specific conditions on the scatternet structure. A worst case analysis is presented, addressing the performa...

We investigate a non-cooperative game-theoretic model for the formation of communi-cation networks by selfish agents. Each agent aims for a central position at minimumcost for creating edges. In particular, the general model (Fabrikant et al., PODC’03)became popular for studying the structure of the Internet or social networks. De-spite its significance, locality in this gam...

This paper proposes the first peer-to-peer network and lookup algorithm that for any 0 < ε has worst case stretch bounded by 1+ ε. The construction uses an expected logarithmic number of links. It is suitable for a very realistic class of metrics in which the only restriction on density is a growth-bound. It is completely decentralized and readily deployable in dynamic networks.

In this paper, the relation between the Glushkov automaton (Apos) and the partial derivative automaton (Apd) of a given regular expression, in terms of transition complexity, is studied. The average transition complexity of Apos was proved by Nicaud to be linear in the size of the corresponding expression. This result was obtained using an upper bound of the number of transitions of Apos. Here ...

Smoothed analysis combines elements over worst-case and average case analysis. For an instance x, the smoothed complexity is the average complexity of an instance obtained from x by a perturbation. The smoothed complexity of a problem is the worst smoothed complexity of any instance. Spielman and Teng introduced this notion for continuous problems. We apply the concept to combinatorial problems...

The topic of software architecture (SA) based testing has recently raised some interest. Recent work on the topic has used the SA as a reference model for code conformance testing, to check if an implementation fulfills (conforms to) its specification at the SA level. In this context, on previous papers, we have analyzed: i) how suitable test cases can be “selected” from the SA specification an...

In this paper we introduce a theoretical framework and a logical application for analyzing the semantics and pragmatics of contrastive conjunctions in natural language. It is shown how expressions like although, nevertheless, yet and but are semantically definable as connectives using an operator for implication in natural language and how similar pragmatic principles affect the behaviour of bo...