A NEW METHOD FOR FINDING THE NATURAL FREQUENCY SET OF A LINEAR TIME-INVARIANT NETWORK

This paper presents a new method for finding the natural frequency set of a linear time invariant network. In the paper deriving and proving of a common equation are described. It is for the first time that in the common equation the natural frequencies of an n th order network are correlated with the n port parameters. The equation is simple and dual in form and clear in its physical meaning. The procedure of finding the solution is simplified and standardized, and it will not cause the loss of roots. The common equation would find wide use and be systematized.

An approach to dark energy problem through linear invariants

The time evolution of vacuum energy density is investigated in the coherent states of inflationary universe using a linear invariant approach. The linear invariants we derived are represented in terms of annihilation operators. On account of the fact that the coherent state is an eigenstate of an annihilation operator, the wave function in the coherent state is easily evaluated by solving the eigenvalue equation of the linear invariants. The expectation value of the vacuum energy density is derived using this wave function. Fluctuations of the scalar field and its conjugate momentum are also investigated. Our theory based on the linear invariant shows that the vacuum energy density of the universe in a coherent state is decreased continuously with time due to nonconservative force acting on the coherent oscillations of the scalar field, which is provided by the expansion of the universe. In effect, our analysis reveals that the vacuum energy density decreases in proportion to t-β where β is 3/2 for radiation-dominated era and 2 for matter-dominated era. In the case where the duration term of radiation-dominated era is short enough to be negligible, the estimation of the relic vacuum energy density agrees well with the current observational data.

A Modified Stability Analysis of Two-Dimensional Linear Time Invariant Discrete Systems within the Unity-Shifted Unit Circle

This paper proposes a method to ascertain the stability of two dimensional linear time invariant discrete system within the shifted unit circle which is represented by the form of characteristic equation. Further an equivalent single dimensional characteristic equation is formed from the two dimensional characteristic equation then the stability formulation in the left half of Z-plane, where the roots of characteristic equation f(Z) = 0 should lie within the shifted unit circle. The coefficient of the unit shifted characteristic equation is suitably arranged in the form of matrix and the inner determinants are evaluated using proposed Jury’s concept. The proposed stability technique is simple and direct. It reduces the computational cost. An illustrative example shows the applicability of the proposed scheme.

Linearity of Removal in the Proeess of Optical Element Polishing

In the light of some assumptions that are very close to the practical working conditions,a very complicated polishing process of optical element can be simplified as a linear and shift invariant system that is relatd only to the speed,pres- sure and time of processing.In polishing,the removed material can be represented and entreated by the convolution of the removal function of polishing head and the dwell function.The properties of removal function are presented.The assumptions and methods given by the author have been shown to be correct and applicable by experiments using a ring lap to polish the optical surfac.

A Criterion for Determining the Number of Clusters

Aiming to provide an appropriate number K of clusters, in this paper, we propose a new criterion function - H criterion function, whose three properties have also been proved. We validate the performance of the H criterion function on one artificial dataset and three real-world datasets, and the results are almostly consistent with a previous method. The nonparametric criterion we proposed is intuitive, simple and the computational cost is acceptable.

Mixed sensitivity H_∞ control for LTI systems with varying time delays

Designing a robust controller for a system with timevarying delays poses a major challenge. In this paper, we propose a method based on mixed sensitivity H∞ for the control of linear time invariant（LTI） systems with varying time delays. The time delay is assumed bounded and the upper bound is known. In the technique we propose, the delay affecting the plant to be controlled is treated as an unmodeled uncertainty（in form of multiplicative uncertainty）. That uncertainty is approximated and then an H∞based controller, for the plant represented by the multiplicative uncertainty and the nominal model, is calculated. The obtained H∞controller is used to control the LTI systems with varying time delays. Simulation examples are given to illustrate the effectiveness of the proposed method.

Some Characterizations of the Properties ■~∞ and LB_∞

The aim of this paper is to give some properties of the linear topological invariant LB^-∞ Using these results we show that a nuclear Fréchet space F has the property LB∞ if and only if every separately holomorphic function on an open subset U × V of E × F^* has a local Dirichlet representation,where E is a nuclear Fréchet space with the property LB^-∞ having a basis.

Design of high-speed and low-power finite-word-length PID controllers

ASIC or FPGA implementation of a finite word-length PID controller requires a double expertise： in control system and hardware design. In this paper, we only focus on the hardware side of the problem. We show how to design configurable fixed-point PIDs to satisfy applications requiring minimal power consumption, or high control-rate, or both together. As multiply operation is the engine of PID, we experienced three algorithms： Booth, modified Booth, and a new recursive multi-bit multiplication algorithm. This later enables the construction of finely grained PID structures with bit-level and unit-time precision. Such a feature permits to tailor the PID to the desired performance and power budget. All PIDs are implemented at register-transfer4evel （RTL） level as technology-independent reusable IP-cores. They are reconfigurable according to two compilemtime constants： set-point word-length and latency. To make PID design easily reproducible, all necessary implementation details are provided and discussed.