ppxscal/embedding_network huggingface dataset:
DNScup: Strong Cache Consistency Protocol for DNS
Authors: Xin Chen, Haining Wang, Shansi Ren
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Effective caching in Domain Name System (DNS) is critical to its performance and scalability. Existing DNS only supports weak cache consistency by using the Time-To-Live (TTL) mechanism, which functions reasonably well in normal situations. However, maintaining strong cache consistency in DNS as an indispensable exceptional handling mechanismhas become more and more demanding for three important objectives: (1) to quickly respond and handle exceptional incidents, such as sudden and dramatic Internet failures caused by natural and human disasters, (2) to adapt increasingly frequent changes of IP addresses due to the introduction of dynamic DNS techniques for various stationed and mobile devices on the Internet, and (3) to provide finegrain controls for content delivery services to timely balance server load distributions. With agile adaptation to various exceptional Internet dynamics, strong DNS cache consistency improves the availability and reliability of Internet services. In this paper, we propose a proactive DNS cache update protocol, called DNScup, running as middleware in DNS nameservers, to provide strong cache consistency for DNS. The core of DNScup is a dynamic lease technique to keep track of the local DNS nameservers, whose clients need cache coherence to avoid losing service availability. Based on the DNS Dynamic Update protocol, we have built a DNScup prototype with minor modifications to the current DNS implementation. Our trace-driven simulation and system prototype demonstrate the effectiveness of DNScup and its easy and incremental deployment on the Internet.
Focus on the Generalized Information Hiding Technology
Authors: Dai-mao Lin, Lin-na Zhou, Yun-biao Guo, Lan Hu, Xia-mu Niu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Based on the deep understanding of the mechanism in the information hiding technology, the concept of the generalized information hiding and a new model are suggested in this paper. According to the new theory of information hiding, many ancient stego model and modern information hiding methods got the reasonable interpretation. An important conclusion that the cover message is not necessary was got, and the image vision redundancy can be quantificationally analyzed here.
Non-stationary signal processing using time-frequency filter banks with applications
Authors: Amir Francos, Moshe Porat
Venue: Signal Processing (2006)

We present a new approach to the design of time-frequency (TF) filter banks for non-stationary noisy signals. In this work, we concentrate on multicomponent signals represented by the minimum cross-entropy TF distribution (MCE-TFD). The proposed method is based on an array of time-varying filters, each filter processes one component of the signal according to its specific TF support. The output of the filtering algorithm is a set of the signal components. Two applications of the proposed algorithm are considered. The first application is of interference mitigation of continuous phase modulation (CPM) signals which have been extensively used in recent years, especially for wireless communications. The second application is cancellation of wideband interference in direct-sequence code division multiple access (DS-CDMA) communications, based on the MCE-TFD and the filter banks approach.
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
Authors: Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, Jonathan Turner
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most high performance systems that perform deep packet inspection implement simple string matching algorithms to match packets against a large, but finite set of strings. owever, there is growing interest in the use of regular expression-based pattern matching, since regular expressions offer superior expressive power and flexibility. Deterministic finite automata (DFA) representations are typically used to implement regular expressions. However, DFA representations of regular expression sets arising in network applications require large amounts of memory, limiting their practical application.In this paper, we introduce a new representation for regular expressions, called the Delayed Input DFA (D2FA), which substantially reduces space equirements as compared to a DFA. A D2FA is constructed by transforming a DFA via incrementally replacing several transitions of the automaton with a single default transition. Our approach dramatically reduces the number of distinct transitions between states. For a collection of regular expressions drawn from current commercial and academic systems, a D2FA representation reduces transitions by more than 95%. Given the substantially reduced space equirements, we describe an efficient architecture that can perform deep packet inspection at multi-gigabit rates. Our architecture uses multiple on-chip memories in such a way that each remains uniformly occupied and accessed over a short duration, thus effectively distributing the load and enabling high throughput. Our architecture can provide ostffective packet content scanning at OC-192 rates with memory requirements that are consistent with current ASIC technology.
A New Duality Approach to Solving Concave Vector Maximization Problems
Authors: Luc Dinh The, Phong Thai Quynh, Volle Michel
Venue: Journal of Global Optimization (2006)

We introduce a special class of monotonic functions with the help of support functions and polar sets, and use it to construct a scalarized problem and its dual for a vector optimization problem. The dual construction allows us to develop a new method for generating weak efficient solutions of a concave vector maximization problem and establish its convergence. Some numerical examples are given to illustrate the applicability of the method.
Information sharing and control in homogenous and heterogeneous supply networks under different market conditions
Authors: N. Ye, T. Farley
Venue: International Journal of Modelling and Simulation (2006)

A supply network consists of a focal organization and the network of firms that transact with it via goods, services, and information. Advances in information technology give a focal organization an unprecedented capability to communicate with, coordinate with, and even control its suppliers. However, it is unclear how information sharing and control will produce desirable performance and common welfare in the network, and how these factors should be adjusted under different conditions. In this study, we build a simple model of a supply network and run simulation experiments to investigate the effects of information sharing, control, homogeneity, and market conditions. The simulation results show that the best network performance is achieved under a high level of control. In the absence of such control, a supply network can achieve the same performance if the firms in the supply network behave in a homogeneous fashion and information is shared at the global level. In the case where agents behave in a heterogeneous fashion, the best performance is obtained when the agents are allowed to self organize based solely on information local to the agent.
Coercion-Resistance and Receipt-Freeness in Electronic Voting
Authors: Stephanie Delaune, Steve Kremer, Mark Ryan
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an election protocol is coercion-resistant if a voter A cannot prove to a potential coercer C that she voted in a particular way. We assume that A cooperates with C in an interactive fashion. Receipt-freeness is a weaker property, for which we assume that A and C cannot interact during the protocol: to break receipt-freeness, A later provides evidence (the receipt) of how she voted. While receipt-freeness can be expressed using observational equivalence from the applied pi calculus, we need to introduce a new relation to capture coercion-resistance. Our formalization of coercionresistance and receipt-freeness are quite different. Nevertheless, we show in accordance with intuition that coercionresistance implies receipt-freeness, which implies privacy, the basic anonymity property of voting protocols, as defined in previous work. Finally we illustrate the definitions on a simplified version of the Lee et al. voting protocol.
MapShaper.org: A Map Generalization Web Service
Authors: Mark Harrower, Matt Bloch
Venue: IEEE Computer Graphics and Applications (2006)

MapShaper.org is a Macromedia Flash-based WYSIWYG map generalization Web service for real-time generalizing and editing of vector map data. Requiring only a Web browser with the Flash plug-in, it offers line and shape simplification and smoothing. Users can upload map files, perform generalization operations, and export and download their work.
Discussion and Prediction of Mechanical Properties for Single Layer ACSR
Authors: Fang Liu, Raymond D. Findlay, Qiang Song
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

For the purpose of power system safety and reliability, conductor maintenance and design, mechanical properties of ACSR have been intensively discussed and studied through a sample conductor. The variations of strain and sag with current, service of time, and actual daily load demands are computed using a novel iterative procedure implemented in a Visual C++ software package, and predicted with an effective artificial neural network model validated by both visual comparison and statistical analysis.
A Computing Model for Concept Fusing and Document Classification
Authors: Nan Zhang, Chao He
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Effective document classification is a long-pursued goal in knowledge management. This paper proposes a novel hybrid approach of semantic representation and statistical measurements. Document is divided into content segments first. By Formal Concept Analysis (FCA), their semantic links with standard concept identifiers are built up whose weights are calculated statistically. In this way, effective concept fusing and document classification can be achieved. In addition, a semantic overlay for specific documents will be constructed via concept fusing. Experiments show our approach is feasible and effective.
Resonance curve and speed-gradient design of control algorithms for dissociation of diatomic molecule ensembles
Authors: M. Ananjevsky, A. Efimov, A. Fradkov, A. Krivtsov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 3 (2003)

Two methods for dissociation of diatomic molecules based on nonperiodic excitation generated by feedback control mechanism are described and analyzed by computer simulation for classical and quantum-mechanical ensembles. The first method of control design uses nonlinear resonance curve of the system to fulfill the resonance conditions at any time of excitation. second method is based on the speed-gradient principle. Implementation of the proposed methods by pulse laser control is described. Efficiently of the proposed methods is demonstrated by the example of hydrogen fluoride (HF) molecule dissociation. Simulations confirmed that new methods are more efficient than the existing algorithms based on harmonic (monochromatic) and linear chirping excitation both for the model case of single molecule and for an ensembles of molecules. It is shown that, the dissociation rate for the quantum-mechanical ensemble is just a few percent slower that the one for the classical ensemble. It justifies using classical models for feedback control design in the dissociation problem.
Sequential Memory: A Putative Neural and Synaptic Dynamical Mechanism
Authors: Gustavo Deco, Edmund T. Rolls
Venue: Journal of Cognitive Neuroscience (2005)

A key issue in the neurophysiology of cognition is the problem of sequential learning. Sequential learning refers to the ability to encode and represent the temporal order of discrete elements occurring in a sequence. We show that the short-term memory for a sequence of items can be implemented in an autoassociation neural network. Each item is one of the attractor states of the network. The autoassociation network is implemented at the level of integrate-and-fire neurons so that the contributions of different biophysical mechanisms to sequence learning can be investigated. It is shown that if it is a property of the synapses or neurons that support each attractor state that they adapt, then everytime the network is made quiescent (e.g., by inhibition), then the attractor state that emerges next is the next item in the sequence. We show with numerical simulations implementations of the mechanisms using (1) a sodium inactivation-based spike-frequency-adaptation mechanism, (2) a Ca2+-activated K+ current, and (3) short-term synaptic depression, with sequences of up to three items. The network does not need repeated training on a particular sequence and will repeat the items in the order that they were last presented. The time between the items in a sequence is not fixed, allowing the items to be read out as required over a period of up to many seconds. The network thus uses adaptation rather than associative synaptic modification to recall the order of the items in a recently presented sequence.
In search of a program generator to implement generic transformations for high-performance computing
Authors: Albert Cohen, Sébastien Donadio, Maria-Jesus Garzaran, Christoph Herrmann, Oleg Kiselyov, David Padua
Venue: Science of Computer Programming (2006)

The quality of compiler-optimized code for high-performance applications is far behind what optimization and domain experts can achieve by hand. Although it may seem surprising at first glance, the performance gap has been widening over time, due to the tremendous complexity increase in microprocessor and memory architectures, and to the rising level of abstraction of popular programming languages and styles. This paper explores in-between solutions, neither fully automatic nor fully manual ways to adapt a computationally intensive application to the target architecture. By mimicking complex sequences of transformations useful to optimize real codes, we show that generative programming is a practical means to implement architecture-aware optimizations for high-performance applications.This work explores the promises of generative programming languages and techniques for the high-performance computing expert. We show that complex, architecture-specific optimizations can be implemented in a type-safe, purely generative framework. Peak performance is achievable through the careful combination of a high-level, multi-stage evaluation language - MetaOCaml - with low-level code generation techniques. Nevertheless, our results also show that generative approaches for high-performance computing do not come without technical caveats and implementation barriers concerning productivity and reuse. We describe these difficulties and identify ways to hide or overcome them, from abstract syntaxes to heterogeneous generators of code generators, combining high-level and type-safe multi-stage programming with a back-end generator of imperative code.
On node lifetime problem for energy-constrained wireless sensor networks
Authors: Y. Thomas Hou, Yi Shi, Hanif D. Sherali
Venue: Mobile Networks and Applications (2005)

A fundamental problem in wireless sensor networks is to maximize network lifetime under given energy constraints. In this paper, we study the network lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network, which we define as the Lexicographic Max-Min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which effectively circumvents the computational complexity problem associated with an existing state-of-the-art approach, which is exponential. The main ideas in our approach include: (1) a link-based problem formulation, which significantly reduces the problem size in comparison with a flow-based formulation, and (2) an intelligent exploitation of parametric analysis technique, which in most cases determines the minimum set of nodes that use up their energy at each stage using very simple computations. Second, we present a simple (also polynomial-time) algorithm to calculate the flow routing schedule such that the LMM-optimal node lifetime vector can be achieved. Our results in this paper advance the state-of-the-art algorithmic design for network-wide node lifetime problem and facilitate future studies of the network lifetime problem in energy-constrained wireless sensor networks.
The Quality vs. Time Trade-off for Approximate Image Descriptor Search
Authors: Rut Siguroardottir, Bjorn Por Jonsson, Hlynur Hauksson, Laurent Amsaleg
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

In recent years, content-based image retrieval has become more and more important in many application areas. Similarity retrieval is inherently a very demanding process, in particular when performing exact searches. Therefore, there is an increasing interest in performing approximate searches, where result quality guarantees are traded for reduced query execution time. The goal of approximate retrieval systems should be to obtain the best possible result quality in the minimum amount of time. As a result, typical indexing strategies divide the data set into many data chunks. Minimizing the search time suggests to generate uniformly sized chunks to best overlap I/O costs with CPU costs. Maximizing quality, on the other hand, suggests to strongly limit the intra-chunk dissimilarity of data. The paper addresses the question to what extent guaranteeing the query processing time, using uniform chunk sizes, compromises the quality of the results, and vice versa. Using a large collection of 5 million 24-dimensions local descriptors computed over more than 50 thousand real life images, we show that minimizing the query processing time may in fact lead to better quality of the intermediate results.
MCGREP--A Predictable Architecture for Embedded Real-Time Systems
Authors: Jack Whitham, Neil Audsley
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Real-time systems design involves many important choices, including that of the processor. The fastest processors achieve performance by utilizing architectural features that make them unpredictable, leading to difficulties proving offline that application process deadlines will be met, in the worst-case. Utilizing slower, more predictable processors, may not provide sufficient instruction throughput to execute all required application processes. This exposes a key trade-off in processor selection for real-time systems: predictability versus instruction throughput. This paper proposes MCGREP, a novel CPU architecture that combines predictability, high instruction throughput and flexibility. MCGREP is entirely microprogrammed, with multiple execution units. Basic operation involves implementation of a conventional set of CPU instructions in microcode - MCGREP then executes object code suitably compiled. Advanced operation allows the application to dynamically load new microcode, enabling new application specific instructions to increase overall performance. MCGREP is implemented upon reconfigurable logic (FPGA) - an increasingly important platform for the embedded RTS. Custom microcode configurations for new instructions are generated from C source. MCGREP is shown to have performance comparable to two popular FPGA softcore CPUs (OpenRISC and Microblaze, the latter a commercial product). Flexibility is demonstrated by implementing an existing instruction set (OpenRISC) in microcode, with application-specific instructions to improve overall performance. As a further demonstration, predictable twolevel interrupt and synchronization mechanisms are programmed in microcode.
A high performances CMOS CCII and high frequency applications
Authors: Samir Ben Salem, Mourad Fakhfakh, Dorra Sellami Masmoudi, Mourad Loulou, Patrick Loumeau, Nouri Masmoudi
Venue: Analog Integrated Circuits and Signal Processing (2006)

In this paper, we propose an improved translinear based CCII configuration. Heuristic algorithm is used for optimal sizing regarding static and dynamic performances. PSPICE simulations for AMS 0.35 ¿m CMOS technology show that the current and voltage bandwidths are respectively 2.6 GHz and 3.9 GHz, and the parasitic resistance at port X (RX) has a value of 18 ¿ for a control current of 100 ¿A. The improved configuration is used as a building block into high frequency design applications: a current controlled oscillator and a tunable fully integrable band pass filter. The oscillator frequency can be tuned in the range of [290---475 MHz] by a simple variation of a DC current. The central frequency of the band pass filter can be varied in the range of [1.22---1.56 GHz] and the quality factor vary in the range [8---306] with a simple variation of a DC current.
An architecture for adaptive intrusion-tolerant applications: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: Partha Pal, Paul Rubel, Michael Atighetchi, Franklin Webber, William H. Sanders, Mouna Seri, HariGovind Ramasamy, James Lyons, Tod Courtney, Adnan Agbaria, Michel Cukier, Jeanna Gossett, Idit Keidar
Venue: Software&mdash;Practice Experience (2006)

Applications that are part of a mission-critical information system need to maintain a usable level of key services through ongoing cyber-attacks. In addition to the well-publicized denial of service (DoS) attacks, these networked and distributed applications are increasingly threatened by sophisticated attacks that attempt to corrupt system components and violate service integrity. While various approaches have been explored to deal with DoS attacks, corruption-inducing attacks remain largely unaddressed. We have developed a collection of mechanisms based on redundancy, Byzantine fault tolerance, and adaptive middleware that help distributed, object-based applications tolerate corruption-inducing attacks. In this paper, we present the ITUA architecture, which integrates these mechanisms in a framework for auto-adaptive intrusion-tolerant systems, and we describe our experience in using the technology to defend a critical application that is part of a larger avionics system as an example. We also motivate the adaptive responses that are key to intrusion tolerance, and explain the use of the ITUA architecture to support them in an architectural framework. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Fads and fallacies in asset liability management for life insurance
Authors: Graham Lord
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We shall examine the principles behind contemporary approaches to insurance risk management. Furthermore, we shall consider various methodologies, some successful, that have been or are currently employed to implement those principles. We shall illustrate these with several specific studies that show the identification, using simulation, of close-to-optimal investment strategies.