name stringlengths 5 6 | title stringlengths 8 144 | abstract stringlengths 0 2.68k | fulltext stringlengths 1.78k 95k | keywords stringlengths 22 532 |
|---|---|---|---|---|
569030 | Theorem Proving Guided Development of Formal Assertions in a Resource-Constrained Scheduler for High-Level Synthesis. | This paper presents a formal specification and a proof of correctness for the widely-used Force-Directed List Scheduling (FDLS) algorithm for resource-constrained scheduling of data flow graphs in high-level synthesis systems. The proof effort is conducted using a higher-order logic theorem prover. During the proof eff... | and often expensive ramifications since as they could lead to the synthesis and finally fabrication of incorrect designs.
Therefore, reliability and correctness of these tools have become important issues which need to be addressed.
Simulation has traditionally been used to check for correct operations of digital syste... | formal assertions;scheduler verification;formal synthesis;formal verfication;high-level synthesis;theorem proving |
569032 | Model Checking of Safety Properties. | Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Proof rules for the verification of safety properties have been developed in the proof-based approach to verification, making verification of safety properties simpler than verificatio... | Introduction
Today's rapid development of complex and safety-critical systems requires reliable verication
methods. In formal verication, we verify that a system meets a desired property by checking
that a mathematical model of the system meets a formal specication that describes the property.
Of special interest are p... | automata;safety properties;model checking |
569149 | Recent advances in direct methods for solving unsymmetric sparse systems of linear equations. | During the past few years, algorithmic improvements alone have reduced the time required for the direct solution of unsymmetric sparse systems of linear equations by almost an order of magnitude. This paper compares the performance of some well-known software packages for solving general sparse systems. In particular, ... | INTRODUCTION
Developing an efficient parallel, or even serial, direct solver for general unsymmetric
sparse systems of linear equations is a challenging task that has been a subject of
research for the past four decades. Several breakthroughs have been made during
this time. As a result, a number of serial and parallel... | Sparse Matrix Factorization;Sparse LU Decomposition;multifrontal method;Parallel Sparse Solvers |
569607 | A Chromatic Symmetric Function in Noncommuting Variables. | Stanley (i>Advances in Math. 111, 1995, 166194) associated with a graph i>G a symmetric function i>XG which reduces to i>G's chromatic polynomial {\cal X}_{G}(n) under a certain specialization of variables. He then proved various theorems generalizing results about {\cal X}_{G}(n), as well as new ones that cannot be in... | Introduction
Let G be a finite graph with verticies and edge set
E(G). We permit our graphs to have loops and multiple edges. Let XG (n) be the
chromatic polynomial of G, i.e., the number of proper colorings ng.
(Proper means that vw 2 E implies -(v) 6= -(w).)
In [12, 13], R. P. Stanley introduced a symmetric function,... | symmetric function in noncommuting variables;deletion-contraction;graph;chromatic polynomial |
569610 | Orthogonal Matroids. | The notion of matroid has been generalized to Coxeter matroid by Gelfand and Serganova. To each pair i>(W, P) consisting of a finite irreducible Coxeter group i>W and parabolic subgroup i>P is associated a collection of objects called Coxeter matroids. The (ordinary) matroids are the special case where i>W is the symme... | Introduction
.
Matroids, introduced by Hassler Whitney in 1935, are now a fundamental tool
in combinatorics with a wide range of applications ranging from the geometry of
Grassmannians to combinatorial optimization. In 1987 Gelfand and Serganova [9]
[10] generalized the matroid concept to the notion of Coxeter matroid.... | coxeter matroid;coxeter group;orthogonal matroid;bruhat order |
569795 | Nitsche type mortaring for some elliptic problem with corner singularities. | The paper deals with Nitsche type mortaring as a finite element method (FEM) for treating non-matching meshes of triangles at the interface of some domain decomposition. The approach is applied to the Poisson equation with Dirichlet boundary conditions (as a model problem) under the aspect that the interface passes re-... | Introduction
For the e-cient numerical treatment of boundary value problems (BVPs), domain decomposition
methods are widely used. They allow to work in parallel: generating the mesh in
subdomains, calculating the corresponding parts of the stiness matrix and of the right-hand
side, and solving the system of nite elemen... | corner singularities;finite element method;nitsche type mortaring;non-matching meshes;domain decomposition;mesh grading |
569859 | Using Hybrid Automata to Support Human Factors Analysis in a Critical System. | A characteristic that many emerging technologies and interaction techniques have in common is a shift towards tighter coupling between human and computer. In addition to traditional discrete interaction, more continuous interaction techniques, such as gesture recognition, haptic feedback and animation, play an increasi... | Introduction
The distinguishing feature of the modelling and specification of interactive systems is
the need to accommodate the user; for example, to formalise and analyse user require-
ments, and to conduct usability reasoning. The environment can also play a significant
role, as it can impose constraints on both the... | critical systems;hybrid automata;human factors |
569980 | A Theoretical Framework for Convex Regularizers in PDE-Based Computation of Image Motion. | Many differential methods for the recovery of the optic flow field from an image sequence can be expressed in terms of a variational problem where the optic flow minimizes some energy. Typically, these energy functionals consist of two terms: a data term, which requires e.g. that a brightness constancy assumption holds... | Introduction
Even after two decades of intensive research, robust motion estimation continues to be
a key problem in computer vision. Motion is linked to the notion of optic
ow, the
displacement eld of corresponding pixels in subsequent frames of an image sequence.
Optic
ow provides information that is important for ma... | differential methods;regularization;diffusion filtering;optic flow;well-posedness |
569987 | On the Performance of Connected Components Grouping. | Grouping processes may benefit computationally when simple algorithms are used as part of the grouping process. In this paper we consider a common and extremely fast grouping process based on the connected components algorithm. Relying on a probabilistic model, we focus on analyzing the algorithm's performance. In part... | Introduction
Perceptual grouping is an essential ingredient in various visual processes [WT83, Low85].
A major use of grouping is to accelerate recognition processes [Gri90, CJ91]. Many implementations
of grouping processes, however, take a large computational effort themselves, as
they use computational intensive algo... | quantitative predictions;perceptual organization;connected components algorithm;grouping performance analysis |
570169 | Edge Detection by Helmholtz Principle. | We apply to edge detection a recently introduced method for computing geometric structures in a digital image, without any a priori information. According to a basic principle of perception due to Helmholtz, an observed geometric structure is perceptually meaningful if its number of occurences would be very small in a ... | Introduction
In statistical methods for image analysis, one of the main problems is
the choice of an adequate prior. For example, in the Bayesian model
(Geman and Geman, 1984), given an observation \obs", the aim is to
nd the original \model" by computing the Maximum A Posteriori
(MAP) of
The term P [obsjmodel] represe... | edge detection;helmholtz principle;large deviations;perception;image analysis |
570189 | Simple termination of context-sensitive rewriting. | Simple termination is the (often indirect) basis of most existing automatic techniques for proving termination of rule-based programs (e.g., Knuth-Bendix, polynomial, or recursive path orderings, but also DP-simple termination, etc.). An interesting framework for such programs is context-sensitive rewriting (CSR) that ... | Introduction
Well-founded orderings (i.e., orderings allowing no infinite decreasing
sequence) provide a suitable basis for proving termination
in a number of programming languages and computational systems.
For instance, in term rewriting systems (TRS's) a proof of termination
can be achieved if we are able to find a ... | declarative programming;context-sensitive rewriting;modular program analysis and verification;automatic proofs of termination;evaluation strategies |
570235 | Computing Densities for Markov Chains via Simulation. | We introduce a new class of density estimators, termed look-ahead density estimators, for performance measures associated with a Markov chain. Look-ahead density estimators are given for both transient and steady-state quantities. Look-ahead density estimators converge faster (especially in multidimensional problems) a... | Introduction
Visualization is becoming increasingly popular as a means of enhancing one's understanding of a stochastic
system. In particular, rather than just reporting the mean of a distribution, one often finds that more
useful conclusions may be drawn by seeing the density of the underlying random variable.
We will... | density estimator;markov chain;simulation |
570391 | Answer set programming and plan generation. | The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answer set for this program. Applications of this method to planning are related to the line of research on... | Introduction
Kautz and Selman [19] proposed to approach the problem of plan generation
by reducing it to the problem of nding a satisfying interpretation for a set
of propositional formulas. This method, known as satisability planning,
is used now in several planners. 1 In this paper we discuss a related idea,
due to S... | answer sets;default logic;planning;frame problem;logic programming |
570392 | Fixed-parameter complexity in AI and nonmonotonic reasoning. | Many relevant intractable problems become tractable if some problem parameter is fixed. However, various problems exhibit very different computational properties, depending on how the runtime required for solving them is related to the fixed parameter chosen. The theory of parameterized complexity deals with such issue... | Introduction
Many hard decision or computation problems are known to become tractable if a problem parameter is fixed
or bounded by a fixed value. For example the well-known NP-hard problems of checking whether a graph has
a vertex cover of size at most k, and of computing such a vertex cover if so, become tractable if... | stable models;parameterized complexity;circumscription;prime implicants;logic programming;constraint satisfaction;conjunctive queries;fixed-parameter tractability;nonmonotonic reasoning |
570394 | Preference logic grammars. | The addition of preferences to normal logic programs is a convenient way to represent many aspects of default reasoning. If the derivation of an atom A1 is preferred to that of an atom A2, a preference rule can be defined so that A2 is derived only if A1 is not. Although such situations can be modelled directly using d... | Introduction
Context-free grammars (CFGs) have traditionally been used for specifying the syntax of a language,
while logic is generally the formalism of choice for specifying semantics (meaning). Logic grammars
combine these two notations, and can be used for specifying syntactic and semantic constraints in
a variety ... | non-monotonic reasoning;reasoning with preferences;logic programming;natural language processing;XSB |
570395 | Annotated revision programs. | Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence (probability) that a revision atom holds. The main goal of our paper is to reexamine t... | Introduction
Revision programming is a formalism to specify and enforce constraints on
databases, belief sets and, more generally, on arbitrary sets of elements. Revision
programming was introduced and studied in [MT95,MT98]. The formalism was
shown to be closely related to logic programming with stable model semantics... | database updates;annotated programs;belief revision;revision programming;knowledge representation |
570546 | Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol. | In this paper, we develop a specification methodology that documents and specifies a cache coherence protocol in eight tables: the states, events, actions, and transitions of the cache and memory controllers. We then use this methodology to specify a detailed, modern three-state broadcast snooping protocol with an unor... |
1. High-level specification for cache controller
Since, at a high level, cache coherence protocols are simply finite state machines, it would appear at first
glance that it would be easy to specify and verify a common three state (MSI) broadcast snooping protocol.
Unfortunately, at the level of detail required for an ... | memory consistency;protocol specification;cache coherence;protocol verification;multicast snooping |
570558 | Compact recognizers of episode sequences. | Given two strings X=a1...an and P=b1...bm over an alphabet , the problem of testing whether P occurs as a subsequence of X is trivially solved in linear time. It is also known that a simple O (n log ||) time preprocessing of X makes it easy to decide subsequently, for any P and in at most |P| log || character compariso... | Introduction
We consider the problem of detecting occurrences of a pattern string as a subsequence of a substring
of bounded length of a larger text string. Variants of this problem arise in numerous applications,
ranging from information retrieval and data mining (see, e.g., [10]) to molecular sequence analysis
(see, ... | compact subsequence automation;DAWG;skip-link;subsequence and episode searching;algorithms;suffix automation;skip-edge DAWG;forward failure function;pattern matching |
570575 | Finite variability interpretation of monadic logic of order. | We consider an interpretation of monadic second-order logic of order in the continuous time structure of finitely variable signals. We provide a characterization of the expressive power of monadic logic. As a by-product of our characterization we show that many fundamental theorems which hold in the discrete time inter... | Introduction
In the recent years systems whose behavior change in the continuous (real)
time were extensively investigated. Hybrid and control systems are prominent
examples of real time systems.
A run of a real time system is represented by a function from non-negative
reals into a set of values - the instantaneous st... | monadic logic of order;continuous time specification;definability |
570577 | Correspondence and translation for heterogeneous data. | Data integration often requires a clean abstraction of the different formats in which data are stored, and means for specifying the correspondences/relationships between data in different worlds and for translating data from one world to another. For that, we introduce in this paper a middleware data model that serves ... | Introduction
A primary motivation for new database technology is to provide support for the broad spectrum
of multimedia data available notably through the network. These data are stored under different
formats: SQL or ODMG (in databases), SGML or LaTex (documents), DX formats (scientific data),
Step (CAD/CAM data), et... | data integration;middleware model;translation;data correspondence |
570592 | Observational proofs by rewriting. | Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker (Hennicker, Formal Aspects of Computing 3(4) (1991) 326-345). We propose in this paper to embed Context Induction in the impli... | Introduction
Observational concepts are fundamental in formal methods since for proving
the correctness of a program with respect to a specication it is essential to
be able to abstract away from internal implementation details. Data objects
can be viewed as equal if they cannot be distinguished by experiments with
obs... | rewriting;induction;automated proofs;observational semantics |
570647 | Zero-interaction authentication. | Laptops are vulnerable to theft, greatly increasing the likelihood of exposing sensitive files. Unfortunately, storing data in a cryptographic file system does not fully address this problem. Such systems ask the user to imbue them with long-term authority for decryption, but that authority can be used by anyone who ph... | Figure
1: Decrypting File Encrypting Keys
not impose undue usability burdens or noticeably reduce
le system performance.
The main contribution of this paper is not the construction
of a cryptographic le system. Blaze's CFS [1], Zadok's
Cryptfs [32], and Microsoft's EFS [19] all address the archi-
tecture, administrati... | mobile computing;stackable file systems;transient authentication;cryptographic file systems |
570663 | On the interdependence of routing and data compression in multi-hop sensor networks. | We consider a problem of broadcast communication in a multi-hop sensor network, in which samples of a random field are collected at each node of the network, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jo... | Appendix
B)), for is the minimum amount of bits that should be transported through the
network to solve the transmission problem we are interested in.
C. Contributions and Paper Organization
The main ideas of this paper are: 1) to de?ne a model for the sensor data to derive the scaling law of
versus combining routing ... | routing;sensor networks;cross-layer interactions;multi-hop networks;source coding |
570664 | A two-tier data dissemination model for large-scale wireless sensor networks. | mobility brings new challenges to large-scale sensor networking. It suggests that information about each mobile sink's location be continuously propagated through the sensor field to keep all sensor nodes updated with the direction of forwarding future data reports. Unfortunately frequent location updates from multiple... | INTRODUCTION
Recent advances in VLSI, microprocessor and wireless communication
technologies have enabled the deployment of large-scale
sensor networks where thousands, or even tens of thousands
of small sensors are distributed over a vast eld to
obtain ne-grained, high-precision sensing data [9, 10, 15].
These sensor ... | two-tier model;sensor networks;sink mobility |
570684 | An on-demand secure routing protocol resilient to byzantine failures. | An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless links where nodes not in directrange can communicate via intermediate nodes. A common technique usedin routing protocols for ad hoc wireless networks is to establish therouting paths on-demand, as opposed to continua... | INTRODUCTION
Ad hoc wireless networks are self-organizing multi-hop
wireless networks where all the hosts (nodes) take part in
the process of forwarding packets. Ad hoc networks can
easily be deployed since they do not require any fixed in-
frastructure, such as base stations or routers. Therefore,
they are highly appl... | on-demand routing;ad hoc wireless networks;security;byzantine failures |
570688 | A distributed monitoring mechanism for wireless sensor networks. | In this paper we focus on a large class of wireless sensor networks that are designed and used for monitoring and surveillance. The single most important mechanism underlying such systems is the monitoring of the network itself, that is, the control center needs to be constantly made aware of the existence/health of al... | INTRODUCTION
The rapid advances in wireless communication technology
and micro-electromagnetic systems (MEMS) technology
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for profit or commercial ad... | wireless sensor networks;security;system design;monitor and surveillance |
570689 | Using signal processing to analyze wireless data traffic. | Experts have long recognized that theoretically it was possible to perform traffic analysis on encrypted packet streams by analyzing the timing of packet arrivals (or transmissions). We report on experiments to realize this possiblity using basic signal processing techniques taken from acoustics to perform traffic anal... | INTRODUCTION
Network security experts have long known that examining
even subtle timing information in a tra-c stream could, in
This work was sponsored by the Defense Advanced Re-search
Projects Agency (DARPA) under contract No.
MDA972-01-C-0080. Views and conclusions contained in
this document are those of the authors... | wireless networks;encryption;signal processing;traffic analysis |
570792 | Providing stochastic delay guarantees through channel characteristics based resource reservation in wireless network. | This paper is directed towards providing quality of service guarantees for transmission of multimedia traffic over wireless links. The quality of service guarantees require transmission of packets within prespecified deadlines. Oftentimes, bursty, location dependent channel errors preclude such deadline satisfaction le... | INTRODUCTION
Third generation wireless packet networks will have to
support real-time multimedia applications. The real-time
applications need Quality of Service (QoS) guarantees from
the network. One of the most important QoS requirements
is the packet delay, which specifies the upper bound on the
delay experienced by... | wireless networks;stochastic delay guarantees;connection admission control |
570814 | Asymptotically optimal geometric mobile ad-hoc routing. | In this paper we present AFR, a new geometric mobile ad-hoc routing algorithm. The algorithm is completely distributed; nodes need to communicate only with direct neighbors in their transmission range. We show that if a best route has cost c, AFR finds a route and terminates with cost &Ogr;(c2) in the worst case. AFR i... | INTRODUCTION
A mobile ad-hoc network consists of mobile nodes equipped
with a wireless radio. We think of mobile nodes as points in
the Euclidean plane. Two nodes can directly communicate
with each other if and only if they are within transmission
range of each other. Throughout this paper we assume that
all nodes have... | routing;geometric routing;face routing;wireless communication;unit disk graphs;ad-hoc networks |
570818 | Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. | The main contributions of this paper are two-fold. First, we present a simple, general framework for obtaining efficient constant-factor approximation algorithms for the mobile piercing set (MPS) problem on unit-disks for standard metrics in fixed dimension vector spaces. More specifically, we provide low constant appr... | Introduction
The mobile piercing set (MPS) problem is a variation of the (classical) piercing set problem that arises in
dynamic distributed scenarios. The MPS problem has many applications outside its main computational
geometry domain, as for example in mobile ad-hoc communication networks, as we will see later.
We s... | clustering;mobile ad-hoc networks;approximation algorithms;piercing set;distributed protocols |
570970 | The complexity of propositional linear temporal logics in simple cases. | It is well known that model checking and satisfiability for PLTL are PSPACE-complete. By contrast, very little is known about whether there exist some interesting fragments of PLTL with a lower worst-case complexity. Such results would help understand why PLTL model checkers are successfully used in practice. In this a... | INTRODUCTION
Background. PLTL is the standard linear-time propositional temporal logic
used in the specification and automated verification of reactive systems [MP92,
Eme90]. It is well-known that model checking and satisfiability for PLTL are
PSPACE-complete [SC85, HR83, Wol83]. This did not deter some research
groups... | model checking;computational complexity;temporal logic;logic in computer science;verification |
571159 | Towards a primitive higher order calculus of broadcasting systems. | Ethernet-style broadcast is pervasive style of computer communication.In this style,the medium is single nameless channel.Previous work on modelling such systems proposed .rst order process calculus called CBS.In this paper, we propose fundamentally different calculus called HOBS.Compared to CBS, HOBS 1) is higher orde... | INTRODUCTION
Ethernet-style broadcast is a pervasive style of computer
communication. The bare medium provided by the Ethernet
is a single nameless channel. Typically, more sophisticated
programming idioms such as point-to-point communication
or named channels are built on top of the Ethernet. But
using the Ethernet as... | semantics;ethernet;concurrency;broadcasting;calculi;programming languages |
571163 | Modular termination of context-sensitive rewriting. | Context-sensitive rewriting (CSR) has recently emerged as an interesting and flexible paradigm that provides a bridge between the abstract world of general rewriting and the (more) applied setting of declarative specification and programming languages such as OBJ*, CafeOBJ, ELAN, and Maude. A natural approach to study ... | INTRODUCTION
Programmers usually organize the programs into components
or modules. Components of a program are easier to de-
velop, analyze, debug, and test. Eventually, the programmer
wants that interesting computational properties like termination
hold for the whole program if they could be proved for
the individual ... | modular proofs of termination;declarative programming;context-sensitive rewriting;program verification;evaluation strategies;modular analysis and construction of programs |
571169 | Constraint-based mode analysis of mercury. | Recent logic programming languages, such as Mercury and HAL, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-time. Unfortunately, mode checking in such languages is difficult. One of the main reas... | INTRODUCTION
Logic programming languages have traditionally been untyped
and unmoded. In recent years, languages such as Mer-
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provided that copies are
not made or distributed for profit or commerci... | mode analysis;modes;boolean constraints |
571170 | Using the heap to eliminate stack accesses. | The value of a variable is often given by a field of a heap cell, and frequently the program will pick up the values of several variables from different fields of the same heap cell. By keeping some of these variables out of the stack frame, and accessing them in their original locations on the heap instead, we can red... | INTRODUCTION
Most compilers try to keep the values of variables in (per-
haps virtual) registers whenever possible. However, procedure
calls can (in the general case) modify the contents of
Permission to make digital or hard copies of all or part of this work for
personal or classroom use is granted without fee provide... | maximal matching;stack accesses;stack frames;heap cells |
571171 | Transforming the .NET intermediate language using path logic programming. | Path logic programming is a modest extension of Prolog for the specification of program transformations. We give an informal introduction to this extension, and we show how it can be used in coding standard compiler optimisations, and also a number of obfuscating transformations. The object language is the Microsoft .N... | INTRODUCTION
Optimisers, obfuscators and refactoring tools all need to
apply program transformations automatically. Furthermore,
for each of these applications it is desirable that one can
easily experiment with transformations, varying the applicability
conditions, and also the strategy by which transformations
are ap... | compiler optimisations;program analysis;obfuscation;logic programming;program transformation;meta programming |
571639 | Neural methods for dynamic branch prediction. | This article presents a new and highly accurate method for branch prediction. The key idea is to use one of the simplest possible neural methods, the perceptron, as an alternative to the commonly used two-bit counters. The source of our predictor's accuracy is its ability to use long history lengths, because the hardwa... | Figure
1: Perceptron Model. The input values , are propagated through the weighted connections by
taking their respective products with the weights . These products are summed, along with the bias
weight , to produce the output value .
4.1 How Perceptrons Work
The perceptron was introduced in 1962 [24] as a way to stu... | neural networks;branch prediction |
571650 | Modelling with implicit surfaces that interpolate. | We introduce new techniques for modelling with interpolating implicit surfaces. This form of implicit surface was first used for problems of surface reconstruction and shape transformation, but the emphasis of our work is on model creation. These implicit surfaces are described by specifying locations in 3D through whi... | We can create surfaces in 3D in exactly the same way as the 2D
curves in Figure 1. Zero-valued constraints are de?ned by the modeler
at 3D locations, and positive values are speci?ed at one or more
places that are to be interior to the surface. A variational interpolation
technique is then invoked that creates a scalar... | thin-plate techniques;modeling;implicit surfaces;function interpolation |
571723 | A game-theoretic approach towards congestion control in communication networks. | Most of the end-to-end congestion control schemes are "voluntary" in nature and critically depend on end-user cooperation. We show that in the presence of selfish users, all such schemes will inevitably lead to a congestion collapse. Router and switch mechanisms such as service disciplines and buffer management policie... | INTRODUCTION
Most of the end to end congestion control schemes [23,
17, 32, 26, 16] are voluntary in nature and critically depend
on end-user cooperation. The TCP congestion control algorithms
[23, 5, 20, 21, 19, 9] voluntarily reduce the sending
rate upon receiving a congestion signal such as ECN [25],
packet loss [14... | game theory;nash equilibrium;fairness;DWS;GPS;congestion control;stackelberg equilibrium;generalized processor sharing;RIS;scheduling;TCP |
571841 | Detectable byzantine agreement secure against faulty majorities. | It is well-known that n players, connected only by pairwise secure channels, can achieve Byzantine agreement only if the number t of cheaters satisfies t < n/3, even with respect to computational security. However, for many applications it is sufficient to achieve detectable broadcast. With this primitive, broadcast is... | INTRODUCTION
Broadcast (a.k.a. Byzantine agreement) is an important primitive
in the design of distributed protocols. A protocol with a
designated sender s achieves broadcast if it acts as a megaphone
for s: all other players will receive the message s sends, and
moreover if an honest player receives a message, then he... | byzantine agreement;multi-party computation;public-key infrastructure;broadcast;quantum signatures |
572328 | Self-similarity in the web. | Algorithmic tools for searching and mining the Web are becoming increasingly sophisticated and vital. In this context, algorithms that use and exploit structural information about the Web perform better than generic methods in both efficiency and reliability.We present an extensive characterization of the graph structu... | Introduction
As the the size of the web grows exponentially, data services on the web are becoming increasingly complex
and challenging tasks. These include both basic services such as searching and finding related pages, and
advanced applications such as web-scale data mining, community extraction, constructions of in... | World-Wide-Web;graph structure;fractal;online information services;web-based services;self-similarity |
581484 | Contracts for higher-order functions. | Assertions play an important role in the construction of robust software. Their use in programming languages dates back to the 1970s. Eiffel, an object-oriented programming language, wholeheartedly adopted assertions and developed the "Design by Contract" philosophy. Indeed, the entire object-oriented community recogni... | In this paper, we show how to support higher-order function contracts
in a theoretically well-founded and practically viable man-
ner. Specifically, we introduce lCON, a typed lambda calculus with
assertions for higher-order functions. The calculus models the assertion
monitoring system that we employ in DrScheme. We e... | predicate typing;higher-order functions;solfware reliability;contracts;behavioral specifications |
581487 | A demand-driven adaptive type analysis. | Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car in Scheme and hd in SML will include a run time check unless the compiler can prove that the argument is always a non-empty list using some t... | Introduction
Optimizing compilers typically consist of two components: a program
analyzer and a program transformer. The goal of the ana-
Permission to make digital or hard copies of all or part of this work for personal or
classroom use is granted without fee provided that copies are not made or distributed
for profit... | demand-driven analysis;type analysis;static analysis |
581498 | Meta-programming with names and necessity. | Meta-programming languages provide infrastructure to generate and execute object programs at run-time. In a typed setting, they contain a modal type constructor which classifies object code. These code types generally come in two flavors: closed and open. Closed code expressions can be invoked at run-time, but the comp... | Introduction
Meta-programming can be broadly defined as a discipline of algorithmic manipulation
of programs written in a certain object language, through a program written
in another (or meta) language. The operations on object programs that the meta
program may describe can be very diverse, and may include, among oth... | modal lambda-calculus;higher-order abstract syntax |
581499 | Tagless staged interpreters for typed languages. | Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of deriving an implementation that is both readable and efficient. In an untyped setting, staging an interpreter "removes a complete layer of inte... | Introduction
In recent years, substantial effort has been invested in the development
of both the theory and tools for the rapid implementation
of domain specific languages (DSLs) [4, 22, 40, 47, 45, 23]. DSLs
are formalisms that provide their users with a notation appropriate
for a specific family of tasks. A promisin... | calculus of constructions;definitional interpreters;multi-stage programming;domain-specific languages |
581642 | Bit section instruction set extension of ARM for embedded applications. | Programs that manipulate data at subword level, i.e. bit sections within a word, are common place in the embedded domain. Examples of such applications include media processing as well as network processing codes. These applications spend significant amounts of time packing and unpacking narrow width data into memory w... | INTRODUCTION
Programs for embedded applications frequently manipulate data
represented by bit sections within a single word. The need to operate
upon bit sections arises because such applications often involve
data which is smaller than a word, or even a byte. Moreover it is
also the characteristic of many such applica... | bit section operations;multimedia data;network processing |
581647 | Increasing power efficiency of multi-core network processors through data filtering. | We propose and evaluate a data filtering method to reduce the power consumption of high-end processors with multiple execution cores. Although the proposed method can be applied to a wide variety of multi-processor systems including MPPs, SMPs and any type of single-chip multiprocessor, we concentrate on Network Proces... | INTRODUCTION
Power has been traditionally a limited resource and one of the most
important design criteria for mobile processors and embedded
systems. Due in part to increased logic density, power dissipation in
high performance processors is also becoming a major design factor.
The increased number of transistors caus... | remote procedure call;chip multiprocessors;data locality;power reduction;network processors |
581691 | Template meta-programming for Haskell. | We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithmic construction of programs at compile-time.The ability to generate code at compile time allows the programmer to implement such features as ... | Introduction
"Compile-time program optimizations are similar to po-
etry: more are written than are actually published in
commercial compilers. Hard economic reality is that
many interesting optimizations have too narrow an audience
to justify their cost. An alternative is to allow
programmers to define their own compi... | meta programming;templates |
581774 | On the complexity analysis of static analyses. | This paper argues that for many algorithms, and static analysis algorithms in particular, bottom-up logic program presentations are clearer and simpler to analyze, for both correctness and complexity, than classical pseudo-code presentations. The main technical contribution consists of two theorems which allow, in many... | Introduction
This paper argues that for many algorithms, and static analysis algorithms in
particular, bottom-up logic program presentations are clearer and simpler to an-
alyze, for both correctness and complexity, than classical pseudo-code presenta-
tions. Most static analysis algorithms have natural representations... | models of computation;algorithms;program analysis;logic programming;programming languages;complexity analysis |
581775 | Formal verification of standards for distance vector routing protocols. | We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector proto... | Introduction
The aim of this paper is to study how methods of automated reasoning can
be used to prove properties of network routing protocols. We carry out three
case studies based on distance vector routing. In each such study we provide
a proof that is automated and formal in the sense that a computer aided the
cons... | network standards;formal verification;HOL;AODV;interactive theorem proving;routing protocols;SPIN;model checking;RIP;distance vector routing |
581851 | Hop integrity in computer networks. | A computer network is said to provide hop integrity iff when any router p in the network receives a message m supposedly from an adjacent router q, then p can check that m was indeed sent by q, was not modified after it was sent, and was not a replay of an old message sent from q to p. In this paper, we describe three ... | Introduction
Most computer networks suffer from the following
security problem: in a typical network, an adversary, that
has an access to the network, can insert new messages,
modify current messages, or replay old messages in the
network. In many cases, the inserted, modified, or
replayed messages can go undetected fo... | internet;router;network protocol;smurf attack;SYN attack;authentication;message replay;security;denial-of-service attack;message modification |
582068 | On using SCALEA for performance analysis of distributed and parallel programs. | In this paper we give an overview of SCALEA, which is a new performance analysis tool for OpenMP, MPI, HPF, and mixed parallel/distributed programs. SCALEA instruments, executes and measures programs and computes a variety of performance overheads based on a novel overhead classification. Source code and HW-profiling i... | Introduction
As hybrid architectures (e.g., SMP clusters) become the
mainstay of distributed and parallel processing in the
market, the computing community is busily developing
languages and software tools for such machines. Besides
OpenMP [27], MPI [13], and HPF [15], mixed programming
paradigms such as OpenMP/MPI are... | distributed and parallel systems;performance analysis;performance overhead classification |
582418 | Cumulated gain-based evaluation of IR techniques. | Modern large retrieval environments tend to overwhelm their users by their large output. Since all documents are not of equal relevance to their users, highly relevant documents should be identified and ranked first for presentation. In order to develop IR techniques in this direction, it is necessary to develop evalua... | 2. CUMULATED GAIN -BASED MEASUREMENTS
2.1 Direct Cumulated Gain
When examining the ranked result list of a query, it is obvious that:
highly relevant documents are more valuable than marginally relevant documents,
and
the greater the ranked position of a relevant document, the less valuable it is for the
user, because ... | cumulated gain;graded relevance judgments |
582473 | The Roma personal metadata service. | People now have available to them a diversity of digital storage facilities, including laptops, cell phone address books, handheld devices, desktop computers and web-based storage services. Unfortunately, as the number of personal data repositories increases, so does the management problem of ensuring that the most up-... | Introduction
As people come to rely more heavily on digital devices
to work and communicate, they keep more of their personal
files-including email messages, notes, presentations,
address lists, financial records, news clippings, music and
photographs-in a variety of data repositories. Since people
are free to switch a... | personal systems;metadata;distributed databases;mobile computing;data synchronization;distributed data storage |
583819 | Elimination of Java array bounds checks in the presence of indirection. | The Java language specification states that every access to an array needs to be within the bounds of that array; i.e. between 0 and array length 1. Different techniques for different programming languages have been proposed to eliminate explicit bounds checks. Some of these techniques are implemented in off-the-shelf ... | Introduction
The Java language [JSGB00] was specied to avoid the most common errors made by software
developers. Arguably, these are memory leaks, array indices out-of-bounds and type inconsis-
tencies. These features are the basic pillars that make Java an attractive language for software
development. On these basic p... | array bounds check;array indirection |
584517 | Combinations of Modal Logics. | There is increasing use of combinations of modal logics in both foundational and applied research areas. This article provides an introduction to both the principles of such combinations and to the variety of techniques that have been developed for them. In addition, the article outlines many key research problems yet ... | Introduction
Combining logics for modelling purposes has become a rapidly expanding enterprise that
is inspired mainly by concerns about modularity and the wish to join together different
kinds of information. As any interesting real world system is a complex, composite entity,
decomposing its descriptive requirements ... | modal logics;knowledge representation;logical reasoning |
584532 | Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. | Recently in Burer et al. (Mathematical Programming A, submitted), the authors of this paper introduced a nonlinear transformation to convert the positive definiteness constraint on an n n matrix-valued function of a certain form into the positivity constraint on n scalar variables while keeping the number of variables... | Introduction
Semidefinite programming (SDP) is a generalization of linear programming in which a
linear function of a matrix variable X is maximized or minimized over an affine subspace
Computational results reported in this paper were obtained on an SGI Origin2000 computer at Rice
University acquired in part with supp... | nonlinear programming;semidefinite program;interior-point methods;semidefinite relaxation |
584535 | Parallel Variable Distribution for Constrained Optimization. | In the parallel variable distribution framework for solving optimization problems (PVD), the variables are distributed among parallel processors with each processor having the primary responsibility for updating its block of variables while allowing the remaining secondary variables to change in a restricted fashion al... | AMS subject classications: 90C30, 49D27
1. Introduction and Motivation
We consider parallel algorithms for solving constrained optimization
problems
min
Research of the rst author is supported by CNPq and FAPERJ. The second author
is supported in part by CNPq Grant 300734/95-6, by PRONEX{Optimization,
and by FAPERJ.
c
... | projected gradient;constrained optimization;sequential quadratic programming;parallel optimization;variable distribution |
584552 | Language-Based Caching of Dynamically Generated HTML. | Increasingly, HTML documents are dynamically generated by interactive Web services. To ensure that the client is presented with the newest versions of such documents it is customary to disable client caching causing a seemingly inevitable performance penalty. In the <bigwig> system, dynamic HTML documents are composed ... | Introduction
One central aspect of the development of the World Wide Web during the last decade
is the increasing use of dynamically generated documents, that is, HTML documents
generated using e.g. CGI, ASP, or PHP by a server at the time of the request from
a client [21, 2]. Originally, hypertext documents on the Web... | HTML;caching;web services |
584575 | A multi-temperature multiphase flow model. | In this paper we formulate a multiphase model with nonequilibrated temperatures but with equal velocities and pressures for each species. Turbulent mixing is driven by diffusion in these equations. The closure equations are defined in part by reference to a more exact chunk mix model developed by the authors and cowork... | Introduction
Requirements of theromodynamic and mathematical consistency impose limits
on possible multiphase flow models. The length scales on which the mixing
occurs impose further restrictions, through limits on the range of physical
validity of these models. The models are distinguished by the dependent variables
a... | turbulence;multiphase flow |
584649 | Maximum Likelihood Estimation of Mixture Densities for Binned and Truncated Multivariate Data. | Binning and truncation of data are common in data analysis and machine learning. This paper addresses the problem of fitting mixture densities to multivariate binned and truncated data. The EM approach proposed by McLachlan and Jones (Biometrics, 44: 2, 571578, 1988) for the univariate case is generalized to multivaria... | Introduction
In this paper we address the problem of fitting mixture densities to multivariate
binned and truncated data. The problem is motivated by an application in medical
diagnosis where blood samples are taken from subjects. Typically each sample
contains about 40,000 different red blood cells. The volume and hem... | binned;iron deficiency anemia;KL-distance;truncated;mixture model;histogram |
584651 | Learning Recursive Bayesian Multinets for Data Clustering by Means of Constructive Induction. | This paper introduces and evaluates a new class of knowledge model, the recursive Bayesian multinet (RBMN), which encodes the joint probability distribution of a given database. RBMNs extend Bayesian networks (BNs) as well as partitional clustering systems. Briefly, a RBMN is a decision tree with component BNs at the l... | Introduction
One of the main problems that arises in a great variety of elds, including pattern
recognition, machine learning and statistics, is the so-called data clustering problem
[1, 3, 7, 14, 15, 22, 25]. Data clustering can be viewed as a data-partitioning problem,
where we partition data into dierent clusters ba... | bayesian networks;constructive induction;BC+EM method;EM algorithm;bayesian multinets;data clustering |
584669 | A Simple, Object-Based View of Multiprogramming. | Object-based sequential programming has had a major impact on software engineering. However, object-based concurrent programming remains elusive as an effective programming tool. The class of applications that will be implemented on future high-bandwidth networks of processors will be significantly more ambitious than ... | Introduction
Object-based sequential programming has had a major impact on software engineer-
ing. However, object-based concurrent programming remains elusive as an eective
programming tool. The class of applications that will be implemented on future
high-bandwidth networks of processors will be signicantly more ambi... | multiprogramming;concurrency;communicating processes;object-based programming;semaphore;distributed implementation |
584673 | Deriving Efficient Cache Coherence Protocols Through Refinement. | We address the problem of developing efficient cache coherence protocols for use in distributed systems implementing distributed shared memory (DSM) using message passing. A serious drawback of traditional approaches to this problem is that the users are required to state the desired coherence protocol at the level of ... | Introduction
With the growing complexity of concurrent systems, automated procedures for
developing protocols are growing in importance. In this paper, we are interested
in protocol refinement procedures, which we define to be those that accept high-level
specifications of protocols, and apply provably correct transfor... | DSM protocols;communication protocols;refinement |
584693 | Efficient generation of rotating workforce schedules. | Generating high-quality schedules for a rotating workforce is a critical task in all situations where a certain staffing level must be guaranteed, such as in industrial plants or police departments. Results from ergonomics (BEST, Guidelines for shiftworkers, Bulletin of European Time Studies No. 3, European Foundation ... | Introduction
Workforce scheduling is the assignment of employees to shifts or days-off for a given period of
time. There exist two main variants of this problem: rotating (or cyclic) workforce schedules and
noncyclic workforce schedules. In a rotating workforce schedule-at least during the planning
stage-all employees ... | constraint satisfaction;search;backtracking;workforce scheduling |
584756 | Numerical study of quantum resonances in chaotic scattering. | This paper presents numerical evidence that in quantum systems with chaotic classical dynamics, the number of scattering resonances near an energy E scales like h-(D(KE)+1)/2 as h 0. Here, KE denotes the subset of the energy surface bounded for all time under the flow generated by the classical Hamiltonian H and D (KE... | Introduction
Quantum mechanics identifies the energies of stationary
states in an isolated physical system with
the eigenvalues of its Hamiltonian operator. Because
of this, eigenvalues play a central role in
the study of bound states, such as those describing
the electronic structures of atoms and molecules. 1
When th... | scattering resonances;semiclassical asymptotics;chaotic trapping;fractal dimension |
584802 | Topic-oriented collaborative crawling. | A major concern in the implementation of a distributed Web crawler is the choice of a strategy for partitioning the Web among the nodes in the system. Our goal in selecting this strategy is to minimize the overlap between the activities of individual nodes. We propose a topic-oriented approach, in which the Web is part... | INTRODUCTION
A crawler is a program that gathers resources from the
Web. Web crawlers are widely used to gather pages for
indexing by Web search engines [12, 23], but may also be
used to gather information for Web data mining [16, 20],
for question answering [14, 28], and for locating pages with
specific content [1, 9]... | distributed systems;text categorization;web crawling |
584816 | Query processing of streamed XML data. | We are addressing the efficient processing of continuous XML streams, in which the server broadcasts XML data to multiple clients concurrently through a multicast data stream, while each client is fully responsible for processing the stream. In our framework, a server may disseminate XML fragments from multiple documen... | Introduction
1.1 Motivation
XML [31] has emerged as the leading textual language for representing and exchanging data on the web.
Even though HTML is still the dominant format for publishing documents on the web, XML has become the
prevalent exchange format for business-to-business transactions and for enterprise Intra... | query optimization;databases;XML;query processing |
584876 | Inferring hierarchical descriptions. | We create a statistical model for inferring hierarchical term relationships about a topic, given only a small set of example web pages on the topic, without prior knowledge of any hierarchical information. The model can utilize either the full text of the pages in the cluster or the context of links to the pages. To su... | INTRODUCTION
Starting with a set of documents, it is desirable to infer automatically
various information about that set. Information
such as a meaningful name or some related concepts may
be useful for searching or analysis. This paper presents a
simple model that identifies meaningful classes of features
to promote u... | web analysis;statistical models;hierarchical relationships;feature selection;cluster naming |
584877 | Evaluation of hierarchical clustering algorithms for document datasets. | Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In particular, hierarchical clustering solutions provide a view of the data at different levels of ... | Introduction
Hierarchical clustering solutions, which are in the form of trees called dendrograms, are of great interest for a number
of application domains. Hierarchical trees provide a view of the data at different levels of abstraction. The consistency
of clustering solutions at different levels of granularity allow... | partitional clustering;agglomerative clustering;hierarchical clustering |
585199 | Compactly supported radial basis functions for shallow water equations. | This paper presents the application of the compactly supported radial basis functions (CSRBFs) in solving a system of shallow water hydrodynamics equations. The proposed scheme is derived from the idea of piecewise polynomial interpolation using a function of Euclidean distance. The compactly supported basis functions ... | Introduction
In marine environments eld monitoring programs are often limited in their ability
to measure spatial and temporal variations in data. This scarcity of information
and a lack of known data about biological and physical phenomenon make
studying these variables extremely di-cult. Because of the complicated in... | hydrodynamic equation;RBF;compact support |
585270 | Alternating-time temporal logic. | Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by the execution of a system; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of... | Introduction
In 1977, Pnueli proposed to use linear-time temporal
logic (LTL) to specify requirements for reactive
systems [Pnu77]. A formula of LTL is interpreted
over a computation, which is an infinite sequence of
states. A reactive system satisfies an LTL formula if
all its computations do. Due to the implicit use ... | games;temporaxl logic;alternation;model checking |
585435 | A Two-Variable Fragment of English. | Controlled languages are regimented fragments of natural language designed to make the processing of natural language more efficient and reliable. This paper defines a controlled language, E2V, whose principal grammatical resources include determiners, relative clauses, reflexives and pronouns. We provide a formal synt... | Introduction
Controlled languages are regimented fragments of natural language
designed to make the processing of natural language more ecient
and reliable. Although work on controlled languages was originally
motivated by the need to produce uniform and easily translatable
technical documentation, attention has recent... | controlled languages;two-variable fragment;logic;specification;natural language |
585500 | Automated discovery of concise predictive rules for intrusion detection. | This paper details an essential component of a multi-agent distributed knowledge network system for intrusion detection. We describe a distributed intrusion detection architecture, complete with a data warehouse and mobile and stationary agents for distributed problem-solving to facilitate building, monitoring, and ana... | The AAFID group at Purdues COAST project has
prototyped an agent-based intrusion detection system.
Their paper analyzes the agent-based approach to intrusion
detection and mentions the prototype work that
has been done on AAFID (Balasubramaniyan et al.,
1998). Our project diers from AAFID in that we are
using data mini... | intrusion detection;feature subset selection;machine learning |
585661 | A Survey of Optimization by Building and Using Probabilistic Models. | This paper summarizes the research on population-based probabilistic search algorithms based on modeling promising solutions by estimating their probability distribution and using the constructed model to guide the exploration of the search space. It settles the algorithms in the field of genetic and evolutionary compu... | Introduction
Recently, a number of evolutionary algorithms that guide the exploration of the search space by
building probabilistic models of promising solutions found so far have been proposed. These algorithms
have shown to perform very well on a wide variety of problems. However, in spite of a few
attempts to do so,... | genetic algorithms;genetic and evolutionary computation;stochastic optimization;decomposable problems;model building |
585663 | Fast Global Optimization of Difficult Lennard-Jones Clusters. | The minimization of the potential energy function of Lennard-Jones atomic clusters has attracted much theoretical as well as computational research in recent years. One reason for this is the practical importance of discovering low energy configurations of clusters of atoms, in view of applications and extensions to mo... | Introduction
One of the simplest to describe yet most difficult to solve problems
in computational chemistry is the automatic determination of molecular
conformation. A molecular conformation problem can be described
c
2000 Kluwer Academic Publishers. Printed in the Netherlands.
as that of finding the global minimum of... | lennard-jones clusters;global optimization;molecular conformation |
585761 | Minimal hierarchical collision detection. | We present a novel bounding volume hierarchy that allows for extremely small data structure sizes while still performing collision detection as fast as other classical hierarchical algorithms in most cases. The hierarchical data structure is a variation of axis-aligned bounding box trees. In addition to being very memo... | INTRODUCTION
Fast and exact collision detection of polygonal objects undergoing
rigid motions is at the core of many simulation algorithms
in computer graphics. In particular, virtual reality
applications such as virtual prototyping need exact collision
detection at interactive speed for very complex, arbitrary
Permiss... | physically-based modeling;hierarchical partitioning;virtual prototyping;hierarchical data structures;r-trees;interference detection |
585788 | Orienting polyhedral parts by pushing. | A common task in automated manufacturing processes is to orient parts prior to assembly. We consider sensorless orientation of an asymmetric polyhedral part by a sequence of push actions, and show that is it possible to move any such part from an unknown initial orientation into a known final orientation if these actio... | Introduction
An important task in automated assembly is orienting parts prior to assembly.
A part feeder takes in a stream of identical parts in arbitrary orientations and
outputs them in a uniform orientation. Usually, part feeders use data obtained
from some kind of sensing device to accomplish their task. We conside... | robotics;sensorless part feeding;planning |
585789 | Polygon decomposition for efficient construction of Minkowski sums. | Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decomposing polygons by their suitability for efficient construction of Minkowski sums. We study and experiment with various well-known decompositio... | Introduction
Given two sets P and Q in IR 2 , their Minkowski sum (or vector sum), denoted by P Q,
is the set fp Qg. Minkowski sums are used in a wide range of applications,
including robot motion planning [26], assembly planning [16], computer-aided design and
P.A. is supported by Army Research O-ce MURI grant DAAH04-... | minkowski sum;experimental results;convex decomposition;polygon decomposition |
585815 | Rational | Under general conditions, linear decision rules of agents with rational expectations are equivalent to restricted error corrections. However, empirical rejections of rational expectation restrictions are the rule, rather than the exception, in macroeconomics. Rejections often are conditioned on the assumption that agen... | dismal. A survey of existent journal publications by Ericsson and Irons (1995) summarizes an
extensive accumulation of empirical evidence against rational expectations, including frequent
rejections of rational expectations overidentifying restrictions. A review of policy simulation
models used by central banks and int... | error correction;producer pricing;companion systems;rational expectations |
586118 | Efficient, DoS-resistant, secure key exchange for internet protocols. | We describe JFK, a new key exchange protocol, primarily designed for use in the IP Security Architecture. It is simple, efficient, and secure; we sketch a proof of the latter property. JFK also has a number of novel engineering parameters that permit a variety of trade-offs, most notably the ability to balance the need... | Simplicity: The resulting protocol must be as simple as possible,
within the constraints of the requirements.
The Security requirement is obvious enough (we use the security
model of [7, 8]). The rest, however, require some discussion.
The PFS property is perhaps the most controversial. (PFS is
an attribute of encrypte... | cryptography;denial of service attacks |
586129 | Sensor-based intrusion detection for intra-domain distance-vector routing. | Detection of routing-based attacks is difficult because malicious routing behavior can be identified only in specific network locations. In addition, the configuration of the signatures used by intrusion detection sensors is a time-consuming and error-prone task because it has to take into account both the network topo... | INTRODUCTION
Attacks against the IP routing infrastructure can be used
to perform substantial denial-of-service attacks or as a basis
for more sophisticated attacks, such as man-in-the-middle
and non-blind-spoofing attacks. Given the insecure nature
of the routing protocols currently in use, preventing these
attacks re... | routing security;intrusion detection;network topology |
586145 | Mimicry attacks on host-based intrusion detection systems. | We examine several host-based anomaly detection systems and study their security against evasion attacks. First, we introduce the notion of a mimicry attack, which allows a sophisticated attacker to cloak their intrusion to avoid detection by the IDS. Then, we develop a theoretical framework for evaluating the security... | INTRODUCTION
The goal of an intrusion detection system (IDS) is like
that of a watchful burglar alarm: if an attacker manages to
penetrate somehow our security perimeter, the IDS should
set alarms so that a system administrator may take appropriate
action. Of course, attackers will not necessarily
cooperate with us in ... | evasion attacks;host-based intrusion detection;anomaly detection |
586237 | Database support for evolving data in product design. | We argue that database support for design processes is still inadequate, despite the many transaction models that have been put forth to fill this deficiency. In our opinion, substantial improvement is not to be gained by introducing yet another transaction model, but by questioning the basic paradigm of transaction pr... | Introduction
Product design, like most other business processes today,
requires database support for all but the most simple under-
takings. Yet, design processes differ from ordinary business
processes in that they are not easily decomposable
into a series of independent steps that would lend themselves
to the ACID pa... | constraints;concurrent design;databases;consistency |
586293 | A TACOMA retrospective. | For seven years, the TACOMA project has investigated the design and implementation of software support for mobile agents. A series of prototypes has been developed, with experiences in distributed applications driving the effort. This paper describes the evolution of these TACOMA prototypes, what primitives each suppor... | Introduction
In the Tacoma project, our primary mode of investigation has been to build
prototypes, use them to construct applications, reflect on the experience,
and then move on. None of the systems we built were production-quality
# Department of Computer Science, University of Troms-, Norway.Tacoma This work
was su... | agent integrity;wrappers;distributed applications;mobile agent system;communication and synchronization of agents;weak mobility;mobile code |
586450 | Principles of component-based design of intelligent agents. | Compositional multi-agent system design is a methodological perspective on multi-agent system design based on the software engineering principles process and knowledge abstraction, compositionality, reuse, specification and verification. This paper addresses these principles from a generic perspective in the context of... | Introduction
The area of Component-Based Software Engineering is currently a well-developed area of
research within Software Engineering; e.g., [15], [27], [42], [43]. More specific approaches
to component-based design of agents are often restricted to object-oriented implementation
environments, usually based on Java ... | generic model;agent;reuse;component-based;design |
586463 | Parallelizing the Data Cube. | This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one for top-down and one for bottom-up cube algorithms. Both partitioning strategies assign subcubes to individual processors in such a way that t... | Figure
1. A 4-dimensional lattice.
is aggregated over all distinct combinations over AB. A group-by is a child of some parent
group-by if the child can be computed from the parent by aggregating some of its
attributes. Parent-child relationships allow algorithms to share partitions, sorts, and partial
sorts between di... | OLAP;partitioning;load balancing;parallel processing;data cube |
586511 | A unifying approach to goal-directed evaluation. | Goal-directed evaluation, as embodied in Icon and Snobol, is built on the notions of backtracking and of generating successive results, and therefore it has always been something of a challenge to specify and implement. In this article, we address this challenge using computational monads and partial evaluation.We cons... | Introduction
Goal-directed languages combine expressions that can yield multiple results
through backtracking. Results are generated one at a time: an expression can
either succeed and generate a result, or fail. If an expression fails, control is
passed to a previous expression to generate the next result, if any. If ... | continuations;evaluation computational monads;run-time code generation;code templates;type-directed partial evaluation |
586615 | Spatially adaptive splines for statistical linear inverse problems. | This paper introduces a new nonparametric estimator based on penalized regression splines for linear operator equations when the data are noisy. A local roughness penalty that relies on local support properties of B-splines is introduced in order to deal with spatial heterogeneity of the function to be estimated. This ... | INTRODUCTION
Statistical linear inverse problems consist of indirect noisy observations
of a parameter (a function generally) of interest. Such problems occur
in many areas of science such as genetics with DNA sequences (Mendel-
sohn and Rice 1982), optics and astronomy with image restoration (Craig
and Brown 1986), bi... | deconvolution;convergence;linear inverse problems;regularization;local roughness penalties;spatially adaptive estimators;regression splines;integral equations |
586618 | The deepest regression method. | Deepest regression (DR) is a method for linear regression introduced by P. J. Rousseeuw and M. Hubert (1999, J. Amer. Statis. Assoc. 94, 388-402). The DR method is defined as the fit with largest regression depth relative to the data. In this paper we show that DR is a robust method, with breakdown value that converges... | Introduction
Consider a dataset Z ng ae IR p . In linear regression
we want to fit a hyperplane of the form
. We denote the x-part of each data point z i by x . The
residuals of Z n relative to the fit ' are denoted as r
To measure the quality of a fit, Rousseeuw and Hubert [16] introduced the notion of
regression dept... | algorithm;regression depth;inference |
586635 | Geometry and Color in Natural Images. | Most image analysis algorithms are defined for the grey level channel, particularly when geometric information is looked for in the digital image. We propose an experimental procedure in order to decide whether this attitude is sound or not. We test the hypothesis that the essential geometric contents of an image is co... | Introduction
: color from different angle
In this paper, we shall first review briefly some of the main and attitudes
adopted towards color in art and science (Section 1) We then focus on image
analysis algorithms and define some of the needed terminology (Section 2),
in particular the topographic map : we support the... | color images;luminance constraint;level sets;morphological filtering |
586762 | The algebra and combinatorics of shuffles and multiple zeta values. | The algebraic and combinatorial theory of shuffles, introduced by Chen and Ree, is further developed and applied to the study of multiple zeta values. In particular, we establish evaluations for certain sums of cyclically generated multiple zeta values. The boundary case of our result reduces to a former conjecture of ... | INTRODUCTION
We continue our study of nested sums of the form
Y
commonly referred to as multiple zeta values [2, 3, 4, 11, 12, 16, 19]. Here
and throughout, s are positive integers with s 1 ? 1 to ensure
convergence.
44 D. BOWMAN & D. M. BRADLEY
There exist many intriguing results and conjectures concerning values
of (... | lie algebra;iterated integral;multiple zeta value;shuffle |
586803 | Hydrodynamical methods for analyzing longest increasing subsequences. | Let Ln be the length of the longest increasing subsequence of a random permutation of the numbers 1 .... , n, for the uniform distribution on the set of permutations. We discuss the "hydrodynamical approach" to the analysis of the limit behavior, which probably started with Hammersley (Proceedings of the 6th Berkeley S... | Introduction
In recent years quite spectacular advances have been made with respect to the distribution theory
of longest increasing subsequences L n of a random permutation of the numbers 1, . , n, for the
uniform distribution on the set of permutations. Recent reviews of this work are given in Aldous
and Diaconis (19... | ulam's problem;longest increasing subsequence;hammersley's process |
586837 | Some multilevel methods on graded meshes. | We consider Yserentant's hierarchical basis method and multilevel diagonal scaling method on a class of refined meshes used in the numerical approximation of boundary value problems on polygonal domains in the presence of singularities. We show, as in the uniform case, that the stiffness matrix of the first method has ... | Introduction
The solution of boundary value problems (b.v.p.) in non-smooth domains presents singularities
in the neighbourhood of singular points of the boundary, e.g. in the neighbourhood
of re-entrant corners. Consequently, the use of uniform finite element meshes yields a poor
rate of convergence. Many authors prop... | graded meshes;finite element discretizations;multilevel methods;mesh refinement |
586856 | Adaptive and Efficient Algorithms for Lattice Agreement and Renaming. | In a shared-memory system, n independent asynchronous processes, with distinct names in the range {0, ..., N-1}, communicate by reading and writing to shared registers. An algorithm is wait-free if a process completes its execution regardless of the behavior of other processes. This paper considers wait-free algorithms... | Introduction
. An asynchronous shared-memory system contains n processes
running at arbitrary speeds and communicating by reading from and writing to shared
registers; processes have distinct names in the range In a wait-free
algorithm, a process terminates in a finite number of steps, even if other processes
are very ... | atomic read/write registers;lattice agreement;shared-memory systems;wait-free computation;renaming;atomic snapshots |
586857 | Approximating the Throughput of Multiple Machines in Real-Time Scheduling. | We consider the following fundamental scheduling problem. The input to the problem consists of n jobs and k machines. Each of the jobs is associated with a release time, a deadline, a weight, and a processing time on each of the machines. The goal is to find a nonpreemptive schedule that maximizes the weight of jobs th... | Introduction
We consider the following fundamental scheduling problem. The input to the problem consists of
n jobs and k machines. Each of the jobs is associated with a release time, a deadline, a weight,
and a processing time on each of the machines. The goal is to nd a schedule that maximizes the
weight of the jobs t... | parallel machines scheduling;approximation algorithms;throughput;multiple machines scheduling;scheduling;real-time scheduling |
586858 | Checking Approximate Computations of Polynomials and Functional Equations. | A majority of the results on self-testing and correcting deal with programs which purport to compute the correct results precisely. We relax this notion of correctness and show how to check programs that compute only a numerical approximation to the correct answer. The types of programs that we deal with are those comp... | Introduction
Program checking was introduced by Blum and Kannan [BK89] in order to allow one to use
a program safely, without having to know apriori that the program is correct on all inputs.
Related notions of self-testing and self-correcting were further explored in [BLR93, Lip91].
These notions are seen to be powerf... | program testing;polynomials;property testing;approximate testing;functional equations |
586859 | Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model. | The j-state general Markov model of evolution (due to Steel) is a stochastic model concerned with the evolution of strings over an alphabet of size j. In particular, the two-state general Markov model of evolution generalizes the well-known Cavender--Farris--Neyman model of evolution by removing the symmetry restrictio... | Introduction
The j-State General Markov Model of Evolution was proposed by Steel in 1994 [14]. The
model is concerned with the evolution of strings (such as DNA strings) over an alphabet of
size j . The model can be described as follows. A j-State Markov Evolutionary Tree consists
of a topology (a rooted tree, with edg... | learning of distributions;evolutionary trees;PAC-learning;markov model;computational learning theory |
586866 | On-Line Load Balancing in a Hierarchical Server Topology. | In a hierarchical server environment jobs are to be assigned in an on-line fashion to a collection of servers which form a hierarchy of capability: each job requests a specific server meeting its needs, but the system is free to assign it either to that server or to any other server higher in the hierarchy. Each job ca... | Introduction
. One of the most basic on-line load-balancing problems is the
following. Jobs arrive one at a time and each must be scheduled on one of n servers.
Each job has a certain load associated with it and a subset of the servers on which it
may be scheduled. The goal is to assign jobs to servers so as to minimiz... | hierarchical servers;temporary jobs;load balancing;resource procurement;on-line algorithms |
586883 | Resource-Bounded Kolmogorov Complexity Revisited. | We take a fresh look at CD complexity, where CDt(x) is the size of the smallest program that distinguishes x from all other strings in time t(|x|). We also look at CND complexity, a new nondeterministic variant of CD complexity, and time-bounded Kolmogorov complexity, denoted by C complexity.We show several results rel... | Introduction
Originally designed to measure the randomness of strings, Kolmogorov complexity has become an
important tool in computability and complexity theory. A simple lower bound showing that there
exist random strings of every length has had several important applications (see [LV93, Chapter
6]).
Early in the hist... | kolmogorov complexity;CD complexity;computational complexity |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.