Agora University Editing House: Journals
Not a member yet
1458 research outputs found
Sort by
On Guaranteed Global Exponential Stability Of Polynomial Singularly Perturbed Control Systems
Full text linkThe problem of global exponential stability for a class of nonlinear singularly perturbed systems is examined in this paper. The stability analysis is based on the use of basic results of integral manifold of nonlinear singularly perturbed systems, the composite Lyapunov method and the notations and properties of Tensoriel algebra. Some of the derived results are presented as linear matrix inequalities (LMIs) feasibility tests. Moreover, we pointed out that if the global exponential stability of the reduced order subsystem is established this is equivalent to guarantee the global exponential stability of the original high order closed loop system. An upper bound e1 of the small parameter e , can also be determined up to which established stability conditions via LMI’s are maintained verified. A numerical example is given to illustrate the proposed approach
Coordinated Control Of Mobile Robots Based On Artificial Vision
Full text linkThis work presents a control strategy for coordination of multiple robots based on artificial vision to measure the relative posture between them, in order to reach and maintain a specified formation. Given a leader robot that moves about an unknown trajectory with unknown velocity, a controller is designed to maintain the robots following the leader at a certain distance behind, by using visual information about the position of the leader robot. The control system is proved to be asymptotically stable at the equilibrium point, which corresponds to the accomplishment of the navigation objective. Experimental results with two robots, a leader and a follower, are included to show the performance of the vision-based control system
From Algorithms to (Sub-)Symbolic Inferences in Multi-Agent Systems
Full text linkExtending metaphorically the Moisilean idea of “nuanced-reasoning logic” and adapting it to the e-world age of Information Technology (IT), the paper aims at showing that new logics, already useful in modern software engineering, become necessary mainly for Multi-Agent Systems (MAS), despite obvious adversities. The first sections are typical for a position paper, defending such logics from an anthropocentric perspective. Through this sieve, Section 4 outlines the features asked for by the paradigm of computing as intelligent interaction, based on “nuances of nuanced-reasoning”, that should be reflected by agent logics. To keep the approach credible, Section 5 illustrates how quantifiable synergy can be reached - even in advanced challenging domains, such as stigmergic coordination - by injecting symbolic reasoning in systems based on sub-symbolic “emergent synthesis”. Since for future work too the preferred logics are doxastic, the conclusions could be structured in line with the well-known agent architecture: Beliefs, Desires, Intentions
Realization of Embedded Multimedia System Based On Dual-Core Processor OMAP5910
Full text linkThis paper focuses on the realization of a complete embedded system using the dual-core processor OMAP5910. Detailed description of how to compose the hardware system is presented with a description of the software system on our platform. Tasks communication between the two cores is realized using the DSP driver. The system bootloader and the DSP bootloader are described in detail. The implementation of the MPEG-4 video decoder has been realized on the presented system. Higher speed can be achieved and less power is needed for MPEG-4 video processing on the dual-core platform. This dual-core system can be applied to 3G wireless communication, robot control and vision systems
A Programming Perspective of the Membrane Systems
Full text linkWe present an operational semantics of the membrane systems, using an appropriate notion of configurations and sets of inference rules corresponding to the three stages of an evolution step in membrane systems: maximal parallel rewriting step, parallel communication of objects through membranes, and parallel membrane dissolving. We define various arithmetical operations over multisets in the framework of membrane systems, indicating their complexity and presenting the membrane systems which implement the arithmetic operations. Finally we discuss and compare various sequential and parallel software simulators of the membrane systems, emphasizing their specific feature
65 Years from Birth of Prof. Gheorghe S. Nadiu (1941-1998)
Full text linkIn 1967, Gheorghe S. Nadiu publishes in “Mathematical studies and researches”, the article “On a method for the construction of Three - valued Åukasiewicz algebras” (Romania), cited in the book “Cylindric Algebras” by P. Monk, L. Henkin, A. Tarski. This article attracted the attention of Grigore C. Moisil, who offers him a scholarship, taking him out of production to make his doctorate at the Mathematic Institute of the Romanian Academy. He publishes more than 50 scientific papers in Theory of Algorithms, Logics of mathematics and Theory of Categories fields.“Gheorghe S. Nadiu, by introducing the notion of quantified filter in a boolean monadic algebra, showed how one can obtain a trivalent Åukasiewicz algebra; also, he obtained an algebraic characterization of a completitude theorem from the intuitionist logic of Kripke.” (G. St. Andonie, Science History in Romania, Academic Publishing House, SRR, 1981)
One More Universality Result for P Systems with Objects on Membranes
Full text linkWe continue here the attempt to bridge brane calculi with membrane computing, following the investigation started in [2]. Specifically, we consider P systems with objects placed on membranes, and processed by membrane operations. The operations used in this paper are membrane creation (cre), and membrane dissolution (dis), defined in a way which reminds the operations pino, exo from a brane calculus from [1]. For P systems based on these operations we prove the universality, for one of the two possible variants of the operations; for the other variant the problem remains open
A Comprehensive Trust Model Based on Multi-factors for WSNs
Full text linkThe goal of this paper is to introduce a novel trust model for wireless sensor networks. This trust model calculates trust value of nodes through two kinds of trusts: private trust and interactive trust of a node. Private trust focuses on the past record of a node’s sensing and its remaining energy. Interactive trust cares for the interaction of a node with its neighbors. This trust model can recognize faulty nodes inside a network, reduce their impaction to data acquisition, and select a trust routing for precise data transmission. A simulation is given and shows that this trust model has a higher performance than TMS and ECCR in some aspects. But it consumes more energy than ECCR for its comprehensive structure of data