Modern network elements are increasingly required to deal with heterogeneous traffic. Recent works consider processing policies for buffers that hold packets with different processing requirements (number of processin...
详细信息
Modern network elements are increasingly required to deal with heterogeneous traffic. Recent works consider processing policies for buffers that hold packets with different processing requirements (number of processing cycles needed before a packet can be transmitted out) but uniform value, aiming to maximize the throughput, i.e., the number of transmitted packets. Other developments deal with packets of varying value but uniform processing requirement (each packet requires one processing cycle);the objective here is to maximize the total transmitted value. In this paper, we consider a more general problem, combining packets with both nonuniform processing and nonuniform values in the same queue. We study the properties of various processing orders in this setting. We show that in the general case, natural processing policies have poor performance guarantees, with linear lower bounds on their competitive ratio. Moreover, we show several adversarial lower bounds for every priority queue and even for every online policy. On the positive side, in the special case when only two different values are allowed, 1 and V, we present a policy that achieves competitive ratio (1 + (W + 2/V)), where W is the maximal number of required processing cycles. We also consider copying costs during admission.
What does it mean for an algorithmic decision-making system to be "fair" or "non-discriminatory" in terms that can be operationalized? Providing a rigorous understanding of these terms has long bee...
详细信息
What does it mean for an algorithmic decision-making system to be "fair" or "non-discriminatory" in terms that can be operationalized? Providing a rigorous understanding of these terms has long been a preoccupation of moral and political philosophers. This article draws on such work to elucidate emerging debates about fair algorithms.
There are a number of research challenges associated with Internet of Things (IoT) security, and one of these challenges is to design novel frameworks to mine malicious frequent patterns for identifying misuse and det...
详细信息
There are a number of research challenges associated with Internet of Things (IoT) security, and one of these challenges is to design novel frameworks to mine malicious frequent patterns for identifying misuse and detecting anomalies without incurring high computational costs (e.g., due to generation and analysis of unnecessary patterns and gap creation between patterns). Association rule mining is a popular approach in the literature;hence, in this paper, we critically analyze existing association rule mining techniques. We then present a framework for mining malicious frequent patterns in an IoT deployment, prior to evaluating the utility of the proposed framework using data from a Pakistan-based organization.
There are many areas of design and test for which we have widely known solutions, often involving published algorithms and standards. Take Automatic Test Program Generation (ATPG), for instance. You can read about ATP...
详细信息
There are many areas of design and test for which we have widely known solutions, often involving published algorithms and standards. Take Automatic Test Program Generation (ATPG), for instance. You can read about ATPG algorithms in textbooks, the literature is widely available, and most IC test engineers use commercially available ATPG tools.
A liquid system provides durable object storage based on spreading redundantly generated data across a network of hundreds to thousands of potentially unreliable storage nodes. A liquid system uses a combination of a ...
详细信息
A liquid system provides durable object storage based on spreading redundantly generated data across a network of hundreds to thousands of potentially unreliable storage nodes. A liquid system uses a combination of a large code, lazy repair, and flow storage organization. We show that a liquid system can be operated to enable flexible and essentially optimal combinations of storage durability, storage overhead, repair bandwidth usage, and access performance.
This article describes the essential requirements of a geographical information system (GIS), which can visualize, analyze, and measure the spatial data acquired by a drone. The article further delves into the specifi...
详细信息
This article describes the essential requirements of a geographical information system (GIS), which can visualize, analyze, and measure the spatial data acquired by a drone. The article further delves into the specific algorithms useful for building a GIS system that will be computationally efficient and have a small memory footprint. The GIS needs to be specifically designed for a size-, weight-, and power (SWAP)-constrained system that will operate in the air for a long duration to acquire spatial data without any conventional power supply. Thus, the custom-built GIS needs to employ frequently used computing methods that provide optimal memory and power usage as well.
It is a pleasure to introduce this Special Issue on the 2016 Workshop on the algorithmic Foundations of Robotics (WAFR). WAFR is a prestigious, single-track, biennial international meeting devoted to recent advances o...
详细信息
It is a pleasure to introduce this Special Issue on the 2016 Workshop on the algorithmic Foundations of Robotics (WAFR). WAFR is a prestigious, single-track, biennial international meeting devoted to recent advances on algorithmic problems in robotics. Robot algorithms are an important building block of robotic systems and are used to process inputs from users and sensors, perceive and build models of the environment, plan low-level motions and high-level tasks, control robotic actuators, and coordinate actions across multiple systems. Developing and analyzing these algorithms raise complex challenges, both theoretical and practical. Advances in the algorithmic foundations of robotics have applications to manufacturing, medicine, distributed robotics, human-robot interaction, intelligent prosthetics, computer animation, computational biology, and many other areas.
Functionally similar non-coding RNAs are expected to be similar in certain regions of their secondary structures. These similar regions are called common structure motifs, and are structurally conserved throughout evo...
详细信息
Functionally similar non-coding RNAs are expected to be similar in certain regions of their secondary structures. These similar regions are called common structure motifs, and are structurally conserved throughout evolution to maintain their functional roles. Common structure motif identification is one of the critical tasks in RNA secondary structure analysis. Nevertheless, current approaches suffer several limitations, and/or do not scale with both structure size and the number of input secondary structures. In this work, we present a method to transform the conserved base pair stems into transaction items and apply frequent itemset mining to identify common structure motifs existing in a majority of input structures. Our experimental results on telomerase and ribosomal RNA secondary structures report frequent stem patterns that are of biological significance. Moreover, the algorithms utilized in our method are scalable and frequent stem patterns can be identified efficiently among many large structures. (C) 2018 Elsevier Ltd. All rights reserved.
In this paper, we present a short introduction to the special section on nature-inspired optimization methods and their industry applications. The focus of this paper is on a brief presentation of the main idea (topic...
详细信息
In this paper, we present a short introduction to the special section on nature-inspired optimization methods and their industry applications. The focus of this paper is on a brief presentation of the main idea (topics, algorithms, engineering problems) of the papers which were accepted for the publication in this special section.
The papers in this special issue introduce the reader to the theory, algorithms, and applications of principal component analysis (PCA) and its many extensions. The aim of PCA is to reduce the dimensionality of multiv...
详细信息
The papers in this special issue introduce the reader to the theory, algorithms, and applications of principal component analysis (PCA) and its many extensions. The aim of PCA is to reduce the dimensionality of multivariate data while preserving as much of the relevant information as possible. It is often the first step in various types of exploratory data analysis, predictive modeling, and classification and clustering tasks, and finds applications in biomedical imaging, computer vision, process fault detection, recommendation systems’ design, and many more domains.
暂无评论