A polynomial approach to the realization of J-lossless behaviours

In this paper, a class of behaviours known as J-lossless behaviours is introduced, where J is a symmetric two-variable polynomial matrix. For a certain J, it is shown that the resulting set of J-lossless behaviours are SISO behaviours such that for each of such behaviours, there exists a quadratic differential form which is positive for nonzero trajectories of the behaviour and whose derivative is equal to the product of the input variable and the derivative of the output variable. Earlier, Van der Schaft and Oeloff had considered a specific form of realization for such behaviours that plays an important role in their model reduction procedure. In our paper, we give a method of computation of a state space realization from a transfer function of such a behaviour in the same form as considered by Van der Schaft and Oeloff, using polynomial algebraic methods. Apart from being useful in enlarging the scope of the model reduction procedure of Van der Schaft and Oeloff, we show that our method of realization also has application in the synthesis of lossless mechanical systems with given transfer functions using springs and masses

Reed-Solomon list decoding from a system-theoretic perspective

In this paper, the Sudan-Guruswami approach to list decoding of Reed-Solomon (RS) codes is cast in a system-theoretic framework. With the data, a set of trajectories or time series is associated which is then modeled as a so-called behavior. In this way, a connection is made with the behavioral approach to system theory. It is shown how a polynomial representation of the modeling behavior gives rise to the bivariate interpolating polynomials of the Sudan-Guruswami approach. The concept of "weighted row reduced" is introduced and used to achieve minimality. Two decoding methods are derived and a parametrization of all bivariate interpolating polynomials is given

Agent-Based Computational Modeling And Macroeconomics

Agent-based Computational Economics (ACE) is the computational study of economic processes modeled as dynamic systems of interacting agents. This essay discusses the potential use of ACE modeling tools for the study of macroeconomic systems. Points are illustrated using an ACE model of a two-sector decentralized market economy. Related work can be accessed here: http://www.econ.iastate.edu/tesfatsi/amulmark.htmagent-based computational economics

A Unified Analytical Look at Reynolds Flocking Rules

In this paper, we present a unified theoretical view of the so-called ``Flocking Rules of Reynolds'' introduced in 1987. No equations describing the rules or mathematical models of the mobile agents known as ``boids'' were presented in the original work by Reynolds. We show how to model a group of autonomous mobile agents by dynamic nets and achieve flocking by dissipation of the structural energy of the multi-agent system. As a by-product, we obtain a single protocol called the (alpha,alpha) protocol that encompasses all three flocking rules of Reynolds. We provide geometric interpretations of the advanced forms of some of these flocking rules. Simulation results are provided that demonstrate flocking of 100 agents towards a sink

Agent-Based Computational Economics: A Constructive Approach to Economic Theory

This chapter explores the potential advantages and disadvantages of Agent-based Computational Economics (ACE) for the study of economic systems. General points are concretely illustrated using an ACE model of a two-sector decentralized market economy. Six issues are highlighted: Constructive understanding of production, pricing, and trade processes; the essential primacy of survival; strategic rivalry and market power; behavioral uncertainty and learning; the role of conventions and organizations; and the complex interactions among structural attributes, behaviors, and institutional arrangements. Extensive annotated pointers to ACE surveys, research, course materials, and software can be accessed here: http://www.econ.iastate.edu/tesfatsi/ace.htmagent-based computational economics; Learning; network formation; decentralized market economy