ppxscal/embedding_network huggingface dataset:
A Prospect Theory Model of Resource Allocation
Authors: Philip Bromiley
Venue: Decision Analysis (2009)

Many papers in organization theory and strategy use prospect theory, but few derive their hypotheses from prospect theory's formal model. This paper develops a prospect theory model of resource allocation under risk where projects have both positive and negative adjusted payoffs. The model assumes consistent value (rather than profit) maximizing behavior and demonstrates how resources, risk propensity, and reference levels interact to determine allocations to risky projects. The analysis shows that prospect theory's parameters interact in complex ways to influence risk taking, which makes simple predictions difficult. Overall, loss aversion and the reference point dominate the results, with curvature of the value function playing a secondary role and the maximum risk aversion occurring for firms near their reference points, not for firms above their reference points.
VR Based Movie Watching Method by Reproduction of Spatial Sensation
Authors: Kunihiro Nishimura, Aoi Ito, Tomohiro Tanikawa, Michitaka Hirose
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

A conventional movie watching method is to view movies in front of a large screen such as theaters. Conventional presenting images in fixed position have a problem that it is easy for audiences to lose their spatial sensation of existing movies. In this paper, we propose a novel movie watching method in order to improve presence in existing media contents using virtual reality technology. We assumed when frames are presented with shooting angle based on audiences' looking position, their presence will be much higher. To represent the camera-shooting angle, we used a optical flow method. We proposed a movie watching viewing method based on the reconstructed camera shooting angle which is presented with a moving projector or a wall screen. We thought that our method made it possible to reconstruct lost spatial in movies.
Study on Environmental Externality Cost of Road Traffic
Authors: Zhan Bin, Zhang Xinjie
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Transport contributes to economic growth and enables a global market significantly. Unfortunately, most forms of transport not only affect society in a positive way but also give rise to side effects. Generally, environmental pollution or environmental damage is the most common and serious external problems. It is important to measure the extent of the impact of transport system on the environment and the whole society, then a quantitative analysis of the damage caused by environment pollution should be made, that is, to assess the monetary value of social losses caused by the environmental damage. In this paper, firstly, the concept of environmental externality cost of road traffic is proposed. Then, the development process of researches on external cost is reviewed briefly. And last, the monetary valuation methods of external cost are summarized and sorted in details.
New Method of Primitive Feature Recognition Based on Graphics Comparability
Authors: Jianping Liu, Bangyan Ye, Jianxi Peng, Bo Wu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

For improving validity and efficiency of 3D reconstruction from 2D engineering drawings, this paper presents a new method of primitive feature recognition based on graphics comparability determining of view loop. Main steps of this method are as follows: Firstly separate three views of single or combined primitive bodies by loop search, and then code view loops of primitive body and calculate graphics similarity measure of two view loops, further determine type of primitive body by projection rules and extract different information of modeling feature for different primitive bodies. Based on the mentioned above, different reconstruction algorithms are applied for different primitive bodies. Application module of 3D intelligent reconstruction system is developed together with the tools of Object ARX 2008 and Visual C# 2.0 in AutoCAD 2008 environment and this algorithm is actualized. The validity of feature recognition is verified by examples.
The Conflict-Driven Answer Set Solver clasp: Progress Report
Authors: Martin Gebser, Benjamin Kaufmann, Torsten Schaub
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We summarize the salient features of the current version of the answer set solver clasp, focusing on the progress made since version RC4 of clasp. Apart from enhanced preprocessing and search-supporting techniques, a particular emphasis lies on advanced reasoning modes, such as cautious and brave reasoning, optimization, solution projection, and incremental solving.
A Brief Overview of Mizar
Authors: Adam Naumowicz, Artur Korniłowicz
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

Mizar is the name of a formal language derived from informal mathematics and computer software that enables proof-checking of texts written in that language. The system has been actively developed since 1970s, growing into a popular proof assistant accompanied with a huge repository of formalized mathematical knowledge. In this short overview, we give an outline of the key features of the Mizar language, the ideas and theory behind the system, its main applications, and current development.
An integrated approach for Arabic-English named entity translation
Authors: Hany Hassan, Jeffrey Sorensen
Venue: Proceedings of the ACL Workshop on Computational Approaches to Semitic Languages (2005)

Translation of named entities (NEs), such as person names, organization names and location names is crucial for cross lingual information retrieval, machine translation, and many other natural language processing applications. Newly named entities are introduced on daily basis in newswire and this greatly complicates the translation task. Also, while some names can be translated, others must be transliterated, and, still, others are mixed. In this paper we introduce an integrated approach for named entity translation deploying phrase-based translation, word-based translation, and transliteration modules into a single framework. While Arabic based, the approach introduced here is a unified approach that can be applied to NE translation for any language pair.
The Analytical Hierarchy Process for contaminated land management
Authors: A. Bello-Dambatta, R. Farmani, A. A. Javadi, B. M. Evans
Venue: Advanced Engineering Informatics (2009)

Decision analysis (DA) methods and techniques are used to support decision-makers deal with complexities, uncertainties and risks of contaminated land management problems. Over the years, several methods have been used for environmental decision-making. This paper reviews the different methods and techniques used for contaminated land decision-making and decision analysis. We focus on the Analytic Hierarchy Process, which is among the most widely used and fastest growing decision-analytic techniques in several disciplines, including environmental and resource planning and management. However its application to contaminated land management problems as yet has been minimal and under explored. We explore the potential of this technique and explain it with a simple case study.
Extensible Simulation of Planets and Comets
Authors: Natalie Wiser-Orozco, Keith Schubert, Ernesto Gomez, Richard Botting
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

The research conducted is intended to enhance the way we view and study our solar system and others, by allowing scientists of astronomy, physics, and computer science to accurately simulate celestial systems. The Extensible Simulator organizes individual groups of celestial bodies, calculates their positions, graphically visualizes their movement using the computed positions, and finally, is extensible, which serves to accommodate additional numerical methods and gravitational functions, body shapes and behaviors, and camera views.
Using Argument Visualization to Enhance e-Participation in the Legislation Formation Process
Authors: Euripidis Loukis, Alexandros Xenakis, Nektaria Tseperli
Venue: Proceedings of the 1st International Conference on Electronic Participation (2009)

Most public policy problems are `wicked', being characterised by high complexity, many heterogeneous views and conflicts among various stakeholders. Therefore citizens interested to participate in such debates in order to be sufficiently informed should study large amounts of relevant material, such as reports, laws, committees' minutes, etc., which are in legalistic or in other specialist languages, or very often their substance is hidden in political rhetoric, putting barriers to a meaningful participation. In this paper we present the results of the research we have conducted for addressing this problem through the use of `Computer Supported Argument Visualization' (CSAV) methods for supporting and enhancing e-participation in the legislation formation process. This approach has been implemented in a pilot e-participation project and then evaluated using both quantitative and qualitative methods based on the `Technology Acceptance Model' (TAM), with positive results. Based on the conclusions of this evaluation an enrichment of the IBIS framework has been developed for improving the visualization of legal documents.
Designing a Trading Card Game as Educational Reward System to Improve Students' Learning Motivations
Authors: Peayton Chen, Rita Kuo, Maiga Chang, Jia-Sheng Heh
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

Reward is the simplest way to motivate students in education. It can encourage students to learn and get immediate achievement. Moreover, it is also has potential to construct students' intrinsic motivation. However, traditional symbolic rewards like stars or stickers are often less valuable because it cannot be used by the students after the class; thus cannot keep motivating students.This research designed cards of a self-developed computerized trading card game (TCG) as educational rewards in order to inspire students learning. The teacher can give the student cards if the student did well in either his/her homework, quiz, or exam. Also, the teacher can give the student different level cards according to his/her answers to the question the teacher asked; or according to the student's learning attitude and performance. Teachers can pre-define the relation between the learning and the reward, the system then can give appropriate cards to students automatically according to the relation. Furthermore, because of the cards and the computerized TCG is independent from the courses, teaches can map the same card to verity courses to let students get cards from any courses.For this purpose, this research analyzed three famous TCGs and implemented a prototype computerized TCG and educational reward system to increase student's learning motivation. Students can collect cards in class and use it for play or even show-off after class, which can really encourage students to learn. These cards in the computerized TCG not only can increase the usability of rewards, but also can stimulate students' learning motivations because of more they've learned or better they've performed, more and better cards they can get and use to play the game and defeat the fellows easier. Because the computerized TCG is real game, it is fun and will not make students feel they are still "learning". Through the TCG, the rewards can hold students' interest for longer.
Professional Presentation in Austrian E-Government
Authors: Arne Tauber, Thomas Rössler
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

Mandates are a fundamental vehicle for carrying out public administration and are an indispensable requirement for conducting transactions on someone else's behalf in legal or business matter. Austrian eGovernment initiatives have introduced electronic mandates early. However, a special case is the submission of professional representatives when conducting transactions on someone else's behalf. In this paper we introduce a solution allowing professional representatives the representation of both natural persons and corporate bodies by means of complementing existing tools and technologies for adequate online identification and authentication.
Hands on Dependability Economics
Authors: Theodosios Tsiakis, Panagiotis Katsaros
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Contemporary societies (from individuals to organizations) depend on services delivered by systems to achieve individual goals, meaning that a system must have engineered and guaranteed dependability, regardless of continuous, rapid and unpredictable technological and context changes. The simplest questions that brought out in the surface are to understand on how to evaluate and how much (money) should we spend on dependability. Dependability risk management is an effective process that with simplicity can determine the likelihood of an accident and the severities of the consequences. On the other hand, we also need quantitative methods, in order to assess the cost of the various measures which can be taken to reduce the dependability risk. In this paper, we survey quantitative methods that can play an important role in Dependability Economics. These methods aim in providing estimations for the economic consequences of lowering dependability levels and the costs to implement dependability.
Gene expression associations with the growth inhibitory effects of small molecules on live cells: Specificity of effects and uniformity of mechanisms
Authors: Kerby Shedden, Yang Yang, Gus Rosania
Venue: Statistical Analysis and Data Mining (2009)

The NCI60 human tumor cell line screen is a public resource for studying selective and nonselective growth inhibition of small molecules against cancer cells. By coupling growth inhibition screening data with biological characterizations of the different cell lines, it becomes possible to infer mechanisms of action underlying some of the observable patterns of selective activity. Using these data, mechanistic relationships have been identified including specific associations between single genes and small families of closely related compounds, and less specific relationships between biological processes involving several cooperating genes and broader families of compounds. Here, we aim to characterize the degree to which such specific and general relationships are present in these data. A related question is whether genes tend to act with a uniform mechanism for all associated compounds, or whether multiple mechanisms are commonly involved. We address these two issues in a statistical framework placing special emphasis on the effects of measurement error in the gene expression and chemical screening data. We find that as measurement accuracy increases, the pattern of apparent associations shifts from one dominated by isolated gene-compound pairs, to one in which families consisting of an average of 25 compounds are associated to the same gene. At the same time, the number of genes that appear to play a role in influencing compound activities decreases. For less than half of the genes, the presence of both positive and negative correlations indicates pleiotropic associations with molecules via different mechanisms of action. Copyright &copy; 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2: 175&ndash;185, 2009
Advanced Features in Bayesian Reputation Systems
Authors: Audun Jøsang, Walter Quattrociocchi
Venue: Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business (2009)

Bayesian reputation systems are quite flexible and can relatively easily be adapted to different types of applications and environments. The purpose of this paper is to provide a concise overview of the rich set of features that characterizes Bayesian reputation systems. In particular we demonstrate the importance of base rates during bootstrapping, for handling rating scarcity and for expressing long term trends.
Theories of Automatic Structures and Their Complexity
Authors: Dietrich Kuske
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

For automatic structures, several logics have been shown decidable: first-order logic, its extension by the infinity quantifier, by modulo-counting quantifiers, and even by a restricted form of second-order quantification. We review these decidability proofs. As a new result, we determine the data, the expression, and the combined complexity of quantifier-classes for first-order logic. Finally, we also recall that first-order logic becomes elementary decidable for automatic structures of bounded degree.
A Self-updating Multiexpert System for Face Identification
Authors: Andrea F. Abate, Maria Marsico, Michele Nappi, Daniel Riccio
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Multibiometric systems can solve a number of problems of single-biometry approaches. A source of flaws for present systems, both single-biometric and multibiometric, can be found in the lack of dynamic update of parameters, which does not allow them to adapt to changes in the working settings. They are generally calibrated once and for all, so that they are tuned and optimized with respect to standard conditions. In this work we investigate an architecture where single-biometry subsystems work in parallel, yet exchanging information at fixed points, according to the N-Cross Testing Protocol. In particular, the integrated subsystems work on the same biometric feature, the face in this case, yet exploiting different classifiers. Subsystems collaborate at a twofold level, both for returning a common answer and for tuning to changing operating conditions. Results demonstrate that component collaboration increases system accuracy and allows identifying unstable subsystems.
Definability in the Local Theory of the ω-Enumeration Degrees
Authors: Hristo Ganchev
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We continue the study of the local theory of the structure of the ω-enumeration degrees, started by Soskov and Ganchev [7]. We show that the classes of 1-high and 1-low ω-enumeration degrees are definable. We prove that a standard model of arithmetic is definable as well. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Extending AspectJ for separating regions
Authors: Shumpei Akai, Shigeru Chiba
Venue: Proceedings of the eighth international conference on Generative programming and component engineering (2009)

Synchronization is a good candidate for an aspect in aspect-oriented programming (AOP) since programmers have to choose the best granularity of synchronization for the underlying hardware to obtain the best execution performance. If synchronization is an aspect, programmers can change the synchronization code independently of the rest of the program when the program runs on different hardware. However, existing AOP languages such as AspectJ have problems. They cannot select an arbitrary code region as a join point. Moreover, they cannot enforce weaving of a synchronization aspect. Since it is an alternative feature in feature modeling, at least one of available synchronization aspects must be woven. Otherwise, the program would be thread-unsafe. Since an aspect in AspectJ is inherently optional, programmers must be responsible for weaving it. To solve these problems, this paper proposes two new constructs for AspectJ, regioncut and assertions for advice. Regioncut selects arbitrary code region as a join point and assertion for advice enforces weaving a mandatory advice. We implemented these constructs by extending the AspectBench compiler. We evaluated the design of our constructs by applying them to two open-source software products, Javassist and Hadoop.
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Authors: Daniel Kane, Gregory N. Price, Erik D. Demaine
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the polyhedron to arbitrary precision given the metric, and prove a pseudopolynomial bound on its running time.
Light-Weight SMT-based Model Checking
Authors: Silvio Ghilardi, Silvio Ranise, Thomas Valsecchi
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Recently, the notion of an array-based system has been introduced as an abstraction of infinite state systems (such as mutual exclusion protocols or sorting programs) which allows for model checking of invariant (safety) and recurrence (liveness) properties by Satisfiability Modulo Theories (SMT) techniques. Unfortunately, the use of quantified first-order formulae to describe sets of states makes fix-point checking extremely expensive. In this paper, we show how invariant properties for a sub-class of array-based systems can be model-checked by a backward reachability algorithm where the length of quantifier prefixes is efficiently controlled by suitable heuristics. We also present various refinements of the reachability algorithm that allows it to be easily implemented in a client-server architecture, where a ''light-weight'' algorithm is the client generating proof obligations for safety and fix-point checks and an SMT solver plays the role of the server discharging the proof obligations. We also report on some encouraging preliminary experiments with a prototype implementation of our approach.
The MECA Project - Ontology-Based Data Portability for Space Missions
Authors: Leo Breebaart, André Bos, Tim Grant, Antonio Olmedo Soler, Mark Neerincx, Nanja Smets, Jasper Lindenberg, Uwe Brauer, Mikael Wolff
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

This article describes the authors' experiences with a pragmatic, ontology-based approach to data portability and knowledge sharing, as used in the first Mission Execution Crew Assistant (MECA) Proof-of-concept demonstrator software.