ppxscal/embedding_network huggingface dataset:
Strategyproof classification under constant hypotheses: a tale of two functions
Authors: Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosenschein
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We consider the following setting: a decision maker must make a decision based on reported data points with binary labels. Subsets of data points are controlled by different selfish agents, which might misreport the labels in order to sway the decision in their favor. We design mechanisms (both deterministic and randomized) that reach an approximately optimal decision and are strategyproof, i.e., agents are best off when they tell the truth. We then recast our results into a classical machine learning classification framework, where the decision maker must make a decision (choose between the constant positive hypothesis and the constant negative hypothesis) based only on a sampled subset of the agents' points.
Turing Completeness Using Three Mobile Membranes
Authors: Bogdan Aman, Gabriel Ciobanu
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

The mutual mobile membrane systems represent a variant of mobile membrane systems in which the endocytosis and exocytosis work whenever the involved membranes "agree" on the movement (this agreement is described by using dual objects a and $\overline{a}$ in the involved membranes). We study the computational power of this variant of mobile membrane systems, proving that only three membranes are enough to get the same computational power as a Turing machine.
Database System Design and Application of Freeway Shared Information Platform
Authors: Zhao Han-tao, Zhai Jing
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The Shared Information Platform is an effective way to settle the information systems integration, and database system is the central component of the platform. The database system design of Shared Information Platform for Freeway Transportation (SIPFT) is proposed in this paper. Information sources, components and functional requirements of the database system are presented and the system structure is established. On the basis of the design, the database system of commanding and dispatching platform for freeway is developed.
Overview of the INEX 2008 Efficiency Track
Authors: Martin Theobald, Ralf Schenkel
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

This paper presents an overview of the Efficiency Track that was newly introduced to INEX in 2008. The new INEX Efficiency Track is intended to provide a common forum for the evaluation of both the effectiveness and efficiency of XML ranked retrieval approaches on real data and real queries. As opposed to the purely synthetic XMark or XBench benchmark settings that are still prevalent in efficiency-oriented XML retrieval tasks, the Efficiency Track continues the INEX tradition using a rich pool of manually assessed relevance judgments for measuring retrieval effectiveness. Thus, one of the main goals is to attract more groups from the DB community to INEX, being able to study effectiveness/efficiency trade-offs in XML ranked retrieval for a broad audience from both the DB and IR communities. The Efficiency Track significantly extends the Ad-Hoc Track by systematically investigating different types of queries and retrieval scenarios, such as classic ad-hoc search, high-dimensional query expansion settings, and queries with a deeply nested structure (with all topics being available in both the NEXI-style CO and CAS formulations, as well as in their XPath 2.0 Full-Text counterparts).
HARDI Denoising: Variational Regularization of the Spherical Apparent Diffusion Coefficient sADC
Authors: Yunho Kim, Paul M. Thompson, Arthur W. Toga, Luminita Vese, Liang Zhan
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

We denoise HARDI (High Angular Resolution Diffusion Imaging) data arising in medical imaging. Diffusion imaging is a relatively new and powerful method to measure the 3D profile of water diffusion at each point. This can be used to reconstruct fiber directions and pathways in the living brain, providing detailed maps of fiber integrity and connectivity. HARDI is a powerful new extension of diffusion imaging, which goes beyond the diffusion tensor imaging (DTI) model: mathematically, intensity data is given at every voxel and at any direction on the sphere. However, HARDI data is usually highly contaminated with noise, depending on the b-value which is a tuning parameter pre-selected to collect the data. Larger b-values help to collect more accurate information in terms of measuring diffusivity, but more noise is generated by many factors as well. So large b-values are preferred, if we can satisfactorily reduce the noise without losing the data structure. We propose a variational method to denoise HARDI data by denoising the spherical Apparent Diffusion Coefficient (sADC), a field of radial functions derived from the data. We use vectorial total variation regularization, an L 1 data fidelity term and the logarithmic barrier function in the minimization. We present experiments of denoising synthetic and real HARDI data.
Low Latency Handover Scheme Based on Optical Buffering at LMA in Proxy MIPv6 Networks
Authors: Seungtak Oh, Hyunseung Choo
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

The host-based protocols, Mobile IPv6 protocol (MIPv6), Hierarchical Mobile IPv6 (HMIPv6), and Fast Mobile IPv6 (FMIPv6), require that the mobile terminals include the mobility functions. To address this issue, Proxy MIPv6 (PMIPv6), a network-based protocol, has recently emerged. Despite its advantage of easier practical application, PMIPv6 still has some weak points, disconnection and transmission delay, during handover. This paper, therefore, proposes a scheme that reduces handover latency by simplifying the user authentication procedure required when a mobile node (MN) enters a new wireless network domain. And it also saves transmission cost by storing packets in the optical buffering module of the local mobility anchor (LMA) and retransmitting those packets after handover phase. Performance evaluation conducted using an analysis model indicates that the proposed scheme shows a performance improvement of 33% over standard PMIPv6 in terms of handover latency, and 67% over Seamless handover scheme in terms of the transmission cost due to the retransmission of buffered packets.
Analysis of Malicious Traffic in Modbus/TCP Communications
Authors: Tiago H. Kobayashi, Aguinaldo B. Batista,  Jr., João Paulo Medeiros, José Macedo Filho, Agostinho M. Brito,  Jr., Paulo S. Pires
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

This paper presents the results of our analysis about the influence of Information Technology (IT) malicious traffic on an IP-based automation environment. We utilized a traffic generator, called MACE (Malicious trAffic Composition Environment), to inject malicious traffic in a Modbus/TCP communication system and a sniffer to capture and analyze network traffic. The realized tests show that malicious traffic represents a serious risk to critical information infrastructures. We show that this kind of traffic can increase latency of Modbus/TCP communication and that, in some cases, can put Modbus/TCP devices out of communication.
Constraint Handling Rules, 1st edition
Authors: Thom Frhwirth
Venue:  (2009)

Constraint Handling Rules (CHR) is both a theoretical formalism based on logic and a practical programming language based on rules. This book, written by the creator of CHR, describes the theory of CHR and how to use it in practice. It is supported by a website containing teaching materials, online demos, and free downloads of the language. After a basic tutorial, the author describes in detail the CHR language and discusses guaranteed properties of CHR programs. The author then compares CHR with other formalisms and languages and illustrates how it can capture their essential features. Finally, larger programs are introduced and analyzed in detail. The book is ideal for graduate students and lecturers, and for more experienced programmers and researchers, who can use it for self-study. Exercises with selected solutions, and bibliographic remarks are included at the ends of chapters. The book is the definitive reference on the subject.
Wireless Sensor Network Testbed for Real-Time Sensor Monitoring
Authors: Sang Gi Hong, Young Bag Moon, Sang Joon Park, Whan Woo Kim
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Due to the proliferation of technologies and services related with wireless sensor network, various sensor network applications are being appeared on the stage and a lot of sensor network testing technologies are being studied. However, most of testing systems or testbeds have objective for test and evaluation of sensor network protocols. For testing sensors and evaluating signal processing algorithms, it is necessary to develop a testbed for those purposes and especially, for monitoring the high speed sensing data. This paper proposes and implements a wireless sensor network testbed for controlling sensors, getting and managing the real-time sensing data on the remote sites.
Real-Time Wireless Sensor Network for Landslide Detection
Authors: Maneesha V. Ramesh
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Wireless sensor networks are one of the emerging areas which have equipped scientists with the capability of developing real-time monitoring systems. This paper discusses the development of a wireless sensor network(WSN) to detect landslides, which includes the design, development and implementation of a WSN for real time monitoring, the development of the algorithms needed that will enable efficient data collection and data aggregation, and the network requirements of the deployed landslide detection system. The actual deployment of the testbed is in the Idukki district of the Southern state of Kerala, India, a region known for its heavy rainfall, steep slopes, and frequent landslides.
Semantical considerations on dialectical and practical commitments
Authors: Munindar P. Singh
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

This paper studies commitments in multi agent systems. A dialectical commitment corresponds to an agent taking a position about a putative fact, including for the sake of argument. A practical commitment corresponds to an agent being obliged to another to bring about a condition. Although commitments have been used in many works, an adequate formal semantics and axiomatization for them does not yet exist. This paper presents a logic of commitments that illustrates the commonalities and differences of the two kinds of commitments. In this manner, it generalizes the developments of previous papers, precisely delineates the meanings of commitments, and identifies important postulates used informally or semiformally in previous work.
DB2 pureXML Cookbook: Master the Power of the IBM Hybrid Data Server, 1st edition
Authors: Matthias Nicola, Pav Kumar-Chatterjee
Venue:  (2009)

DB2 pureXML Cookbook Master the Power of the IBM Hybrid Data Server Hands-On Solutions and Best Practices for Developing and Managing XML Database Applications with DB2 More and more database developers and DBAs are being asked to develop applications and manage databases that involve XML data. Many are utilizing the highly praised DB2 pureXML technology from IBM. In the DB2 pureXML Cookbook, two leading experts from IBM offer the practical solutions and proven code samples that database professionals need to build better XML solutions faster. Organized by task, this book is packed with more than 700 easy-to-adapt recipe-style examples covering the entire application lifecyclefrom planning and design through coding, optimization, and troubleshooting. This extraordinary library of recipes includes more than 250 XQuery and SQL/XML queries. With the authors hands-on guidance, youll learn how to combine pureXML ingredients to efficiently perform virtually any XML data management task, from the simplest to the most advanced. Coverage includes pureXML in DB2 9 for z/OS and DB2 9.1, 9.5, and 9.7 for Linux, UNIX, and Windows Best practices for designing XML data, applications, and storage objects Importing, exporting, loading, replicating, and federating XML data Querying XML data, from start to finish: XPath and XQuery data model and languages, SQL/XML, stored procedures, UDFs, and much more Avoiding common errors and inefficient XML queries Converting relational data to XML and vice versa Updating and transforming XML documents Defining and working with XML indexes Monitoring and optimizing the performance of XML queries and other operations Using XML Schemas to constrain and validate XML documents XML application developmentincluding code samples for Java, .NET, C, COBOL,PL/1, PHP, and Perl
A Simulation of the Four-Wheel Steering Vehicle Stability Based on DYC Control
Authors: Li Zhou, Linli Ou, Cui Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In order to improve the lateral stability of the vehicles at a high speed, a DYC control method is applied to four-wheel steering vehicle control. Through model tracking method, a feedback controller which used direct yaw moment as the controlled output based on fuzzy control theory is designed, meanwhile, classic 4WS control as a feed forward is used to improve the system dynamic response. Several simulations were conducted at different vehicles speed. The results proved that by DYC control and used fuzzy control, the four-wheel steering vehicle stability could be improved.
Reasoning about intended actions
Authors: Chitta Baral, Michael Gelfond
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

In most research on reasoning about actions and reasoning about narratives one either reasons about hypothetical execution of actions, or about actions that actually occurred. In this paper we develop a high level language that allows the expression of intended or planned action sequences. Unlike observed action occurrences, planned or intended action occurrences may not actually take place. But often when they do not take place, they persist, and happen at an opportune future time. We give the syntax and semantics for expressing such intentions. We then give a logic programming axiomatization and show the correspondence between the semantics of a description in the high level language, and the answer sets of the corresponding logic programming axiomatization. We illustrate the application of our formalism with respect to reasoning about trips.
Change-of-support models and computer programs for direct block-support simulation
Authors: Xavier Emery
Venue: Computers Geosciences (2009)

This article presents a computer program to directly simulate continuous regionalized variables such as mineral grades over a block support. Simulation is performed in the scope of the discrete Gaussian model and does not rely on a block discretization. The realizations can be made conditional to point-support data by use of simple or ordinary kriging, depending on whether or not the average value of the data is considered known. The proposed program can account for an information effect (misclassifications between ore and waste) by co-simulating the true block-support grades together with the grades that will be predicted at the production stage to discriminate between ore and waste.
Problems with Correct Traffic Differentiation in Line Topology IEEE 802.11 EDCA Networks in the Presence of Hidden and Exposed Nodes
Authors: Katarzyna Kosek, Marek Natkaniec, Luca Vollero
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

The problem of content delivery with a required QoS is currently one of the most important. In ad-hoc networks it is IEEE 802.11 EDCA which tries to face this problem. This paper describes several EDCA line topology configurations with mixed priorities of nodes. Detailed conclusions about the innovative results help to understand the behavior of EDCA in the presence of hidden and exposed nodes. They reveal a strong unfairness in medium access between certain nodes dependent on their placement. They prove that for short lines a frequent inversion in the throughput levels of high and low priority traffic occurs and makes reliable content exchange impossible. The importance of the strength of the exposedness and hiddenness of nodes is also discussed. Furthermore, the usefulness of the four-way handshake mechanism is argued and descriptions of the known solutions to the hidden and exposed node problems are given. Finally, novel conclusions about EDCA are provided.
Research on Data Compression Algorithm Based on Prediction Coding for Wireless Sensor Network Nodes
Authors: Zhang Chen, Sun Guiling, Li Weixiang, Gao Yi, Lv Lequn
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Using first-order prediction coding to compress the data that collected by sensor nodes can bring down redundant information and greatly reduce the amount of data transmission in network. The simulation results show that compressing data by improved prediction coding can reduce energy consumption significantly and prolong the whole lifetime of wireless sensor network.
On the role of hierarchy for neural network interpretation
Authors: Jurgen Rahmel, Christian Blum, Peter Hahn
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

In this paper, we concentrate on the expressive power of hierarchical structures in neural networks. Recently, the so-called SplitNet model was introduced. It develops a dynamic network structure based on growing and splitting Kohonen chains and it belongs to the class of topology preserving networks. We briefly introduce the basics of this model and explain the different sources of information built up during the training phase, namely the neuron distribution, the final topology of the network, and the emerging hierarchical structure. In contrast to most other neural models in which the structure is only a means to get desired results, in SplitNet the structure itself is part of the aim. Our focus then lies on the interpretation of the hierarchy produced by the training algorithm and we relate our findings to a common data analysis method, the hierarchical cluster analysis. We illustrate the results of network application to a real medical diagnosis and monitoring task in the domain of nerve lesions of the human hand.
TopX 2.0 at the INEX 2008 Efficiency Track
Authors: Martin Theobald, Mohammed Abujarour, Ralf Schenkel
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

For the INEX Efficiency Track 2008, we were just on time to finish and evaluate our brand-new TopX 2.0 prototype. Complementing our long-running effort on efficient top-k query processing on top of a relational back-end, we now switched to a compressed object-oriented storage for text-centric XML data with direct access to customized inverted files, along with a complete reimplementation of the engine in C++. Our INEX 2008 experiments demonstrate efficiency gains of up to a factor of 30 compared to the previous Java/JDBC-based TopX 1.0 implementation over a relational back-end. TopX 2.0 achieves overall runtimes of less than 51 seconds for the entire batch of 568 Efficiency Track topics in their content-and-structure (CAS) version and less than 29 seconds for the content-only (CO) version, respectively, using a top-15, focused (i.e., non-overlapping) retrieval mode--an average of merely 89 ms per CAS query and 49 ms per CO query.
GA for New Logistics Distribution Routing Optimization Model with Practical Application
Authors: Zheng Changjiang, Shen Jinxing, Xu Chunping, Zhou Qiang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In this study, a new model is presented for logistics distribution routing optimization. The proposed model is capable of solving problems which we could encounter in practical applications. Problems simulated in this study include: the demand of the store is not restricted; a store’s demands could from different depots; none strict constrains on working time; none strict constrains on vehicle capacity; constrains on distribution rules; transverse impedance of roads; traffic control in intersections etc. We select GA which is designed to search for, discover and emphasize good solutions by applying selection and crossover techniques, inspired by nature, to test the proposed model. The test results indicate that the optimization model is of good maneuverability and instruction. At last we list out the defects of the algorithm and put forward the improvement in future.
Constrained classification on structured data
Authors: Chi-Hoon Lee, Matthew Brown, Russell Greiner, Shoajun Wang, Albert Murtha
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed) data. They therefore do not work effectively for tasks that involve non-i.i.d. data, such as "region segmentation". (Eg, the "tumor vs non-tumor" labels in a medical image are correlated, in that adjacent pixels typically have the same label.) This has motivated the work in random fields, which has produced classifiers for such non-i.i.d. data that are significantly better than standard i.i.d.-based classifiers. However, these random field methods are often too slow to be trained for the tasks they were designed to solve. This paper presents a novel variant, Pseudo Conditional Random Fields (PCRFs), that is also based on i.i.d. learners, to allow efficient training but also incorporates correlations, like random fields. We demonstrate that this system is as accurate as other random fields variants, but significantly faster to train.
Relational Scaling in Relational Semantic Systems
Authors: Karl Erich Wolff
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

In this paper two developments in Conceptual Knowledge Processing are combined, namely Contextual Logic introduced by Rudolf Wille and Temporal Concept Analysis introduced by the author. The basic structures connecting both theories are Relational Semantic Systems (RSS), each consisting of conceptual scales and a Relational Data Systems (RDS) for the representation of relational knowledge. We introduce the notion of a concept graph of a RSS. As opposed to the definition of a concept graph of a power context family the concepts used in the concept graph of a RSS are taken from the conceptual scales and not from the concept lattices of the contexts of k-ary relations. For the graphical representation of relational knowledge in information maps we modify tools from Temporal Concept Analysis and develop relational trace diagrams. Its usefulness is shown in a small example of a Relational Semantic System.