ppxscal/embedding_network huggingface dataset:
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Authors: Igor Nitto, Rossano Venturini
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

Let G be an unweighted and undirected graph of n nodes, and let D be the n ×n matrix storing the All-Pairs-Shortest-Path distances in G. Since D contains integers in [n] ¿ + ¿, its plain storage takes n 2log(n + 1) bits. However, a simple counting argument shows that (n 2 ¿ n)/2 bits are necessary to store D. In this paper we investigate the question of finding a succinct representation of D that requires O(n 2) bits of storage and still supports constant-time access to each of its entries. This is asymptotically optimal in the worst case, and far from the information-theoretic lower-bound by a multiplicative factor log2 3 ¿ 1.585. As a result O(1) bits per pairs of nodes in G are enough to retain constant-time access to their shortest-path distance. We achieve this result by reducing the storage of D to the succinct storage of labeled trees and ternary sequences, for which we properly adapt and orchestrate the use of known compressed data structures.
Fuzzy Model Based Iterative Learning Control for Phenol Biodegradation
Authors: Marco Mürquez, Julio Waissman, Olivia Gutü
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

In a fedbatch process the operational strategy can consist on controling the influent substrate concentration in the reactor, by means of the input flow manipulation. Due to the repetitive characteristic of the Sequencing Batch Reactor processes, it opens the possibility to explore the information generated in previous cycles to improve the process operation, without having on-line sensors and/or a very precise analytical model. In this work an iterative learning control strategy based on a fuzzy model is proposed. It is assumed that the measurements are analytical and only a few number of them can be obtained. So, an interpolation technique is used to improve the control performance. Simulation results for a phenol biodegradation process are presented.
Web Search Results Clustering Based on a Novel Suffix Tree Structure
Authors: Junze Wang, Yijun Mo, Benxiong Huang, Jie Wen, Li He
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Web search results clustering are navigator for users to search needed results. With suffix tree clustering (STC), search results can be clustered fast, automatically, and each cluster is labeled with a common phrase. Due to the large memory requirement of suffix tree, some other approaches have been proposed, with lower memory requirement. But unlike other algorithms, STC is an incremental algorithm and a promising approach to work on a long list of snippets returned by search engines. In this paper we proposed an approach for web search results clustering and labeling, based on a new suffix tree data structure. The approach is an incremental and linear time algorithm, with significantly lower memory requirements. This approach also labels every final cluster a common phrase, thus it is suitable for quickly browsing by users. Experimental results show that the new approach has better performance than that of conventional web search result clustering.
Parallel preconditioners for the conjugate gradient algorithm using Gram-Schmidt and least squares methods
Authors: Julien Straubhaar
Venue: Parallel Computing (2008)

This paper is devoted to the study of some preconditioned conjugate gradient algorithms on parallel computers. The considered preconditioners (presented in [J. Straubhaar, Preconditioners for the conjugate gradient algorithm using Gram-Schmidt and least squares methods, Int. J. Comput. Math. 84 (1) (2007) 89-108]) are based on incomplete Gram-Schmidt orthogonalization and least squares methods. The construction of the preconditioner and the resolution are treated separately. Numerical tests are performed and speed-up curves are presented in order to evaluate the performance of the algorithms.
A realistic model of frequency-based multi-robot polyline patrolling
Authors: Yehuda Elmaliach, Asaf Shiloni, Gal A. Kaminka
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

There is growing interest in multi-robot frequency-based patrolling, in which a team of robots optimizes its frequency of point visits, for every point in a target work area. In particular, recent work on patrolling of open polygons (e.g., open-ended fences) has proposed a general cooperative patrolling algorithm, in which robots move back and forth along the polygon, in an synchronized manner, such that their assigned areas of movement overlap. If the overlap factor is carefully chosen---based on the motion models of the robots---specific performance criteria are optimized. Unfortunately, previous work has presented analysis of motion models in which there are no errors in the movement of the robots, and no velocity changes. We go a step beyond existing work, and develop a realistic model of robot motion, that considers velocity uncertainties. We mathematically analyze the model and show how to use it to find optimal patrolling parameters, given known bounds of uncertainty on the motion. We then use the model to analyze the independently-programmed patrolling movements of physical robots, in extensive experiments. We show that the model predicts the behavior of the robots much more accurately than previously-described models.
Microsoft's Jim Gray on Computing's Breakthroughs, Lessons, and Future
Authors: Dejan Milojicic
Venue: IEEE Distributed Systems Online (2004)

Jim Gray, a senior researcher in Microsoft's Scalable Servers Research Group and manager of the company's Bay Area Research Center,shares his thoughts on the future of computing and emerging trends.
Basing Artificial Emotion on Process and Resource Management
Authors: Stefan Rank, Paolo Petta
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Executable computational process models of emotion are based on specific sets of modelling primitives. Motivated by the requirements of a specific scenario and concepts used by emotion theories, we propose as building blocks explicitly bounded resources and concurrent processes acquiring and using them. Our approach is intended for the incremental modelling of a growing collection of emotional episodes, with a clear delineation of technically necessary simplifications of the natural phenomena. An episode of disgust is used to discuss the approach, which is realised using real-time cooperative microthreading technology.
A 3D J2ME game utilizing autonomous moving agents
Authors: Menelaos Bakopoulos
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This game is focused on the 3D single and multiplayer game possibilities of the J2ME platform. Mobile phones have become a common personal item that is available at all times. The aim is to present a 3D space fighting game utilizing an AI based on autonomous moving agents. This game demonstration will show viewers what is currently possible with J2ME mobile phones as well as foreshadow what is coming. As embedded mobile phone technology further improves, the gap between personal computers and mobile phones decreases. A possible multiplayer component will finally be described.
Defect categorization: making use of a decade of widely varying historical data
Authors: Carolyn B. Seaman, Forrest Shull, Myrna Regardie, Denis Elbert, Raimund L. Feldmann, Yuepu Guo, Sally Godfrey
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

This paper describes our experience in aggregating a number of historical datasets containing inspection defect data using different categorization schemes. Our goal was to make use of the historical data by creating models to guide future development projects. We describe our approach to reconciling the different choices used in the historical datasets to categorize defects, and the challenges we faced. We also present a set of recommendations for others involved in classifying defects.
Autonomic machine control: a case study
Authors: Christian Dannegger, Dominic Greenwood
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: industrial track (2008)

This paper describes an autonomic machine control system applied to the adaptive control of a modular soldering machine. The particular case concerns the creation of a novel modular production machine with an integrated distributed agent control system, which will be sold worldwide from mid 2008. The agent model is described in terms of the specific customer requirements and specific advantages of the approach discussed.
HMDP: A New Protocol for Motion Pattern Generation Towards Behavior Abstraction
Authors: Norbert Michael Mayer, Joschka Boedecker, Kazuhiro Masui, Masaki Ogino, Minoru Asada
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

The control of more than 20 degrees of freedom in real-time is one challenge of humanoid robotics. The control architecture of an autonomous humanoid robot often consists of two parts, namely a real-time part that has direct access to the motors or RC servos, and a non-real-time part, that controls the higher-level behaviors and sensory information processing such as vision and touch. As a result motion patterns are developed separately from the other parts of the robots behavior. In research, particularly when including developmental processes, it is often necessary that the design or the evolution of motion patterns is integrated in the overall development of the robot's behavior. This is indeed one of the main principles of the embodied intelligence paradigm. The main aim of this work is to define a flexible way of describing motion patterns that can be passed to the motion controller which in turn executes them in real-time. As a result, the Harmonic Motion Description Protocol (HMDP) is presented. It allows the motions to be described as vectors of coefficients of harmonic motion splines. The motion splines are expressed as human-readable ASCII strings that can be passed as a motion stream. Flexibility is achieved by implementing the principle of superposition of several motion patterns. In this way also closed loop control is achievable in principle. Moreover, the HMDP can be implemented into the (deleted for blind review) project of the 3D soccer simulation league as a standard way to communicate motion patterns between the agent and the simulation interface and/or real humanoid robots.
Anticipatory Alignment Mechanisms for Behavioral Learning in Multi Agent Systems
Authors: Gerben G. Meyer, Nick B. Szirbik
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

In this paper we present a conceptualization and a formalization to define agents' behaviors (as exhibited in agent to agent interactions), via an extension of Petri Nets, and show how behaviors of different agents can be aligned. We explain why these agents can be considered anticipatory, and the link between Business Information Systems and anticipatory systems is elaborated. We show that alignment is a state anticipatory mechanism, where predictions about future states directly influence current behavioral decision making. This results in faster and more reliable interaction execution. Also, alignment provides a mechanism for more direct behavioral learning. We investigated three manners of alignment, individual on-the-fly alignment, pre-interaction alignment, and alignment with the intervention of a third party. This paper explains in some detail how alignment on-the-fly is realized using alignment policies. The features of the other two kinds of alignment are discussed, and future directions for research are pointed out.
Thin Maximal Antichains in the Turing Degrees
Authors: Chi Tat Chong, Liang Yu
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We study existence problems of maximal antichains in the Turing degrees. In particular, we give a characterization of the existence of thin $\Pi^1_1$ maximal antichains in the Turing degrees in terms of (relatively) constructible reals. A corollary of our main result gives a negative solution to a question of Jockusch under the assumption that every real is constructible.
Some topological and combinatorial properties of WK-recursive mesh and WK-pyramid interconnection networks
Authors: M. Hoseiny Farahabady, N. Imani, H. Sarbazi-Azad
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

The WK-recursive mesh and WK-pyramid networks are recursively defined hierarchical interconnection networks with excellent properties which well idealize them as alternatives for mesh and traditional pyramid interconnection topologies. They have received much attention due to their favorable attributes such as small diameter, large connectivity, and high degree of scalability and expandability. In this paper, we deal with pancyclicity and surface area of these networks. These properties are of great importance in the implementation of a variety of parallel algorithms in multicomputers. We show that WK-recursive mesh network is 1-partially pancyclic, i.e. any cycle of length 3, 4, 6,..., and N can be constructed in the WK-recursive mesh. Also, we prove that the WK-pyramid is pancyclic, that is all cycles of length 3, 4,..., and N can be formed in a WK-pyramid. It is also proved that two link-disjoint Hamiltonian paths/cycles can be embedded in the WK-recursive mesh/WK-pyramid. We then study the surface area of WK-recursive mesh and WK-pyramid networks and put forth some equations for calculating the surface area in these networks.
Abusing SIP Authentication
Authors: Humberto Abdelnur, Tigran Avanesov, Michael Rusinowitch, Radu State
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

The recent and massive deployment of Voice over IP infrastructures had raised the importance of the VoIP security and more precisely of the underlying signalisation protocol SIP. In this paper, we will present a new attack against the authentication mechanism of SIP. This attack allows to perform toll fraud and call hijacking. We will detail the formal speciﬁcation method that allowed to detect this vulnerability, highlight a simple usage case and propose a mitigation technique.
The evolution of video surveillance: an overview
Authors: Niels Haering, P&#x00e9;ter L. Venetianer, Alan Lipton
Venue: Machine Vision and Applications (2008)

Over the past 10&#x00a0;years, computer vision research has matured significantly. Although some of the core problems, such as object recognition and shape estimation are far from solved, many applications have made considerable progress. Video Surveillance is a thriving example of such an application. On the one hand, worldwide the number of cameras is expected to continue to grow exponentially and security budgets for governments, corporations and the private sector are increasing accordingly. On the other hand, technological advances in target detection, tracking, classification, and behavior analysis improve accuracy and reliability. Simple video surveillance systems that connect cameras via wireless video servers to Home PCs offer simple motion detection capabilities and are on sale at hardware and consumer electronics stores for under $300. The impact of these advances in video surveillance is pervasive. Progress is reported in technical and security publications, abilities are hyped and exaggerated by industry and media, benefits are glamorized and dangers dramatized in movies and politics. This exposure, in turn, enables the expansion of the vocabulary of video surveillance systems paving the way for more general automated video analysis.
The Advanced Electric Power Grid: Complexity Reduction Techniques for Reliability Modeling
Authors: Ayman Z. Faza, Sahra Sedigh, Bruce M. Mcmillin
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

The power grid is a large system, and analyzing its reliability is computationally intensive, rendering conventional methods ineffective. This paper proposes techniques for reducing the complexity of representations of the grid, resulting in a mathematically tractable problem to which our previously developed reliability analysis techniques can be applied. The IEEE118 bus system is analyzed as an example, incorporating cascading failure scenarios reported in the literature.
Using an Image-Text Parallel Corpus and the Web for Query Expansion in Cross-Language Image Retrieval
Authors: Yih-Chen Chang, Hsin-Hsi Chen
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

ImageCLEF2007 photo task is different from those of the previous years in two aspects. The caption field in the image annotations and the narrative field in the text queries are removed, and the example images in the visual queries are also removed from the image collection. In the new definition, the information that can be employed is less than before. Thus matching query words and annotations directly is not feasible. This paper explores the web to expand queries and documents. The experiments show that query expansion improves the performance 16.11%, however, document expansion brings in too much noise and the performance decreases 28.24%. The media mapping method based on an image-text parallel corpus is regarded as query expansion. The results of the formal runs show this method performs the best. Compared with the performance of the models without expansion, the MAP improves about 86.69%~143.12%. Integration of the external and the internal resources gains no benefits in the further experiments.
Home Photo Content Modeling for Personalized Event-Based Retrieval
Authors: Joo-Hwee Lim, Qi Tian, Philippe Mulhem
Venue: IEEE MultiMedia (2003)

With rapid advances in sensor, storage, processor, and communication technologies, consumers can now store large digital photo collections. Consumers need effective and efficient tools to organize and access photos in a semantically meaningful way. We address the semantic gap between feature-based indexes computed automatically and human query and retrieval preferences.
Efficient Helper Data Key Extractor on FPGAs
Authors: Christoph Bösch, Jorge Guajardo, Ahmad-Reza Sadeghi, Jamshid Shokrollahi, Pim Tuyls
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Physical Unclonable Functions (PUFs) have properties that make them very attractive for a variety of security-related applications. Due to their inherent dependency on the physical properties of the device that contains them, they can be used to uniquely bind an application to a particular device for the purpose of IP protection. This is crucial for the protection of FPGA applications against illegal copying and distribution. In order to exploit the physical nature of PUFs for reliable cryptography a so-called helper data algorithm or fuzzy extractor is used to generate cryptographic keys with appropriate entropy from noisy and non-uniform random PUF responses. In this paper we present for the first time efficient implementations of fuzzy extractors on FPGAs where the efficiency is measured in terms of required hardware resources. This fills the gap of the missing building block for a full FPGA IP protection solution. Moreover, in this context we propose new architectures for the decoders of Reed-Muller and Golay codes, and show that our solutions are very attractive from both the area and error correction capability points of view.
Verifying Parallel Programs with MPI-Spin
Authors: Stephen F. Siegel
Venue: Proceedings of the 14th European PVM/MPI User's Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2007)

Standard testing and debugging techniques are notoriously ineffective when applied to parallel programs, due to the numerous sources of nondeterminism arising from parallelism. MPI-Spin, an extension of the model checker Spin for verifying and debugging MPI-based parallel programs, overcomes many of the limitations associated with the standard techniques. By exploring all possible executions of an MPI program, MPI-Spin can conclude, for example, that a program cannot deadlock on any execution. If the program can deadlock, MPI-Spin can exhibit a trace showing exactly how the program fails, greatly facilitating debugging.
Second Workshop on Teaching Computational Science WTCS 2008
Authors: A. Tirado-Ramos, Q. Luo
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The Second Workshop on Teaching Computational Science, within the International Conference on Computational Science, provides a platform for discussing innovations in teaching computational sciences at all levels and contexts of higher education. This editorial provides an introduction to the work presented during the sessions.
A Frame-Based Selective Encryption Method for Real Time Video Transmission on VoIP
Authors: Kwangmo Yang, Keecheon Kim
Venue: Proceedings of the SSDSN, UPWN, WISH, SGC, ParDMCom, HiPCoMB, and IST-AWSN international workshops held at ISPA 2007 on Frontiers of High Performance Computing and Networking (2007)

In the past, the main purpose of telephony network is to transfer the voice. But Since 1990, there have been many changes about it. First of all, wireless mobile communication network has enjoyed tremendous growth at the popularity. And the purpose of communication has been changed to data communication from voice one. Furthermore, people have started to require both data communication and voice communication. Because of these issues, VoIP (Voice over IP) is getting to be a matter of concern. And According to development of network and computer devices, people want to communicate by not only voice telecommunication but also video telecommunication. However because it uses public IP network, security issues are getting to be an important thing in VoIP. Actually, there are many solutions to protect data from attackers in VoIP System. But to serve video transmission needs more special care. To display real time video streaming on telephones need more bandwidth and computing power. This is a handicap for video streaming on the mobile device. Therefore we concentrate on the solution how to protect the video data from attackers with well quality of service. This is discussed in this paper.
Diphone Databases for Lithuanian Text-to-Speech Synthesis
Authors: Pijus Kasparaitis
Venue: Informatica (2005)

One of the components of the text-to-speech synthesis system is the database of sounds. Two Lithuanian diphone databases in the MBROLA format are presented in this paper. The list of phonemes and the list of diphones necessary for Lithuanian text-to-speech synthesis are described. The problem of phoneme combinations that are not used in the Lithuanian language is dealt with in the work. Also, the article is concerned with transcribing a Lithuanian text.