Nonstandard numerical methods for a mathematical model for influenza disease

In this paper we construct and develop two competitive implicit finite difference scheme for a deterministic mathematical model associated with the evolution of influenza A disease in human population. Qualitative dynamics of the model is determined by the basic reproduction number, _R0$R_0$. Numerical schemes developed here are based on nonstandard finite difference methods. Our aim is to transfer essential properties of the continuous model to the discrete schemes and to obtain unconditional stable schemes. The proposed numerical schemes have two fixed points which are identical to the critical points of the continuous model and it is shown that they have the same stability properties. Numerical simulations with different initial conditions, parameters values and time step sizes are developed for different values of parameter _R0$R_0$, convergence to the disease free equilibrium point when _R0<1$R_0<1$ and to the endemic equilibrium point when _R0>1$R_0>1$ are obtained independent of the time step size. These numerical integration schemes are useful since can reproduce the dynamics of original differential equations.     

A novel computer virus propagation model and its dynamics

By taking into account the fact that, in general, a computer immediately possesses infectivity as soon as it is infected, a novel computer virus propagation model, known as the SLBS model, is established. It is proved that the dynamic behaviour of the model is determined by a threshold R ₀. Specifically, the virus-free equilibrium is globally asymptotically stable if R ₀≤1, whereas the virulent equilibrium is globally asymptotically stable if 1<R ₀≤4. It is conjectured that the virulent equilibrium is also globally asymptotically stable if R ₀>4. These results suggest some effective strategies for eradicating computer viruses distributed in the Internet.     

States on <Emphasis Type="Italic">R</Emphasis><Subscript>0</Subscript> algebras

The aim of this paper is to introduce the notion of states on R ₀ algebras and investigate some of their properties. We prove that every R ₀ algebra possesses at least one state. Moreover, we investigate states on weak R ₀ algebras and give some examples to show that, in contrast to R ₀ algebras, there exist weak R ₀ algebras which have no states. We also derive the condition under which finite linearly ordered weak R ₀ algebras have a state. This work is supported by NSFC (No.60605017).     

Modelling and solving the intrusion detection problem in computer networks

We introduce a novel anomaly intrusion detection method based on a Within-Class Dissimilarity, WCD. This approach functions by using an appropriate metric WCD to measure the distance between an unknown user and a known user defined respectively by their profile vectors. First of all, each user performs a set of commands (events) on a given system (Unix for example). The events vector of a given user profile is a binary vector, such that an element of this vector is equal to “1” if an event happens, and to “0” otherwise. In addition to this, each user's class k has a typical profile defined by the vector P_k, in order to test if a new user i defined by its profile vector P_i belongs to the same class k or not. The P_k vector is a weighted events vector E_k, such that each weight represents the number of occurrences of an event e_k. If the “distance” d_ki (measured by a dissimilarity parameter) between an unknown profile P_i and a known profile P_k is reasonable according to a given threshold and to some constraints, then there is no intrusion. Else, the user i is suspicious. A simple example illustrates the WCD procedure. A survey of intrusion detection methods is presented.Our proposed method based on clustering users and using simple statistical formulas is very easy for implementation.     

Polypyrrole functionalized with FePcTSA for NO2 sensor application

The nitrogen dioxide (NO₂) sensing capability of polypyrrole (PPy) was enhanced dramatically after functionalized with iron(III)phthalocyanine-4,4′,4″,4-tetrasulfonic acid monosodium salt (FePcTSA). The incorporated phthalocyanine was confirmed by different characterization techniques such as UV–vis spectroscopy, FTIR, GFAAS, EDAX, etc. The resistance of the functionalized PPy decreased spontaneously during exposure to NO₂ gas at room temperature. This material exhibited excellent stability, reversibility, and reproducibility. The lowest response time (t₅₀) thus obtained is 47 s with a highest response factor (ΔR/R₀ × 100) of 50.25.     

Control of singular problem via differentiation of a Min-Max

For Ω a smooth domain in Rⁿ with boundary Λ = Λ₀Λ₁, we are concerned with the wave equation y″ − Δy = S in Q_T =]0, T[ × Ω with = ∂/∂t, at source term satisfying S, S′ ε L¹(0, T L² (Ω)). A Dirichlet condition is imposed on Λ₀ and we consider an absorbing condition ∂y/∂n + uy′ = 0 in [0, T] × gL₁ where u is the control.parameter. We introduce the cost function. and using the Min-Max formulation of J we by-pasas the sensitivity analysis of u → y and obtain the gradient of J with a usual adjoint problem. We first present an abstract frame for this kind of problems. using the differentiability results of a Min-Max [1,2], which we very shortly deduce here, we show that the well posedness of the adjoint equation implies differentiability of the cost function governed by a linear well posed problem.     

The combined impact of external computers and network topology on the spread of computer viruses

This paper aims to study the combined impact of external computers and network topology on the spread of computer viruses over the Internet. By assuming that the network underlying a recently proposed model capturing virus spreading behaviour under the influence of external computers follows a power-law degree distribution, a new virus epidemic model is proposed. A comprehensive study of the model shows the global stability of the virus-free equilibrium or the global attractivity of the viral equilibrium, depending on the basic reproduction number R₀. Next, the impacts of different model parameters on R₀ are analysed. In particular, it is found that (a) higher network heterogeneity benefits virus spreading, (b) higher-degree nodes are more susceptible to infections than lower-degree nodes, and (c) a lower rate at which external computers enter the Internet could restrain virus spreading. On this basis, some practical measures of inhibiting virus diffusion are suggested.     

Probabilistic enhancement of classical robustness margins: The unirectangularity concept

The focal point of this paper is a control system subjected to parametric uncertainty. Motivated by the newly emerging theory of probabilistic robustness, the risk of performance violation is assessed with uncertainty bounds which exceed classical deterministic margins. For a wide class of problems, the Uniformity Principle (UP) developed by Barmish and Lagoa (Math. Control Signals Systems 10 (1997) 203–222), makes it possible to estimate the probability of performance satisfaction with almost no a priori statistical information about the uncertainty. The application of the UP is, however, limited to problems satisfying certain convexity and symmetricity conditions. Since such conditions are violated in many practical problems, the objective in this paper is to extend the application of the UP. To this end, by working with a so-called unirectangularity condition, a procedure is implemented for computing probabilities of performance and the associated improvements of deterministic robustness margins. That is, given any robustness radius r₀ which is computable via deterministic methods, a probabilistic enhancement of this margin R₀()r₀ with pre-specified level of risk >0 is provided. The radius R₀() is called a risk-adjusted robustness margin.     

Dynamical Properties of Timed Automata

Timed automata are an important model for specifying and analyzing real-time systems. The main analysis performed on timed automata is the reachability analysis. In this paper we show that the standard approach for performing reachability analysis is not correct when the clocks drift even by a very small amount. Our formulation of the reachability problem for timed automata is as follows: we define the set R ^*(T,Z ₀)=_>0 Reach(T, Z ₀ where T is obtained from timed automaton T by allowing an drift in the clocks. R ^*(T,Z ₀) is the set of states which can be reached in the timed automatonT from the initial states in Z₀ when the clocks drift by an infinitesimally small amount. We present an algorithm for computing R ^*(T,Z ₀)and provide a proof of its correctness. We show that R ^*(T,Z ₀)is robust with respect to various types of modeling errors. To prove the correctness of our algorithm, we need to understand the dynamics of timed automata—in particular, the structure of the limit cycles of timed automata.     

Needed reduction and spine strategies for the lambda calculus

A redex R in a lambda-term M is called needed if in every reduction of M to normal form (some residual of) R is contracted. Among others the following results are proved: 1. R is needed in M iff R is contracted in the leftmost reduction path of M. 2. Let : M₀ →M₁ → M₂ → … reduce redexes R_i: M_i → M_i+1, and have the property that i.j≥i.R_j is needed in M_j. Then is normalising, i.e., if M₀ has a normal form, then is finite and terminates at that normal form. 3. Neededness is an undecidable property, but has several efficiently decidable approximations, various versions of the so-called spine redexes.     

Oscillation criteria of certain nonlinear partial difference equations

This paper is concerned with the nonlinear partial difference equation with continuous variables

,where a, σ_i, τ_i are positive numbers, h_i(x, y, u) ε C(R⁺ × R⁺ × R, R), uh_i(x, y, u) > 0 for u ≠ 0, h_i is nondecreasing in u, i = 1, …, m. Some oscillation criteria of this equation are obtained.     

Möbius变换下四次有理抛物-PH曲线的C2 Hermite插值

目的 曲线插值问题在机器人设计、机械工业、航天工业等诸多现代工业领域都有广泛的应用，而已知端点数据的Hermite插值是计算机辅助几何设计中一种常用的曲线构造方法，本文讨论了一种偶数次有理等距曲线，即四次抛物-PH曲线的C² Hermite插值问题。方法 基于M bius变换引入参数，利用复分析的方法构造了四次有理抛物-PH曲线的C² Hermite插值，给出了具体插值算法及相应的Bézier曲线表示和控制顶点的表达式。结果 通过给出"合理"的端点插值数据，以数值实例表明了该算法的有效性，所得12条插值曲线中，结合最小绝对旋转数和弹性弯曲能量最小化两种准则给出了判定满足插值条件最优曲线的选择方法，并以具体实例说明了与其他插值方法的对比分析结果。结论 本文构造了M bius变换下的四次有理抛物-PH曲线的C² Hermite插值，在保证曲线次数较低的情况下，达到了连续性更高的插值条件，计算更为简单，插值效果明显，较之传统奇数次PH曲线具有更加自然的几何形状，对偶数次PH曲线的相关研究具有一定意义。     

Regional algorithms for remote-sensing estimates of total suspended matter in the Beaufort Sea

The large and variable riverine inflow to Arctic continental shelves strongly influences their chemical, biological, and optical properties. The Beaufort Sea receives the largest amount of suspended sediments amongst all Arctic shelves, with sediment-laden Mackenzie river waters strongly influencing bio-optical properties on the shelf. Here, we developed two regional algorithms for the estimation of total suspended matter (TSM) concentration using Medium Resolution Imaging Spectrometer (MERIS) spectral bands, based on in situ optical and suspended particulate data collected in the summer during the Canadian Arctic Shelf Exchange Study (CASES) in 2004 and during the Arctic Coastal Ecosystem Study (ACES) in 2010. The band ratio (where R _rs is remote-sensing reflectance) R _rs,560/R _rs,490 was best correlated with low TSM concentrations (less than 3.0 g m^?3), while higher TSM concentrations were well correlated to R _rs,681/R _rs,560. An empirical piecewise algorithm is thus proposed with the switch between the ratios being triggered by R _rs,681/R _rs,560 at a threshold value of 0.6. The second algorithm made use of support vector machines (SVMs) as a nonlinear transfer function between TSM concentrations and remote-sensing reflectance ratios R _rs,681/R _rs,560, R _rs,665/R _rs,560, and R _rs,560/R _rs,490. Results show that both algorithms perform better (31% and 25%, respectively) than other published TSM algorithms including the MERIS Case 2 water processor (C2R) neural network algorithm in the study area.     

On the extension of solutions of linear constant-coefficient PDE

We solve the following over-determined boundary value problem (the “extension problem”): Let R(∂) be a matrix whose entries are linear partial differential operators, with constant coefficients. Let Ω be a non-empty, open, bounded, convex set. We consider the homogeneous system R(∂)f=0 in a neighborhood of , subject to the boundary condition f=g in a neighborhood of ∂Ω. For a given g, we give a criterion for the (unique) existence of a smooth solution f to this problem. There are two obvious necessary conditions: g is smooth and R(∂)g=0 in a neighborhood of ∂Ω. We characterize the class of differential operators R(∂) for which the problem is solvable for any g satisfying the necessary conditions. Finally, in the case where the solution is non-unique, we consider the possibility of obtaining uniqueness by fixing several components of the desired solution.     

Event‐triggered dissipative synchronization for Markovian jump neural networks with general transition probabilities

In this paper, dissipative synchronization problem for the Markovian jump neural networks with time‐varying delay and general transition probabilities is investigated. An event‐triggered communication scheme is introduced to trigger the transmission only when the variation of the sampled vector exceeds a prescribed threshold condition. The transition probabilities of the Markovian jump delayed neural networks are allowed to be known, or uncertain, or unknown. By employing delay system approach, a new model of synchronization error system is proposed. Applying the Lyapunov‐Krasovskii functional and integral inequality combining with reciprocal convex technique, a delay‐dependent criterion is developed to guarantee the stochastic stability of the errors system and achieve strict (Q,S,R)?α dissipativity. The event‐triggered parameters can be derived by solving a set of linear matrix inequalities. A numerical example is presented to illustrate the effectiveness of the proposed design method.     

Dissipative stability analysis and control of two-dimensional Fornasini–Marchesini local state-space model

This paper is concerned with the problems of dissipative stability analysis and control of the two-dimensional (2-D) Fornasini–Marchesini local state-space (FM LSS) model. Based on the characteristics of the system model, a novel definition of 2-D FM LSS (Q, S, R)-α-dissipativity is given first, and then a sufficient condition in terms of linear matrix inequality (LMI) is proposed to guarantee the asymptotical stability and 2-D (Q, S, R)-α-dissipativity of the systems. As its special cases, 2-D passivity performance and 2-D H_∞ performance are also discussed. Furthermore, by use of this dissipative stability condition and projection lemma technique, 2-D (Q, S, R)-α-dissipative state-feedback control problem is solved as well. Finally, a numerical example is given to illustrate the effectiveness of the proposed method.     

Optimization of rotor blades for combined structural,dynamic, and aerodynamic properties

A helicopter is intrinsically interdisciplinary due to the close coupling among aerodynamics, dynamics, and the blade structural details. Therefore a design optimization with proper interactions among appropriate disciplines (such as structure, dynamics, and aerodynamics) can offer significant benefit to improve rotor performance. This paper studies the integration of structure, dynamics, and aerodynamics in design optimization of helicopter rotor blades. The optimization is performed to minimize the rotor power required and to satisfy design requirements from structure (minimum blade weight and safe stress margin and fatigue life) and dynamics (proper placement of blade natural frequencies and free of flutter). An effort is made to formulate an effective strategy for combining these various requirements in the optimization process. The paper also presents a way for an intelligent phasing of this interdisciplinary optimization to overcome the hurdles due to conflicting demands on the design variables which arise from different disciplines.Notation nondimensional leading edge mass size, = a/R - C _T rotor thrust coefficient - C _P rotor power coefficient - nondimensional chord, =c/R - nondimensional lumped mass size, =d/R - F(x) objective function - G _j (x) j-th inequality constraint function - H _j (x) j-th equality constraint function - R blade radius, meters - nondimensional blade radial coordinate, =r/R - nondimensional web thickness, =s ₁/R - nondimensional web thickness, =s ₂/R - t nondimensional flange thickness, =t/R - x vector of design variables - x _i i-th component of vector of design variables - blade pitch angle     

Certainty equivalence implies detectability

It is shown that any stabilizing, certainty equivalence control used within an adaptive control system, causes the familiar interconnection of a controlled process and associated output estimator to be detectable through the estimator’s output error e_p, for every frozen value of the index or parameter vector p upon which both the estimator and controller dynamics depend. The fact that certainty equivalence implies detectability has been known for some time – this has been shown to be so whenever the process model is linear and the controller and estimator models are also linear for every frozen value of p. In this paper, use is made of recently introduced concepts of input-to-state stability and detectability for nonlinear systems to prove that the same implication is valid in a more general, nonlinear setting.     

Convergence performance comparison of quantum-inspired multi-objective evolutionary algorithms

In recent research, we proposed a general framework of quantum-inspired multi-objective evolutionary algorithms (QMOEA) and gave one of its sufficient convergence conditions to the Pareto optimal set. In this paper, two Q-gate operators, H gate and R&N gate, are experimentally validated as two Q-gate paradigms meeting the convergence condition. The former is a modified rotation gate, and the latter is a combination of rotation gate and NOT gate with the specified probability. To investigate their effectiveness and applicability, several experiments on the multi-objective 0/1 knapsack problems are carried out. Compared to two typical evolutionary algorithms and the QMOEA only with rotation gate, the QMOEA with H gate and R&N gate have more powerful convergence ability in high complex instances. Moreover, the QMOEA with R&N gate has the best convergence in almost all of the experimental problems. Furthermore, the appropriate ε value regions for two Q-gates are verified.