A resource-search and routing algorithm within PCDN autonomy area

This paper studied a new type of network model; it is formed by the dynamic autonomy area, the structured source servers and the proxy servers. The new network model satisfies the dynamics within the autonomy area, where each node undertakes different tasks according to their different abilities, to ensure that each node has the load ability fit its own; it does not need to exchange information via the central servers, so it can carry out the efficient data transmission and routing search. According to the highly dynamics of the autonomy area, we established dynamic tree structure-proliferation system routing and resource-search algorithms and simulated these algorithms. Test results show the performance of the proposed network model and the algorithms are very stable.

Efficient algorithm for mobile multicast using anycast group

The authors present a novel and efficient multicast algorithm that aims to reduce delay and communication cost for the registration between mobile nodes and mobility agents and solicitation for foreign agent services based on the mobile IP. The protocol applies anycast group technology to support multicast transmissions for both mobile nodes and home/foreign agents. Mobile hosts use anycast tunnelling to connect to the nearest available home/foreign agent where an agent is able to forward the multicast messages by selecting an anycast route to a multicast router so as to reduce the end-to-end delay. The performance analysis and experiments demonstrated that the proposed algorithm is able to enhance the performance over existing remote subscription and bidirectional tunnelling approaches regardless of the locations of mobile nodes/hosts

Optimal multicast tree routing for cluster computing in hypercube interconnection networks

Cluster computation has been used in the applications that demand performance, reliability, and availability, such as cluster server groups, large-scale scientific computations, distributed databases, distributed media-on-demand servers and search engines etc. In those applications, multicast can play the vital roles for the information dissemination among groups of servers and users. This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube interconnection of cluster computers using multicast shared tree approach. We present some new algorithms for selecting an optimal core (root) and constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient in the senses of short end-to-end average delay, load balance and less resource utilizations over hypercube cluster interconnection networks.

Mining inconsistent secure messages toward analyzing security protocols

Traditional approaches such as theorem proving and model checking have been successfully used to analyze security protocols. Ideally, they assume the data communication is reliable and require the user to predetermine authentication goals. However, missing and inconsistent data have been greatly ignored, and the increasingly complicated security protocol makes it difficult to predefine such goals. This paper presents a novel approach to analyze security protocols using association rule mining. It is able to not only validate the reliability of transactions but also discover potential correlations between secure messages. The algorithm and experiment demonstrate that our approaches are useful and promising.

How graduate nurses use protocols to manage patients` medications

Aims and objectives. The aim of the study was to determine how graduate nurses use protocols in their medication management activities. The objectives were to: examine the extent of adherence to various protocols in relation to medication activities and determine how the ward environment impacts on graduate nurses' use of protocols to manage patients' medications.
Background. Protocols help newly qualified nurses integrate new knowledge into practice and promote effective decision-making
Design. A descriptive prospective qualitative design was used.
Methods. Twelve graduate nurses involved in direct patient care in medical, surgical and specialty wards of a metropolitan teaching hospital participated in the study. Participant observations were conducted with the graduate nurses during a two-hour period when medications were being administered to patients. In-depth interviews were conducted with each nurse immediately after observations and demographic data were collected on participating nurses and patients in their care, including all medications prescribed. Protocols associated with medication management activities for the clinical settings were also transcribed.
Results. Six themes were evident from the data: availability and use of protocols, scrutinizing patients' identity before medication administration, double-checking certain medications before administration, writing incident reports, following specific policies and timing the administration of medications.
Conclusion. Graduate nurses adhered to protocols if they were perceived not to impede with other nursing activities. Participants were also more likely to follow protocols if they felt encouraged to make their own decisions and if there was a decreased likelihood that disciplinary action would be involved.
Relevance to clinical practice. Experienced health professionals should encourage graduate nurses to comply with medication protocols and to make clinically reasoned decisions about medication activities. By providing peer support and acting as role models, experienced health professionals can also demonstrate to graduate nurses how effective protocol use is an important component of quality patient care.

Ripple effect : an improved geographic routing with local connectivity information

One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity status at each node before making routing decision. We present a protocol, Density Ripple Exchange (DRE), that maintains local density information at each node, and a new geographic routing algorithm, Geographic Ripple Routing (GRR), that achieves better routing performance in both hop stretch and transmission stretch than existing geographic routing algorithms by exploiting available connectivity information. Our simulations demonstrate that we increased the performance for GRR over Greedy Perimeter Stateless Routing (GPSR) by about 15%. The cost of this improved performance is a small amount of additional local connectivity information required for our algorithm.

Manual on application of molecular tools in aquaculture and inland fisheries management. Part I : laboratory protocols, data management and analysis

The aim of this manual is to provide a comprehensive practical tool for the generation and analysis of genetic data for subsequent application in aquatic resources management in relation to genetic stock identification in inland fisheries and aquaculture. The material only covers general background on genetics in relation to aquaculture and fisheries resource management, the techniques and relevant methods of data analysis that are commonly used to address questions relating to genetic resource characterisation and population genetic analyses. No attempt is made to include applications of genetic improvement techniques e.g. selective breeding or producing genetically modified organisms (GMOs). The manual includes two ‘stand-alone’ parts, of which this is the second volume: Part 1 – Conceptual basis of population genetic approaches: will provide a basic foundation on genetics in general, and concepts of population genetics. Issues on the choices of molecular markers and project design are also discussed. Part 2 – Laboratory protocols, data management and analysis: will provide step-by-step protocols of the most commonly used molecular genetic techniques utilised in population genetics and systematic studies. In addition, a brief discussion and explanation of how these data are managed and analysed is also included. This manual is expected to enable NACA member country personnel to be trained to undertake molecular genetic studies in their own institutions, and as such is aimed at middle and higher level technical grades. The manual can also provide useful teaching material for specialised advanced level university courses in the region and postgraduate students. The manual has gone through two development/improvement stages. The initial material was tested at a regional workshop and at the second stage feedback from participants was used to improve the contents.

Anycast services and its applications

Anycast in next generation Internet Protocol is a hot topic in the research of computer networks. It has promising potentials and also many challenges, such as architecture, routing, Quality-of-Service, anycast in ad hoc networks, application-layer anycast, etc. In this thesis, we tackle some important topics among them. The thesis at first presents an introduction about anycast, followed by the related work. Then, as our major contributions, a number of challenging issues are addressed in the following chapters. We tackled the anycast routing problem by proposing a requirement based probing algorithm at application layer for anycast routing. Compared with the existing periodical based probing routing algorithm, the proposed routing algorithm improves the performance in terms of delay. We addressed the reliable service problem by the design of a twin server model for the anycast servers, providing a transparent and reliable service for all anycast queries. We addressed the load balance problem of anycast servers by proposing new job deviation strategies, to provide a similar Quality-of-Service to all clients of anycast servers. We applied the mesh routing methodology in the anycast routing in ad hoc networking environment, which provides a reliable routing service and uses much less network resources. We combined the anycast protocol and the multicast protocol to provide a bidirectional service, and applied the service to Web-based database applications, achieving a better query efficiency and data synchronization. Finally, we proposed a new Internet based service, minicast, as the combination of the anycast and multicast protocols. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. We show that the minicast service consumes less network resources while providing the same services. The last chapter of the thesis presents the conclusions and discusses the future work.

Status - based routing in baggage handling systems : searching verses learning

This study contributes to work in baggage handling system (BHS) control, specifically dynamic bag routing. Although studies in BHS agent-based control have examined the need for intelligent control, but there has not been an effort to explore the dynamic routing problem. As such, this study provides additional insight into how agents can learn to route in a BHS. This study describes a BHS status-based routing algorithm that applies learning methods to select criteria based on routing decisions. Although numerous studies have identified the need for dynamic routing, little analytic attention has been paid to intelligent agents for learning routing tables rather than manual creation of routing rules. We address this issue by demonstrating the ability of agents to learn how to route based on bag status, a robust method that is able to function in a variety of different BHS designs.

Multi-level virtual ring : cross-level name routing with embedded identifier in sensor network

This paper presents the Multi-level Virtual Ring (MVR), a new name routing scheme for sensor networks. MVR uses selection algorithm to identify sensor nodes' virtual level and uses Distribution Hash Table (DHT) to map them to the MVR, The address routing performs well in wired network, but it's not true in sensor network. Because when nodes are moving, the address of the nodes must be changed Further, the address routing needs servers to allocate addresses to nodes. To solve this problem, the name routing is being introduced, such as Virtual Ring Routing (VRR). MVR is a new name routing scheme, which improves the routing performance significantly by introducing the multi-level virtual ring and cross-level routing. Experiments show this embedded name routing is workable and achieves better routing performance.

Virtual backbone content routing in wireless ad-hoc network

We developed a new content routing based on the virtual backbone structure, which groups wireless nodes and contents into a virtual architecture. Our approach is scalable, works with local information, and does not rely on address information. The naming system uses flat naming to identify nodes and contents, and organizes these identifiers together. Backbone nodes can be selected automatically or predefined to direct their associated normal nodes in a local area. The normal nodes are guided by the backbone nodes to full fill the searching and routing processes. With a virtual structure, the searching performance can be improved by using the DHT technique.

Experiments using ns2 simulator demonstrate that this virtual backbone routing architecture has the following significances: workable without being aware address in a mobile situation; scalable with the size of network; efficient in terms of the reduced hop counts and short end-to-end delay, and also resistant to the dead-end problem.

Multidisciplinary team developed and implemented protocols to assist mechanical ventilation weaning : a systematic review of literature

Aim: The aim of this review was to determine if ventilation-weaning protocols developed and implemented by multidisciplinary teams (MDTs) reduced the duration of mechanical ventilation in adult intensive care patients compared to usual care.

Method: A systematic review was conducted to review published research studies from January 1999 to June 2009 to identify and analyse the best available evidence on MDT-based weaning protocols in adult intensive care patients. All relevant studies based on electronic searches of MEDLINE, EMBASE, CINAHL, the Cochrane Controlled Trials Registry and the Cochrane Database of Systematic Reviews were included. Where possible data were pooled and a meta-analysis performed. A narrative synthesis of data was conducted to provide a critical appraisal of nonrandomised controlled trials included in the review.

Results: Three pre- and postinterventional studies were identified for inclusion in this review. Results show equivocal support for weaning protocols developed and implemented by MDTs for reducing duration of mechanical ventilation.

Conclusion: Communication and organizational processes must be addressed for multidisciplinary protocols to be effective. Due to methodological limitations of included studies, large randomised controlled trials are required to provide high-level evidence of the effects of MDT-based protocols on duration of mechanical ventilation.

An optimal transportation routing approach using GIS-based dynamic traffic flows

This paper examines the value of real-time traffic information gathered through Geographic Information Systems for achieving an optimal vehicle routing within a dynamically stochastic transportation network. We present a systematic approach in determining the dynamically varying parameters and implementation attributes that were used for the development of a Web-based transportation routing application integrated with real-time GIS services. We propose and implement an optimal routing algorithm by modifying Dijkstra’s algorithm in order to incorporate stochastically changing traffic flows. We describe the significant features of our Web application in making use of the real-time dynamic traffic flow information from GIS services towards achieving total costs savings and vehicle usage reduction. These features help users and vehicle drivers in improving their service levels and productivity as the Web application enables them to interactively find the optimal path and in identifying destinations effectively.