There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

Data Mining - Concepts and Techniques.

http://brainimaging.waisman.wisc.edu/~chung/neuro.processing/literature/rubinov.2010.NI.network.pdf

Complex network measures of brain connectivity: uses and interpretations.

List-based priority schedulers have long been the dominant class of static scheduling algorithms. Such heuristics have been predominantly based on the ''critical path, most immediate successors first'' CP MISF priority. The ability of this type of scheduler to handle increased levels of communication overhead is examined in this paper. Three of the more popular list scheduling heuristics, Hu's LSH and Kruatrachue's ISH and DSH, are subjected to a performance-based comparison, with results demonstrating their inadequacies in communication-intensive cases. WINSCHED, a Microsoft Windows tool developed by the Parallel Computing Research Laboratory, is also briefly presented. WINSCHED uses a number of list-based heuristics to schedule a parallel program represented as an enhanced directed acyclic graph EDAG on an arbitrary number of homogeneous parallel processors. It supports six distinct heuristics with or without consideration of communication costs and has six interconnection topologies built in.

A Comparison of List Scheduling Heuristics for Communication Intensive Task Graphs

The paper presents new results concerning application of cellular automata (CA) to secret key cryptography extending results presented in Tomassini and Perrenoud (2000), and Tomassini and Sipper (2000). One dimensional, nonuniform CA is considered as a generator of pseudorandom number sequences (PNS) used in cryptography with the secret key. The quality of PNS highly depends on a set of applied CA rules. To find such rules nonuniform CA with two types of rules is considered. The search of rules is performed with use of an evolutionary technique called cellular programming. As the result of the collective behavior of the discovered set of CA rules very high quality PNS are generated. The quality of PNS outperforms the quality of known one dimensional CA-based PNS generators used in secret key cryptography. The extended set of CA rules which was found makes the cryptography system much more resistant on breaking a cryptography key.

Secret key cryptography with cellular automata

Fuzzy online location management in mobile computing environments

Memoryless online routing (MOR) algorithms are important for the applications with only local information available to make routing decisions. This paper gives two new MOR algorithms for a class of geometric graphs called Delaunay triangulations (DTs): the Midpoint Routing algorithm and the Compass Midpoint algorithm. More meaningfully, the former is generalized into a set of MOR algorithms that use the Euclidean distance as the reference and work for DTs, and the latter is generalized into a set of MOR algorithms that use the direction as the reference and work for DTs. Many other existing MOR algorithms can also be covered by these two sets. Finally, the two new algorithms are e valuated and compared with other existing MOR algorithms, and the experimental results give new findings on the performances of these algorithms in average and general cases.

Midpoint routing algorithms for Delaunay triangulations

Considerable attempts have been made to develop models and learning strategies to infer gene networks starting from single connections. However, due to noise and other difficulties that arise from making measurements at the meso and nano levels, these so called bottom-up approaches have not been of much success. The need for methods that use a top-down approach to extract global statistics from expression data has emerged to deal with such difficulties. This paper presents a theoretical framework that employs global statistics learnt from gene expression data to infer different network structural properties of large- scale gene regulatory networks. The framework is inspired by genetic algorithms and designed with the aim to address the different weaknesses in existing approaches. Experimental results show that the developed system is more superior to previously published results.

Albert Y. Zomaya

Papers

A Comparison of List Scheduling Heuristics for Communication Intensive Task Graphs

Secret key cryptography with cellular automata

Fuzzy online location management in mobile computing environments

Midpoint routing algorithms for Delaunay triangulations

Inference of large-scale structural features of gene regulation networks using genetic algorithms