Particle swarm optimization for two-connected networks with bounded rings

The Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique modeled on the social behaviour of flocking birds or schooling fish. This thesis applies PSO to the 2CNBR problem. As PSO is originally designed to handle a continuous solution space, modification of the algorithm was necessary in order to adapt it for such a highly constrained discrete combinatorial optimization problem. Presented are an indirect transcription scheme for applying PSO to such discrete optimization problems and an oscillating mechanism for averting stagnation.

Properties and algorithms of the (n, k)-star graphs

The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Network Similarity Measures and Automatic Construction of Graph Models using Genetic Programming

A complex network is an abstract representation of an intricate system of interrelated elements where the patterns of connection hold significant meaning. One particular complex network is a social network whereby the vertices represent people and edges denote their daily interactions. Understanding social network dynamics can be vital to the mitigation of disease spread as these networks model the interactions, and thus avenues of spread, between individuals. To better understand complex networks, algorithms which generate graphs exhibiting observed properties of real-world networks, known as graph models, are often constructed. While various efforts to aid with the construction of graph models have been proposed using statistical and probabilistic methods, genetic programming (GP) has only recently been considered. However, determining that a graph model of a complex network accurately describes the target network(s) is not a trivial task as the graph models are often stochastic in nature and the notion of similarity is dependent upon the expected behavior of the network. This thesis examines a number of well-known network properties to determine which measures best allowed networks generated by different graph models, and thus the models themselves, to be distinguished. A proposed meta-analysis procedure was used to demonstrate how these network measures interact when used together as classifiers to determine network, and thus model, (dis)similarity. The analytical results form the basis of the fitness evaluation for a GP system used to automatically construct graph models for complex networks. The GP-based automatic inference system was used to reproduce existing, well-known graph models as well as a real-world network. Results indicated that the automatically inferred models exemplified functional similarity when compared to their respective target networks. This approach also showed promise when used to infer a model for a mammalian brain network.

Arsenic speciation by ion-exchange chromatography with on- line determination by hydride generation: electronic modification of the D.C. plasma by photon counting

A method using L-cysteine for the determination of arsenous acid (As(III)), arsenic acid (As(V)), monomethylarsonic acid (MMAA), and dimethylarsinic acid (DMAA) by hydride generation was demonstrated. The instrument used was a d.c. plasma atomic emission spectrometer (OCP-AES). Complete recovery was reported for As(III), As(V), and DMAA while 86% recovery was reported for MMAA. Detection limits were determined, as arsenic for the species listed previously, to be 1.2, 0.8, 1.1, and 1.0 ngemL-l, respectively. Precision values, at 50 ngemL-1 arsenic concentration, were f.80/0, 2.50/0, 2.6% and 2.6% relative standard deviation, respectively. The L-cysteine reagent was compared directly with the conventional hydride generation technique which uses a potassium iodide-hydrochloric acid medium. Recoveries using L-cysteine when compared with the conventional method provided the following results: similar recoveries were obtained for As(III), slightly better recoveries were obtained for As(V) and MMAA, and significantly better recoveries for DMAA. In addition, tall and sharp peak shapes were observed for all four species when using L-cysteine. The arsenic speciation method involved separation by ion exchange .. high perfonnance liquid chromatography (HPLC) with on-line hydride generation using the L.. cysteine reagent and measurement byOCP-AES. Total analysis time per sample was 12 min while the time between the start of subsequent runs was approximately 20 min. A binary . gradient elution program, which incorporated the following two eluents: 0.01 and 0.5 mM tri.. sodium citrate both containing 5% methanol (v/v) and both at a pH of approximately 9, was used during the separation by HPLC. Recoveries of the four species which were measured as peak area, and were normalized against As(III), were 880/0, 290/0, and 40% for DMAA, MMAA and As(V), respectively. Resolution factors between adjacent analyte peaks of As(III) and DMAA was 1.1; DMAA and MMAA was 1.3; and MMAA and As(V) was 8.6. During the arsenic speciation study, signals from the d.c. plasma optical system were measured using a new photon-signal integrating device. The_new photon integrator developed and built in this laboratory was based on a previously published design which was further modified to reflect current available hardware. This photon integrator was interfaced to a personal computer through an AID convertor. The .photon integrator has adjustable threshold settings and an adjustable post-gain device.

The role of daytime napping in sleepiness and cognitive function in 24-70 year olds /

Daytime napping improves well-being and performance for young adults. The benefits of napping in older adults should be investigated because they have fragmented nocturnal sleep, cognitive declines, and more opportunity to nap. In addition, experience with napping might influence the benefits of napping. Study 1 examined the role of experience with napping in young adults. Habitual (n = 23) and non-habitual nappers (n = 16) were randomly assigned to a 20-minute nap or a 20- minute reading condition. Both groups slept the same according to macro architecture. However, microarchitecture showed greater theta, alpha, and beta power during Stage 1, and greater delta, alpha, and sigma power during Stage 2 for habitual nappers, for the most part indicating better sleep. Both groups felt less sleepy after the nap. P2 latency, reflecting information processing, decreased after the nap for habitual nappers, and after the control condition for non-habitual nappers. In sum, both groups who slept felt better, but only the habitual nappers who napped gained a benefit in terms of information processing. Based on this outcome, experience with napping was investigated in Study 2. Study 2 examined the extent to which daytime napping enhanced cognition in older adults, especially frontal lobe function. Cognitive deficits in older adults may be due to sleep loss and age-related decline in brain functioning. Longer naps were expected to provide greater improvement, particularly for older adults, by reducing sleep pressure. Thirty-two adults, aged 24-70 years, participated in a repeated measures dose-response manipulation of sleep pressure. Twenty- and sixty-minute naps were compared to a no-nap condition in three age groups. Mood, subjective sleepiness, reaction time, working memory, 11 novelty detection, and waking electro physiological measures were taken before and after each condition. EEG was also recorded during each nap or rest condition. Napping reduced subjective sleepiness, improved working memory (serial addition / subtraction task), and improved attention (reduced P2 amplitude). Physiological sleepiness (i.e., waking theta power) increased following the control condition, and decreased after the longer nap. Increased beta power after the short nap, and seen with older adults overall, may have reflected increased mental effort. Older adults had longer latencies and smaller amplitudes for several event-related potential components, and higher beta and gamma power. Following the longer nap, gamma power decreased for older adults, but increased for young adults. Beta and gamma power may represent enhanced alertness or mental effort. In addition, Nl amplitude showed that benefits depend on the preceding nap length as well as age. Since the middle group had smaller Nl amplitudes following the short nap and rest condition, it is possible that they needed a longer nap to maintain alertness. Older adults did not show improvements to Nl amplitude following any condition; they may have needed a nap longer than 60 minutes to gain benefits to attention or early information processing. Sleep characteristics were not related to benefits of napping. Experience with napping was also investigated. Subjective data confirmed habitual nappers were happier to nap, while non-habitual nappers were happier to stay awake, reflecting self-identified napping habits. Non-habitual nappers were sleepier after a nap, and had faster brain activity (i.e., heightened vigilance) at sleep onset. These reasons may explain why non-habitual nappers choose not to nap.