Search results for "Continuous"
showing 10 items of 899 documents
D-stability for discrete-time t-s fuzzy descriptor systems with multiple delays
2014
In this work, the D-stability problem is considered for a class of discrete-time Takagi-Sugeno (T-S) fuzzy descriptor systems with multiple state delays. In terms of linear matrix inequality, sufficient conditions are proposed to ensure that all poles of the descriptor T-S fuzzy system are located within a disk contained in the unit circle. Moreover, a sufficient condition is presented such that the singular system is regular, causal and D-stable in spite of multiple state delays. Finally, an example is given to show the effectiveness and advantages of the proposed techniques Refereed/Peer-reviewed
Effects of weekend starvation and the duration of daily feeding on production parameters of rainbow trout Oncorhynchus mykiss
2021
Abstract It would often be practical to starve the cultivated fishes over the weekends, e.g. to save in labour costs. We evaluated the possibility that domesticated juvenile rainbow trout (Oncorhynchus mykiss) could compensate for the lost growth of the 2-day weekend starvation by either hyperphagic response and/or by lower feed conversion ratio, compared to the fish fed every day in an 8-week experiment. Rainbow trout (initial weight c. 30 g, temperature 16 °C) starved during the weekends were able to increase feed intake during the weekdays clearly above the intake of the control fish after the first two weekends, also seen as an increase of the compensation coefficients over the last fou…
On fractional diffusion and continuous time random walks
2003
Abstract A continuous time random walk model is presented with long-tailed waiting time density that approaches a Gaussian distribution in the continuum limit. This example shows that continuous time random walks with long time tails and diffusion equations with a fractional time derivative are in general not asymptotically equivalent.
A multi-local optimization algorithm
1998
The development of efficient algorithms that provide all the local minima of a function is crucial to solve certain subproblems in many optimization methods. A “multi-local” optimization procedure using inexact line searches is presented, and numerical experiments are also reported. An application of the method to a semi-infinite programming procedure is included.
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
New approach to numerical computation of the eigenfunctions of the continuous spectrum of three-particle Schrödinger operator: I. One-dimensional par…
2009
Basing on analogy between the three-body scattering problem and the diffraction problem of the plane wave (for the case of the short range pair potentials) by the system of six half transparent screens, we presented a new approach to the few-body scattering problem. The numerical results have been obtained for the case of the short range nonnegative pair potentials. The presented method allows a natural generalization to the case of the long range pair potentials.
Noise decomposition in random telegraph signals using the wavelet transform
2007
Abstract By using the continuous wavelet transform with Haar basis the second-order properties of the wavelet coefficients are derived for the random telegraph signal (RTS) and for the 1 / f noise which is obtained by summation of many RTSs. The correlation structure of the Haar wavelet coefficients for these processes is found. For the wavelet spectrum of the 1 / f noise some characteristics related to the distribution of the relaxation times of the RTS are derived. A statistical test based on the characterization of the time evolution of the scalogram is developed, which allows to detect non-stationarity in the times τ 's which compose the 1 / f process and to identify the time scales of …
Maximum probability estimators in the case of exponential distribution
1975
In 1966–1969L. Weiss andJ. Wolfowitz developed the theory of „maximum probability” estimators (m.p.e.'s). M.p.e.'s have the property of minimizing the limiting value of the risk (see (2.10).) In the present paper, therfore, after a short description of the new method, a fundamental loss function is introduced, for which—in the so-called regular case—the optimality property of the maximum probability estimators yields the classical result ofR.A. Fisher on the asymptotic efficiency of the maximum likelihood estimator. Thereby it turns out that the m.p.e.'s possess still another important optimality property for this loss function. For the latter the parameters of the exponential distribution—…
Confidence bands for Horvitz-Thompson estimators using sampled noisy functional data
2013
When collections of functional data are too large to be exhaustively observed, survey sampling techniques provide an effective way to estimate global quantities such as the population mean function. Assuming functional data are collected from a finite population according to a probabilistic sampling scheme, with the measurements being discrete in time and noisy, we propose to first smooth the sampled trajectories with local polynomials and then estimate the mean function with a Horvitz-Thompson estimator. Under mild conditions on the population size, observation times, regularity of the trajectories, sampling scheme, and smoothing bandwidth, we prove a Central Limit theorem in the space of …
From deterministic cellular automata to coupled map lattices
2016
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have recently derived and that is not dependent on any freely adjustable parameters. The CMLs thus constructed are termed real-valued deterministic cellular automata (RDCA) and encompass all deterministic CAs in rule space in the asymptotic limit $\kappa \to 0$ of a continuous parameter $\kappa$. Thus, RDCAs generalize CAs in such a way that they constitute CMLs when $\kappa$ is finite and nonvanishing. In the limit $\kappa \to \infty$ all RDCAs are shown to ex…