A non-isodimensional finite-element approach to the modeling of transient flow and mass transport through domains with thin layers

A new finite element method (FEM) is developed for transient flow problems in multiple-scale media. Double or multiple nodes are used to model thin layers, or any set of 1D regions, as a discontinuity of variables and transform their effects into a body load acting at the interface with the rest of the domain. The formulation, called Multiple-Node FEM, offers two advantages. First, it removes the need for meshing and numerical integration along the thin direction and reduces the number of degrees of freedom. Second, it provides the basis for a non-isodimensional FEM which seamlessly combines domains with different dimensions.     

Combined asymptotic finite-element modeling of thin layers for scalar elliptic problems

Thin layers with material properties which differ significantly from those of the adjacent media appear in a variety of applications, as in the form of fiber coatings in composite materials. Fully modeling of such thin layers by standard finite element (FE) analysis is often associated with difficult meshing and high computational cost. Asymptotic procedures which model such thin domains by an interface of no thickness on which appropriate interface conditions are devised have been known in the literature for some time. The present paper shows how the first-order asymptotic interface model proposed by Bövik in 1994, and later generalized by Benveniste, can be incorporated in a FE formulation, to yield an accurate and efficient computational scheme for problems involving thin layers. This is done here for linear scalar elliptic problems in two dimensions, prototyped by steady-state heat conduction. Moreover, it is shown that by somewhat modifying the formulation of the Bövik–Benveniste asymptotic model, the proposed formulation is made to preserve the self-adjointness of the original three-phase problem, thus leading to a symmetric FE stiffness matrix. Numerical examples are presented that demonstrate the performance of the method, and show that the proposed scheme is more cost-effective than the full standard FE modeling of the layer.     

A recursive formulation of Galerkin''s method in terms of the tau method: Bounded and unbounded domains

The recursive formulation of the Tau Method (see [1,2]) is used to simulate the method of Galerkin. As a result of this, a new recursive formulation of Galerkin's Method is deduced. Furthermore, it is shown that the Galerkin's Method is a special form of a Tau Method with a weighted polynomial basis. Examples of application to the numerical approximation of linear and nonlinear partial differential equations, defined on bounded and unbounded domains, are also given.     

A storage mapping technique for the implementation of protective domains

As part of its effort to periodically investigate various new promising concepts and techniques, the Digital Equipment Corporation had sponsored a research project whose purpose it was to effect a limited exploratory implementation of a novel protective operating system framework, based on the kernel/domain architecture. The project was carried out in 1972, and its successful completion led to a number of observations and insights. This paper concentrates on the technological solutions which were developed for the translation of a theoretical model on to commercially available hardware (the DEC PDP-11/45 minicomputer); specifically, the storage mapping technique and the intermodule call/return mechanism. We believe that we have made two contributions to the state of the art: firstly the identification of the doman's storage mapping properties which are expected to have an impact on the definition of storage class semantics for higher level programming languages to be developed for the domain environment, and secondly the development of a comprehensive intermodule communication mechanism combining all presently known forms of procedure activation within a single functional framework.     

基于FPGA的多模式数字匹配滤波器的设计与实现

数字匹配滤波器(DMF)是直接序列扩频(DSSS)通信系统的关键部件,采用FPGA设计数字匹配滤波器可以获得更高的系统性能。首先介绍了数字匹配滤波器的原理,然后阐述了多模式DMF的设计原理,在同一个直接序列扩频通信系统的接收端集成多种模式,实现对多种扩频比扩频信号的解扩,提高通信系统的性能。在此基础上,通过MATLAB仿真验证其有效性,最后给出了FPGA实现的过程和结果。     

Parallel implementation of finite-element/newton method for solution of steady-state and transient nonlinear partial differential equations

Domain decomposition by nested dissection for concurrent factorization and storage (CFS) of asymmetric matrices is coupled with finite element and spectral element discretizations and with Newton's method to yield an algorithm for parallel solution of nonlinear initial-and boundary-value problem. The efficiency of the CFS algorithm implemented on a MIMD computer is demonstrated by analysis of the solution of the two-dimensional, Poisson equation discretized using both finite and spectral elements. Computation rates and speedups for the LU-decomposition algorithm, which is the most time consuming portion of the solution algorithm, scale with the number of processors. The spectral element discretization with high-order interpolating polynomials yields especially high speedups because the ratio of communication to computation is lower than for low-order finite element discretizations. The robustness of the parallel implementation of the finite-element/Newton algorithm is demonstrated by solution of steady and transient natural convection in a two-dimensional cavity, a standard test problem for low Prandtl number convection. Time integration is performed using a fully implicit algorithm with a modified Newton's method for solution of nonlinear equations at each time step. The efficiency of the CFS version of the finite-element/Newton algorithm compares well with a spectral element algorithm implemented on a MIMD computer using iterative matrix methods.Submitted toJ. Scientific Computing, August 25, 1994.     

A variant of cyclic pursuit for target tracking applications: theory and implementation

This paper presents a variant of the cyclic pursuit strategy that can be used for target tracking applications. Cyclic pursuit has been extensively used in multi-agent systems for a variety of applications. In order to monitor a target point or to track a slowly moving vehicle, we propose to use a group of non-holonomic vehicles. At equilibrium, the vehicles form a rigid polygonal around the target while encircling it. Necessary conditions for the existence of equilibrium and the stability of equilibrium formations are analysed considering unicycle model of the vehicles. The strategy is then applied to miniature aerial vehicles (MAV) represented by 6-DOF dynamical model. Finally the results are verified in a hardware in-loop simulator in real time, which included all on-board electronics of the MAVs.     

A three-loop model-following control structure: theory and implementation

This article presents a novel three-loop control system, which supplements control structures known from the literature as model following control (MFC). The major advantage of the proposed system is its high robustness to process parameter variations; it is much higher than that offered by single-loop or two-loop control systems. Features of the new structure are revealed by a theoretical analysis that has been carried out from the viewpoint of requirements for a force/pose controller of a Stäubli RX60 manipulator. This article shows how the proposed control structure responds to such strong process parameter variations and makes a comparison to results yielded by single-loop control structures.     

POPART: partial optical implementation of adaptive resonance theory2

Adaptive resonance architectures are neural nets that are capable of classifying arbitrary input patterns into stable category representations. A hybrid optoelectronic implementation utilizing an optical joint transform correlator is proposed and demonstrated. The resultant optoelectronic system is able to reduce the number of calculations compared to a strictly computer-based approach. The result is that, for larger images, the optoelectronic system is faster than the computer-based approach.     

软件自动化测试理论及其实现

本文阐述了软件自动化测试的基本理论及实现过程,并对其具体应用情况进行了分析和总结,供大家参考和探讨.     

The fractional Fourier transform: theory, implementation and error analysis

The fractional Fourier transform is a time–frequency distribution and an extension of the classical Fourier transform. There are several known applications of the fractional Fourier transform in the areas of signal processing, especially in signal restoration and noise removal. This paper provides an introduction to the fractional Fourier transform and its applications. These applications demand the implementation of the discrete fractional Fourier transform on a digital signal processor (DSP). The details of the implementation of the discrete fractional Fourier transform on ADSP-2192 are provided. The effect of finite register length on implementation of discrete fractional Fourier transform matrix is discussed in some detail. This is followed by the details of the implementation and a theoretical model for the fixed-point errors involved in the implementation of this algorithm. It is hoped that this implementation and fixed-point error analysis will lead to a better understanding of the issues involved in finite register length implementation of the discrete fractional Fourier transform and will help the signal processing community make better use of the transform.     

A digital architecture for support vector machines: theory, algorithm, and FPGA implementation

In this paper, we propose a digital architecture for support vector machine (SVM) learning and discuss its implementation on a field programmable gate array (FPGA). We analyze briefly the quantization effects on the performance of the SVM in classification problems to show its robustness, in the feedforward phase, respect to fixed-point math implementations; then, we address the problem of SVM learning. The architecture described here makes use of a new algorithm for SVM learning which is less sensitive to quantization errors respect to the solution appeared so far in the literature. The algorithm is composed of two parts: the first one exploits a recurrent network for finding the parameters of the SVM; the second one uses a bisection process for computing the threshold. The architecture implementing the algorithm is described in detail and mapped on a real current-generation FPGA (Xilinx Virtex II). Its effectiveness is then tested on a channel equalization problem, where real-time performances are of paramount importance.     

An alternative structure for next generation regulatory controllers: Part I: Basic theory for design, development and implementation

Even though employed widely in industrial practice, the popular PID controller has weaknesses that limit its achievable performance, and an intrinsic structure that makes tuning not only more complex than necessary, but also less transparent with respect to the key attributes of the overall controller performance, namely: robustness, set-point tracking, and disturbance rejection. In this paper, we propose an alternative control scheme that combines the simplicity of the PID controller with the versatility of model predictive control (MPC) while avoiding the tuning problems associated with both. The tuning parameters of the proposed control scheme are related directly to the controller performance attributes; they are normalized to lie between 0 and 1; and they arise naturally from the formulation in a manner that makes it possible to tune the controller directly for each performance attribute independently. The result is a controller that can be designed and implemented much more directly and transparently, and one that outperforms the classical PID controller both in set-point tracking and disturbance rejection while using precisely the same process reaction curve information required to tune PID controllers. The design, implementation and performance of the controller are demonstrated via simulation on a nonlinear polymerization process.     

Combinations of collocation and finite-element methods for Poisson''s equation

In this paper, we provide a framework of combinations of collocation method (CM) with the finite-element method (FEM). The key idea is to link the Galerkin method to the least squares method which is then approximated by integration approximation, and led to the CM. The new important uniformly V⁰_h-elliptic inequality is proved. Interestingly, the integration approximation plays a role only in satisfying the uniformly V⁰_h-elliptic inequality. For the combinations of the finite-element and collocation methods (FEM-CM), the optimal convergence rates can be achieved. The advantage of the CM is to formulate easily linear algebraic equations, where the associated matrices are positive definite but nonsymmetric. We may also solve the algebraic equations of FEM and the collocation equations directly by the least squares method, thus, to greatly improve numerical stability. Numerical experiments are also carried for Poisson's problem to support the analysis. Note that the analysis in this paper is distinct from the existing literature, and it covers a large class of the CM using various admissible functions, such as the radial basis functions, the Sinc functions, etc.     

A hybrid PC/PLC architecture for manufacturing-system control—theory and implementation

This paper presents a novel and generic PC/PLC-based software/hardware architecture for the control of flexible manufacturing workcells. The proposed implementation methodology is based on the utilization of any one of the available formal discrete-event-system control theories in conjunction with state-of-the-art industrial programmable-logic controllers (PLCs). The methodology has been illustrated to be a viable technique through its actual implementation in our laboratory using a robotic-workcell testbed. The specific control theory used is a combination of Extended Moore Automata and Ramadge-Wonham Automata that has been developed by our research group. The modular control software architecture has been developed for MS-Windows environments (running on one PC interfaced to the PLCs) and allows the use of different formal control theories as well as different commercial PLC hardware. The effective graphical user interface provides a transparent programming environment, where users are not expected to have a full knowledge of the formal control theory used.     

Causal maps: theory, implementation, and practical applications in multiagent environments

Analytical techniques are generally inadequate for dealing with causal interrelationships among a set of individual and social concepts. Usually, causal maps are used to cope with this type of interrelationships. However, the classical view of causal maps is based on an intuitive view with ad hoc rules and no precise semantics of the primitive concepts, nor a sound formal treatment of relations between concepts. We solve this problem by proposing a formal model for causal maps with a precise semantics based on relational algebra and the software tool, CM-RELVIEW, in which it has been implemented. Then, we investigate the issue of using this tool in multiagent environments by explaining through different examples how and why this tool is useful for the following aspects: 1) the reasoning on agents' subjective views, 2) the qualitative distributed decision making, and 3) the organization of agents considered as a holistic approach. For each of these aspects, we focus on the computational mechanisms developed within CM-RELVIEW to support it.     

Set Membership approximation theory for fast implementation of Model Predictive Control laws

In this paper, the use of Set Membership (SM) methodologies is investigated in the approximation of Model Predictive Control (MPC) laws for linear systems. Such approximated MPC laws are derived from a finite number ν of exact control moves computed off-line. Properties, in terms of guaranteed approximation error, closed-loop stability and performance, are derived assuming only the continuity of the exact predictive control law. These results are achieved by means of two main contributions. At first, it will be shown that if the approximating function enjoys two key properties (i.e. fulfillment of input constraints and explicit evaluation of a bound on the approximation error, which converges to zero as ν increases), then it is possible to guarantee the boundedness of the controlled state trajectories inside a compact set, their convergency to an arbitrary small neighborhood of the origin, and satisfaction of state constraints. Moreover, the guaranteed performance degradation, in terms of maximum state trajectory distance, can be explicitly computed and reduced to an arbitrary small value, by increasing ν. Then, two SM approximations are investigated, both enjoying the above key properties. The first one minimizes the guaranteed approximation error, but its on-line computational time increases with ν. The second one has higher approximation error, but lower on-line computational time which is constant with ν when the off-line computed moves are suitably chosen. The presented approximation techniques can be systematically employed to obtain an efficient MPC implementation for “fast” processes. The effectiveness of the proposed techniques is tested on two numerical examples.