ppxscal/embedding_network huggingface dataset:
A GNSS Based Slide and Slip Detection Method for Train Positioning
Authors: Cai Bai-gen, Wang Jian, Yin Qin, Liu Jiang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Real-time positioning is an important part of the modern train control system. An efficient method to improve the positioning accuracy and reliability is the multi-sensor integrated positioning system, and GNSS is introduced to the existing train positioning based on odometer (ODO) in this paper, where the accuracy and error source of train positioning based on ODO are analyzed, and an effective slide and slip detection method is proposed with the integration of GNSS and odometer. Experimental results demonstrate the proposed method could realize the detection of slide and slip with high positioning accuracy.
Nbest dependency parsing with linguistically rich models
Authors: Xiaodong Shi, Yidong Chen
Venue: Proceedings of the 10th International Conference on Parsing Technologies (2007)

We try to improve the classifier-based deterministic dependency parsing in two ways: by introducing a better search method based on a non-deterministic nbest algorithm and by devising a series of linguistically richer models. It is experimentally shown on a ConLL 2007 shared task that this results in a system with higher performance while still keeping it simple enough for an efficient implementation.
Improving Internet Access to Help Small Business Compete in a Global Economy
Authors: Hermann E. Walker
Venue:  (2009)

Businesses are quickly integrating new telecom services into their business plans. Broadband connects entrepreneurs to millions of distant customers, facilitates telecommuting, and increases productivity in many ways. Much of our economic growth is attributable to productivity increases arising from telecommunications advances. This book presents the edited text of a U.S. Senate hearing devoted to this subject. 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
A Mobile Clinical Decision Support System for Clubfoot Treatment
Authors: Weiqin Chen, Dag Skjelvik
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

In current congenital clubfoot treatment, clinicians use paper forms to register and monitor the treatment process. Routines for registration and archiving are scarce, and the guideline for treating clubfoot is not always followed strictly. This paper presents a PDA-based system (GenSupport) that can support the registration of patient information, supervise the treatment process, as well as provide advice during treatment. GenSupport has been evaluated in a pilot study.
On the reducibility of hypotheses and consequences
Authors: E. Trillas, A. Pradera, A. Álvarez
Venue: Information Sciences: an International Journal (2009)

This paper only tries to shed some additional light on the concepts of hypotheses and consequences, introduced by Trillas et al. [E. Trillas, S. Cubillo, and E. Castineira, On conjectures in orthocomplemented lattices, Artificial Intelligence, 117 (2) (2000) 255-275] as particular cases of the more general concept of conjecture. The definitions of reducible hypothesis and reducible consequence are presented, and it is shown that in orthomodular lattices all hypotheses and consequences are reducible, but that this is not necessarily the case in proper ortholattices. In addition, the sets of reducible hypotheses and consequences are characterized, both for general ortholattices as well as for the particular case of orthomodular lattices.
Formal Verification for Scientific Computing: Trends and Progress
Authors: Stephen F. Siegel
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

Science has been transformed by computation. Many observers now consider simulation a "third approach" to scientific discovery, on par with experimentation and theory. But scientists have long-established methods for verifying conclusions based on those traditional approaches--the same is not true for simulation. Reports on simulation-based research often say little about the qualities of the software used, or what was done to ascertain its correctness. Sometimes the software is not even made available to the public; but even when it is, how many would bother to check it, and how would they go about doing so?
A Survey of Orthogonal Matrix-Valued Two-Dimensional Wavelet Packets with an Integer Quantity Dilation Matrix
Authors: Hongwei Gao, Yanping Cao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Wavelet analysis has been a powerful tool for exploring and solving many complicated problems in natural science and engineering computation. In this work, the notion of orthogonal matrix-valued two-dimensional wavelet packets with an integer Quantity Dilation Matrix is introduced. A procedure for constructing them is presented. Their orthogonal properties are discussed by virtue of finite group theory, time-frequency analysis method and matrix theory. Orthogonality formulas on the wavelet packets are established.
Modification of Theoretical Fixed-point LMS Algorithm for Implementation in Hardware
Authors: Zheng-wei Hu, Zhi-yuan Xie
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In order to realize the adaptive signal processing in real time, a modified fixed-point LMS algorithm for implementation in hardware was proposed in this paper. Expressions of this modified fixed-point LMS algorithm were deduced from the theoretical fixed-point LMS algorithm according to rounding errors. Data problems were discussed and efficient settling methods were suggested. A modified 8-weight fixed-point LMS algorithm was implemented on FPGA. The correctness and quality of this modified fixed-point LMS algorithm can be confirmed through comparing simulation results between the implemented 8-weight fixed-point LMS algorithm and 8-weight theoretical fixed-point LMS algorithm. Rounding errors were inevitable for the reason of limited word-length. Values of rounding errors can be reduced to the minimum through adjusting the amplitude of input signal, step or others variables. When the range of signal- to-noise ratio can be allowed, this modified fixed-point LMS algorithm was very efficient and useful.
Studying and Realization of Hydraulic Servo System Based on IMC
Authors: Tao Shi, Zhi-kun Chen, Rui-yin Tang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Aiming at the complexity of hydraulic vibrancy platform, a PID control method of double closed loop control based on IMC control principle is put forward. It realized the proportion control in inner loop using the anti-interference of the PID control, and the controlled object was transformed into a one-order inertia link with the time-delay unit. After approximating the time-delay unit by the 1/1 Pade method, the low pass filter and PID controller that they are equivalent to IMC controller can be obtained by using IMC control principle to realize outer loop control. Listing some material steps at designing of IMC controller, through the simulation experiment, it shows that the IMC-PID control method is superior to the traditional PID method in anti-interference and robustness, and its application value in projects is very high.
The Injectivity of the Global Function of a Cellular Automaton in the Hyperbolic Plane is Undecidable
Authors: Maurice Margenstern
Venue: Fundamenta Informaticae (2009)

In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane, see [6, 22, 9, 12] and we consider the global function defined on all possible configurations. Is the injectivity of this function undecidable? The problem was answered positively in the case of the Euclidean plane by Jarkko Kari, in 1994, see [4]. In the present paper, we show that the answer is also positive for the hyperbolic plane: the problem is undecidable.
Minimum splits based discretization for continuous features
Authors: Ke Wang, Han Chong Goh
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness measure, subject to constraints such as the maximal number of intervals, the minimal number of examples per interval, or some stopping criterion for splitting. We take a different approach by searching for minimum splits that minimize the number of intervals with respect to a threshold of impurity (i.e., badness). We propose a "total entropy" motivated selection of the "best" split from minimum splits, without requiring additional constraints. Experiments show that the proposed method produces better decision trees.
Integration Technology for Complex Product Development Process
Authors: Ci-jun Xu, Ai-ping Li, Xue-mei Liu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

To improve the efficiency of complex product development, an integration model of five-dimension space based on project activity was presented. In view of the link role of activities, mapping relations among the spaces were constructed to analyze the function module in the different management system. By defining activity-flow, workflow, knowledge-flow, data-flow and resource-flow, the processes of function implementation in the corresponding space were analyzed, and the Push-Pull processes of knowledge and resource were introduced. According to the implementation technology of the sharing database, the information integration for five-dimension space was analyzed, and their associate relations were formulated through the standard AND-OR expressions. Finally, the inference rules of process logics were described through the expressions. This integration technology provided a platform for the implementation of knowledge Push-Pull technology and resource Push-Pull technology, and technical support for the rapid design of complex product.
The Stanford OpenRoads deployment
Authors: Kok-Kiong Yap, Masayoshi Kobayashi, David Underhill, Srinivasan Seetharaman, Peyman Kazemian, Nick McKeown
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

We have built and deployed OpenRoads [11], a testbed that allows multiple network experiments to be conducted concurrently in a production network. For example, multiple routing protocols, mobility managers and network access controllers can run simultaneously in the same network. In this paper, we describe and discuss our deployment of the testbed at Stanford University. We focus on the challenges we faced deploying in a production network, and the tools we built to overcome these challenges. Our goal is to gain enough experience for other groups to deploy OpenRoads in their campus network.
Throughput Analysis of Wireless Multi-hop Chain Networks
Authors: Fangqin Liu, Chuang Lin, Hao Wen, Peter Ungsunan
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

It is important but challenging to understand the throughput performance in wireless multi-hop networks. Most previous works show that the M/M/1 model is accurate enough for throughput analysis most of the time. However, we notice that without considering the interrelationship between the traffic on nodes, the M/M/1 model is quite inaccurate sometimes, especially on the typical chain topology. Therefore in this paper, we propose a model called Traffic-Analysis-Based (TAB) for throughput analysis focusing on chains. TAB obtains the throughput by analyzing the state transition process of the chain as the traffic rate is increasing, based on the traffic interrelationships. Besides the throughput of each node, we also get two significant state transition points. One is the optimal sending rate of traffic, and the other is the lower bound when M/M/1 can be used. Simulation results show that TAB is much more accurate than M/M/1 when the traffic rate is under the second transition point.
Using Acoustic Sensor Technologies to Create a More Terrain Capable Unmanned Ground Vehicle
Authors: Siddharth Odedra, Stephen D. Prior, Mehmet Karamanoglu, Mehmet Ali Erbil, Siu-Tsen Shen
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Unmanned Ground Vehicle's (UGV) have to cope with the most complex range of dynamic and variable obstacles and therefore need to be highly intelligent in order to cope with navigating in such a cluttered environment. When traversing over different terrains (whether it is a UGV or a commercial manned vehicle) different drive styles and configuration settings need to be selected in order to travel successfully over each terrain type. These settings are usually selected by a human operator in manned systems on what they assume the ground conditions to be, but how can an autonomous UGV `sense' these changes in terrain or ground conditions? This paper will investigate noncontact acoustic sensor technologies and how they can be used to detect different terrain types by listening to the interaction between the wheel and the terrain. The results can then be used to create a terrain classification list for the system so in future missions it can use the sensor technology to identify the terrain type it is trying to traverse, which creating a more autonomous and terrain capable vehicle. The technology would also benefit commercial driver assistive technologies.
A robotic weight loss coach
Authors: Cory D. Kidd, Cynthia Breazeal
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We present a rationale for studying long-term human-robot interaction and explain why new applications are necessary for this type of experimentation. The design and implementation of a robot that has been implemented is briefly described with the outline of a study that is under way.
Scaling natural language understanding via user-driven ontology learning
Authors: Berenike Loos
Venue: Proceedings of the Third Workshop on Scalable Natural Language Understanding (2006)

Non-statistical natural language understanding components need world knowledge of the domain for which they are applied in a machine-readable form. This knowledge can be represented by manually created ontologies. However, as soon as new concepts, instances or relations are involved in the domain, the manually created ontology lacks necessary information, i.e. it becomes obsolete and/or incomplete. This means its "world model" will be insufficient to understand the user. The scalability of a natural language understanding system, therefore, essentially depends on its capability to be up to date. The approach presented herein applies the information provided by the user in a dialog system to acquire the knowledge needed to understand him or her adequately. Furthermore, it takes the position that the type of incremental ontology learning as proposed herein constitutes a viable approach to enhance the scalability of natural language systems.
An Evaluation of Product Identification Techniques for Mobile Phones
Authors: Felix Reischach, Florian Michahelles, Dominique Guinard, Robert Adelmann, Elgar Fleisch, Albrecht Schmidt
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Among others, consumer products can be purchased in the Internet and in traditional stores. Each of the two has dedicated advantages. An online survey conducted within the frames of this work investigates these advantages. It motivates the transition of the advantages of online shopping, such as access to recommendations of other consumers, to the sales floor. Recent trends in mobile phone technology, for example the emergence of the mobile Internet, enable exactly this transition, potentially enriching the shopping experience in the real world. A key challenge though is a fast and convenient identification of products. This work compares five product identification modalities for mobile phones in a comparative study. The dependent variables evaluated are `task completion time' and `perceived ease of use'. Our study is the first that quantifies the advantage of automatic identification. The results indicate that automatically identifying a product scanning a tag can be up to eight times faster than entering a product name in a text field. Surprisingly, barcode recognition using a camera phone can be conducted almost as fast and convenient as scanning an RFID tag. Our work provides a benchmark for developers having to choose appropriate identification technology for their mobile application.
Sampling Edge Covers in 3-Regular Graphs
Authors: Ivona Bezáková, William A. Rummler
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidly for graphs with degrees at most three. Glauber dynamics have been studied extensively in the statistical physics community, with special emphasis on lattice graphs. Our results apply, for example, to the hexagonal lattice. Our proof of rapid mixing introduces a new cycle/path decomposition for the canonical flow argument.
Latency-Insensitive Design: Retry Relay-Station and Fusion Shell
Authors: Julien Boucaron, Anthony Coadou, Robert de Simone
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

This paper introduces a new variant implementation of Latency-Insensitive Design elements. It optimizes area footprint of so-called Shell-Wrappers being partially fused with their input Relay-Stations. The modified Relay-Station is called a Retry Relay-Station. We show correctness of this implementation and provide comparative results between a regular implementation and our new one on both FPGA and ASIC.
A Comparative Landscape Analysis of Fitness Functions for Search-Based Testing
Authors: Raluca Lefticaru, Florentin Ipate
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Landscape analysis of fitness functions is an important topic.This paper makes an attempt to characterize the search problems associated with the fitness functions used in search-based testing, employingthe following measures: diameter, autocorrelation and fitness distance correlation.In a previous work, a general form of objective functions for structuralsearch-based software testing was tailored for state-based testing.A comparison is performed in this paper between the general fitness functions and some problem-specific fitness functions, taking into account their performance with different search methods.
Planning as satisfiability with preferences
Authors: Enrico Giunchiglia, Marco Maratea
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Planning as Satisfiability is one of the most well-known and effective technique for classical planning: SATPLAN has been the winning system in the deterministic track for optimal planners in the 4th International Planning Competition (IPC) and a co-winner in the 5th IPC. In this paper we extend the Planning as Satisfiability approach in order to handle preferences and SATPLAN in order to solve problems with simple preferences. The resulting system, SATPLAN(P) is competitive with SGPLAN, the winning system in the category "simple preferences" at the last IPC. Further, we show that SATPLAN(P) performances are (almost) always comparable to those of SATPLAN when solving the same problems without preferences: in other words, introducing simple preferences in SATPLAN does not affect its performances. This latter result is due both to the particular mechanism we use in order to incorporate preferences in SAT-PLAN and to the relative low number of soft goals (each corresponding to a simple preference) usually present in planning problems. Indeed, if we consider the issue of determining minimal plans (corresponding to problems with thousands of preferences) the performances of SATPLAN(P) are comparable to those of SATPLAN in many cases, but can be significantly worse when the number of preferences is very high compared to the total number of variables in the problem. Our analysis is conducted considering both qualitative and quantitative preferences, different reductions from quantitative to qualitative ones, and most of the propositional planning domains from the IPCs and that SATPLAN can handle.
Design Tools for Online Educational Games: Concept and Application
Authors: Louise Sauvé
Venue: Transactions on Edutainment II (2009)

A research and development program initiated under the aegis of the Center for expertise and research of lifelong learning (SAVIE) has developed a series of generic educational game design shells to enable teachers, trainers and community service workers to create educational games that provide effective learning conditions and are adapted to their distance learning needs. These environments were based on the frame game concept and on the essential attributes of games. In this paper, we will first describe the context which deals with the development of generic shells for educational games. Then, we define the concept of educational games and present the indicators for choosing an educational game that is efficient. Then, we define the concepts of generic game shells and describe the interactive pedagogical design model. Finally, we show an example to illustrate how a generic shell such as that of the Parcheesi game can generate quality educational games adapted to the needs of learners studying in distant locations at various levels of schooling.
A User Requirements Oriented Dynamic Web Service Composition Framework
Authors: Peng Xiaoming, Fang Qiqing, Hu Yahui, Zhu Bingjian
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

A novel two staged and user requirements oriented Dynamic Web Service composition framework is presented in this paper. Firstly, we separate the end user requirements into two parts:functional and non-functional requirements. Consequently, with user requirements in OWL-S, the composition firstly uses JSHOP2 technique to generate an Abstract Service Plan to satisfy user functional requirement. In the second stage, the Web Service Instance Selection problem is converted into a multi-objective optimization problem, using the Multi-Objective Ant Colony Optimization (MOACO), the Abstract Service Plan is concretized into an Concrete Workflow based on non-functional requirements, and then being transformed into BPEL4WS. Theoretical analysis indicates the proposed solution which separately dealing with the functional requirements and the non-functional requirements leads to a significant reduction of the search space. The prototype in a domain-specific scenario indicates the feasibility of the framework.