In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying interface is feasible. The method is based on the consistency of the timing constraints derived from the timing diagram and accepts unknown occurrence times for events produced by the environment.

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random time of arrival can be represented as an additive noise channel, and for the diffusion-based MT (DBMT) channel this noise is distributed according to the Lév...

Timed pushdown automata (tpda) are an expressive formalism combining recursion with a rich logic of timing constraints. We prove that reachability relations tpda expressible in linear arithmetic, generalising Presburger arithmetic and rational arithmetic. The main technical ingredients novel quantifier elimination result for clock constraints (used to simplify the syntax transitions), use diffe...

Post-silicon tuning is attracting a lot of attention for coping with increasing process variation. However, its tuning cost via testing is still a crucial problem. In this paper, we propose tuning-friendly body bias clustering with multiple bias voltages. The proposed method provides a small set of compensation levels so that the speed and leakage current vary monotonically according to the lev...

Empirical study of the syntax-prosody relation is hampered by the fact that current prosodic models are essentially linear, while syntactic structure is hierarchical. The present contribution describes a syntax-prosody comparison heuristic based on two new algorithms: Time Tree Induction, TTI, for building a prosodic treebank from time-annotated speech data, and Tree Similarity Indexing, TSI) f...

In this paper we address the parallel timing simulation of synchronous VLSI designs on a network of workstations (NOWs). We suggest combining cycle based and conventional timing simulation techniques to achieve fast timing simulation even on NOWs which are typically characterized by low bandwidth and high communication latency. In particular we execute a timing simulator on each node of the NOW...

How science and policy interact has been a major research focus in the International Relations (IR) tradition, using the epistemic community (EC) concept, as well as in the alternative perspective of Science and Technology Studies (STS). Should science be autonomous and as apolitical as possible in order to ‘speak truth to power’, as suggested by EC or should the inevitable entanglement of scie...

Interpersonal relations are in constant flux; close friendships often dissolve into enmity. We examine linguistic cues augur transitions from friendly bonds into hostile relations through conversations from online strategy games. We look at betrayal from two perspectives in a classification framework: we characterize the difference between friendships that break and friendships that last, and w...

Interpersonal communication represents one of the most important aspects in the process of education. Its role may be seen at multiple levels. It can also be considered as a generator of interpersonal relations in the educational process as well as a consequence of the established interpersonal relations at the subject level in the educational process. In other words, interpersonal communicatio...

We consider stability concepts for random matchings where agents have preferences over objects and objects have priorities for the agents. When matchings are deterministic, the standard stability concept also captures the fairness property of no (justified) envy. When matchings can be random, there are a number of natural stability / fairness concepts that coincide with stability / no envy when...