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 address the problem of discovering routes in strongly connected planar geometric networks with directed links. Motivated by the necessity for establishing communication in wireless ad hoc networks in which the only information available to a vertex is its immediate neighborhood, we are considering routing algorithms that use the neighborhood information of a vertex for routing with constant memory only. We solve the problem for three types of directed planar geometric networks: Eulerian (in which every vertex has the same number of incoming and outgoing edges), Outerplanar in which a single face contains all vertices of the network, and Strongly Face Connected, a new class of geometric networks that we define in the article, consisting of several faces, each face being a strongly connected outerplanar graph. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(1), 7–15 2006This is a revised and expanded version of a paper that appeared in proceedings of Algosensors 2004, Springer Verlag, LNCS, Vol. 3121, pp. 147–156, S. Nikoletseas, J. Rolim, editors.

Route discovery with constant memory in oriented planar geometric networks

Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that it is executed by an agent moving along a network and using at each node only information about the current node (incl. its position) and a finite number of others (independent of graph size). Local geometric traversal algorithms also exist for undirected plane graphs. In this paper we show that no comparable routing or traversal algorithms exist for the class of strongly connected plane directed graphs (digraphs). We construct a class of digraphs embedded in the plane for which either local routing or local traversal requires ( n) memory bits, where n is the order of the graph. We discuss these results in light of finding a suitable model for mobile ad hoc networks with uni-directional edges, showing in the extended version of this paper that digraphs for which the ( n) lower bound holds occur even in the class of embedded digraphs arising out of a very conservative model.

/pdf/memory-requirements-for-local-geometric-routing-and-36wwxa2sz1.pdf

Memory Requirements for Local Geometric Routing and Traversal in Digraphs

Neighbor discovery is necessary for the proper functioning of wireless networks. Directional antennae can be used in the network to improve connectivity due to the fact that a narrower beam width can reach a faraway place using the same transmission power. Researches until now have worked on neighbor discovery using only omni directional antenna (OO), neighbor discovery using only directional antenna (DD), or neighbor discovery using one antenna type for transmission and the other type for reception (OD and DO). In this work, we propose a new neighbor discovery model where both antenna neighbor discovery types are available (D+O). Nodes exchange neighbor information with omni directional antennae, and neighbor information beyond the reach of omni directional antennae are collected using directional antennae. In our model, neighboring nodes cooperate with each other to speed up the neighbor discovery process. Two neighbor cooperation mechanisms are presented in the model. Through analysis, we show that the proposed protocol can reduce delays in the neighboring discovery process when the number of neighboring nodes increases following a Poisson distribution and contentions are taken into consideration. Through simulation, we show the improved delay performance and the energy efficiency of the proposed solution when it is compared with other neighbor discovery approaches in the literature.

Cooperative Neighbor Discovery Protocol for a Wireless Network Using Two Antenna Patterns

Several variants of this problem have appeared in the literature. Overmars and Welzl [OW85] studied the problem of cutting a polygon drawn on a piece of paper in the cheapest possible way. Croft, Falconer and Guy [CFG91] studied problems related to tiling and dissection of circles and squares. Bose et al. [BCK+98, BCL98] studied the problem of cutting squares and circles into equal area pieces. Kong et al. [KMW87] and [KMR88] addressed a variant of Problem 1 in the context of parallel computing, where they were concerned with partitioning a rectangle equitably among a set of processors. However, their objective was to minimize the maximum perimeter of the rectangles in their decomposition.

Evangelos Kranakis

Papers

Route discovery with constant memory in oriented planar geometric networks

Memory Requirements for Local Geometric Routing and Traversal in Digraphs

Cooperative Neighbor Discovery Protocol for a Wireless Network Using Two Antenna Patterns

Near optimal-partitioning of rectangles and prisms.

On the temporal authentication of digital data