Abstract
This project discusses the concept of analyzing recursive algorithms with respect to computer applications and their programming phase. The paper relates that recursiveness is said to appear especially in relation to divide and conquer algorithms and the author is successful at developing several master theorems that address recursive concerns. The paper asserts that the importance of these techniques is implicit in the research but is not made very clear in the research project itself.

From the Paper
"This project discusses the concept of analyzing recursive algorithms with respect to computer applications and their programming phase. Recursiveness is said to appear especially in relation to divide and conquer algorithms and the author is successful at developing several master theorems that address recursive concerns. The importance of these techniques is implicit in the research but is not made very clear in the research project itself...."

Tags:recursive, algorithms, mathematics

Abstract
A router is used to manage network traffic and to find the best route for packets to be sent. This paper discusses the algorithms available in order to find the best route to destination for these packets in the network environment. The two main algorithms are "Global routing algorithms" and "Decentralized routing algorithms". The paper evaluates in detail these two methodologies together with their bottlenecks and illustrates examples with diagrams, graphs, tables and code.

From the Paper
"In this step, routers should choose the best route for packets to every node. They do it by using an algorithm such as "Dijkstra Shortest Path Algorithm". In this algorithm, router, based on information that has been collected from other routers, build a graph of network. This graph shows the location of routers in network and their links. Also every link will be labeled with a number that is called weight of link and is also known as cost of link. This number is a function of delay time, average traffic and sometimes simply, it is the number of hops between nodes. For example if there were two links between a node to destination, the router chooses the link with the least weight."

Tags:computer, decentralized, dijkstra, graph, table, vector, cluster

Abstract
This research paper analyzes the growing trend of using computer science, and more specifically, genetic algorithms (expert systems) in America's businesses with special reference to the fishing industry. The author discusses the technicalities of computer systems as well as the advantages that they provide (such as saving time and money) to the American industry.

From the Paper
"Who would have ever thought that the fishing industry could be greatly enhanced through the use of genetic algorithms? The fact is that more and more sectors of our business world are realizing how useful computer science is for assisting in important decisions. There is a great deal of uncertainty in the fish stock-recruitment process, just as in the auto industry. Key decisions must be made in order to gain the most profit. To help in such a situation, expert systems (ES) are used to determine the best possible solution. An ES is a "computer system that applies reasoning methodologies to knowledge in a specific domain." An ES is similar to a human with the biggest difference being that an ES "achieves a high level of performance in task areas that, for human beings, requires years of special education and training" (Turban 811). Without ES, fish stock assessment and management must rely on traditional analysis, which "are based on the assumption that a functional relationship exists between the size of the spawning stock and the number of fish that recruit in the future" (Chen 1)."

Tags:binary, chromosomes, computer, encoding, expert, programming, science, system, systems

Abstract
This paper gives some algorithms for thinning a monochrome image and checks out the development in other algorithms. It explains that thinning is an important preprocessing step for many image analysis operations such as optical character recognition, fingerprint recognition and document processing. This paper studies the results of some of the various popularly implemented thinning algorithms like medial axis method [2], contour generation method [3], local thickness based thinning approach [4], hybrid Approach and sequential and parallel thinning [5], and to debate on the advantages and disadvantages of the different methods along with citing the places where each of them is optimally utilized.

From the Paper
"Communication is an integral component of human society that has been greatly enhanced by the evolution of the technological age. Verbal communication has been greatly revolutionized by the advent of television, telephone and radio, and written communication has been transformed by development of word processors and electronic data. It is hence becoming increasing important to have information available for examination and manipulation in the digital format, and Optical Character Recognition (OCR) methods have been created towards this end. Character Recognition or Optical Character Optical Character Recognition (OCR) is the process of converting scanned images of machine printed or handwritten text (numerals, letters, and symbols), into a computer process able format (such as ASCII). The recognition of optically processed symbols and numerals, that is their translation from human readable forms to machine codes, holds excessive practical applicability in data transmission and documentation as well as for specific applications like identification of postal(zip) codes."

Tags:approach, axis, based, character, contour, generation, local, markov, medial, method, model, networks, neural, ocr, point, recognition, safe, thickness

Abstract
Discusses differences between a code and a cipher. Requirements of each; how each works. History of encryption. Enigma machine of World War II. Pre-computer encrption. Development of computer program to encrypt data. Function of a "hash" (a number generated from text & smaller than the text itself). Privacy issues. Future of algorithms.

From the Paper
"Encryption and Hash Algorithms
Introduction
Stephen Levy (2001), reporting on the latest "unbreakable code" begins his report by quoting Edgar Allan Poe. "It may roundly be asserted that human ingenuity cannot concoct a cipher which human ingenuity cannot resolve" (Levy, 2001, 45). This article was selected to lead off this discussion of encryption because of two elements of confusion.
First, the headline read "An Unbreakable Code?" and the article was about enciphering and deciphering, also called "encryption" and ?decryption.? This is a common, and often-repeated mistake, one which can confuse the very field of study. A "code" is not a "cipher" anymore than a "tennis ball" is a ?cabbage.?


A code is a..."

From the Paper
"Introduction
According to Weiss, an algorithm is a "clearly specified set of simple instructions to be followed to solve a problem.". The problem can be in any field, although algorithms are most often associated with computer science, and the key to a successful algorithm is determining its relevance and accuracy to the problem at hand. Even algorithms which are relevant and which accurately solve a problem may be deemed inappropriate if they require too much time or other resources. This research examines why algorithm design is important to the biomedical field, and considers five commonly used approaches to algorithms and their relevance to the field of clinical engineering.

Overview
Everyone uses algorithms in performing day-to-day activities. The algorithm.."

Abstract
This paper examines the concept of abstract authentication in federated database systems and the difficulties presented because the autonomously operated components may not know the identity of federation users. It looks at how one proposed solution is subject switching, where the federation translates the federated users identity to that of an agreed upon component subject and how this translation may be problematic due to not having component subjects with the same accesses requested by federation users. It proposes using proximity measures between requested and provided access and presents two policy neutral algorithms to find proximity minimizing matches between a federation subject and a collection of component subjects. It also explores the concepts relating to federated databases, authorization and access, and proposes some algorithms that will facilitate the subject switching method of reconciling access requirements.

Outline
Section 1
Abstract
Background
Introduction
Characteristics of Federated Databases
Homogeneous vs. Heterogeneous Databases
Agents
Agents and Meaning
Perspective
Types of Meaning
Semantics Versus Pragmatics
Context
Coverage of Communicative Acts
Mental Versus Social Agency
Section 2
Federated Database Systems and Autonomy
Design Autonomy
Communication Autonomy
Execution Autonomy
Association Autonomy
Authorization Autonomy
Distribution Transparency (i.e., Schema Integration)
Tightly Coupled
Limited Tight Coupling
Loosely Coupled
Federated Database Security
Authorization
Standards for Authentication
Decentralized vs. Centralized Authorization
Access Controls
User Based Access Control (UBAC)
Policy Based Access Control
Content Dependent Access Control (CDAC)
Context Based Access Control (CBAC)
View Based Access Control (VBAC)
Discretionary Access Control (DAC)
Mandatory Access Control (MAC)
Role Based Access Control (RBAC)
Section 3
Subject Switching
Subject Mapping Algorithms
Mapping Process
Federation Mapping Process
Federation Identity
Component Mapping Process
Minimum Disparity Measure
Mapping Algorithm
Create Object Sets
Identify Component Subjects
Evaluate Matching Subjects
Access Disparity Measures
Numerical Disparity Measure
Comparing Disparity Measures to Approximate Measures
Approximate Disparity Measure Comparison
Motivating Example
Access Compatibility Measures and Algorithms
Compatibility of Permissions and their Disparity Measures
Cardinality
Express Specification
Section 4
Metrics
Algorithm 1 (Least Under Permitting Algorithm)
Algorithm 2 (Least Over Permitting Algorithm)
Approximations: Metrics And Mappings
Approximate Mapping Algorithms
Algorithm 3 (Approximate Under Permitting Algorithm)
Algorithm 4 (Approximate Over Permitting Algorithm)
Properties of Algorithms 3 and Algorithm 4
Multilevel Federations
Non-Protected Database
Axioms
Deductive Channels Control Theorems
Signalling Channels Control Theorems
Cover Story
Multi-view Databases
Languages
Section 5
Conclusions and Ongoing Work
References

From the Paper
"Heimbingner and McLeod coined the phrase Federated Database System in 1985, and Seth and Larson later confirmed the formal definition. While the term has been loosely used to refer to several different but related database systems, they more precisely and unanimously define it as a collection of cooperating but autonomous component database systems. [SL90] (According to Oszu 1999, semi-autonomous systems are termed federative DBMS). A federated database system represents a compromise between no integration, wherein users must explicitly interface with multiple autonomous databases, and total integration, where the autonomy of each distinct database is sacrificed in order to allow users access through a single global interface."

Tags:abstract, authentication, authorization, autonomy

Abstract
This piece is a introduction to the network security technology known as IPSec. IPSec is an open standard for IP security and uses several protocols and algorithms to provide a customizable, robust security system for system administrators. The various applications, protocols and algorithms are discussed, followed by a brief discussion of how the technology works. Then, the advantages of IPSec, including e-commerce and mobile computing, are discussed briefly. A table of contents is included to make navigating the headings and subheadings easier.

Abstract
The value of garbage collection (GC) to the discipline of software engineering is established. The definitions of the fundamental GC terms are given. Thereafter, the three major GC algorithms are discussed and graphically represented. Basic differences and similarities among the algorithms are considered. The two major GC optimization techniques and their historical origins are discussed. The paper includes diagrams.

From the Paper
"Garbage collection (GC) is the automatic management of dynamic memory allocation. The alternative to this is programmer-controlled dynamic memory allocation. Automatic management is the superior of the two because programmer-controlled management can lead to memory leaks, bugs caused by accidental manipulation of program code and data through pointers, and an overall increase in program complexity. These in turn consume a considerable amount of programmer time and result in higher software maintenance costs. Automatic management prevents these issues and allows programmers to focus on the programming that relates directly to useful system functionality."

Tags:compiler, mark-phase

Abstract
The paper outlines a qualitative triangulated methodology to achieve the outcomes of this proposal that includes a review of the literature, a series of case studies of organizations and a series of semi-structured interviews with managers of companies identified in the case study component. The paper explains the expected outcome of the proposed study that will be to specifically identify a set of mathematical formulae that can be applied to any type of premises regardless of its physical configuration, to provide optimal deployment of RFID sensors to ensure that complete coverage is achieved for a location-aware environment to be functional.

Outline:
Background
Methodology
Outcomes and Value

From the Paper
"One of the most powerful innovations in technology in recent years has been the introduced of radio-frequency identification tags (RFID) that can be used to keep track of both living and inorganic materials. According to Retscher, "In recent years, new technologies and methods for positioning in indoor environments have been developed. Useable geo-location techniques include . . . RFID and other systems using infrared, ultrasonic, and radio signals" (2007:305). In fact, besides their common applications on pallets, livestock, household pets and even humans can be equipped with passive or active RFID tags to monitor their movements and well-being across a broad range of metrics.
"In a warehouse or other premises that is location-aware, though, determining the optimum deployment of RFID tags to ensure complete coverage is achieved requires more than guesswork, but rather involves accurate placement of RFID tags in a sufficient number of strategic locations. According to Kobben, "One of the important sensed context parameters [for RFID deployment] is location awareness, which is important for all spatial applications, and is currently being dealt with in research as well as implementations" (2007:285). Identifying the minimum number of such strategic locations is the focus of the study proposed herein. In this regard, the Euler algorithm has been suggested by topologists and other researchers as being a useful approach that can satisfy this emerging requirement."

Tags:topology, polygons, configuration, coverage