aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
cs0703138 | 2949715023 | Reinforcement learning means learning a policy--a mapping of observations into actions--based on feedback from the environment. The learning can be viewed as browsing a set of policies while evaluating them by trial through interaction with the environment. We present an application of gradient ascent algorithm for rei... | Wolpert, Tumer and Frank @cite_1 construct a formalism for the so-called Collective Intelligence ( coin )neural net applied to Internet traffic routing. The approach involves automatically initializing and updating the local utility functions of individual rl agents (nodes) from the global utility and observed local dy... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2126306851"
],
"abstract": [
"A COllective INtelligence (COIN) is a set of interacting reinforcement learning (RL) algorithms designed in an automated fashion so that their collective behavior optimizes a global utility function. We summarize the theory of COIN... |
cs0703138 | 2949715023 | Reinforcement learning means learning a policy--a mapping of observations into actions--based on feedback from the environment. The learning can be viewed as browsing a set of policies while evaluating them by trial through interaction with the environment. We present an application of gradient ascent algorithm for rei... | Applying reinforcement learning to communication often involves optimizing performance with respect to multiple criteria. For a recent discussion on this challenging issue see Shelton @cite_11 . In the context of wireless communication it was addressed by Brown @cite_17 who considers the problem of finding a power mana... | {
"cite_N": [
"@cite_17",
"@cite_11"
],
"mid": [
"2157758004",
"2033976720"
],
"abstract": [
"This paper examines the application of reinforcement learning to a wireless communication problem. The problem requires that channel utility be maximized while simultaneously minimizing battery us... |
cs0703138 | 2949715023 | Reinforcement learning means learning a policy--a mapping of observations into actions--based on feedback from the environment. The learning can be viewed as browsing a set of policies while evaluating them by trial through interaction with the environment. We present an application of gradient ascent algorithm for rei... | Subramanian, Druschel and Chen @cite_12 adopt an approach from ant colonies that is very similar in spirit. The individual hosts in their network keep routing tables with the associated costs of sending a packet to other hosts (such as which routers it has to traverse and how expensive they are). These tables are perio... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2171299282"
],
"abstract": [
"We investigate two new distributed routing algorithms for data networks based on simple biological \"ants\" that explore the network and rapidly learn good routes, using a novel variation of reinforcement learning. These two algor... |
cs0703156 | 2950341706 | In case-based reasoning, the adaptation of a source case in order to solve the target problem is at the same time crucial and difficult to implement. The reason for this difficulty is that, in general, adaptation strongly depends on domain-dependent knowledge. This fact motivates research on adaptation knowledge acquis... | @cite_0 , the idea of @cite_12 is reused to extend the approach of @cite_4 : some learning algorithms (in particular, C4.5) are applied to the adaptation cases of @math , to induce general adaptation knowledge. | {
"cite_N": [
"@cite_0",
"@cite_4",
"@cite_12"
],
"mid": [
"1526119037",
"",
"1498118703"
],
"abstract": [
"Design is a complex open-ended task and it is unreasonable to expect a case-base to contain representatives of all possible designs. Therefore, adaptation is a desirable capa... |
cs0702151 | 1670047909 | A streaming model is one where data items arrive over long period of time, either one item at a time or in bursts. Typical tasks include computing various statistics over a sliding window of some fixed time-horizon. What makes the streaming model interesting is that as the time progresses, old items expire and new ones... | Datar, Gionis, Indyk and Motwani @cite_19 pioneered the research in this area, presenting exponential histograms, effective and simple solutions for a wide class of functions over sliding windows. In particular, they gave a memory-optimal algorithm for count, sum, average, @math and other functions. Gibbons and Tirthap... | {
"cite_N": [
"@cite_18",
"@cite_33",
"@cite_41",
"@cite_48",
"@cite_29",
"@cite_39",
"@cite_24",
"@cite_19",
"@cite_43",
"@cite_23",
"@cite_2",
"@cite_46"
],
"mid": [
"2152637787",
"2007025103",
"",
"",
"1965972569",
"2600017706",
"",
... |
cs0702030 | 1616730662 | This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate constraint of R bps for each transmission, how many frequency slots N of size W N should the band be partitioned into to maxim... | The transmission capacity framework introduced in @cite_3 is used to quantify the throughput of such a network, since this metric captures notions of spatial density, data rate, and outage probability, and is more amenable to analysis than the more popular transport capacity @cite_5 . Using tools from stochastic geomet... | {
"cite_N": [
"@cite_5",
"@cite_6",
"@cite_3"
],
"mid": [
"2137775453",
"2118166339",
"2095796369"
],
"abstract": [
"When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput spl lambd... |
cs0702030 | 1616730662 | This paper addresses the following question, which is of interest in the design and deployment of a multiuser decentralized network. Given a total system bandwidth of W Hz and a fixed data rate constraint of R bps for each transmission, how many frequency slots N of size W N should the band be partitioned into to maxim... | The problem studied in this work is essentially the optimization of frequency reuse in uncoordinated spatial (ad hoc) networks, which is a well studied problem in the context of cellular networks (see for example @cite_1 and references therein). In both settings the tradeoff is between the bandwidth utilized per cell t... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2145417574"
],
"abstract": [
"From the Publisher: The indispensable guide to wireless communicationsnow fully revised and updated! Wireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications techno... |
cs0702078 | 2953373266 | We present a local algorithm for finding dense subgraphs of bipartite graphs, according to the definition of density proposed by Kannan and Vinay. Our algorithm takes as input a bipartite graph with a specified starting vertex, and attempts to find a dense subgraph near that vertex. We prove that for any subgraph S wit... | The closely related densest @math -subgraph problem is to identify the subgraph with the largest number of edges among all subgraphs of exactly @math vertices. This problem is considerably more difficult, and there is a large gap between the best approximation algorithms and hardness results known for the problem (see ... | {
"cite_N": [
"@cite_5",
"@cite_2"
],
"mid": [
"2036836182",
"2010787744"
],
"abstract": [
"This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with a... |
cs0702113 | 2950657197 | We describe a new sampling-based method to determine cuts in an undirected graph. For a graph (V, E), its cycle space is the family of all subsets of E that have even degree at each vertex. We prove that with high probability, sampling the cycle space identifies the cuts of a graph. This leads to simple new linear-time... | Randomized algorithms appear in other literature related to the cut and cycle spaces. For example, @cite_7 computes the genus of an embedded graph @math while observing" part of it. They use random perturbation and balancing steps to compute a on @math and the dual graph of @math . Their computational model is quite di... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2001374475"
],
"abstract": [
"Harmonic and analytic functions have natural discrete analogues. Harmonic functions can be defined on every graph, while analytic functions (or, more precisely, holomorphic forms) can be defined on graphs embedded in orientable sur... |
cs0701037 | 2951856549 | DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in... | DejaVu @cite_2 (whose development overlapped that of DMTCP) also provides transparent user-level checkpointing of distributed process based on sockets. However, DejaVu appears to be much slower than DMTCP. For example, in the Chombo benchmark, Ruscio et al report executing ten checkpoints per hour with 45 checkpoints i... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2131053137"
],
"abstract": [
"This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global ... |
cs0701037 | 2951856549 | DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in... | The remaining work on distributed transparent checkpointing can be divided into two categories: User-level MPI libraries for checkpointing @cite_10 @cite_6 @cite_5 @cite_30 @cite_15 @cite_0 @cite_9 @cite_27 @cite_12 : works for distributed processes, but only if they communicate exclusively through MPI (Message Passing... | {
"cite_N": [
"@cite_30",
"@cite_4",
"@cite_7",
"@cite_8",
"@cite_9",
"@cite_20",
"@cite_6",
"@cite_0",
"@cite_19",
"@cite_27",
"@cite_5",
"@cite_15",
"@cite_34",
"@cite_10",
"@cite_25",
"@cite_12"
],
"mid": [
"2155204206",
"2162351670",
... |
cs0701037 | 2951856549 | DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in... | A crossover between these two categories is the kernel level checkpointer BLCR @cite_7 @cite_19 . BLCR is particularly notable because of its widespread usage. BLCR itself can only checkpoint processes on a single machine. However some MPI libraries (including some versions of OpenMPI, LAM MPI, MVAPICH2, and MPICH-V) a... | {
"cite_N": [
"@cite_19",
"@cite_7"
],
"mid": [
"2045879521",
"2116115793"
],
"abstract": [
"As high performance clusters continue to grow in size and popularity, issues of fault tolerance and reliability are becoming limiting factors on application scalability. To address these issues, we... |
cs0701037 | 2951856549 | DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in... | Much MPI-specific work has been based on coordinated checkpointing and the use of hooks into communication by the MPI library @cite_10 @cite_6 . In contrast, our goal is to support more general distributed scientific software. | {
"cite_N": [
"@cite_10",
"@cite_6"
],
"mid": [
"2095487435",
"2155662278"
],
"abstract": [
"A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant programming environment... |
cs0701037 | 2951856549 | DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in... | In addition to distributed checkpointing, many packages exist which perform single-process checkpointing @cite_11 @cite_16 @cite_35 @cite_3 @cite_14 @cite_28 @cite_26 @cite_13 @cite_22 @cite_17 . | {
"cite_N": [
"@cite_35",
"@cite_14",
"@cite_26",
"@cite_22",
"@cite_28",
"@cite_17",
"@cite_3",
"@cite_16",
"@cite_13",
"@cite_11"
],
"mid": [
"",
"2010439775",
"1874306839",
"2165022815",
"2048894106",
"1510894298",
"2138165844",
"152033913... |
cs0701001 | 2950643428 | Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome t... | The concept of STDMA for multihop wireless ad hoc networks was formalized in @cite_7 . Centralized algorithms @cite_12 @cite_9 as well as distributed algorithms @cite_11 @cite_3 have been proposed for generating reuse schedules. The problem of determining an optimal minimum-length STDMA schedule for a general multihop ... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_9",
"@cite_3",
"@cite_12",
"@cite_11"
],
"mid": [
"2103182676",
"2063078918",
"2115871876",
"1829981230",
"2153086189",
"2161157451"
],
"abstract": [
"Algorithms for transmission scheduling in multihop broadcast ra... |
cs0701001 | 2950643428 | Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome t... | A significant work in STDMA link scheduling is reported in @cite_14 , in which the authors show that tree networks can be scheduled optimally, oriented graphs can be scheduled near-optimally and arbitrary networks can be scheduled such that the schedule is bounded by a length proportional to the graph thickness The thi... | {
"cite_N": [
"@cite_14"
],
"mid": [
"2103182676"
],
"abstract": [
"Algorithms for transmission scheduling in multihop broadcast radio networks are presented. Both link scheduling and broadcast scheduling are considered. In each instance, scheduling algorithms are given that improve upon existing ... |
cs0701001 | 2950643428 | Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome t... | A probabilistic analysis of the throughput performance of graph-based scheduling algorithms under the physical interference model is derived in @cite_0 . The authors determine the optimal number of simultaneous transmissions by maximizing a lower bound on the physical throughput and subsequently propose a truncated gra... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2154570806"
],
"abstract": [
"Many published algorithms used for scheduling transmissions in packet radio networks are based on finding maximal independent sets in an underlying graph. Such algorithms are developed under the assumptions of variations of the pro... |
cs0701001 | 2950643428 | Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number of transmissions having low Signal to Interference and Noise density Ratio (SINR) at intended receivers, leading to low throughput. To overcome t... | In @cite_20 , the authors consider wireless mesh networks with half duplex and full duplex orthogonal channels, wherein each node can transmit to at most one node and or receive from at most @math nodes ( @math ) during any time slot. They investigate the joint problem of routing flows and scheduling link transmissions... | {
"cite_N": [
"@cite_20"
],
"mid": [
"2106117595"
],
"abstract": [
"This paper considers the problem of determining the achievable rates in multi-hop wireless mesh networks with orthogonal channels. We classify wireless networks with orthogonal channels into two types, half duplex and full duplex,... |
cs0701082 | 2949509156 | In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time. | Recently, decidability of classes of imperative programs has been studied in @cite_19 @cite_10 @cite_1 . Tiwari considers real-valued programs with no nested loops and no branching inside a loop @cite_1 . Such programs correspond to one-binary-rule CLP( @math ). The author provides decidability results for subclasses o... | {
"cite_N": [
"@cite_1",
"@cite_19",
"@cite_10"
],
"mid": [
"1575647584",
"2136333450",
"1530375435"
],
"abstract": [
"We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing ter... |
cs0701082 | 2949509156 | In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time. | Similarly to @cite_1 , Podelski and Rybalchenko have considered programs with no nested loops and no branching inside a loop. However, they focused on integer programs and provide a polynomial time decidability technique for a subclass of such programs. In case of general programs their technique can be applied to prov... | {
"cite_N": [
"@cite_1"
],
"mid": [
"1575647584"
],
"abstract": [
"We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is, a while loop with linear assignments. We relate t... |
cs0701094 | 2949115009 | It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are... | Among all these solutions, we have chosen to focus on the multipoint relay protocol ( ) described in @cite_4 for several reasons: | {
"cite_N": [
"@cite_4"
],
"mid": [
"2156603709"
],
"abstract": [
"We discuss the mechanism of multipoint relays (MPRs) to efficiently flood broadcast messages in mobile wireless networks. Multipoint relaying is a technique to reduce the number of redundant re-transmissions while diffusing a broad... |
cs0701094 | 2949115009 | It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are... | It is efficient using the unit disk graph model. It is used in the well-known standardized routing protocol @cite_10 . It can be used for other miscellaneous purposes (, computing connected dominating sets @cite_6 ). | {
"cite_N": [
"@cite_10",
"@cite_6"
],
"mid": [
"2117526746",
"1543191305"
],
"abstract": [
"In this paper we propose and discuss an optimized link state routing protocol, named OLSR, for mobile wireless networks. The protocol is based on the link state algorithm and it is proactive (or ta... |
cs0701094 | 2949115009 | It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are... | Obviously, the tricky part of this protocol lies in the selection of the set of relays @math within the @math -hop neighbors of a node @math : the smaller this set is, the smaller the number of retransmissions is and the more efficient the broadcast is. Unfortunately, finding such a set so that it is the smallest possi... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2163322487"
],
"abstract": [
"It is shown that the ratio of optimal integral and fractional covers of a hypergraph does not exceed 1 + log d, where d is the maximum degree. This theorem may replace probabilistic methods in certain circumstances. Several applic... |
cs0701094 | 2949115009 | It is now commonly accepted that the unit disk graph used to model the physical layer in wireless networks does not reflect real radio transmissions, and that the lognormal shadowing model better suits to experimental simulations. Previous work on realistic scenarios focused on unicast, while broadcast requirements are... | Being the broadcast protocol used in , has been the subject of miscellaneous studies since its publication. For example in @cite_3 , authors analyze how relays are selected and conclude that almost $75 | {
"cite_N": [
"@cite_3"
],
"mid": [
"2194282251"
],
"abstract": [
"OLSR is a recent routing protocol for multi-hop wireless ad-hoc networks standardized by the IETF. It uses the concept of Multi-Point Relays (MPR) to minimize the overhead of routing messages and limit the harmful effects of broadc... |
cs0701190 | 1614193546 | The distribution of files using decentralized, peer-to-peer (P2P) systems, has significant advantages over centralized approaches. It is however more difficult to settle on the best approach for file sharing. Most file sharing systems are based on query string searches, leading to a relatively simple but inefficient br... | @cite_8 is a P2P file sharing system that provides a global namespace and automatic availability management. It allows any user to modify any portion of the namespace by modifying, adding, and deleting files and directories. Wayfinder's global namespace is constructed by the system automatically merging the local names... | {
"cite_N": [
"@cite_4",
"@cite_8",
"@cite_6",
"@cite_24",
"@cite_27"
],
"mid": [
"2104210894",
"1488732870",
"",
"2121133177",
"2150676586"
],
"abstract": [
"OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persiste... |
cs0612043 | 2950828832 | We analyze the ability of peer to peer networks to deliver a complete file among the peers. Early on we motivate a broad generalization of network behavior organizing it into one of two successive phases. According to this view the network has two main states: first centralized - few sources (roots) hold the complete f... | A lot of work has been devoted to the area of file sharing in P2P networks. Many experimental papers provide practical strategies and preliminary results concerning the behavior of these kind of networks. @cite_10 for instance, the authors essentially describe properties like liveness and downloading rate by means of e... | {
"cite_N": [
"@cite_10"
],
"mid": [
"1853723677"
],
"abstract": [
"Popular content such as software updates is requested by a large number of users. Traditionally, to satisfy a large number of requests, lager server farms or mirroring are used, both of which are expensive. An inexpensive alternat... |
cs0612072 | 2949346966 | Internet search companies sell advertisement slots based on users' search queries via an auction. Advertisers have to determine how to place bids on the keywords of their interest in order to maximize their return for a given budget: this is the budget optimization problem. The solution depends on the distribution of f... | Together, our results represent a new theoretical study of stochastic versions of budget optimization problems in search-related advertising. The budget optimization problem was studied recently @cite_4 in the fixed model, when @math 's are known. On one hand, our study is more general, with the emphasis on the uncerta... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2119914577"
],
"abstract": [
"Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work onthe auction process and its game-theoretic aspects, most of it focuses on the Internet company. ... |
cs0612072 | 2949346966 | Internet search companies sell advertisement slots based on users' search queries via an auction. Advertisers have to determine how to place bids on the keywords of their interest in order to maximize their return for a given budget: this is the budget optimization problem. The solution depends on the distribution of f... | Recently, @cite_9 considered an online knapsack problem with the assumption of small element sizes, and @cite_2 considered an online knapsack problem with a random order of element arrival, both motivated by bidding in advertising auctions. The difference with our work is that these authors consider the problem in the ... | {
"cite_N": [
"@cite_9",
"@cite_2"
],
"mid": [
"2155551092",
"2164792208"
],
"abstract": [
"We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both deterministic and randomiz... |
cs0612072 | 2949346966 | Internet search companies sell advertisement slots based on users' search queries via an auction. Advertisers have to determine how to place bids on the keywords of their interest in order to maximize their return for a given budget: this is the budget optimization problem. The solution depends on the distribution of f... | There has been a lot of other work on search-related auctions in the presence of budgets, but it has primarily focused on the game-theoretic aspects @cite_7 @cite_11 , strategy-proof mechanisms @cite_16 @cite_0 , and revenue maximization @cite_3 @cite_13 . | {
"cite_N": [
"@cite_7",
"@cite_3",
"@cite_0",
"@cite_16",
"@cite_13",
"@cite_11"
],
"mid": [
"1975392791",
"",
"2564127794",
"",
"2015324401",
"2127347613"
],
"abstract": [
"We investigate the \"generalized second price\" auction (GSP), a new mechanism whic... |
cs0612086 | 1645234836 | We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include conflict, execution order, dependence, and atomicity. The local state is some schedu... | The only semantics supported by Deno or VVWV is to enforce Lamport's happens-before relation @cite_11 ; all actions are assumed be mutually non-commuting. Happens-before captures potential causality; however an event may happen-before another even if they are not truly dependent. This paper further generalizes VVWV by ... | {
"cite_N": [
"@cite_11"
],
"mid": [
"1973501242"
],
"abstract": [
"The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which ca... |
cs0612086 | 1645234836 | We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include conflict, execution order, dependence, and atomicity. The local state is some schedu... | Bayou @cite_7 supports arbitrary application semantics. User-supplied code controls whether an action is committed or aborted. However the system imposes an arbitrary total execution order. Bayou centralises decision at a single primary replica. | {
"cite_N": [
"@cite_7"
],
"mid": [
"2117260615"
],
"abstract": [
"Bayou is a replicated, weakly consistent storage system designed for a mobile computing environment that includes portable machines with less than ideal network connectivity. To maximize availability, users can read and write any a... |
cs0612086 | 1645234836 | We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include conflict, execution order, dependence, and atomicity. The local state is some schedu... | IceCube @cite_14 introduced the idea of reifying semantics with constraints. The IceCube algorithm computes optimal proposals, minimizing the number of dead actions. Like Bayou, commitment in IceCube is centralised at a primary. Compared to this article, IceCube supports a richer constraint vocabulary, which is useful ... | {
"cite_N": [
"@cite_14"
],
"mid": [
"2154193287"
],
"abstract": [
"We describe a novel approach to log-based reconciliation called IceCube. It is general and is parameterised by application and object semantics. IceCube considers more flexible orderings and is designed to ease the burden of recon... |
cs0612086 | 1645234836 | We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that reify semantic constraints between actions. Constraint types include conflict, execution order, dependence, and atomicity. The local state is some schedu... | Generalized Paxos @cite_10 and Generic Broadcast @cite_4 take commutativity relations into account and compute a partial order. They do not consider any other semantic relations. Both Generalized Paxos @cite_10 and our algorithm make progress when a majority is not reached, although through different means. Generalized... | {
"cite_N": [
"@cite_10",
"@cite_4"
],
"mid": [
"2106670435",
"202775458"
],
"abstract": [
"Theoretician’s Abstract Consensus has been regarded as the fundamental problem that must be solved to implement a fault-tolerant distributed system. However, only a weaker problem than traditional c... |
cs0611102 | 1647784286 | We present a method to secure the complete path between a server and the local human user at a network node. This is useful for scenarios like internet banking, electronic signatures, or online voting. Protection of input authenticity and output integrity and authenticity is accomplished by a combination of traditional... | A proposal for a user interface for prevents Trojan horses from tampering with application output. @cite_17 Kernelizing the graphics server and delegating window manager tasks to the application level is a prototypical solution in @cite_27 . However, it is not compatible with the Windows platform used on the vast major... | {
"cite_N": [
"@cite_27",
"@cite_17"
],
"mid": [
"2107252100",
"1927589643"
],
"abstract": [
"Malware such as Trojan horses and spyware remain to be persistent security threats that exploit the overly complex graphical user interfaces of today's commodity operating systems. In this paper, ... |
cs0611102 | 1647784286 | We present a method to secure the complete path between a server and the local human user at a network node. This is useful for scenarios like internet banking, electronic signatures, or online voting. Protection of input authenticity and output integrity and authenticity is accomplished by a combination of traditional... | In the Microsoft Windows operating system, applications typically receive information about user actions by messages. Since these can be sent by malicious programs as well, they are a convenient attack vector. It is a vulnerability by design -- Windows treats all processes equally that run on the same desktop. If one n... | {
"cite_N": [
"@cite_5"
],
"mid": [
"24868454"
],
"abstract": [
"With the advent of networks that span administrative domains, increasing mobility, and even global-area networks, we find ourselves more and more often in situations where we do not know the potential parties accessing our system. Ye... |
cs0611102 | 1647784286 | We present a method to secure the complete path between a server and the local human user at a network node. This is useful for scenarios like internet banking, electronic signatures, or online voting. Protection of input authenticity and output integrity and authenticity is accomplished by a combination of traditional... | This problem is encountered by local security applications such as electronic signature software @cite_10 , virus scanners, personal fire walls etc. In @cite_28 a dilemma is pointed out when notifying users about security events. Users are notified about presence of a possibly malicious program that could hide that ver... | {
"cite_N": [
"@cite_7",
"@cite_8",
"@cite_28",
"@cite_21",
"@cite_6",
"@cite_10",
"@cite_20"
],
"mid": [
"2118761104",
"",
"2101587116",
"2101685556",
"2132324287",
"2099438928",
"1593097332"
],
"abstract": [
"Client computers are often a weak link ... |
math-ph0611049 | 1611194078 | Geophysical research has focused on flows, such as ocean currents, as two dimensional. Two dimensional point or blob vortex models have the advantage of having a Hamiltonian, whereas 3D vortex filament or tube systems do not necessarily have one, although they do have action functionals. On the other hand, certain clas... | As mentioned in the previous section, simulations of flux lines in type-II superconductors using the PIMC method have been done, generating the Abrikosov lattice ( @cite_13 , @cite_0 ). However, the superconductor model has periodic boundary conditions in the xy-plane, is a different problem altogether, and is not appl... | {
"cite_N": [
"@cite_0",
"@cite_5",
"@cite_18",
"@cite_13"
],
"mid": [
"2148252125",
"2010371781",
"",
"2023644284"
],
"abstract": [
"Using path integral Monte Carlo we simulate a 3D system of up to 1000 magnetic flux lines by mapping it onto interacting bosons in 2 1 1D. W... |
math-ph0611049 | 1611194078 | Geophysical research has focused on flows, such as ocean currents, as two dimensional. Two dimensional point or blob vortex models have the advantage of having a Hamiltonian, whereas 3D vortex filament or tube systems do not necessarily have one, although they do have action functionals. On the other hand, certain clas... | @cite_12 has done some excellent simulations of vortex tangles in He-4 with rotation, boundary walls, and vortex reconnections to study disorder in rotating superfluid turbulence. Because vortex tangles are extremely curved, they applied the full Biot-Savart law to calculate the motion of the filaments in time. Their s... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2090218426"
],
"abstract": [
"Almost all studies of vortex states in helium II have been concerned with either ordered vortex arrays or disordered vortex tangles. This work numerically studies what happens in the presence of both rotation (which induces order)... |
math-ph0611049 | 1611194078 | Geophysical research has focused on flows, such as ocean currents, as two dimensional. Two dimensional point or blob vortex models have the advantage of having a Hamiltonian, whereas 3D vortex filament or tube systems do not necessarily have one, although they do have action functionals. On the other hand, certain clas... | Other related work on the statistical mechanics of turbulence in 3-D vortex lines can be found in @cite_4 and @cite_3 in addition to @cite_17 . | {
"cite_N": [
"@cite_4",
"@cite_3",
"@cite_17"
],
"mid": [
"1535313248",
"1983052591",
""
],
"abstract": [
"We introduce a statistical ensemble for a single vortex filament of a three dimensional incompressible fluid. The core of the vortex is modeled by a quite generic stochastic ... |
cs0611003 | 2141738320 | Time synchronization is an important aspect of sensor network operation. However, it is well known that synchro- nization error accumulates over multiple hops. This presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this work, we present a protoc... | The traditional synchronization techniques describe in @cite_11 @cite_13 @cite_1 @cite_4 @cite_10 all operate fundamentally on the idea of communicating timing information from one set of nodes to the next. One other approach to synchronization that has recently received much attention is to apply mathematical models o... | {
"cite_N": [
"@cite_13",
"@cite_14",
"@cite_4",
"@cite_1",
"@cite_5",
"@cite_10",
"@cite_11"
],
"mid": [
"2122690764",
"2154953441",
"2159219540",
"",
"2165135460",
"2094636498",
"2143229717"
],
"abstract": [
"Time synchronization is important for a... |
cs0611003 | 2141738320 | Time synchronization is an important aspect of sensor network operation. However, it is well known that synchro- nization error accumulates over multiple hops. This presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this work, we present a protoc... | The convergence result is clearly desirable for synchronization in networks and in @cite_0 theoretical and simulation results suggested that such a technique could be adapted to communication and sensor networks. Experimental validation for the ideas of @cite_14 was obtained in @cite_18 where the authors implemented th... | {
"cite_N": [
"@cite_0",
"@cite_18",
"@cite_14"
],
"mid": [
"2098897082",
"2030381790",
"2154953441"
],
"abstract": [
"Synchronization is considered a particularly difficult task in wireless sensor networks due to its decentralized structure. Interestingly, synchrony has often been... |
cs0611003 | 2141738320 | Time synchronization is an important aspect of sensor network operation. However, it is well known that synchro- nization error accumulates over multiple hops. This presents a challenge for large-scale, multi-hop sensor networks with a large number of nodes distributed over wide areas. In this work, we present a protoc... | The problem with these emergent synchronization results is that the fundamental theory assumes all nodes have nearly the same firing period. Results from @cite_0 and @cite_18 show that the convergence results may hold when nodes have approximately the same firing period, but the authors of @cite_18 explain that clock s... | {
"cite_N": [
"@cite_0",
"@cite_18"
],
"mid": [
"2098897082",
"2030381790"
],
"abstract": [
"Synchronization is considered a particularly difficult task in wireless sensor networks due to its decentralized structure. Interestingly, synchrony has often been observed in networks of biologica... |
cs0611052 | 2953215000 | For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known polynomial-time algorithms for these problems fail to find solutions even at much lower ... | Finally, the authors prove that the property has a pair of satisfying assignments at distance @math " has a sharp threshold, thus boosting their constant probability result for having a pair of satisfying assignments at a given distance to a high probability one. To the best of our understanding, these three are the on... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2115885909"
],
"abstract": [
"We investigate geometrical properties of the random K-satisfiability problem using the notion of x-satisfiability: a formula is x-satisfiable is there exist two SAT-assignments differing in Nx variables. We show the existence of a ... |
cs0611135 | 2952342381 | Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed optimization problem; ii) non-linear learning can be brought into linear learning thanks to the kernel trick and the mapping of the initial search space o... | The most relevant work to EKM is the Genetic Kernel Support Vector Machine (GK-SVM) @cite_1 . GK-SVM similarly uses GP within an SVM-based approach, with two main differences compared to EKM. On one hand, GK-SVM focuses on feature construction, using GP to optimize mapping @math (instead of the kernel). On the other ha... | {
"cite_N": [
"@cite_15",
"@cite_16",
"@cite_1"
],
"mid": [
"1986490585",
"",
"1978917315"
],
"abstract": [
"The problem of model selection for support vector machines (SVMs) is considered. We propose an evolutionary approach to determine multiple SVM hyperparameters: The covarianc... |
hep-th0610185 | 1993186195 | We investigate the nonperturbative quantization of phantom and ghost degrees of freedom by relating their representations in definite and indefinite inner product spaces. For a large class of potentials, we argue that the same physical information can be extracted from either representation. We provide a definition of ... | In @cite_21 @cite_30 Erdem, and in @cite_25 't Hooft and Nobbenhuis discuss a novel kind of symmetry transformation consisting of a rotation of real positional coordinates to the imaginary axis, with the aim of ruling out a cosmological constant. The rotated representation that these authors use for their non-relativis... | {
"cite_N": [
"@cite_30",
"@cite_21",
"@cite_25"
],
"mid": [
"",
"2006504824",
"2008434812"
],
"abstract": [
"",
"We introduce a symmetry principle that forbids a bulk cosmological constant in six and ten dimensions. Then the symmetry is extended in six dimensions so that it in... |
hep-th0610185 | 1993186195 | We investigate the nonperturbative quantization of phantom and ghost degrees of freedom by relating their representations in definite and indefinite inner product spaces. For a large class of potentials, we argue that the same physical information can be extracted from either representation. We provide a definition of ... | Also related to the cosmological constant problem is the paper @cite_11 , which introduces phantom fields to cancel the ordinary matter contribution to the vacuum energy. Again, our non-perturbative approach to phantom fields may be useful in the study of these models. | {
"cite_N": [
"@cite_11"
],
"mid": [
"1983032885"
],
"abstract": [
"We study a symmetry, schematically Energy → — Energy, which suppresses matter contributions to the cosmological constant. The requisite negative energy fluctuations are identified with a ghost'' copy of the Standard Model. Gravity... |
hep-th0610185 | 1993186195 | We investigate the nonperturbative quantization of phantom and ghost degrees of freedom by relating their representations in definite and indefinite inner product spaces. For a large class of potentials, we argue that the same physical information can be extracted from either representation. We provide a definition of ... | In scattering theory, so-called Siegert or Gamow states may be used to represent resonances. These are states with complex momentum @cite_5 , which may be given precise mathematical meaning in the framework of section of the current article, where such states are defined as distributions on test function spaces of Gel'... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2030838706"
],
"abstract": [
"Abstract The orthogonality and completeness properties of the resonant states as defined by Humblet and Rosenfeld are investigated using a simple regularization method first suggested by Zel'dovich. It is found that at leat for fin... |
hep-th0610185 | 1993186195 | We investigate the nonperturbative quantization of phantom and ghost degrees of freedom by relating their representations in definite and indefinite inner product spaces. For a large class of potentials, we argue that the same physical information can be extracted from either representation. We provide a definition of ... | The author of @cite_12 describes a treatment of these states in the context of rigged Hilbert spaces. His construction should be very closely related to the one of the current article. | {
"cite_N": [
"@cite_12"
],
"mid": [
"1967199649"
],
"abstract": [
"Using the complex coordinate method, it is possible to compute the physical properties of atomic resonances above the ionization threshold. We show how to define and compute the electronic densities associated with these atomic re... |
math0610051 | 2950957448 | We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically a so-called Fourier integral operator (FIO) of the form @math at points given on... | In the case where @math , the operator is said to be pseudodifferential. In this simpler setting, it is known that separated variables expansions of the symbol @math are good strategies for reducing complexity. For instance, Bao and Symes @cite_8 propose a numerical method based on a Fourier series expansion of the sym... | {
"cite_N": [
"@cite_8"
],
"mid": [
"2141044221"
],
"abstract": [
"A simple algorithm is described for computing general pseudo-differential operator actions. Our approach is based on the asymptotic expansion of the symbol together with the fast Fourier transform (FFT). The idea is motivated by th... |
math0610051 | 2950957448 | We introduce a general purpose algorithm for rapidly computing certain types of oscillatory integrals which frequently arise in problems connected to wave propagation and general hyperbolic equations. The problem is to evaluate numerically a so-called Fourier integral operator (FIO) of the form @math at points given on... | We would also like to acknowledge the line of research related to Filon-type quadratures for oscillatory integrals @cite_14 . When the integrand is of the form @math with @math smooth and @math large, it is not always necessary to sample the integrand at the Nyquist rate. For instance, integration of a polynomial inter... | {
"cite_N": [
"@cite_14"
],
"mid": [
"2061749829"
],
"abstract": [
"Highly-oscillatory integrals are allegedly difficult to calculate. The main assertion of this paper is that that impression is incorrect. As long as appropriate quadrature methods are used, their accuracy increases when oscillatio... |
cs0610046 | 2951738093 | The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparati... | @cite_7 presented the filter algorithm requiring @math comparisons per element in the worst case and an average-case performance over independent and identically distributed (i.i.d.) noise data of slightly more than 3 comparisons per element. @cite_6 presented a better alternative: the filter algorithm was shown to ave... | {
"cite_N": [
"@cite_4",
"@cite_6",
"@cite_7"
],
"mid": [
"",
"2148168055",
"2752885492"
],
"abstract": [
"",
"We present a novel algorithm for calculating the running maximum or minimum value of a 1-D sequence over a sliding data window. The new algorithm stores a pruned order... |
cs0610046 | 2951738093 | The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparati... | @cite_2 proposed a fast algorithm based on anchors. They do not improve on the number of comparisons per element. For window sizes ranging from 10 to 30 and data values ranging from 0 to 255, their implementation has a running time lower than their implementation by as much as 30 implementation by as much as 15 than 15... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2047293099"
],
"abstract": [
"Several efficient algorithms for computing erosions and openings have been proposed recently. They improve on van Herk's algorithm in terms of number of comparisons for large structuring elements. In this paper we introduce a theor... |
cs0610105 | 1616788770 | We present a new class of statistical de-anonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. Our techniques are robust to perturbation in the data and tolerate some mistakes in the adversary's background knowledge. We apply our de-an... | Unlike statistical databases @cite_22 @cite_4 @cite_10 @cite_17 @cite_23 , micro-data datasets contain actual records of individuals even after anonymization. A popular approach to micro-data privacy is @math -anonymity @cite_18 @cite_8 @cite_20 . The data publisher must determine in advance which of the attributes are... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_22",
"@cite_8",
"@cite_6",
"@cite_19",
"@cite_23",
"@cite_2",
"@cite_5",
"@cite_10",
"@cite_20",
"@cite_17"
],
"mid": [
"2159024459",
"2113427031",
"2044307594",
"2119047901",
"1606251440",
"2134167... |
cs0610105 | 1616788770 | We present a new class of statistical de-anonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. Our techniques are robust to perturbation in the data and tolerate some mistakes in the adversary's background knowledge. We apply our de-an... | Our main case study is the Netflix Prize dataset of movie ratings. We are aware of only one previous paper that considered privacy of movie ratings. In collaboration with the MovieLens recommendation service, Frankowski correlated public mentions of movies in the MovieLens discussion forum with the users' movie rating ... | {
"cite_N": [
"@cite_7"
],
"mid": [
"1981794546"
],
"abstract": [
"In today's data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinionated rants about movies in your blog under a pseudonym... |
cs0610137 | 2950868392 | The Software Transactional Memory (STM) model is an original approach for controlling concurrent accesses to ressources without the need for explicit lock-based synchronization mechanisms. A key feature of STM is to provide a way to group sequences of read and write actions inside atomic blocks, similar to database tra... | Linked to the upsurge of works on Web Services (and on long running Web transactions), a larger body of works is concerned with formalizing . In this context, each transactive block of actions is associated with a compensation (code) that has to be run if a failure is detected. The purpose of compensation is to undo mo... | {
"cite_N": [
"@cite_11",
"@cite_4",
"@cite_22",
"@cite_21",
"@cite_19",
"@cite_2",
"@cite_12",
"@cite_20",
"@cite_17"
],
"mid": [
"",
"2150864072",
"1974168649",
"",
"1587877137",
"1580055894",
"",
"",
"2460103410"
],
"abstract": [
"... |
math-ph0609072 | 2949598775 | We study nodal sets for typical eigenfunctions of the Laplacian on the standard torus in 2 or more dimensions. Making use of the multiplicities in the spectrum of the Laplacian, we put a Gaussian measure on the eigenspaces and use it to average over the eigenspace. We consider a sequence of eigenvalues with multiplicit... | The study of nodal lines of random waves goes back to Longuet-Higgins @cite_7 @cite_13 who computed various statistics of nodal lines for Gaussian random waves in connection with the analysis of ocean waves. Berry @cite_10 suggested to model highly excited quantum states for classically chaotic systems by using various... | {
"cite_N": [
"@cite_13",
"@cite_7",
"@cite_9",
"@cite_17",
"@cite_2",
"@cite_10",
"@cite_11"
],
"mid": [
"2072863189",
"2115189693",
"",
"2561781306",
"2094161636",
"2018458110",
"183347149"
],
"abstract": [
"A number of statistical properties of a ... |
cs0609026 | 2950493373 | The performance of peer-to-peer file replication comes from its piece and peer selection strategies. Two such strategies have been introduced by the BitTorrent protocol: the rarest first and choke algorithms. Whereas it is commonly admitted that BitTorrent performs well, recent studies have proposed the replacement of ... | @cite_3 study the file popularity, file availability, download performance, content lifetime and pollution level on a popular tracker site. This work is orthogonal to ours as they do not study the core algorithms of , but rather focus on the contents distributed using and on the users behavior. The work that is the mos... | {
"cite_N": [
"@cite_29",
"@cite_3"
],
"mid": [
"1853723677",
"2166707941"
],
"abstract": [
"Popular content such as software updates is requested by a large number of users. Traditionally, to satisfy a large number of requests, lager server farms or mirroring are used, both of which are e... |
cs0609166 | 1640198638 | We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem approximately using... | Other work in private communication-efficient protocols for specific functions includes the Private Information Retrieval problem @cite_9 @cite_6 @cite_2 , building decision trees @cite_10 , set intersection and matching @cite_12 , and @math 'th-ranked element @cite_0 . | {
"cite_N": [
"@cite_9",
"@cite_6",
"@cite_0",
"@cite_2",
"@cite_10",
"@cite_12"
],
"mid": [
"",
"2154654620",
"1578837377",
"1963094505",
"2047370889",
"2143087446"
],
"abstract": [
"",
"We establish the following, quite unexpected, result: replication ... |
cs0609166 | 1640198638 | We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem approximately using... | The breakthrough @cite_15 gives a general technique for converting any protocol into a private protocol with little communication overhead. It is not the end of the story, however, because the computation may increase exponentially. | {
"cite_N": [
"@cite_15"
],
"mid": [
"2069717895"
],
"abstract": [
"A secure function evaluation protocol allows two parties to jointly compute a function f(x,y) of their inputs in a manner not leaking more information than necessary. A major result in this field is: “any function f that can be co... |
cs0609166 | 1640198638 | We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem approximately using... | Work in private approximations include @cite_19 that introduced the notion as a conference paper in 2001 and gave several protocols. Some negative results were given in @cite_13 for approximations to NP-Hard functions; more on NP-hard search problems appears in @cite_11 . Recently, @cite_18 gives a private approximatio... | {
"cite_N": [
"@cite_19",
"@cite_18",
"@cite_13",
"@cite_11"
],
"mid": [
"2152590851",
"1572949938",
"",
"2047515520"
],
"abstract": [
"Approximation algorithms can sometimes provide efficient solutions when no efficient exact computation is known. In particular, approximat... |
cs0609166 | 1640198638 | We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem approximately using... | Statistical work such as @cite_5 also addresses approximate summaries over large databases, but differs from our work in many parameters, such as the number of players and the allowable communication. | {
"cite_N": [
"@cite_5"
],
"mid": [
"2169134473"
],
"abstract": [
"We initiate a theoretical study of the census problem. Informally, in a census individual respondents give private information to a trusted party (the census bureau), who publishes a sanitized version of the data. There are two fun... |
cs0609166 | 1640198638 | We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem approximately using... | There are many papers that address the Heavy Hitters problem and sketching in general, in a variety of contexts. Many of the needed ideas can be seen in @cite_8 and other important papers include @cite_3 @cite_17 @cite_4 @cite_16 . | {
"cite_N": [
"@cite_4",
"@cite_8",
"@cite_3",
"@cite_16",
"@cite_17"
],
"mid": [
"2047424291",
"",
"2080745194",
"2167973519",
"2040063291"
],
"abstract": [
"(MATH) A vector A of length N is defined implicitly, via a stream of updates of the form \"add 5 to A3.\" W... |
cs0609122 | 2952623723 | We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and th... | relay channels are studied in terms of ergodic capacity in @cite_47 and in terms of in @cite_17 . The latter considers the protocol only, presents a lower bound on the performance and designs space-time block codes. This lower bound is not tight in general and is valid only if the number of relay antennas is less than ... | {
"cite_N": [
"@cite_47",
"@cite_17"
],
"mid": [
"2106801259",
"2025889675"
],
"abstract": [
"We study the capacity of multiple-input multiple- output (MIMO) relay channels. We first consider the Gaussian MIMO relay channel with fixed channel conditions, and derive upper bounds and lower b... |
cs0609122 | 2952623723 | We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and th... | The multiple-access relay channel ( ) is introduced in @cite_43 @cite_0 @cite_39 . In , the relay helps multiple sources simultaneously to reach a common destination. The for the half-duplex with single antenna nodes is studied in @cite_31 @cite_37 @cite_34 . In @cite_31 , the authors find that is optimal for low multi... | {
"cite_N": [
"@cite_37",
"@cite_39",
"@cite_0",
"@cite_43",
"@cite_31",
"@cite_34"
],
"mid": [
"2139934818",
"2097739512",
"2098567664",
"",
"2121284405",
""
],
"abstract": [
"This paper studies the diversity-multiplexing trade-off for the multiaccess relay... |
cs0609122 | 2952623723 | We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and th... | When multiple single antenna relays are present, the papers @cite_12 @cite_9 @cite_49 @cite_27 @cite_32 @cite_22 @cite_30 show that diversity gains similar to multi-input single-output ( ) or single-input multi-output ( ) systems are achievable for Rayleigh fading channels. Similarly, @cite_3 @cite_48 @cite_18 @cite_29... | {
"cite_N": [
"@cite_30",
"@cite_18",
"@cite_22",
"@cite_48",
"@cite_9",
"@cite_29",
"@cite_32",
"@cite_3",
"@cite_27",
"@cite_49",
"@cite_2",
"@cite_12"
],
"mid": [
"2113346794",
"2123517571",
"2106453003",
"2136209931",
"2153727902",
"21282... |
quant-ph0608199 | 2951547182 | Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state. In addition, Alice and Bob can use local operations and authenticated public classical communication. Their goal is to establish a key which is unknown to Eve.... | The first to spot a relation between the classical and the quantum development were Gisin and Wolf; in analogy to in quantum information theory, they conjectured the existence of , namely classical correlation that can only be created from key but from which no key can be distilled @cite_37 . Their conjecture remains u... | {
"cite_N": [
"@cite_37"
],
"mid": [
"1518891070"
],
"abstract": [
"After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information... |
cs0608031 | 1573220314 | With the rapid spread of various mobile terminals in our society, the importance of secure positioning is growing for wireless networks in adversarial settings. Recently, several authors have proposed a secure positioning mechanism of mobile terminals which is based on the geometric property of wireless node placement,... | The secure positioning technique with RF mainly discussed in this paper was proposed in @cite_11 @cite_2 . The distance bounding protocols using bidirectional communication to upper bound claimant's distance was first introduced in @cite_6 , and the proposal in @cite_2 is based on the protocols @cite_6 . For easier imp... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_6",
"@cite_2",
"@cite_11"
],
"mid": [
"2127785555",
"2164947865",
"1543653153",
"2159796097",
""
],
"abstract": [
"Radio-frequency identification tokens, such as contactless smartcards, are vulnerable to relay attacks if t... |
cs0608031 | 1573220314 | With the rapid spread of various mobile terminals in our society, the importance of secure positioning is growing for wireless networks in adversarial settings. Recently, several authors have proposed a secure positioning mechanism of mobile terminals which is based on the geometric property of wireless node placement,... | The protocol called Temporal Leashes is proposed in @cite_0 for detection of the specific attack called the wormhole attack. The protocol detects the attack by checking the packet transmission time measured by tightly synchronized clocks of a sender and a receiver. | {
"cite_N": [
"@cite_0"
],
"mid": [
"2157921329"
],
"abstract": [
"As mobile ad hoc network applications are deployed, security emerges as a central requirement. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. ... |
cs0608031 | 1573220314 | With the rapid spread of various mobile terminals in our society, the importance of secure positioning is growing for wireless networks in adversarial settings. Recently, several authors have proposed a secure positioning mechanism of mobile terminals which is based on the geometric property of wireless node placement,... | On the other hand, there are location verification protocols which substantially make use of the physical properties of broadcasted radio waves @cite_8 @cite_15 . In @cite_8 , their proposal depends on the intensity and the directivity of broadcasted radio waves for location verification. In @cite_15 , their proposal w... | {
"cite_N": [
"@cite_15",
"@cite_8"
],
"mid": [
"2162413906",
"2150212044"
],
"abstract": [
"Authentication in conventional networks (like the Internet) is usually based upon something you know (e.g., a password), something you have (e.g., a smartcard) or something you are (biometrics). In... |
cs0608051 | 2951605536 | Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad. The associated notion of morphism of left modules ("Linear" natural transformations) captures an important property of compatibility with substitution, in the heterogeneous case where "terms"... | We have introduced the notion of module over a monad, and more importantly the notion of linearity for transformations among such modules and we have tried to show that this notion is ubiquitous as soon as syntax and semantics are concerned. Our thesis is that the point of view of modules opens some new room for initia... | {
"cite_N": [
"@cite_5"
],
"mid": [
"1816420085"
],
"abstract": [
"A process for the preparation of a textured protein-containing material in which an amylolytic fungus is grown on a moist starch based substrate which includes a nitrogen source assimilable by the fungus the substrate being provide... |
cs0607040 | 1663216048 | This paper describes the development of the PALS system, an implementation of Prolog capable of efficiently exploiting or-parallelism on distributed-memory platforms--specifically Beowulf clusters. PALS makes use of a novel technique, called incremental stack-splitting. The technique proposed builds on the stack-splitt... | A rich body of research has been developed to investigate methodologies for the exploitation of or-parallelism from Prolog executions on SMPs. Comprehensive surveys describing and comparing these methodologies have appeared, e.g., @cite_44 @cite_32 @cite_12 . | {
"cite_N": [
"@cite_44",
"@cite_32",
"@cite_12"
],
"mid": [
"27834061",
"1985039455",
""
],
"abstract": [
"From the Publisher: Multiprocessor Execution of Logic Programs addresses the problem of efficient implementation of Logic Programming Languages, specifically Prolog, on multi... |
cs0607040 | 1663216048 | This paper describes the development of the PALS system, an implementation of Prolog capable of efficiently exploiting or-parallelism on distributed-memory platforms--specifically Beowulf clusters. PALS makes use of a novel technique, called incremental stack-splitting. The technique proposed builds on the stack-splitt... | A theoretical analysis of the properties of different methodologies has been presented in @cite_33 @cite_15 . These works provide an abstraction of the environment representation problem as a data structure problem on dynamic trees. These studies identify the presence of unavoidable overheads in the dynamic management ... | {
"cite_N": [
"@cite_30",
"@cite_14",
"@cite_33",
"@cite_15",
"@cite_25"
],
"mid": [
"2063476219",
"2016462478",
"1983963066",
"2018331535",
"2112482891"
],
"abstract": [
"Previous investigations have suggested the use of multiple communicating processors for execut... |
cs0607079 | 2086126338 | The length-based approach is a heuristic for solving randomly generated equations in groups that possess a reasonably behaved length function. We describe several improvements of the previously suggested length-based algorithms, which make them applicable to Thompson's group with significant success rates. In particula... | While we were finalizing our paper for publication, a very elegant specialized attack on the same cryptosystem was announced by Matucci @cite_15 . The main contribution of the present paper is thus the generalization of the length-based algorithms to make them applicable to a wider class of groups. Moreover, while our ... | {
"cite_N": [
"@cite_15"
],
"mid": [
"1530291176"
],
"abstract": [
"The present invention relates to a method for the determination of the electron density in a part volume in a patient by means of an X-ray tube, said tube comprising an anode symmetrical with respect to rotation as an electron bea... |
cs0606044 | 2951892051 | In set-system auctions , there are several overlapping teams of agents, and a task that can be completed by any of these teams. The buyer's goal is to hire a team and pay as little as possible. Recently, Karlin, Kempe and Tamir introduced a new definition of frugality ratio for this setting. Informally, the frugality r... | Vertex-cover auctions have been studied in the past by Talwar @cite_9 and Calinescu @cite_3 . Both of these papers are based on the definition of frugality ratio used in @cite_5 ; as mentioned before, this means that their results only apply to bipartite graphs. Talwar @cite_9 shows that the frugality ratio of VCG is a... | {
"cite_N": [
"@cite_5",
"@cite_9",
"@cite_3"
],
"mid": [
"2061256213",
"1537430179",
"2046744707"
],
"abstract": [
"We consider the problem of selecting a low-cost s - t path in a graph where the edge costs are a secret, known only to the various economic agents who own them. To s... |
cs0606124 | 1498463151 | In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These structural relationships defined by the hierarchy in the graphs act as a constraint on t... | Both of these problems have many practical applications, in particular, graph isomorphism has received a lot of attention in the area of computer vision. Images or objects can be represented as a graph. A weighted graph can be used to formulate a structural description of an object @cite_24 . There have been two main a... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_8",
"@cite_9",
"@cite_21",
"@cite_24",
"@cite_0",
"@cite_27",
"@cite_20"
],
"mid": [
"1967974926",
"1594073672",
"2161444532",
"",
"2006836707",
"2035143052",
"2108182844",
"2107792892",
"2013563330... |
cs0606124 | 1498463151 | In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These structural relationships defined by the hierarchy in the graphs act as a constraint on t... | In @cite_6 , graph matching is applied to conceptual system matching for translation. The work is very similar to ontology alignment, however, the authors formalize their problem in terms of any conceptual system rather than restricting the work specifically to an ontological formalization of a domain. They formalize c... | {
"cite_N": [
"@cite_6"
],
"mid": [
"1979842553"
],
"abstract": [
"ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal structure of systems by itself, or in combination with... |
quant-ph0605181 | 2119968904 | A celebrated important result due to (2002 Commun. Math. Phys. 227 605–22) states that providing additive approximations of the Jones polynomial at the kth root of unity, for constant k=5 and k≥7, is BQP-hard. Together with the algorithmic results of (2005) and (2002 Commun. Math. Phys. 227 587–603), this gives perhaps... | Since the first publication of the results presented here (in preliminary form) @cite_26 , they were already used in several contexts: Shor and Jordan @cite_15 built on the methods we develop here to prove universality of a variant of the Jones polynomial approximation problem, in the model of quantum computation with ... | {
"cite_N": [
"@cite_36",
"@cite_15",
"@cite_26",
"@cite_21"
],
"mid": [
"1632584182",
"1616071251",
"2137459590",
"45689951"
],
"abstract": [
"In the first 36 pages of this paper, we provide polynomial quantum algorithms for additive approximations of the Tutte polynomial,... |
cs0605080 | 2950591296 | Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce hig... | In the overlay-router approach such as OMNI @cite_5 and TOMA @cite_13 , reliable servers are installed across the network to act as application-level multicast routers. The content is transmitted from the source to a set of receivers on a multicast tree consisting of the overlay servers. This approach is designed to be... | {
"cite_N": [
"@cite_5",
"@cite_13"
],
"mid": [
"2098995343",
"1568206987"
],
"abstract": [
"This paper presents an overlay architecture where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming applications. These MSNs are ... |
cs0605080 | 2950591296 | Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce hig... | The P2P approach requires no extra resources. Several proposals have been designed to handle small groups. Narada @cite_0 , MeshTree @cite_7 , and Hostcast @cite_10 are examples of distributed mesh-first'' algorithms where nodes arrange themselves into well-connected mesh on top of which a routing protocol is run to de... | {
"cite_N": [
"@cite_0",
"@cite_10",
"@cite_7"
],
"mid": [
"2123732385",
"",
"1926875216"
],
"abstract": [
"The conventional wisdom has been that Internet protocol (IP) is the natural protocol layer for implementing multicast related functionality. However, more than a decade after... |
cs0605080 | 2950591296 | Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce hig... | Other tree-first'' protocols like ZigZag @cite_17 and NICE @cite_8 , are topology-aware clustering-based protocols which are designed to support wide-area size multicast for low bandwidth application. However, they do not consider individual node fan-out capability. Rather, they bound the overlay fan-out using a (globa... | {
"cite_N": [
"@cite_2",
"@cite_8",
"@cite_1",
"@cite_17"
],
"mid": [
"2118116239",
"2129807746",
"2106432824",
""
],
"abstract": [
"We propose an application level multicast approach, Topology Aware Grouping (TAG), which exploits underlying network topology information to ... |
cs0605080 | 2950591296 | Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce hig... | Landmark clustering is a general concept to construct topology-aware overlays. @cite_9 use such an approach to build a multicast topology-aware CAN overlay network. Prior to joining the overlay network, a newcomer has to measure its distance to each landmark. The node then orders the landmarks according to its distance... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2148647281"
],
"abstract": [
"A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay netwo... |
cs0605097 | 1681051970 | We introduce knowledge flow analysis, a simple and flexible formalism for checking cryptographic protocols. Knowledge flows provide a uniform language for expressing the actions of principals, assump- tions about intruders, and the properties of cryptographic primitives. Our approach enables a generalized two-phase ana... | The first formalisms designed for reasoning about cryptographic protocols are belief logics such as BAN logic @cite_27 , used by the Convince tool @cite_14 with the HOL theorem prover @cite_40 , and its generalizations (GNY @cite_32 , AT @cite_8 , and SVO logic @cite_37 which the C3PO tool @cite_7 employs with the Isab... | {
"cite_N": [
"@cite_37",
"@cite_14",
"@cite_18",
"@cite_7",
"@cite_8",
"@cite_28",
"@cite_21",
"@cite_1",
"@cite_32",
"@cite_40",
"@cite_27",
"@cite_23",
"@cite_5",
"@cite_31",
"@cite_11"
],
"mid": [
"2169216703",
"113821320",
"2170718011",
... |
cs0605097 | 1681051970 | We introduce knowledge flow analysis, a simple and flexible formalism for checking cryptographic protocols. Knowledge flows provide a uniform language for expressing the actions of principals, assump- tions about intruders, and the properties of cryptographic primitives. Our approach enables a generalized two-phase ana... | Specialized model checkers such as Casper @cite_18 , Mur @math @cite_28 , Brutus @cite_21 , TAPS @cite_24 , and ProVerif @cite_15 have been successfully used to analyze security protocols. These tools are based on state space exploration which leads to an exponential complexity. Athena @cite_11 is based on a modificati... | {
"cite_N": [
"@cite_18",
"@cite_28",
"@cite_41",
"@cite_36",
"@cite_21",
"@cite_3",
"@cite_24",
"@cite_19",
"@cite_0",
"@cite_15",
"@cite_16",
"@cite_12",
"@cite_11"
],
"mid": [
"2170718011",
"2150682469",
"2118034427",
"1603799276",
"203257... |
cs0605097 | 1681051970 | We introduce knowledge flow analysis, a simple and flexible formalism for checking cryptographic protocols. Knowledge flows provide a uniform language for expressing the actions of principals, assump- tions about intruders, and the properties of cryptographic primitives. Our approach enables a generalized two-phase ana... | Proof building tools such as NRL, based on Prolog @cite_1 , have also been helpful for analyzing security protocols. However, they are not fully automatic and often require extensive user intervention. Model checkers lead to completely automated tools which generate counterexamples if a protocol is flawed. For theorem-... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2003915781"
],
"abstract": [
"The NRL Protocol Analyzer is a prototype special-purpose verification tool, written in Prolog, that has been developed for the analysis of cryptographic protocols that are used to authenticate principals and services and distribute... |
cs0605103 | 2951242165 | Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality, monotonicity and so on). For scalability, we require fast linear time algorithms. The popular piecewise linear model can determine where the d... | While we focus on segmentation, there are many methods available for fitting models to continuous variables, such as a regression, regression decision trees, Neural Networks @cite_23 , Wavelets @cite_39 , Adaptive Multivariate Splines @cite_46 , Free-Knot Splines @cite_26 , Hybrid Adaptive Splines @cite_19 , etc. | {
"cite_N": [
"@cite_26",
"@cite_39",
"@cite_19",
"@cite_23",
"@cite_46"
],
"mid": [
"1986096508",
"2158940042",
"2069371995",
"1554944419",
"2102201073"
],
"abstract": [
"Abstract Polynomial splines are often used in statistical regression models for smooth respons... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | El @cite_2 consider the wireless transmission problem when the packets have different power functions, giving an iterative algorithm that converges to an optimal solution. They also show how to extend their algorithm to handle the case when the buffer used to store active packets has bounded size and the case when pack... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2107314057"
],
"abstract": [
"The paper develops algorithms for minimizing the energy required to transmit packets in a wireless environment. It is motivated by the following observation: In many channel coding schemes it is possible to significantly lower the ... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | Pruhs, van Stee, and Uthaisombut @cite_10 consider the laptop problem version of minimizing makespan for jobs having precedence constraints where all jobs are released immediately and @math . Their main observation, which they call the power equality , is that the sum of the powers of the machines is constant over time... | {
"cite_N": [
"@cite_1",
"@cite_10",
"@cite_8"
],
"mid": [
"2012989825",
"2097541335",
"2607875432"
],
"abstract": [
"We give a new and efficient approximation algorithm for scheduling precedence-constrained jobs on machines with different speeds. The problem is as follows. We are ... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | Minimizing the makespan of tasks with precedence constraints has also been studied in the context of project management. Speed scaling is possible when additional resources can be used to shorten some of the tasks. Pinedo @cite_0 gives heuristics for some variations of this problem. | {
"cite_N": [
"@cite_0"
],
"mid": [
"1570584007"
],
"abstract": [
"Introduction.- Manufacturing Models.- Service Models.- Project Planning and Scheduling.- Machine Scheduling and Job Shop Scheduling.- Scheduling of Flexible Assembly Systems.- Economic Lot Scheduling.- Planning and Scheduling in Su... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | The only previous power-aware algorithm to minimize total flow is by Pruhs, Uthaisombut, and Woeginger @cite_20 , who consider scheduling equal-work jobs on a uniprocessor. In this setting, they observe that jobs can be run in order of release time and then prove the following relationships between the speed of each jo... | {
"cite_N": [
"@cite_20"
],
"mid": [
"1532943894"
],
"abstract": [
"We consider the bi-criteria problem of minimizing the average flow time (average response time) of a collection of dynamically released equi-work processes subject to the constraint that a fixed amount of energy is available. We a... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | The idea of power-aware scheduling was proposed by @cite_17 , who use trace-based simulations to estimate how much energy could be saved by slowing the processor to remove idle time. @cite_5 formalize this problem by assuming each job has a deadline and seeking the minimum-energy schedule that satisfies all deadlines. ... | {
"cite_N": [
"@cite_5",
"@cite_4",
"@cite_17"
],
"mid": [
"2099961254",
"2131218499",
""
],
"abstract": [
"The energy usage of computer systems is becoming an important consideration, especially for battery-operated systems. Various methods for reducing energy consumption have bee... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | Power-aware scheduling of jobs with deadlines has also been considered with the goal of minimizing the CPU's maximum temperature. @cite_4 propose this problem and give an offline solution based on convex programming. Bansal and Pruhs @cite_3 analyze the online algorithms discussed above in the context of minimizing max... | {
"cite_N": [
"@cite_4",
"@cite_3"
],
"mid": [
"2131218499",
"2180738807"
],
"abstract": [
"We first consider online speed scaling algorithms to minimize the energy used subject to the constraint that every job finishes by its deadline. We assume that the power required to run at speed s i... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | A different variation is to assume that the processor can only choose between discrete speeds. @cite_7 show that minimizing energy consumption in this setting while meeting all deadlines is NP-hard, but give approximations for some special cases. | {
"cite_N": [
"@cite_7"
],
"mid": [
"1517415100"
],
"abstract": [
"We study the problem of non-preemptive scheduling to minimize energy consumption for devices that allow dynamic voltage scaling. Specifically, consider a device that can process jobs in a non-preemptive manner. The input consists o... |
cs0605126 | 2951388088 | We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy consumption and a scheduling metric. For makespan, we give linear-time algorithms to compute all non-dominated solutions for the general uniprocessor problem and for the multiprocessor problem... | Another algorithmic approach to power management is to identify times when the processor or parts of it can be partially or completely powered down. Irani and Pruhs @cite_15 survey work along these lines as well as approaches based on speed scaling. | {
"cite_N": [
"@cite_15"
],
"mid": [
"2005012890"
],
"abstract": [
"We survey recent research that has appeared in the theoretical computer science literature on algorithmic problems related to power management. We will try to highlight some open problem that we feel are interesting. This survey p... |
cs0605135 | 2952537745 | In this work we focus on the general relay channel. We investigate the application of estimate-and-forward (EAF) to different scenarios. Specifically, we consider assignments of the auxiliary random variables that always satisfy the feasibility constraints. We first consider the multiple relay channel and obtain an ach... | An extension of the relay scenario to a hybrid broadcast relay system was introduced in @cite_24 in which the authors applied a combination of EAF and DAF strategies to the independent broadcast channel with a single common message, and then extended this strategy to the multi-step conference. In @cite_5 we used both a... | {
"cite_N": [
"@cite_24",
"@cite_5",
"@cite_25"
],
"mid": [
"140150137",
"2135306111",
""
],
"abstract": [
"We develop communication strategies for the rate-constrained interactive decoding of a message broadcast to a group of interested users. This situation diers from the relay c... |
quant-ph0604141 | 2949446743 | We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of approximately 45 , thereby improving on a previous bound of 50 (due to Razborov). Our precise quantum circuit model enables perfect gates from the Clifford group (CNOT, Hadamard, S, X, Y, Z) and arbitrary additional one-qu... | Finally, we note that our work is related to, and partly stimulated by, the circle of ideas surrounding measurement-based quantum computation that was largely initiated by @cite_1 @cite_9 . | {
"cite_N": [
"@cite_9",
"@cite_1"
],
"mid": [
"2035993353",
"1490521149"
],
"abstract": [
"We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quan... |
cs0604015 | 2953251814 | Although the Internet AS-level topology has been extensively studied over the past few years, little is known about the details of the AS taxonomy. An AS "node" can represent a wide variety of organizations, e.g., large ISP, or small private business, university, with vastly different network characteristics, external ... | Several works have developed techniques decomposing the AS topology into different levels or tiers based on connectivity properties of BGP-derived AS graphs. Govindan and Reddy @cite_13 propose a classification of ASes into four levels based on their AS degree. Ge . @cite_5 classify ASes into seven tiers based on infer... | {
"cite_N": [
"@cite_0",
"@cite_5",
"@cite_13"
],
"mid": [
"2160565743",
"1846523235",
"2165743744"
],
"abstract": [
"The delivery of IP traffic through the Internet depends on the complex interactions between thousands of autonomous systems (AS) that exchange routing information u... |
math0603097 | 2949404783 | We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with ... | For a comprehensive bibliography on circle packings and circle patterns we refer to Stephenson's monograph @cite_17 . Here, we can only attempt to briefly discuss some of the the most important and most closely related results. | {
"cite_N": [
"@cite_17"
],
"mid": [
"2082107757"
],
"abstract": [
"Part I. An Overview of Circle Packing: 1. A circle packing menagerie 2. Circle packings in the wild Part II. Rigidity: Maximal Packings: 3. Preliminaries: topology, combinatorics, and geometry 4. Statement of the fundamental resul... |
math0603097 | 2949404783 | We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with ... | Recently, Schlenker has treated weighted Delaunay triangulations in piecewise flat and piecewise hyperbolic surfaces using a deformation method @cite_12 . He obtains an existence and uniqueness theorem [Theorem 1.4] schlenker05b with the same scope as Theorem , but the conditions for existence are in terms of angle sum... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2951776094"
],
"abstract": [
"We consider hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyper... |
math0603097 | 2949404783 | We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with ... | The research for this article was conducted almost entirely while I enjoyed the hospitality of the , where I participated in the Research in Pairs Program together with Jean-Marc Schlenker, who was working on his closely related paper @cite_12 . I am grateful for the excellent working conditions I experienced in Oberwo... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2951776094"
],
"abstract": [
"We consider hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyper... |
cs0603115 | 1539159366 | The Graphic Processing Unit (GPU) has evolved into a powerful and flexible processor. The latest graphic processors provide fully programmable vertex and pixel processing units that support vector operations up to single floating-point precision. This computational power is now being used for general-purpose computatio... | * Libraries based on a floating-point representation The actual trend of CPUs is to have highly optimized floating-point operators. Some libraries, such as the MPFUN @cite_8 , exploit these floating-point operators by using an array of floating-point number. | {
"cite_N": [
"@cite_8"
],
"mid": [
"2005242289"
],
"abstract": [
"A new version of a Fortran multiprecision computation system, based on the Fortran 90 language, is described. With this new approach, a translator program is not required—translation of Fortran code for multiprecision is accomplish... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.