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

The Beachcombers’ Problem (cf [1]) is an optimization problem in which a line segment is to be searched by a set of mobile robots, where each robot has a searching speed $s_i$ and a walking speed $w_i$, such that $s_i < w_i$ We explore a natural generalization of the Beachcombers’ Problem, the $t$-Source Beachcombers’ Problem ($t$-SBP), where the robots are not constrained to start at a single source: Consider $n$ mobile robots labelled $1,2,\ldots , n$ We choose $t$ sources and we assign each robot to one of them The problem is to choose the sources and develop mobility schedules (algorithms) for the robots which maximizes the speed of the fleet, or minimize the time that the robots need to collectively search the domain We propose several algorithms for solving problems of this nature We prove that $2$-SBP is NP-hard even when the robots have identical walking speeds This contrasts with the case when the robots have identical search speeds, where we give a polynomial time algorithm for $t$-SBP We also give a $05569$-approximation for $2$-SBP with arbitrary walking and searching speeds For $t$-SBP with arbitrary walking and searching speeds, we give an oblivious randomized algorithm and prove that it provides an expected $1 - 1/e$ approximation, asymptotically in $t$

The Multi-source Beachcombers’ Problem

We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information still could be used to make routing decisions in a store and forward way. Geometric planar spanners, especially local Delaunay triangulation can also be used in DTN to provide a good routing graph with constant stretch factor and shorter paths during communication. In this work, we design local distributed solutions to extract spanning trees from Local Delaunay Triangulation Graphs in the direction from source to destination. Our protocol resorts to flooding packets along the trees and with high probability packets are delivered with low delay. Through experimentation, we have shown that the proposed routing protocol achieves higher delivery ratio with lower delay and limited storage requirement than the benchmark epidemic routing protocol.

/pdf/a-geometric-routing-protocol-in-disruption-tolerant-network-746uifabjz.pdf

A Geometric Routing Protocol in Disruption Tolerant Network

We introduce and study a new search-type problem with ($n+1$)-robots on a disk. The searchers (robots) all start from the center of the disk, have unit speed, and can communicate wirelessly. The goal is for a distinguished robot (the queen) to reach and evacuate from an exit that is hidden on the perimeter of the disk in as little time as possible. The remaining $n$ robots (servants) are there to facilitate the queen's objective and are not required to reach the hidden exit. We provide upper and lower bounds for the time required to evacuate the queen from a unit disk. Namely, we propose an algorithm specifying the trajectories of the robots which guarantees evacuation of the queen in time always better than $2 + 4(\sqrt{2}-1) \frac{\pi}{n}$ for $n \geq 4$ servants. We also demonstrate that for $n \geq 4$ servants the queen cannot be evacuated in time less than $2+\frac{\pi}{n}+\frac{2}{n^2}$.

Priority Evacuation from a Disk Using Mobile Robots

Proceedings of the 6th international conference on Fun with Algorithms

How do we identify and prioritize risks and make smart choices based on fiscal constraints and limited resources? The main goal of infrastructure security is to secure, withstand, and rapidly recover from potential threats that may affect critical resources located within a given bounded region. In order to strengthen and maintain secure, functioning, and resilient critical infrastructure, proactive and coordinated efforts are necessary.

/pdf/optimization-problems-in-infrastructure-security-55zshrv4br.pdf

Evangelos Kranakis

Papers

The Multi-source Beachcombers’ Problem

A Geometric Routing Protocol in Disruption Tolerant Network

Priority Evacuation from a Disk Using Mobile Robots

Proceedings of the 6th international conference on Fun with Algorithms

Optimization Problems in Infrastructure Security