Pull-in-based μg-resolution accelerometer: Characterization and noise analysis

The pull-in time (t_pi) of electrostatically actuated parallel-plate microstructures enables the realization of a high-sensitivity accelerometer that uses time measurement as the transduction mechanism. The key feature is the existence of a metastable region that dominates pull-in behavior, thus making pull-in time very sensitive to external accelerations. Parallel-plate MEMS structures have been designed and fabricated using a SOI micromachining process (SOIMUMPS) for the implementation of the accelerometer. This paper presents the experimental characterization of the microdevices, validating the concept and the analytical models used. The accelerometer has a measured sensitivity of 0.25 μs/μg and a bandwidth that is directly related to the pull-in time, BW = 1/2t_pi ≈ 50 Hz. These specifications place this sensor between the state of the art accelerometers found both in the literature and commercially. More importantly, the resolution of the measurement method used is very high, making the mechanical-thermal noise the only factor limiting the resolution. The in-depth noise analysis to the system supports these conclusions. The total measured noise floor of 400 μg (100 μs) is mainly due to the contribution of the environmental noise, due to lack of isolation of the experimental setup from the building vibrations (estimated mechanical thermal noise of 2.8 μg/√Hz). The low requirements of the electronic readout circuit makes this an interesting approach for high-resolution accelerometers.     

Designing adaptive learning itineraries using features modelling and swarm intelligence

In this paper, Bayesian network (BN) and ant colony optimization (ACO) techniques are combined in order to find the best path through a graph representing all available itineraries to acquire a professional competence. The combination of these methods allows us to design a dynamic learning path, useful in a rapidly changing world. One of the most important advances in this work, apart from the variable amount of pheromones, is the automatic processing of the learning graph. This processing is carried out by the learning management system and helps towards understanding the learning process as a competence-oriented itinerary instead of a stand-alone course. The amount of pheromones is calculated by taking into account the results acquired in the last completed course in relation to the minimum score required and by feeding this into the learning tree in order to obtain a relative impact on the path taken by the student. A BN is used to predict the probability of success, by taking historical data and student profiles into account. Usually, these profiles are defined beforehand; however, in our approach, some characteristics of these profiles, such as the level of knowledge, are classified automatically through supervised and/or unsupervised learning. By using ACO and BN, a fitness function, responsible for automatically selecting the next course in the learning graph, is defined. This is done by generating a path which maximizes the probability of each user??s success on the course. Therefore, the path can change in order to adapt itself to learners?? preferences and needs, by taking into account the pedagogical weight of each learning unit and the social behaviour of the system.     

Moving objects forecast in image sequences using autoregressive algorithms

The objective of this paper is to present an overall approach to forecasting the future position of the moving objects of an image sequence after processing the images previous to it. The proposed method makes use of classical techniques such as optical flow to extract objects’ trajectories and velocities, and autoregressive algorithms to build the predictive model. Our method can be used in a variety of applications, where videos with stationary cameras are used, moving objects are not deformed and change their position with time. One of these applications is traffic control, which is used in this paper as a case study with different meteorological conditions to compare with.

Aerodynamic and aeroelastic analyses on the CAARC standard tall building model using numerical simulation

The simulation of the wind action over the CAARC (Commonwealth Advisory Aeronautical Council) standard tall building model is performed in the present work. Aerodynamic and aeroelastic analyses are reproduced numerically in order to demonstrate the applicability of CFD techniques in the field of wind engineering. A major topic in this paper is referred to one of the first attempts to simulate the aeroelastic behavior of a tall building employing complex CFD techniques. Numerical results obtained in this work are compared with numerical and wind tunnel measurements and some important concluding remarks about the present simulation are also reported.     

MOE prediction in Abies pinsapo Boiss. timber: Application of an artificial neural network using non-destructive testing

Determining the modulus of elasticity of wood by applying an artificial neural network using the physical properties and non-destructive testing can be a useful method in assessments of the timber structure in old constructions. The modulus of elasticity of Abies pinsapo Boiss. timber was predicted in this study through the parameters of density, width, thickness, moisture content, ultrasonic wave propagation velocity and visual grading of the test pieces. A feedforward multilayer perceptron network was designed for this purpose, achieving 75.0% success in the testing or unknown group.     

Differential evolution solution to the SLAM problem

A new solution to the Simultaneous Localization and Modelling problem is presented in this paper. The algorithm is based on the stochastic search for solutions in the state space to the global localization problem by means of a differential evolution algorithm. This non linear evolutive filter, called Evolutive Localization Filter (ELF), searches stochastically along the state space for the best robot pose estimate. The set of pose solutions (the population) focuses on the most likely areas according to the perception and up to date motion information. The population evolves using the log-likelihood of each candidate pose according to the observation and the motion errors derived from the comparison between observed and predicted data obtained from the probabilistic perception and motion model.The proposed SLAM algorithm operates in two steps: in the first step the ELF filter is used at local level to re-localize the robot based on the robot odometry, the laser scan at a given position and a local map where only a low number of the last scans have been integrated. In the second step, the aligned laser measures and the corrected robot poses are used to detect whether the robot is revisiting a previously crossed area (i.e., a cycle in the robot trajectory exists). Once a cycle is detected, the Evolutive Localization Filter is used again to estimate the accumulated residual drift in the detected loop and then to re-estimate the robot poses in order to integrate the sensor measures in the global map of the environment.The algorithm has been tested in different environments to demonstrate the effectiveness, robustness and computational efficiency of the proposed approach.     

Incorporating technology in service-oriented i* business models: a case study

In recent years, considerable attention has been paid to enterprise information systems. This interest is motivated by the need for achieving better integration of new technologies (hardware and software) with the business processes of an organization. Business processes have become more and more dependent on technologies because technology has a direct impact on business processes, changing the way they are performed and thus also affecting the way analysts design the software system. However, at the present time, there are still some gaps between the definition of business processes and the technologies used in the organization. In practice, organizations have carried out their business processes using different technologies; however, it is sometimes not possible to determine how technologies are useful in achieving current business goals. This is because business models do not explicitly consider the technologies in the organizational requirements. The goal of this paper is to present a systematic process for integrating business processes and technologies at the conceptual level. To validate our approach, we present a case study that describes the processes of the inventory management department of a public research center.     

A Faà di Bruno Hopf algebra for a group of Fliess operators with applications to feedback

A Faà di Bruno type Hopf algebra is developed for a group of integral operators known as Fliess operators, where operator composition is the group product. Such operators are normally written in terms of generating series over a noncommutative alphabet. Using a general series expansion for the antipode, an explicit formula for the generating series of the compositional inverse operator is derived. The result is applied to analytic nonlinear feedback systems to produce an explicit formula for the feedback product, that is, the generating series for the Fliess operator representation of the closed-loop system written in terms of the generating series of the Fliess operator component systems. This formula is employed to provide a proof that local convergence is preserved under feedback.     

Admission control for a responsive distributed middleware using decision trees to model run-time parameters

The software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. The middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. This makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems. In this paper, we present such an admission control mechanism, we measure its accuracy in estimating the parameters of the model, and we evaluate its performance to determine its suitability for a real-time or responsive system.