Search results for "Linear"
showing 10 items of 7165 documents
An Observation Framework for Multi-agent Systems
2009
Existing middleware platforms for multi-agent systems (MAS) do not provide general support for observation. On the other hand, observation is considered to be an important mechanism needed for realizing effective and efficient coordination of agents. This paper describes a framework called Agent Observable Environment (AOE) for observation-based interaction in MAS. The framework provides 1) possibility to model MAS components with RDF-based observable soft-bodies, 2) support for both query and publish/subscribe style ontology-driven observation, and 3) ability to restrict the visibility of observable information using observation rules. Additionally, we report on an implementation of the fr…
Multiobjective service restoration in distribution networks using an evolutionary approach and fuzzy sets
2000
Abstract In this article, the service restoration (SR) problem in electrical distribution networks is dealt with using an evolutionary strategy (ES) with a fuzzy definition of the conflicting objectives. The normal operation status allows the remote control of tie-switches, of capacitor banks and load connection. When a permanent fault occurs, the same remote control actions can be performed with the aim of restoring the service in the concerned areas. The status of these remotely controllable elements is the boolean optimisation variables for the SR problem. Besides this, here the SR problem is dealt with in a multiple objectives (MO) formulation. Indeed, the power losses’ term is consider…
A characterization of the line set of an odd-dimensional Baer subspace
1990
Generalizing a theorem of Beutelspacher and Seeger, we consider line sets\(\mathcal{L}\) inP=PG(2t + 1,q),t ∈ IN, with the following properties: (1) any (t + 1)-dimensional subspace ofP contains at least one line of\(\mathcal{L}\), (2) if a pointx ofP is incident with at least two lines of\(\mathcal{L}\) then the points in the factor geometryP/x which are induced by the lines of\(\mathcal{L}\) throughx form a blocking set of type (t, 1) inP/x, (3) any line of\(\mathcal{L}\) is coplanar with at least one further line of\(\mathcal{L}\). We will show that the examples of minimal cardinality are exactly the line sets of Baer subspaces ofP.
The OptQuest Callable Library
2005
In this chapter we discuss the development and application of a library of functions that is the optimization engine for the OptQuest system. OptQuest is commercial software designed for optimizing complex systems, such as those formulated as simulation models. OptQuest has been integrated with several simulation packages with the goal of adding optimization capabilities. The optimization technology within OptQuest is based on the metaheuristic framework known as scatter search. In addition to describing the functionality of the OptQuest Callable Library (OCL) with an illustrative example, we apply it to a set of unconstrained nonlinear optimization problems.
Bifurcations of Reachable Sets Near an Abnormal Direction and Consequences
2007
We describe precisely, under generic conditions, the contact and the bifurcations of the reachable set at time T along an abnormal direction, first for a single-input affine control system with constraint on the control, and then as an application for a sub-Riemannian system of rank 2. As a consequence we obtain in sub-Riemannian geometry a new splitting-up of the sphere near an abnormal minimizer γ into two sectors, bordered by the first Pontryagin’s cone along γ, called the L ∞-sector and the L 2-sector. Moreover we find again necessary and sufficient conditions of optimality of an abnormal trajectory for such systems, for any optimization problem.
Likelihood Calculations in Paternity Testing on the Basis of DNA-Fingerprints
1990
DNA-fingerprints seem to be a powerful tool in paternity testing. But the quantification of the results in terms of likelihood and likelihood ratios is a problem, because in most cases the correct genetic model and its parameters are not known. Two approaches have been suggested to circumvent these problems. The use of band sharing rates to distinguish between pairs of relatives and pairs of unrelated individuals, and the calculation of likelihood ratios on the basis of simplifying assumptions. The first approach reduces the available genetic evidence to “phenotypic” similarities. The second one makes unjustified simplifying assumptions. These two decision strategies have to be examined wit…
Guaranteed Error Bounds I
2014
In Chap. 3, we discussed the main ideas of fully reliable error control methods and the corresponding numerical algorithms with the paradigm of simple elliptic type problems. This chapter is intended to show a deep connection between a posteriori estimates of the functional type and physical relations generating the problem. Also, the goal of this chapter is to consider a wider set of problems arising in various applications and explain things in terms of computational mechanics. For this purpose, we begin with a simple class of mechanical problems (straight beams) and after that consider curvilinear beams and more complicated models of continuum mechanics (linear elasticity, viscous fluids…
Attracting sets in a deterministic discrete traffic model
2001
The fundamental diagram of the Nagel-Schreckenberg traffic model is derived analytically for the deterministic case using methods and concepts from nonlinear dynamics. It is shown that the possible states of the long-term behaviour form a globally attractive subset which can be well characterized. This attractive set of states is composed of coexisting attractors. The attractor concept is applied to a slow-to-start extension of the model. For this example it is shown that the attractive set consists of coexisting attractors with different macroscopic properties, that can be determined analytically.
Unknown order process emulation
2002
Approaches the emulation problem using feedforward neural networks of single input single output (SISO) processes, applying a backpropagation method with a higher convergence rate. In this kind of application, difficult problems appear when the system's order is a priori unknown. A search through the SISO processes space is proposed, aiming to find a favorable neural emulator over the training examples set.
Input-output finite-time stability of positive switched linear systems with state delays
2013
This paper is concerned with the problem of input-output finite-time stability (IO-FTS) for a class of discrete-time positive switched systems with time-varying delays. Two sufficient conditions for the existence of IO-FTS of such systems with respect to two different input signals are presented, respectively. All the results obtained are formulated in a set of linear inequalities. Two numerical examples are given to illustrate the effectiveness of the proposed results.