node1 int64 5 630k | abstract1 stringlengths 2 31.6k ⌀ | node2 int64 12 630k | abstract2 stringlengths 4 31.6k ⌀ | jaccard_score float64 0 0.88 |
|---|---|---|---|---|
5 | Kullback-Leibler divergence and the Neyman-Pearson lemma are two fundamental concepts in statistics. Both are about likelihood ratios: Kullback-Leibler divergence is the expected log-likelihood ratio, and the Neyman-Pearson lemma is about error rates of likelihood ratio tests. Exploring this connection gives another st... | 436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 0 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 49,917 | We discuss robustness against mislabeling in multiclass labels for classification problems and propose two algorithms of boosting, the normalized Eta-Boost.M and Eta-Boost.M, based on the Eta-divergence. Those two boosting algorithms are closely related to models of mislabeling in which the label is erroneously exchang... | 0.111111 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 69,228 | Our purpose is to estimate conditional probabilities of output labels in multiclass classification problems. Adaboost provides highly accurate classifiers and has potential to estimate conditional probabilities. However, the conditional probability estimated by Adaboost tends to overfit to training samples. We propose ... | 0.105263 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 136,127 | In this article, several boosting methods are discussed, which are notable implementations of the ensemble learning. Starting from the firstly introduced "boosting by filter" which is an embodiment of the proverb "Two heads are better than one", more advanced versions of boosting methods "AdaBoost" and "U-Boost" are in... | 0.125 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 389,400 | In this paper we consider robust parameter estimation based on a certain cross entropy and divergence. The robust estimate is defined as the minimizer of the empirically estimated cross entropy. It is shown that the robust estimate can be regarded as a kind of projection from the viewpoint of a Pythagorean relation bas... | 0 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 432,715 | Boosting is known as a gradient descent algorithm over loss functions. It is often pointed out that the typical boosting algorithm, Adaboost, is highly affected by outliers. In this letter, loss functions for robust boosting are studied. Based on the concept of robust statistics, we propose a transformation of loss fun... | 0.105263 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 94,584 | null | 0.027027 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 282,290 | null | 0 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 605,546 | null | 0 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 620,759 | :This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition. After introducing the basic concepts, the book examines techniques for modelling probability density functions and the properties and merits of the multi-layer perceptron and radial basis ... | 0 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 564,877 | null | 0.05 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 564,235 | null | 0.090909 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 594,837 | null | 0 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 479,177 | This paper addresses the problem of improving the accuracy of an hypothesis output by a learning algorithm in the distribution-free (PAC) learning model. A concept class is learnable (or strongly learnable) if, given access to a source of examples of the unknown concept, the learner with high probability is able to out... | 0.012346 |
436,405 | We aim at an extension of AdaBoost to U-Boost, in the paradigm to build a stronger classification machine from a set of weak learning machines. A geometric understanding of the Bregman divergence defined by a generic convex function U leads to the U-Boost method in the framework of information geometry extended to the ... | 586,607 | null | 0 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 357,875 | In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing elements communicate via a multistage interconnection network, and that the system is synchronous. When two or more packets are simultaneously s... | 0 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 214,023 | null | 0.007299 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 317,448 | null | 0 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 319,987 | In this paper, we analyze the behavior of packet-switched communication networks in which packets arrive dynamically at the nodes and are routed in discrete time steps across the edges. We focus on a basic adversarial model of packet arrival and path determination for which the time-averaged arrival rate of packets req... | 0.037037 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 334,185 | We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. We examine the stability of queuing networks and... | 0.071429 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 95,255 | null | 0 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 294,124 | We show that a minimum edge coloring of a bipartite graph can be found in $O(\Delta m)$ time, where $\Delta$ and m denote the maximum degree and the number of edges of G, respectively. It is equivalent to finding a perfect matching in a k-regular bipartite graph in O(km) time.By sharpening the methods, a minimum edge c... | 0 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 96,319 | null | 0 |
17 | We consider a problem motivated by the desire to provide flexible, rate-based, quality of service guarantees for packets sent over input queued switches and switch networks. Our focus is solving a type of online traffic scheduling problem, whose input at each time step is a set of desired traffic rates through the swit... | 610,127 | This paper introduces a protocol for scheduling of packets in high-capacity switches, termed weighted sequential greedy scheduling (WSGS). WSGS is a simple, greedy algorithm that uses credits to reserve bandwidth for input-output pairs. By using a pipeline technique, WSGS implemented by the current technology readily s... | 0 |
357,875 | In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing elements communicate via a multistage interconnection network, and that the system is synchronous. When two or more packets are simultaneously s... | 322,302 | Providing up-to-date input to users' applications is an important data management problem for a distributed computing environment, where each data storage location and intermediate node may have specific data available, storage limitations, and communication links available. Sites in the network request data items and ... | 0 |
357,875 | In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing elements communicate via a multistage interconnection network, and that the system is synchronous. When two or more packets are simultaneously s... | 612,447 | The concept of tracking fluid policies by packetized policies is extended to input queueing switches. It is considered that the speedup of the switch is one. One of the interesting applications of the tracking policy in TDMA satellite switches is elaborated. For the special case of 2 × 2 switches, it is shown tha... | 0 |
357,875 | In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing elements communicate via a multistage interconnection network, and that the system is synchronous. When two or more packets are simultaneously s... | 626,646 | In this paper, we consider broadcast-and-select networks based on optical passive stars. In these single-hop networks, communicating pairs can exchange messages directly, without the need to store information at intermediate nodes for later forwarding. Messages are transmitted in a packetized way, and each message has ... | 0 |
214,023 | null | 2,732 | Stratified Round Robin is a fair-queueing packet scheduler which has good fairness and delay properties, and low quasi-O(1) complexity. It is unique among all other schedulers of comparable complexity in that it provides a single packet delay bound that is independent of the number of flows. Importantly, it is also ame... | 0.007194 |
214,023 | null | 5,107 | Growth of performance sensitive applications, such as voice and multimedia, has led to widespread adoption of resource virtualization by a variety of service providers (xSPs). For instance, Internet Service Providers (ISPs) increasingly differentiate their offerings by means of customized services, such as virtual priv... | 0.007463 |
214,023 | null | 20,690 | Deficit Round Robin (DRR) is a scheduling algorithm which provides fair queuing at O(1) complexity. However, due to its round robin structure, its latency properties are not adequate for latency-critical applications, such as voice. For this reason, router manufacturers implement variants of the DRR algorithm which gua... | 0 |
214,023 | null | 21,681 | Performance evaluation of computer networks through tratitional packet-level simulation is becoming increasingly difficult as networks grow in size along different dimensions. Due to its higher level of abstraction, fluid simulation is a promising approach for evaluating large-scale network models. In this paper we foc... | 0 |
214,023 | null | 25,150 | We propose and evaluate a multi-thread memory scheduler that targets high performance CMPs. The proposed memory scheduler is based on concepts originally developed for network fair queuing scheduling algorithms. The memory scheduler is fair and provides Quality of Service (QoS) while improving system performance. On a ... | 0 |
214,023 | null | 31,953 | For a given TCP flow, exogenous losses are those occurring on links other than the flow's bottleneck link. Exogenous losses are typically viewed as introducing undesirable "noise" into TCP's feedback control loop, leading to inefficient network utilization and potentially severe global unfairness. This has prompted muc... | 0 |
214,023 | null | 33,741 | In this paper we investigate the problem of scalable admission control for real-time traffic in sink-tree networks employing per-aggregate resource management policies, like MPLS or DiffServ. Every traffic flow entering the network at an ingress node, and flowing towards a given egress node, specifies its leaky-bucket ... | 0 |
214,023 | null | 35,871 | A queuing analytical model is presented to investigate the performances of different sleep and wakeup strategies in a solar-powered wireless sensor/mesh network where a solar cell is used to charge the battery in a sensor/mesh node. While the solar radiation process (and, hence, the energy generation process in a solar... | 0.007519 |
214,023 | null | 35,888 | We analyse a discrete-time queueing model with packet arrivals that are either classified as delay-sensitive (type 1) or delay-tolerant (type 2). The queue has a single server and each packet requires a service time of exactly one slot. The prominent feature of this model is its reservation-based queueing discipline, w... | 0 |
214,023 | null | 36,376 | Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network's resource usage efficiency while supporting end-to-end QoS guarantees. This paper focuses on the intra-path load balancing problem: How to partition the end-to-end QoS requirement of an aggreg... | 0.007092 |
214,023 | null | 36,680 | This paper presents WFQ- based scheduling algorithm that allocates network resources in a fair way by taking into account class of service issues. Presented model is flexible in that different traffic flows are grouped into service classes and are given such QoS characteristics as bandwidth and delay. To adjust dynamic... | 0 |
214,023 | null | 36,788 | Packet-switch fabrics with widely varying characteristics are currently deployed in the domains of both communications and computer interconnection networks. For economical reasons, it would be highly desirable that a single switch fabric could accommodate the needs of a variety of heterogeneous services and applicatio... | 0 |
214,023 | null | 37,847 | Timing has a key role in several traffic control functions encountered in modern packet-switched networks. In order to be effective, a timing unit must provide fine resolution, be simple to implement and scale well with the number of controlled traffic streams. This paper addresses the design, implementation and evalua... | 0 |
214,023 | null | 40,807 | In this paper we consider packet networks loaded by admissible traffic patterns, i.e., by traffic patterns that, if optimally routed, do not overload network resources. We prove that simple distributed dynamic routing and scheduling algorithms based upon link state information can achieve the same network throughput as... | 0 |
214,023 | null | 43,591 | The well-known Generalized Processor Sharing (GPS) scheduling principle and its variants have received tremendous research efforts due to their appealing properties of fairness, traffic isolation, and work conservation. Traffic self-similarity is highly detrimental to the performance of scheduling mechanisms and commun... | 0 |
214,023 | null | 43,907 | Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this problem. The heuristic nature of existing DRL solutions makes their behavior unpredictable and analytically untractable. In this paper we treat ... | 0 |
214,023 | null | 44,438 | Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, which have a combined annual market of tens of billions of dollars, and equipment vendors spend hundreds of millions of dollars on memory each year... | 0 |
214,023 | null | 51,186 | Network mobility (NEMO) supports a network moving as a whole, and this may cause the bandwidth on its wireless link varying with time and locations. The quick and frequent bandwidth fluctuation makes the resource reservation and admission control lack of scalability but with heavy overhead. A feasible solution for this... | 0 |
214,023 | null | 52,185 | Active and Programmable networks change the functionality of intermediate nodes by using agents and active packets. This paper presents a novel packet scheduling scheme called Active Scheduling to maintain QoS in virtual private networks (VPNs) within the domain of adaptive and programmable networks. In Active Scheduli... | 0 |
214,023 | null | 64,953 | Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable for multiprocessors. This problem is becoming increasingly severe as the hardware industry continues to produce larger scale multi-core process... | 0.007353 |
214,023 | null | 66,321 | Class Based Weighted Fair Queueing (CBWFQ) is a very important router discipline that allows different types of Internet Protocol (IP) traffic like voice, video, and best effort data to receive the required quality of service measures they individually need. CBWFQ dynamically allocates the available bandwidth to each t... | 0 |
214,023 | null | 74,775 | In this paper, we determine the optimal shape function for a bi-directional wire under the Elmore delay model. Given a bi-directional wire of length L, let f(x) be the width of the wire at position x, 0\leq x \leq L. Let T_{DR} be the right-to-left delay. Let T_{DL} be the left-to-right delay. Let T_{BD}=\alpha T_{DR}+... | 0 |
214,023 | null | 75,370 | A wireless local area network (WLAN) or a cell with quality-of-service (QoS) guarantees for various types of traffic is considered. A centralized (i.e., star) network is adopted as the topology of a cell which consists of a base station and a number of mobile clients. Dynamic Time Division Duplexed (TDD) transmission i... | 0 |
214,023 | null | 77,171 | We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a polymorphic function is adjusted to take, as an additional argument, a proof that its type constructor argument has the desired kind. Such a pro... | 0.00641 |
214,023 | null | 77,649 | The IEEE 1149.1 Test Access Port and Boundary-Scan Architecture Standard can be used at many different levels in the integration hierarchy of a product. However there is one level where using the standard poses some difficulty. Multi-Chip Modules (MCM) belong to this level. This paper explores the problem and proposes ... | 0 |
214,023 | null | 78,495 | Using a simple analytical model, this paper addresses the following question: Should the Internet retain its best-effort-only architecture, or should it adopt one that is reservation-capable? We characterize the differences between reservation-capable and best-effort-only networks in terms of application performance an... | 0 |
214,023 | null | 78,850 | This paper describes a representation framework that offers a unifying platform for alternative systems, which learn concepts in First Order Logics. The main aspects of this framework are discussed. First of all, the separation between the hypothesis logical language (a version of the VL21 language) and the representat... | 0.006135 |
214,023 | null | 79,662 | How to control hand-off drops is a very important Quality-of-Service (QoS) issue in cellular networks. In order to keep the hand-off dropping probability below a pre-specified target value (thus providing a probabilistic QoS guarantee), we design and evaluate predictive and adaptive schemes for the bandwidth reservatio... | 0.005525 |
214,023 | null | 80,743 | Virtual environments can be used as an effective tool for training and education. This paper cites many recent examples of such systems and divides current work into virtual environment development and the development of supporting technology for distributed access. A novel supporting technology for distribution is int... | 0.007194 |
214,023 | null | 81,616 | A crucial problem for the efficient design and management of integrated services networks is how to best allocate network resources for heterogeneous and bursty traffic streams in multiplexers that support prioritized service disciplines. In this paper, we introduce a new approach for determining per-connection perform... | 0 |
214,023 | null | 81,930 | Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, and (b) location-dependent channel capacity and errors. Besides, in p... | 0.058442 |
214,023 | null | 83,509 | The WWW has a great potential of evolving into a globally distributed digital document library. The primary use of such a library is to retrieve information quickly and easily. Because of the size of these libraries, simple keyword searches often result in too many matches. More complex searches involving boolean expre... | 0 |
214,023 | null | 87,158 | This paper examines the network inter-domain routing information exchanged between backbone service providers at the major U.S. public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering c... | 0 |
214,023 | null | 87,598 | Decision support systems (DSS) and data warehousing workloads comprise an increasing fraction of the database market today. I/O capacity and associated processing requirements for DSS workloads are increasing at a rapid rate, doubling roughly every nine to twelve months [38]. In response to this increasing storage and ... | 0 |
214,023 | null | 93,830 | Academic clock routing research results has often hadlimited impact on industry practice, since such practical considerationsas hierarchical buffering, rise-time and overshoot constraints,obstacle- and legal location-checking, varying layer parasitics andcongestion, and even the underlying design flow are often ignored... | 0.006494 |
214,023 | null | 100,045 | The increased bandwidth demand for new Internet applications suggests mapping IP directly over the wavelength-division multiplexing (WDM) layer. Since reliability is such a critical issue in these broadband networks, we propose an integrated design method which addresses the problem of survivability as viewed from the ... | 0 |
214,023 | null | 100,237 | We clarify, extend, and solve a long-standing open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end delay bounds. We first focus on the difference between the time a packet finishes service in a scheduling algorithm and its virtual finish time under a GPS (Gen... | 0 |
214,023 | null | 103,992 | Service disciplines that approximate GPS have had a lot of success satisfying QoS isolation among connections in integrated services networks. In the past years, several of such disciplines were developed. However, to maintain a delay little bigger than GPS, with a fair throughput and a good worst-case fairness while r... | 0 |
214,023 | null | 105,879 | The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in ... | 0 |
214,023 | null | 108,907 | Our work targets a network architecture and accompanying algorithms for countering distributed denial-of-service (DDoS) attacks directed at an Internet server. The basic mechanism is for a server under stress to install a router throttle at selected upstream routers. The throttle can be the leaky-bucket rate at which a... | 0.007463 |
214,023 | null | 118,832 | Fair queuing is a well-studied problem in modern computer networks. However, there remains a gap between scheduling algorithms that have provably good performance, and those that are feasible and practical to implement in high speed routers. In this paper, we propose a novel packet scheduler called Stratified Round Rob... | 0.007143 |
214,023 | null | 131,858 | Time division multiple access (TDMA) based medium access control (MAC) protocols can provide QoS with guaranteed access to the wireless channel. However, in multi-hop wireless networks, these protocols may introduce scheduling delay if, on the same path, an outbound link on a router is scheduled to transmit before an i... | 0 |
214,023 | null | 134,726 | Common channel multi-hop Ad Hoc networks have some inherent constraints related to throughput and Quality of Service (QoS). Multiuser detection (MUD) based Medium Access Control (MAC) can relax some of these constraints and provide significant gains in throughput and Quality of Service (QoS). These gains can be realize... | 0 |
214,023 | null | 142,133 | Since many applications and networks do not require or provide deterministic service guarantees, stochastic service guarantee analysis is becoming increasingly important and has attracted a lot of research attention in recent years. For this, several stochastic versions of deterministic traffic models have been propose... | 0 |
214,023 | null | 233,074 | Input buffered switch architecture has become attractive for implementing high performance routers and expanding use of the Internet sees an increasing need for quality of service. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. In this paper, we first ... | 0 |
214,023 | null | 236,543 | Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and... | 0 |
214,023 | null | 238,059 | As embedded systems are being networked, often wirelessly, an increasingly larger share of their total energy budget is due to the communication. This necessitates the development of power management techniques that address communication subsystems, such as radios, as opposed to computation subsystems, such as embedded... | 0.014085 |
214,023 | null | 244,626 | ATM is a connection-oriented technology. Before two hosts can communicate, a connection has to be established between them. Consider a real-time communication application running on top of an ATM network. In order to provide the real-time service, we require the connection to provide a performance guarantee. Such deter... | 0 |
214,023 | null | 250,948 | This paper investigates a class of rate-based real-time scheduling algorithms based on the idea of general processor sharing (GPS). We extend the GPS framework for periodic and sporadic process scheduling and show the optimality of GPS-based scheduling. In particular, we propose the Earliest-Completion-Time GPS (EGPS) ... | 0 |
214,023 | null | 271,101 | We present a product information system which supports enterprise-wide access to product structure data through the World-Wide Web (WWW). This information system provides ready access to data on products, their structures, variants and configurations. To meet the needs of various enterprises and types of user, the syst... | 0 |
214,023 | null | 279,392 | Simulations of simplified protein folding models have provided much insight into solving the protein folding problem. We propose here a new off-lattice bead model, capable of simulating several different fold classes of small proteins. We present the sequence for an &agr;/&bgr; protein resembling the IgG-binding protei... | 0.007576 |
214,023 | null | 279,783 | The BURKS Project has for the past three years produced non-profit CD-ROMs of resources for students of Computer Science. Now in its third edition, BURKS is a self-contained website which incorporates a pre-installed web browser and which now spans a set of two CD-ROMs. This paper describes the techniques used to imple... | 0.007407 |
214,023 | null | 285,004 | The explosive growth in the availability of information is overwhelming traditional information management systems. Although individual pieces of information have become easy to find, the larger context in which they exist has become harder to track. These contextual questions are ideally suited to visualization since ... | 0 |
214,023 | null | 285,193 | Many practical applications of lot-sizing and scheduling problems involve start-up times. Operations research literature contains but few studies of lot-sizing models that take start-up times explicitly into account. Here, we review some of these studies, discuss the models and their complexity, and we propose further ... | 0 |
214,023 | null | 285,891 | A neural network is said to be nonoverlapping if there is at most one edge outgoing from each node. We investigate the number of examples that a learning algorithm needs when using nonoverlapping neural networks as hypotheses. We derive bounds for this sample complexity in terms of the Vapnik-Chervonenkis dimension. In... | 0 |
214,023 | null | 286,446 | We discovered a surprising law governing the spatial join selectivity across two sets of points. An example of such a spatial join is “find the libraries that are within 10 miles of schools”. Our law dictates that the number of such qualifying pairs follows a power law, whose exponent we call “pair-co... | 0 |
214,023 | null | 287,175 | The strong convergence of a broad class of outer approximation methods for minimizing a convex function over the intersection of an arbitrary number of convex sets in a reflexive Banach space is studied in a unified framework. The generic outer approximation algorithm under investigation proceeds by successive minimiza... | 0 |
214,023 | null | 287,973 | In this paper, we study discrete-time priority queueing systems fed by a large number of arrival streams. We first provide bounds on the actual delay asymptote in terms of the virtual delay asymptote. Then, under suitable assumptions on the arrival process to the queue, we show that these asymptotes are the same. We th... | 0 |
214,023 | null | 289,537 | A testing approach targeted at Hardware Description Language (HDL)-based specifications of complex control devices is proposed. For such architectures, gate-level test pattern generators require insertion of scan paths to enable the flat gate-level representations to be efficiently handled. In contrast, we present a te... | 0 |
214,023 | null | 291,399 | We explore the use of multivariate visualization techniques to support a new approach to test data selection, called observation-based testing. Applications of multivariate visualization are described, including: evaluating and improving synthetic tests; filtering regression test suites; filtering captured operational ... | 0 |
214,023 | null | 293,759 | This paper proposes optimal Boolean, stack, and FIR-Boolean hybrid filters for realizing the prediction stage in lossless grey-level image compression. New optimal design procedures for Boolean filters are introduced, where the optimality criterion is the Error Entropy (EE). The use of the EE-optimal and MAE-optimal Bo... | 0 |
214,023 | null | 294,718 | In spite of the radical enhancement of web technologies, many users still continue to experience severe difficulties in navigating web systems. One way to reduce the navigation difficulties is to provide context information that explains the current situation of users in the web systems. In this study, we empirically e... | 0 |
214,023 | null | 294,948 | For the past seven years we have taught a subject entitled Network Software and Management (NSM) for both computer science and electrical engineering students. We discuss the evolution of this subject syllabus in response to the changing requirements of the workplace environment, ever improving technology and the need ... | 0 |
214,023 | null | 298,230 | This paper proposes to use SDL block diagrams, UML class diagrams, and UML behavior diagrams like collaboration diagrams, activity diagrams, and statecharts as a visual programming language. We describe a modeling approach for flexible, autonomous production agents, which are used for the decentralization of production... | 0 |
214,023 | null | 300,500 | It is well known that the solution of the equality constrained least squares (LSE) problem minBx=d||b-Ax||2 is the limit of the solution of the unconstrained weighted least squares problem $$ \min_x\left\| \bmatrix{ \mu d \cr b } - \bmatrix{\mu B \cr A } x \right\|_2 $$ as the weight $\mu$ tends to infinity, assuming t... | 0.006803 |
214,023 | null | 301,922 | This paper proposes an algorithm named WLFVC, which is a fully distributed wireless packet scheduling algorithm based on LFVC (Leap Forward Virtual Clock), to provide streams with fairness, especially in the short time scale. This algorithm is able to allocate bandwidth to streams proportional to their weights. Thus, b... | 0 |
214,023 | null | 303,480 | The number of real-time applications, such as video-on-demand and video conferencing, is rapidly increasing. Real-time data now occupies a significant portion of network traffic. These applications require real-time service; as such, they need to bound end-to-end delays. Generally, real-time service is provided by rese... | 0 |
214,023 | null | 306,573 | Many real-time applications demand delay guarantees from the network. A network architecture designed to support these applications should be robust and scalable. The IntServ architecture provides per-flow QoS at the cost of robustness and scalability. The DiffServ architecture is robust and scalable but can provide Qo... | 0 |
214,023 | null | 307,796 | This paper proposes a detection mechanism called DCAP for a network provider to monitor incoming traffic and identify misbehaving flows without having to keep per-flow accounting at any of its routers. Misbehaving flows refer to flows that exceed their stipulated bandwidth limit. Through collaborative aggregate policin... | 0 |
214,023 | null | 308,355 | Hardware architectures based on a field of hardware-extended processors can provide flexible computing power for applications where parallelism can be exploited. For multiprocessors, the assignment of functionality to execution units can have a great impact on the performance.Additionally, finding the optimal mapping c... | 0 |
214,023 | null | 310,246 | A MultiCode-CDMA network that is capable of providing quality-of-service guarantees will find widespread application in future wireless multimedia networks. However, providing delay guarantees to time-sensitive traffic in such a network is challenging because its transmission capacity is variable even in the absence of... | 0.007576 |
214,023 | null | 310,879 | To analyze scheduling algorithms in computer networks, two models have been proposed and widely used in the literature, namely the Guaranteed Rate (GR) server model and the Latency Rate (LR) server model. While a lot scheduling algorithms have been proved to belong to GR or LR or both, it is not clear what is the relat... | 0.007246 |
214,023 | null | 313,529 | As embedded systems are being networked, often wirelessly, an increasingly larger share of their total energy budget is due to the communication. This necessitates the development of power management techniques that address communication subsystems, such as radios, as opposed to computation subsystems, such as embedded... | 0.013986 |
End of preview. Expand in Data Studio
- Downloads last month
- 2