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

efﬁciency focused mainly on the aerodynamics, network stability, and longitudinal control of platoons. However, the system aspects (e.g., platoon coordination) are still not well explored. In this paper, we formulate a platooning coordination problem and study whether trucks waiting at an initial location (station) should wait for a platoon to arrive in order to leave. Arrivals of trucks at the station and platoons by the station are modelled by independent Bernoulli distributions. Next we use the theory of Markov Decision Processes to formulate the dispatching control problem and derive the optimal policy governing the dispatching of trucks with platoons. We show that the policy that minimizes an average cost function at the station is of threshold type. Numerical results for the average cost case are presented. They are consistent with the optimal ones.

Optimal Control for Platooning in Vehicular Networks

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2 times the optimal; we also show that the factor 2 is best possible given appropriate connectivity conditions on the set $P$, respectively. First, we construct in $O(n\log{n})$ time a geometric planar graph of minimum degree 2 and max edge length bounded by 2 times the optimal. This is then used to construct in $O(n\log n)$ time a 2-edge connected geometric planar graph spanning $P$ with max edge length bounded by $\sqrt{5}$ times the optimal, assuming that the set $P$ forms a connected Unit Disk Graph. Second, we prove that 2 times the optimal is always sufficient if the set of points forms a 2 edge connected Unit Disk Graph and give an algorithm that runs in $O(n^2)$ time. We also show that for $k \in O(\sqrt{n})$, there exists a set $P$ of $n$ points in the plane such that even though the Unit Disk Graph spanning $P$ is $k$-vertex connected, there is no 2-edge connected geometric planar graph spanning $P$ even if the length of its edges is allowed to be up to 17/16.

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points

Strategies for Surviving Aggressive Multiparty Repeated Standoffs (Extended Abstract)

The recent drastic increase in mobile data trafﬁc has pushed the mobile edge computing systems to the limit of their capacity. Fortunately, the task migration service provided by unmanned aerial vehicle (UAV) has brought a promising solution to the mentioned problem. In designing UAV ofﬂoading schemes, key factors include the number of tasks waiting and their corresponding deadlines. An appropriate system cost is used as objective function to be minimized comprising two parts. First, an ofﬂoading cost which can be interpreted as the cost of using computational resources at the UAV. Second, a penalty cost due to potential task deadline expirations. In order to minimize the expected average cost over a time horizon, we formulate a dynamic programming (DP) equation aiming at describing properties of a candidate optimal ofﬂoading policy. The ensuing DP equation is revealed to suffer from the Curse of Dimensionality. In order to resolve this complication, we analyze three important properties of the optimal policy. First, our ﬁndings uncover the relation between the original inﬁnite state space model and a reduced ﬁnite one. Second, we prove that the optimal task ofﬂoading decision associated with a state can be inferred from that of other related states. Finally, we provide numerical results to show the inﬂuence of different parameters on the system performance as well as verify the presented results.

Optimal Policy for Task Migration to UAV in Discrete-Time Systems with Firm Deadlines

A function is distributed among nodes of a graph in a“continuous” way, i.e., such that the difference between values stored at adjacent nodes is small. The goal is to find a node of maximum value by probing some nodes under a restricted budget. Every node has an associated cost which has to be paid for probing it and a probe reveals the value of the node. If the total budget is too small to allow probing every node, it is impossible to find the maximum value in the worst case. Hence we seek an Approximate Maxima Finding (AMF) algorithm that offers the best worst-case guarantee g, i.e., for any continuous distribution of values it finds a node whose value differs from the maximum value by at most g.

Evangelos Kranakis

Papers

Optimal Control for Platooning in Vehicular Networks

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points

Strategies for Surviving Aggressive Multiparty Repeated Standoffs (Extended Abstract)

Optimal Policy for Task Migration to UAV in Discrete-Time Systems with Firm Deadlines

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract)