Scholarly

Optimal Controllers with Actuator Saturation for Nonlinear Structures

Year: 2010 Volume: 4 Issue: 1 56 - 62 Pages

Abstract: Since the actuator capacity is limited, in the real application of active control systems under sever earthquakes it is conceivable that the actuators saturate, hence the actuator saturation should be considered as a constraint in design of optimal controllers. In this paper optimal design of active controllers for nonlinear structures by considering actuator saturation, has been studied. The proposed method for designing optimal controllers is based on defining an optimization problem which the objective has been to minimize the maximum displacement of structure when a limited capacity for actuator has been used. To this end a single degree of freedom (SDF) structure with a bilinear hysteretic behavior has been simulated under a white noise ground acceleration of different amplitudes. Active tendon control mechanism, comprised of prestressed tendons and an actuator, and extended nonlinear Newmark method based instantaneous optimal control algorithm have been used. To achieve the best results, the weights corresponding to displacement, velocity, acceleration and control force in the performance index have been optimized by the Distributed Genetic Algorithm (DGA). Results show the effectiveness of the proposed method in considering actuator saturation. Also based on the numerical simulations it can be concluded that the actuator capacity and the average value of required control force are two important factors in designing nonlinear controllers which consider the actuator saturation.

A Delay-Tolerant Distributed Query Processing Architecture for Mobile Environment

Year: 2010 Volume: 4 Issue: 1 51 - 55 Pages

Abstract: The intermittent connectivity modifies the “always on" network assumption made by all the distributed query processing systems. In modern- day systems, the absence of network connectivity is considered as a fault. Since the last upload, it might not be feasible to transmit all the data accumulated right away over the available connection. It is possible that vital information may be delayed excessively when the less important information takes place of the vital information. Owing to the restricted and uneven bandwidth, it is vital that the mobile nodes make the most advantageous use of the connectivity when it arrives. Hence, in order to select the data that needs to be transmitted first, some sort of data prioritization is essential. A continuous query processing system for intermittently connected mobile networks that comprises of a delaytolerant continuous query processor distributed across the mobile hosts has been proposed in this paper. In addition, a mechanism for prioritizing query results has been designed that guarantees enhanced accuracy and reduced delay. It is illustrated that our architecture reduces the client power consumption, increases query efficiency by the extensive simulation results.

PZ: A Z-based Formalism for Modeling Probabilistic Behavior

Year: 2010 Volume: 4 Issue: 1 42 - 50 Pages

Authors:
Hassan Haghighi

Abstract: Probabilistic techniques in computer programs are becoming more and more widely used. Therefore, there is a big interest in the formal specification, verification, and development of probabilistic programs. In our work-in-progress project, we are attempting to make a constructive framework for developing probabilistic programs formally. The main contribution of this paper is to introduce an intermediate artifact of our work, a Z-based formalism called PZ, by which one can build set theoretical models of probabilistic programs. We propose to use a constructive set theory, called CZ set theory, to interpret the specifications written in PZ. Since CZ has an interpretation in Martin-L┬¿of-s theory of types, this idea enables us to derive probabilistic programs from correctness proofs of their PZ specifications.

Statistical Models of Network Traffic

Year: 2010 Volume: 4 Issue: 1 33 - 41 Pages

Abstract: Model-based approaches have been applied successfully to a wide range of tasks such as specification, simulation, testing, and diagnosis. But one bottleneck often prevents the introduction of these ideas: Manual modeling is a non-trivial, time-consuming task. Automatically deriving models by observing and analyzing running systems is one possible way to amend this bottleneck. To derive a model automatically, some a-priori knowledge about the model structure–i.e. about the system–must exist. Such a model formalism would be used as follows: (i) By observing the network traffic, a model of the long-term system behavior could be generated automatically, (ii) Test vectors can be generated from the model, (iii) While the system is running, the model could be used to diagnose non-normal system behavior. The main contribution of this paper is the introduction of a model formalism called 'probabilistic regression automaton' suitable for the tasks mentioned above.

Dynamic Attribute Dependencies in Relational Attribute Grammars

Year: 2010 Volume: 4 Issue: 1 24 - 32 Pages

Abstract: Considering the theory of attribute grammars, we use logical formulas instead of traditional functional semantic rules. Following the decoration of a derivation tree, a suitable algorithm should maintain the consistency of the formulas together with the evaluation of the attributes. This may be a Prolog-like resolution, but this paper examines a somewhat different strategy, based on production specialization, local consistency and propagation: given a derivation tree, it is interactively decorated, i.e. incrementally checked and evaluated. The non-directed dependencies are dynamically directed during attribute evaluation.

Multiscale Analysis and Change Detection Based on a Contrario Approach

Year: 2010 Volume: 4 Issue: 1 15 - 23 Pages

Abstract: Automatic methods of detecting changes through satellite imaging are the object of growing interest, especially beca²use of numerous applications linked to analysis of the Earth’s surface or the environment (monitoring vegetation, updating maps, risk management, etc...). This work implemented spatial analysis techniques by using images with different spatial and spectral resolutions on different dates. The work was based on the principle of control charts in order to set the upper and lower limits beyond which a change would be noted. Later, the a contrario approach was used. This was done by testing different thresholds for which the difference calculated between two pixels was significant. Finally, labeled images were considered, giving a particularly low difference which meant that the number of “false changes” could be estimated according to a given limit.

Supporting QoS-aware Multicasting in Differentiated Service Networks

Year: 2010 Volume: 4 Issue: 1 5 - 14 Pages

Abstract: A scalable QoS aware multicast deployment in DiffServ networks has become an important research dimension in recent years. Although multicasting and differentiated services are two complementary technologies, the integration of the two technologies is a non-trivial task due to architectural conflicts between them. A popular solution proposed is to extend the functionality of the DiffServ components to support multicasting. In this paper, we propose an algorithm to construct an efficient QoSdriven multicast tree, taking into account the available bandwidth per service class. We also present an efficient way to provision the limited available bandwidth for supporting heterogeneous users. The proposed mechanism is evaluated using simulated tests. The simulated result reveals that our algorithm can effectively minimize the bandwidth use and transmission cost

Optimal Path Planning under Priori Information in Stochastic, Time-varying Networks

Year: 2010 Volume: 4 Issue: 1 1 - 4 Pages

Abstract: A novel path planning approach is presented to solve optimal path in stochastic, time-varying networks under priori traffic information. Most existing studies make use of dynamic programming to find optimal path. However, those methods are proved to be unable to obtain global optimal value, moreover, how to design efficient algorithms is also another challenge. This paper employs a decision theoretic framework for defining optimal path: for a given source S and destination D in urban transit network, we seek an S - D path of lowest expected travel time where its link travel times are discrete random variables. To solve deficiency caused by the methods of dynamic programming, such as curse of dimensionality and violation of optimal principle, an integer programming model is built to realize assignment of discrete travel time variables to arcs. Simultaneously, pruning techniques are also applied to reduce computation complexity in the algorithm. The final experiments show the feasibility of the novel approach.

International Journal of Information, Control and Computer Sciences

Archive

Last Issue

Top Journal

SUGGEST A JOURNAL