Priority Events Determination For The Risk-oriented Management Of Electric Power System

The task of risk-oriented management of the electric power system in conditions of multi-criteria choice is considered. To determine the most effective measures, the implementation of which will reduce the magnitude of the risk of an emergency situation, multi-criteria analysis methods are applied. A comparative analysis of the multi-criteria alternative (ELECTRE) ranking method based on utility theory and the Pareto method, which defines a subset of non-dominant alternatives, is carried out. The Pareto method uses in its algorithm only qualitative characteristics of the advantage and allows only to distinguish a group of competitive solutions with the same degrees of non-dominance. Given the large number of evaluation criteria, the Pareto method is ineffective because the resulting subset of activities is in the field of effective trade-offs, when no element of the set of measures can be improved without degrading at least one of the other elements. The ELECTRE method is a pairwise comparison of multi-criteria alternatives based on utility theory. This method allows to identify a subset of the most effective activities. The number of elements of the resultant subset is regulated by taking into account the coefficients of importance of optimization criteria and expert preferences

Mechanisms for Automated Negotiation in State Oriented Domains

This paper lays part of the groundwork for a domain theory of negotiation, that is, a way of classifying interactions so that it is clear, given a domain, which negotiation mechanisms and strategies are appropriate. We define State Oriented Domains, a general category of interaction. Necessary and sufficient conditions for cooperation are outlined. We use the notion of worth in an altered definition of utility, thus enabling agreements in a wider class of joint-goal reachable situations. An approach is offered for conflict resolution, and it is shown that even in a conflict situation, partial cooperative steps can be taken by interacting agents (that is, agents in fundamental conflict might still agree to cooperate up to a certain point). A Unified Negotiation Protocol (UNP) is developed that can be used in all types of encounters. It is shown that in certain borderline cooperative situations, a partial cooperative agreement (i.e., one that does not achieve all agents' goals) might be preferred by all agents, even though there exists a rational agreement that would achieve all their goals. Finally, we analyze cases where agents have incomplete information on the goals and worth of other agents. First we consider the case where agents' goals are private information, and we analyze what goal declaration strategies the agents might adopt to increase their utility. Then, we consider the situation where the agents' goals (and therefore stand-alone costs) are common knowledge, but the worth they attach to their goals is private information. We introduce two mechanisms, one 'strict', the other 'tolerant', and analyze their affects on the stability and efficiency of negotiation outcomes.Comment: See http://www.jair.org/ for any accompanying file

Multi-Objective Calibration For Agent-Based Models

Agent-based modelling is already proving to be an immensely useful tool for scientific and industrial modelling applications. Whilst the building of such models will always be something between an art and a science, once a detailed model has been built, the process of parameter calibration should be performed as precisely as possible. This task is often made difficult by the proliferation of model parameters with non-linear interactions. In addition to this, these models generate a large number of outputs, and their ‘accuracy’ can be measured by many different, often conflicting, criteria. In this paper we demonstrate the use of multi-objective optimisation tools to calibrate just such an agent-based model. We use an agent-based model of a financial market as an exemplar and calibrate the model using a multi-objective genetic algorithm. The technique is automated and requires no explicit weighting of criteria prior to calibration. The final choice of parameter set can be made after calibration with the additional input of the domain expert

Memory-Based Lexical Acquisition and Processing

Current approaches to computational lexicology in language technology are knowledge-based (competence-oriented) and try to abstract away from specific formalisms, domains, and applications. This results in severe complexity, acquisition and reusability bottlenecks. As an alternative, we propose a particular performance-oriented approach to Natural Language Processing based on automatic memory-based learning of linguistic (lexical) tasks. The consequences of the approach for computational lexicology are discussed, and the application of the approach on a number of lexical acquisition and disambiguation tasks in phonology, morphology and syntax is described.Comment: 18 page

Using DEA to estimate the importance of objectives for decision makers

In this paper we establish further connections between DEA and Multi-criteria Decision Analysis by suggesting a particular way to estimate preference weights for different objectives using DEA. We claim that the virtual multipliers obtained from a standard DEA model are not suitable to measure the preferences of a decision maker. Our suggestion takes advantage of the parallelism between DEA and the methodology proposed by Sumpsi et al. (1997) by projecting each unit on a linear combination of the elements of the pay-off matrix. Finally, we make an application of the proposed methodology to agricultural economics in a case study with Spanish data.Data Envelopment Analysis, Multicriteria Decision Analysis, preferences, weights, virtual multipliers.

Open source environment to define constraints in route planning for GIS-T

Route planning for transportation systems is strongly related to shortest path algorithms, an optimization problem extensively studied in the literature. To find the shortest path in a network one usually assigns weights to each branch to represent the difficulty of taking such branch. The weights construct a linear preference function ordering the variety of alternatives from the most to the least attractive.Postprint (published version

Recent Advances in Transfer Learning for Cross-Dataset Visual Recognition: A Problem-Oriented Perspective

This paper takes a problem-oriented perspective and presents a comprehensive review of transfer learning methods, both shallow and deep, for cross-dataset visual recognition. Specifically, it categorises the cross-dataset recognition into seventeen problems based on a set of carefully chosen data and label attributes. Such a problem-oriented taxonomy has allowed us to examine how different transfer learning approaches tackle each problem and how well each problem has been researched to date. The comprehensive problem-oriented review of the advances in transfer learning with respect to the problem has not only revealed the challenges in transfer learning for visual recognition, but also the problems (e.g. eight of the seventeen problems) that have been scarcely studied. This survey not only presents an up-to-date technical review for researchers, but also a systematic approach and a reference for a machine learning practitioner to categorise a real problem and to look up for a possible solution accordingly

Implementing Structured Participation for Regional Level Waste Management Planning

The authors present a case study example of a well-structured public participation project that was incorporated into the formal decision-making process in Germany