24,768 research outputs found

    On delayed genetic regulatory networks with polytopic uncertainties: Robust stability analysis

    Get PDF
    Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we investigate the robust asymptotic stability problem of genetic regulatory networks with time-varying delays and polytopic parameter uncertainties. Both cases of differentiable and nondifferentiable time-delays are considered, and the convex polytopic description is utilized to characterize the genetic network model uncertainties. By using a Lyapunov functional approach and linear matrix inequality (LMI) techniques, the stability criteria for the uncertain delayed genetic networks are established in the form of LMIs, which can be readily verified by using standard numerical software. An important feature of the results reported here is that all the stability conditions are dependent on the upper and lower bounds of the delays, which is made possible by using up-to-date techniques for achieving delay dependence. Another feature of the results lies in that a novel Lyapunov functional dependent on the uncertain parameters is utilized, which renders the results to be potentially less conservative than those obtained via a fixed Lyapunov functional for the entire uncertainty domain. A genetic network example is employed to illustrate the applicability and usefulness of the developed theoretical results

    The Relativistic Rotation

    Full text link
    The classical rotation is not self-consistent in the framework of the special theory of relativity. the Relativistic rotation is obtained, which takes the relativistic effect into account. It is demonstrated that the angular frequency of classical rotation is only valid in local approximation. The properties of the relativistic rotation and the relativistic transverse Doppler shift are discussed in this work

    Finite dimensional integrable Hamiltonian systems associated with DSI equation by Bargmann constraints

    Full text link
    The Davey-Stewartson I equation is a typical integrable equation in 2+1 dimensions. Its Lax system being essentially in 1+1 dimensional form has been found through nonlinearization from 2+1 dimensions to 1+1 dimensions. In the present paper, this essentially 1+1 dimensional Lax system is further nonlinearized into 1+0 dimensional Hamiltonian systems by taking the Bargmann constraints. It is shown that the resulting 1+0 dimensional Hamiltonian systems are completely integrable in Liouville sense by finding a full set of integrals of motion and proving their functional independence.Comment: 10 pages, in LaTeX, to be published in J. Phys. Soc. Jpn. 70 (2001

    Probing the large-scale structure of the universe through gravitational-wave observations

    Get PDF
    The improvements in the sensitivity of the gravitational wave (GW) network enable the detection of several large redshift GW sources by third-generation GW detectors. These advancements provide an independent method to probe the large-scale structure of the universe by using the clustering of the binary black holes. The black hole catalogs are complementary to the galaxy catalogs because of large redshifts of GW events, which may imply that binary black holes (BBHs) are a better choice than galaxies to probe the large-scale structure of the universe and cosmic evolution over a large redshift range. To probe the large-scale structure, we used the sky position of the binary black holes observed by third-generation GW detectors to calculate the angular correlation function (ACF) and the bias factor of the population of binary black holes. This method is also statistically significant as 5000 BBHs are simulated. Moreover, for the third-generation GW detectors, we found that the bias factor can be recovered to within 33%\% with an observational time of ten years. This method only depends on the GW source-location posteriors; hence, it can be an independent method to reveal the formation mechanisms and origin of the BBH mergers compared to the electromagnetic method

    Q-rung orthopair normal fuzzy aggregation operators and their application in multi-attribute decision-making

    Get PDF
    © 2019 by the authors. Q-rung orthopair fuzzy set (q-ROFS) is a powerful tool to describe uncertain information in the process of subjective decision-making, but not express vast objective phenomenons that obey normal distribution. For this situation, by combining the q-ROFS with the normal fuzzy number, we proposed a new concept of q-rung orthopair normal fuzzy (q-RONF) set. Firstly, we defined the conception, the operational laws, score function, and accuracy function of q-RONF set. Secondly, we presented some new aggregation operators to aggregate the q-RONF information, including the q-RONF weighted operators, the q-RONF ordered weighted operators, the q-RONF hybrid operator, and the generalized form of these operators. Furthermore, we discussed some desirable properties of the above operators, such as monotonicity, commutativity, and idempotency. Meanwhile, we applied the proposed operators to the multi-attribute decision-making (MADM) problem and established a novel MADM method. Finally, the proposed MADM method was applied in a numerical example on enterprise partner selection, the numerical result showed the proposed method can effectively handle the objective phenomena with obeying normal distribution and complicated fuzzy information, and has high practicality. The results of comparative and sensitive analysis indicated that our proposed method based on q-RONF aggregation operators over existing methods have stronger information aggregation ability, and are more suitable and flexible for MADM problems
    • …
    corecore