ppxscal/embedding_network huggingface dataset:
Path Plan in Gravity Aided Inertial Navigation Based on Ant Colony Algorithm
Authors: Lu Zeyuan, Cai Tijing, Yang Zhuopeng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

According to the characteristics of gravity aided inertial navigation, the paper presents an ant colony algorithm (ACA) which takes gravity correlation coefficients as heuristic factors, and the simulation of the algorithm based on simulated gravity anomaly map is carried out. The results show paths derived from the algorithm are short, and nodes of paths have lower gravity correlation coefficient. The validity of ACA in path plan for gravity navigation is verified by simulation.
Peer-to-Peer Message Routing Algorithm with Additional Node-Information for Ubiquitous Networks and Its Performance Evaluation
Authors: Takuji Tachibana
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

In large-scale heterogeneous P2P networks, it is indispensable to manage objects based on node’s capabilities. In order to achieve this end, capability-aware object management based on Skip List has been proposed. However, in this method, the number of hops for message routing increases as the number of nodes becomes large. In this paper, for the capability-aware object management, we propose a new message routing algorithms in order to decrease the number of hops. In our proposed algorithm, additional node-information is included in a transmitting message and this information is used so that a node does not receive the same message doubly. Each node can use our proposed algorithm simply, and its implementation is easy. We evaluate the performance of the proposed method by simulation. Numerical examples show that the proposed method can decrease the average number of hops in any cases. In addition, the maximum number of hops decreases significantly when the number of nodes is large. We also evaluate the performance of the proposed method over physical networks.
Developments in affect detection in e-drama
Authors: Li Zhang, John A. Barnden, Robert J. Hendley, Alan M. Wallington
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

We report work in progress on adding affect-detection to an existing program for virtual dramatic improvisation, monitored by a human director. To partially automate the directors' functions, we have partially implemented the detection of emotions, etc. in users' text input, by means of pattern-matching, robust parsing and some semantic analysis. The work also involves basic research into how affect is conveyed by metaphor.
Tooling the Dynamic Behavior Models of Graphical DSLs
Authors: Tihamér Levendovszky, Tamás Mészáros
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Domain-specific modeling is a powerful technique to describe complex systems in a precise but still understandable way. Rapid creation of graphical Domain-Specific Languages (DSLs) has been focused for many years. Research efforts have proven that metamodeling is a promising way of defining the abstract syntax of the language. It is also clear that DSLs can be developed to describe the concrete syntax and the dynamic behavior. Previous research has contributed a set of graphical DSLs to model the behavior ("animation") of arbitrary graphical DSLs. This paper contributes practical techniques to simplify our message handling method, automate the integration process, and show where domain-specific model patterns can help to accelerate the simulation modeling process.
Multiple-Level MPI File Write-Back and Prefetching for Blue Gene Systems
Authors: Javier García Blas, Florin Isailă, J. Carretero, Robert Latham, Robert Ross
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

This paper presents the design and implementation of an asynchronous data-staging strategy for file accesses based on ROMIO, the most popular MPI-IO distribution, and ZeptoOS, an open source operating system solution for Blue Gene systems. We describe and evaluate a two-level file write-back implementation and a one-level prefetching solution. The experimental results demonstrate that both solutions achieve high performance through a high degree of overlap between computation, communication, and file I/O.
Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis
Authors: Guoqing Xu, Atanas Rountev, Manu Sridharan
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for an entire large program. Our goal is to increase significantly the scalability of the currently most precise points-to analysis for Java. This CFL-reachability analysis depends on determining whether two program variables may be aliases. We propose an efficient but less precise pre-analysis that computes context-sensitive must-not-alias information for all pairs of variables. Later, these results can be used to quickly filter out infeasible CFL-paths during the more precise points-to analysis. Several novel techniques are employed to achieve precision and efficiency, including a new approximate CFL-reachability formulation of alias analysis, as well as a carefully-chosen trade-off in context sensitivity. The approach effectively reduces the search space of the points-to analysis: the modified points-to analysis is more than three times faster than the original analysis.
Towards a flexible UI model for automotive human-machine interaction
Authors: Guido de Melo, Frank Honold, Michael Weber, Mark Poguntke, André Berton
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

In this paper we present an approach for creating user interfaces from abstract representations for the automotive domain. The approach is based on transformations between different user interface abstraction levels. Existing user interface representation methods are presented and evaluated. The impact of specific requirements for automotive human-machine interaction is discussed. Considering these requirements a process based on transformation rules is outlined to allow for flexible integration of external infotainment applications coming from mobile devices or web sources into the in-car interaction environment.
Method for Getting Inter-Independent Features Used to Intrusion Detection System in Controllable and Trusted Networks
Authors: Yu Sheng Chen, Zhang Li, Lu Xiu Lin, Liu Quan Fu, Xu Long Wei, Lei Yu Guo
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In order to improve the reality, useful and whole performance of network Intrusion Detection System (IDS), the solution to get independent features used to (or evidence) IDS is presented in the paper. The approach of auto-recognition of inter-relativity of the features is developed, which is classification method for features. The features picked up by the method are used as the input of back propagate neural network (BPNN). The features are inter-independent, or weak relative. On the base of the chosen features, an IDS is built. Tests show that the approach and IDS developed in the article is useful and available. It is conclusion that a set of inter-independent features should be provided for IDS. The inter-relative degree of features can be required with the help of the method developed in the article.
Quaternion-Based Color Image Smoothing Using a Spatially Varying Kernel
Authors: Özlem N. Subakan, Baba C. Vemuri
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

Addressing the issue of feature/detail preserving color image smoothing, we propose a novel unified approach based on a quaternion framework. The main idea is to holistically extract the local orientation information at each lattice point, and then to incorporate it into the smoothing process. We introduce a new Quaternion Gabor Filter to derive the local orientation information in color images. This derived orientation information is modeled using a continuous mixture of appropriate exponential basis functions. We solve the continuous mixture integral in analytic form, and develop a spatially varying kernel which respects to the local geometry at each lattice point in a color image. Superior performance of our smoothing framework is demonstrated via comparison to competing state-of-the-art algorithms in literature.
The Evidence of the Fountainhead of the Xilamulun River in Late Pleistocene
Authors: Ben-hua Liu, Hong-han Chen, Qing-guo Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

In the period of the water resources evolutionary investigation of North China, from the 3-D map composed of TM and DEM, the downstream of the Xilamulun river is the wide Kailu basin, with huge alluvial-lacustrine sandy sedimentswhich constitute great Xiliaohe plain, but the watershed area has not sufficient water and sand-soil sediments enough to form such present huge sedimentary plain in theory. By studying the predecessor data, outside investigation and applying the 3S technology, it believed that the present west watershed boundary of the Xilamulun river is not the real watershed one in history, the fountainhead should be the huge of alluvial-lacustrine basinon the west of the present west watershed boundary, this basin had enough water and sediments to meet the material and power to form the huge downstream sediment plain, this study provides the theoretical base and the direction to administrate the water environment of Xilamulun river.
Exploring the Structure of Broadcast News for Topic Segmentation
Authors: Rui Amaral, Isabel Trancoso
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

This paper describes our on-going work toward the improvement of Broadcast News story segmentation module. We have tried to improve our baseline algorithm by further exploring the typical structure of a broadcast news show, first by training a CART and then by integrating it in a 2-stage algorithm that is able to deal with shows with double anchors. In order to deal with shows with a thematic anchor, a more complex approach is adopted including a topic classification stage. The automatic segmentation is currently being compared with the manual segmentation done by a professional media watch company. The results are very promising so far, specially taking into account that no video information is used.
A Multi-Agent System for the Pay-As-You-GO (PAYGO) Social Security Scheme
Authors: Athanasios A. Pantelous, Alexandros A. Zimbidis
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

Multi-Agent Systems (MAS) are suitable for dealing with applications where the environment is both dynamic and very complex, with several type of competitors to get involved. Thus, in this paper, we import MAS conceptualization into the well-known (quasi) Pay-As-You-GO social security scheme; practically useful for many Western Economies. First, we start our analysis with the individual agent and subsequently we move towards a system containing many (cognitive) social agents that considers relations, coordinations and interactions.
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
Authors: Daiji Fukagawa, Tatsuya Akutsu, Atsuhiro Takasu
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation algorithm whose approximation ratio is 2h + 2, where we consider unit cost edit operations and h is the maximum height of the two input trees. The algorithm is based on an embedding of unit cost tree edit distance into L 1 distance. We also present an efficient implementation of the algorithm using randomized dimension reduction.
On the size of Boyer-Moore automata
Authors: Ricardo Baeza-Yates, Véronique Bruyère, Olivier Delgrange, Rodrigo Scheihing
Venue: Theoretical Computer Science (2009)

In this work we study the size of Boyer-Moore automata introduced in Knuth, Morris & Pratt's famous paper on pattern matching. We experimentally show that a finite class of binary patterns produce very large Boyer-Moore automata, and find one particular case which we conjecture, generates automata of size @W(m^6). Further experimental results suggest that the maximal size could be a polynomial of O(m^7), or even an exponential O(2^0^.^4^m), where m is the length of the pattern.
Robust Solutions in Unstable Optimization Problems
Authors: Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Rina Dechter
Venue: Recent Advances in Constraints: 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers (2009)

We consider constraint optimization problems where costs (or preferences) are all given, but some are tagged as possibly unstable, and provided with a range of alternative values. We also allow for some uncontrollable variables, whose value cannot be decided by the agent in charge of taking the decisions, but will be decided by Nature or by some other agent. These two forms of uncertainty are often found in many scheduling and planning scenarios. For such problems, we define several notions of desirable solutions. Such notions take into account not only the optimality of the solutions, but also their degree of robustness (of the optimality status, or of the cost) w.r.t. the uncertainty present in the problem. We provide an algorithm to find solutions accordingly to the considered notions of optimality, and we study the properties of these algorithms. For the uncontrollable variables, we propose to adopt a variant of classical variable elimination, where we act pessimistically rather than optimistically.
SARI-SQL: Event Query Language for Event Analysis
Authors: Szabolcs Rozsnyai, Josef Schiefer, Heinz Roth
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Complex Event Processing (CEP) systems are capable of processing large amounts of events, utilizing them to monitor, steer and optimize business in real time. The lack of tracking events and maintaining the causal relationships and traceability between those events, as well as aggregating them to higher-level events, is a problem that is currently investigated by many research groups. In this paper, we present SARI-SQL, which is a domain-specific event-query language, (EQL) that is designed for business analysts to easily gain insight into business events. SARI-SQL enables the retrieval of near real-time events and can process historical events, metrics and scores for analytical purposes. We introduce the SARI-SQL syntax and show infrastructural components for the query engine. We further show examples to illustrate the query language, and propose a reference implementation for the query engine.
Trends of Stratospheric Aerosol and Ozone over Tibetan Plateau
Authors: Chen Quanliang, Ren Jingxuan, Zhang Yongli
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The aerosol and ozone mixing ratio data of HALOE is used to analysis the distribution and trends of the aerosol and ozone over the Plateau is analyzed and their relationship is discussed further. There is clear gap in the aerosol and ozone vertical profiles. Below the 50hPa level the difference of the aerosol in different seasons is clear and the aerosol mixing ratio in winter and spring is more than that in summer and autumn. Between 20hPa and 5hPa, the ozone mixing ratio is highest in summer and lowest in winter. The ozone over the Plateau is less than that of ECHN in spring and summer from 100hPa to 10hPa so that these results in the ozone valley from May to July. In the low stratosphere from 100hPa to 60hPa and the upper stratosphere above 30hPa, aerosol and ozone mixing ratio both have a good positive correlation over the Tibetan Plateau.
Expectation-based versus potential-aware automated abstraction in imperfect information games: an experimental comparison using poker
Authors: Andrew Gilpin, Thomas Sandholm
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Automated abstraction algorithms for sequential imperfect information games have recently emerged as a key component in developing competitive game theory-based agents. The existing literature has not investigated the relative performance of different abstraction algorithms. Instead, agents whose construction has used automated abstraction have only been compared under confounding effects: different granularities of abstraction and equilibrium-finding algorithms that yield different accuracies when solving the abstracted game. This paper provides the first systematic evaluation of abstraction algorithms. Two families of algorithms have been proposed. The distinguishing feature is the measure used to evaluate the strategic similarity between game states. One algorithm uses the probability of winning as the similarity measure. The other uses a potential-aware similarity measure based on probability distributions over future states. We conduct experiments on Rhode Island Hold'em poker. We compare the algorithms against each other, against optimal play, and against each agent's nemesis. We also compare them based on the resulting game's value. Interestingly, for very coarse abstractions the expectation-based algorithm is better, but for moderately coarse and fine abstractions the potential-aware approach is superior. Furthermore, agents constructed using the expectation-based approach are highly exploitable beyond what their performance against the game's optimal strategy would suggest.
Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
Authors: Reza Dorrigiv, Stephane Durocher, Arash Farzan, Robert Fraser, Alejandro López-Ortiz, J. Ian Munro, Alejandro Salinger, Matthew Skala
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Given a simple polygon P, we consider the problem of finding a convex polygon Q contained in P that minimizes H(P,Q), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P. We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem.
Mastering System Center Configuration Manager 2007 R2
Authors: Chris Mosby, Ron D. Crumbaker, Christopher W. Urban
Venue:  (2009)

Mastering System Center Configuration Manager 2007 provides intermediate and advanced coverage of all aspects of the product, including planning and installation, upgrading Systems Management Server 2003, deploying software and operating systems, security, monitoring and troubleshooting, and automating and customizing SCCM 2007 with scripts. The authors take a hands-on approach by providing many real-world scenarios to show readers how to use the tool in various contexts. This anchors the conceptual explanations in practical application. This book's web site will contain a collection of ready-to-use scripts with directions for implementing them in network systems.
Maintaining integrated XML schema
Authors: Kalpdrum Passi, Don Morgan, Sanjay Madria
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

When e-commerce companies merge there is a need to integrate their local schema into a uniform global source that is easily generated and maintained. In this paper we explore the incremental maintenance of global XML schema against updates to local schemas with the use of three simple operations, Add, Remove, and Change. These operations are designed to work as an extension to the AXIS model [12], which currently does not have a way to maintain the global schema once an underlying source schema is updated.
A Software-Controlled Cache Coherence Optimization for Snoopy-Based SMP System
Authors: Youhui Zhang, Ziqiang Qian, Weimin Zheng
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Some research results show that on average 67% of broadcasts for the maintenance of cache coherence in SMP systems are unnecessary. To reduce the unnecessary overhead of snoopy-based SMP systems, this paper proposes a new software/hardware hybrid cache coherence optimization-the programmer can insert special instructions into programs to direct related hardware to enable/disable broadcast operations, so some potential broadcasts for unshared variables are avoided without violating data coherence. We design the mechanism along with a proposed coherence protocol. Moreover, it is simulated on a SMP simulation platform and the results show that the improvement is apparent. Although the insertion is manual, it accords with the existing SMP programming model.
Vibration Analysis and Prediction of Turbine Rotor Based Grey Artificial Neural Network
Authors: Peng Wen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

To manage the complexities of vibration reasons, a new method to predict the vibration and analyze the reliability of the turbine rotor is proposed in this paper. Based on analyzing the vibration reasons, the measuring positions of vibration are obtained, and then the rotor will be periodic measured under the normal operation condition to get the test date, namely the amplitude of vibration. Based on the amplitude, the grey model optimized by BP neural network is established. Finally, a case study has been conducted, which proves that the model is valid and applicable; especially it could find vibration fault earlier in the operation of the rotor and determine the maintenance program which can ensure the security reliability of the turbines.
Model-based testing approaches selection for software projects
Authors: Arilo Claudio Dias-Neto, Guilherme Horta Travassos
Venue: Information and Software Technology (2009)

Selecting software technologies for software projects represents a challenge to software engineers. It is known that software projects differ from each other by presenting different characteristics that can complicate the selection of such technologies. This is not different when considering model-based testing. There are many approaches with different characteristics described in the technical literature that can be used in software projects. However, there is no indication as to how they can fit a software project. Therefore, a strategy to select model-based testing approaches for software projects called Porantim is fully described in this paper. Porantim is based on a body of knowledge describing model-based testing approaches and their characterization attributes (identified by secondary and primary experimental studies), and a process to guide by adequacy and impact criteria regarding the use of this sort of software technology that can be used by software engineers to select model-based testing approaches for software projects.