Search Results

Rank-Biased Overlap (RBO) is a popular measure of the similarity between two rankings. A key characteristic of RBO is that it can be computed even when the rankings are not fully seen and only a prefix is known, but this introduces uncertainty in the ...

Motivated by identifying equations to automate the discovery of conjectures about sharp bounds on combinatorial objects, we introduce a CP model to acquire Boolean-arithmetic equations (BAE) from a table providing sharp bounds for various ...

We introduce a new graph-theoretic concept in the area of network monitoring. A set M of vertices of a graph G is a distance-edge-monitoring set if for every edge e of G, there are a vertex x of M and a vertex y of G such that e belongs to all ...

Linear matrix inequalities (LMIs) are ubiquitous in modern control theory, as well as in a variety of other fields in science and engineering. Their analytic centers, i.e. the maximum determinant elements of the feasible set spanned by these LMIs, are the ...

Naturally occurring disturbances and malicious attacks can lead to faults in synchronizing the clocks of two network nodes. In this article, we investigate the fundamental resilience bounds of network clock synchronization for a system of N nodes ...

We consider multistage stochastic programming problems in which the random parameters have finite support, leading to optimization over a finite scenario set. There has been recent interest in dual bounds for such problems, of two types. One, known as ...

In this work we introduce a novel approach to the problem of cardinality estimation over multijoin queries. Our approach leveraging randomized hashing and data sketching to tighten these bounds beyond the current state of the art. We demonstrate that ...

In general, multistage stochastic optimization problems are formulated on the basis of continuous distributions describing the uncertainty. Such “infinite” problems are practically impossible to solve as they are formulated, and finite tree approximations ...

In this paper, we consider a binary quadratic program (BQP) with random objective coefficients. Given only information on the marginal distributions of the objective coefficients, we propose a tight bound on the expected optimal value of the random BQP. ...

The vehicle routing problem with drones VRPD is inspired by the increasing interest in commercial drone delivery by companies such as Amazon, Google, DHL, and Walmart. In our model, a fleet of m homogeneous trucks each carries k drones with a speed of α ...

In this paper, we offer several lower bounds on eigenvalue summation for the solution of the Lyapunov matrix differential equation applying index matrix eigenvalue inequalities and Hölder inequality. Further, we give a numerical example to illustrate ...

We study a dynamic network game between an attacker and a user. The user wishes to find a shortest path between a pair of nodes in a directed network, and the attacker seeks to interdict a subset of arcs to maximize the user's shortest-path cost. In ...

In this paper, we consider a cognitive scenario where an energy harvesting secondary user shares the spectrum with a primary user. The secondary source helps the primary source in delivering its undelivered packets during periods of silence of the ...

New generalised divergence measure for monotonically increasing functions is proposed and properties, bounds, some relations are derived. Further, new divergence measure of this new generalised measure's class is introduced as well with properties, ...

Consider (typically large) multistage stochastic programs, which are defined on scenario trees as the basic data structure. It is well known that the computational complexity of the solution depends on the size of the tree, which itself increases typically ...

The rank modulation scheme has been proposed for efficient writing and storing data in nonvolatile memory storage. Error correction in the rank modulation scheme is done by considering permutation codes. In this paper, we consider codes in the set of all ...

Network coding is a new direction in the information and communication theory. In this area algebraic coding for wire channels is based on Grassmann metric which is also called subspace metric. In the theory the main problem is to construct codes with ...

Shannon Entropy, for discrete-valued random variables, plays an important roles in information theory, with applicability in cryptography and communication theory. The purpose of this paper is to present a new bound for the Shannon Entropy. For this we ...

While most current planning methods have focused on the development of scalable approximate algorithms, they often neglect the important aspect of providing algorithmic performance guarantees, or their tightness is sacrificed to improve efficiency. In ...

Since coding has become a basic tool for practically all communication/electronic devices, it is important to carefully study the error patterns that actually occur. This allows correction of only partial errors rather than those which ...