FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Performance results of running parallel applications on the InteGrade

The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of running parallel applications with communication among processors on the InteGrade grid. As costly communication on a grid can be prohibitive, we explore the so-called systolic or wavefront paradigm to design the parallel algorithms in which no global communication is used. To evaluate the InteGrade middleware we considered three parallel algorithms that solve the matrix chain product problem, the 0-1 Knapsack Problem, and the local sequence alignment problem, respectively. We show that these three applications running under the InteGrade middleware and MPI take slightly more time than the same applications running on a cluster with only LAM-MPI support. The results can be considered promising and the time difference between the two is not substantial. The overhead of the InteGrade middleware is acceptable, in view of the benefits obtained to facilitate the use of grid computing by the user. These benefits include job submission, checkpointing, security, job migration, etc. Copyright (C) 2009 John Wiley & Sons, Ltd.

Reliability Nonparametric Bayesian Estimation in Parallel Systems

Relevant results for (sub-)distribution functions related to parallel systems are discussed. The reverse hazard rate is defined using the product integral. Consequently, the restriction of absolute continuity for the involved distributions can be relaxed. The only restriction is that the sets of discontinuity points of the parallel distributions have to be disjointed. Nonparametric Bayesian estimators of all survival (sub-)distribution functions are derived. Dual to the series systems that use minimum life times as observations, the parallel systems record the maximum life times. Dirichlet multivariate processes forming a class of prior distributions are considered for the nonparametric Bayesian estimation of the component distribution functions, and the system reliability. For illustration, two striking numerical examples are presented.

A FREE BOUNDARY ISOPERIMETRIC PROBLEM IN HYPERBOLIC 3-SPACE BETWEEN PARALLEL HOROSPHERES

We investigate the isoperimetric problem of finding the regions of prescribed volume with minimal boundary area between two parallel horospheres in hyperbolic 3-space (the part of the boundary contained in the horospheres is not included). We reduce the problem to the study of rotationally invariant regions and obtain the possible isoperimetric solutions by studying the behavior of the profile curves of the rotational surfaces with constant mean curvature in hyperbolic 3-space. We also classify all the connected compact rotational surfaces M of constant mean curvature that are contained in the region between two horospheres, have boundary partial derivative M either empty or lying on the horospheres, and meet the horospheres perpendicularly along their boundary.

Important Parameters in Designing and Presenting Exhibits and Planetarium Programs in Science Centers : A Visitor-Based Framework

This dissertation proposes an initial framework for designing and presenting exhibits in science centers and to recommend methods for improving the educational role of planetariums in science centers.

Alphanumeric LCD infrared control via computer’s parallel port

The present work will explain a method to achieve a remote controlled (via IR LED) alphanumeric Liquid Crystal Display. In modern times, the remote access of different devices has become quite popular, therefore, the aim of this project is to provide a useful tool that will integrate common and easy to access devices. The system includes a C language based user interface, an assembly language code for the AT89C51ED2 microcontroller instructions and some digital electronic circuits needed for the driving and control of both the LCD and the infrared communication, as well as the PC with a parallel port. The interaction of all the devices provides a whole system that can be helpful in different applications, or it can be separated into each one of its different stages to take the best advantage as possible.

BEE COLONIES APPLIED TO MULTIPROCESSOR SCHEDULING

In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on which a number of tasksare to be scheduled that the program’s execution time is minimized. According to [10], thetasks scheduling problem is a key factor for a parallel multiprocessor system to gain betterperformance. A task can be partitioned into a group of subtasks and represented as a DAG(Directed Acyclic Graph), so the problem can be stated as finding a schedule for a DAG to beexecuted in a parallel multiprocessor system so that the schedule can be minimized. Thishelps to reduce processing time and increase processor utilization. The aim of this thesis workis to check and compare the results obtained by Bee Colony algorithm with already generatedbest known results in multi processor task scheduling domain.

The Survivability of Swedish Emergency Management Related Research Centers and Academic Programs : A Preliminary Sociology of Science Analysis

The Survivability of Swedish Emergency Management Related Research Centers and Academic Programs: A Preliminary Sociology of Science Analysis Despite being a relatively safe nation, Sweden has four different universities supporting four emergency management research centers and an equal and growing number of academic programs. In this paper, I discuss how these centers and programs survive within the current organizational environment. The sociology of science or the sociology of scientific knowledge perspectives should provide a theoretical guide. Yet, scholars of these perspectives have produced no research on these related topics. Thus, the population ecology model and the notion of organizational niche provide my theoretical foundation. My data come from 26 interviews from those four institutions, the gathering of documents, and observations. I found that each institution has found its own niche with little or no competition – with one exception. Three of the universities do have an international focus. Yet, their foci have minimal overlap. Finally, I suggest that key aspects of Swedish culture, including safety, and a need aid to the poor, help explain the extensive funding these centers and programs receive to survive. 

Degree projects improving co-operation between the teacher education program and schools : - Swedish experiences

In 1977, when teacher education inSwedenwas incorporated into the university system, the main reason was to transform it into an academic tradition. Now, nearly 30 years later, there is still tension between the academic and the vocational tradition; they show up as different and separated elements in a program that is meant to prepare students for a career as a teacher and for a possible future career as a researcher in this field. This tension gives rise to a risk of allowing parallel “tracks” to develop and of isolating the degree thesis work from other courses. On the teacher-training program in which we are involved, close co-operation with partner-schools, where the practical part of the program takes place, has been established. Here, the students´ degree theses are an important factor in making this co-operation work on a concrete level. Accordingly, the purpose of the degree thesis is both to reflect problems in schools and contribute to better teaching in the individual school, but also to offer relevant educational subject matter to the students, which may be adapted as an element in the university’s research environments. From these points of view, the degree thesis is an important part of teacher education and rather more than just a single course. The degree thesis should be an element that gives the students an opportunity to show that they have reached central goals in the teacher education program. It should also be an integral part in the development of critical and scholarly thinking, deepening pedagogical and didactic knowledge and giving the students an opportunity to apply research methods. We will here use two minor case studies: one that compares teacher education programs in five Swedish universities and one minor study at one of those universities, in order to elaborate on the questions: - What purpose has a degree thesis and what role does it play in teacher education? - What criteria are relevant to assessing a degree thesis and what qualities do the degree theses have? - Is it possible to assess a degree thesis fairly and what happens to students who do not pass? - How could the degree thesis be used to improve the contact between the teacher education program and its partner schools in order to contribute to the development of the individual school?