ppxscal/embedding_network huggingface dataset:
Policy and State Based Secure Wrapper and Its Application to Mobile Agents
Authors: Alexander Binun, Ehud Gudes
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

Execution process in modern Web applications is usually represented as a partially ordered sequence of basic actions issued by a client (login, buy, exit, ect.; the login action usually precedes purchasing). Based on these actions, a finite automaton of fine-grained authorization checks, may be specified in a separate layer that is easily configurable for security needs of a particular application. In the Mobile case there may be two such state machines ¿ one performing state-based authorization checks of the application execution process and the other performing such checks for the mobile agent execution process. Authorization checks of these machines may be both state-based and policy based, and the policies should distinguish between human clients and mobile agents cases.We develop the framework to specify and enforce fine-grained state-based authorization checks of Web application execution, consisting of a Web browser (client) and a server. We adopt this framework to the Mobile case so that state machines representing fine-grained authorization checks of application and moobile agent execution are synchronized.
Decoupling congestion control and bandwidth allocation policy with application to high bandwidth-delay product networks
Authors: Dina Katabi
Venue:  (2003)

In this dissertation, we propose a new architecture for Internet congestion control that decouples the control of congestion from the bandwidth allocation policy. We show that the new protocol, called XCP, enables very large per-flow throughput (e.g., more than 1 Gb/s), which is unachievable using current congestion control. Additionally, we show via extensive simulations that XCP significantly improves the overall performance, reducing drop rate by three orders of magnitude, increasing utilization, decreasing queuing delay, and attaining fairness in a few RTTs. Using tools from control theory, we model XCP and demonstrate that, in steady state, it is stable for any capacity, delay, and number of sources. XCP does not maintain any per-flow state in routers and requires only a few CPU cycles per packet making it implementable in high-speed routers. Its flexible architecture facilitates the design and implementation of quality of service, such as guaranteed and proportional bandwidth allocations. Finally, XCP is amenable to gradual deployment. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
BON development tool
Authors: Ali Taleghani, Jonathan Ostroff
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Modeling languages enable developers to view large systems via diagrammatic notations, which can increase understanding. We present the plan for an Eclipse plug-in that is a CASE Tool for BON. Our tool supports class and collaboration diagrams, fully automated forward and reverse engineering and additionally ensures the consistency between separately constructed class and collaboration diagrams.
Prediction suffix trees for supervised classification of sequences
Authors: Christine Largeron-Leténo
Venue: Pattern Recognition Letters (2003)

This paper presents a statistical test and algorithms for patterns extraction and supervised classification of sequential data. First it defines the notion of prediction suffix tree (PST). This type of tree can be used to efficiently describe variable order chain. It performs better than the Markov chain of order L and at a lower storage cost. We propose an improvement of this model, based on a statistical test. This test enables us to control the risk of encountering different patterns in the model of the sequence to classify and in the model of its class. Applications to biological sequences are presented to illustrate this procedure. We compare the results obtained with different models (Markov chain of order L, Variable order model and the statistical test, with or without smoothing). We set out to show how the choice of the parameters of the models influences performance in these applications. Obviously these algorithms can be used in other fields in which the data are naturally ordered.
Simultaneous State, Vt and Tox Assignment for Total Standby Power Minimization
Authors: Dongwoo Lee, Harmander Deogun, David Blaauw, Dennis Sylvester
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Standby leakage current minimization is a pressing concern for mobile applications that rely on standby modes to extend battery life. Also, gate oxide leakage current (Igate) has become comparable to subthreshold leakage (Isub) in 90nm technologies. In this paper, we propose a new method that uses a combined approach of sleep-state, threshold voltage (Vt and gate oxide thickness (Tox) assignments in a dual-Vt and dual-Tox process to minimize both Isub and Igate. Using this method, total leakage current can be dramatically reduced since in a known state in standby mode, only certain transistors are responsible for leakage current and need to be considered for high-Vt or thick-Tox assignment. We formulate the optimization problem for simultaneous state, Vt and Tox assignments under delay constraints and propose two practical heuristics. We implemented and tested the proposed methods on a set of synthesized benchmark circuits. Results show an average leakage current reduction of 5-6Xand 2-3X compared to previous approaches that only use state or state+Vt assignment, respectively, with small delay penalties.
Inverting onto functions
Authors: Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers
Venue: Information and Computation (2003)

We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomial-time computable inverse. We show this hypothesis equivalent to several other complexity conjectures including: • In polynomial time, one can find accepting paths of nondeterministic polynomial-time Turing machines that accept Σ*. • Every total multivalued nondeterministic function has a polynomial-time computable refinement. • In polynomial time, one can compute satisfying assignments for any polynomial-time computable set of satisfiable formulae. • In polynomial time, one can convert the accepting computations of any nondeterministic Turing machine that accepts SAT to satisfying assignments.We compare these hypotheses with several other important complexity statements. We also examine the complexity of these statements where we only require a single bit instead of the entire inverse.
Poster abstract: cooperative tracking with binary-detection sensor networks
Authors: Kirill Mechitov, Sameer Sundresh, Youngmin Kwon, Gul Agha
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

We present a novel method for tracking the movement of people or vehicles in open outdoor environments using sensor networks. Unlike other sensor network-based methods, which depend on determining distance to the target or the angle of arrival of the signal, our cooperative tracking approach requires only that a sensor be able to determine if an object is somewhere within the maximum detection range of the sensor. We propose cooperative tracking as a method for tracking moving objects and extrapolating their paths in the short term. By combining data from neighboring sensors, this approach enables tracking with a resolution higher than that of the individual sensors being used. We employ statistical estimation and approximation techniques to further increase the tracking precision, and to enable the system to exploit the tradeoff between accuracy and timeliness of the results. We analyze the behavior of the cooperative tracking algorithm through simulation, focusing on the effects of approximation techniques on the quality of estimates achieved. This work focuses on acoustic tracking, however the presented methodology is applicable to any sensing modality where the sensing range is relatively uniform.
On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
Authors: V. Nikiforov
Venue: Combinatorics, Probability and Computing (2001)

We investigate the following problem of Erd&ouml;s:Determine the minimum number of k-cliques in a graph of order n with independence number &ge; l.We disprove the original conjecture of Erd&ouml;s which was stated in 1962 for all but a finite number of pairs k, l, and give asymptotic estimates for l = 3, k &ge; 4, and l = 4, k &ge; 4.
Learning Objects Based Framework for Self-Adaptive Learning
Authors: Yacine Atif, Rachid Benlamri, Jawad Berri
Venue: Education and Information Technologies (2003)

How learners can build their own knowledge, which is precisely tailored to their needs and background? This is precisely the question to which this paper attempts to answer by providing a framework for a flexible object-based e-learning environment. The paper recognizes that the general learner modeling alternative is an intractable problem. However, it suggests learning objects construct used as building blocks to root out individual learning deficiencies. The paper also provides an algorithm to construct individual learning routes that are adjusted to learners' profile as well as an open implementation to accommodate the integration of various learning sources.
Importance of Communication Influences on a Highly Collaborative Task
Authors: Oliver Otto, David Roberts
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Social interaction is a key driving force behind any team activity. Real time closely coupled interaction, where we quickly see the effect of our actions on others, is an important feature of social interaction. For example, smiling and returning a smile, shaking hands and passing a gift or business card are some of the most important interactions in the real world. Collaborative Virtual Environments (CVE) offer the potential for social interaction between geographically distributed groups. Closely coupled interaction is, however, very difficult in present CVE systems. This is because this medium lags behind real world communication in terms of representation, consistency and responsiveness.This paper takes a psychological perspective, describing how the primary forms of humancommunication in the real world map to those in the virtual. We discuss how each form of communication relates to the feeling of co-presence, giving real examples of behaviour observed an example application, the virtual gazebo. We present detailed results from user evaluation, focusing on the perceived importance of these influences on collaboration.
Linux Programming by Example: The Fundamentals
Authors: Arnold Robbins
Venue:  (2004)

Learn Linux(R) programming, hands-on"ï¾¦ from real source codeThis book teaches Linux programming in the most effective way possible: by showing and explaining well-written programs. Drawing from both V7 Unix(R) and current GNU source code, Arnold Robbins focuses on the fundamental system call APIs at the core of any significant program, presenting examples from programs that Linux/Unix users already use every day. Gradually, one step at a time, Robbins teaches both high-level principles and "under the hood" techniques. Along the way, he carefully addresses real-world issues like performance, portability, and robustness. Coverage includes: Memory management File I/O File metadata Processes Users and groups Sorting and searching Argument parsing Extended interfaces Signals Internationalization Debugging And more"ï¾¦Just learning to program? Switching from Windows(R)? Already developing with Linux but interested in exploring the system call interface further? No matter which, quickly and directly, this book will help you master the fundamentals needed to build serious Linux software.
Self-assembled computer architecture: design and fabrication theory
Authors: Russell M. Taylor
Venue:  (2003)

This dissertation explores the design and fabrication of massively-parallel computers using self-assembling electronic circuitry. A DNA-guided self-assembly method, inspired by discoveries in chemistry, materials science, and physics, is used to develop an argument for the feasibility of constructing complex circuitry. The fabrication yield of such a process is calculated. Together, these form the foundation for a discussion of the computer architectures and implementations that this self-assembling process enables. Simulations estimate the electrical performance of the components used in the self-assembly process. Traditional drift-diffusion simulations were used to evaluate a ring-gated field effect transistor and the results were applied to a circuit level simulation to evaluate specific circuit topologies. These circuits were then grouped into implementation level components (logic gates, memory elements, etc.) and used in an architecture-level behavior simulator. The electrical performance results enable an informed evaluation of higher-level computer designs that could be built using self-assembly. Estimates of the performance, including power consumption, of two architectures are presented. These architectures appear to be impractical without a self-assembling fabrication process and are shown to have remarkable advantages over conventional computing machines. These machines are estimated to be nearly three orders of magnitude faster than the fastest next-generation supercomputer (IBM BlueGene/L) on certain classes of problems.**This dissertation is multimedia (contains text and other applications not available in printed format), and includes a CD.
Horizontal communication: a style to compose control software
Authors: Rob van Ommering
Venue: Software&mdash;Practice Experience (2003)

Consumer products become more complex and diverse, integrating functions that were previously available only in separate products. We believe that to build such products efficiently, a compositional approach is required. While this is quite feasible in hardware, we would like to achieve the same in software, especially in the low-level software that drives the hardware. We found this to be possible, but only if we let software components communicate horizontally, exchanging information along software channels that mirror the hardware signal topology. In this paper a concrete protocol implementing this style of control is described and many examples are given of its use.
Performance Analysis for Multimedia CDMA Networks under the Received Power Minimization Model
Authors: Xiaoming Bo, Zujue Chen
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Performance analysis for multimedia code division multiple access (CDMA) networks under the received power minimization model is addressed in this paper. The received power minimization model considering intercell interference is formulated as a constrained optimization problem, based on which the system admission region is also defined. The handoff prioritized call admission scheme is then described and evaluated using the K-dimensional birth-death process model. A more general assumption that average channel holding times for new calls and handoff calls are not equal and an effective approximate model are adopted in the performance analysis. Numerical examples are given to demonstrate the system performance in terms of blocking probabilities and resource utilization. It is shown that the system performance meets the design objectives.
Krylov subspace methods for large-scale matrix problems in control
Authors: Biswa Nath Datta
Venue: Future Generation Computer Systems (2003)

This paper presents a brief but state-of-the-art survey of some of existing Krylov subspace methods for large-scale matrix problems in control. Based on the discussions and observations, some research problems are suggested.
Model checking LTL with regular valuations for pushdown systems
Authors: Javier Esparza, Antonín Kucera, Stefan Schwoon
Venue: Information and Computation (2003)

Recent works have proposed pushdown systems as a tool for analyzing programs with (recursive) procedures, and the model-checking problem for LTL has received special attention. However, all these works impose a strong restriction on the possible valuations of atomic propositions: whether a configuration of the pushdown system satisfies an atomic proposition or not can only depend on the current control state of the pushdown automaton and on its topmost stack symbol. In this paper we consider LTL with regular valuations: the set of configurations satisfying an atomic proposition can be an arbitrary regular language. The model-checking problem is solved via two different techniques, with an eye on efficiency. The resulting algorithms are polynomial in certain measures of the problem which are usually small, but can be exponential in the size of the problem instance. However, we show that this exponential blowup is inevitable. The extension to regular valuations allows to model problems in different areas; for instance, we show an application to the analysis of systems with checkpoints. We claim that our model-checking algorithms provide a general, unifying and efficient framework for solving them.
Resource allocation for guided parameter search applications on high-performance parallel computing environments
Authors: Marcio Faerman
Venue:  (2003)

Parametec study simulations, or parameter sweeps, represent an important and increasingly common class of applications which arise in many areas of engineering, including fields such as Computational Fluid Dynamics, Bioinformatics, Particle Physics, Protein Folding, etc. The efficient computation of parameter sweeps is an important challenge in computer science and has received a lot of attention. From a computational perspective, parameter sweeps are typically structured as sets of &ldquo;experiments&rdquo;, each of which is executed with a distinct set of input parameters. More specifically we can define a parameter sweep as a (large) set of &ldquo;independent&rdquo; tasks, meaning that there is no, or little, task inter-communication. In many cases parameter spaces can become so large that it is not feasible to compute them entirely, even on large-scale platforms. This is due both to extensive parameter value ranges and to high dimensionality of the parameter space itself. However, most users are interested in finding specific parameter space regions that match some criterion. Therefore, an appealing approach is to search the parameter space, which saves both time and compute resources. We call such applications Parameter Search Applications. When users or search algorithms are given the ability to actively interact with the ongoing search process, guiding the exploration of the parameter space, we denote such applications as Guided Parameter Search Applications (G-PSAs). In this dissertation we focus on compute resource allocation strategies that improve the performance of G-PSAs. We propose a number of strategies and present extensive simulation experiments, which demonstrate that prioritized resource allocation can improve the performance of G-PSAs substantially. Furthermore, our study spans different application and compute platform regimes, and thus provides understanding of which resource allocation strategies are effective in which settings. This understanding represents a critical advance as it is key to enable high performance G-PSAs in practice.
Practical verification techniques for wide-area routing
Authors: Nick Feamster
Venue: ACM SIGCOMM Computer Communication Review (2004)

Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "correct" operation of BGP. BGP's distributed dependencies cause small configuration mistakes or oversights to spur complex errors, which sometimes have devastating effects on global connectivity. These errors are often difficult to debug because they are sometimes only exposed by a specific message arrival pattern or failure scenario.This paper presents an approach to BGP verification that is primarily based on static analysis of router configuration. We argue that: (1) because BGP's a configuration affects its fundamental behavior, verification is a program analysis problem, (2) BGP's complex, dynamic interactions are difficult to abstract and impossible to enumerate, which precludes existing verification techniques, (3) because of BGP's flexible, policy-based configuration, some aspects of BGP configuration must be checked against a higher-level specification of intended policy, and (4) although static analysis can catch many configuration errors, simulation and emulation are also necessary to determine the precise scenarios that could expose errors at runtime. Based on these observations, we propose the design of a BGP verification tool, discuss how it could be applied in practice, and describe future research challenges.
Fractional differentiation for edge detection
Authors: B. Mathieu, P. Melchior, A. Oustaloup, Ch. Ceyral
Venue: Signal Processing (2003)

In image processing, edge detection often makes use of integer-order differentiation operators, especially order 1 used by the gradient and order 2 by the Laplacian. This paper demonstrates how introducing an edge detector based on noninteger (fractional) differentiation can improve the criterion of thin detection, or detection selectivity in the case of parabolic luminance transitions, and the criterion of immunity to noise, which can be interpreted in term of robustness to noise in general.
Symbolic transfer function-based approaches to certified compilation
Authors: Xavier Rival
Venue: ACM SIGPLAN Notices (2004)

We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to check that source and compiled programs present similar behaviors. This checking can be done either for a concrete semantic interpretation (Translation Validation) or for an abstract semantic interpretation (Invariant Translation) of the symbolic transfer functions. We propose to design a checking procedure at the concrete level in order to validate both the transformation and the translation of abstract invariants. The use of symbolic transfer functions makes possible a better treatment of compiler optimizations and is adapted to the checking of precise invariants at the assembly level. The approach proved successful in the implementation point of view, since it rendered the translation of very precise invariants on very large assembly programs feasible.
Evolutionary Synthesis of LogicCircuits Using Information Theory
Authors: Arturo Hernández Aguirre, Carlos A. Coello Coello
Venue: Artificial Intelligence Review (2003)

In this paper, we propose the use of Information Theory as the basis for designing a fitness function for Boolean circuit design using Genetic Programming. Boolean functions are implemented by replicating binary multiplexers. Entropy-based measures, such as Mutual Information and Normalized Mutual Information are investigated as tools for similarity measures between the target and evolving circuit. Three fitness functions are built over a primitive one. We show that the landscape of Normalized Mutual Information is more amenable for being used as a fitness function than simple Mutual Information. The evolutionary synthesized circuits are compared to the known optimum size. A discussion of the potential of the Information-Theoretical approach is given.