ppxscal/embedding_network huggingface dataset:
Column Generation Algorithms for the Capacitated m-Ring-Star Problem
Authors: Edna A. Hoshino, Cid C. Souza
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

In this paper we propose an integer programming formulation for the capacitated m-ring-star problem ( ) based on a set covering model and develop an exact branch-and-price ( ) algorithm to solve it exactly. The is a variant of the classical one-depot capacitated vehicle routing problem in which a customer is either on a route or is connected to another customer or to some connection point present in a route. The set of potential connection points and the number m of vehicles are given a priori. Routing and connection costs are also known and the goal is to minimize the sum of routing and connection costs. To our knowledge, the only exact approach for the is a branch-and-cut ( ) proposed in [2]. Extensive experimentation reported here shows that our algorithm is competitive with the algorithm. This performance was achieved after a profound investigation of the alternatives for column generation relaxation and a careful implementation of the pricing algorithm.
Protein Decoy Generation Using Branch and Bound with Efficient Bounding
Authors: Martin Paluszewski, Pawel Winter
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

We propose a new discrete protein structure model (using a modified face-centered cubic lattice). A novel branch and bound algorithm for finding global minimum structures in this model is suggested. The objective energy function is very simple as it depends on the predicted half-sphere exposure numbers of C ¿ -atoms. Bounding and branching also exploit predicted secondary structures and expected radius of gyration. The algorithm is fast and is able to generate the decoy set in less than 48 hours on all proteins tested.Despite the simplicity of the model and the energy function, many of the lowest energy structures, using exact measures, are near the native structures (in terms of RMSD). As expected, when using predicted measures, the fraction of good decoys decreases, but in all cases tested, we obtained structures within 6 Å RMSD in a set of low-energy decoys. To the best of our knowledge, this is the first de novo branch and bound algorithm for protein decoy generation that only depends on such one-dimensional predictable measures. Another important advantage of the branch and bound approach is that the algorithm searches through the entire conformational space. Contrary to search heuristics, like Monte Carlo simulation or tabu search, the problem of escaping local minima is indirectly solved by the branch and bound algorithm when good lower bounds can be obtained.
Visualization Equivalence for Multisensory Perception: Learning from the Visual
Authors: Jonathan C. Roberts
Venue: Computing in Science and Engineering (2004)

In our information-rich world, computers generate so much data that it comprehending and understanding it in its raw form is difficult. Visual representations are imperative if we are to understand even a small part of it. In addition or as an alternative to visual mappings we could map information into nonvisual forms, any form that stimulates any of our senses: from auditory, haptic, olfactory, and gustatory to vestibular.
A Variable Precision Fuzzy Rough Group Decision-making Model for IT Outsourcing Risk Evaluation in Nuclear Power Industry
Authors: Guodong Cong, Jinlong Zhang, Beihai Yu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Risks evaluation is critical for the success of IT outsourcing. It is especially important in nuclear industry due to high concerns about safety and service quality. This paper proposes a new integrated methodology, Variable Precision Fuzzy Rough Group Decision-making (VPFRGDM), to evaluate the risk in IT outsourcing. This method can improve fairness, flexibility and efficiency of risk evaluation, and is verified by a case in a large-scale nuclear power station.
Real-Time Person Tracking Based on Data Field
Authors: Shuliang Wang, Juebo Wu, Feng Cheng, Hong Jin
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

In this paper, a novel approach of data field is proposed to discover the action pattern of real-time person tracking, and potential function is presented to find out the power of a person with suspicious action. Firstly, a data field on the first feature is used to find the individual attributes, associated with the velocity, direction changing frequency and appearance frequency respectively. Secondly, the common characteristic of each attribute is obtained by the data field on the main feature from the data field created before. Thirdly, the weighted Euclidean distance classifier is used to identify whether a person is a suspect or not. Finally, the results of the experiment show that the proposed way is feasible and effective in action mining.
Distance Learning Course for Training Teachers' ICT Competence
Authors: Valentina Dagienė, Lina Zajančkauskienė, Inga Žilinskienė
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

Nowadays teachers are required to meet social, pedagogical and objective requirements related to the information and communication technology (ICT). This is the main reason to pay more attention to teachers' training by means of ICT and render opportunities for them to get access to topical information, to learn while working. Distance education is one of the learner-friendly ways to give them the necessary knowledge and to develop ICT skills. The paper deals with a distance learning course designed for teachers who are working at secondary schools in Lithuania. The course is developed to improve teachers' computer literacy and educational skills of ICT application. The main requirements to regulating teachers' ICT literacy competence, the results of researches on ICT in education, the basic requirements and principles for creating distance education courses are also discussed. Finally, the structure of the distance education course is presented.
Reducing the Computational Cost of Certification Path Validation in Mobile Payment
Authors: Cristina Satizábal, Rafael Martínez-Peláez, Jordi Forné, Francisco Rico-Novella
Venue: Proceedings of the 4th European PKI workshop: Theory and Practice on Public Key Infrastructure: Theory and Practice (2007)

PKI can improve security of mobile payments but its complexity has made difficult its use in such environment. Certificate path validation is complex in PKI. This demands some storage and processing capacities to the verifier that can exceed the capabilities of mobile devices. In this paper, we propose TRUTHC to reduce computational cost of mobile payment authentication. TRUTHC replaces verification operations with hash operations. Results show a better reduction of the cost with ECDSA than with RSA.
The doctoral forum at the second IIiX symposium
Authors: Erica Cosijn, Ross Wilkinson
Venue: Proceedings of the second international symposium on Information interaction in context (2008)

This paper gives a description of the Doctoral Forum held at the second symposium on Information Interaction in Context (IIiX) and provides brief descriptions of the presented student projects. Six senior researchers gave feedback to a total of 14 doctoral students.
Using WordNet to Disambiguate Word Senses for Text Classification
Authors: Ying Liu, Peter Scheuermann, Xingsen Li, Xingquan Zhu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In this paper, we propose an automatic text classification method based on word sense disambiguation. We use "hood" algorithm to remove the word ambiguity so that each word is replaced by its sense in the context. The nearest ancestors of the senses of all the non-stopwords in a give document are selected as the classes for the given document. We apply our algorithm to Brown Corpus. The effectiveness is evaluated by comparing the classification results with the classification results using manual disambiguation offered by Princeton University.
Distributed Qualitative Localization for Wireless Sensor Networks
Authors: Karel Heurtefeux, Fabrice Valois
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

The use of localization mechanism is essential in wireless sensor networks either for communication protocols (geographic routing protocol) or for application (vehicle tracking). The goal of localization mechanism is to determine either precisely or coarsely the node location using either a global reference (GPS) or a locale one. In this work, we introduce a new localized algorithm which classified the proximity of the neighborhood for a node. This qualitative localization does not use any anchor or dedicated hardware like a GPS. Each node builds a Qualitative Distance Table according to the 2-hop neighborhood informations. Thus, the algorithm allows to determine coarsely the location of the neighbors which are classified as very close, close or far. The algorithm is analyzed on a regular particular topology and then we evaluate this accuracy on a random topologies. We apply this algorithm for a localized topology control and we show that these topology control algorithms remain effective even without GPS information.
A comprehensive objective network security metric framework for proactive security configuration
Authors: Ehab Al-Shaer, Latifur Khan, Mohammad Salim Ahmed
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

In order to create secure and dependable systems and information intelligence, it is a major challenge to determine the security level of the network. This security level depends on a number of dynamically changing factors including emerging of new vulnerabilities and threats, policy updates and network traffic. An effective means to address this is to identify security metrics that measure the quality of security configuration objectively and dynamically. In this extended abstract, we propose a comprehensive security metric framework called Risk based prOactive seCurity cOnfiguration maNAger (ROCONA) that identifies and quantifies objectively the most significant security risk factors, which include existing and future vulnerabilities based on historical trends, security configuration immunity to attack occurrence and propagation, and traffic trends that reflect the insider and outsider user behavior.
A Graph Clustering Algorithm Based on Minimum and Normalized Cut
Authors: Jiabing Wang, Hong Peng, Jingsong Hu, Chuangxin Yang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Clustering is the unsupervised classification of patterns into groups. In this paper, a clustering algorithm for weighted similarity graph is proposed based on minimum and normalized cut. The minimum cut is used as the stopping condition of the recursive algorithm, and the normalized cut is used to partition a graph into two subgraphs. The algorithm has the advantage of many existing algorithms: nonparametric clustering method, low polynomial complexity, and the provable properties. The algorithm is applied to image segmentation; the provable properties together with experimental results demonstrate that the algorithm performs well.
Positional Strategies for Higher-Order Pushdown Parity Games
Authors: Arnaud Carayol, Michaela Slaats
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Higher-order pushdown systems generalize pushdown systems by using higher-order stacks, which are nested stacks of stacks. In this article, we consider parity games defined by higher-order pushdown systems and provide a k-Exptime algorithm to compute finite representations of positional winning strategies for both players for games defined by level-k higher-order pushdown automata. Our result is based on automata theoretic techniques exploiting the tree structure corresponding to higher-order stacks and their associated operations.
Programming Reconfigurable Decoupled Application Control Accelerator for Mobile Systems
Authors: Samar Yazdani, Joël Cambonie, Bernard Pottier
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

This paper presents an innovative multimedia reconfigurable accelerator for mobile systems associated to a programming model and a compiler flow. The architecture implements a flexible memory subsystem based on software controlled scratchpad shared memory banks. The main concern of the paper is shared memory management as it is a dominant factor in current designs and influences the performance of embedded systems as well as their energy consumption. An embedded shared-memory programming model is presented that abstracts the details of the hardware architecture but yet exposing parallelism to the user. It is open and user friendly while the hardware can execute complex data feeding on heavily pipelined datapath for compute intensive kernels. The architecture has been designed, and synthesized for 65nm technology for an operating frequency of 200MHz.
Covering Directed Graphs by In-Trees
Authors: Naoyuki Kamiyama, Naoki Katoh
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Given a directed graph D = (V,A) with a set of d specified vertices S = {s 1,...,s d } ¿ V and a function $f\colon S \to \mathbb{Z}_+$ where ¿ + denotes the set of non-negative integers, we consider the problem which asks whether there exist $\sum_{i=1}^d f(s_i)$ in-trees denoted by $T_{i,1},T_{i,2},\ldots, T_{i,f(s_i)}$ for every i = 1,...,d such that $T_{i,1},\ldots,T_{i,f(s_i)}$ are rooted at s i , each T i,j spans vertices from which s i is reachable and the union of all arc sets of T i,j for i = 1,...,d and j = 1,...,f(s i ) covers A. In this paper, we prove that such set of in-trees covering A can be found by using an algorithm for the weighted matroid intersection problem in time bounded by a polynomial in $\sum_{i=1}^df(s_i)$ and the size of D. Furthermore, for the case where D is acyclic, we present another characterization of the existence of in-trees covering A, and then we prove that in-trees covering A can be computed more efficiently than the general case by finding maximum matchings in a series of bipartite graphs.
A New Architecture for Learning Classifier Systems to Solve POMDP Problems
Authors: Ali Hamzeh, Adel Rahmani
Venue: Fundamenta Informaticae (2008)

Reinforcement Learning is a learning paradigm that helps the agent to learn to act optimally in an unknown environment through trial and error. An RL-based agent senses its environmental state, proposes an action, and applies it to the environment. Then a reinforcement signal, called the reward, is sent back from the environment to the agent. The agent is expected to learn how to maximize overall environmental reward through its internal mechanisms. One of the most challenging issues in the RL area arises as a result of the sensory ability of the agent, when it is not able to sense its current environmental state completely. These environments are called partially observable environments. In these environments, the agent may fail to distinguish the actual environmental state and so may fail to propose the optimal action in particular environmental states. So an extended mechanism must be added to the architecture of the agent to enable it to perform optimally in these environments. On the other hand, one of the most-used approaches to reinforcement learning is the evolutionary learning approach and one of the most-used techniques in this family is learning classifier systems. Learning classifier systems try to evolve state-action-reward mappings to model their current environment through trial and error. In this paper we propose a new architecture for learning classifier systems that is able to perform optimally in partially observable environments. This new architecture uses a novel method to detect aliased states in the environment and disambiguates them through multiple instances of classifier systems that interact with the environment in parallel. This model is applied to some well-known benchmark problems and is compared with some of the best classifier systems proposed for these environments. Our results and detailed discussion show that our approach is one of the best techniques among other learning classifier systems in partially observable environments.
GROP: New Algorithm of Optimal Path for GIS-Based Logistics
Authors: Peiguang Lin, Ruzhi Xu, Peiyao Nie, Dongsheng Chu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The path planning problem has become the most important part in the field of the logistics to cut down the cost of the distribution. But for some special instance, for example, time and traffic jam, purely GIS can’t give a direct resolvent. Aiming at this problem, a new method, GROP, GIS and rules-based Optimal Path for logistics, was presented in this paper. Firstly, we institute rules for all special instances according to the actual situation and set weight to the rules. Secondly, we put GIS technology into the logistics system to help it solve the problem of path, and construct a network structure with weight. Experiments show that the algorithm is right, feasible and practical
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
Authors: Edmund M. Clarke, E. Allen Emerson
Venue: 25 Years of Model Checking: History, Achievements, Perspectives (2008)

We Propose a method of constructing concurrent programs in which the synchronization skeleton of the program is automatically synthesized from a high-level (branching time) Temporal Logic specification. The synchronization skeleton is an abstraction of the actual program where detail irrelevant to synchronization is suppressed. For example, in the synchronization skeleton for a solution to the critical section problem each process's critical section may be viewed as a single node since the internal structure of the critical section is unimportant. Most solutions to synchronization problems in the literature are in fact given as synchronization skeletons. Because synchronization skeletons are in general finite state, the propositional version of Temporal Logic can be used to specify their properties.
From the Editors: Privacy Is the Issue
Authors: George Cybenko
Venue: IEEE Security and Privacy (2003)

Two hundred years ago, people could keep few, if any, secrets in their communities but were essentially anonymous a few towns away. Today, we scarcely know our neighbors, let alone their private affairs, but marketers halfway around the world can pull up credit reports and lifestyle preferences with a few keystrokes.
A low-overhead DVR based multicast routing protocol for clustered MANET
Authors: B. Gupta, S. Rahimi, R. Jandhyala, V. Doraiswamy
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Recently an efficient clustering protocol has been reported [1] for mobile ad-hoc networks (MANET). The proposed clustered network has been shown to be more stable than the clustered networks as reported in [3,4]. In this paper, we have proposed a distance vector based multicast routing protocol for MANETs that are clustered following the idea of [1]. The proposed scheme needs much less amount of information exchange compared to the distance vector routing scheme designed for unclustered network. Because of significant reduction in distance vector routing table size and its adaptable nature to the changing ad-hoc network topology caused by node mobility this proposed multicasting routing protocol has been shown to offer efficient utilization of both limited memory and bandwidth for MANET. Besides, we have also shown how our clustered network can offer efficient resource utilization when CBT routing strategy is used.
Active control techniques for piezo smart composite wing
Authors: Ioan Ursu, Eliza Munteanu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The objective of the present work is the investigating of the capabilities of piezoelectric actuators as active vibration control devices for wing structures. The first step of the study is that of providing the basic order two structural equation of the system by an ANSYS FEM structural modeling, as it was proceeded in recent works of the authors. The enhancing of the wing dynamic behavior is then based on the LQR, LQG/LQG and sliding mode control synthesis. Numerical simulations are presented, thus pointing out the efficacy of the piezo actuators in the developing of smart structures. On the side, a comparison of considered active control techniques from viewpoint of modes vibration attenuation is performed.
Testing Interval Trees for Real-Time Scheduling Systems
Authors: Xinfa Hu, Joseph Y. -T. Leung
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

In real-time systems, the efficiency of scheduling modules (SM) is of critical importance. While efficient algorithms result in efficient SMs, this will not occur without appropriate implementations of the algorithms. Moreover, an algorithm with good implementation could further improve the efficiency of the SM. Therefore, creative implementations of algorithms are well worthy of exploring. In this paper, we propose novel data structures (i.e., testing interval trees (TIT)) to help build efficient algorithms for schedulability test and admission control in some real-time SMs. With the testing interval tree for vacancy analysis (TIT-V), the complexities of the schedulability tests in a class of parallel/distributed real-time systems can be effectively reduced from O(m2nlogn) to O(mlogn+mlogm) (where m is the number of processors, and n is the number of tasks). Similarly, with the testing interval tree for release time and laxity analysis (TIT-RL), the complexity of the online admission control in a uni-processor based real-time system can be reduced from O(n2) to O(nlogn) (where n is the number of tasks). Furthermore, the TIT-RL tree can also be applied to a class of parallel/distributed real-time systems. Therefore, the TIT trees are effective approaches to building efficient real-time SMs.
GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs
Authors: Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

We demonstrate two game theory-based programs for heads-up limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in which all bets are a fixed amount. The second player, Tartanian, is designed for the no-limit variant of the game, in which the amount bet can be any amount up to the number of chips the player has. Both GS3 and Tartanian are based on our potential-aware automated abstraction algorithm for identifying strategically similar situations in order to decrease the size of the game tree. Tartanian, in order to deal with the virtually infinite strategy space of no-limit poker, in addition uses a discretized betting model designed to capture the most important strategic choices in the game. The strategies for both players are computed using our improved version of Nesterov's excessive gap technique specialized for poker. In this demonstration, participants will be invited to play against both of the players, and to experience first-hand the sophisticated strategies employed by our players.