ppxscal/embedding_network huggingface dataset:
Model Restarts for Structural Symmetry Breaking
Authors: Daniel Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

There exist various methods to break symmetries. The two that concern us in this paper are static symmetry breaking where we add static constraints to the problem (see e.g. [1,3]) and symmetry breaking by dominance detection (SBDD) where we filter values based on a symmetric dominance analysis when comparing the current searchnode with those that were previously expanded [2,5]. The core task of SBDD is dominance detection. The first provably polynomial-time dominance checkers for value symmetry were devised in [18] and [14]. For problems exhibiting both "piecewise" symmetric values and variables, [15] devised structural symmetry breaking (SSB). SSB is a polynomial-time dominance checker for piecewise symmetries which, used within SBDD, eliminates symmetric subproblems from the search-tree. Piecewise symmetries are of particular interest as they result naturally from symmetry detection based on a static analysis of a given CSP that exploits the knowledge about problem substructures as captured in global constraints [17]. Static SSB was developed in [4] and is based on the structural abstractions that were introduced in [17].
Ontology-centric integration and navigation of the dengue literature
Authors: Menaka Rajapakse, Rajaraman Kanagasabai, Wee Tiong Ang, Anitha Veeramani, Mark J. Schreiber, Christopher J. O. Baker
Venue: Journal of Biomedical Informatics (2008)

Uninhibited access to the unstructured information distributed across the web and in scientific literature databases continues to be beyond the reach of scientists and health professionals. To address this challenge we have developed a literature driven, ontology-centric navigation infrastructure consisting of a content acquisition engine, a domain-specific ontology (in OWL-DL) and an ontology instantiation pipeline delivering sentences derived by domain-specific text mining. A visual query tool for reasoning over A-box instances in the populated ontology is presented and used to build conceptual queries that can be issued to the knowledgebase. We have deployed this generic infrastructure to facilitate data integration and knowledge sharing in the domain of dengue, which is one of the most prevalent viral diseases that continue to infect millions of people in the tropical and subtropical regions annually. Using our unique methodology we illustrate simplified search and discovery on dengue information derived from distributed resources and aggregated according to dengue ontology. Furthermore we apply data mining to the instantiated ontology to elucidate trends in the mentions of dengue serotypes in scientific abstracts since 1974.
IP Multicast Traffic Measurement Method with IPFIX/PSAMP
Authors: Atsushi Kobayashi, Yutaka Hirokawa, Haruhiko Nishida
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

This paper presents a method of measuring traffic of IP multicast streaming, such as IPTV, by using IPFIX/PSAMP. An IP multicast streaming service has recently become one of the popular network services. Yet, the method of IP multicast operation has not been established. In particular, traffic measurement of IP multicast streaming encounters two big challenges, such as monitoring a multicast path tree and QoS performance. There is no method to monitor them continuously in large-scale networks. Hence, we focus on the IPFIX/PSAMP applied in the standardization as a successor of NetFlow/sFlow, and explore the new measurement method and system architecture suitable for larger-scale networks. In addition, we demonstrate experimental results of a prototype measurement system.
Enhanced Cooperative Co-evolution Genetic Algorithm for Rule-Based Pattern Classification
Authors: Fangming Zhu, Sheng-Uei Guan
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Genetic algorithms (GAs) have been widely used as soft computing techniques in various application domains, while cooperative co-evolution algorithms were proposed in the literature to improve the performance of basic GAs. In this paper, an enhanced cooperative co-evolution genetic algorithm (ECCGA) is proposed for rule-based pattern classification. Concurrent local and global evolution and conclusive global evolution are proposed to improve further the classification performance. Different approaches of ECCGA are evaluated on benchmark classification data sets, and the results show that ECCGA can achieve better performance than the cooperative co-evolution genetic algorithm and normal GA.
Leveraging Linial's Locality Limit
Authors: Christoph Lenzen, Roger Wattenhofer
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

In this paper we extend the lower bound technique by Linial for local coloring and maximal independent sets. We show that constant approximations to maximum independent sets on a ring require at least log-star time. More generally, the product of approximation quality and running time cannot be less than log-star. Using a generalized ring topology, we gain identical lower bounds for approximations to minimum dominating sets. Since our generalized ring topology is contained in a number of geometric graphs such as the unit disk graph, our bounds directly apply as lower bounds for quite a few algorithmic problems in wireless networking.Having in mind these and other results about local approximations of maximum independent sets and minimum dominating sets, one might think that the former are always at least as difficult to obtain as the latter. Conversely, we show that graphs exist, where a maximum independent set can be determined without any communication, while finding even an approximation to a minimum dominating set is as hard as in general graphs.
An Infrared Background Clutter Model Using 3-D Computer Graphics
Authors: G. R. Loefer, D. E. Schmieder, W. M. Finlay, M. R. Weathersby
Venue: IEEE Computer Graphics and Applications (1983)

Computer graphics modeling techniques are providing a new tool for evaluating and improving the performance of military target acquisition and guidance systems.
Xerte --- A User-Friendly Tool for Creating Accessible Learning Objects
Authors: Simon Ball, Julian Tenney
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In order to meet our obligations to provide an accessible learning experience for all students, including those with impairments, it may sometimes be appropriate to create accessible learning objects. This can be readily achieved with Xerte, a freely available tool developed by the University of Nottingham, designed to prompt creators of learning objects about issues such as alternative text, and creating learning objects that are keyboard navigable and with a font/background colour/size change facility. The JISC TechDis template for Xerte brings some of the key aspects of Xerte to a non-technical user interface to enable any teacher or tutor to easily create Accessible Learning Objects.
Newton's Pen: A pen-based tutoring system for statics
Authors: WeeSan Lee, Ruwanee de Silva, Eric J. Peterson, Robert C. Calfee, Thomas F. Stahovich
Venue: Computers and Graphics (2008)

We present Newton's Pen, a statics tutor implemented on a ''pentop computer,'' a writing instrument with an integrated digitizer and embedded processor. The tutor, intended for undergraduate education, scaffolds students in the construction of free body diagrams and equilibrium equations. This project entailed the development of sketch understanding techniques and user interface principles for creating pedagogically sound instructional tools for pentop computers. Development on the pentop platform presented novel challenges because of limited computational resources and a visually static, ink-on-paper display (the only dynamic output device is an audio speaker). We show that a system architecture based on a finite state machine serves as a convenient means for providing context-sensitive tutorial help. We also demonstrate the effectiveness of an instructional model based on a structured solution process with feedback provided at each problem-solving step. This model is designed to match the pentop's unusual user interface capabilities. Our three user studies suggest that Newton's Pen is an effective teaching tool.
Robustness analysis of holonic assembly/disassembly processes with Petri nets
Authors: Fu-Shiung Hsieh
Venue: Automatica (Journal of IFAC) (2008)

Although the concept of holonic manufacturing systems (HMS) has been proposed for over a decade, several desired properties of HMS such as fault tolerance have not been quantitatively characterized and rigorously proven. This paper aims to provide a theoretical foundation for analyzing the fault tolerant properties of holonic assembly/disassembly processes in HMS. Fault tolerant analysis is concerned with the impact of resource failures on the operation and performance of HMS. The goal of fault tolerant analysis is to study the ability to retain the operation of holonic processes in the presence of resource failures. To study fault tolerant properties, we propose a collaborative Petri net (CPN) to model holonic assembly/disassembly processes and formulate an optimization problem to minimize the cost of CPN. We propose a greedy algorithm to find a nominal optimal solution. Based on the nominal solution, we analyze the effects of resource failures on the operation and performance of the holonic assembly/disassembly processes. Computational complexities are also analyzed.
Brief paper: A framework and automotive application of collision avoidance decision making
Authors: Jonas Jansson, Fredrik Gustafsson
Venue: Automatica (Journal of IFAC) (2008)

Collision avoidance (CA) systems are applicable for most transportation systems ranging from autonomous robots and vehicles to aircraft, cars and ships. A probabilistic framework is presented for designing and analyzing existing CA algorithms proposed in literature, enabling on-line computation of the risk for faulty intervention and consequence of different actions. The approach is based on Monte Carlo techniques, where sampling-resampling methods are used to convert sensor readings with stochastic errors to a Bayesian risk. The concepts are evaluated using a real-time implementation of an automotive collision mitigation system, and results from one demonstrator vehicle are presented.
Voice/Non-Voice Classification Using Reliable Fundamental Frequency Estimator for Voice Activated Powered Wheelchair Control
Authors: Soo-Young Suk, Hyun-Yeol Chung, Hiroaki Kojima
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we introduce a non-voice rejection method to perform Voice/Non-Voice (V/NV) classification using a fundamental frequency (F0) estimator called YIN. Although current speech recognition technology has achieved high performance, it is insufficient for some applications where high reliability is required, such as voice control of powered wheelchairs for disabled persons. The V/NV classification algorithm, which rejects non-voice input in Voice Activity Detection (VAD), is helpful for realizing a highly reliable system. The proposed V/NV classification adopts the ratio of a reliable F 0 contour to the whole input interval. To evaluate the performance of our proposed method, we used 1567 voice commands and 447 noises in powered wheelchair control in a real environment. These results indicate that the recall rate is 97% when the lowest threshold is selected for noise classification with 99% precision in VAD.
Complexity of Aperiodicity for Topological Properties of Regular ω-Languages
Authors: Victor L. Selivanov, Klaus W. Wagner
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We study the complexity of aperiodicity restricted to topological properties of regular &omega;-languages (i.e. properties closed under the Wadge equivalence on the Cantor space of &omega;-words) restricted to aperiodic sets. In particular, we show the completeness of such problems for several usual deterministic and non-deterministic automata representations of regular &omega;-languages.
Comparison of Two Methods to Develop Breast Models for Simulation of Breast Tomosynthesis and CT
Authors: J. Michael O'Connor, Mini Das, Clay Didier, Mufeed Mah'D, Stephen J. Glick
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Dedicated x-ray computed tomography (CT) of the breast using a cone-beam flat-panel detector system is a modality under investigation by a number of research teams. Several teams, including ours, have fabricated prototype, bench-top flat-panel CT breast imaging (CTBI) systems. We also use computer simulation software to optimize system parameters. We are developing a methodology to use high resolution, low noise CT reconstructions of fresh mastectomy specimens in order to generate an ensemble of 3D digital breast phantoms that realistically model 3D compressed and uncompressed breast anatomy. The resulting breast models can then be used to simulate realistic projection data for both Breast Tomosynthesis (BT) and Breast CT (BCT) systems thereby providing a powerful evaluation and optimization mechanism for research and development of novel breast imaging systems as well as the optimization of imaging techniques for such systems. Having the capability of using breast object models and simulation software is clinically significant because prior to a clinical trial of any prototype breast imaging system many parameter tradeoffs can be investigated in a simulation environment. This capability is worthwhile not only for the obvious benefit of improving patient safety during initial clinical trials but also because simulation prior to prototype implementation should result in reduced cost and increased speed of development. The main goal of this study is to compare results obtained using two different methods to develop breast object models in order to select the better technique for developing the entire ensemble.
Investigating Human Tutor Responses to Student Uncertainty for Adaptive System Development
Authors: Kate Forbes-Riley, Diane Litman
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

We use a ¿ 2 analysis on our spoken dialogue tutoring corpus to investigate dependencies between uncertain student answers and 9 dialogue acts the human tutor uses in his response to these answers. Our results show significant dependencies between the tutor's use of some dialogue acts and the uncertainty expressed in the prior student answer, even after factoring out the answer's (in)correctness. Identification and analysis of these dependencies is part of our empirical approach to developing an adaptive version of our spoken dialogue tutoring system that responds to student affective states as well as to student correctness.
Characterization of Non-reachable States in Irreversible CA State Space
Authors: Sukanta Das, Biplab K. Sikdar
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

This paper targets characterization of the non-reachable states of 1-dimensional irreversible cellular automata (CA). A theoretical framework has been developed to design algorithms for computing the number of non-reachable states as well as the number of single cycle attractors of such a CA.
Near Optimal Dimensionality Reductions That Preserve Volumes
Authors: Avner Magen, Anastasios Zouzias
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

Let P be a set of n points in Euclidean space and let 0 < ¿< 1. A well-known result of Johnson and Lindenstrauss states that there is a projection of P onto a subspace of dimension $\mathcal{O}(\epsilon^{-2} \log n)$ such that distances change by at most a factor of 1 + ¿. We consider an extension of this result. Our goal is to find an analogous dimension reduction where not only pairs but all subsets of at most k points maintain their volume approximately. More precisely, we require that sets of size s ≤ k preserve their volumes within a factor of (1 + ¿) s ¿ 1. We show that this can be achieved using $\mathcal{O}(\max\{\frac{k}{\epsilon},\epsilon^{-2}\log n\})$ dimensions. This in particular means that for $k = \mathcal{O}(\log n/\epsilon)$ we require no more dimensions (asymptotically) than the special case k = 2, handled by Johnson and Lindenstrauss. Our work improves on a result of Magen (that required as many as $\mathcal{O}(k\epsilon^{-2}\log n)$ dimensions) and is tight up to a factor of $\mathcal{O}(1/\epsilon)$. Another outcome of our work is an alternative and greatly simplified proof of the result of Magen showing that all distances between points and affine subspaces spanned by a small number of points are approximately preserved when projecting onto $\mathcal{O}(k\epsilon^{-2}\log n)$ dimensions.
Analyzing the Benefits of Mobile Enterprise Solutions Using the Example of Dispatching Processes
Authors: Timo Botzenhardt, Key Pousttchi
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

The major benefit of mobile technology for enterprises is the potential to integrate their field service in the electronic value chain. The most prominent example are dispatching processes of mobile workers where mobile-integrated business processes support the mo-bile workforce as well as the stationary dispatchers, resulting in significant efficiency gains. In this contribution we identify the benefits arising from mobile solutions at the example of dispatching processes. In our exploratory study we examine three indepth case studies and derive a set of hypotheses on the cause-effect relationship of these mobile enterprise solutions. The outcome of the paper is a framework which unites the hypotheses and provides a basis for understanding the organizational impacts of mobile technologies.
MDA: Revenge of the Modelers or UML Utopia?
Authors: Dave Thomas
Venue: IEEE Software (2004)

This column takes a critical look at the ambitious OMG Model Driven Architecture. Although model-driven agile development is an effective software development practice, we should neither naively accept nor cavalierly reject MDA without the broader software community first appropriately examining and evaluating it.
Requirements vs. Software Design: An Explanation Based on the Distinction between Concepts and Their Representations
Authors: Hermann Kaindl, Davor Svetinovic
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

Still, requirements and software design are often confused with one another. We provide a new (partial) explanation for this phenomenon, based on the insight that representations of concepts related to requirements and software design, respectively, may sometimes look very similar. This does not mean, however, that the requirements and design concepts are the same. So, we should distinguish requirements from their representations and, analogously, software design from its representation. Then it is easier to clearly distinguish requirements and software design as well.
A Message Scheduling Scheme in Hybrid Telematics Networks
Authors: Junghoon Lee, Gyung-Leen Park, Min-Jae Kang
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This paper proposes a message scheduling scheme for periodic sensor streams in hybrid telematics network system consist of infrastructure and ad-hoc network. To meet the fairness requirement of traffic information system, the proposed scheme classifies each message into 3 groups, and picks the message according to the previous transmission ratio and future behavior estimation, compensating the degraded stream. The performance of proposed scheme is evaluated via simulation using a discrete event scheduler based on the real movement data obtained from a telematics service system currently in operation, and the result demonstrates that the fairness of the message collection is improved by up to 3.8 % for the given parameters in vehicular network without sacrificing much timeliness.
Body-Part Templates for Recovery of 2D Human Poses under Occlusion
Authors: Ronald Poppe, Mannes Poel
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

Detection of humans and estimation of their 2D poses from a single image are challenging tasks. This is especially true when part of the observation is occluded. However, given a limited class of movements, poses can be recovered given the visible body-parts. To this end, we propose a novel template representation where the body is divided into five body-parts. Given a match, we not only estimate the joints in the body-part, but all joints in the body. Quantitative evaluation on a HumanEva walking sequence shows mean 2D errors of approximately 27.5 pixels. For simulated occlusion of the head and arms, similar results are obtained while occlusion of the legs increases this error by 6 pixels.
Query Recommendation Using Large-Scale Web Access Logs and Web Page Archive
Authors: Lin Li, Shingo Otsuka, Masaru Kitsuregawa
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Query recommendation suggests related queries for search engine users when they are not satisfied with the results of an initial input query, thus assisting users in improving search quality. Conventional approaches to query recommendation have been focused on expanding a query by terms extracted from various information sources such as a thesaurus like WordNet, the top ranked documents and so on. In this paper, we argue that past queries stored in query logs can be a source of additional evidence to help future users. We present a query recommendation system based on large-scale Web access logs and Web page archive, and evaluate three query recommendation strategies based on different feature spaces (i.e., noun, URL, and Web community). The experimental results show that query logs are an effective source for query recommendation, and the Web community-based and noun-based strategies can extract more related search queries than the URL-based one.
Cheating on the CW and RTS/CTS Mechanisms in Single-Hop IEEE 802.11e Networks
Authors: Szymon Szott, Marek Natkaniec, Andrzej R. Pach
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

This paper presents a work in progress which deals with the problem of node misbehaviour in ad-hoc networks. A realistic approach is used to determine the impact of contention window manipulation and RTS/CTS cheating. It is explained why IEEE 802.11e ad-hoc networks are more prone to misbehaviour. The paper presents simulation results related to the mentioned types of misbehaviour. The analysis is performed for several distinct scenarios, which yields novel results. It is shown under which conditions a misbehaving node can gain a significant advantage over well-behaving nodes. The limitations of the IEEE 802.11e standard in providing QoS in the presence of misbehaving nodes is also presented.