ppxscal/embedding_network huggingface dataset:
Stability analysis and design of the second-order congestion control for networks with heterogeneous delays
Authors: Yu-Ping Tian
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

This paper addresses the problem of the stability of congestion control for networks with heterogeneous round-trip communication delays. We present a frequency-domain approach to this problem. The approach is based on the analysis of the clockwise property of system transfer functions, generalized Nyquist stability criterion, and a recent lemma of Vinnicombe. We point out that a prerequisite for establishing decentralized stability criteria for distributed congestion control is that the Nyquist plots of time-delayed transfer functions corresponding to price (rate) dynamics at links (sources) satisfy clockwise property in certain frequency intervals. Based on the detailed investigation of global geometric properties of the frequency response of price dynamics at links, we derive sufficient conditions for the local asymptotic stability of a kind of the second-order active queue management algorithm--REM algorithm. A simple design procedure is also proposed for guaranteeing the asymptotic stability of the control algorithm.
A uniform deductive approach for parameterized protocol safety
Authors: Jean-Francois Couchot, Alain Giorgetti, Nikolai Kosmatov
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

We present a uniform verification method of safety properties for classes of parameterized protocols. Properties like mutual exclusion or cache coherence are automatically verified for any number of similar processes communicating by broadcast and rendezvous. The protocols are specified in a language of generalized substitutions on array data structures. Sets of states are expressed by first-order formulae with equality. Predecessors are computed by an iterative semi-algorithm. Reaching an initial state or the fixpoint is shown to be decidable and an original decision procedure is provided. As a running example, the MESI protocol illustrates this approach. Experimental results show its applicability to various properties and protocol classes.
RCS: a learning classifier system for evolutionary robotics
Authors: Noah W. Smith, Clare Bates Congdon
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

This paper introduces RCS, a learning classifier system designed for evolutionary robotics research. In addition to describing the system, it will present the results of RCS applied to a pursuit task. In this test, performance was good and has been improved in ongoing work.
SPICE: Simulated Pore Interactive Computing Environment
Authors: Shantenu Jha, Peter Coveney, Matt Harvey
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

SPICE aims to understand the vital process of translocation of biomolecules across protein pores by computing the free energy profile of the translocating biomolecule along the vertical axis of the pore. Without significant advances at the algorithmic, computing and analysis levels, understanding problems of this size and complexity will remain beyond the scope of computational science for the foreseeable future. A novel algorithmic advance is provided by a combination of Steered Molecular Dynamics and Jarzynski's Equation (SMD-JE); Grid computing provides the required new computing paradigm as well as facilitating the adoption of new analytical approaches. SPICE uses sophisticated grid infrastructure to couple distributed high performance simulations, visualization and instruments used in the analysis to the same framework. We describe how we utilize the resources of a federated trans-Atlantic Grid to use SMD-JE to enhance our understanding of the translocation phenomenon in ways that have not been possible until now.
Implementation of a Secure Wireless Communication Technology in a Highly Mobile Organisation: Challenges and Issues
Authors: Keyurkumar J. Patel, Steve Mccubben
Venue: Wireless Personal Communications: An International Journal (2005)

Wireless Technology is growing at an alarming rate with increased security being the main challenge for developers and end users. This study presents after tackling initial challenges and issues faced during the implementation of wireless technology, how security issues and wireless application were implemented at Sydney Airport --- a highly mobile organization. The decision to deploy and manage the wireless spectrum throughout the Airport campus meant the wireless LAN will be a shared medium with public users, tenants and aircraft communications, sharing the same available bandwidth. Therefore to protect unintended users from breach of existing security policies adopted by their corporate network a comprehensive security solution needed to be established. This study focuses on how Sydney Airport undertook the WLAN architecture and security challenges of implementing a common use wireless infrastructure. Authentication and data privacy challenges are also presented. The complete WLAN connectivity for tenants, public and corporate usage is presented.
Formalized Security Model of Multi-Proxy Signature Schemes
Authors: Qin Wang, Zhenfu Cao, Shengbao Wang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Multi-proxy signature schemes allow an original signer to authorize a group of proxy members, and only the cooperation of all the signers in the proxy group can generate the proxy signatures on behalf of the original signer. Multi-proxy signature schemes have been suggested to use in a number of applications, particularly in distributed computing where delegation of rights is quite common. Although some work has been done in multi-proxy signature schemes, until now there is no formalized definition and security model for them. In this paper, we will give the formal definition of multi-proxy signature schemes and formalize a notion of security for them. We also propose a specific scheme which is provably secure in the new model.
Simulation and the inspection paradox
Authors: Randolph J. Taylor
Venue: ACM SIGSIM Simulation Digest (1982)

The use of simulation as a modeling tool has become quite extensive in recent years. Not only must a simulation model be developed, but also, a validation process must occur to show that this model represents the actual real-world system which is being studied. However, validation is often a difficult problem. Therefore, frequently certain features of the computer model are verified to illustrate that the simulation functions like the real-world system. This paper discusses the inspection paradox, a problem that the new simulabor may encounter, if not careful, while attempting to verify arrival times in the simulation model.
AMIOT: Induced Ordered Tree Mining in Tree-Structured Databases
Authors: Shohei Hido, Hiroyuki Kawano
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Frequent subtree mining has become increasingly important in recent years. In this paper, we present AMIOT algorithm to discover all frequent ordered subtrees in a tree-structured database. In order to avoid the generation of infrequent candidate trees, we propose the techniques such as right-and-left tree join and serial tree extension. Proposed methods enumerate only the candidate trees with high probability of being frequent without any duplications. The experiments on synthetic dataset and XML database show that AMIOT reduces redundant candidate trees and outperforms FREQT algorithm by up to five times in execution time.
Specification and Management of QoS in Real-Time Databases Supporting Imprecise Computations
Authors: Mehdi Amirijoo Jorgen Hansson, Sang Hyuk Son
Venue: IEEE Transactions on Computers (2006)

Real-time applications such as e-commerce, flight control, chemical and nuclear control, and telecommunication are becoming increasingly sophisticated in their data needs, resulting in greater demands for real-time data services that are provided by real-time databases. Since the workload of real-time databases cannot be precisely predicted, they can become overloaded and thereby cause temporal violations, resulting in damage or even a catastrophe. Imprecise computation techniques address this problem and allow graceful degradation during overloads. In this paper, we present a framework for QoS specification and management consisting of a model for expressing QoS requirements, an architecture based on feedback control scheduling, and a set of algorithms implementing different policies and behaviors. Our approach gives a robust and controlled behavior of real-time databases, even for transient overloads and with inaccurate runtime estimates of the transactions. Further, performance experiments show that the proposed algorithms outperform a set of baseline algorithms that uses feedback control.
Fault-tolerance for Stateful Application Servers in the Presence of Advanced Transactions Patterns
Authors: Huaigu Wu, Bettina Kemme
Venue: Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (2005)

Replication is widely used in application server products to tolerate faults. An important challenge is to correctly coordinate replication and transaction execution for stateful application servers. Many current solutions assume that a single client request generates exactly one transaction at the server. However, it is quite common that several client requests are encapsulated within one server transaction or that a single client request can initiate several server transactions. In this paper, we propose a replication tool that is able to handle these variations in request/transaction association. We have integrated our approach into the J2EE application server JBoss. Our evaluation using the ECPerf benchmark shows a low overhead of the approach.
An Empirical Bayes Approach to Detect Anomalies in Dynamic Multidimensional Arrays
Authors: Deepak Agarwal
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We consider the problem of detecting anomalies in data that arise as multidimensional arrays with each dimension corresponding to the levels of a categorical variable. In typical data mining applications, the number of cells in such arrays are usually large. Our primary focus is detecting anomalies by comparing information at the current time to historical data. Naive approaches advocated in the process control literature do not work well in this scenario due to the multiple testing problem - performing multiple statistical tests on the same data produce excessive number of false positives. We use an Empirical Bayes method which works by fitting a two component gaussian mixture to deviations at current time. The approach is scalable to problems that involve monitoring massive number of cells and fast enough to be potentially useful in many streaming scenarios. We show the superiority of the method relative to a naive "per component error rate" procedure through simulation. A novel feature of our technique is the ability to suppress deviations that are merely the consequence of sharp changes in the marginal distributions. This research was motivated by the need to extract critical application information and business intelligence from the daily logs that accompany large-scale spoken dialog systems deployed by AT&T. We illustrate our method on one such system.
Full Electron Calculation Beyond 20,000 Atoms: Ground Electronic State of Photosynthetic Proteins
Authors: TSUTOMU IKEGAMI, TOYOKAZU ISHIDA, DMITRI G. FEDOROV, KAZUO KITAURA, YUICHI INADOMI, HIROAKI UMEDA, MITSUO YOKOKAWA, SATOSHI SEKIGUCHI
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

A full electron calculation for the photosynthetic reaction center of Rhodopseudomonas viridis was performed by using the fragment molecular orbital (FMO) method on a massive cluster computer. The target system contains 20,581 atoms and 77,754 electrons, which was divided into 1,398 fragments. According to the FMO prescription, the calculations of the fragments and pairs of the fragments were conducted to obtain the electronic state of the system. The calculation at RHF/6-31G* level of theory took 72.5 hours with 600 CPUs. The CPUs were grouped into several workers, to which the calculations of the fragments were dispatched. An uneven CPU grouping, where two types of workers are generated, was shown to be efficient.
Threading with environment-specific score by artificial neural networks
Authors: N. Jiang, W. XinyuWu, I. Mitchell
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

Protein threading programs align a probe amino acid sequence onto a library of representative folds of known protein structure to identify a structural homology. A scoring function is usually formulated in terms of the threading energy to evaluate the protein sequence-structure fitness. In this paper, a model named threading with environment-specific score (TES) is proposed to build a new threading score function with the use of artificial neural networks. Given a protein structure with a residue level environment description, the compatibility of residue in sequence with its structural environment is presented. A threading score is constructed by log-odds scores of predicted probabilities from the trained model to determine which residue best fits its environment. Two decoy sets are used to test the proposed TES method on discrimination of native and decoy protein three-dimensional structure. The results showed that the performance of the proposed method is comparable to those of knowledge-based potential energy function.
Simple Linux ip repeaters to extend homeplug range
Authors: Francisco J. González-Castaño, Pedro S. Rodríguez-Hernández, Felipe J. Gil-Castiñeira, Miguel Rodelgo-Lacruz, Jose Valero-Alonso
Venue: Linux Journal (2005)

Increase the range and functionality of your power-line network with an embedded Linux device that helps connect distant nodes.
The efficient dissemination of information in highly mobile ad hoc networks
Authors: Michael Gorden Kirkpatrick
Venue:  (2005)

With the proliferation of wireless networked computing devices in recent years, the importance of communication between nodes in these networks has increased greatly. The mobility of these nodes complicates the problem because a given node's connections to the network are likely to change over time with the result that communication paths are established ad hoc. As the speed of the nodes increases or the computing power available to them is reduced, many standard techniques for predicting available message pathways no longer work. In these highly mobile ad hoc networks, the links between nodes can change between the time they are detected and the time they are to be used. Another development in recent years has been the study of swarm intelligence which offers new insights to many problems involving autonomous agents. In a swarm intelligent system, the individual actors operate independently according to some simple set of rules and overall behavior patterns emerge. This work looks at various aspects of the problem of message broadcast in highly mobile ad hoc networks. It begins by examining broadcast in fixed grids. It then applies observations pertaining to grids to a series of simulations of highly mobile ad hoc networks using cellular automata. Methods for determining the efficiency of broadcast algorithms are developed. The effects of collisions on broadcast and the effects of toggling between different types of transmission neighborhoods are then studied. Formulas are developed for predicting the point at which an individual node can safely stop re-transmitting the message. Next, a radio-based simulator is developed and used to gauge the effectiveness and promise of the results of the earlier simulations. Finally, a swarm intelligence inspired protocol for message transmission is given.
Improving IT Management at the BMW Group by Integrating Existing IT Management Processes
Authors: Florian Fischer, Florian Matthes, Andre Wittenburg
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The management of IT landscapes consisting of thousands of business applications, different middleware systems, and supporting various business processes is a challenge for modern IT management. The BMW Group has addressed this challenge by establishing an integrated IT management process which covers strategy, architecture, planning and controlling. The BMW Group integrates the following preexisting IT processes in a continuous management process: "Architecture and standardization" defines blueprints in terms of architectural patterns; "Landscape management" maintans an overall model of the (present and future) IT landscape; "Portfolio management" coordinates, evaluates and prioritizes action items with IT impact; "Synchronization management" manages ongoing (IT) projects, their dependencies and the cross functions; "Strategy and objectives" generates action items, defines guidelines for the other processes and adjusts strategies based on feedback from the other processes. This paper describes the problems that arise if such an integrated, continuous management process is lacking.
Using genetic algorithms to optimise triangle strips
Authors: Kieren Lord, Ross Brown
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

There is an ever increasing demand for higher levels of visual detail in graphical applications, particularly in computer games and applications employing visualisation. Triangle strips have been commonly used to optimise the rendering of large geometric meshes. This paper investigates the process of generating optimal triangle strips through the use of genetic algorithms (GA), to remove the need for special knowledge of the intended hardware platform. Two methods -- L-System encoding and parameter tuning of an established algorithm were implemented and tested. The results of this work show that over an extended period of time, solutions can be achieved that are comparable to existing triangle stripping techniques, but the best results were obtained from using the GA to tune the parameters of an existing triangle stripping algorithm.
Performance analysis of practical RDT interconnection networks with SINOMP
Authors: Yang Yu, Yulu Yang
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

RDT (Recursive Diagonal Torus) consisting of recursively structured mesh/torus connections is a class of interconnection networks for massively parallel computers (MPCs). RDT(2,2,1)/a is one of its practical structure. It is suitable for the practical parallel computers due to its simple torus assignment and routing algorithm. In this paper, the method to compute its theoretical average distance, which is the performance index, is proposed. According to this method, the theoretical performance of RDT(2,2,1)/a is evaluated. The indices showing the performances of the practical communication process are obtained with an interconnection network simulator named SINOMP. After analyzing these performances, the suitable for the middle-size parallel computers is validated.
Capability matching of data streams with network services
Authors: Han Gao, I. R. Judson, T. Uram, T. L. Disz, M. E. Papka, R. L. Stevens
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Distributed computing middleware needs to support a wide range of resources, such as diverse software components, various hardware devices, and heterogeneous operating systems and architectures. Current technologies are unable to implement a maintenance-free platform to be compatible with such different computing environments. This situation is presenting an increasing challenge as Grid computing becomes more widespread. The infrastructure of network services (CENSA and CENSI) has been proposed to address this challenge. A seamless Grid computing environment, supported by network services, is composed of various streams such as data, video, audio, and text. We define a mathematical model of capability matching for three-party agreements: requests from users, resources, and network services. Based on the mathematical model, we provide a general approach for capability matching. We also present a new language schema for capability description. As an example, we embed the general matchmaker in the architecture of the access Grid. Several tests of accuracy and performance are discussed.
A Review of Audio Fingerprinting
Authors: Pedro Cano, Eloi Batlle, Ton Kalker, Jaap Haitsma
Venue: Journal of VLSI Signal Processing Systems (2005)

An audio fingerprint is a compact content-based signature that summarizes an audio recording. Audio Fingerprinting technologies have attracted attention since they allow the identification of audio independently of its format and without the need of meta-data or watermark embedding. Other uses of fingerprinting include: integrity verification, watermark support and content-based audio retrieval. The different approaches to fingerprinting have been described with different rationales and terminology: Pattern matching, Multimedia (Music) Information Retrieval or Cryptography (Robust Hashing). In this paper, we review different techniques describing its functional blocks as parts of a common, unified framework.
Application of Genetic Algorithm to Pattern Extraction
Authors: Marcin Borkowski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The area of interest for this paper covers pattern recognition method, which can find and classify all useful relations between data entries in the time series. Genetic algorithm has been deployed to prepare and govern a set of independent patterns. For each pattern additional quality value has been added. This value corresponds to the level of certainty and is introduced in the work. Practical application of this solution consists of data fitting and prediction. Analyzed data can be non continuous and incomplete. In uncertain cases algorithm presents either no response at all or more than one answer to processed data. Architecture of the system offers possibility to interleave learning phase with use. Genetic Algorithm applied in the method facilitates niche techniques as well as crowd factor and specialized population selection methods. Early testing results, which include prediction and fitting of simple time series with up to 50 percent of missing data, are presented at the end of the paper.
Content-adaptive transmission of reconstructed soccer goal events over low bandwidth networks
Authors: Qing Tang, Irena Koprinska, Jesse S. Jin
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper presents a content-adaptive system for streaming reconstructed soccer goal events over networks with bandwidth limited to 1.5Mbps or below. The reconstruction module analyzes a soccer video to produce corresponding panoramic field model with localized motion trajectories to provide tactic analysis for user's better comprehension of the goal events. The transmission module designs 3 schemes for different bandwidth conditions (150Kbps-1.5Mbps), (56-150Kbps), and (<56Kbps). Each scheme can choose dynamically the video content, viewing quality and where the reconstruction happens based on the network conditions and computational power of connected devices. We demonstrate the effectiveness and scalability of our system in experimental results of adaptive transmission two soccer goal events under three typical bandwidth conditions.