The analysis of multiband quantum transport simulation in double-gate metal oxide semiconductor field effects transistors (DG-MOSFETs) is performed based on a non-equilibrium Green's function (NEGF) formalism coupled self-consistently with the Poisson equation. The empirical sp3s* tight binding approximation (TBA) with nearest neighbor coupling is employed to obtain a realistic multiband structure. The effects of non-parabolic bandstructure as well as anisotropic features of Si are studied and analyzed. As a result, it is found that the multiband simulation results on potential and current profiles show significant differences, especially in higher applied bias, from those of conventional effective mass model.

The present paper proposes two novel and practical schemes for distributed and asynchronous power control in wireless ad hoc networks, in which users dynamically share several frequency bands as in "cognitive radio" networks. These schemes iteratively adjust transmit powers of individual network transmitters with respect to mutually caused interference in the shared bands. Their most attractive feature is that they find network-wide acceptable trade-offs to diverse signal-to-noise and interference (SINR) requirements and efficiently use techniques of stochastic approximation and time-averaging to guarantee a robust performance in random channels. Advantageously, both proposed algorithms do not assume any particular modulation, coding, QoS measure definition or network architecture, which assures their high applicability in the industry and research. Moreover, the broad definition and non-linear nature of these schemes mathematically generalize and thus encompass as a special case many widely deployed power control schemes such as e.g. those for achieving fixed SINR targets or using game-theoretic utility maximization. Simulations are provided to illustrate our approach and its better performance compared to standard algorithms.

Most of analytical models proposed so far for the IEEE 802.11 distributed coordination function (DCF) focus on saturation performance. In this paper, we develop an analytic model for unsaturation performance evaluation of the IEEE 802.11 DCF with and without slow contention window decrease (SCWD). The model explicitly takes into account the carrier sensing mechanism and an additional backoff interval after successful frame transmission, both of which can be ignored under saturation conditions. Expressions are derived for throughput and delay characteristics by means of the equilibrium point analysis. The accuracy of our model is validated through computer simulation. Numerical results based on the IEEE 802.11b with CCK show that the SCWD can stably achieve approximately 20% performance gain over the normal 802.11 DCF under unsaturation conditions as well as saturation ones.

Multi-swing trajectories, which refer to those trajectories which oscillate several cycles and then become unbounded, has been a nuisance in general simulation programs for power system stability study since the corresponding transient stability is very difficult to access accurately. In this letter, two possible models are developed to explain possible scenarios of such multi-swing behaviors. Theoretical investigation has strongly indicated a close relationship between multi-swing instability problems and chaotic behaviors of the power system.

In contention-based wireless ad hoc networks, power control is an efficient way to improve the spatial reuse by allowing multiple pairs to communicate simultaneously. In this paper, we propose a game-theoretical approach for joint power and rate control in ad hoc networks, where the transmit rate of each link is maximized. Meanwhile we consider the transmit power as the cost, since higher power leads to higher interference and more energy consumption. In particular, we introduce a novel auction-like pricing algorithm in which the cost per unit power steps up until the network settles down at a Nash equilibrium, which is a feasible power and rate allocation, even when the Signal to Interference and Noise Ratio (SINR) requirements are initially infeasible. Numerical results show significant throughput improvement and energy consumption savings compared with the previously proposed algorithm that defers the link with minimum SINR.

From the authors' investigations on the initial instantaneous phenomena in breaking contacts, we have found the two types of bridge, i.e. one is a brightened (luminous) bridge and another one is a dark (non-luminous) one. This paper discusses on the dark bridge formed between contacts when the separation speed is very small. The following items are mentioned in this paper: a) bridge model and theory on the relationship between bridge length and diameter. b) thermal flow from bridge to its vicinity, c) deduction of a thermal equilibrium condition from the calculation of thermal flow time constant. d) experimental works, e) discussions and f) conclusions. In conclusion, we see the coincidence of the tendency of the theory and experiment carried out on the relationship between bridge diameter and length.

This paper addresses the utility-based radio resource allocation problem in DS-CDMA systems carrying multimedia traffic. The proposed scheme, aiming at achieving optimal resource allocation, considers the joint power and data rate allocation. To avoid high computational complexity of nonlinear optimization, we reformulate the radio resource allocation problem as a market model, where resource is regarded as a commodity. Since the market model satisfies the incentive-compatible constraint, the optimal resource allocation can be obtained at the market equilibrium in a distributed manner. According to whether to allocate a minimal transmission data rate to each user, two algorithms, UCA and FCA, are proposed. UCA emphasize on maximizing system overall utilities, while FCA guarantees fairness to users. Simulation results show that the proposed radio resource allocation scheme and algorithms are flexible and efficient for multimedia DS-CDMA systems.

In wireless communication systems where users compete for limited bandwidth, radio resource control is essential for throughput enhancement and delay reduction. In this paper, we present a game-theoretical approach to distributed resource control in CDMA systems. Incomplete information about channel conditions is considered. The resource control problem is formulated as a noncooperative game of incomplete information, with which the existence and uniqueness of the Bayesian Nash equilibrium (BNE) of the game is investigated. Since the equilibrium is Pareto inefficient, we propose a pricing policy to the resource control game by adding a penalty price to user's transmission cost. With the adoption of the price, user's aggressive behavior is depressed, and Pareto improvement is achieved. Also the Pareto efficient BNE of the game with pricing is studied. Simulation results show that users can obtain higher throughput and lower average packet transmission delay by proper pricing policy. It is also verified that the scheme of pricing policy is robust when information of channel conditions is inaccurate.

CPCH is an uplink common channel that is used by 3GPP to support reliable packet transport. In this paper, we propose a new access scheme by using the discrimination of backoff timer for providing a prioritized service. We also present a simple system model of CPCH for EPA and use it to derive mathematical results. The results show that multi-class services with different priorities can be served effectively and easily by the proposed scheme.

Previous device models for Hot Electron Bolometers (HEB) apply a lumped element approach to calculate the small signal parameters. In this work, large signal parameters are calculated using a nonlinear one-dimensional heat balance equation including critical current effects. Small signal equivalents are obtained by solving a linearized heat balance for the small signal beat term in the HEB. In this model, the absorbed bias power density is treated as a profile along the HEB bridge and the electrothermal feedback acts differently on different parts of the bridge. This model predicts more realistic conversion gain figures being about 10 dB lower than in previous ones.

The available bit rate (ABR) is an ATM service category that provides an economical support of connections having vague requirements. An ABR session may specify its peak cell rate (PCR) and minimum cell rate (MCR), and available bandwidth is allocated to competing sessions based on the max-min policy. In this paper, we investigate the ABR traffic control from a different point of view: Based on the decentralized bandwidth allocation model studied in [9], we prove that the max-min rate vector is the equilibrium of a certain system of noncooperative optimizations. This interpretation suggests a new framework for ABR traffic control that allows the max-min optimality to be achieved and maintained by end-systems, and not by network switches. Moreover, in the discussion, we consider the constrained version of max-min fairness and develop an efficient algorithm with theoretical justification to determine the optimal rate vector.

Most of the previous controllers proposed for output regulation problems on uncertain nonlinear systems tried to keep the state variables to the nominal equilibrium points. In this letter, however, the dynamic state feedback controller makes the state variables follow the perturbed equilibrium points computed from an equilibrium-estimator.

As mobile communication systems have been widespread and the needs for new service grows, IMT-2000 systems have largely been researched and developed for standardization. Among them, Wideband CDMA (WCDMA) solution is standardized in the 3rd Generation Partnership Project. In WCDMA system, voice and high data rate services are supported through dedicated traffic channels, however other packet based services with short duration are provided by using common channels. Data users are allowed to transmit a short message based on a contention manner via the reverse common channels. The basic Common Packet Channel (CPCH) mechanism has been proposed and adopted for accessing common channels. It consists of three phases: Random Access Phase, Collision Resolution Phase, and Data Transmission Phase. To enhance the resource usage efficiency, the CPCH mechanisms with channel assignment or status monitoring have been proposed. They can improve the performance, however increase the system complexity. Up to now, performances of the CPCH mechanisms have been discussed and studied based on computer simulations. Numerical results have been obtained by using S-G analysis, but they are different from simulation results. In this paper, we analyze the CPCH mechanisms by using the Equilibrium Point Analysis (EPA). And we compare computer simulation results with analytical results.

The sense of equilibrium is influenced by various factors of visual stimulation, especially far peripheral vision and a motion parallax. An investigation of these two factors was made in order to apply the findings to construct a rehabilitation method for equilibrium disorders. From the experimental results, it was found that the center of gravity for the subjects was greatly affected by both far peripheral vision and the motion parallax. This finding suggests how visual stimulation should be displayed to control the sense of balance in the case of equilibrium disorders.

With the progress of LSI technology, the electronic device size is presently scaling down to the nano-meter region. In such an ultrasmall device, it is indispensable to take quantum mechanical effects into account in device modeling. In this paper, we first review the approaches to the quantum mechanical modeling of carrier transport in ultrasmall semiconductor devices. Then, we propose a novel quantum device model based upon a direct solution of the Boltzmann equation for multi-dimensional practical use. In this model, the quantum effects are represented in terms of quantum mechanically corrected potential in the classical Boltzmann equation.

Recent years have seen great advances in our understanding and modeling of the coupled diffusion of dopants and defects in silicon during integrated circuit fabrication processes. However, the ever-progressing shrinkage of device dimensions and tolerances leads to new problems and a need for even better models. In this review, we address some of the advances in the understanding of defect-mediated diffusion, focusing on the equations and parameters appropriate for modeling of dopant diffusion in submicron structures.

This paper obtains some new results about the existence, uniqueness, and global asymptotic stability of the equilibrium of a nonlinear continuous neural network, under a sufficient condition weaker than ones presented in the literature. The avobe obtained results can also imply the existing ones about avsolute stability of nonlinear continuous neural networks

In this paper, a simple method to investigate the dynamics of continuous-time neural networks based on the force (kinetic vector) derived from the equation of motion for neural networks instead of the energy function of the system has been described. The number of equilibrium points and limit cycles of one-dimensional neural networks with the asymmetric cyclic connection matrix has been investigated experimently by this method. Some types of equilibrium points and limit cycles have been theoretically analyzed. The relations between the properties of limit cycles and the number of connections also have been discussed.

In this paper we study the properties induced by the symmetrical properties of a system of hybridly coupled oscillators of the Rayleigh type on the bifurcations of its equilibria. We first discuss the symmetrical properties of the system. Then we classify the equilibria according to their symmetrical properties. Demonstrating the structural degeneracy of the system, we give the complete stability analysis of the equilibria.

The number of solutions of a nonlinear equation x = sgn(Wx) is discussed. The equation is derived for the determination of equilibrium points of a kind of Hopfield neural networks. We impose some conditions on W. The conditions correspond to the case where a Hopfield neural network has n neurons arranged on a ring, each neuron has connections only from k preceding neurons and the magnitude of k connections decrease as the distance between two neurons increases. We show that the maximum number of solutions for the above case is extremely few and is independent of the number of neurons, n, if k is less than or equal to 4. We also show that the number of solutions generally increases exponentially with n by considering the case where k = n-1.