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

Underwater environmental parameters vary with time and can negatively impact the quality of communication. The adaptive control system suggested attempts to improve communication in underwater networks where environmental conditions are stochastic and time-variant. Adaptive depth control is explored in limited mobility underwater acoustic sensor networks. The adaptive control seeks to leverage the acoustic properties along the thermocline sensors anchored to the seabed in order to improve link stability in underwater networks. The sensor is allowed two directions of movement, either surface or dive, in order to avoid physical phenomena that cause faults. The algorithm presented is capable of adapting to the optimal performance depth in unimodal stochastic stationary and non-stationary environments.

Learning to Communicate Underwater: An Exploration of Limited Mobility Agents

We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional spaces. In two dimensions, we propose the class of quasi-planar graphs and in three dimensions the class of quasi-polyhedral graphs. In both cases, we provide a routing algorithm that guarantees delivery. Our algorithms need only "remember" the source and destination nodes and one (respectively, two) reference nodes. Moreover, we show that the quasi-planar routing algorithm is inherently flexible in its path-finding, and as an application demonstrate computational results for a network load problem.

/pdf/online-routing-in-quasi-planar-and-quasi-polyhedral-graphs-4a21f00elq.pdf

Online routing in quasi-planar and quasi-polyhedral graphs

This paper extends an existing decisional framework for the navigation of Micro Aerial Vehicle (MAV) swarms. The work finds inspiration in the geocaching outdoor game. It leverages place recognition methods, information sharing and collaborative work between MAVs. It is unique in that a priori none of the MAVs knows the trajectory, waypoints and destination. The MAVs collectively solve a series of problems that involve the recognition of physical places and determination of their GPS coordinates. Our algorithm builds upon various methods that had been created for place recognition. The need for a decisional framework comes from the fact that all methods are fallible and make place recognition errors. In this paper, we augment the navigation algorithm with a decisional framework resolving conflicts resulting from errors made by place recognition methods. The errors divide the members of a swarm with respect to the location of waypoints (i.e., some members continue the trip following the proper itinary; others follow a wrong one). We propose four decisional algorithms to resolve conflicts among members of a swarm due to place recognition errors. The performance of the decisional algorithms is modeled and analyzed.

Geocaching-Inspired Navigation for Micro Aerial Vehicles with Fallible Place Recognition

In the present paper we explore partition properties of admissible ordinals. In §2 the connection between partition properties, collection, separation and reflection principles is studied. In §3 we give characterizations of partition properties which are satisfied by certain definable subsets of κ. Covering properties, which are studied in §4, are a convenient generalization of partition properties and are used to investigate the strength of certain partition properties of κ. Finally in §5 we study the definability of the homogeneous set in partitions of exponent greater than one.

Partitions and homogeneous sets for admissible ordinals

http://www.scs.carleton.ca/~kranakis/Papers/ckk2013a.pdf

Evangelos Kranakis

Papers

Learning to Communicate Underwater: An Exploration of Limited Mobility Agents

Online routing in quasi-planar and quasi-polyhedral graphs

Geocaching-Inspired Navigation for Micro Aerial Vehicles with Fallible Place Recognition

Partitions and homogeneous sets for admissible ordinals

Asymptotic Number of Hairpins of Saturated RNA Secondary Structures