密码学教学与创新教育

针对知识经济时代培养学生创新意识和创新能力的要求,在分析总结密码学课程特点和多年从事信息安全及密码学课程教学经验的基础上,阐述如何将创新教育融入密码学教学中。     

Approximate dynamic programming solutions with a single network adaptive critic for a class of nonlinear systems

Approximate dynamic programming (ADP) formulation implemented with an adaptive critic (AC)-based neural network (NN) structure has evolved as a powerful technique for solving the Hamilton-Jacobi-Bellman (HJB) equations. As interest in ADP and the AC solutions are escalating with time, there is a dire need to consider possible enabling factors for their implementations. A typical AC structure consists of two interacting NNs, which is computationally expensive. In this paper, a new architecture, called the ‘cost-function-based single network adaptive critic (J-SNAC)’ is presented, which eliminates one of the networks in a typical AC structure. This approach is applicable to a wide class of nonlinear systems in engineering. In order to demonstrate the benefits and the control synthesis with the J-SNAC, two problems have been solved with the AC and the J-SNAC approaches. Results are presented, which show savings of about 50% of the computational costs by J-SNAC while having the same accuracy levels of the dual network structure in solving for optimal control. Furthermore, convergence of the J-SNAC iterations, which reduces to a least-squares problem, is discussed; for linear systems, the iterative process is shown to reduce to solving the familiar algebraic Ricatti equation.     

Fault tolerant control for singular systems with actuator saturation and nonlinear perturbation

In this paper, the problem of robust fault tolerant control for a class of singular systems subject to both time-varying state-dependent nonlinear perturbation and actuator saturation is investigated. A sufficient condition for the existence of a fixed-gain controller is first proposed which guarantees the regularity, impulse-free and stability of the closed-loop system under all possible faults. An optimization problem with LMI constraints is formulated to determine the largest contractively invariant ellipsoid. An adaptive fault tolerant controller is then developed to compensate for the failure effects on the system by estimating the fault and updating the design parameter matrices online. Both of these two controllers are in the form of a saturation avoidance feedback with the advantage of relatively small actuator capacities compared with the high gain counterpart. An example is included to illustrate the proposed procedures and their effectiveness.     

Modified criterion for global asymptotic stability of fixed-point state-space digital filters using two’s complement arithmetic

A criterion for the global asymptotic stability of fixed-point state-space digital filters using two’s complement arithmetic is presented. The criterion is a modified form of a well-known criterion due to Mills, Mullis, and Roberts. The criterion is in the form of linear matrix inequality and, hence, computationally tractable. An example shows the effectiveness of the modified criterion.     

A sufficient condition to test identifiability of nonlinear delayed-differential models with constant delays and multi-inputs

In this paper, an original result in terms of a sufficient condition to test the identifiability of nonlinear delayed-differential models with constant delays and multi-inputs is given. The identifiability is studied for the linearized system and a criterion for linear systems with constant delays is provided, from which the identifiability of the original nonlinear system can be proved. This result is obtained by combining a classical identifiability result for nonlinear ordinary differential systems due to Grewal and Glover (1976) with the identifiability of linear delayed-differential models developed by Orlov, Belkoura, Richard, and Dambrine (2002). This paper is a generalization of Denis-Vidal, Jauberthie, and Joly-Blanchard (2006), which deals with the specific case of nonlinear delayed-differential models with two delays and a single input.     

Fault-tolerant control for a class of nonlinear sampled-data systems via a Euler approximate observer

In this paper, a fault-tolerant control (FTC) scheme is developed for a class of nonlinear sampled-data systems. First, a Euler approximate discrete model is used to describe the plant under the sampling. Under this model, an observer-based fault estimation method is proposed. To guarantee the accuracy of both the state and fault estimation values, the conditions to make the approximate model consistent with the exact model are presented. Then, an active fault-tolerant controller, which has a constraint condition for the sampling time, is designed to make the faulty system stable. Finally, an inverted pendulum is used to show the efficiency of the proposed method.     

Comments on “Distributed nonlinear control algorithms for network consensus” [Automatica 44 (2008) 2375-2381]

In this short note, we point out a mistake existing in the proof of Theorem 3.1 in Hui and Haddad (2008).     

Two nonlinear optimization methods for black box identification compared

In this paper, two nonlinear optimization methods for the identification of nonlinear systems are compared. Both methods estimate the parameters of e.g. a polynomial nonlinear state-space model by means of a nonlinear least-squares optimization of the same cost function. While the first method does not estimate the states explicitly, the second method estimates both states and parameters adding an extra constraint equation. Both methods are introduced and their similarities and differences are discussed utilizing simulation data. The unconstrained method appears to be faster and more memory efficient, but the constrained method has a significant advantage as well: it is robust for unstable systems of which bounded input-output data can be measured (e.g. a system captured in a stabilizing feedback loop). Both methods have successfully been applied on real-life measurement data.     

A compact split-step finite difference method for solving the nonlinear Schrödinger equations with constant and variable coefficients

We propose a compact split-step finite difference method to solve the nonlinear Schrödinger equations with constant and variable coefficients. This method improves the accuracy of split-step finite difference method by introducing a compact scheme for discretization of space variable while this improvement does not reduce the stability range and does not increase the computational cost. This method also preserves some conservation laws. Numerical tests are presented to confirm the theoretical results for the new numerical method by using the cubic nonlinear Schrödinger equation with constant and variable coefficients and Gross-Pitaevskii equation.     

An improved algorithm for disaggregating microwave-derived soil moisture based on red, near-infrared and thermal-infrared data

Accurate high-resolution soil moisture data are needed for a range of agricultural and hydrologic activities. To improve the spatial resolution of ∼ 40 km resolution passive microwave-derived soil moisture, a methodology based on 1 km resolution MODIS (MODerate resolution Imaging Spectroradiometer) red, near-infrared and thermal-infrared data has been implemented at 4 km resolution. The three components of that method are (i) fractional vegetation cover, (ii) soil evaporative efficiency (defined as the ratio of actual to potential evaporation) and (iii) a downscaling relationship. In this paper, 36 different disaggregation algorithms are built from 3 fractional vegetation cover formulations, 3 soil evaporative efficiency models, and 4 downscaling relationships. All algorithms differ with regard to the representation of the nonlinear relationship between microwave-derived soil moisture and optical-derived soil evaporative efficiency. Airborne L-band data collected over an Australian agricultural area are used to both generate ∼ 40 km resolution microwave pixels and verify disaggregation results at 4 km resolution. Among the 36 disaggregation algorithms, one is identified as being more robust (insensitive to soil, vegetation and atmospheric variables) than the others with a mean slope between MODIS-disaggregated and L-band derived soil moisture of 0.94. The robustness of that algorithm is notably assessed by comparing the disaggregation results obtained using composited (averaged) Terra and Aqua MODIS data, and using data from Terra and Aqua separately. The error on disaggregated soil moisture is systematically reduced by compositing daily Terra and Aqua data with an error of 0.012 vol./vol.