Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...

We propose a re-formulation of the Einstein evolution equations that cleanly separates the conformal degrees of freedom and the non-conformal degrees of freedom with the latter satisfying a first order strongly hyperbolic system. The conformal degrees of freedom are taken to be determined by the choice of slicing and the initial data, and are regarded as given functions (along with the lapse an...

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the dec...

We target application domains where the behavior of animals or humans is monitored using wireless sensor network (WSN) devices. The code on these devices is updated frequently, as scientists acquire in-field data and refine their hypotheses. Wireless reprogramming is therefore fundamental to avoid the (expensive) re-collection of the devices. Moreover, the code carried by the monitored individu...

A modern statement about the structural relationship between an ellipsis site and its antecedent runs as follows. an elided XP must have a syntactically identical antecedent XP’, modulo traces This is quite a bizzare condition. Why should some parts of structure count for being identical, and others not? Of all the possible relations between two structures, why does this one describe the ellips...

In this paper we investigate the foundations of a constraintbased compositional verification method for infinite-state systems. We first consider an asynchronous process calculus which is an abstract formalization of several existing languages based on the blackboard model. For this calculus we define a contraint-based symbolic representation of a compositional model based on traces. The constr...

ion, i.e. ha(a(d)) = a(hd(d)), so that two actions a(x) and b(y) cannot be mapped to the same abstract action. However, applying abstractions directly on a system’s specification S rather than on its LTS leads to a loss of precision. Let S be the abstract interpretation of S, and let M and M be their underlying LTSs. It is well known that M is only an overapproximation of α(M), with α(M) denoti...

There exist several important empirical and theoretical issues in dealing with English wh-questions. Among these are syntactic connectivity between the wh-filler and its putative gap, so-called that-trace effect, and constraints in the formation of infinitival wh-questions. Many attempts have been made to account for these, but few succeeded in obtaining satisfactory support. This paper offers ...

some scholars have argued that there is a negative correlation between the onset age of l2 acquisition and performance on different measures of l2 knowledge. a kind of biological scheduling is assumed to be responsible for this maturational constraint on language development. the present study asks whether and to what extent critical period effects can be found for universal properties of langu...

Trace-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the unknown rank of variables or large-rank singular value decompositions (SVDs). To address this, we propose a proximal Riemannian gradient (PRG) scheme which can efficiently solve tr...