12123652
Analysis of blocking dynamic circuits
In order for dynamic circuits to operate correctly, their inputs must be monotonically rising during evaluation. Blocking dynamic circuits satisfy this constraint by delaying evaluation until all inputs have been properly setup relative to the evaluation clock. By viewing dynamic gates as latches, we demonstrate that the optimal delay of a blocking dynamic gate may occur when the setup time is negative. With blocking dynamic circuits, cascading low-skew dynamic gates allows each dynamic gate to tolerate a degraded input level. The larger noise margin provides greater flexibility with the delay vs. noise margin trade-off (i.e. the circuit robustness vs. speed tradeoff). This paper generalizes blocking dynamic circuits and provides a systematic approach for assigning clock phases, given delay and noise margin constraints. Using this framework, one can analyze any logic network consisting of blocking dynamic circuits.
53748903
A Framework for Designing Reusable Analog Circuits
10993158
Efficient and Distributed Access Control for Sensor Networks
Sensor networks are often used to sense the physical world and provide observations for various uses. In hostile environments, it is critical to control the network access to ensure the integrity, availability, and at times confidentiality of the sensor data. This paper develops efficient methods for distributed access control in sensor networks. The paper starts with a baseline approach, which provides a more flexible and efficient way to enforce access control when compared with previous solutions. This paper then extends the baseline approach to enable privilege delegation, which allows a user to delegate its privilege to other users without using a trusted server, and broadcast query, which allows a user to access the network at a large scale efficiently. The privilege delegation and broadcast query are very useful in practice; none of the current solutions can achieve these two properties.
24184742
On Distance Two Labellings of Graphs
915132
On Randomized Broadcasting and Gossiping in Radio Networks
This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of ?(Dlog (N/D)) time-steps for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log3N)- time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works in time O(N log4 N).
38675279
On-Line Learning Control for Discrete Nonlinear Systems Via an Improved ADDHP Method
This paper mainly discusses a generic scheme for on-line adaptive critic design for nonlinear system based on neural dynamic programming (NDP), more exactly, an improved action-depended dual heuristic dynamic programming (ADDHP) method. The principal merit of the proposed method is to avoid the model neural network which predicts the state of next time step, and only use current and previous states in the method, as makes the algorithm more suitable for real-time or on-line application for process control. In this paper, convergence proof of the method will also be given to guarantee the control to reach the optimal. At last, simulation result verifies the performance.
15066544
Bidirectional interpretation of XQuery
XQuery is a powerful functional language to query XML data. This paper gives a bidirectional interpretation of XQuery to address the problem of updating XML data through materialized XQuery views. We first design an expressive bidirectional transformation language, and then translate XQuery expressions into the code of this language. As a result, an XQuery expression can execute in two directions: in the forward direction, it generates a materialized view from the source XML data; while in the backward direction, it updates the source data by putting back the updates on the view. we have implemented our approach and applied it to some XQuery use cases from a W3C draft, which confirms the practicability of this approach.