Inequalities and convexity properties known for the gamma function are extended to the q-gamma function, 0 > q > 1. Applying some classical inequalities for convex functions, we deduce monotonicity results for s...
详细信息
We apply the modal distribution, a high-resolution time-frequency distribution, to the study of sung musical passages. Evidence is presented comparing the modal distribution with the spectrogram for a set of synthetic...
详细信息
We propose a way of solving the Lyapunov equation without computing eigenvalues. This method is related to the Schwarz form of a matrix. The solution can be obtained using the two-sided Lanczos approach by defining ap...
详细信息
ISBN:
(纸本)0780352513
We propose a way of solving the Lyapunov equation without computing eigenvalues. This method is related to the Schwarz form of a matrix. The solution can be obtained using the two-sided Lanczos approach by defining appropriate starting vectors.
This paper considers the problem of H ∞ filtering for nonlinear samplcd-data systems. Sufficient conditions are obtained for the existence of filters that guarantee the L 2 gain from an exogenous input to an estimati...
详细信息
This paper considers the problem of H ∞ filtering for nonlinear samplcd-data systems. Sufficient conditions are obtained for the existence of filters that guarantee the L 2 gain from an exogenous input to an estimation error is less than or equal to a prescribed value. These conditions are expressed in terms of both continuous and discrete Hamilton-Jacobi equations.
Most of the services that an ATM broadband integrated services digital network (B-ISDN) has to offer have a multicast nature. For this type of services, a source of traffic transmits information to multiple destinatio...
详细信息
Most of the services that an ATM broadband integrated services digital network (B-ISDN) has to offer have a multicast nature. For this type of services, a source of traffic transmits information to multiple destinations. In consequence, the ATM switching nodes have to support multi-point connections and they require some mechanisms to allow the replication of ATM multicast cells to subsequently route them. In this paper, we investigate some of the troubles along with their solutions found in a large ATM switch to provide multicast. Large switches apply in wide area network (WAN) environments where the number of multiplexed connections is often large as well as the number of necessary ports in the switching architecture. First, we describe the multicast switching technologies for local area networks (LANs). In this case, the number of ports is normally quite small (8 up to 32). Then, two common approaches to increase the switch size are outlined: one based on a Clos-like network and the other employing the knockout effect. Our contributions in this work are both the evaluation of the knockout effect in a multicast scenario and the evaluation of several routing algorithms in a three stage Clos-like network. The results obtained by computer simulation are presented and the most relevant conclusions addressed.
Cells of mutant strains of the bacterium B. subtilis fail to separate upon dividing, and form long fibers. A given fiber is initially straight, but once it grows to around 100 microns, it buckles and writhes. Soon aft...
Cells of mutant strains of the bacterium B. subtilis fail to separate upon dividing, and form long fibers. A given fiber is initially straight, but once it grows to around 100 microns, it buckles and writhes. Soon after this initial instability the fiber rapidly braids up into a plectoneme. Modeling a fiber as a twisted elastic filament in a viscous fluid, we exploit the “natural” frame of space curves to formulate the dynamics of the filament’s shape and twist density. The resulting coupled nonlinear equations are used to display a remarkable nonlinear phenomenon: geometric untwisting of open filaments, in which twist strain relaxes through a transient writhing instability without axial rotation. Experimentally observed motions of the fibers of B. subtilis may be examples of this twisting process.
This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since the...
详细信息
This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since they consume too much space. We present a new implementation of the Ajtai-Komlos-Szemeredi method, that enables to amplify an S-space algorithm that uses r random bits and errs with probability /spl epsiv/ to an O(kS)-space algorithm that uses r+O(k) random bits and errs with probability /spl epsiv//sup /spl Omega/(k)/. This method can be used to reduce the error probability of BPL algorithms below any constant, with only a constant addition of new random bits. This is weaker than the exponential reduction that can be achieved for BPP algorithms by methods that use only O(r) random bits. However we prove that any black-box amplification method that uses O(r) random bits and makes at most p parallel simulations reduces the error to at most /spl epsiv//sup O(p)/. Hence, in BPL, where p should be a constant, the error cannot be reduced to less than a constant. This means that our method is optimal with respect to black-box amplification methods, that use O(r) random bits. The new implementation of the AKS method is based on explicit constructions of constant-space online extractors and online expanders. These are extractors and expanders, for which neighborhoods can be computed in a constant space by a Turing machine with a one-way input tape.
We analyze the transient behavior of a Markovian arrival queue with congestion control based on a double of thresholds, where the arrival process is a queue-length dependent Markovian arrival process. We consider Mark...
详细信息
暂无评论