An electro-conjugate fluid (ECF) is a kind of dielectric fluid that works as a functional/smart fluid generating a powerful jet flow (ECF jet) when subjected to a high d.c. voltage. The authors previously proposed the first liquid rate gyroscope in the world using ECF. The ECF liquid rate gyroscope proposed uses the drift of the ECF jet due to the Coriolis force when an angular motion is applie...

The complicated manufacturing processes dictate that process variations are unavoidable in today's VLSI products. Unlike device variations, which can be captured by worst/best case corner points, the effects of interconnect variations are context-dependent, which makes it difficult to capture the true worst-case timing performance. This paper discusses an efficient method to explore the extreme...

New measures of peak power are proposed in the context of sequential circuits, and an efficient automatic procedure is presented to obtain very good lower bounds on these measures, as well as providing the actual input vectors that attain such bounds. Automatic generation of a functional vector loop for near-worst case power consumption is also attained. Experiments show that vector sequences g...

Many morphological studies select sample sets to explore neighbourhoods of interest, particularly in terms of their structural street properties, measures of scale or density, and proximity to the metropolitan center (Cervero and Gorham, 1995, Crane and Crepeau, 1998, French and Scoppa, 2007, Handy et al., 2003, Jacobs, 1993, Peponis et al., 2007, Southworth and Owens, 1993); yet beyond the est...

In wireless communication, the channel state changes repeatedly. In this situation, we select the specification of the Viterbi decoder for the worst case channel state. However, if we select the specification of the Viterbi decoder with such a criterion, the decoder operates inefficiently in the good channel state. In this paper, we propose a specification controllable Viterbi decoder without u...

Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case normalized excess length to under 0.8% versus 1.911% for the previously known best method of Chevion et al. The second algorithm, suitable only for alphabets of less than twelve symbols allows even greater red...

This paper presents some complexity results for the specific case of a VLSI friendly neural network used in classification problems. A VLSI-friendly neural network is a neural network using exclusively integer weights in a narrow interval. The results presented here give updated worst-case lower bounds for the number of weights used by the network. It is shown that the number of weights can be ...