1995
Autores
Long, J; Inoue, H; Kato, T; Miyake, N; Green, T; Harrison, M; Pollitzer, E;
Publicação
Advances in Human Factors/Ergonomics
Abstract
1995
Autores
SARAIVA, JT; MIRANDA, V; PINTO, LMVG;
Publicação
1995 IEEE POWER INDUSTRY COMPUTER APPLICATION CONFERENCE, CONFERENCE PROCEEDINGS
Abstract
This paper presents a Monte-Carlo algorithm considering loads defined by fuzzy numbers. In this methodology states are sampled according to the probabilistic models governing the life cycle of system components while fuzzy concepts are used to model uncertainty related to future load behavior. This model can be used to evaluate generation/transmission power system reliability for long term planning studies as one uses the more adequate uncertainty models for each type of data. For each sampled state a Fuzzy Optimal Power Flow is run so that one builds its power not supplied membership function. The paper proposes new indices reflecting the integration of probabilistic models and fuzzy concepts and discusses the application of variance reduction techniques if loads are defined by fuzzy numbers. A case-study based on the IEEE 30 bus system illustrates this methodology.
1995
Autores
Pinto, AA; Rand, DA;
Publicação
Ergodic Theory and Dynamical Systems
Abstract
Sullivan's scaling function provides a complete description of the smooth conjugacy classes of cookie-cutters. However, for smooth conjugacy classes of Markov maps on a train track, such as expanding circle maps and train track mappings induced by pseudo-Anosov systems, the generalisation of the scaling function suffers from a deficiency. It is difficult to characterise the structure of the set of those scaling functions which correspond to smooth mappings. We introduce a new invariant for Markov maps called the solenoid function. We prove that for any prescribed topological structure, there is a one-to-one correspondence between smooth conjugacy classes of smooth Markov maps and pseudo-Hölder solenoid functions. This gives a characterisation of the moduli space for smooth conjugacy classes of smooth Markov maps. For smooth expanding maps of the circle with degree d this moduli space is the space of Hölder continuous functions on the space {0,…, d - 1} satisfying the matching condition.
1995
Autores
Pinto, AA; Rand, DA;
Publicação
Ergodic Theory and Dynamical Systems
Abstract
We classify the C1+a structures on embedded trees. This extends the results of Sullivan on embeddings of the binary tree to trees with arbitrary topology and to embeddings without bounded geometry and with contact points. We used these results in an earlier paper to describe the moduli spaces of smooth conjugacy classes of expanding maps and Markov maps on train tracks. In later papers we will use those results to do the same for pseudo-Anosov diffeomorphisms of surfaces. These results are also used in the classification of renormalisation limits of C1+a diffeomorphisms of the circle.
1995
Autores
BRITO, P;
Publicação
ANNALS OF OPERATIONS RESEARCH
Abstract
We recall a formalism based on the notion of symbolic object (Diday [15], Brito and Diday [8]), which allows to generalize the classical tabular model of Data Analysis. We study assertion objects, a particular class of symbolic objects which is endowed with a partial order and a quasi-order. Operations are then defined on symbolic objects. We study the property of completeness, already considered in Brito and Diday [8], which expresses the duality extension/intension. We formalize this notion in the framework of the theory of Galois connections and study the order structure of complete assertion objects. We introduce the notion of c-connection, as being a pair of mappings (f, g) between two partially ordered sets which should fulfil given conditions. A complete assertion object is then defined as a fixed point of the composed f o g; this mapping is called a ''completeness operator'' for it ''completes'' a given assertion object. The set of complete assertion objects forms a lattice and we state how suprema and infima are obtained. The lattice structure being too complex to allow a clustering study of a data set, we have proposed a pyramidal clustering approach [8]. The symbolic pyramidal clustering method builds a pyramid bottom-up, each cluster being described by a complete assertion object whose extension is the cluster itself. We thus obtain an inheritance structure on the data set. The inheritance structure then leads to the generation of rules.
1995
Autores
Matos M.A.; Ponce de Leão M.T.;
Publicação
International Transactions in Operational Research
Abstract
Distribution systems planning heavily depends on the predicted future consumptions in the service area. When statistical data exist about past consumptions, probabilistic forecasting methods may be applied, and expected cost/benifit and risk analysis are used to decide between different solutions. In most cases, however, this strategy is not applicable, due mainly to the lack of significant data (new developing areas, rapidly changing situations) and uncertainty of economic and social factors. In the latter case, the use of fuzzy models is an interesting alternative, accommodating expert planner's qualitative judgments about future loads and allowing us to use 'typical' load diagrams in new areas. The paper discusses the main concepts of electric distribution system planning when loads are fuzzy modeled, and presents an illustrative application example. © 1995.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.