ppxscal/embedding_network huggingface dataset:
Research on Vehicle-Coupled-Guideway Vibration in Hybrid Maglev System
Authors: Hu Cheng, Shuwen Chen, Yungang Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

The model of vehicle-coupled-guideway in hybrid maglev system with electromagnets and permanents was established at first in this paper, which was based on the calculation of suspension force and the dynamical characteristics of guideway. The vibration in hybrid maglev system was discussed by analyzing equivalent block diagrams of the closed-loop system. The conclusion was drawn that vehicle-coupled-guideway vibration couldn’t be restrained when the damping is provided by absolute acceleration’s integral. Then it was proved that vibration could be restrained by increasing damping which was provided by gap’s differential. Because gap’s differential couldn’t be measured directly, a practical method to obtain it from gap signal was introduced. This method was used in actual control circuit and its validity was proved by experiment. The experimental result also showed that vehicle-coupled-guideway vibration was restrained by increasing the coefficient of gap’s differential, and this control method could be applied to hybrid maglev system.
Improved Robustness through Population Variance in Ant Colony Optimization
Authors: David C. Matthews, Andrew M. Sutton, Doug Hains, L. Darrell Whitley
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

Ant Colony Optimization algorithms are population-based Stochastic Local Search algorithms that mimic the behavior of ants, simulating pheromone trails to search for solutions to combinatorial optimization problems. This paper introduces Population Variance, a novel approach to ACO algorithms that allows parameters to vary across the population over time, leading to solution construction differences that are not strictly stochastic. The increased exploration appears to help the search escape from local optima, significantly improving the robustness of the algorithm with respect to suboptimal parameter settings.
Computerized tolerance analysis of disk cam mechanisms with a roller follower
Authors: Wen-Tung Chang, Long-Iong Wu
Venue: Engineering with Computers (2009)

The tolerance analysis is one of the key elements of design and manufacturing of cam mechanisms. This paper presents a computerized method for analyzing the tolerances in disk cam mechanisms with a roller follower. By employing the concept of simulated higher-pair contact analysis, the kinematic deviation of the follower motion arising from the tolerance amount of each design parameter can be determined numerically. The offset translating roller follower and the oscillating roller follower cases are given to illustrate the proposed method. The tolerance analysis results show that, owing to the combined effects of various design parameters, the position accuracy of the follower motion may degrade considerably. But, the tolerance amounts of the design parameters may also have a compensating effect to enhance the relative accuracy of the follower motion between its high and low dwell positions. Hence, it is possible to find the optimal tolerance combination for balancing the kinematic accuracy and the tolerance amounts of disk cam mechanisms with a roller follower.
Problems with Pruning in Automatic Creation of Semantic Valence Dictionary for Polish
Authors: Elżbieta Hajnicz
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

In this paper we present the first step towards the automatic creation of semantic valence dictionary of Polish verbs. First, resources used in the process are listed. Second, the way of gathering corpus-based observations into a semantic valence dictionary and pruning them is discussed. Finally, an experiment in the application of the method is presented and evaluated. 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
Combinatorial auctions with k-wise dependent valuations
Authors: Vincent Conitzer, Tuomas Sandholm, Paolo Santi
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

We analyze the computational and communication complexity of combinatorial auctions from a new perspective: the degree of interdependency between the items for sale in the bidders' preferences. Denoting by Gk the class of valuations displaying up to k-wise dependencies, we consider the hierarchy G1 ⊂ G2 ⊂ ... ⊂ Gm, where m is the number of items for sale. We show that the minimum non-trivial degree of interdependency (2-wise dependency) is sufficient to render NP-hard the problem of computing the optimal allocation (but we also exhibit a restricted class of such valuations for which computing the optimal allocation is easy). On the other hand, bidders' preferences can be communicated efficiently (i.e., exchanging a polynomial amount of information) as long as the interdependencies between items are limited to sets of cardinality up to k, where k is an arbitrary constant. The amount of communication required to transmit the bidders' preferences becomes super-polynomial (under the assumption that only value queries are allowed) when interdependencies occur between sets of cardinality g(m), where g(m) is an arbitrary function such that g(m) → ∞ as m → ∞. We also consider approximate elicitation, in which the auctioneer learns, asking polynomially many value queries, an approximation of the bidders' actual preferences.
Abduction with bounded treewidth: from theoretical tractability to practically efficient computation
Authors: Georg Gottlob, Reinhard Pichler, Fang Wei
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. We have recently shown (Gottlob, Pichler, and Wei 2006) that these problems become tractable if the underlying clausal theory has bounded treewidth. However, turning these theoretical tractability results into practically efficient algorithms turned out to be very problematical. In (Gottlob, Pichler, and Wei 2007), we have established a new method based on monadic datalog which remedies this unsatisfactory situation. Specifically, we designed an efficient algorithm for a strongly related problem in the database area. In the current paper, we show that these favorable results can be carried over to logic-based abduction.
Color Quantization by Multiresolution Analysis
Authors: Giuliana Ramella, Gabriella Sanniti Baja
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

A color quantization method is presented, which is based on the analysis of the histogram at different resolutions computed on a Gaussian pyramid of the input image. Criteria based on persistence and dominance of peaks and pits of the histograms are introduced to detect the modes in the histogram of the input image and to define the reduced colormap. Important features of the method are, besides its limited computational cost, the possibility to obtain quantized images with a variable number of colors, depending on the user's need, and that the number of colors in the resulting image does not need to be a priori fixed.
Research on Courses Relationship Model Based on Bayesian Networks
Authors: Jianming Huang, Jiaoli Fang
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

University courses are not isolated settings. There is a certain link among them. This paper presents a construction method for Bayesian networks of university courses relationship, which use the examination results of students' courses as data sample. The undirected graph was constructed with structure learning algorithm based on information theory, and its edges were oriented according to the time order of courses opening. Such the Bayesian network of courses dependence relationship was obtained, and its condition probability table was learned by mathematical statistics method. This model had represented the dependence relationship of courses intuitively, and the condition probability table quantified tightness of relationship. It plays guidance role to the setting and arrangement of university courses, and it has the prediction ability to the students’ achievement.
A framework for fast incremental interpretation during speech decoding
Authors: William Schuler, Stephen Wu, Lane Schwartz
Venue: Computational Linguistics (2009)

This article describes a framework for incorporating referential semantic information from a world model or ontology directly into a probabilistic language model of the sort commonly used in speech recognition, where it can be probabilistically weighted together with phonological and syntactic factors as an integral part of the decoding process. Introducing world model referents into the decoding search greatly increases the search space, but by using a single integrated phonological, syntactic, and referential semantic language model, the decoder is able to incrementally prune this search based on probabilities associated with these combined contexts. The result is a single unified referential semantic probability model which brings several kinds of context to bear in speech decoding, and performs accurate recognition in real time on large domains in the absence of example in-domain training sentences.
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
Authors: Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

The support for function symbols in logic programming under answer set semantics allows to overcome some modeling limitations of traditional Answer Set Programming (ASP) systems, such as the inability of handling infinite domains. On the other hand, admitting function symbols in ASP makes inference undecidable in the general case. Lately, the research community is focusing on finding proper subclasses for which decidability of inference is guaranteed. The two major proposals, so far, are finitary programs and finitely-ground programs. These two proposals are somehow complementary: indeed, the former is conceived to allow decidable querying (by means of a top-down evaluation strategy), while the latter supports the computability of answer-sets (by means of a bottom-up evaluation strategy). One of the main advantages of finitely-ground programs is that they can be "directly" evaluated by current ASP systems, which are based on a bottom-up computational model. However, there are also some interesting programs which are suitable for top-down query evaluation; but do not fall in the class of finitely-ground programs.In this paper, we focus on disjunctive finitely-recursive positive (DFRP) programs. We present a proper adaptation of the magic-sets technique for DFRP programs, which ensures query equivalence under both brave and cautious reasoning. We show that, if the input program is DFRP, then its magic-set rewriting is guaranteed to be finitely ground. Thus, reasoning on DFRP programs turns out to be decidable, and we provide an effective method for its computation on the ASP system DLV.
Manipulation with Fingers in a 3-D Physical Space
Authors: Yuki Kanai, Makoto Oka, Hirohiko Mori
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Recently, input devices in a three dimensional physical space become popular. However these devices get used only with easy interaction and do not get used for complex interaction yet. In this study, proposes a character recognition technique drawn in a three dimensional physical space considering wearable computing environments. The input device that we developed is worn to a finger. The sensor used the acceleration sensor. The recognition rate is verified through the experiment. As a result of doing various experiments, the recognition rate was 65%.
Critical Success Factors for Offshore Software Development Outsourcing Vendors: A Systematic Literature Review
Authors: Siffat Ullah Khan, Mahmood Niazi, Rashid Ahmad
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

CONTEXT – Offshore software development outsourcing is a modern business strategy for producing high quality software at low cost.OBJECTIVE – To identify various Critical Success Factors (CSFs) that have a positive impact on software outsourcing clients in the selection process of offshore software development outsourcing vendors. METHOD – We have performed a Systematic Literature Review process for the identification of factors in the selection process of offshore software development outsourcing vendors. RESULTS – We have identified factors ‘cost-saving’, ‘skilled human resource’, ‘appropriate infrastructure’ and ‘quality of product and services’ that are generally considered important by the outsourcing clients. The results also reveal the similarities and differences in the factors identified in different continents. CONCLUSIONS – Cost-saving should not be considered as the only prime factor in the selection process of software development outsourcing vendors. Vendors should have to address other factors in order to compete in the offshore outsourcing business.
Abstraction in Knowledge-Rich Models for Case-Based Planning
Authors: Antonio A. Sánchez-Ruiz, Pedro A. González-Calero, Belén Díaz-Agudo
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

Abstraction in case-based planning is a mechanism for plan retrieval and adaptation. An abstract case is a generalization of a concrete case that can be reused in different situations to that where the original case was obtained. Additional knowledge is also required to instantiate an abstract case for a new concrete solution.In this paper, we show how the cases built by a generative planner, that uses Description Logics to represent knowledge-rich models of the state of the world, can be automatically abstracted by using the same knowledge model. An algorithm for case abstraction is presented, along with the conditions that a new problem must fulfill for being solvable by an abstract case.
A Study on RFID Book Information Management System with an EDA/SOA
Authors: Wu Jieming, Ding Yu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Event-driven architecture not only shares many of the same characteristics with service-oriented architecture, such as modularity, loose-couplings, and adaptability, but also has ability to process event in an asynchronous way .So it is able to respond better to real-time changes and Integrate the system. This article is concentrate on a RIFD information management system design which base on EDA/SOA.
Application of Genetic Algorithms in Ranking Method of Judgment Matrix
Authors: Ning Zhengang, Chi Jing, Gao Yanfen
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

According to the property that the ratio of corresponding elements is a constant in any two rows of consistency matrix, the indirect judgment information of the judgment matrix is comprehensively used to construct a constrained programming model in order to determine the ranking weight of judgment matrix. And the Genetic Algorithms is used to solve the model. Finally, an example is given to demonstrate this method. The results showed that weight dispersion got by this method is higher, and it is also much easier to identify the optimal plan.
A Video-Based Traffic Congestion Monitoring System Using Adaptive Background Subtraction
Authors: Fei Zhu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

The importance of effective and efficient traffic congestion monitoring grows with the enlarging of urban scale and increasing number of vehicles. We develop a traffic congestion monitoring system which is based on adaptive background subtraction. The system reads real time monitoring video from communications department and converts it into images. After that, we change them into corresponding gray images and carry out image binarization with dynamic multiple thresholds method which selects thresholds depending on pixel, grayscale and pixel position. Afterwards we perform noise reduction with an adaptive median filtering which, taking environmental and other factors into account, dynamically changes median filtering window scale in accordance with the noise density. To fit actual environmental changing, the system updates the background periodically by dynamic background refreshing method. We also put forward an adaptive background subtraction method, which can remove burst noise, to identify the moving objects and get total movement in a given time. Finally, the system determines whether the congestion occurs by comparison result of the total movement and predefined threshold. With the system, traffic management department can facilitate rapid access to the road traffic conditions and real-time traffic congestion monitoring.
Physiological-Based Assessment of the Resilience of Training to Stressful Conditions
Authors: M. Zotov, J. Forsythe, V. Petrukovich, I. Akhmedova
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Russian applied psychophysiology has a wide experience of using the heart rate variability (HRV) measures for the assessment of operator workload. However, `workload indexes' that have received a wide practical application, such as tension index (TI), are not sensitive to the moment-to-moment changes of operator physiological arousal level during the performance of cognitive tasks. In this connection, a new method of HRV analysis called CS-index is offered. This index permits to identify moment-to-moment changes of operator's functional state. The presented research shows that CS-index is sensitive to task load factors, such as task difficulty level and stressful conditions and allows to differentiate experienced and novice operators during their performance on a simulator. If the CS-index proves to be reliable enough, its combination with the Automated Expert Modeling for Automated Student Evaluation (AEMASE) approach can considerably raise the efficiency of operator training.
Component-based LR parsing
Authors: Xiaoqing Wu, Barrett R. Bryant, Jeff Gray, Marjan Mernik
Venue: Computer Languages, Systems and Structures (2010)

A language implementation with proper compositionality enables a compiler developer to divide-and-conquer the complexity of building a large language by constructing a set of smaller languages. Ideally, these small language implementations should be independent of each other such that they can be designed, implemented and debugged individually, and later be reused in different applications (e.g., building domain-specific languages). However, the language composition offered by several existing parser generators resides at the grammar level, which means all the grammar modules need to be composed together and all corresponding ambiguities have to be resolved before generating a single parser for the language. This produces tight coupling between grammar modules, which harms information hiding and affects independent development of language features. To address this problem, we have developed a novel parsing algorithm that we call Component-based LR (CLR) parsing, which provides code-level compositionality for language development by producing a separate parser for each grammar component. In addition to shift and reduce actions, the algorithm extends general LR parsing by introducing switch and return actions to empower the parsing action to jump from one parser to another. Our experimental evaluation demonstrates that CLR increases the comprehensibility, reusability, changeability and independent development ability of the language implementation. Moreover, the loose coupling among parser components enables CLR to describe grammars that contain LR parsing conflicts or require ambiguous token definitions, such as island grammars and embedded languages.
Phosphorus Removal in Sewage by Mixed Steel Slag Fillings
Authors: Ling Huang, Yongqiang Su
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The purpose of the paper is purifying phosphorus by column experiment and researching phosphorus removal theory of substrates including steel slag, natural sand and limestone. The winch is composed of the following main parts: experiment method and procedure, results and discussion and conclusion. The results indicated: Pure steel slag is not suitable as filling in wastewater land treating. Mixing natural sands as permeable medium and limestone as Ca resource is essential. The adsorption of steel slag is primarymechanism in purifying phosphorus in mixed column. The ratio of 20% steel slag, 50% natural sand and 30% lime stone is suitable for removing phosphorus in living waste water. The P concentration of effluent was lower than 0.5mg/L.
Orientation-Constrained Rectangular Layouts
Authors: David Eppstein, Elena Mumford
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.
Cognitive Engineering for Direct Human-Robot Cooperation in Self-optimizing Assembly Cells
Authors: Marcel Ph. Mayer, Barbara Odenthal, Marco Faber, Jan Neuhöfer, Wolfgang Kabuß, Bernhard Kausch, Christopher M. Schlick
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

In a work system with direct human robot cooperation the conformity of the operator's expectation with the behavior of the robotic device is of great importance. In this contribution a novel approach for the numerical control of such a system based on human cognition and a cognitive engineered approach for the encoding of the system's a priori knowledge is introduced. The implementation using an established method in the field of design of cognitive systems is compared to a schema describing human decision making. Finally, simulation results of the implementation are compared to empirical tests with individuals.
Integrating User Experience into a Software Development Company --- A Case Study
Authors: Tobias Komischke
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Establishing an user experience (UX) practice is an endeavor that more and more companies engage in to increase their market success. While there is a rich knowledge base on UX processes and methods, practical tips and tricks for starting up a corporate UX culture are harder to find. This paper summarizes best practices, recommendations and experiences from other companies and traces our own efforts and thoughts while integrating UX into our company.