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

We consider the problem of providing full coverage of a planar region with sensors. Likewise, we consider the connectivity of the sensor network of directional antennas formed by sensors in this region. Suppose that n sensors with coverage angle (also known as beam width) α (n), and reachability radius r(n) are thrown randomly and independently with the uniform distribution in the interior of the unit square. Let p (n) be the probability that a given sensor is active. We prove that if $ p(n) = \Omega \left( \frac{\log (n / r(n)^2 \sin^2 (\alpha (n)/ 4))}{n r(n)^2 \alpha (n) \sin (\alpha (n)/4 )} \right) $ then the probability the sensors provide full coverage of the unit square is at least 1–n − O(1). Likewise, we consider the connectivity of the resulting sensor network. We show that if $p(n) = \Omega \left( \frac{\log (n / r(n)^2 \sin^2 (\alpha (n) / 4))}{n r(n)^2 \alpha (n) \sin^2 (\alpha (n) /4 )} \right) $ then the probability that a connected subnetwork of sensors provides full coverage is at least 1 – n − O(1).

Coverage and connectivity in networks with directional sensors (extended abstract)

We study the optimization of the expected number of bytes that must be transferred by the Web server when a user visits one of its pages. Given a Web site, we want to find an assignment of hotlinks (shortcuts) that minimizes the expected data transfer, i.e., the average amount of bytes to be downloaded in order to reach one of its pages. We propose an optimization algorithm and perform simulations in real and random Web sites. The simulations reveal that the average data transfer can be reduced by at least 11% and as much as 30%.

Optimizing Web Server's Data Transfer with Hotlinks.

We initiate the study of patrolling a unit interval with primitive two-speed, autonomous robots, i.e. robots without memory, no communication capabilities and no computation power. Robots have only two moving-states, one for patrolling and one for walking, each associated with a direction and speed. The robots are moving perpetually, and their moving-states and moving directions change only when they collide. Such a dynamic system induces the so-called idleness for patrolling a unit interval, i.e. the smallest time interval within which every point of the domain is patrolled by some robot. Our main technical contribution is an analytic study of the induced dynamic system of robots, which allows us to decide efficiently whether or not the system converges to a stable configuration that is also shown to be optimal.

Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)

WiMAX/802.16 is a kind of network providing IP-based broadband wireless access to infrastructure networks such as the Internet. The two main envisioned applications are Web access and voice over IP. Highlights of WiMAX/802.16 are secure communications and broadband access in remote areas. This chapter covers the background, physical layer, medium access control layer, mobility support, mesh mode and multihop relay operation of WiMAX/802.16. The chapter ends with a presentation of thoughts for practitioners and a discussion of directions for future research.

/pdf/wimax-802-16-broadband-wireless-networks-3sx0odbun5.pdf

Wimax/802.16 broadband wireless networks

In the pattern formation problem, robots in a system must self-coordinate to form a given pattern, regardless of translation, rotation, uniform-scaling, and/or reflection In other words, a valid final configuration of the system is a formation that is \textit{similar} to the desired pattern While there has been no shortage of research in the pattern formation problem under a variety of assumptions, models, and contexts, we consider the additional constraint that the maximum distance traveled among all robots in the system is minimum Existing work in pattern formation and closely related problems are typically application-specific or not concerned with optimality (but rather feasibility) We show the necessary conditions any optimal solution must satisfy and present a solution for systems of three robots Our work also led to an interesting result that has applications beyond pattern formation Namely, a metric for comparing two triangles where a distance of $0$ indicates the triangles are similar, and $1$ indicates they are \emph{fully dissimilar}

Evangelos Kranakis

Papers

Coverage and connectivity in networks with directional sensors (extended abstract)

Optimizing Web Server's Data Transfer with Hotlinks.

Distributed Patrolling with Two-Speed Robots (and an Application to Transportation)

Wimax/802.16 broadband wireless networks

Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots