From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

Handbook of Applied Cryptography

We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

BIOE 402. Medical Technology Assessment. 2 or 3 hours. Bioentrepreneur course. Assessment of medical technology in the context of commercialization. Objectives, competition, market share, funding, pricing, manufacturing, growth, and intellectual property; many issues unique to biomedical products. Course Information: 2 undergraduate hours. 3 graduate hours. Prerequisite(s): Junior standing or above and consent of the instructor.

“Bioinformatics” 특집을 내면서

An Introduction to MultiAgent Systems.

Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or 'prefixes' which designate network reachability among autonomous systems (AS). Point of concern in BGP is its lack of effective security measures which makes Internet vulnerable to different forms of attacks. Many solutions have been proposed till date to combat BGP security issues but not a single one is deployable in practical scenario. Any security proposal with optimal solution should offer adequate security functions, performance overhead and deployment cost. This paper critically analyzes the deployment issues of best three proposals considering trade-off between security functions and performance overhead.

Comparative analysis of

Ground users suffer from severe uplink interference originating from high altitude Unmanned Aerial Vehicle (UAV) line-of-sight channels. Using multi-armed bandit, we propose a method aiming to find the best resource block and transmit power level for a UAV dynamically paired with a ground user using Non-Orthogonal Multiple Access (NOMA). It is done according to the UAV’s location. It results in mitigating the UAV-uplink interference on its co-channel ground user and maximizing the sum of their data rate in the shared resource block. Performance is evaluated via simulating three exploration-exploitation strategies, namely, epsilon-greedy, upper confidence bound and Thompson sampling.

Uplink Interference Management in Cellular-Connected UAV Networks Using Multi-Armed Bandit and NOMA

Given a graph G, a k-dominating set of G is a subset S of its vertices with the property that every vertex of G is either in S or has at least k neighbors in S. We present a new incremental distributed algorithm to construct a k-dominating set. The algorithm constructs a monotone family of dominating sets D 1 C D 2 ... C D i ... C D k such that each D i is an i-dominating set. For unit disk graphs, the size of each of the resulting i-dominating sets is at most six times the optimal.

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks

Assume that \(m \ge 1\) autonomous mobile agents and \(0 \le b \le m\) single-agent transportation devices (called bikes) are initially placed at the left endpoint 0 of the unit interval [0, 1]. The agents are identical in capability and can move at speed one. The bikes cannot move on their own, but any agent riding bike i can move at speed \(v_i > 1\). An agent may ride at most one bike at a time. The agents can cooperate by sharing the bikes; an agent can ride a bike for a time, then drop it to be used by another agent, and possibly switch to a different bike.

The Bike Sharing Problem

In this paper, we address the problem of broadcasting in a wireless sensor network under a novel communication model: the swamping communication model. In this model, nodes communicate only with those nodes at distance greater than s and at most r from them. We consider networks of unknown topology of diameter D, with a lower bound a on the geometric distance between nodes and a parameter g = 1/α (granularity). We present broadcast algorithms for networks of nodes placed on the line and on the plane with respective time complexities O(D/l + g2) and O(Dg/l + g4), where l ∈ Θ(max{(1 - s), α}).

Broadcasting in sensor networks of unknown topology in the presence of swamping

It is a classical result of Stein and Waterman that the asymptotic number S(n) of RNA secondary structures is 1.104366 * pow(n,-3/2) * pow(2.61803,n),where the combinatorial model of RNA concerns a length n homopolymer, such that any base can pair with any other base, subject to the usual convention that hairpin loops must contain at least = 1 unpaired bases. The result of Stein and Waterman is proved by developing recursions,using generating functions and applying Bender's theorem. These recursions form the basis to compute the minimum free energy secondary structure for a given RNA sequence, with respect to the Nussinov energy model, later extended by Zuker to substantially more complicated resursions for the Turner nearest neighbor energy model.In this paper, we study combinatorial asymptotic for two special subclasses of RNA secondary structures - canonical and saturated structures.Canonical secondary structures are defined to have no lonely (isolated) base pairs. This class of secondary structures was introduced b y Bompfuenewerer et al., who noted that the runtime of Vienna RNA Package is substantially decreased when restricting computations to canonical structures. Here we provide an explanation for the speed-up, by proving that the asymptotic number of canonical RNA secondary structures is2.1614 * pow(n,-3/2) * pow(1.96798,n), a result obtained using different methods by Hofacker et al. Saturated secondary structures have the property that no base pairs can be added without violating the definition of secondary structure (i.e. introducing a pseudoknotor base triple). In the Nussinov energy model,where the energy for a base pair is -1, saturated structures correspond to kinetic traps.n prior work, we showed that the asymptotic number of saturated structures of a length n homopolymer is 1.07427 * pow(n,-3/2) * pow(2.35467,n). Here we determine the asymptotic expected number of base pairs in (quasi-) random saturated structures.

Evangelos Kranakis

Papers

Uplink Interference Management in Cellular-Connected UAV Networks Using Multi-Armed Bandit and NOMA

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks

The Bike Sharing Problem

Broadcasting in sensor networks of unknown topology in the presence of swamping

Asymptotics of Canonical RNA Secondary Structures