谈谈水泥土挡墙的合理计算

阐述了水泥土挡墙在工程基坑支护中的作用,并结合工程实例,对水泥土挡墙的合理计算模型进行了探讨。     

Dual–primal proximal point algorithms for extended convex programming

This paper presents a class of dual–primal proximal point algorithms (PPAs) for extended convex programming with linear constraints. By choosing appropriate proximal regularization matrices, the application of the general PPA to the equivalent variational inequality of the extended convex programming with linear constraints can result in easy proximal subproblems. In theory, the sequence generated by the general PPA may fail to converge since the proximal regularization matrix is asymmetric sometimes. So we construct descent directions derived from the solution obtained by the general PPA. Different step lengths and descent directions are chosen with the negligible additional computational load. The global convergence of the new algorithms is proved easily based on the fact that the sequences generated are Fejér monotone. Furthermore, we provide a simple proof for the O(1/t) convergence rate of these algorithms.     

一种相控阵天线安装精度检测与校准

文中论述了一种相控阵雷达天线安装后的精度检测方法。按照雷达天线安装后的几何形态,采用光学测量仪器进行相关的数据采集,建立检测的数学模型,利用线性回归法以及最小二乘法进行数据拟合,计算出安装后雷达天线底面与水平面的最大夹角和天线边缘与正北方向的夹角,并进行了试验误差评估和分析,依据检测数据对雷达天线的水平和方位角度进行校...     

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.     

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     

Modalities in linear logic weaker than the exponential “of course”: Algebraic and relational semantics

We present a semantic study of a family of modal intuitionistic linear systems, providing various logics with both an algebraic semantics and a relational semantics, to obtain completeness results. We call modality a unary operator on formulas which satisfies only one rale (regularity), and we consider any subsetW of a list of axioms which defines the exponential of course of linear logic. We define an algebraic semantics by interpreting the modality as a unary operation on an IL-algebra. Then we introduce a relational semantics based on pretopologies with an additional binary relationr between information states. The interpretation of is defined in a suitable way, which differs from the traditional one in classical modal logic. We prove that such models provide a complete semantics for our minimal modal system, as well as, by requiring the suitable conditions onr (in the spirit of correspondence theory), for any of its extensions axiomatized by any subsetW as above. We also prove an embedding theorem for modal IL-algebras into complete ones and, after introducing the notion of general frame, we apply it to obtain a duality between general frames and modal IL-algebras.     

Confidence regions of two-stage stochastic linear complementarity problems

Two-stage stochastic linear complementarity problems (TSLCP) model a large class of equilibrium problems subject to data uncertainty, and are closely related to two-stage stochastic optimization problems. The sample average approximation (SAA) method is one of the basic approaches for solving TSLCP and the consistency of the SAA solutions has been well studied. This paper focuses on building confidence regions of the solution to TSLCP when SAA is implemented. We first establish the error-bound condition of TSLCP and then build the asymptotic and nonasymptotic confidence regions of the solutions to TSLCP by error-bound approach, which is to combine the error-bound condition with central limit theory, empirical likelihood theory, and large deviation theory.