ppxscal/embedding_network huggingface dataset:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
Authors: Emilie Charlier, Michel Rigo
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over {0,1} without two consecutive 1. Given a set X of integers such that the language of their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not X is a finite union of arithmetic progressions. We obtain a decision procedure under some hypothesis about the considered numeration system. In a second part, we obtain an analogous decision result for a particular class of abstract numeration systems built on an infinite regular language.
Who regulates and manages the Internet infrastructure? Democratic and legal risks in shadow global governance
Authors: Miriam Lips, Bert-Jaap Koops
Venue: Information Polity (2005)

This essay explores the democratic and legal risks related to the emerging situation of global Internet governance. This situation can be considered as an outcome of the 1997 US Federal Government's policy aims towards privatisation and self-regulation of the technical management of the increasingly global Internet at that time. Thus far there is little empirical knowledge available about the nature and functioning of the various relatively unknown international organisations that are involved in the technical development and management of the Internet. Attention in this respect seems to be exclusively focused on only one of these organisations, the Internet Corporation for Assigned Names and Numbers (ICANN), which continues to have a unique relationship with the US Federal Government's Department of Commerce. The empirical question of who actually regulates and manages the Internet infrastructure further rises in importance if we consider that the technical development of the Internet might not be a 'neutral' development but could involve the building in of regulatory norms into the technology.
Watch, Listen & Learn: Co-training on Captioned Images and Videos
Authors: Sonal Gupta, Joohyun Kim, Kristen Grauman, Raymond Mooney
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Recognizing visual scenes and activities is challenging: often visual cues alone are ambiguous, and it is expensive to obtain manually labeled examples from which to learn. To cope with these constraints, we propose to leverage the text that often accompanies visual data to learn robust models of scenes and actions from partially labeled collections. Our approach uses co-training, a semi-supervised learning method that accommodates multi-modal views of data. To classify images, our method learns from captioned images of natural scenes; and to recognize human actions, it learns from videos of athletic events with commentary. We show that by exploiting both multi-modal representations and unlabeled data our approach learns more accurate image and video classifiers than standard baseline algorithms.
Extension of Moment Features' Invariance to Blur
Authors: Jiří Boldyš, Jan Flusser
Venue: Journal of Mathematical Imaging and Vision (2008)

Moment invariants are features calculated on an image, which do not change their values after a transformation of the image. This paper focuses on the so called combined invariants, which obey additional requirement of invariance to image blurring. Our first contribution is a review of achievements most relevant to the derivation of algebraic, moment and combined invariants. The review explains and develops parallels between the moment and the blur invariants. Gradually, it reveals new properties, simplifying construction of the combined invariants, but having more general extent. Resulting substitution rules for easy construction of the combined invariants from other invariants are thus the main results of this paper. All the conclusions can be understood without knowledge of the tensor calculus. This paper addresses construction of the combined invariants in arbitrary dimension.
Towards Automation of Testing High-Level Security Properties
Authors: Aiman Hanna, Hai Zhou Ling, Jason Furlong, Mourad Debbabi
Venue: Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security (2008)

Many security problems only become apparent after software is deployed, and in many cases a failure has occurred prior to the awareness of the problem. Although many would argue that the simpler solution to the problem would be to test the software before deploying it. Although we support this argument, we understand that it is not necessarily applicable in a modern development environment. Software testing is labor intensive and is very expensive from a time and cost perspective. While much research has been undertake to automate software testing, very little has been directed at security testing. Additionally, the majority of these efforts have targeted low-level security (safety) instead of high-level security. In this paper, we present elements of a solution towards automation of testing security properties and for the generation of test data suites for detecting security vulnerabilities in software.
Letters: Data classification using hybrid GrayART network
Authors: Ming-Feng Yeh, Cheng Wen, Shao-Shan Chiang
Venue: Neurocomputing (2008)

A hybrid GrayART network consisting of an unsupervised clustering stage and a supervised adjusting stage is proposed in this paper. In this hybrid learning scheme, the unsupervised clustering stage estimates cluster centers of a given dataset, and the supervised adjusting stage follows to tune the cluster centers for improving the training result. With a proper vigilance threshold value, the overall learning process needs only two epochs, one for each stage. The hybrid network is applied to solve the Iris dataset for illustration. Simulation results demonstrate the classification ability and effectiveness of the proposed network.
A Simple and Compact Algorithm for the RMQ and Its Application to the Longest Common Repeat Problem
Authors: Inbok Lee, Ha Yoon Song
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The Range Minimum Query (RMQ) problem is to find the smallest element in an array for given range (a, b). We propose a simple and compact algorithm for this problem when the queries are sorted in ascending order. Then we show how to use this algorithm for the generalised longest common repeat problem [14]. Our algorithm is easy to understand and implement and requires much smaller memory.
A New Method for Accelerometer Dynamic Compensation Based on CMAC
Authors: Mingli Ding, Qingdong Zhou, Kai Song
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

To acquire a satisfied accelerometer dynamic compensation effect, the accelerometer model should be with high precision using the traditional method of zero-pole assignment (ZPS). But in the accelerometer output, the noises, the drift error and the disturbances of the system which make the low precision of the built accelerometer model, can not be avoidable. In this paper, an accelerometer dynamic compensation method based on CMAC neural network is proposed. In this method, a dynamic compensation model can be set up according to the measurement data of dynamic response of the accelerometer without knowing its dynamic model. The dynamic compensation model parameters are trained by CMAC neural network. To a kind of micro-silicon piezoresistance accelerometer, the simulation results show that the proposed new dynamic compensation method has the advantages of fast training process, high precision and easy realization of the dynamic compensation device.
Stabilizing and Destabilizing Effects of Embedding 3-Node Subgraphs on the State Space of Boolean Networks
Authors: Chikoo Oosawa, Michael A. Savageau, Abdul S. Jarrah, Reinhard C. Laubenbacher, Eduardo D. Sontag
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We demonstrate the effects of embedding subgraphs in a Boolean network, which is one of the discrete dynamic models for transcriptional regulatory networks. After comparing the dynamic properties of networks embedded with seven different subgraphs including feedback and feedforward subgraphs, we found that complexity of the state space increases with longer lengths of attractors, and the number of attractors is reduced for networks with more feedforward subgraphs. In addition, feedforward subgraphs can provide higher mutual information with lower entropy in a temporal program of gene expression. Networks with the other six subgraphs show opposite effects on network dynamics. This is roughly consistent with Thomas's conjecture. These results suggest that feedforward subgraph is favorable local structure in complex biological networks.
Vortex Shedding Process Investigation Downstream a Surface-Mounted Block
Authors: D. Calluaud, L. Davd, A. Texier
Venue: Journal of Visualization (2005)

The laminar flow around a surface-mounted block is investigated by visualizations and PIV measurements. Flow topology and, especially, the vortex shedding dynamics are emphasized. The existence of two vortex shedding processes is highlighted by particles visualizations and instantaneous velocity fields analyses. On one hand, a dominant swirling mechanism with vortex matching process and a symmetrical topology sets up and, on the other hand, a non periodical evolution with a dissymmetric topology exist. In order to inquire about those processes, double velocity correlation functions are calculated and from those new data the space and time evolutions of the vortices are detailed.
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines
Authors: Emmanuel Jeannot, Erik Saule, Denis Trystram
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-objective analysis, namely simultaneous optimization of the makespan and the reliability. We show that this problem can not be approximated by a single schedule. A similar problem has already been studied leading to a $\big$-approximation algorithm (i.e. for any fixed value of the makespan, the obtained solution is optimal on the reliability and no more than twice the given makespan). We provide an algorithm which has a much lower complexity. This solution is finally used to derive a (2 + ¿, 1)-approximation of the Pareto set of the problem, for any ¿> 0.
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
Authors: Marc Stevens, Arjen Lenstra, Benne Weger
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We present a novel, automated way to find differential paths for MD5. As an application we have shown how, at an approximate expected cost of 250 calls to the MD5 compression function, for any two chosen message prefixes P and P¿, suffixes S and S¿ can be constructed such that the concatenated values P||S and P¿||S¿ collide under MD5. Although the practical attack potential of this construction of chosen-prefix collisions is limited, it is of greater concern than random collisions for MD5. To illustrate the practicality of our method, we constructed two MD5 based X.509 certificates with identical signatures but different public keys and different Distinguished Name fields, whereas our previous construction of colliding X.509 certificates required identical name fields. We speculate on other possibilities for abusing chosen-prefix collisions. More details than can be included here can be found on www.win.tue.nl/hashclash/ChosenPrefixCollisions/ .
Integrating Safety Analyses and Component-Based Design
Authors: Dominik Domis, Mario Trapp
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

In recent years, awareness of how software impacts safety has increased rapidly. Instead of regarding software as a black box, more and more standards demand safety analyses of software architectures and software design. Due to the complexity of software-intensive embedded systems, safety analyses easily become very complex, time consuming, and error prone. To overcome these problems, safety analyses have to be integrated into the complete development process as tightly as possible. This paper introduces an approach to integrating safety analyses into a component-oriented, model-based software engineering approach. The reasons for this are twofold: First, component- and model-based development have already been proven in practical use to handle complexity and reduce effort. Second, they easily support the integration of functional and non-functional properties into design, which can be used to integrate safety analyses.
Cryptanalytic Flaws in Oh et al.'s ID-Based Authenticated Key Agreement Protocol
Authors: Meng-Hui Lim, Sanggon Lee, Hoonjae Lee
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

A key agreement protocol is designed for two or more entities to agree upon a shared secret key, which is used to preserve confidentiality and data integrity over an open network. In 2007, Oh et al. proposed an efficient ID-based authenticated key agreement protocol on elliptic curve pairings, which is believed to be able to generate two session keys securely after a protocol execution. However, we discover that their protocol is in fact susceptible to the basic impersonation attack as well as the key compromise impersonation attack. In this paper, we present the imperfections of Oh et al.'s scheme and subsequently we suggest a slight modification to the scheme which would resolve the problems.
MERLIN: Cross-layer integration of MAC and routing for low duty-cycle sensor networks
Authors: Antonio G. Ruzzelli, Gregory M. P. O'Hare, Raja Jurdak
Venue: Ad Hoc Networks (2008)

Sensor network MAC protocols typically sacrifice packet latency to achieve energy efficiency. Such delays may well increase due to routing protocol operation. For this reason it is imperative that we attempt to quantify the end-to-end delay and energy consumption when jointly using low duty cycle MAC and routing protocols. In this paper, we present a comprehensive evaluation of MERLIN (MAC and efficient routing integrated with support for localization), a cross-layer protocol that integrates both MAC and routing features. In contrast to many sensor network protocols, it employs a multicast upstream and multicast downstream approach to relaying packets to and from the gateway. Simultaneous reception and transmission errors are notified by asynchronous burst ACK and negative burst ACK messages. A division of the network into timezones, together with an appropriate scheduling policy, enables the routing of packets to the closest gateway. An evaluation of MERLIN has been conducted through simulation, against both the SMAC and the ESR routing protocols (an improved version of the DSR algorithm). The results illustrate that the joint usage of both SMAC and ESR, in low duty cycle scenarios, causes extremely high end-to-end delays and prevents acceptable data delivery rate. MERLIN, as an integrated approach, notably reduces latency, resulting in nodes that can deliver data in a very low duty cycle, yielding a significant extension to network lifetime.
Using server-to-server communication in parallel file systems to simplify consistency and improve performance
Authors: Philip H. Carns, Bradley W. Settlemyer, Walter B. Ligon,  III
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

The trend in parallel computing toward clusters running thousands of cooperating processes per application has led to an I/O bottleneck that has only gotten more severe as the CPU density of clusters has increased. Current parallel file systems provide large amounts of aggregate I/O bandwidth; however, they do not achieve the high degrees of metadata scalability required to manage files distributed across hundreds or thousands of storage nodes. In this paper we examine the use of collective communication between the storage servers to improve the scalability of file metadata operations. In particular, we apply server-to-server communication to simplify consistency checking and improve the performance of file creation, file removal, and file stat. Our results indicate that collective communication is an effective scheme for simplifying consistency checks and significantly improving the performance for several real metadata intensive workloads.
Asynchronous congestion games
Authors: Michal Penn, Maria Polukarov, Moshe Tennenholtz
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each resource executes its assigned tasks in a random order. Each player's aim is to minimize his expected cost which is the sum of two terms - the sum of the fixed costs over the set of his utilized resources and the expected cost of his task execution. The cost of a player's task execution is determined by the earliest time his task is completed, and thus it might be beneficial for him to assign his task to several resources. We prove the existence of pure strategy Nash equilibria in ACGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ACG.
Cut Elimination in Deduction Modulo by Abstract Completion
Authors: Guillaume Burel, Claude Kirchner
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

Deduction Modulo implements Poincarés principle by identifying deduction and computation as different paradigms and making their interaction possible. This leads to logical systems like the sequent calculus or natural deduction modulo. Even if deduction modulo is logically equivalent to first-order logic, proofs in such systems are quite different and dramatically simpler with one cost: cut elimination may not hold anymore. We prove first that it is even undecidable to know, given a congruence over propositions, if cuts can be eliminated in the sequent calculus modulo this congruence.Second, to recover the cut admissibility, we show how computation rules can be added following the classical idea of completion a la Knuth and Bendix. Because in deduction modulo, rewriting acts on terms as well as on propositions, the objects are much more elaborated than for standard completion. Under appropriate hypothesis, we prove that the sequent calculus modulo is an instance of the powerful framework of abstract canonical systems and that therefore, cuts correspond to critical proofs that abstract completion allows us to eliminate.In addition to an original and deep understanding of the interactions between deduction and computation and of the expressivity of abstract canonical systems, this provides a mechanical way to transform a sequent calculus modulo into an equivalent one admitting the cut rule, therefore extending in a significant way the applicability of mechanized proof search in deduction modulo.
A Comparative Analysis of Particle Filter Based Localization Methods
Authors: Luca Marchetti, Giorgio Grisetti, Luca Iocchi
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

Self-localization is a deeply investigated field in mobile robotics, and many effective solutions have been proposed. In this context, Monte Carlo Localization (MCL) is one of the most popular approaches, and represents a good tradeoff between robustness and accuracy. The basic underlying principle of this family of approaches is using a Particle Filter for tracking a probability distribution of the possible robot poses.Whereas the general particle filter framework specifies the sequence of operations that should be performed, it leaves open several choices including the observation and the motion model and it does not directly address the problem of robot kidnapping.The goal of this paper is to provide a systematic analysis of Particle Filter Localization methods, considering the different observation models which can be used in the RoboCup soccer environments. Moreover, we investigate the use of two different particle filtering strategies: the well known Sample Importance Resampling (SIR) filter, and the Auxiliary Variable Particle filter (APF).
Presentation of Force-Motion Relationship by Inertial Force Display
Authors: Koichi Hirota, Shotaro Sasaki, Yuichiro Sekiguchi
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

By shaking a box, we can estimate content inside. Relationship between force that is applied to the box and resulting motion of the box is considered to be a clue to the estimation. In this paper, an approach to implementing a device that virtually represents the force-motion relationship is discussed.
The Chaotic Netlet Map
Authors: Geehyuk Lee, Gwan-Su Yi
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The parametrically coupled map lattice (PCML) exhibits many interesting dynamical behaviors that are reminiscent of the adaptation and the learning of the neural network. In order for the PCML to be a model of the neural network, however, it is necessary to identify the biological counterpart of one-dimensional maps that constitute the PCML. One of the possible candidates is a netlet, a small population of randomly interconnected neurons, that was suggested to be a functional unit constituting the neural network. We studied the possibility of representing a netlet by a chaotic one-dimensional map and the result is the chaotic netlet map that we introduce in this paper.
The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity
Authors: Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra
Venue: Implementation and Application of Functional Languages: 19th International Workshop, IFL 2007, Freiburg, Germany, September 27-29, 2007. Revised Selected Papers (2008)

In this paper we describe the structure of the Essential Haskell Compiler (EHC) and how we manage its complexity, despite its growth from essentials to a full Haskell compiler. Our approach splits both language and implementation into smaller, manageable steps, and uses specific tools to generate parts of the compiler from higher level descriptions.
Supporting Customer Retention through Real-Time Monitoring of Individual Web Usage
Authors: Peter I. Hofgesang, Jan Peter Patist
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Customer retention is crucial for any company relying on a regular client base. One way to approach this problem is to analyse actual user behaviour and take proper actions based on the outcome. Identifying increased or decreased customer activity on time may help on keeping customers active or on retaining defecting customers. Activity statistics can also be used to target and activate passive customers. Web servers of online services track user interaction seamlessly. We use this data, and provide methods, to detect changes real-time in online individual activity and to give measures of conformity of current, changed activities to past behaviour. We confirm our approach by an extensive evaluation based both on synthetic and real-world activity data. Our real-world dataset includes 5,000 customers of an online investment bank collected over 3 years. Our methods can be used, but are not limited to, trigger actions for customer retention on any web usage data with sound user identification.