Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 22951 - 22980 of 25630

Full-Text Articles in Computer Engineering

Background Radio Frequency Interference Measurements For Wireless Devices In The Electricity Supply Industry, Duane Robinson, Tadeusz A. Wysocki, V. Smith, K. Popovski Dec 2005

Background Radio Frequency Interference Measurements For Wireless Devices In The Electricity Supply Industry, Duane Robinson, Tadeusz A. Wysocki, V. Smith, K. Popovski

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

Incorporation of radio controller units into heavy equipment used in the electricity industry provides numerous advantages including: improved electrical isolation between plant and operator, ability to incorporate an additional remote operator, and reductions in vehicle wiring and hydraulic hoses for equipment control. However, secure operation of vehicles and plant incorporating radio control rely on establishing suitable levels of immunity to possible radio frequency interference. Interference levels in close proximity to high voltage power lines are of special concern to the electricity industry. This paper reports on a preliminary investigation into quantifying the levels of background radio interference at such locations …


Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman Dec 2005

Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, en-suring that applications continue to function correctly de-spite arbitrary (Byzantine) failure of a bounded number of servers. We give a formal model of application execution, based on atomic execution steps, linearizability and a sep-aration between data objects and transactions that act on them. The architecture is designed for robust interoperability across domains, in an open and shared Internet computing infrastructure. A notable feature supporting cross-domain applications is …


A Performance Evaluation Of A Homogeneous Wireless Network Using Opnet It Guru, Roy Lee Gentry Jr. Nov 2005

A Performance Evaluation Of A Homogeneous Wireless Network Using Opnet It Guru, Roy Lee Gentry Jr.

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science and Technology at Morehead State University in partial fulfillment of the requirements for the Degree of Master of Science by Roy Lee Gentry Jr. on November 30, 2005.


Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman Nov 2005

Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman

All Computer Science and Engineering Research

Autonomous mobile entity navigation through dynamic and unknown environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to constantly maintain a high degree of awareness of the changing environment. This criteria makes it difficult to achieve good navigation performance by using just on-board sensors and existing navigation methods and motivates the use of wireless sensor networks (WSNs) to aid navigation. In this paper, we present a novel approach that integrates a roadmap based navigation algorithm with a novel network query protocol called Roadmap …


Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus Nov 2005

Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus

All Computer Science and Engineering Research

Popular security techniques such as public-private key encryption, firewalls, and role-based access control offer significant protec-tion of system data, but offer only limited protection of the computations using that data from significant interference due to accident or adversarial attack. However, in an increasing number of modern systems, ensuring the reliable execution of system activities is every bit as important as ensuring data security. This paper makes three contributions to the state of the art in protection of the execution of system activities from accidental or adversarial interference. First, we consider the motivating problem of CPU-focused denial of service attacks, and …


Synthesis Of Fuel Cell Membrane: Copolymerization Of Styrene On Etfe Film By Grafted Pre-Irradiation, Yohan Yohan, Rifai M. Nur, Lilik Hendrajaya, E. S. Siradj Nov 2005

Synthesis Of Fuel Cell Membrane: Copolymerization Of Styrene On Etfe Film By Grafted Pre-Irradiation, Yohan Yohan, Rifai M. Nur, Lilik Hendrajaya, E. S. Siradj

Makara Journal of Technology

Synthesis of Fuel Cell Membrane: Copolymerization of Styrene on ETFE Film by Grafted pre-Irradiation. Preirradiation Grafting styrene monomer on ETFE film has been prepared. Research has been performed by γ-ray radiation at various total dose from 2.5 – 12.5 kGy and various dose rate from 1.3 – 1.9 kGy/hour. Irradiated copolymer is then grafted by styrene monomer in various solvent: ethanol, 2-propanol, and toluene, various concentration from 20 – 70% volume, various temperature from 50 – 90oC, and various grafting time from 2 – 12 hours. The results showed that percent of grafting is increase with increase of total dose …


Design Of Product Placement Layout In Retail Shop Using Market Basket Analysis, Isti Surjandari, Annury Citra Seruni Nov 2005

Design Of Product Placement Layout In Retail Shop Using Market Basket Analysis, Isti Surjandari, Annury Citra Seruni

Makara Journal of Technology

Retailing is an industry with high level of competition. It is a customer-based industry which depends on how it could be aware of what the customers’ needs and requirements are. One technique most used in supermarkets is the mix merchandise. The purpose of this paper is to identify associated products, which then grouped in mix merchandise with the use of market basket analysis. This association between products then will be applied in the design layout of the product in the supermarket. The process of identifying the related products bought together in one transaction is done by using data mining technique. …


Production Hydrogen And Nanocarbon Via Methane Decomposition Using Ni-Based Catalysts. Effect Of Acidity And Catalyst Diameter, Widodo W. Purwanto, M. Nasikin, E. Saputra, L. Song Nov 2005

Production Hydrogen And Nanocarbon Via Methane Decomposition Using Ni-Based Catalysts. Effect Of Acidity And Catalyst Diameter, Widodo W. Purwanto, M. Nasikin, E. Saputra, L. Song

Makara Journal of Technology

Objectives of this research are mainly to study impacts of acidity strength (by varying amount of precipitant and loading Al-Si) and the effect of nickel particle size (by varying calcinations temperature) on decomposition reaction performances. In this research, high-nickel-loaded catalyst is prepared with two methods. Ni-Cu/Al catalysts were prepared with co-precipitation method. While the Ni-Cu/Al-Si catalyst were prepared by combined co-precipitation and sol-gel method. The direct cracking of methane was performed in 8mm quartz fixed bed reactor at atmospheric pressure and 500-700°C. The main results showed that the Al content of catalyst increases with the increasing amount of precipitant. The …


Design And Implementation Of 1-2 Ghz Stepped Frequency Gpr For Buried Metal Detection, Joko Suryana, Andriyan B. Suksmono, Tati R. Mengko Nov 2005

Design And Implementation Of 1-2 Ghz Stepped Frequency Gpr For Buried Metal Detection, Joko Suryana, Andriyan B. Suksmono, Tati R. Mengko

Makara Journal of Technology

Design and Implementation of 1-2 GHz Stepped Frequency GPR for Buried Metal Detection. In this paper, we describe the design and realization steps of 1 – 2 GHz SFGPR (Stepped Frequency Ground Penetrating Radar) transceiver for metal detection under the ground. Before using prototyped GPR for detecting the metal under the ground, several of calibration processes must be performed, namely phase calibration and monocycle pulse waveform calibration. After completing the calibrations, this prototyped GPR would be ready for detecting a hidden object such as a metal plate 5 cm under the ground in our small test range size 25 cm …


Simultaneous Treatment Of Organic (Phenol) And Heavy Metal (Cr6+ Or Pt4+) Wastes Over Tio2, Zno-Tio2 And Cds-Tio2 Photocatalysts, Slamet Slamet, R. Arbianti, Daryanto Daryanto Nov 2005

Simultaneous Treatment Of Organic (Phenol) And Heavy Metal (Cr6+ Or Pt4+) Wastes Over Tio2, Zno-Tio2 And Cds-Tio2 Photocatalysts, Slamet Slamet, R. Arbianti, Daryanto Daryanto

Makara Journal of Technology

Simultaneous Treatment of Organic (Phenol) and Heavy Metal (Cr6+ or Pt4+) Wastes over TiO2, ZnO-TiO2 and CdS-TiO2 Photocatalysts. Treatment of heavy metal (Cr6+ and Pt4+) and organic (phenol) wastes has been studied using the relatively new method, i.e. simultaneous photocatalytic process over TiO2 photocatalysts in the batch photoreactor. Following the photocatalytic reduction of the heavy metal wastes, recovery of Cr and Pt was carried out by precipitation and leaching method, respectively. The experimental results show that in the simultaneous photocatalytic system, there is a synergism effect between the photocatalytic reduction of heavy metal waste (Cr6+ or Pt4+) and the oxidation …


Design Of Generating Dual Frequency Operation For Triangular Microstrip Antenna Using Electromagnetic Coupling, Indra Surjati, Eko Tjipto Rahardjo, Djoko Hartanto Nov 2005

Design Of Generating Dual Frequency Operation For Triangular Microstrip Antenna Using Electromagnetic Coupling, Indra Surjati, Eko Tjipto Rahardjo, Djoko Hartanto

Makara Journal of Technology

Design of Generating Dual Frequency Operation for Triangular Microstrip Antenna Using Electromagnetic Coupling. A new design is proposed in this paper by applying a pair of slits using a microstrip feed line. Therefore the microstrip line feeding system is electromagnetically coupled to the patch. The antenna works at two different frequencies in the range from 2 GHz to 4 GHz (S band frequency). The results of the simulation shows that the dual frequency operation can be created when the slit width is 1 mm and the height of the slits ranges from 10 mm to 14 mm with inter slit …


Development Of Low Frequency Vibration Method Of Direct-Write Deposition Relevant To Layer Manufacturing Application, Susilo Adi Widyanto, Alva Edy Tontowi, Jamasri Jamasri, Heru Santosa Budi Rochardjo Nov 2005

Development Of Low Frequency Vibration Method Of Direct-Write Deposition Relevant To Layer Manufacturing Application, Susilo Adi Widyanto, Alva Edy Tontowi, Jamasri Jamasri, Heru Santosa Budi Rochardjo

Makara Journal of Technology

The research of deposition process is the first step in development process of multi materials selective laser sintering. The deposition process enables to settle multi materials powder in horizontal formation on one layer. In this research we use low frequency (70 - 200Hz) to vibrate a hopper nozzle in which powder is settled. The research method consists of two steps, the first step is to determine flow-ability parameters and the second is to join flow ability parameter with other parameters such that the line width can be controlled. The results show that the line width depends on uniformity of particle …


Combining Interval, Probabilistic, And Fuzzy Uncertainty: Foundations, Algorithms, Challenges -- An Overview, Vladik Kreinovich, David J. Berleant, Scott Ferson, Weldon A. Lodwick Nov 2005

Combining Interval, Probabilistic, And Fuzzy Uncertainty: Foundations, Algorithms, Challenges -- An Overview, Vladik Kreinovich, David J. Berleant, Scott Ferson, Weldon A. Lodwick

Departmental Technical Reports (CS)

Since the 1960s, many algorithms have been designed to deal with interval uncertainty. In the last decade, there has been a lot of progress in extending these algorithms to the case when we have a combination of interval and probabilistic uncertainty. We provide an overview of related algorithms, results, and remaining open problems.


Population Variance Under Interval Uncertainty: A New Algorithm, Evgeny Dantsin, Vladik Kreinovich, Alexander Wolper, Gang Xiang Nov 2005

Population Variance Under Interval Uncertainty: A New Algorithm, Evgeny Dantsin, Vladik Kreinovich, Alexander Wolper, Gang Xiang

Departmental Technical Reports (CS)

In statistical analysis of measurement results, it is often beneficial to compute the range [V] of the population variance V when we only know the intervals [Xi-Di,Xi+Di] of possible values of xi. In general, this problem is NP-hard; a polynomial-time algorithm is known for the case when the measurements are sufficiently accurate, i.e., when |Xi-Xj| >= (D_i+D_j)/n for all i =/= j. In this paper, we show that we can efficiently compute [V} under a weaker (and more general) condition |Xi-Xj| >= |D_i-D_j|/n.


Specifying And Checking Method Call Sequences Of Java Programs, Yoonsik Cheon, Ashaveena Perumandla Nov 2005

Specifying And Checking Method Call Sequences Of Java Programs, Yoonsik Cheon, Ashaveena Perumandla

Departmental Technical Reports (CS)

In a pre and postconditions-style specification, it is difficult to specify the allowed sequences of method calls, referred to as protocols. The protocols are essential properties of reusable object-oriented classes and application frameworks, and the approaches based on the pre and postconditions, such as design by contracts (DBC) and formal behavioral interface specification languages (BISL), are being accepted as a practical and effective tool for describing precise interfaces of (reusable) program modules. We propose a simple extension to the Java Modeling Language (JML), a BISL for Java, to specify protocol properties in an intuitive and concise manner. The key idea …


Optimal Choice Of Granularity In Commonsense Estimation: Why Half-Orders Of Magnitude, Jerry R. Hobbs, Vladik Kreinovich Nov 2005

Optimal Choice Of Granularity In Commonsense Estimation: Why Half-Orders Of Magnitude, Jerry R. Hobbs, Vladik Kreinovich

Departmental Technical Reports (CS)

It has been observed that when people make crude estimates, they feel comfortable choosing between alternatives which differ by a half-order of magnitude (e.g., were there 100, 300, or 1,000 people in the crowd), and less comfortable making a choice on a more detailed scale, with finer granules, or on a coarser scale (like 100 or 1,000). In this paper, we describe two models of choosing granularity in commonsense estimates, and we show that for both models, in the optimal granularity, the next estimate is 3-4 times larger than the previous one. Thus, these two optimization results explain the commonsense …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University Nov 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker Nov 2005

End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker

All Computer Science and Engineering Research

Many mission-critical distributed real-time applicationsmust handle aperiodic tasks with hard end-to-end dead-lines. Existing middleware such as RT-CORBA lacksschedulability analysis and run-time scheduling mecha-nisms that can provide real-time guarantees to aperiodictasks. This paper makes the following contributions to thestate of the art for end-to-end aperiodic scheduling in mid-dleware. First, we compare two approaches to aperiodicscheduling, the deferrable server and the aperiodic utiliza-tion bound, using representative workloads. Numerical re-sults show that the deferrable server analysis is less pes-simistic than the aperiodic utilization bounds when appliedoffline. Second, we propose a practical approach to tuningdeferrable servers for end-to-end tasks. Third, we describedeferrable server mechanisms …


Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill Nov 2005

Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a loosely coupled model for distributed processing in a resource-poor and …


Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless Nov 2005

Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless

All Computer Science and Engineering Research

This paper proposes the Minimum Power Configuration (MPC) approach to power management in wireless sensor networks. In contrast to earlier research that treats different radio states (transmission/reception/idle) in isolation, MPC integrates them in a joint optimization problem that depends on both the set of active nodes and the transmission power. We propose four approximation algorithms with provable performance bounds and two practical routing protocols. Simulations based on realistic radio models show that the MPC approach can conserve more energy than existing minimum power routing and topology control protocols. Furthermore, it can flexibly adapt to network workload and radio platforms.


Large–Scale Field–Programmable Analog Arrays For Analog Signal Processing, Tyson S. Hall, Christopher M. Twigg, Jordan D. Gray, Paul Hasler, David V. Anderson Nov 2005

Large–Scale Field–Programmable Analog Arrays For Analog Signal Processing, Tyson S. Hall, Christopher M. Twigg, Jordan D. Gray, Paul Hasler, David V. Anderson

Faculty Works

Field-programmable analog arrays (FPAAs) providea method for rapidly prototyping analog systems. Currently available commercial and academic FPAAs are typically based on operational amplifiers (or other similar analog primitives) with only a few computational elements per chip. While their specific architectures vary, their small sizes and often restrictive interconnect designs leave current FPAAs limited in functionality and flexibility. For FPAAs to enter the realm of large-scale reconfigurable devices such as modern field-programmable gate arrays (FPGAs),new technologies must be explored to provide area-efficient accurately programmable analog circuitry that can be easily integrated into a larger digital/mixed-signal system. Recent advances in the area …


H-Infinity Estimation For Fuzzy Membership Function Optimization, Daniel J. Simon Nov 2005

H-Infinity Estimation For Fuzzy Membership Function Optimization, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

Given a fuzzy logic system, how can we determine the membership functions that will result in the best performance? If we constrain the membership functions to a specific shape (e.g., triangles or trapezoids) then each membership function can be parameterized by a few variables and the membership optimization problem can be reduced to a parameter optimization problem. The parameter optimization problem can then be formulated as a nonlinear filtering problem. In this paper we solve the nonlinear filtering problem using H∞ state estimation theory. However, the membership functions that result from this approach are not (in general) sum normal. …


Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman Oct 2005

Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically collect sensor data from the physical environment through wireless sensor networks. A salient feature of \MQ is that it can meet stringent spatiotemporal performance constraints, including query latency, data freshness, and changing areas of interest due to user mobility. We present three just-in-time prefetching protocols that enable MobiQuery to achieve desired spatiotemporal performance despite low node duty cycles, while significantly reducing communication overhead. We validate our approach through both theoretical analysis and extensive simulations under realistic settings including varying user movement patterns and location errors.


Analysis Of Gaits For A Rotating Tripedal Robot, Damian M. Lyons, Kiran Pamnany Oct 2005

Analysis Of Gaits For A Rotating Tripedal Robot, Damian M. Lyons, Kiran Pamnany

Faculty Publications

A goal of robotics has been to develop mechanisms that have the efficiency and speed of wheeled robots with the terrain flexibility of legged robots. In previous work, we have proposed a unique three-legged mechanism, the rotopod, designed to integrate these two useful approaches to locomotion. In this paper, we present an analysis of the variety of gaits that can be exhibited by the rotopod. We present examples of many of these gaits and discuss their potential use. A trajectory generation algorithm is presented that can be used to generate point to point trajectories using one of three different styles …


Computing Mean And Variance Under Dempster-Shafer Uncertainty: Towards Faster Algorithms, Vladik Kreinovich, Gang Xiang, Scott Ferson Oct 2005

Computing Mean And Variance Under Dempster-Shafer Uncertainty: Towards Faster Algorithms, Vladik Kreinovich, Gang Xiang, Scott Ferson

Departmental Technical Reports (CS)

In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m1,...,mn assigned to different sets S1,...,Sn, but we do not know the distribution within each set Si. Because of this uncertainty, there are many possible probability distributions consistent with our knowledge; different distributions have, in general, different values of standard statistical characteristics such as mean and variance. It is therefore desirable, given a Dempster-Shafer knowledge base, to compute the ranges of possible values of mean E and of variance V.

In their recent paper, A. T. …


Interval-Based Robust Statistical Techniques For Non-Negative Convex Functions, With Application To Timing Analysis Of Computer Chips, Michael Orshansky, Wei-Shen Wang, Martine Ceberio, Gang Xiang Oct 2005

Interval-Based Robust Statistical Techniques For Non-Negative Convex Functions, With Application To Timing Analysis Of Computer Chips, Michael Orshansky, Wei-Shen Wang, Martine Ceberio, Gang Xiang

Departmental Technical Reports (CS)

In chip design, one of the main objectives is to decrease its clock cycle. On the design stage, this time is usually estimated by using worst-case (interval) techniques, in which we only use the bounds on the parameters that lead to delays. This analysis does not take into account that the probability of the worst-case values is usually very small; thus, the resulting estimates are over-conservative, leading to unnecessary over-design and under-performance of circuits. If we knew the exact probability distributions of the corresponding parameters, then we could use Monte-Carlo simulations (or the corresponding analytical techniques) to get the desired …


Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis Oct 2005

Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis

Faculty Publications

No abstract provided.


A Fitness Function For Modular Evolutionary Testing Of Object-Oriented Programs, Yoonsik Cheon, Kim Myoung Oct 2005

A Fitness Function For Modular Evolutionary Testing Of Object-Oriented Programs, Yoonsik Cheon, Kim Myoung

Departmental Technical Reports (CS)

We show that encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. In a well-designed object-oriented program the encapsulated or hidden state is accessible only through exported or public methods. As client code is oblivious to the internal state of a server object, no guidance is available to test the client code using evolutionary testing. In particular, it is difficult to determine the fitness or goodness of test data, as it may depend on the hidden internal state. However, evolutionary testing is a promising new approach whose effectiveness has been shown by several researchers. …


Quantum Versions Of K-Csp Algorithms: A First Step Towards Quantum Algorithms For Interval-Related Constraint Satisfaction Problems, Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich Oct 2005

Quantum Versions Of K-Csp Algorithms: A First Step Towards Quantum Algorithms For Interval-Related Constraint Satisfaction Problems, Evgeny Dantsin, Alexander Wolpert, Vladik Kreinovich

Departmental Technical Reports (CS)

In many industrial engineering problems, we must select a design, select parameters of a process, or, in general, make a decision. Informally, this decision must be optimal, the best for the users. In traditional operations research, we assume that we know the objective function f(x) whose values describe the consequence of a decision x for the user. Optimization of well-defined functions is what started calculus in the first place: once we know the objective function f(x), we can use differentiation to find its maximum, e.g., as the point x at which the derivative of f with respect to x is …


Decision Making Beyond Arrow's "Impossibility Theorem", With The Analysis Of Effects Of Collusion And Mutual Attraction, Hung T. Nguyen, Olga Kosheleva, Vladik Kreinovich Oct 2005

Decision Making Beyond Arrow's "Impossibility Theorem", With The Analysis Of Effects Of Collusion And Mutual Attraction, Hung T. Nguyen, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In 1951, K. J. Arrow proved that, under certain assumptions, it is impossible to have group decision making rules which satisfy reasonable conditions like symmetry. This Impossibility Theorem is often cited as a proof that reasonable group decision making is impossible.

We start our paper by remarking that Arrow's result only covers the situations when the only information we have about individual preferences is their binary preferences between the alternatives. If we follow the main ideas of modern decision making and game theory and also collect information about the preferences between lotteries (i.e., collect the utility values of different alternatives), …