Locally linear discriminant embedding: An efficient method for face recognition

In this paper an efficient feature extraction method named as locally linear discriminant embedding (LLDE) is proposed for face recognition. It is well known that a point can be linearly reconstructed by its neighbors and the reconstruction weights are under the sum-to-one constraint in the classical locally linear embedding (LLE). So the constrained weights obey an important symmetry: for any particular data point, they are invariant to rotations, rescalings and translations. The latter two are introduced to the proposed method to strengthen the classification ability of the original LLE. The data with different class labels are translated by the corresponding vectors and those belonging to the same class are translated by the same vector. In order to cluster the data with the same label closer, they are also rescaled to some extent. So after translation and rescaling, the discriminability of the data will be improved significantly. The proposed method is compared with some related feature extraction methods such as maximum margin criterion (MMC), as well as other supervised manifold learning-based approaches, for example ensemble unified LLE and linear discriminant analysis (En-ULLELDA), locally linear discriminant analysis (LLDA). Experimental results on Yale and CMU PIE face databases convince us that the proposed method provides a better representation of the class information and obtains much higher recognition accuracies.     

Limit load and shakedown analysis of plastic structures under stochastic uncertainty

Problems from plastic analysis are based on the convex, linear or linearised yield/strength condition and the linear equilibrium equation for the stress (state) vector. In practice one has to take into account stochastic variations of several model parameters. Hence, in order to get robust maximum load factors, the structural analysis problem with random parameters must be replaced by an appropriate deterministic substitute problem. A direct approach is proposed based on the primary costs for missing carrying capacity and the recourse costs (e.g. costs for repair, compensation for weakness within the structure, damage, failure, etc.). Based on the mechanical survival conditions of plasticity theory, a quadratic error/loss criterion is developed. The minimum recourse costs can be determined then by solving an optimisation problem having a quadratic objective function and linear constraints. For each vector a(·) of model parameters and each design vector x, one obtains then an explicit representation of the “best” internal load distribution F^∗. Moreover, also the expected recourse costs can be determined explicitly. Consequently, an explicit stochastic nonlinear program results for finding a robust maximal load factor μ^∗. The analytical properties and possible solution procedures are discussed.     

Continuous State Dynamic Programming via Nonexpansive Approximation

This paper studies fitted value iteration for continuous state numerical dynamic programming using nonexpansive function approximators. A number of approximation schemes are discussed. The main contribution is to provide error bounds for approximate optimal policies generated by the value iteration algorithm.      

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.     

西门子数字输入中断模块的应用研究

介绍了如何在STEP7中配置西门子数字输入中断模块,如何进行软件中断处理,对中断标志位识别和常见编程处理给出了详细的描述.     

A piecewise analysis method to stability analysis of linear continuous/discrete systems with time‐varying delay

The delay‐dependent stability problem of linear continuous/discrete systems with time‐varying delay is investigated based on a piecewise analysis method (PAM). In the method, the variation interval of the time delay is firstly divided into several subintervals. By checking the variation of the Lyapunov functional in every subinterval, some new delay‐dependent stability criteria are derived. Several numerical examples show that our method can lead to much less conservative results than those in the existing references. Moreover, when the number of the divided subintervals increases, the corresponding criteria can provide an improvement on the results. Copyright © 2008 John Wiley & Sons, Ltd.     

Output feedback variable structure control of uncertain linear systems in the presence of actuator dynamics

A new output feedback variable structure control scheme is developed based on a novel passivity idea. This scheme may practically stabilize a class of higher‐relative‐degree uncertain linear systems, and realize output tracking and disturbance attenuation as well. The controller is composed of linear filters and a single relay, without employing real‐time exact differentiators. Under this framework, we also explain how actuator dynamics affect the closed loop behavior. A simulation example shows the simplicity and efficiency of this method. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

A new adaptive backstepping Coulomb friction compensator for servo control systems

A new Coulomb friction compensator is proposed for servo control systems in this paper. The novelty of the new approach lies in its capability of assigning the eigenvalues of the resulting closed loop system while attacking the problem. First, based on the standard backstepping methodology, an implicit Lyapunov function, with part of the components being only symbolically constructed at the very beginning, is utilized. To increase the robustness of the system against disturbance and model inaccuracy, an integral term is employed in the design. Using part of the variable gradient method, we are able to turn the implicit Lyapunov function into an explicit one, which is positive definite, and whose time‐derivative is negative definite. Second, it will be shown that the resulting closed loop error system is a switched linear system with two possible active modes that share the same set of eigenvalues, which is at our disposal. Unlike the common adaptive control design methods, such as the Control Lyapunov Function approach, in which the gains are typically positive but otherwise arbitrary, and are hence difficult to choose and have a lack of connection with the system's performance, our new scheme imposes two further constraints on the gains. It turns out that we can then match these gains with the coefficients of the desired characteristic equation of the closed loop system. In this respect, the gains are linked to the system's overall performance, which is a new and very appealing feature for such a scheme. Finally, a procedure of constructing a common Lyapunov function is provided to prove exponential stability of the aforementioned switched linear system. In addition, using the invariance principle, we will show the convergence of the estimated Coulomb friction coefficient to its real value. Numerical simulations are given to validate the effectiveness of the design and its robustness against friction time‐variations. Compared to existing results, the proposed scheme is much simpler, hence, much more advantageous computationally. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Analogy and duality of texture analysis by harmonics or indicators

According to the classic harmonic approach, an orientation density function (odf)f is expanded into its corresponding Fourier orthogonal series with respect to generalized spherical harmonics, and a pole density function (pdf) into its corresponding Fourier orthogonal series with respect to spherical harmonics. While pdfs are even (antipodally symmetric) functions, odfs are generally not. Therefore, the part of the odf which cannot be determined from normal diffraction pdfs can be mathematically represented as the odd portion of its series expansion. If the odff is given, the even part can be mathematically represented explicitly in terms off itself. Thus, it is possible to render maps ofharmonic orientation ghosts, and to evaluatevariants of mathematical standard odfs resulting in identical pdfs independent of pdf data. However, if only normal diffraction pdfs are known, the data-dependentvariation width of feasible odfs remained unaccessible, and within the harmonic approach a measure of confidence in a solution of the pdf-to-odf inversion problem does not exist.According to any discrete approach, an odff defined on some setG of orientations is expanded into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofG, and a pdf defined on the upper (lower) unit hemisphereS ₊ ^{3 3} into its corresponding Fourier orthogonal series with respect to indicator functions of the elements of a partition ofS ₊ ³ . The ambiguity of the pdf-to-odf inversion problem is discussed in terms of column-rank deficiency of the augmented projection matrix. The implication of the harmonic approach to split an odf into auniquely determined and anundetermined part does no longer seem to be reasonable. However, it is possible to numerically determine data-dependent confidence intervals for the Fourier coefficients with respect to the indicator functions which can be immediately interpreted as mean orientation densities within the elements of the partition ofG. Doing so for all Fourier coefficients in the finite series expansion, i.e. for all elements of the partition of the setG, eventually results in the data-dependent variation width of odfs feasible with respect to given pdf data, and to the partitions ofG andS ₊ ³ .Thus it is confirmed that the appearance of orientation ghosts, in particular correlations oftrue andghost orientation components, depends on the representation of an odf. It may be questioned whether in practical applications the implicit assumption of the harmonic method that the even part can be determined uniquely and free of error is generally a reasonable initial condition to develop ghost correction procedures.     

Supervisory control using variable lookahead policies

This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES.