Distributed Sensing of Fluid Dynamic Phenomena with the XDense Sensor Grid Network

IEEE International Conference on Cyber Physical Systems, Networks and Applications (CPSNA'15), Hong Kong, China.

Families of the traumatically brian-injured : a case study approach to perceptions of quality of service, degree of satisfaction, and family needs /

The purpose of this qualitative research study was to foster an understanding of the rehabilitation counselling practice offamilies of the brain-injured. Specifically, the study explores the perceptions of stakeholders in regards to the degree of satisfaction with the quality of service received. Questionnaires were administered, and semi-structured, openended interviews were conducted, with six participating families (n=8). Preliminary data were collected via two instruments: (i) the Family Participant Questionnaire, consisting of participants' sample characteristics, information pertaining to the history of the family, details of the injury, and information relating to the type, use, and need offamily services utilized; and (ii) the Community Integration Questionnaire, a measurement of the degree of social displacementllevel of community integration of the injured family member. Utilizing the procedural steps outlined by Colaizzi's (1978) method of protocol analysis, recommendations for a future program based on related and current family needs are discussed in detail. Substantiating and supporting information are offered to rehabilitation practitioners, educational planners, and policymakers alike, concerning the degree of satisfaction with rehabilitative service, and the means of improving upon the overall quality of health care to families of the brain-injured. Implications for clinical practice and research are also raised for discussion.

Certificate of Service

A certificate of service detailing the career of Lieut.-Colonel Frank Case McCordick. He is noted at being enlisted in the 19th Battalion on the 13th November, 1914. He served in Canada, England and France and was "struck off the strength" November 21, 1918. The certificate is dated 16 October, 1919.

Canadian Army Certificate of Service

A certificate of service from the Canadian Army for Lt. Col. Frank Edward McCordick. The document describes where he served (United Kingdom, Central Mediterranean, Continental Europe) and the length of his service (1939-1945). Included on the certificate is a list of medals/decorations which include: 1939-45 Star, Italy Star, France and Germany Star, Defence Medal Canadian Volunteer Service Medal and Clasp.

Order of Service for the Honour Roll Unveiling - 10 June, 1945

A dedication service program for those who gave their lives during World War II from the city of St. Catharines. The list of over 150 names was to be read aloud and an address made by the Mayor (W.J. Macdonald) with prayers and hymn to follow.

OPTIMAL UTILIZATION OF SERVICE FACILITY FOR A k-OUT-OF-n SYSTEM WITH REPAIR BY EXTENDING SERVICE TO EXTERNAL CUSTOMERS IN A RETRIAL QUEUE

In this paper, we study a k-out-of-n system with single server who provides service to external customers also. The system consists of two parts:(i) a main queue consisting of customers (failed components of the k-out-of-n system) and (ii) a pool (of finite capacity M) of external customers together with an orbit for external customers who find the pool full. An external customer who finds the pool full on arrival, joins the orbit with probability and with probability 1− leaves the system forever. An orbital customer, who finds the pool full, at an epoch of repeated attempt, returns to orbit with probability (< 1) and with probability 1 − leaves the system forever. We compute the steady state system size probability. Several performance measures are computed, numerical illustrations are provided.

On Queues with Interruptions and Repeat or Resumption of Service

This thesis entitled' On Queues with Interruptions and Repeat or Resumption of Service' introduces several new concepts into queues with service interruption. It is divided into Seven chapters including an introductory chapter. The following are keywords that we use in this thesis: Phase type (PH) distribution, Markovian Arrival Process (MAP), Geometric Distribution, Service Interruption, First in First out (FIFO), threshold random variable and Super threshold random variable. In the second chapter we introduce a new concept called the 'threshold random variable' which competes with interruption time to decide whether to repeat or resume the interrupted service after removal of interruptions. This notion generalizes the work reported so far in queues with service interruptions. In chapter 3 we introduce the concept of what is called 'Super threshold clock' (a random variable) which keeps track of the total interruption time of a customer during his service except when it is realized before completion of interruption in some cases to be discussed in this thesis and in other cases it exactly measures the duration of all interruptions put together. The Super threshold clock is OIl whenever the service is interrupted and is deactivated when service is rendered. Throughout this thesis the first in first out service discipline is followed except for priority queues.

Safe Distributed Coordination of Heterogeneous Robots through Dynamic Simple Temporal Networks

Research on autonomous intelligent systems has focused on how robots can robustly carry out missions in uncertain and harsh environments with very little or no human intervention. Robotic execution languages such as RAPs, ESL, and TDL improve robustness by managing functionally redundant procedures for achieving goals. The model-based programming approach extends this by guaranteeing correctness of execution through pre-planning of non-deterministic timed threads of activities. Executing model-based programs effectively on distributed autonomous platforms requires distributing this pre-planning process. This thesis presents a distributed planner for modelbased programs whose planning and execution is distributed among agents with widely varying levels of processor power and memory resources. We make two key contributions. First, we reformulate a model-based program, which describes cooperative activities, into a hierarchical dynamic simple temporal network. This enables efficient distributed coordination of robots and supports deployment on heterogeneous robots. Second, we introduce a distributed temporal planner, called DTP, which solves hierarchical dynamic simple temporal networks with the assistance of the distributed Bellman-Ford shortest path algorithm. The implementation of DTP has been demonstrated successfully on a wide range of randomly generated examples and on a pursuer-evader challenge problem in simulation.

The distributed nature of pattern generalization

Resumen tomado de la publicaci??n

Dynamic load balancing for the distributed mining of molecular structures

In molecular biology, it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely, a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiverinitiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening data set, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational grids.

Distributed mining of molecular fragments

In real world applications sequential algorithms of data mining and data exploration are often unsuitable for datasets with enormous size, high-dimensionality and complex data structure. Grid computing promises unprecedented opportunities for unlimited computing and storage resources. In this context there is the necessity to develop high performance distributed data mining algorithms. However, the computational complexity of the problem and the large amount of data to be explored often make the design of large scale applications particularly challenging. In this paper we present the first distributed formulation of a frequent subgraph mining algorithm for discriminative fragments of molecular compounds. Two distributed approaches have been developed and compared on the well known National Cancer Institute’s HIV-screening dataset. We present experimental results on a small-scale computing environment.