Extracting Modes of Constrained Structure with Elastic Supports from Free Test Data

The dynamic flexibility (DF) and improved dynamic flexibility (IDF) methods can be applied to extract constrained structural modes from free-free modal test data. The residual flexibility method is also good for boundaries of constrained structure with rigid supports. Under elastic support boundary conditions both the DF and residual flexibility methods cannot produce accurate results. This paper expands the previously published IDF method to become a more general approach for structural design engineers. A new method called the general dynamic flexibility (GDF) method has been developed in this paper to extract constrained structural modes from free test data. The GDF method can always be applied as follows: (1) when the boundary support stiffness is very stiff, the GDF method can accurately obtain results from rigid support as by Liu et al. in 2001 and Zhang and Wei in 2003; (2) when the support stiffness is soft, the present method can produce results similar to those free-free modal parameters measured by hanging structures using rubber band; (3) when the support stiffness is zero, the method can reproduce true free-free modal parameters; and (4) when the support stiffness has any finite values, the GDF method can also achieve satisfactory results for engineering use. The algorithm included in the GDF method converges rapidly and is numerically stable in the analysis. This feature is very practical for many engineering applications for using the GDF method.     

Constraint-based beautification and dimensioning of 3D polyhedral models reconstructed from 2D sketches

3D models reconstructed from 2D sketches are inaccurate because of the inherent inaccuracies in the input and the reconstruction method. It is therefore necessary to “beautify” them before use in CAD systems. We present a method that detects geometric constraints, such as parallel and orthogonal faces, present in the reconstructed model and then selects a subset that constrains the object sufficiently and consistently. The subset selection algorithm first prioritizes the constraints depending on their type and then uses a novel method, based on quasi-Newton optimization, to detect and eliminate redundant and inconsistent constraints. The remaining constraints then define the dimensions of the model fully and consistently. Results from our implementation show that the method can beautify and dimension recovered 3D models correctly at acceptable speed.     

CLP(ℜ) and some electrical engineering problems

The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP() language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.In this paper we illustrate the practical applicability of CLP() with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(). A detailed look at some of the more important programming techniques highlights the ability of CLP() to support well-known, powerful techniques from constraint programming. Our thesis is that CLP() is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia.     

Continuous-time norm-constrained Kalman filtering

This paper considers continuous-time state estimation when part of the state estimate or the entire state estimate is norm-constrained. In the former case continuous-time state estimation is considered by posing a constrained optimization problem. The optimization problem can be broken up into two separate optimization problems, one which solves for the optimal observer gain associated with the unconstrained state estimates, while the other solves for the optimal observer gain associated with the constrained state estimates. The optimal constrained state estimate is found by projecting the time derivative of an unconstrained estimate onto the tangent space associated with the norm constraint. The special case where the entire state estimate is norm-constrained is briefly discussed. The utility of the filtering results developed are highlighted through a spacecraft attitude estimation example. Numerical simulation results are included.     

Design of output constraints for model-based non-square controllers using interval operability

A steady-state interval operability methodology is introduced here for multivariable non-square systems with fewer inputs than output variables to be used in the design of model-based constrained controllers (MPC, DMC). For such systems, set-point control is not possible for all the outputs and interval control is needed. The proposed iterative approach enables the selection of the needed interval constraints systematically, so that the tightest possible control is achieved without rendering the control problem infeasible. The application of this methodology to high-dimensional industrial problems characterizing processes of Air Products and Chemicals and DuPont shows that very significant reduction of the constrained region can be achieved from the steady-state point of view. Ratios of the initial to the calculated volume of the constrained regions examined range between 10⁴ and 10⁸.     

A primary influence vertex approach to identify driving factors in complex integrated agri-industrial systems – an example from sugarcane supply and processing systems

Integrated agri-industrial systems (IAISs), such as sugarcane supply and processing systems, are complex systems and hence generally difficult to understand and manage. The large number factors in IAISs coupled with the complex interrelationships among the factors make it challenging to identify the points of intervention for improving their overall performance. Several approaches, such as the network theory and the Theory of Constraints have been used to identify important factors in systems with variations in success. This paper demonstrates a primary influence vertex approach for identifying and ranking the factors that drive the performance of IAISs. The approach is based on comprehensive causal network analyses and was tested in four relatively diverse large-scale sugarcane milling operations in South Africa. Results from the analyses were found to be consistent with the literature and external knowledge of the milling areas as at the time of the study. It is concluded that the approach can proffer a sound basis from which deeper rooted problems in systems can be identified on an ongoing basis. It is, however, recommended that the approach should be systematically compared with other relevant methods that are used to analyse complex systems.     

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.     

Barrier Lyapunov Functions for the control of output-constrained nonlinear systems

In this paper, we present control designs for single-input single-output (SISO) nonlinear systems in strict feedback form with an output constraint. To prevent constraint violation, we employ a Barrier Lyapunov Function, which grows to infinity when its arguments approach some limits. By ensuring boundedness of the Barrier Lyapunov Function in the closed loop, we ensure that those limits are not transgressed. Besides the nominal case where full knowledge of the plant is available, we also tackle scenarios wherein parametric uncertainties are present. Asymptotic tracking is achieved without violation of the constraint, and all closed loop signals remain bounded, under a mild condition on the initial output. Furthermore, we explore the use of an Asymmetric Barrier Lyapunov Function as a generalized approach that relaxes the requirements on the initial conditions. We also compare our control with one that is based on a Quadratic Lyapunov Function, and we show that our control requires less restrictive initial conditions. A numerical example is provided to illustrate the performance of the proposed control.     

Semantic Web Constraint Language and its application to an intelligent shopping agent

Semantic Web society was initially focused only on data, but then gradually moved toward knowledge. If a vision of the Semantic Web is to enhance humans' decision-making assisted by machines, a missing but important part is knowledge about constraints on data and concepts represented by ontology. This paper proposes a Semantic Web Constraint Language (SWCL) based on OWL, and shows its effectiveness in representing and solving an internet shopper's decision-making problems by implementing a shopping agent in the Semantic Web environment.     

字符分布特征对带有通配符串匹配问题的影响

近年来,字符串匹配问题被不断扩展。其中,具有代表性的是在模式中引入可变长度的通配符,本文称之为PMWL问题。针对此问题,已有工作分析了在不同的模式特征下,匹配数Ω随文本长度增加呈指数级增长。本文同时考虑文本分布特征和模式特征,建立了期望模型E(Ω)＝n*D*π(P),其中n为文本长度,D为模式中各通配符跨度的乘积,π(P)为基于字符分布的模式出现概率。实验部分,在人工随机数据和DNA真实数据上验证了E(Ω)的准确性,得到预测误差率分别为1.8%~3.2%和4.7%~7.8%;在不同字符分布中,分析了模式模长和通配符跨度对匹配数Ω的影响。E(Ω)模型揭示了Ω的增长趋势不一定呈指数级,而取决于π(P)和D的共同影响。此外,E(Ω)模型能够在线性时间内得到近似完备解。