ppxscal/embedding_network huggingface dataset:
Two-echelon supply chain games in a fuzzy environment
Authors: Chenxi Zhou, Ruiqing Zhao, Wansheng Tang
Venue: Computers and Industrial Engineering (2008)

This paper considers a supply chain composed by a manufacturer and a retailer. It is assumed that the supply chain is operated in a fuzzy environment. The fuzziness is associated with the customer's demand and the manufacturing cost. Two different game structures of the supply chain are considered: the manufacturer and the retailer cooperate with each other and behave as an integrated-firm; the manufacturer behaving as a Stackelberg leader dominates the supply chain. Expected value models as well as chance-constrained programming models are developed to determine the pricing strategies for the retailer and the manufacturer. Finally, a numerical example is given to illustrate the effectiveness of the proposed supply chain models.
Head Pose Estimation in Single- and Multi-view Environments - Results on the CLEAR'07 Benchmarks
Authors: Michael Voit, Kai Nickel, Rainer Stiefelhagen
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

In this paper, we present our system used and evaluated on the CLEAR'07 benchmarks, both on single- and multi-view head pose estimation. The benchmarks show a high contrast in the application domain: whereas the single-view task provides meeting recordings involving high-quality captures of the participants, the multi-view benchmark targets at low-quality, unobtrusive observations of people by means of multiple cameras in an unconstrained scenario. We show that our system performs with state-of-the-art results under both conditions.
Multilingual Feature-Driven Opinion Extraction and Summarization from Customer Reviews
Authors: Alexandra Balahur, Andrés Montoyo
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

This paper presents a feature-driven opinion summarization method for customer reviews on the web based on identifying general features (characteristics) describing any product, product specific features and feature attributes (adjectives grading the characteristics). Feature attributes are assigned a polarity using on the one hand a previously annotated corpus and on the other hand by applying Support Vector Machines Sequential Minimal Optimization[1] machine learning with the Normalized Google Distance[2]. Reviews are statistically summarized around product features using the polarity of the feature attributes they are described by.
A hybrid centralized routing protocol for 802.11s WMNs
Authors: Azman Osman Lim, Xudong Wang, Youiti Kado, Bing Zhang
Venue: Mobile Networks and Applications (2008)

Wireless mesh networks (WMNs) are being widely accepted as a critical wireless access solution for various applications. Due to minimal mobility in mesh nodes, a backbone topology can be effectively maintained in WMN using a proactive routing protocol. In IEEE 802.11s standard, a tree-based routing (TBR) protocol is adopted as a viable proactive routing protocol for aWMN with user traffic flowing to/from a wired network through a root (i.e., a mesh portal). However, the performance of the TBR protocol degrades rapidly as the user traffic becomes dominated by intra-mesh traffic. The reason is that the routing path through the root even for intra-mesh traffic unnecessarily overloads the root. Furthermore, the TBR performance becomes more severe when the network size of WMN is large, which could lead to the huge amount of intra-mesh traffic towards the root. To overcome these problems, we propose a new routing mechanism, root driven routing (RDR) protocol, for the root to quickly determine the best-metric route for any source-destination pair of intra-mesh traffic. For inter-mesh traffic, the original TBR protocol is employed. Thus, the hybrid centralized routing protocol that combines TBR and RDR and is adaptive to all traffic scenarios. Our simulation results reveal that the proposed RDR protocol outperforms the TBR protocol with much lower average end-to-end delay and much higher packet delivery ratio for intra-mesh traffic. The simulation results also provide some insight into the right tradeoff between the TBR protocol and the RDR protocol to achieve the best performance of the hybrid centralized routing protocol for WMNs.
Adaptive MANET Routing: A Case Study
Authors: Liang Qin, Thomas Kunz
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

Node mobility plays an important role in the routing performance for MANETs. Many protocols provide parameters to adapt to different levels of mobility, but this is a global optimization (i.e., typically all nodes choose the same parameter values and they use these parameters throughout their participation in a MANET). We choose the monitored number of link breaks as key mobility metric and observe that the relative observable mobility varies widely for different nodes and over time for the same node. We utilize this (simple) mobility metric to allow a node using OLSR as routing protocol to dynamically adapt its behavior (changing the Hello Interval, selecting MPRs, etc.). Simulations with different mobility scenarios show that Adaptive OLSR can improve packet delivery ratio, reduce packet latency, and reduce routing overhead, especially in high mobility scenarios. As a general conclusion, we believe that designing adaptive routing protocols (protocols that change their behavior based on mobility and potentially traffic patterns) holds great promise in resource-constrained environments.
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances
Authors: Peter Merz, Jutta Huhse
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Meta-heuristics usually lack any kind of performance guarantee and therefore one cannot be certain whether the resulting solutions are (near) optimum solutions or not without relying on additional algorithms for providing lower bounds (in case of minimization).In this paper, we present a highly effective hybrid evolutionary local search algorithm based on the iterated Lin-Kernighan heuristic combined with a lower bound heuristic utilizing 1-trees. Since both upper and lower bounds are improved over time, the gap between the two bounds is minimized by means of effective heuristics. In experiments, we show that the proposed approach is capable of finding short tours with a gap of 0.8% or less for TSP instances up to 10 million cities. Hence, to the best of our knowledge, we present the first evolutionary algorithm and meta-heuristic in general that delivers provably good solutions and is highly scalable with the problem size. We show that our approach outperforms all existing heuristics for very large TSP instances.
Versioning Tree Structures by Path-Merging
Authors: Khaireel A. Mohamed, Tobias Langner, Thomas Ottmann
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent versions in contrast to only one operation in the original variant. The superiority of the method is shown both theoretically and experimentally. Details of the technique are explained for the case of binary search trees. Path-merging is particularly useful for the implementation of scan-line algorithms where many update operations on the sweep status structure have to be performed at the same event points. Examples are algorithms for planar point location, for answering intersection queries for sets of horizontal line segments, and for detecting conflicts in sets of 1-dim IP packet filters.Subject Classifications: E.1 [Data]: Data Structures --- trees; E.2 [Data]: Data Storage Representations --- linked representations; F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems --- Geometrical problems and computations.
Designing an Adaptive CORBA Load Balancing Service Using TAO
Authors: Carlos O'Ryan, Ossama Othman, Douglas C. Schmidt
Venue: IEEE Distributed Systems Online (2001)

The growth of online Internet services during the past decade has increased the demand for scalable and dependable distributed computing systems. These systems face highquality-of-service requirements (such as immediate response time and 24/7 availability) and concurrently serve many clients that transmit a large, often bursty, number of requests. E-commerce and online stock trading systems are examples.
The Combinatorics of Sequencing the Corn Genome
Authors: Srinivas Aluru
Venue: Proceedings of the 13th Annual international conference on Computing and Combinatorics (2007)

The scientific community is engaged in an ongoing, concerted effort to sequence the corn (also known as maize) genome. This genome is approximately 2.5 billion nucleotides long with an estimated 65-80team of university and private laboratory researchers under the auspices of NSF/USDA/DOE is working towards deciphering the majority of the sequence information including all genes, determining their order and orientation, and anchoring them to genetic/physical maps. In this talk, I will present some of the combinatorial problems that arise in this context and outline the role of graph, string and parallel algorithms in solving them.
A Holonic Metamodel for Agent-Oriented Analysis and Design
Authors: Massimo Cossentino, Nicolas Gaud, Stéphane Galland, Vincent Hilaire, Abderrafiâa Koukam
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

Holonic multiagent systems (hmas) offers a promising software engineering approach for developing applications in complex domains characterized by a hierarchical structure. However the process of building mass and hmass is mostly different from the process of building more traditional software systems and it introduces new design and development issues. Against this background, this paper introduces organization-oriented abstractions for agent-oriented software engineering. We propose a complete organizational meta-model as the basis of a future complete methodology that will spread from requirements analysis to code production. In addition to dealing with this last aspect, we introduce our platform, called Janus, that we specifically designed to implement and deploy holonic multiagent systems by adopting concepts like role and organization as the leading issues of the analysis-development process.
Proofs-as-Model-Transformations
Authors: Iman Poernomo
Venue: Proceedings of the 1st international conference on Theory and Practice of Model Transformations (2008)

This paper provides an overview of how to develop model transformations that are "provably correct" with respect to a given functional specification. The approach is based in a mathematical formalism called Constructive Type Theory (CTT) and a related synthesis formal method known as proofs-as-programs. We outline how CTT can be used to provide a uniform formal foundation for representing models, metamodels and model transformations as understood within the Object Management Group's Meta-Object Facility (MOF 2.0) and Model Driven Architecture (MDA) suite of standards [6, 8]. CTT was originally developed to provide a unifying foundation for logic, data and programs. It is higher-order, in the sense that it permits representation and reasoning about programs, types of programs and types of types. We argue that this higher-order aspect affords a natural formal definition of metamodel/model/model instantiation relationships within the MOF. We develop formal notions of models, metamodels and model transformation specifications by utilizing the logic that is built into CTT. In proofs-as-programs, a functional program specification is represented as a special kind of type. A program is provably correct with respect to a given specification if it can be typed by that specification. We develop an analogous approach, defining model transformation specifications as types and provably correct transformations as inhabitants of specification types.
Towards UML-Intensive Framework for Model-Driven Development
Authors: Darius Silingas, Ruslanas Vitiutinas
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

The paper describes a conceptual framework for model-driven development based on a concise application of UML and modeling tool functionality. A case study of modeling software for library management is presented as an illustration of how to apply the proposed framework. Modeling tool features such as model transformations, code generation cartridges, model validation, dependency matrix, model metrics, model comparison, and model refactoring are presented as enablers for efficient model-driven development. The presented ideas and samples are based on industrial experience of authors who work as trainers and consultants for the modeling tool MagicDraw UML.
Asymptotic rejection of finite frequency modes of general periodic disturbances in output feedback nonlinear systems
Authors: Zhengtao Ding
Venue: Automatica (Journal of IFAC) (2008)

This paper deals with asymptotic rejection of individual frequency modes in nonlinear systems under general periodic disturbances. An iterative observer design is proposed for disturbance estimation, and it is shown that the proposed observer design successfully extracts individual frequency modes from general periodic disturbances. The proposed iterative observer design is then applied to asymptotic rejection of nonlinear systems under general periodic disturbances.
Multi-robot Interacting Through Wireless Sensor Networks
Authors: Antonio Chella, Giuseppe Lo Re, Irene Macaluso, Marco Ortolani, Daniele Peri
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

This paper addresses the issue of coordinating the operations of multiple robots in an indoor environment. The framework presented here uses a composite networking architecture, in which a hybrid wireless network, composed by commonly available WiFi devices, and the more recently developed wireless sensor networks. Such architecture grants robots to enhance their perceptive capabilities and to exchange information so as to coordinate actions in order to achieve a global common goal. The proposed framework is described with reference to an experimental setup that extends a previously developed robotic tour guide application in the context of a multi-robot application.
Automatic Information Extraction in Semi-structured Official Journals
Authors: Valmir Macário Filho, Ricardo B. C. Prudêncio, Francisco A. T. de Carvalho, Leandro R. Torres, Laerte Rodrigues Júnior, Marcos G. Lima
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Information extraction systems are used to extract only relevant text information in digital repositories. The current work proposes an automatic system to extract information in semi-structured official journals. In our approach, given an input document, a Machine Learning (ML) algorithm classifies the document’s fragments into class labels which correspond to the data fields to be extracted. The implemented system deployed different features sets and algorithms used in the classification of the fragments. The system was evaluated through experiments on a sample containing 22770 lines of the Pernambuco’s Official Journal. The experiments performed revealed, in general, good results in terms of precision, which ranged from 70.14% to 98.63% depending on the feature set and algorithm used in the classification of the fragments.
Conflicting Cues from Vision and Touch Can Impair Spatial Task Performance: Speculations on the Role of Spatial Ability in Reconciling Frames of Reference
Authors: Madeleine Keehner
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

In "hand assisted" minimally invasive surgery, the surgeon inserts one hand into the operative site. Despite anecdotal claims that seeing their own hand via the laparoscopic camera enhances spatial understanding, a previous study using a maze-drawing task in indirect viewing conditions found that seeing one's own hand sometimes helped and sometimes hurt performance (Keehner et al., 2004). Here I present a new analysis exploring the mismatch between kinesthetic cues (knowing where the hand is) and visual cues (seeing the hand in an orientation that is incongruent with this). Seeing one's left hand as if from the right side of egocentric space (palm view) impaired performance, and this depended on spatial ability (r=-.54). Conversely, there was no relationship with spatial ability when viewing the left hand from the left side of egocentric space (back view). The view-specific nature of the confusion raises a possible role for spatial abilities in reconciling spatial frames of reference.
Hierarchical Set Decision Diagrams and Automatic Saturation
Authors: Alexandre Hamez, Yann Thierry-Mieg, Fabrice Kordon
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

Shared decision diagram representations of a state-space have been shown to provide efficient solutions for model-checking of large systems. However, decision diagram manipulation is tricky, as the construction procedure is liable to produce intractable intermediate structures (a.k.a peak effect). The definition of the so-called saturation method has empirically been shown to mostly avoid this peak effect, and allows verification of much larger systems. However, applying this algorithm currently requires deep knowledge of the decision diagram data-structures, of the model or formalism manipulated, and a level of interaction that is not offered by the API of public DD packages.Hierarchical Set Decision Diagrams (SDD) are decision diagrams in which arcs of the structure are labeled with sets, themselves stored as SDD. This data structure offers an elegant and very efficient way of encoding structured specifications using decision diagram technology. It also offers, through the concept of inductive homomorphisms, unprecedented freedom to the user when defining the transition relation. Finally, with very limited user input, the SDD library is able to optimize evaluation of a transition relation to produce a saturation effect at runtime. We further show that using recursive folding, SDD are able to offer solutions in logarithmic complexity with respect to other DD. We conclude with some performances on well known examples.
Why Greed Works for Shortest Common Superstring Problem
Authors: Bin Ma
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

The shortest common superstring problem (SCS) has been widely studied for its applications in string compression and DNA sequence assembly. Although it is known to be Max-SNP hard, the simple greedy algorithm works extremely well in practice. Previous researchers have proved that the greedy algorithm is asymptotically optimal on random instances. Unfortunately, the practical instances in DNA sequence assembly are very different from random instances.In this paper we explain the good performance of greedy algorithm by using the smoothed analysis. We show that, for any given instance I of SCS, the average approximation ratio of the greedy algorithm on a small random perturbation of I is 1 + o(1). The perturbation defined in the paper is small and naturally represents the mutations of the DNA sequence during evolution.Due to the existence of the uncertain nucleotides in the output of a DNA sequencing machine, we also proposed the shortest common superstring with wildcards problem (SCSW). We prove that in worst case SCSW cannot be approximated within ratio n 1/7 ¿ ¿ , while the greedy algorithm still has 1 + o(1) smoothed approximation ratio.
K-Trivial Closed Sets and Continuous Functions
Authors: George Barmpalias, Douglas Cenzer, Jeffrey B. Remmel, Rebecca Weber
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial $\Pi^0_1$ class with no computable elements. For any K-trivial degree d, there is a K-trivial continuous function of degree d.
Assessing the Effectiveness of Mobile Learning in Large Hybrid/Blended Classrooms
Authors: Minjuan Wang, Daniel Novak, Ruimin Shen
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

This article describes a method we created to evaluate the impact of mobile learning on a large hybrid/blended computer science classroom of 562 students (about 90% being online). The impact of the mLearning system and learning activities is evaluated through pre- and post-surveys and from four aspects: 1) if student enjoyed the learning experience, 2) how students feel about interacting with fellow learners, 3) how students felt about their relationship to their instructors in the mobile blended learning environment, and 4) mobile blended classroom's effects on students' study habits. Cluster analysis is used to measure the validity of the surveys we used in this evaluation study. The cluster analysis confirms the validity of the survey results and also corroborates the statistical evidence of mLearning's positive influence on learning outcomes.
Sharing but Protecting Content Against Internal Leakage for Organisations
Authors: Muntaha Alawneh, Imad M. Abbadi
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Dishonest employees, who have privileges to obtain corporate critical information and access internal resources, cause the problem of internal leakage. Employees, who have such privileges and know from where to obtain corporate sensitive information, are far more dangerous than outsiders. This paper proposes a mechanism for protecting information inside organisations against unauthorised disclosure by internal adversaries. It mainly focusses on sharing and simultaneously guarding information assets from one another. This paper proposes a novel solution for binding sensitive content to organisation devices, thereby preventing uncontrolled content leakage to other devices. In the proposed solution we used trusted computing technology to provide a hardware-based root of trust on client side.
Production of Large Computer Programs
Authors: Herbert D. Benington
Venue: IEEE Annals of the History of Computing (1983)

The paper is adapted from a presentation at a symposium on advanced programming methods for digital computers sponsored by the Navy Mathematical Computing Advisory Panel and the Office of Naval Research in June 1956. The author describes the techniques used to produce the programs for the Semi-Automatic Ground Environment (SAGE) system.
Toward Next-Generation, Intelligent Tutors: Adding Natural Handwriting Input
Authors: Lisa Anthony, Jie Yang, Kenneth R. Koedinger
Venue: IEEE MultiMedia (2008)

This article explores handwriting recognition-based interfaces in intelligent tutoring systems for students learning algebra equations.