Maintaining connectivity is essential in multi-hop wireless networks since the network topology cannot be pre-determined due to mobility and environmental effects. To maintain the connectivity, a critical point in the network topology should be identified where the critical point is the link or node that partitions the network when it fails. In this paper, we propose a new critical point identi...

The trend towards larger structures and aggressive clock frequencies has been a fundamental driving force for modern microprocessor design. While one approach is to deeply pipeline any high delay structure, dependencies and critical loops have made it increasingly difficult to speed execution through extensive pipelining. One alternative is to remove larger structures from the critical path. We...

Understanding dictated short-messages requires the system to perform speech recognition on the user’s speech. This speech recognition process is prone to errors. If the system can automatically detect the presence of an error, it can use dialog to clarify or correct its transcript. In this work, we present our analysis on what types of errors a recognition system makes, and propose a method to ...

Refactorings are program transformations that improve the software structure while preserving the external behaviour. In spite of this very useful property, refactorings can still give rise to structural conflicts when parallel evolutions to the same software are made by different developers. This paper explores this problem of structural evolution conflicts in a formal way by using graph trans...

We establish heavy-traffic limits for the arrival and workload processes in a single-server queue with a time-varying arrival-rate function. We establish limits at and before a critical point, the onset of critical loading, where the arrival-rate function approaches its critical value from below. We extend results by Newell (1968) and Mandelbaum and Massey (1995) and present alternative views o...

Rule-based model transformation approaches show two kinds of non-determinism: (1) Several rules may be applicable to the same model and (2) a rule may be applicable at several different matches. If two rule applications to the same model exist, they may be in conflict, i.e., one application may disable the other one. Furthermore, rule applications may enable others leading to dependencies. The ...

Recently, the free energy of the target space mean field (TSMF) matrix model has been calculated in the low temperature phase, order-by-order in a low temperature expansion. The TSMF model is a matrix model whose discrete target space has an infinite coordination number, and whose free energy assumes a universal form, corresponding to baby universes joined into a tree. Here the free energy is s...

We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of N steps is of order 3 N/4 times a polynomial in N , and so the approach is greatly superior to direct counting techniques. We have enumerated walks of up to 39 steps. As a consequence, we are able to accurately estimate the critical point, cr...