MPF: A portable message passing facility for shared memory multiprocessors

NASA Technical Reports Server (NTRS)

Malony, Allen D.; Reed, Daniel A.; Mcguire, Patrick J.

1987-01-01

The design, implementation, and performance evaluation of a message passing facility (MPF) for shared memory multiprocessors are presented. The MPF is based on a message passing model conceptually similar to conversations. Participants (parallel processors) can enter or leave a conversation at any time. The message passing primitives for this model are implemented as a portable library of C function calls. The MPF is currently operational on a Sequent Balance 21000, and several parallel applications were developed and tested. Several simple benchmark programs are presented to establish interprocess communication performance for common patterns of interprocess communication. Finally, performance figures are presented for two parallel applications, linear systems solution, and iterative solution of partial differential equations.

Efficiently passing messages in distributed spiking neural network simulation.

PubMed

Thibeault, Corey M; Minkovich, Kirill; O'Brien, Michael J; Harris, Frederick C; Srinivasa, Narayan

2013-01-01

Efficiently passing spiking messages in a neural model is an important aspect of high-performance simulation. As the scale of networks has increased so has the size of the computing systems required to simulate them. In addition, the information exchange of these resources has become more of an impediment to performance. In this paper we explore spike message passing using different mechanisms provided by the Message Passing Interface (MPI). A specific implementation, MVAPICH, designed for high-performance clusters with Infiniband hardware is employed. The focus is on providing information about these mechanisms for users of commodity high-performance spiking simulators. In addition, a novel hybrid method for spike exchange was implemented and benchmarked.

Message Passing and Shared Address Space Parallelism on an SMP Cluster

NASA Technical Reports Server (NTRS)

Shan, Hongzhang; Singh, Jaswinder P.; Oliker, Leonid; Biswas, Rupak; Biegel, Bryan (Technical Monitor)

2002-01-01

Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, especially for irregularly structured computations. SAS offers substantial ease of programming, but may suffer from performance limitations due to poor spatial locality and high protocol overhead. In this paper, we compare the performance of and the programming effort required for six applications under both programming models on a 32-processor PC-SMP cluster, a platform that is becoming increasingly attractive for high-end scientific computing. Our application suite consists of codes that typically do not exhibit scalable performance under shared-memory programming due to their high communication-to-computation ratios and/or complex communication patterns. Results indicate that SAS can achieve about half the parallel efficiency of MPI for most of our applications, while being competitive for the others. A hybrid MPI+SAS strategy shows only a small performance advantage over pure MPI in some cases. Finally, improved implementations of two MPI collective operations on PC-SMP clusters are presented.

A new deadlock resolution protocol and message matching algorithm for the extreme-scale simulator

DOE PAGES

Engelmann, Christian; Naughton, III, Thomas J.

2016-03-22

Investigating the performance of parallel applications at scale on future high-performance computing (HPC) architectures and the performance impact of different HPC architecture choices is an important component of HPC hardware/software co-design. The Extreme-scale Simulator (xSim) is a simulation toolkit for investigating the performance of parallel applications at scale. xSim scales to millions of simulated Message Passing Interface (MPI) processes. The overhead introduced by a simulation tool is an important performance and productivity aspect. This paper documents two improvements to xSim: (1)~a new deadlock resolution protocol to reduce the parallel discrete event simulation overhead and (2)~a new simulated MPI message matchingmore » algorithm to reduce the oversubscription management overhead. The results clearly show a significant performance improvement. The simulation overhead for running the NAS Parallel Benchmark suite was reduced from 102% to 0% for the embarrassingly parallel (EP) benchmark and from 1,020% to 238% for the conjugate gradient (CG) benchmark. xSim offers a highly accurate simulation mode for better tracking of injected MPI process failures. Furthermore, with highly accurate simulation, the overhead was reduced from 3,332% to 204% for EP and from 37,511% to 13,808% for CG.« less

Passing crisis and emergency risk communications: the effects of communication channel, information type, and repetition.

PubMed

Edworthy, Judy; Hellier, Elizabeth; Newbold, Lex; Titchener, Kirsteen

2015-05-01

Three experiments explore several factors which influence information transmission when warning messages are passed from person to person. In Experiment 1, messages were passed down chains of participants using five different modes of communication. Written communication channels resulted in more accurate message transmission than verbal. In addition, some elements of the message endured further down the chain than others. Experiment 2 largely replicated these effects and also demonstrated that simple repetition of a message eliminated differences between written and spoken communication. In a final field experiment, chains of participants passed information however they wanted to, with the proviso that half of the chains could not use telephones. Here, the lack of ability to use a telephone did not affect accuracy, but did slow down the speed of transmission from the recipient of the message to the last person in the chain. Implications of the findings for crisis and emergency risk communication are discussed. Copyright © 2015 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Efficient decentralized consensus protocols

NASA Technical Reports Server (NTRS)

Lakshman, T. V.; Agrawala, A. K.

1986-01-01

Decentralized consensus protocols are characterized by successive rounds of message interchanges. Protocols which achieve a consensus in one round of message interchange require O(N-squared) messages, where N is the number of participants. In this paper, a communication scheme, based on finite projective planes, which requires only O(N sq rt N) messages for each round is presented. Using this communication scheme, decentralized consensus protocols which achieve a consensus within two rounds of message interchange are developed. The protocols are symmetric, and the communication scheme does not impose any hierarchical structure. The scheme is illustrated using blocking and nonblocking commit protocols, decentralized extrema finding, and computation of the sum function.

Statistics of Epidemics in Networks by Passing Messages

NASA Astrophysics Data System (ADS)

Shrestha, Munik Kumar

Epidemic processes are common out-of-equilibrium phenomena of broad interdisciplinary interest. In this thesis, we show how message-passing approach can be a helpful tool for simulating epidemic models in disordered medium like networks, and in particular for estimating the probability that a given node will become infectious at a particular time. The sort of dynamics we consider are stochastic, where randomness can arise from the stochastic events or from the randomness of network structures. As in belief propagation, variables or messages in message-passing approach are defined on the directed edges of a network. However, unlike belief propagation, where the posterior distributions are updated according to Bayes' rule, in message-passing approach we write differential equations for the messages over time. It takes correlations between neighboring nodes into account while preventing causal signals from backtracking to their immediate source, and thus avoids "echo chamber effects" where a pair of adjacent nodes each amplify the probability that the other is infectious. In our first results, we develop a message-passing approach to threshold models of behavior popular in sociology. These are models, first proposed by Granovetter, where individuals have to hear about a trend or behavior from some number of neighbors before adopting it themselves. In thermodynamic limit of large random networks, we provide an exact analytic scheme while calculating the time dependence of the probabilities and thus learning about the whole dynamics of bootstrap percolation, which is a simple model known in statistical physics for exhibiting discontinuous phase transition. As an application, we apply a similar model to financial networks, studying when bankruptcies spread due to the sudden devaluation of shared assets in overlapping portfolios. We predict that although diversification may be good for individual institutions, it can create dangerous systemic effects, and as a result financial contagion gets worse with too much diversification. We also predict that financial system exhibits "robust yet fragile" behavior, with regions of the parameter space where contagion is rare but catastrophic whenever it occurs. In further results, we develop a message-passing approach to recurrent state epidemics like susceptible-infectious-susceptible and susceptible-infectious-recovered-susceptible where nodes can return to previously inhabited states and multiple waves of infection can pass through the population. Given that message-passing has been applied exclusively to models with one-way state changes like susceptible-infectious and susceptible-infectious-recovered, we develop message-passing for recurrent epidemics based on a new class of differential equations and demonstrate that our approach is simple and efficiently approximates results obtained from Monte Carlo simulation, and that the accuracy of message-passing is often superior to the pair approximation (which also takes second-order correlations into account).

Verification of Faulty Message Passing Systems with Continuous State Space in PVS

NASA Technical Reports Server (NTRS)

Pilotto, Concetta; White, Jerome

2010-01-01

We present a library of Prototype Verification System (PVS) meta-theories that verifies a class of distributed systems in which agent commu nication is through message-passing. The theoretic work, outlined in, consists of iterative schemes for solving systems of linear equations , such as message-passing extensions of the Gauss and Gauss-Seidel me thods. We briefly review that work and discuss the challenges in formally verifying it.

The serial message-passing schedule for LDPC decoding algorithms

NASA Astrophysics Data System (ADS)

Liu, Mingshan; Liu, Shanshan; Zhou, Yuan; Jiang, Xue

2015-12-01

The conventional message-passing schedule for LDPC decoding algorithms is the so-called flooding schedule. It has the disadvantage that the updated messages cannot be used until next iteration, thus reducing the convergence speed . In this case, the Layered Decoding algorithm (LBP) based on serial message-passing schedule is proposed. In this paper the decoding principle of LBP algorithm is briefly introduced, and then proposed its two improved algorithms, the grouped serial decoding algorithm (Grouped LBP) and the semi-serial decoding algorithm .They can improve LBP algorithm's decoding speed while maintaining a good decoding performance.

Users manual for the Chameleon parallel programming tools

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gropp, W.; Smith, B.

1993-06-01

Message passing is a common method for writing programs for distributed-memory parallel computers. Unfortunately, the lack of a standard for message passing has hampered the construction of portable and efficient parallel programs. In an attempt to remedy this problem, a number of groups have developed their own message-passing systems, each with its own strengths and weaknesses. Chameleon is a second-generation system of this type. Rather than replacing these existing systems, Chameleon is meant to supplement them by providing a uniform way to access many of these systems. Chameleon`s goals are to (a) be very lightweight (low over-head), (b) be highlymore » portable, and (c) help standardize program startup and the use of emerging message-passing operations such as collective operations on subsets of processors. Chameleon also provides a way to port programs written using PICL or Intel NX message passing to other systems, including collections of workstations. Chameleon is tracking the Message-Passing Interface (MPI) draft standard and will provide both an MPI implementation and an MPI transport layer. Chameleon provides support for heterogeneous computing by using p4 and PVM. Chameleon`s support for homogeneous computing includes the portable libraries p4, PICL, and PVM and vendor-specific implementation for Intel NX, IBM EUI (SP-1), and Thinking Machines CMMD (CM-5). Support for Ncube and PVM 3.x is also under development.« less

Performance Comparison of a Matrix Solver on a Heterogeneous Network Using Two Implementations of MPI: MPICH and LAM

NASA Technical Reports Server (NTRS)

Phillips, Jennifer K.

1995-01-01

Two of the current and most popular implementations of the Message-Passing Standard, Message Passing Interface (MPI), were contrasted: MPICH by Argonne National Laboratory, and LAM by the Ohio Supercomputer Center at Ohio State University. A parallel skyline matrix solver was adapted to be run in a heterogeneous environment using MPI. The Message-Passing Interface Forum was held in May 1994 which lead to a specification of library functions that implement the message-passing model of parallel communication. LAM, which creates it's own environment, is more robust in a highly heterogeneous network. MPICH uses the environment native to the machine architecture. While neither of these free-ware implementations provides the performance of native message-passing or vendor's implementations, MPICH begins to approach that performance on the SP-2. The machines used in this study were: IBM RS6000, 3 Sun4, SGI, and the IBM SP-2. Each machine is unique and a few machines required specific modifications during the installation. When installed correctly, both implementations worked well with only minor problems.

Combining Distributed and Shared Memory Models: Approach and Evolution of the Global Arrays Toolkit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nieplocha, Jarek; Harrison, Robert J.; Kumar, Mukul

2002-07-29

Both shared memory and distributed memory models have advantages and shortcomings. Shared memory model is much easier to use but it ignores data locality/placement. Given the hierarchical nature of the memory subsystems in the modern computers this characteristic might have a negative impact on performance and scalability. Various techniques, such as code restructuring to increase data reuse and introducing blocking in data accesses, can address the problem and yield performance competitive with message passing[Singh], however at the cost of compromising the ease of use feature. Distributed memory models such as message passing or one-sided communication offer performance and scalability butmore » they compromise the ease-of-use. In this context, the message-passing model is sometimes referred to as?assembly programming for the scientific computing?. The Global Arrays toolkit[GA1, GA2] attempts to offer the best features of both models. It implements a shared-memory programming model in which data locality is managed explicitly by the programmer. This management is achieved by explicit calls to functions that transfer data between a global address space (a distributed array) and local storage. In this respect, the GA model has similarities to the distributed shared-memory models that provide an explicit acquire/release protocol. However, the GA model acknowledges that remote data is slower to access than local data and allows data locality to be explicitly specified and hence managed. The GA model exposes to the programmer the hierarchical memory of modern high-performance computer systems, and by recognizing the communication overhead for remote data transfer, it promotes data reuse and locality of reference. This paper describes the characteristics of the Global Arrays programming model, capabilities of the toolkit, and discusses its evolution.« less

Implementing Multidisciplinary and Multi-Zonal Applications Using MPI

NASA Technical Reports Server (NTRS)

Fineberg, Samuel A.

1995-01-01

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. Unfortunately, simple message passing models, like Intel's NX library, only allow point-to-point and global communication within a single system-defined partition. This makes implementation of these applications quite difficult, if not impossible. In this report it is shown that the new Message Passing Interface (MPI) standard is a viable portable library for implementing the message passing portion of multidisciplinary applications. Further, with the extension of a portable loader, fully portable multidisciplinary application programs can be developed. Finally, the performance of MPI is compared to that of some native message passing libraries. This comparison shows that MPI can be implemented to deliver performance commensurate with native message libraries.

Multiple-Ring Digital Communication Network

NASA Technical Reports Server (NTRS)

Kirkham, Harold

1992-01-01

Optical-fiber digital communication network to support data-acquisition and control functions of electric-power-distribution networks. Optical-fiber links of communication network follow power-distribution routes. Since fiber crosses open power switches, communication network includes multiple interconnected loops with occasional spurs. At each intersection node is needed. Nodes of communication network include power-distribution substations and power-controlling units. In addition to serving data acquisition and control functions, each node acts as repeater, passing on messages to next node(s). Multiple-ring communication network operates on new AbNET protocol and features fiber-optic communication.

Efficient Implementation of Multigrid Solvers on Message-Passing Parrallel Systems

NASA Technical Reports Server (NTRS)

Lou, John

1994-01-01

We discuss our implementation strategies for finite difference multigrid partial differential equation (PDE) solvers on message-passing systems. Our target parallel architecture is Intel parallel computers: the Delta and Paragon system.

PyPele Rewritten To Use MPI

NASA Technical Reports Server (NTRS)

Hockney, George; Lee, Seungwon

2008-01-01

A computer program known as PyPele, originally written as a Pythonlanguage extension module of a C++ language program, has been rewritten in pure Python language. The original version of PyPele dispatches and coordinates parallel-processing tasks on cluster computers and provides a conceptual framework for spacecraft-mission- design and -analysis software tools to run in an embarrassingly parallel mode. The original version of PyPele uses SSH (Secure Shell a set of standards and an associated network protocol for establishing a secure channel between a local and a remote computer) to coordinate parallel processing. Instead of SSH, the present Python version of PyPele uses Message Passing Interface (MPI) [an unofficial de-facto standard language-independent application programming interface for message- passing on a parallel computer] while keeping the same user interface. The use of MPI instead of SSH and the preservation of the original PyPele user interface make it possible for parallel application programs written previously for the original version of PyPele to run on MPI-based cluster computers. As a result, engineers using the previously written application programs can take advantage of embarrassing parallelism without need to rewrite those programs.

From Our Practices to Yours: Key Messages for the Journey to Integrated Behavioral Health.

PubMed

Gold, Stephanie B; Green, Larry A; Peek, C J

The historic, cultural separation of primary care and behavioral health has caused the spread of integrated care to lag behind other practice transformation efforts. The Advancing Care Together study was a 3-year evaluation of how practices implemented integrated care in their local contexts; at its culmination, practice leaders ("innovators") identified lessons learned to pass on to others. Individual feedback from innovators, key messages created by workgroups of innovators and the study team, and a synthesis of key messages from a facilitated discussion were analyzed for themes via immersion/crystallization. Five key themes were captured: (1) frame integrated care as a necessary paradigm shift to patient-centered, whole-person health care; (2) initialize: define relationships and protocols up-front, understanding they will evolve; (3) build inclusive, empowered teams to provide the foundation for integration; (4) develop a change management strategy of continuous evaluation and course-correction; and (5) use targeted data collection pertinent to integrated care to drive improvement and impart accountability. Innovators integrating primary care and behavioral health discerned key messages from their practical experience that they felt were worth sharing with others. Their messages present insight into the challenges unique to integrating care beyond other practice transformation efforts. © Copyright 2017 by the American Board of Family Medicine.

Attacks on quantum key distribution protocols that employ non-ITS authentication

NASA Astrophysics Data System (ADS)

Pacher, C.; Abidin, A.; Lorünser, T.; Peev, M.; Ursin, R.; Zeilinger, A.; Larsson, J.-Å.

2016-01-01

We demonstrate how adversaries with large computing resources can break quantum key distribution (QKD) protocols which employ a particular message authentication code suggested previously. This authentication code, featuring low key consumption, is not information-theoretically secure (ITS) since for each message the eavesdropper has intercepted she is able to send a different message from a set of messages that she can calculate by finding collisions of a cryptographic hash function. However, when this authentication code was introduced, it was shown to prevent straightforward man-in-the-middle (MITM) attacks against QKD protocols. In this paper, we prove that the set of messages that collide with any given message under this authentication code contains with high probability a message that has small Hamming distance to any other given message. Based on this fact, we present extended MITM attacks against different versions of BB84 QKD protocols using the addressed authentication code; for three protocols, we describe every single action taken by the adversary. For all protocols, the adversary can obtain complete knowledge of the key, and for most protocols her success probability in doing so approaches unity. Since the attacks work against all authentication methods which allow to calculate colliding messages, the underlying building blocks of the presented attacks expose the potential pitfalls arising as a consequence of non-ITS authentication in QKD post-processing. We propose countermeasures, increasing the eavesdroppers demand for computational power, and also prove necessary and sufficient conditions for upgrading the discussed authentication code to the ITS level.

High speed bus technology development

NASA Astrophysics Data System (ADS)

Modrow, Marlan B.; Hatfield, Donald W.

1989-09-01

The development and demonstration of the High Speed Data Bus system, a 50 Million bits per second (Mbps) local data network intended for avionics applications in advanced military aircraft is described. The Advanced System Avionics (ASA)/PAVE PILLAR program provided the avionics architecture concept and basic requirements. Designs for wire and fiber optic media were produced and hardware demonstrations were performed. An efficient, robust token-passing protocol was developed and partially demonstrated. The requirements specifications, the trade-offs made, and the resulting designs for both a coaxial wire media system and a fiber optics design are examined. Also, the development of a message-oriented media access protocol is described, from requirements definition through analysis, simulation and experimentation. Finally, the testing and demonstrations conducted on the breadboard and brassboard hardware is presented.

Message passing with parallel queue traversal

DOEpatents

Underwood, Keith D [Albuquerque, NM; Brightwell, Ronald B [Albuquerque, NM; Hemmert, K Scott [Albuquerque, NM

2012-05-01

In message passing implementations, associative matching structures are used to permit list entries to be searched in parallel fashion, thereby avoiding the delay of linear list traversal. List management capabilities are provided to support list entry turnover semantics and priority ordering semantics.

Live chat alternative security protocol

NASA Astrophysics Data System (ADS)

Rahman, J. P. R.; Nugraha, E.; Febriany, A.

2018-05-01

Indonesia is one of the largest e-commerce markets in Southeast Asia, as many as 5 million people do transactions in e-commerce, therefore more and more people use live chat service to communicate with customer service. In live chat, the customer service often asks customers’ data such as, full name, address, e-mail, transaction id, which aims to verify the purchase of the product. One of the risks that will happen is sniffing which will lead to the theft of confidential information that will cause huge losses to the customer. The anticipation that will be done is build an alternative security protocol for user interaction in live chat by using a cryptographic algorithm that is useful for protecting confidential messages. Live chat requires confidentiality and data integration with encryption and hash functions. The used algorithm are Rijndael 256 bits, RSA, and SHA256. To increase the complexity, the Rijndael algorithm will be modified in the S-box and ShiftRow sections based on the shannon principle rule, the results show that all pass the Randomness test, but the modification in Shiftrow indicates a better avalanche effect. Therefore the message will be difficult to be stolen or changed.

Robust Routing Protocol For Digital Messages

NASA Technical Reports Server (NTRS)

Marvit, Maclen

1994-01-01

Refinement of ditigal-message-routing protocol increases fault tolerance of polled networks. AbNET-3 is latest of generic AbNET protocols for transmission of messages among computing nodes. AbNET concept described in "Multiple-Ring Digital Communication Network" (NPO-18133). Specifically aimed at increasing fault tolerance of network in broadcast mode, in which one node broadcasts message to and receives responses from all other nodes. Communication in network of computers maintained even when links fail.

Neighbourhood-consensus message passing and its potentials in image processing applications

NASA Astrophysics Data System (ADS)

Ružic, Tijana; Pižurica, Aleksandra; Philips, Wilfried

2011-03-01

In this paper, a novel algorithm for inference in Markov Random Fields (MRFs) is presented. Its goal is to find approximate maximum a posteriori estimates in a simple manner by combining neighbourhood influence of iterated conditional modes (ICM) and message passing of loopy belief propagation (LBP). We call the proposed method neighbourhood-consensus message passing because a single joint message is sent from the specified neighbourhood to the central node. The message, as a function of beliefs, represents the agreement of all nodes within the neighbourhood regarding the labels of the central node. This way we are able to overcome the disadvantages of reference algorithms, ICM and LBP. On one hand, more information is propagated in comparison with ICM, while on the other hand, the huge amount of pairwise interactions is avoided in comparison with LBP by working with neighbourhoods. The idea is related to the previously developed iterated conditional expectations algorithm. Here we revisit it and redefine it in a message passing framework in a more general form. The results on three different benchmarks demonstrate that the proposed technique can perform well both for binary and multi-label MRFs without any limitations on the model definition. Furthermore, it manifests improved performance over related techniques either in terms of quality and/or speed.

Foundations for a healthy future.

PubMed

Riley, R; Green, J; Willis, S; Soden, E; Rushby, C; Postle, D; Wakeling, S

1998-01-01

Health promotion activities with children and young people are important as they take messages about health seriously and can be influential in spreading messages about healthy living to their friends and families. Child health professionals have an important role to play in passing on messages of positive health to children and young people. Peer education is a useful way of passing on messages about health to young people. This article shares examples of three health promotion projects with children in a community trust, looking at asthma, sex education and testicular examination.

Performance comparison of token ring protocols for hard-real-time communication

NASA Technical Reports Server (NTRS)

Kamat, Sanjay; Zhao, Wei

1992-01-01

The ability to guarantee the deadlines of synchronous messages while maintaining a good aggregate throughput is an important consideration in the design of distributed real-time systems. In this paper, we study two token ring protocols, the priority driven protocol and the timed token protocol, for their suitability for hard real-time systems. Both these protocols use a token to control access to the transmission medium. In a priority driven protocol, messages are assigned priorities and the protocol ensures that messages are transmitted in the order of their priorities. Timed token protocols do not provide for priority arbitration but ensure that the maximum access delay for a station is bounded. For both protocols, we first derive the schedulability conditions under which the transmission deadlines of a given set of synchronous messages can be guaranteed. Subsequently, we use these schedulability conditions to quantitatively compare the average case behavior of the protocols. This comparison demonstrates that each of the protocols has its domain of superior performance and neither dominates the other for the entire range of operating conditions.

Dispatching packets on a global combining network of a parallel computer

DOEpatents

Almasi, Gheorghe [Ardsley, NY; Archer, Charles J [Rochester, MN

2011-07-19

Methods, apparatus, and products are disclosed for dispatching packets on a global combining network of a parallel computer comprising a plurality of nodes connected for data communications using the network capable of performing collective operations and point to point operations that include: receiving, by an origin system messaging module on an origin node from an origin application messaging module on the origin node, a storage identifier and an operation identifier, the storage identifier specifying storage containing an application message for transmission to a target node, and the operation identifier specifying a message passing operation; packetizing, by the origin system messaging module, the application message into network packets for transmission to the target node, each network packet specifying the operation identifier and an operation type for the message passing operation specified by the operation identifier; and transmitting, by the origin system messaging module, the network packets to the target node.

MPIRUN: A Portable Loader for Multidisciplinary and Multi-Zonal Applications

NASA Technical Reports Server (NTRS)

Fineberg, Samuel A.; Woodrow, Thomas S. (Technical Monitor)

1994-01-01

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. One method for implementing the message passing portion of these codes is with the new Message Passing Interface (MPI) standard. Unfortunately, this standard only specifies the message passing portion of an application, but does not specify any portable mechanisms for loading an application. MPIRUN was developed to provide a portable means for loading MPI programs, and was specifically targeted at multidisciplinary and multi-zonal applications. Programs using MPIRUN for loading and MPI for message passing are then portable between all machines supported by MPIRUN. MPIRUN is currently implemented for the Intel iPSC/860, TMC CM5, IBM SP-1 and SP-2, Intel Paragon, and workstation clusters. Further, MPIRUN is designed to be simple enough to port easily to any system supporting MPI.

A new control system hardware architecture for the Hobby-Eberly Telescope prime focus instrument package

NASA Astrophysics Data System (ADS)

Ramiller, Chuck; Taylor, Trey; Rafferty, Tom H.; Cornell, Mark E.; Rafal, Marc; Savage, Richard

2010-07-01

The Hobby-Eberly Telescope (HET) will be undergoing a major upgrade as a precursor to the HET Dark Energy Experiment (HETDEX‡). As part of this upgrade, the Prime Focus Instrument Package (PFIP) will be replaced with a new design that supports the HETDEX requirements along with the existing suite of instruments and anticipated future additions. This paper describes the new PFIP control system hardware plus the physical constraints and other considerations driving its design. Because of its location at the top end of the telescope, the new PFIP is essentially a stand-alone remote automation island containing over a dozen subsystems. Within the PFIP, motion controllers and modular IO systems are interconnected using a local Controller Area Network (CAN) bus and the CANOpen messaging protocol. CCD cameras that are equipped only with USB 2.0 interfaces are connected to a local Ethernet network via small microcontroller boards running embedded Linux. Links to ground-level systems pass through a 100 m cable bundle and use Ethernet over fiber optic cable exclusively; communications are either direct or through Ethernet/CAN gateways that pass CANOpen messages transparently. All of the control system hardware components are commercially available, designed for rugged industrial applications, and rated for extended temperature operation down to -10 °C.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Painter, J.; McCormick, P.; Krogh, M.

This paper presents the ACL (Advanced Computing Lab) Message Passing Library. It is a high throughput, low latency communications library, based on Thinking Machines Corp.`s CMMD, upon which message passing applications can be built. The library has been implemented on the Cray T3D, Thinking Machines CM-5, SGI workstations, and on top of PVM.

DMA engine for repeating communication patterns

DOEpatents

Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard; Vranas, Pavlos

2010-09-21

A parallel computer system is constructed as a network of interconnected compute nodes to operate a global message-passing application for performing communications across the network. Each of the compute nodes includes one or more individual processors with memories which run local instances of the global message-passing application operating at each compute node to carry out local processing operations independent of processing operations carried out at other compute nodes. Each compute node also includes a DMA engine constructed to interact with the application via Injection FIFO Metadata describing multiple Injection FIFOs where each Injection FIFO may containing an arbitrary number of message descriptors in order to process messages with a fixed processing overhead irrespective of the number of message descriptors included in the Injection FIFO.

Controlled Bidirectional Quantum Secure Direct Communication

PubMed Central

Chou, Yao-Hsin; Lin, Yu-Ting; Zeng, Guo-Jyun; Lin, Fang-Jhu; Chen, Chi-Yuan

2014-01-01

We propose a novel protocol for controlled bidirectional quantum secure communication based on a nonlocal swap gate scheme. Our proposed protocol would be applied to a system in which a controller (supervisor/Charlie) controls the bidirectional communication with quantum information or secret messages between legitimate users (Alice and Bob). In this system, the legitimate users must obtain permission from the controller in order to exchange their respective quantum information or secret messages simultaneously; the controller is unable to obtain any quantum information or secret messages from the decoding process. Moreover, the presence of the controller also avoids the problem of one legitimate user receiving the quantum information or secret message before the other, and then refusing to help the other user decode the quantum information or secret message. Our proposed protocol is aimed at protecting against external and participant attacks on such a system, and the cost of transmitting quantum bits using our protocol is less than that achieved in other studies. Based on the nonlocal swap gate scheme, the legitimate users exchange their quantum information or secret messages without transmission in a public channel, thus protecting against eavesdroppers stealing the secret messages. PMID:25006596

The Quantum Steganography Protocol via Quantum Noisy Channels

NASA Astrophysics Data System (ADS)

Wei, Zhan-Hong; Chen, Xiu-Bo; Niu, Xin-Xin; Yang, Yi-Xian

2015-08-01

As a promising branch of quantum information hiding, Quantum steganography aims to transmit secret messages covertly in public quantum channels. But due to environment noise and decoherence, quantum states easily decay and change. Therefore, it is very meaningful to make a quantum information hiding protocol apply to quantum noisy channels. In this paper, we make the further research on a quantum steganography protocol for quantum noisy channels. The paper proved that the protocol can apply to transmit secret message covertly in quantum noisy channels, and explicity showed quantum steganography protocol. In the protocol, without publishing the cover data, legal receivers can extract the secret message with a certain probability, which make the protocol have a good secrecy. Moreover, our protocol owns the independent security, and can be used in general quantum communications. The communication, which happen in our protocol, do not need entangled states, so our protocol can be used without the limitation of entanglement resource. More importantly, the protocol apply to quantum noisy channels, and can be used widely in the future quantum communication.

Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies.

PubMed

Xu, Lei; Jeavons, Peter

2015-11-01

Leader election in anonymous rings and complete networks is a very practical problem in distributed computing. Previous algorithms for this problem are generally designed for a classical message passing model where complex messages are exchanged. However, the need to send and receive complex messages makes such algorithms less practical for some real applications. We present some simple synchronous algorithms for distributed leader election in anonymous rings and complete networks that are inspired by the development of the neural system of the fruit fly. Our leader election algorithms all assume that only one-bit messages are broadcast by nodes in the network and processors are only able to distinguish between silence and the arrival of one or more messages. These restrictions allow implementations to use a simpler message-passing architecture. Even with these harsh restrictions our algorithms are shown to achieve good time and message complexity both analytically and experimentally.

GUMP: Adapting Client/Server Messaging Protocols into Peer-to-Peer Serverless Environments

DTIC Science & Technology

2010-06-11

and other related metadata, such as message re- ceiver ID (for supporting multiple connections) and so forth. The Proxy consumes the message and uses...the underlying discovery subsystem and multicast to process the message and translate the request into behaviour suitable for the un- derlying...communication i.e. a chat. Jingle (XEP-0166) [26] is a related specification that de- fines an extension to the XMPP protocol for initiating and

Probability Distributions over Cryptographic Protocols

DTIC Science & Technology

2009-06-01

Artificial Immune Algorithm . . . . . . . . . . . . . . . . . . . 9 3 Design Decisions 11 3.1 Common Ground...creation algorithm for unbounded distribution . . . . . . . 24 4.2 Message creation algorithm for unbounded naive distribution . . . . 24 4.3 Protocol...creation algorithm for intended-run distributions . . . . . . 26 4.4 Protocol and message creation algorithm for realistic distribution . . 32 ix THIS

Information Management and Learning in Computer Conferences: Coping with Irrelevant and Unconnected Messages.

ERIC Educational Resources Information Center

Schwan, Stephan; Straub, Daniela; Hesse, Friedrich W.

2002-01-01

Describes a study of computer conferencing where learners interacted over the course of four log-in sessions to acquire the knowledge sufficient to pass a learning test. Studied the number of messages irrelevant to the topic, explicit threading of messages, reading times of relevant messages, and learning outcomes. (LRW)

Alternative parallel ring protocols

NASA Technical Reports Server (NTRS)

Mukkamala, R.; Foudriat, E. C.; Maly, Kurt J.; Kale, V.

1990-01-01

Communication protocols are know to influence the utilization and performance of communication network. The effect of two token ring protocols on a gigabit network with multiple ring structure is investigated. In the first protocol, a mode sends at most one message on receiving a token. In the second protocol, a mode sends all the waiting messages when a token is received. The behavior of these protocols is shown to be highly dependent on the number of rings as well as the load in the network.

What it Takes to Get Passed On: Message Content, Style, and Structure as Predictors of Retransmission in the Boston Marathon Bombing Response

PubMed Central

Sutton, Jeannette; Gibson, C. Ben; Spiro, Emma S.; League, Cedar; Fitzhugh, Sean M.; Butts, Carter T.

2015-01-01

Message retransmission is a central aspect of information diffusion. In a disaster context, the passing on of official warning messages by members of the public also serves as a behavioral indicator of message salience, suggesting that particular messages are (or are not) perceived by the public to be both noteworthy and valuable enough to share with others. This study provides the first examination of terse message retransmission of official warning messages in response to a domestic terrorist attack, the Boston Marathon Bombing in 2013. Using messages posted from public officials’ Twitter accounts that were active during the period of the Boston Marathon bombing and manhunt, we examine the features of messages that are associated with their retransmission. We focus on message content, style, and structure, as well as the networked relationships of message senders to answer the question: what characteristics of a terse message sent under conditions of imminent threat predict its retransmission among members of the public? We employ a negative binomial model to examine how message characteristics affect message retransmission. We find that, rather than any single effect dominating the process, retransmission of official Tweets during the Boston bombing response was jointly influenced by various message content, style, and sender characteristics. These findings suggest the need for more work that investigates impact of multiple factors on the allocation of attention and on message retransmission during hazard events. PMID:26295584

Requirements analysis for a hardware, discrete-event, simulation engine accelerator

NASA Astrophysics Data System (ADS)

Taylor, Paul J., Jr.

1991-12-01

An analysis of a general Discrete Event Simulation (DES), executing on the distributed architecture of an eight mode Intel PSC/2 hypercube, was performed. The most time consuming portions of the general DES algorithm were determined to be the functions associated with message passing of required simulation data between processing nodes of the hypercube architecture. A behavioral description, using the IEEE standard VHSIC Hardware Description and Design Language (VHDL), for a general DES hardware accelerator is presented. The behavioral description specifies the operational requirements for a DES coprocessor to augment the hypercube's execution of DES simulations. The DES coprocessor design implements the functions necessary to perform distributed discrete event simulations using a conservative time synchronization protocol.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.

PubMed

Altarelli, Fabrizio; Braunstein, Alfredo; Dall'Asta, Luca; De Bacco, Caterina; Franz, Silvio

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length.

The Edge-Disjoint Path Problem on Random Graphs by Message-Passing

PubMed Central

2015-01-01

We present a message-passing algorithm to solve a series of edge-disjoint path problems on graphs based on the zero-temperature cavity equations. Edge-disjoint paths problems are important in the general context of routing, that can be defined by incorporating under a unique framework both traffic optimization and total path length minimization. The computation of the cavity equations can be performed efficiently by exploiting a mapping of a generalized edge-disjoint path problem on a star graph onto a weighted maximum matching problem. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behavior of both the number of paths to be accommodated and their minimum total length. PMID:26710102

A sessional blind signature based on quantum cryptography

NASA Astrophysics Data System (ADS)

Khodambashi, Siavash; Zakerolhosseini, Ali

2014-01-01

In this paper, we present a sessional blind signature protocol whose security is guaranteed by fundamental principles of quantum physics. It allows a message owner to get his message signed by an authorized signatory. However, the signatory is not capable of reading the message contents and everyone can verify authenticity of the message. For this purpose, we took advantage of a sessional signature as well as quantum entangled pairs which are generated with respect to it in our proposed protocol. We describe our proposed blind signature through an example and briefly discuss about its unconditional security. Due to the feasibility of the protocol, it can be widely employed for e-payment, e-government, e-business and etc.

A Modern Operating System for Near-real-time Environmental Observatories

NASA Astrophysics Data System (ADS)

Orcutt, John; Vernon, Frank

2014-05-01

The NSF Ocean Observatory Initiative (OOI) provided an opportunity for expanding the capabilities for managing open, near-real-time (latencies of seconds) data from ocean observatories. The sensors deployed in this system largely return data from seafloor, cabled fiber optic cables as well as satellite telemetry. Bandwidth demands range from high-definition movies to the transmission of data via Iridium satellite. The extended Internet also provides an opportunity to not only return data, but to also control the sensors and platforms that comprise the observatory. The data themselves are openly available to any users. In order to provide heightened network security and overall reliability, the connections to and from the sensors/platforms are managed without Layer 3 of the Internet, but instead rely upon message passing using an open protocol termed Advanced Queuing Messaging Protocol (AMQP). The highest bandwidths in the system are in the Regional Scale Network (RSN) off Oregon and Washington and on the continent with highly reliable network connections between observatory components at 10 Gbps. The maintenance of metadata and life cycle histories of sensors and platforms is critical for providing data provenance over the years. The integrated cyberinfrastructure is best thought of as an operating system for the observatory - like the data, the software is also open and can be readily applied to new observatories, for example, in the rapidly evolving Arctic.

High-Dimensional Circular Quantum Secret Sharing Using Orbital Angular Momentum

NASA Astrophysics Data System (ADS)

Tang, Dawei; Wang, Tie-jun; Mi, Sichen; Geng, Xiao-Meng; Wang, Chuan

2016-11-01

Quantum secret sharing is to distribute secret message securely between multi-parties. Here exploiting orbital angular momentum (OAM) state of single photons as the information carrier, we propose a high-dimensional circular quantum secret sharing protocol which increases the channel capacity largely. In the proposed protocol, the secret message is split into two parts, and each encoded on the OAM state of single photons. The security of the protocol is guaranteed by the laws of non-cloning theorem. And the secret messages could not be recovered except that the two receivers collaborated with each other. Moreover, the proposed protocol could be extended into high-level quantum systems, and the enhanced security could be achieved.

TeleHealth networks: Instant messaging and point-to-point communication over the internet

NASA Astrophysics Data System (ADS)

Sachpazidis, Ilias; Ohl, Roland; Kontaxakis, George; Sakas, Georgios

2006-12-01

This paper explores the advantages and disadvantages of a medical network based on point-to-point communication and a medical network based on Jabber instant messaging protocol. Instant messaging might be, for many people, a convenient way of chatting over the Internet. We will attempt to illustrate how an instant messaging protocol could serve in the best way medical services and provide great flexibility to the involved parts. Additionally, the directory services and presence status offered by the Jabber protocol make it very attractive to medical applications that need to have real time and store and forward communication. Furthermore, doctors connected to Internet via high-speed networks could benefit by saving time due to the data transmission acceleration over Jabber.

Public-channel cryptography based on mutual chaos pass filters.

PubMed

Klein, Einat; Gross, Noam; Kopelowitz, Evi; Rosenbluh, Michael; Khaykovich, Lev; Kinzel, Wolfgang; Kanter, Ido

2006-10-01

We study the mutual coupling of chaotic lasers and observe both experimentally and in numeric simulations that there exists a regime of parameters for which two mutually coupled chaotic lasers establish isochronal synchronization, while a third laser coupled unidirectionally to one of the pair does not synchronize. We then propose a cryptographic scheme, based on the advantage of mutual coupling over unidirectional coupling, where all the parameters of the system are public knowledge. We numerically demonstrate that in such a scheme the two communicating lasers can add a message signal (compressed binary message) to the transmitted coupling signal and recover the message in both directions with high fidelity by using a mutual chaos pass filter procedure. An attacker, however, fails to recover an errorless message even if he amplifies the coupling signal.

Scalable Multicast Protocols for Overlapped Groups in Broker-Based Sensor Networks

NASA Astrophysics Data System (ADS)

Kim, Chayoung; Ahn, Jinho

In sensor networks, there are lots of overlapped multicast groups because of many subscribers, associated with their potentially varying specific interests, querying every event to sensors/publishers. And gossip based communication protocols are promising as one of potential solutions providing scalability in P(Publish)/ S(Subscribe) paradigm in sensor networks. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped multicast groups in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present two versions of causally ordered delivery guaranteeing protocols for overlapped multicast groups. The one is based on sensor-broker as delegates and the other is based on local views and delegates representing subscriber subgroups. In the sensor-broker based protocol, sensor-broker might lead to make overlapped multicast networks organized by subscriber's interests. The message delivery order has been guaranteed consistently and all multicast messages are delivered to overlapped subscribers using gossip based protocols by sensor-broker. Therefore, these features of the sensor-broker based protocol might be significantly scalable rather than those of the protocols by hierarchical membership list of dedicated groups like traditional committee protocols. And the subscriber-delegate based protocol is much stronger rather than fully decentralized protocols guaranteeing causally ordered delivery based on only local views because the message delivery order has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, this feature of the subscriber-delegate protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.

An implementation and performance measurement of the progressive retry technique

NASA Technical Reports Server (NTRS)

Suri, Gaurav; Huang, Yennun; Wang, Yi-Min; Fuchs, W. Kent; Kintala, Chandra

1995-01-01

This paper describes a recovery technique called progressive retry for bypassing software faults in message-passing applications. The technique is implemented as reusable modules to provide application-level software fault tolerance. The paper describes the implementation of the technique and presents results from the application of progressive retry to two telecommunications systems. the results presented show that the technique is helpful in reducing the total recovery time for message-passing applications.

Belief propagation decoding of quantum channels by passing quantum messages

NASA Astrophysics Data System (ADS)

Renes, Joseph M.

2017-07-01

The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.

LCAMP: Location Constrained Approximate Message Passing for Compressed Sensing MRI

PubMed Central

Sung, Kyunghyun; Daniel, Bruce L; Hargreaves, Brian A

2016-01-01

Iterative thresholding methods have been extensively studied as faster alternatives to convex optimization methods for solving large-sized problems in compressed sensing. A novel iterative thresholding method called LCAMP (Location Constrained Approximate Message Passing) is presented for reducing computational complexity and improving reconstruction accuracy when a nonzero location (or sparse support) constraint can be obtained from view shared images. LCAMP modifies the existing approximate message passing algorithm by replacing the thresholding stage with a location constraint, which avoids adjusting regularization parameters or thresholding levels. This work is first compared with other conventional reconstruction methods using random 1D signals and then applied to dynamic contrast-enhanced breast MRI to demonstrate the excellent reconstruction accuracy (less than 2% absolute difference) and low computation time (5 - 10 seconds using Matlab) with highly undersampled 3D data (244 × 128 × 48; overall reduction factor = 10). PMID:23042658

Efficient Tracing for On-the-Fly Space-Time Displays in a Debugger for Message Passing Programs

NASA Technical Reports Server (NTRS)

Hood, Robert; Matthews, Gregory

2001-01-01

In this work we describe the implementation of a practical mechanism for collecting and displaying trace information in a debugger for message passing programs. We introduce a trace format that is highly compressible while still providing information adequate for debugging purposes. We make the mechanism convenient for users to access by incorporating the trace collection in a set of wrappers for the MPI (message passing interface) communication library. We implement several debugger operations that use the trace display: consistent stoplines, undo, and rollback. They all are implemented using controlled replay, which executes at full speed in target processes until the appropriate position in the computation is reached. They provide convenient mechanisms for getting to places in the execution where the full power of a state-based debugger can be brought to bear on isolating communication errors.

Design of a network for concurrent message passing systems

NASA Astrophysics Data System (ADS)

Song, Paul Y.

1988-08-01

We describe the design of the network design frame (NDF), a self-timed routing chip for a message-passing concurrent computer. The NDF uses a partitioned data path, low-voltage output drivers, and a distributed token-passing arbiter to provide a bandwidth of 450 Mbits/sec into the network. Wormhole routing and bidirectional virtual channels are used to provide low latency communications, less than 2us latency to deliver a 216 bit message across the diameter of a 1K node mess-connected machine. To support concurrent software systems, the NDF provides two logical networks, one for user messages and one for system messages. The two networks share the same set of physical wires. To facilitate the development of network nodes, the NDF is a design frame. The NDF circuitry is integrated into the pad frame of a chip leaving the center of the chip uncommitted. We define an analytic framework in which to study the effects of network size, network buffering capacity, bidirectional channels, and traffic on this class of networks. The response of the network to various combinations of these parameters are obtained through extensive simulation of the network model. Through simulation, we are able to observe the macro behavior of the network as opposed to the micro behavior of the NDF routing controller.

Performance Analysis of the Mobile IP Protocol (RFC 3344 and Related RFCS)

DTIC Science & Technology

2006-12-01

Encapsulation HMAC Keyed-Hash Message Authentication Code ICMP Internet Control Message Protocol IEEE Institute of Electrical and Electronics Engineers IETF...Internet Engineering Task Force IOS Internetwork Operating System IP Internet Protocol ITU International Telecommunication Union LAN Local Area...network computing. Most organizations today have sophisticated networks that are connected to the Internet. The major benefit reaped from such a

Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol

NASA Astrophysics Data System (ADS)

Wei, Chun-Yan; Gao, Fei; Wen, Qiao-Yan; Wang, Tian-Yin

2014-12-01

Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each ai contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary.

Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol

PubMed Central

Wei, Chun-Yan; Gao, Fei; Wen, Qiao-Yan; Wang, Tian-Yin

2014-01-01

Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each ai contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary. PMID:25518810

47 CFR 11.51 - EAS code and Attention Signal Transmission requirements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... Message (EOM) codes using the EAS Protocol. The Attention Signal must precede any emergency audio message... audio messages. No Attention Signal is required for EAS messages that do not contain audio programming... EAS messages in the main audio channel. All DAB stations shall also transmit EAS messages on all audio...

47 CFR 11.51 - EAS code and Attention Signal Transmission requirements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... Message (EOM) codes using the EAS Protocol. The Attention Signal must precede any emergency audio message... audio messages. No Attention Signal is required for EAS messages that do not contain audio programming... EAS messages in the main audio channel. All DAB stations shall also transmit EAS messages on all audio...

47 CFR 11.51 - EAS code and Attention Signal Transmission requirements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... Message (EOM) codes using the EAS Protocol. The Attention Signal must precede any emergency audio message... audio messages. No Attention Signal is required for EAS messages that do not contain audio programming... EAS messages in the main audio channel. All DAB stations shall also transmit EAS messages on all audio...

Lessons learned on the design and the conduct of Post-Authorization Safety Studies: review of 3 years of PRAC oversight.

PubMed

Engel, Pierre; Almas, Mariana Ferreira; De Bruin, Marieke Louise; Starzyk, Kathryn; Blackburn, Stella; Dreyer, Nancy Ann

2017-04-01

To describe and characterize the first cohort of Post-Authorization Safety Study (PASS) protocols reviewed under the recent European pharmacovigilance legislation. A systematic approach was used to compile all publicly available information on PASS protocols and assessments submitted from July 2012 to July 2015 from Pharmacovigilance Risk Assessment Committee (PRAC) minutes, European Medicines Agency (EMA) and European Network of Pharmacovigilance and Pharmacoepidemiology (ENCePP) webpages. During the study period, 189 different PASS protocols were submitted to the PRAC, half of which were entered in the ENCePP electronic register of post-authorization studies (EU-PAS) by July 2015. Those protocols were assessed during 353 PRAC reviews. The EMA published only 31% of the PRAC feedback, of which the main concerns were study design (37%) and feasibility (30%). Among the 189 PASS, slightly more involved primary data capture (58%). PASS assessing drug utilization mainly leveraged secondary data sources (58%). The majority of the PASS did not include a comparator (65%) and 35% of PASS also evaluated clinical effectiveness endpoints. To the best of our knowledge this is the first comprehensive review of three years of PASS protocols submitted under the new pharmacovigilance legislation. Our results show that both EMA and PASS sponsors could respectively increase the availability of protocol assessments and documents in the EU-PAS. Protocol content review and the high number of PRAC comments related to methodological issues and feasibility concerns should raise awareness among PASS stakeholders to design more thoughtful studies according to pharmacoepidemiological principles and existing guidelines. © 2016 The British Pharmacological Society.

HYDRA : High-speed simulation architecture for precision spacecraft formation simulation

NASA Technical Reports Server (NTRS)

Martin, Bryan J.; Sohl, Garett.

2003-01-01

e Hierarchical Distributed Reconfigurable Architecture- is a scalable simulation architecture that provides flexibility and ease-of-use which take advantage of modern computation and communication hardware. It also provides the ability to implement distributed - or workstation - based simulations and high-fidelity real-time simulation from a common core. Originally designed to serve as a research platform for examining fundamental challenges in formation flying simulation for future space missions, it is also finding use in other missions and applications, all of which can take advantage of the underlying Object-Oriented structure to easily produce distributed simulations. Hydra automates the process of connecting disparate simulation components (Hydra Clients) through a client server architecture that uses high-level descriptions of data associated with each client to find and forge desirable connections (Hydra Services) at run time. Services communicate through the use of Connectors, which abstract messaging to provide single-interface access to any desired communication protocol, such as from shared-memory message passing to TCP/IP to ACE and COBRA. Hydra shares many features with the HLA, although providing more flexibility in connectivity services and behavior overriding.

[Series: Medical Applications of the PHITS Code (2): Acceleration by Parallel Computing].

PubMed

Furuta, Takuya; Sato, Tatsuhiko

2015-01-01

Time-consuming Monte Carlo dose calculation becomes feasible owing to the development of computer technology. However, the recent development is due to emergence of the multi-core high performance computers. Therefore, parallel computing becomes a key to achieve good performance of software programs. A Monte Carlo simulation code PHITS contains two parallel computing functions, the distributed-memory parallelization using protocols of message passing interface (MPI) and the shared-memory parallelization using open multi-processing (OpenMP) directives. Users can choose the two functions according to their needs. This paper gives the explanation of the two functions with their advantages and disadvantages. Some test applications are also provided to show their performance using a typical multi-core high performance workstation.

Flood predictions using the parallel version of distributed numerical physical rainfall-runoff model TOPKAPI

NASA Astrophysics Data System (ADS)

Boyko, Oleksiy; Zheleznyak, Mark

2015-04-01

The original numerical code TOPKAPI-IMMS of the distributed rainfall-runoff model TOPKAPI ( Todini et al, 1996-2014) is developed and implemented in Ukraine. The parallel version of the code has been developed recently to be used on multiprocessors systems - multicore/processors PC and clusters. Algorithm is based on binary-tree decomposition of the watershed for the balancing of the amount of computation for all processors/cores. Message passing interface (MPI) protocol is used as a parallel computing framework. The numerical efficiency of the parallelization algorithms is demonstrated for the case studies for the flood predictions of the mountain watersheds of the Ukrainian Carpathian regions. The modeling results is compared with the predictions based on the lumped parameters models.

SBML-PET-MPI: a parallel parameter estimation tool for Systems Biology Markup Language based models.

PubMed

Zi, Zhike

2011-04-01

Parameter estimation is crucial for the modeling and dynamic analysis of biological systems. However, implementing parameter estimation is time consuming and computationally demanding. Here, we introduced a parallel parameter estimation tool for Systems Biology Markup Language (SBML)-based models (SBML-PET-MPI). SBML-PET-MPI allows the user to perform parameter estimation and parameter uncertainty analysis by collectively fitting multiple experimental datasets. The tool is developed and parallelized using the message passing interface (MPI) protocol, which provides good scalability with the number of processors. SBML-PET-MPI is freely available for non-commercial use at http://www.bioss.uni-freiburg.de/cms/sbml-pet-mpi.html or http://sites.google.com/site/sbmlpetmpi/.

Improving UDP/IP Transmission Without Increasing Congestion

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2006-01-01

Datagram Retransmission (DGR) is a computer program that, within certain limits, ensures the reception of each datagram transmitted under the User Datagram Protocol/Internet Protocol. [User Datagram Protocol (UDP) is considered unreliable because it does not involve a reliability-ensuring connection-initiation dialogue between sender and receiver. UDP is well suited to issuing of many small messages to many different receivers.] Unlike prior software for ensuring reception of UDP datagrams, DGR does not contribute to network congestion by retransmitting data more frequently as an ever-increasing number of messages and acknowledgements is lost. Instead, DGR does just the opposite: DGR includes an adaptive timeout-interval- computing component that provides maximum opportunity for reception of acknowledgements, minimizing retransmission. By monitoring changes in the rate at which message-transmission transactions are completed, DGR detects changes in the level of congestion and responds by imposing varying degrees of delay on the transmission of new messages. In addition, DGR maximizes throughput by not waiting for acknowledgement of a message before sending the next message. All DGR communication is asynchronous, to maximize efficient utilization of network connections. DGR manages multiple concurrent datagram transmission and acknowledgement conversations.

Detection and Correction of Silent Data Corruption for Large-Scale High-Performance Computing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fiala, David J; Mueller, Frank; Engelmann, Christian

Faults have become the norm rather than the exception for high-end computing on clusters with 10s/100s of thousands of cores. Exacerbating this situation, some of these faults remain undetected, manifesting themselves as silent errors that corrupt memory while applications continue to operate and report incorrect results. This paper studies the potential for redundancy to both detect and correct soft errors in MPI message-passing applications. Our study investigates the challenges inherent to detecting soft errors within MPI application while providing transparent MPI redundancy. By assuming a model wherein corruption in application data manifests itself by producing differing MPI message data betweenmore » replicas, we study the best suited protocols for detecting and correcting MPI data that is the result of corruption. To experimentally validate our proposed detection and correction protocols, we introduce RedMPI, an MPI library which resides in the MPI profiling layer. RedMPI is capable of both online detection and correction of soft errors that occur in MPI applications without requiring any modifications to the application source by utilizing either double or triple redundancy. Our results indicate that our most efficient consistency protocol can successfully protect applications experiencing even high rates of silent data corruption with runtime overheads between 0% and 30% as compared to unprotected applications without redundancy. Using our fault injector within RedMPI, we observe that even a single soft error can have profound effects on running applications, causing a cascading pattern of corruption in most cases causes that spreads to all other processes. RedMPI's protection has been shown to successfully mitigate the effects of soft errors while allowing applications to complete with correct results even in the face of errors.« less

Porting Gravitational Wave Signal Extraction to Parallel Virtual Machine (PVM)

NASA Technical Reports Server (NTRS)

Thirumalainambi, Rajkumar; Thompson, David E.; Redmon, Jeffery

2009-01-01

Laser Interferometer Space Antenna (LISA) is a planned NASA-ESA mission to be launched around 2012. The Gravitational Wave detection is fundamentally the determination of frequency, source parameters, and waveform amplitude derived in a specific order from the interferometric time-series of the rotating LISA spacecrafts. The LISA Science Team has developed a Mock LISA Data Challenge intended to promote the testing of complicated nested search algorithms to detect the 100-1 millihertz frequency signals at amplitudes of 10E-21. However, it has become clear that, sequential search of the parameters is very time consuming and ultra-sensitive; hence, a new strategy has been developed. Parallelization of existing sequential search algorithms of Gravitational Wave signal identification consists of decomposing sequential search loops, beginning with outermost loops and working inward. In this process, the main challenge is to detect interdependencies among loops and partitioning the loops so as to preserve concurrency. Existing parallel programs are based upon either shared memory or distributed memory paradigms. In PVM, master and node programs are used to execute parallelization and process spawning. The PVM can handle process management and process addressing schemes using a virtual machine configuration. The task scheduling and the messaging and signaling can be implemented efficiently for the LISA Gravitational Wave search process using a master and 6 nodes. This approach is accomplished using a server that is available at NASA Ames Research Center, and has been dedicated to the LISA Data Challenge Competition. Historically, gravitational wave and source identification parameters have taken around 7 days in this dedicated single thread Linux based server. Using PVM approach, the parameter extraction problem can be reduced to within a day. The low frequency computation and a proxy signal-to-noise ratio are calculated in separate nodes that are controlled by the master using message and vector of data passing. The message passing among nodes follows a pattern of synchronous and asynchronous send-and-receive protocols. The communication model and the message buffers are allocated dynamically to address rapid search of gravitational wave source information in the Mock LISA data sets.

The graphical brain: Belief propagation and active inference

PubMed Central

Friston, Karl J.; Parr, Thomas; de Vries, Bert

2018-01-01

This paper considers functional integration in the brain from a computational perspective. We ask what sort of neuronal message passing is mandated by active inference—and what implications this has for context-sensitive connectivity at microscopic and macroscopic levels. In particular, we formulate neuronal processing as belief propagation under deep generative models. Crucially, these models can entertain both discrete and continuous states, leading to distinct schemes for belief updating that play out on the same (neuronal) architecture. Technically, we use Forney (normal) factor graphs to elucidate the requisite message passing in terms of its form and scheduling. To accommodate mixed generative models (of discrete and continuous states), one also has to consider link nodes or factors that enable discrete and continuous representations to talk to each other. When mapping the implicit computational architecture onto neuronal connectivity, several interesting features emerge. For example, Bayesian model averaging and comparison, which link discrete and continuous states, may be implemented in thalamocortical loops. These and other considerations speak to a computational connectome that is inherently state dependent and self-organizing in ways that yield to a principled (variational) account. We conclude with simulations of reading that illustrate the implicit neuronal message passing, with a special focus on how discrete (semantic) representations inform, and are informed by, continuous (visual) sampling of the sensorium. Author Summary This paper considers functional integration in the brain from a computational perspective. We ask what sort of neuronal message passing is mandated by active inference—and what implications this has for context-sensitive connectivity at microscopic and macroscopic levels. In particular, we formulate neuronal processing as belief propagation under deep generative models that can entertain both discrete and continuous states. This leads to distinct schemes for belief updating that play out on the same (neuronal) architecture. Technically, we use Forney (normal) factor graphs to characterize the requisite message passing, and link this formal characterization to canonical microcircuits and extrinsic connectivity in the brain. PMID:29417960

Toward Synthesis, Analysis, and Certification of Security Protocols

NASA Technical Reports Server (NTRS)

Schumann, Johann

2004-01-01

Implemented security protocols are basically pieces of software which are used to (a) authenticate the other communication partners, (b) establish a secure communication channel between them (using insecure communication media), and (c) transfer data between the communication partners in such a way that these data only available to the desired receiver, but not to anyone else. Such an implementation usually consists of the following components: the protocol-engine, which controls in which sequence the messages of the protocol are sent over the network, and which controls the assembly/disassembly and processing (e.g., decryption) of the data. the cryptographic routines to actually encrypt or decrypt the data (using given keys), and t,he interface to the operating system and to the application. For a correct working of such a security protocol, all of these components must work flawlessly. Many formal-methods based techniques for the analysis of a security protocols have been developed. They range from using specific logics (e.g.: BAN-logic [4], or higher order logics [12] to model checking [2] approaches. In each approach, the analysis tries to prove that no (or at least not a modeled intruder) can get access to secret data. Otherwise, a scenario illustrating the &tack may be produced. Despite the seeming simplicity of security protocols ("only" a few messages are sent between the protocol partners in order to ensure a secure communication), many flaws have been detected. Unfortunately, even a perfect protocol engine does not guarantee flawless working of a security protocol, as incidents show. Many break-ins and security vulnerabilities are caused by exploiting errors in the implementation of the protocol engine or the underlying operating system. Attacks using buffer-overflows are a very common class of such attacks. Errors in the implementation of exception or error handling can open up additional vulnerabilities. For example, on a website with a log-in screen: multiple tries with invalid passwords caused the expected error message (too many retries). but let the user nevertheless pass. Finally, security can be compromised by silly implementation bugs or design decisions. In a commercial VPN software, all calls to the encryption routines were incidentally replaced by stubs, probably during factory testing. The product worked nicely. and the error (an open VPN) would have gone undetected, if a team member had not inspected the low-level traffic out of curiosity. Also, the use secret proprietary encryption routines can backfire, because such algorithms often exhibit weaknesses which can be exploited easily (see e.g., DVD encoding). Summarizing, there is large number of possibilities to make errors which can compromise the security of a protocol. In today s world with short time-to-market and the use of security protocols in open and hostile networks for safety-critical applications (e.g., power or air-traffic control), such slips could lead to catastrophic situations. Thus, formal methods and automatic reasoning techniques should not be used just for the formal proof of absence of an attack, but they ought to be used to provide an end-to-end tool-supported framework for security software. With such an approach all required artifacts (code, documentation, test cases) , formal analyses, and reliable certification will be generated automatically, given a single, high level specification. By a combination of program synthesis, formal protocol analysis, certification; and proof-carrying code, this goal is within practical reach, since all the important technologies for such an approach actually exist and only need to be assembled in the right way.

An Efficient Two-Tier Causal Protocol for Mobile Distributed Systems

PubMed Central

Dominguez, Eduardo Lopez; Pomares Hernandez, Saul E.; Gomez, Gustavo Rodriguez; Medina, Maria Auxilio

2013-01-01

Causal ordering is a useful tool for mobile distributed systems (MDS) to reduce the non-determinism induced by three main aspects: host mobility, asynchronous execution, and unpredictable communication delays. Several causal protocols for MDS exist. Most of them, in order to reduce the overhead and the computational cost over wireless channels and mobile hosts (MH), ensure causal ordering at and according to the causal view of the Base Stations. Nevertheless, these protocols introduce certain disadvantage, such as unnecessary inhibition at the delivery of messages. In this paper, we present an efficient causal protocol for groupware that satisfies the MDS's constraints, avoiding unnecessary inhibitions and ensuring the causal delivery based on the view of the MHs. One interesting aspect of our protocol is that it dynamically adapts the causal information attached to each message based on the number of messages with immediate dependency relation, and this is not directly proportional to the number of MHs. PMID:23585828

CSlib, a library to couple codes via Client/Server messaging

DOE Office of Scientific and Technical Information (OSTI.GOV)

Plimpton, Steve

The CSlib is a small, portable library which enables two (or more) independent simulation codes to be coupled, by exchanging messages with each other. Both codes link to the library when they are built, and can them communicate with each other as they run. The messages contain data or instructions that the two codes send back-and-forth to each other. The messaging can take place via files, sockets, or MPI. The latter is a standard distributed-memory message-passing library.

Controlled quantum secure communication protocol with single photons in both polarization and spatial-mode degrees of freedom

NASA Astrophysics Data System (ADS)

Wang, Lili; Ma, Wenping

2016-02-01

In this paper, we propose a new controlled quantum secure direct communication (CQSDC) protocol with single photons in both polarization and spatial-mode degrees of freedom. Based on the defined local collective unitary operations, the sender’s secret messages can be transmitted directly to the receiver through encoding secret messages on the particles. Only with the help of the third side, the receiver can reconstruct the secret messages. Each single photon in two degrees of freedom can carry two bits of information, so the cost of our protocol is less than others using entangled qubits. Moreover, the security of our QSDC network protocol is discussed comprehensively. It is shown that our new CQSDC protocol cannot only defend the outsider eavesdroppers’ several sorts of attacks but also the inside attacks. Besides, our protocol is feasible since the preparation and the measurement of single photon quantum states in both the polarization and the spatial-mode degrees of freedom are available with current quantum techniques.

Design and Implementation of an Operations Module for the ARGOS paperless Ship System

DTIC Science & Technology

1989-06-01

A. OPERATIONS STACK SCRIPTS SCRIPTS FOR STACK: operations * BACKGROUND #1: Operations * on openStack hide message box show menuBar pass openStack end... openStack ** CARD #1, BUTTON #1: Up ***** on mouseUp visual effect zoom out go to card id 10931 of stack argos end mouseUp ** CARD #1, BUTTON #2...STACK SCRIPTS SCRIPTS FOR STACK: Reports ** BACKGROUND #1: Operations * on openStack hie message box show menuBar pass openStack end openStack ** CARD #1

Experiences Using OpenMP Based on Compiler Directed Software DSM on a PC Cluster

NASA Technical Reports Server (NTRS)

Hess, Matthias; Jost, Gabriele; Mueller, Matthias; Ruehle, Roland; Biegel, Bryan (Technical Monitor)

2002-01-01

In this work we report on our experiences running OpenMP (message passing) programs on a commodity cluster of PCs (personal computers) running a software distributed shared memory (DSM) system. We describe our test environment and report on the performance of a subset of the NAS (NASA Advanced Supercomputing) Parallel Benchmarks that have been automatically parallelized for OpenMP. We compare the performance of the OpenMP implementations with that of their message passing counterparts and discuss performance differences.

Charon Message-Passing Toolkit for Scientific Computations

NASA Technical Reports Server (NTRS)

VanderWijngaart, Rob F.; Yan, Jerry (Technical Monitor)

2000-01-01

Charon is a library, callable from C and Fortran, that aids the conversion of structured-grid legacy codes-such as those used in the numerical computation of fluid flows-into parallel, high- performance codes. Key are functions that define distributed arrays, that map between distributed and non-distributed arrays, and that allow easy specification of common communications on structured grids. The library is based on the widely accepted MPI message passing standard. We present an overview of the functionality of Charon, and some representative results.

A carrier sensed multiple access protocol for high data base rate ring networks

NASA Technical Reports Server (NTRS)

Foudriat, E. C.; Maly, Kurt J.; Overstreet, C. Michael; Khanna, S.; Paterra, Frank

1990-01-01

The results of the study of a simple but effective media access protocol for high data rate networks are presented. The protocol is based on the fact that at high data rates networks can contain multiple messages simultaneously over their span, and that in a ring, nodes used to detect the presence of a message arriving from the immediate upstream neighbor. When an incoming signal is detected, the node must either abort or truncate a message it is presently sending. Thus, the protocol with local carrier sensing and multiple access is designated CSMA/RN. The performance of CSMA/RN with TTattempt and truncate is studied using analytic and simulation models. Three performance factors, wait or access time, service time and response or end-to-end travel time are presented. The service time is basically a function of the network rate, it changes by a factor of 1 between no load and full load. Wait time, which is zero for no load, remains small for load factors up to 70 percent of full load. Response time, which adds travel time while on the network to wait and service time, is mainly a function of network length, especially for longer distance networks. Simulation results are shown for CSMA/RN where messages are removed at the destination. A wide range of local and metropolitan area network parameters including variations in message size, network length, and node count are studied. Finally, a scaling factor based upon the ratio of message to network length demonstrates that the results, and hence, the CSMA/RN protocol, are applicable to wide area networks.

Couriers in the Inca Empire: Getting Your Message Across. [Lesson Plan].

ERIC Educational Resources Information Center

2002

This lesson shows how the Inca communicated across the vast stretches of their mountain realm, the largest empire of the pre-industrial world. The lesson explains how couriers carried messages along mountain-ridge roads, up and down stone steps, and over chasm-spanning footbridges. It states that couriers could pass a message from Quito (Ecuador)…

Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol.

PubMed

Wei, Chun-Yan; Gao, Fei; Wen, Qiao-Yan; Wang, Tian-Yin

2014-12-18

Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message a1a2···al from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each a(i) contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary.

Inference in the brain: Statistics flowing in redundant population codes

PubMed Central

Pitkow, Xaq; Angelaki, Dora E

2017-01-01

It is widely believed that the brain performs approximate probabilistic inference to estimate causal variables in the world from ambiguous sensory data. To understand these computations, we need to analyze how information is represented and transformed by the actions of nonlinear recurrent neural networks. We propose that these probabilistic computations function by a message-passing algorithm operating at the level of redundant neural populations. To explain this framework, we review its underlying concepts, including graphical models, sufficient statistics, and message-passing, and then describe how these concepts could be implemented by recurrently connected probabilistic population codes. The relevant information flow in these networks will be most interpretable at the population level, particularly for redundant neural codes. We therefore outline a general approach to identify the essential features of a neural message-passing algorithm. Finally, we argue that to reveal the most important aspects of these neural computations, we must study large-scale activity patterns during moderately complex, naturalistic behaviors. PMID:28595050

Critical field-exponents for secure message-passing in modular networks

NASA Astrophysics Data System (ADS)

Shekhtman, Louis M.; Danziger, Michael M.; Bonamassa, Ivan; Buldyrev, Sergey V.; Caldarelli, Guido; Zlatić, Vinko; Havlin, Shlomo

2018-05-01

We study secure message-passing in the presence of multiple adversaries in modular networks. We assume a dominant fraction of nodes in each module have the same vulnerability, i.e., the same entity spying on them. We find both analytically and via simulations that the links between the modules (interlinks) have effects analogous to a magnetic field in a spin-system in that for any amount of interlinks the system no longer undergoes a phase transition. We then define the exponents δ, which relates the order parameter (the size of the giant secure component) at the critical point to the field strength (average number of interlinks per node), and γ, which describes the susceptibility near criticality. These are found to be δ = 2 and γ = 1 (with the scaling of the order parameter near the critical point given by β = 1). When two or more vulnerabilities are equally present in a module we find δ = 1 and γ = 0 (with β ≥ 2). Apart from defining a previously unidentified universality class, these exponents show that increasing connections between modules is more beneficial for security than increasing connections within modules. We also measure the correlation critical exponent ν, and the upper critical dimension d c , finding that ν {d}c=3 as for ordinary percolation, suggesting that for secure message-passing d c = 6. These results provide an interesting analogy between secure message-passing in modular networks and the physics of magnetic spin-systems.

Usage of the hybrid encryption in a cloud instant messages exchange system

NASA Astrophysics Data System (ADS)

Kvyetnyy, Roman N.; Romanyuk, Olexander N.; Titarchuk, Evgenii O.; Gromaszek, Konrad; Mussabekov, Nazarbek

2016-09-01

A new approach for constructing cloud instant messaging represented in this article allows users to encrypt data locally by using Diffie - Hellman key exchange protocol. The described approach allows to construct a cloud service which operates only by users encrypted messages; encryption and decryption takes place locally at the user party using a symmetric AES encryption. A feature of the service is the conferences support without the need for messages reecryption for each participant. In the article it is given an example of the protocol implementation on the ECC and RSA encryption algorithms basis, as well as a comparison of these implementations.

Efficiency and security problems of anonymous key agreement protocol based on chaotic maps

NASA Astrophysics Data System (ADS)

Yoon, Eun-Jun

2012-07-01

In 2011, Niu-Wang proposed an anonymous key agreement protocol based on chaotic maps in [Niu Y, Wang X. An anonymous key agreement protocol based on chaotic maps. Commun Nonlinear Sci Simulat 2011;16(4):1986-92]. Niu-Wang's protocol not only achieves session key agreement between a server and a user, but also allows the user to anonymously interact with the server. Nevertheless, this paper points out that Niu-Wang's protocol has the following efficiency and security problems: (1) The protocol has computational efficiency problem when a trusted third party decrypts the user sending message. (2) The protocol is vulnerable to Denial of Service (DoS) attack based on illegal message modification by an attacker.

MPI_XSTAR: MPI-based Parallelization of the XSTAR Photoionization Program

NASA Astrophysics Data System (ADS)

Danehkar, Ashkbiz; Nowak, Michael A.; Lee, Julia C.; Smith, Randall K.

2018-02-01

We describe a program for the parallel implementation of multiple runs of XSTAR, a photoionization code that is used to predict the physical properties of an ionized gas from its emission and/or absorption lines. The parallelization program, called MPI_XSTAR, has been developed and implemented in the C++ language by using the Message Passing Interface (MPI) protocol, a conventional standard of parallel computing. We have benchmarked parallel multiprocessing executions of XSTAR, using MPI_XSTAR, against a serial execution of XSTAR, in terms of the parallelization speedup and the computing resource efficiency. Our experience indicates that the parallel execution runs significantly faster than the serial execution, however, the efficiency in terms of the computing resource usage decreases with increasing the number of processors used in the parallel computing.

Gene-network inference by message passing

NASA Astrophysics Data System (ADS)

Braunstein, A.; Pagnani, A.; Weigt, M.; Zecchina, R.

2008-01-01

The inference of gene-regulatory processes from gene-expression data belongs to the major challenges of computational systems biology. Here we address the problem from a statistical-physics perspective and develop a message-passing algorithm which is able to infer sparse, directed and combinatorial regulatory mechanisms. Using the replica technique, the algorithmic performance can be characterized analytically for artificially generated data. The algorithm is applied to genome-wide expression data of baker's yeast under various environmental conditions. We find clear cases of combinatorial control, and enrichment in common functional annotations of regulated genes and their regulators.

Optimal mapping of neural-network learning on message-passing multicomputers

NASA Technical Reports Server (NTRS)

Chu, Lon-Chan; Wah, Benjamin W.

1992-01-01

A minimization of learning-algorithm completion time is sought in the present optimal-mapping study of the learning process in multilayer feed-forward artificial neural networks (ANNs) for message-passing multicomputers. A novel approximation algorithm for mappings of this kind is derived from observations of the dominance of a parallel ANN algorithm over its communication time. Attention is given to both static and dynamic mapping schemes for systems with static and dynamic background workloads, as well as to experimental results obtained for simulated mappings on multicomputers with dynamic background workloads.

Trace-Driven Debugging of Message Passing Programs

NASA Technical Reports Server (NTRS)

Frumkin, Michael; Hood, Robert; Lopez, Louis; Bailey, David (Technical Monitor)

1998-01-01

In this paper we report on features added to a parallel debugger to simplify the debugging of parallel message passing programs. These features include replay, setting consistent breakpoints based on interprocess event causality, a parallel undo operation, and communication supervision. These features all use trace information collected during the execution of the program being debugged. We used a number of different instrumentation techniques to collect traces. We also implemented trace displays using two different trace visualization systems. The implementation was tested on an SGI Power Challenge cluster and a network of SGI workstations.

Quantum counterfactual communication without a weak trace

NASA Astrophysics Data System (ADS)

Arvidsson-Shukur, D. R. M.; Barnes, C. H. W.

2016-12-01

The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message "counterfactually"; that is, without Alice receiving any particles that have interacted with Bob. By utilizing a setup built on results from interaction-free measurements, we outline a communication protocol whereby the information travels in the opposite direction of the emitted particles. In comparison to previous attempts on such protocols, this one is such that a weak measurement at the message source would not leave a weak trace that could be detected by Alice's receiver. While some interaction-free schemes require a large number of carefully aligned beam splitters, our protocol is realizable with two or more beam splitters. We demonstrate this protocol by numerically solving the time-dependent Schrödinger equation for a Hamiltonian that implements this quantum counterfactual phenomenon.

In quantum direct communication an undetectable eavesdropper can always tell Ψ from Φ Bell states in the message mode

NASA Astrophysics Data System (ADS)

Pavičić, Mladen

2013-04-01

We show that in any quantum direct communication protocol that is based on Ψ and Φ Bell states, an eavesdropper can always tell Ψ from Φ states without altering the transmission in any way in the message mode. This renders all protocols that make use of only one Ψ state and one Φ state completely insecure in the message mode. All four-Bell-state protocols require a revision and this might be of importance for new implementations of entanglement-based cryptographic protocols. The detection rate of an eavesdropper is 25% per control transmission, i.e., a half of the rate in the two-state (ping-pong) protocol. An eavesdropper can detect control probes with certainty in the standard control transmission without a photon in the Alice-to-Bob's travel mode and with near certainty in a transmission with a fake photon in the travel mode. Resending of measured control photons via the travel mode would make an eavesdropper completely invisible.

Gauge-free cluster variational method by maximal messages and moment matching.

PubMed

Domínguez, Eduardo; Lage-Castellanos, Alejandro; Mulet, Roberto; Ricci-Tersenghi, Federico

2017-04-01

We present an implementation of the cluster variational method (CVM) as a message passing algorithm. The kind of message passing algorithm used for CVM, usually named generalized belief propagation (GBP), is a generalization of the belief propagation algorithm in the same way that CVM is a generalization of the Bethe approximation for estimating the partition function. However, the connection between fixed points of GBP and the extremal points of the CVM free energy is usually not a one-to-one correspondence because of the existence of a gauge transformation involving the GBP messages. Our contribution is twofold. First, we propose a way of defining messages (fields) in a generic CVM approximation, such that messages arrive on a given region from all its ancestors, and not only from its direct parents, as in the standard parent-to-child GBP. We call this approach maximal messages. Second, we focus on the case of binary variables, reinterpreting the messages as fields enforcing the consistency between the moments of the local (marginal) probability distributions. We provide a precise rule to enforce all consistencies, avoiding any redundancy, that would otherwise lead to a gauge transformation on the messages. This moment matching method is gauge free, i.e., it guarantees that the resulting GBP is not gauge invariant. We apply our maximal messages and moment matching GBP to obtain an analytical expression for the critical temperature of the Ising model in general dimensions at the level of plaquette CVM. The values obtained outperform Bethe estimates, and are comparable with loop corrected belief propagation equations. The method allows for a straightforward generalization to disordered systems.

Gauge-free cluster variational method by maximal messages and moment matching

NASA Astrophysics Data System (ADS)

Domínguez, Eduardo; Lage-Castellanos, Alejandro; Mulet, Roberto; Ricci-Tersenghi, Federico

2017-04-01

We present an implementation of the cluster variational method (CVM) as a message passing algorithm. The kind of message passing algorithm used for CVM, usually named generalized belief propagation (GBP), is a generalization of the belief propagation algorithm in the same way that CVM is a generalization of the Bethe approximation for estimating the partition function. However, the connection between fixed points of GBP and the extremal points of the CVM free energy is usually not a one-to-one correspondence because of the existence of a gauge transformation involving the GBP messages. Our contribution is twofold. First, we propose a way of defining messages (fields) in a generic CVM approximation, such that messages arrive on a given region from all its ancestors, and not only from its direct parents, as in the standard parent-to-child GBP. We call this approach maximal messages. Second, we focus on the case of binary variables, reinterpreting the messages as fields enforcing the consistency between the moments of the local (marginal) probability distributions. We provide a precise rule to enforce all consistencies, avoiding any redundancy, that would otherwise lead to a gauge transformation on the messages. This moment matching method is gauge free, i.e., it guarantees that the resulting GBP is not gauge invariant. We apply our maximal messages and moment matching GBP to obtain an analytical expression for the critical temperature of the Ising model in general dimensions at the level of plaquette CVM. The values obtained outperform Bethe estimates, and are comparable with loop corrected belief propagation equations. The method allows for a straightforward generalization to disordered systems.

Multiple node remote messaging

DOEpatents

Blumrich, Matthias A.; Chen, Dong; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Ohmacht, Martin; Salapura, Valentina; Steinmacher-Burow, Burkhard; Vranas, Pavlos

2010-08-31

A method for passing remote messages in a parallel computer system formed as a network of interconnected compute nodes includes that a first compute node (A) sends a single remote message to a remote second compute node (B) in order to control the remote second compute node (B) to send at least one remote message. The method includes various steps including controlling a DMA engine at first compute node (A) to prepare the single remote message to include a first message descriptor and at least one remote message descriptor for controlling the remote second compute node (B) to send at least one remote message, including putting the first message descriptor into an injection FIFO at the first compute node (A) and sending the single remote message and the at least one remote message descriptor to the second compute node (B).

Advanced information processing system: Authentication protocols for network communication

NASA Technical Reports Server (NTRS)

Harper, Richard E.; Adams, Stuart J.; Babikyan, Carol A.; Butler, Bryan P.; Clark, Anne L.; Lala, Jaynarayan H.

1994-01-01

In safety critical I/O and intercomputer communication networks, reliable message transmission is an important concern. Difficulties of communication and fault identification in networks arise primarily because the sender of a transmission cannot be identified with certainty, an intermediate node can corrupt a message without certainty of detection, and a babbling node cannot be identified and silenced without lengthy diagnosis and reconfiguration . Authentication protocols use digital signature techniques to verify the authenticity of messages with high probability. Such protocols appear to provide an efficient solution to many of these problems. The objective of this program is to develop, demonstrate, and evaluate intercomputer communication architectures which employ authentication. As a context for the evaluation, the authentication protocol-based communication concept was demonstrated under this program by hosting a real-time flight critical guidance, navigation and control algorithm on a distributed, heterogeneous, mixed redundancy system of workstations and embedded fault-tolerant computers.

Deterministic secure quantum communication using a single d-level system.

PubMed

Jiang, Dong; Chen, Yuanyuan; Gu, Xuemei; Xie, Ling; Chen, Lijun

2017-03-22

Deterministic secure quantum communication (DSQC) can transmit secret messages between two parties without first generating a shared secret key. Compared with quantum key distribution (QKD), DSQC avoids the waste of qubits arising from basis reconciliation and thus reaches higher efficiency. In this paper, based on data block transmission and order rearrangement technologies, we propose a DSQC protocol. It utilizes a set of single d-level systems as message carriers, which are used to directly encode the secret message in one communication process. Theoretical analysis shows that these employed technologies guarantee the security, and the use of a higher dimensional quantum system makes our protocol achieve higher security and efficiency. Since only quantum memory is required for implementation, our protocol is feasible with current technologies. Furthermore, Trojan horse attack (THA) is taken into account in our protocol. We give a THA model and show that THA significantly increases the multi-photon rate and can thus be detected.

Privacy-Preserving RFID Authentication Using Public Exponent Three RSA Algorithm

NASA Astrophysics Data System (ADS)

Kim, Yoonjeong; Ohm, Seongyong; Yi, Kang

In this letter, we propose a privacy-preserving authentication protocol with RSA cryptosystem in an RFID environment. For both overcoming the resource restriction and strengthening security, our protocol uses only modular exponentiation with exponent three at RFID tag side, with the padded random message whose length is greater than one-sixth of the whole message length.

Extended Password Recovery Attacks against APOP, SIP, and Digest Authentication

NASA Astrophysics Data System (ADS)

Sasaki, Yu; Wang, Lei; Ohta, Kazuo; Kunihiro, Noboru

In this paper, we propose password recovery attacks against challenge-response authentication protocols. Our attacks use a message difference for a MD5 collision attack proposed in IEICE 2008. First, we show how to efficiently find a message pair that collides with the above message difference. Second, we show that a password used in authenticated post office protocol (APOP) can be recovered practically. We also show that the password recovery attack can be applied to a session initiation protocol (SIP) and digest authentication. Our attack can recover up to the first 31 password characters in a short time and up to the first 60 characters faster than the naive search method. We have implemented our attack and confirmed that 31 characters can be successfully recovered.

Research Supporting Satellite Communications Technology

NASA Technical Reports Server (NTRS)

Horan Stephen; Lyman, Raphael

2005-01-01

This report describes the second year of research effort under the grant Research Supporting Satellite Communications Technology. The research program consists of two major projects: Fault Tolerant Link Establishment and the design of an Auto-Configurable Receiver. The Fault Tolerant Link Establishment protocol is being developed to assist the designers of satellite clusters to manage the inter-satellite communications. During this second year, the basic protocol design was validated with an extensive testing program. After this testing was completed, a channel error model was added to the protocol to permit the effects of channel errors to be measured. This error generation was used to test the effects of channel errors on Heartbeat and Token message passing. The C-language source code for the protocol modules was delivered to Goddard Space Flight Center for integration with the GSFC testbed. The need for a receiver autoconfiguration capability arises when a satellite-to-ground transmission is interrupted due to an unexpected event, the satellite transponder may reset to an unknown state and begin transmitting in a new mode. During Year 2, we completed testing of these algorithms when noise-induced bit errors were introduced. We also developed and tested an algorithm for estimating the data rate, assuming an NRZ-formatted signal corrupted with additive white Gaussian noise, and we took initial steps in integrating both algorithms into the SDR test bed at GSFC.

High speed polling protocol for multiple node network with sequential flooding of a polling message and a poll-answering message

NASA Technical Reports Server (NTRS)

Marvit, Maclen (Inventor); Kirkham, Harold (Inventor)

1995-01-01

The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs a remote node polling process performed by a master node by transmitting a polling message generically addressed to all remote nodes associated with the master node. Each remote node responds upon receipt of the generically addressed polling message by sequentially flooding the network with a poll-answering informational message and with the polling message.

AMS -- The Unix ADAM Message System

NASA Astrophysics Data System (ADS)

Kelly, B. D.; Chipperfield, A. J.

The ADAM Message System (AMS) library, which implements the ADAM inter-task communications protocol under Unix, is described, along with its Fortran-callable interface (FAMS). The description of AMS is distinguished from the current implementation which uses the Message System Primitives (MSP).

A native Bayesian classifier based routing protocol for VANETS

NASA Astrophysics Data System (ADS)

Bao, Zhenshan; Zhou, Keqin; Zhang, Wenbo; Gong, Xiaolei

2016-12-01

Geographic routing protocols are one of the most hot research areas in VANET (Vehicular Ad-hoc Network). However, there are few routing protocols can take both the transmission efficient and the usage of ratio into account. As we have noticed, different messages in VANET may ask different quality of service. So we raised a Native Bayesian Classifier based routing protocol (Naive Bayesian Classifier-Greedy, NBC-Greedy), which can classify and transmit different messages by its emergency degree. As a result, we can balance the transmission efficient and the usage of ratio with this protocol. Based on Matlab simulation, we can draw a conclusion that NBC-Greedy is more efficient and stable than LR-Greedy and GPSR.

Ordering Traces Logically to Identify Lateness in Message Passing Programs

DOE PAGES

Isaacs, Katherine E.; Gamblin, Todd; Bhatele, Abhinav; ...

2015-03-30

Event traces are valuable for understanding the behavior of parallel programs. However, automatically analyzing a large parallel trace is difficult, especially without a specific objective. We aid this endeavor by extracting a trace's logical structure, an ordering of trace events derived from happened-before relationships, while taking into account developer intent. Using this structure, we can calculate an operation's delay relative to its peers on other processes. The logical structure also serves as a platform for comparing and clustering processes as well as highlighting communication patterns in a trace visualization. We present an algorithm for determining this idealized logical structure frommore » traces of message passing programs, and we develop metrics to quantify delays and differences among processes. We implement our techniques in Ravel, a parallel trace visualization tool that displays both logical and physical timelines. Rather than showing the duration of each operation, we display where delays begin and end, and how they propagate. As a result, we apply our approach to the traces of several message passing applications, demonstrating the accuracy of our extracted structure and its utility in analyzing these codes.« less

Dust Dynamics in Protoplanetary Disks: Parallel Computing with PVM

NASA Astrophysics Data System (ADS)

de La Fuente Marcos, Carlos; Barge, Pierre; de La Fuente Marcos, Raúl

2002-03-01

We describe a parallel version of our high-order-accuracy particle-mesh code for the simulation of collisionless protoplanetary disks. We use this code to carry out a massively parallel, two-dimensional, time-dependent, numerical simulation, which includes dust particles, to study the potential role of large-scale, gaseous vortices in protoplanetary disks. This noncollisional problem is easy to parallelize on message-passing multicomputer architectures. We performed the simulations on a cache-coherent nonuniform memory access Origin 2000 machine, using both the parallel virtual machine (PVM) and message-passing interface (MPI) message-passing libraries. Our performance analysis suggests that, for our problem, PVM is about 25% faster than MPI. Using PVM and MPI made it possible to reduce CPU time and increase code performance. This allows for simulations with a large number of particles (N ~ 105-106) in reasonable CPU times. The performances of our implementation of the pa! rallel code on an Origin 2000 supercomputer are presented and discussed. They exhibit very good speedup behavior and low load unbalancing. Our results confirm that giant gaseous vortices can play a dominant role in giant planet formation.

Asynchronous Messaging and Data Transfer in a Spacecraft: An Implementation

NASA Technical Reports Server (NTRS)

Moholt, Joseph M.

2005-01-01

Data transfer and messaging is an important part of a spacecraft. Creating a standard protocol for messaging that can be used for a variety of applications is an extremely beneficial project at the Jet Propulsion Laboratory (JPL). The Asynchronous Messaging Service (AMS) is a protocol outlining how subsystems initialize and conduct communication between each other. There are currently two implementations of AMS in the works. At JPL, my task is to get a working implementation of AMS onto vxWorks as a proof of concept. An Autocoder, a program used to convert visually created state chart diagrams to C++, has also been created to accomplish a part of the implementation. I was assigned to make the program portable on any Unix type environment. Lastly, I was to develop a program to demonstrate messaging between two FireWire cards running vxworks.

TravelAid : in-vehicle signing and variable speed limit evaluation

DOT National Transportation Integrated Search

2001-12-01

This report discusses the effectiveness of using variable message signs (VMSs) and in-vehicle traffic advisory systems (IVUs) on a mountainous pass (Snoqualmie Pass on Interstate 90 in Washington State) for changing driver behavior. As part of this p...

Remote Asynchronous Message Service Gateway

NASA Technical Reports Server (NTRS)

Wang, Shin-Ywan; Burleigh, Scott C.

2011-01-01

The Remote Asynchronous Message Service (RAMS) gateway is a special-purpose AMS application node that enables exchange of AMS messages between nodes residing in different AMS "continua," notionally in different geographical locations. JPL s implementation of RAMS gateway functionality is integrated with the ION (Interplanetary Overlay Network) implementation of the DTN (Delay-Tolerant Networking) bundle protocol, and with JPL s implementation of AMS itself. RAMS protocol data units are encapsulated in ION bundles and are forwarded to the neighboring RAMS gateways identified in the source gateway s AMS management information base. Each RAMS gateway has interfaces in two communication environments: the AMS message space it serves, and the RAMS network - the grid or tree of mutually aware RAMS gateways - that enables AMS messages produced in one message space to be forwarded to other message spaces of the same venture. Each gateway opens persistent, private RAMS network communication channels to the RAMS gateways of other message spaces for the same venture, in other continua. The interconnected RAMS gateways use these communication channels to forward message petition assertions and cancellations among themselves. Each RAMS gateway subscribes locally to all subjects that are of interest in any of the linked message spaces. On receiving its copy of a message on any of these subjects, the RAMS gateway node uses the RAMS network to forward the message to every other RAMS gateway whose message space contains at least one node that has subscribed to messages on that subject. On receiving a message via the RAMS network from some other RAMS gateway, the RAMS gateway node forwards the message to all subscribers in its own message space.

Cacades: A reliable dissemination protocol for data collection sensor network

USGS Publications Warehouse

Peng, Y.; Song, W.; Huang, R.; Xu, M.; Shirazi, B.; LaHusen, R.; Pei, G.

2009-01-01

In this paper, we propose a fast and reliable data dissemination protocol Cascades to disseminate data from the sink(base station) to all or a subset of nodes in a data collection sensor network. Cascades makes use of the parentmonitor-children analogy to ensure reliable dissemination. Each node monitors whether or not its children have received the broadcast messages through snooping children's rebroadcasts or waiting for explicit ACKs. If a node detects a gap in its message sequences, it can fetch the missing messages from its neighbours reactively. Cascades also considers many practical issues for field deployment, such as dynamic topology, link/node failure, etc.. It therefore guarantees that a disseminated message from the sink will reach all intended receivers and the dissemination is terminated in a short time period. Notice that, all existing dissemination protocols either do not guarantee reliability or do not terminate [1, 2], which does not meet the requirement of real-time command control. We conducted experiment evaluations in both TOSSIM simulator and a sensor network testbed to compare Cascades with those existing dissemination protocols in TinyOS sensor networks, which show that Cascades achieves a higher degree of reliability, lower communication cost, and less delivery delay. ??2009 IEEE.

Texting for Health: The Use of Participatory Methods to Develop Healthy Lifestyle Messages for Teens

ERIC Educational Resources Information Center

Hingle, Melanie; Nichter, Mimi; Medeiros, Melanie; Grace, Samantha

2013-01-01

Objective: To develop and test messages and a mobile phone delivery protocol designed to influence the nutrition and physical activity knowledge, attitudes, and behavior of adolescents. Design: Nine focus groups, 4 classroom discussions, and an 8-week pilot study exploring message content, format, origin, and message delivery were conducted over…

High speed polling protocol for multiple node network

NASA Technical Reports Server (NTRS)

Kirkham, Harold (Inventor)

1995-01-01

The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs a remote node polling process performed by a master node by transmitting a polling message generically addressed to all remote nodes associated with the master node. Each remote node responds upon receipt of the generically addressed polling message by transmitting a poll-answering informational message and by relaying the polling message to other adjacent remote nodes.

A real-time MPEG software decoder using a portable message-passing library

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kwong, Man Kam; Tang, P.T. Peter; Lin, Biquan

1995-12-31

We present a real-time MPEG software decoder that uses message-passing libraries such as MPL, p4 and MPI. The parallel MPEG decoder currently runs on the IBM SP system but can be easil ported to other parallel machines. This paper discusses our parallel MPEG decoding algorithm as well as the parallel programming environment under which it uses. Several technical issues are discussed, including balancing of decoding speed, memory limitation, 1/0 capacities, and optimization of MPEG decoding components. This project shows that a real-time portable software MPEG decoder is feasible in a general-purpose parallel machine.

Complexity of parallel implementation of domain decomposition techniques for elliptic partial differential equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gropp, W.D.; Keyes, D.E.

1988-03-01

The authors discuss the parallel implementation of preconditioned conjugate gradient (PCG)-based domain decomposition techniques for self-adjoint elliptic partial differential equations in two dimensions on several architectures. The complexity of these methods is described on a variety of message-passing parallel computers as a function of the size of the problem, number of processors and relative communication speeds of the processors. They show that communication startups are very important, and that even the small amount of global communication in these methods can significantly reduce the performance of many message-passing architectures.

n-body simulations using message passing parallel computers.

NASA Astrophysics Data System (ADS)

Grama, A. Y.; Kumar, V.; Sameh, A.

The authors present new parallel formulations of the Barnes-Hut method for n-body simulations on message passing computers. These parallel formulations partition the domain efficiently incurring minimal communication overhead. This is in contrast to existing schemes that are based on sorting a large number of keys or on the use of global data structures. The new formulations are augmented by alternate communication strategies which serve to minimize communication overhead. The impact of these communication strategies is experimentally studied. The authors report on experimental results obtained from an astrophysical simulation on an nCUBE2 parallel computer.

A decentralized software bus based on IP multicas ting

NASA Technical Reports Server (NTRS)

Callahan, John R.; Montgomery, Todd

1995-01-01

We describe decentralized reconfigurable implementation of a conference management system based on the low-level Internet Protocol (IP) multicasting protocol. IP multicasting allows low-cost, world-wide, two-way transmission of data between large numbers of conferencing participants through the Multicasting Backbone (MBone). Each conference is structured as a software bus -- a messaging system that provides a run-time interconnection model that acts as a separate agent (i.e., the bus) for routing, queuing, and delivering messages between distributed programs. Unlike the client-server interconnection model, the software bus model provides a level of indirection that enhances the flexibility and reconfigurability of a distributed system. Current software bus implementations like POLYLITH, however, rely on a centralized bus process and point-to-point protocols (i.e., TCP/IP) to route, queue, and deliver messages. We implement a software bus called the MULTIBUS that relies on a separate process only for routing and uses a reliable IP multicasting protocol for delivery of messages. The use of multicasting means that interconnections are independent of IP machine addresses. This approach allows reconfiguration of bus participants during system execution without notifying other participants of new IP addresses. The use of IP multicasting also permits an economy of scale in the number of participants. We describe the MULITIBUS protocol elements and show how our implementation performs better than centralized bus implementations.

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks

PubMed Central

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole. PMID:28121992

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.

PubMed

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

The covert channel over HTTP protocol

NASA Astrophysics Data System (ADS)

Graniszewski, Waldemar; Krupski, Jacek; Szczypiorski, Krzysztof

2016-09-01

The paper presents a new steganographic method - the covert channel is created over HTTP protocol header, i.e. trailer field. HTTP protocol is one of the most frequently used in the Internet. The popularity of the Web servers and network traffic from, and to them, is one of the requirements for undetectable message exchange. To study this kind of the information hiding technique an application in Javascript language based on the Node.js framework was written. The results of the experiment that was performed to send a message in the covert channel are also presented.

Fault-Tolerant Self-Stabilizing Distributed Clock Synchronization Protocol for Arbitrary Digraphs

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R. (Inventor)

2014-01-01

A self-stabilizing network in the form of an arbitrary, non-partitioned digraph includes K nodes having a synchronizer executing a protocol. K-1 monitors of each node may receive a Sync message transmitted from a directly connected node. When the Sync message is received, the logical clock value for the receiving node is set to between 0 and a communication latency value (gamma) if the clock value is less than a minimum event-response delay (D). A new Sync message is also transmitted to any directly connected nodes if the clock value is greater than or equal to both D and a graph threshold (T(sub S)). When the Sync message is not received the synchronizer increments the clock value if the clock value is less than a resynchronization period (P), and resets the clock value and transmits a new Sync message to all directly connected nodes when the clock value equals or exceeds P.

SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks

NASA Astrophysics Data System (ADS)

Li, Celia; Wang, Zhuang; Yang, Cungang

In this paper, we propose a Security Enhanced AODV routing protocol (SEAODV) for wireless mesh networks (WMN). SEAODV employs Blom's key pre-distribution scheme to compute the pairwise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK authenticate unicast and broadcast routing messages respectively. In WMN, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbours. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message's authenticity and integrity in a hop-by-hop fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency.

DoD Message Protocol Report. Volume I. Message Protocol Specification.

DTIC Science & Technology

1981-12-15

26L 2.6 STATUS-REPORTING SERVICES ........................................ 26 2.6.1 Acknowledgements and Processing Status...and data. Envelopes give processing instructions and/or descriptions of their contents. Data are not altered (as regards content) by the CBMS except...tailored to an individual user’s requirements, we view them as application-layer processes . The potential diversity of UAs makes verifi- cation difficult

Multiparty Quantum English Auction Scheme Using Single Photons as Message Carrier

NASA Astrophysics Data System (ADS)

Liu, Ge; Zhang, Jian-Zhong; Xie, Shu-Cui

2018-03-01

In this paper, a secure and economic multiparty english auction protocol using the single photons as message carrier of bids is proposed. In order to achieve unconditional security, fairness, undeniability and so on, we adopt the decoy photon checking technique and quantum encryption algorithm. Analysis result shows that our protocol satisfies all the characteristics of traditional english auction, meanwhile, it can resist malicious attacks.

Telemetry Standards, RCC Standard 106-17. Chapter 26. TmNSDataMessage Transfer Protocol

DTIC Science & Technology

2017-07-01

Channel (RTSPDataChannel) ............................................ 26-13 26.4.3 Reliability Critical (RC) Delivery Protocol...error status code specified in RFC 2326 for "Request-URI Too Large" is 虮". 26.4.1.5 Request Types RTSPDataSources shall return valid ...to the following requirements. • Valid TmNSDataMessages shall be delivered containing the original Packages matching the requested

A Message Exchange Protocol in Command and Control Systems Integration, using the JC3IEDM

DTIC Science & Technology

2014-06-01

19TH International Command and Control Research and Technology Symposium C2 Agility: Lessons Learned from Research and Operations. A Message...distribution unlimited 13. SUPPLEMENTARY NOTES Presented at the 18th International Command & Control Research & Technology Symposium (ICCRTS) held 16...presents approaches of integration, compares their technologies , points out their advantages, proposes requirements, and provides the design of a protocol

Asynchronous Message Service Reference Implementation

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

This software provides a library of middleware functions with a simple application programming interface, enabling implementation of distributed applications in conformance with the CCSDS AMS (Consultative Committee for Space Data Systems Asynchronous Message Service) specification. The AMS service, and its protocols, implement an architectural concept under which the modules of mission systems may be designed as if they were to operate in isolation, each one producing and consuming mission information without explicit awareness of which other modules are currently operating. Communication relationships among such modules are self-configuring; this tends to minimize complexity in the development and operations of modular data systems. A system built on this model is a society of generally autonomous, inter-operating modules that may fluctuate freely over time in response to changing mission objectives, modules functional upgrades, and recovery from individual module failure. The purpose of AMS, then, is to reduce mission cost and risk by providing standard, reusable infrastructure for the exchange of information among data system modules in a manner that is simple to use, highly automated, flexible, robust, scalable, and efficient. The implementation is designed to spawn multiple threads of AMS functionality under the control of an AMS application program. These threads enable all members of an AMS-based, distributed application to discover one another in real time, subscribe to messages on specific topics, and to publish messages on specific topics. The query/reply (client/server) communication model is also supported. Message exchange is optionally subject to encryption (to support confidentiality) and authorization. Fault tolerance measures in the discovery protocol minimize the likelihood of overall application failure due to any single operational error anywhere in the system. The multi-threaded design simplifies processing while enabling application nodes to operate at high speeds; linked lists protected by mutex semaphores and condition variables are used for efficient, inter-thread communication. Applications may use a variety of transport protocols underlying AMS itself, including TCP (Transmission Control Protocol), UDP (User Datagram Protocol), and message queues.

Deterministic secure quantum communication using a single d-level system

PubMed Central

Jiang, Dong; Chen, Yuanyuan; Gu, Xuemei; Xie, Ling; Chen, Lijun

2017-01-01

Deterministic secure quantum communication (DSQC) can transmit secret messages between two parties without first generating a shared secret key. Compared with quantum key distribution (QKD), DSQC avoids the waste of qubits arising from basis reconciliation and thus reaches higher efficiency. In this paper, based on data block transmission and order rearrangement technologies, we propose a DSQC protocol. It utilizes a set of single d-level systems as message carriers, which are used to directly encode the secret message in one communication process. Theoretical analysis shows that these employed technologies guarantee the security, and the use of a higher dimensional quantum system makes our protocol achieve higher security and efficiency. Since only quantum memory is required for implementation, our protocol is feasible with current technologies. Furthermore, Trojan horse attack (THA) is taken into account in our protocol. We give a THA model and show that THA significantly increases the multi-photon rate and can thus be detected. PMID:28327557

Families of quantum fingerprinting protocols

NASA Astrophysics Data System (ADS)

Lovitz, Benjamin; Lütkenhaus, Norbert

2018-03-01

We introduce several families of quantum fingerprinting protocols to evaluate the equality function on two n -bit strings in the simultaneous message passing model. The original quantum fingerprinting protocol uses a tensor product of a small number of O (logn ) -qubit high-dimensional signals [H. Buhrman et al., Phys. Rev. Lett. 87, 167902 (2001), 10.1103/PhysRevLett.87.167902], whereas a recently proposed optical protocol uses a tensor product of O (n ) single-qubit signals, while maintaining the O (logn ) information leakage of the original protocol [J. M. Arazola and N. Lütkenhaus, Phys. Rev. A 89, 062305 (2014), 10.1103/PhysRevA.89.062305]. We find a family of protocols which interpolate between the original and optical protocols while maintaining the O (logn ) information leakage, thus demonstrating a tradeoff between the number of signals sent and the dimension of each signal. There has been interest in experimental realization of the recently proposed optical protocol using coherent states [F. Xu et al., Nat. Commun. 6, 8735 (2015), 10.1038/ncomms9735; J.-Y. Guan et al., Phys. Rev. Lett. 116, 240502 (2016), 10.1103/PhysRevLett.116.240502], but as the required number of laser pulses grows linearly with the input size n , eventual challenges for the long-time stability of experimental setups arise. We find a coherent state protocol which reduces the number of signals by a factor 1/2 while also reducing the information leakage. Our reduction makes use of a simple modulation scheme in optical phase space, and we find that more complex modulation schemes are not advantageous. Using a similar technique, we improve a recently proposed coherent state protocol for evaluating the Euclidean distance between two real unit vectors [N. Kumar et al., Phys. Rev. A 95, 032337 (2017), 10.1103/PhysRevA.95.032337] by reducing the number of signals by a factor 1/2 and also reducing the information leakage.

Fair and optimistic quantum contract signing

NASA Astrophysics Data System (ADS)

Paunković, N.; Bouda, J.; Mateus, P.

2011-12-01

We present a fair and optimistic quantum-contract-signing protocol between two clients that requires no communication with the third trusted party during the exchange phase. We discuss its fairness and show that it is possible to design such a protocol for which the probability of a dishonest client to cheat becomes negligible and scales as N-1/2, where N is the number of messages exchanged between the clients. Our protocol is not based on the exchange of signed messages: Its fairness is based on the laws of quantum mechanics. Thus, it is abuse free, and the clients do not have to generate new keys for each message during the exchange phase. We discuss a real-life scenario when measurement errors and qubit-state corruption due to noisy channels and imperfect quantum memories occur and argue that for a real, good-enough measurement apparatus, transmission channels, and quantum memories, our protocol would still be fair. Apart from stable quantum memories, the other segments of our protocol could be implemented by today's technology, as they require in essence the same type of apparatus as the one needed for the Bennett-Brassard 1984 (BB84) cryptographic protocol. Finally, we briefly discuss two alternative versions of the protocol, one that uses only two states [based on the Bennett 1992 (B92) protocol] and the other that uses entangled pairs, and show that it is possible to generalize our protocol to an arbitrary number of clients.

Controlled Secure Direct Communication with Seven-Qubit Entangled States

NASA Astrophysics Data System (ADS)

Wang, Shu-Kai; Zha, Xin-Wei; Wu, Hao

2018-01-01

In this paper, a new controlled secure direct communication protocol based on a maximally seven-qubit entangled state is proposed. the outcomes of measurement is performed by the sender and the controller, the receiver can obtain different secret messages in a deterministic way with unit successful probability.In this scheme,by using entanglement swapping, no qubits carrying secret messages are transmitted.Therefore, the protocol is completely secure.

Relations Among Central Auditory Abilities, Socio-Economic Factors, Speech Delay, Phonic Abilities and Reading Achievement: A Longitudinal Study.

ERIC Educational Resources Information Center

Flowers, Arthur; Crandell, Edwin W.

Three auditory perceptual processes (resistance to distortion, selective listening in the form of auditory dedifferentiation, and binaural synthesis) were evaluated by five assessment techniques: (1) low pass filtered speech, (2) accelerated speech, (3) competing messages, (4) accelerated plus competing messages, and (5) binaural synthesis.…

Quantum cluster variational method and message passing algorithms revisited

NASA Astrophysics Data System (ADS)

Domínguez, E.; Mulet, Roberto

2018-02-01

We present a general framework to study quantum disordered systems in the context of the Kikuchi's cluster variational method (CVM). The method relies in the solution of message passing-like equations for single instances or in the iterative solution of complex population dynamic algorithms for an average case scenario. We first show how a standard application of the Kikuchi's CVM can be easily translated to message passing equations for specific instances of the disordered system. We then present an "ad hoc" extension of these equations to a population dynamic algorithm representing an average case scenario. At the Bethe level, these equations are equivalent to the dynamic population equations that can be derived from a proper cavity ansatz. However, at the plaquette approximation, the interpretation is more subtle and we discuss it taking also into account previous results in classical disordered models. Moreover, we develop a formalism to properly deal with the average case scenario using a replica-symmetric ansatz within this CVM for quantum disordered systems. Finally, we present and discuss numerical solutions of the different approximations for the quantum transverse Ising model and the quantum random field Ising model in two-dimensional lattices.

Vehicle Density Based Forwarding Protocol for Safety Message Broadcast in VANET

PubMed Central

Huang, Jiawei; Wang, Jianxin

2014-01-01

In vehicular ad hoc networks (VANETs), the medium access control (MAC) protocol is of great importance to provide time-critical safety applications. Contemporary multihop broadcast protocols in VANETs usually choose the farthest node in broadcast range as the forwarder to reduce the number of forwarding hops. However, in this paper, we demonstrate that the farthest forwarder may experience large contention delay in case of high vehicle density. We propose an IEEE 802.11-based multihop broadcast protocol VDF to address the issue of emergency message dissemination. To achieve the tradeoff between contention delay and forwarding hops, VDF adaptably chooses the forwarder according to the vehicle density. Simulation results show that, due to its ability to decrease the transmission collisions, the proposed protocol can provide significantly lower broadcast delay. PMID:25121125

Quantum Counterfactual Information Transmission Without a Weak Trace

NASA Astrophysics Data System (ADS)

Arvidsson Shukur, David; Barnes, Crispin

The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We have developed a quantum protocol that allows Alice to perceive Bob's message ``counterfactually''. That is, without Alice receiving any particles that have interacted with Bob. By utilising a setup built on results from interaction-free measurements and the quantum Zeno effect, we outline a communication protocol in which the information travels in the opposite direction of the emitted particles. In comparison to previous attempts on such protocols, this one is such that a weak measurement at the message source would not leave a weak trace that could be detected by Alice's receiver. Whilst some interaction-free schemes require a large number of carefully aligned beam-splitters, our protocol is realisable with two or more beam-splitters. Furthermore, we outline how Alice's obtained classical Fisher information between a weak variable at Bob's laboratory is negligible in our scheme. We demonstrate this protocol by numerically solving the time-dependent Schrödinger Equation (TDSE) for a Hamiltonian that implements this quantum counterfactual phenomenon.

Software Design Document MCC CSCI (1). Volume 1 Sections 1.0-2.18

DTIC Science & Technology

1991-06-01

AssociationUserProtocol /simnet/common!include/prot ____________________ ____________________ ocol/p assoc.h Primitive long Standard C type...Information. 2.2.1.4.2 ProcessMessage ProcessMessage processes a message from another process. type describes the message as either one-way, a synchronous or...Macintosh Consoles. This is sometimes necessary due to normal clock skew so that operations among the MCC components will remain synchronized . This

LOPP: A Location Privacy Protected Anonymous Routing Protocol for Disruption Tolerant Network

NASA Astrophysics Data System (ADS)

Lu, Xiaofeng; Hui, Pan; Towsley, Don; Pu, Juhua; Xiong, Zhang

In this paper, we propose an anonymous routing protocol, LOPP, to protect the originator's location privacy in Delay/Disruption Tolerant Network (DTN). The goals of our study are to minimize the originator's probability of being localized (Pl) and maximize the destination's probability of receiving the message (Pr). The idea of LOPP is to divide a sensitive message into k segments and send each of them to n different neighbors. Although message fragmentation could reduce the destination's probability to receive a complete message, LOPP can decrease the originator's Pl. We validate LOPP on a real-world human mobility dataset. The simulation results show that LOPP can decrease the originator's Pl by over 54% with only 5.7% decrease in destination's Pr. We address the physical localization issue of DTN, which was not studied in the literature.

Protocol for a thematic synthesis to identify key themes and messages from a palliative care research network.

PubMed

Nicholson, Emma; Murphy, Tara; Larkin, Philip; Normand, Charles; Guerin, Suzanne

2016-10-21

Research networks that facilitate collaborative research are increasing both regionally and globally and such collaborations contribute greatly to knowledge transfer particularly in health research. The Palliative Care Research Network is an Irish-based network that seeks to create opportunities and engender a collaborative environment to encourage innovative research that is relevant for policy and practice. The current review outlines a methodology to identify cross-cutting messages to identify how dissemination outputs can be optimized to ensure that key messages from this research reaches all knowledge users. Preferred reporting items for systematic review and meta-analysis protocol guidelines will inform the search and analysis plan to ensure that the synthesis of the data is as rigorous as possible. An approach based on critical interpretative synthesis will be adapted to include a thematic synthesis for the identification of higher-order themes and messages from a body of dissemination products generated by the Palliative Care Research Network. The thematic synthesis outlined in the present protocol offers a novel method of synthesising data from a focused research network that employs a variety of dissemination materials as a means of identifying key themes and messages from a specific body of research. The high-level themes and messages will be identified from the thematic synthesis, widely disseminated and targeted towards a range of stakeholders and knowledge users such as carers, health and social care professionals, policy makers and researchers.

Design Considerations in Developing a Text Messaging Program Aimed at Smoking Cessation

PubMed Central

Holtrop, Jodi Summers; Bağci Bosi, A Tülay; Emri, Salih

2012-01-01

Background Cell phone text messaging is gaining increasing recognition as an important tool that can be harnessed for prevention and intervention programs across a wide variety of health research applications. Despite the growing body of literature reporting positive outcomes, very little is available about the design decisions that scaffold the development of text messaging-based health interventions. What seems to be missing is documentation of the thought process of investigators in the initial stages of protocol and content development. This omission is of particular concern because many researchers seem to view text messaging as the intervention itself instead of simply a delivery mechanism. Certainly, aspects of this technology may increase participant engagement. Like other interventions, however, the content is a central driver of the behavior change. Objective To address this noted gap in the literature, we discuss the protocol decisions and content development for SMS Turkey (or Cebiniz birakin diyor in Turkish), a smoking cessation text messaging program for adult smokers in Turkey. Methods Content was developed in English and translated into Turkish. Efforts were made to ensure that the protocol and content were grounded in evidence-based smoking cessation theory, while also reflective of the cultural aspects of smoking and quitting in Turkey. Results Methodological considerations included whether to provide cell phones and whether to reimburse participants for texting costs; whether to include supplementary intervention resources (eg, personal contact); and whether to utilize unidirectional versus bidirectional messaging. Program design considerations included how messages were tailored to the quitting curve and one’s smoking status after one’s quit date, the number of messages participants received per day, and over what period of time the intervention lasted. Conclusion The content and methods of effective smoking cessation quitline programs were a useful guide in developing SMS Turkey. Proposed guidelines in developing text messaging-based behavior change programs are offered. PMID:22832182

Asbestos: Securing Untrusted Software with Interposition

DTIC Science & Technology

2005-09-01

consistent intelligible interfaces to different types of resource. Message-based operating systems, such as Accent, Amoeba, Chorus, L4 , Spring...control on self-authenticating capabilities, precluding policies that restrict delegation. L4 uses a strict hierarchy of interpositions, useful for...the OS de- sign space amenable to secure application construction. Similar effects might be possible with message-passing microkernels , or unwieldy

Ice-sheet modelling accelerated by graphics cards

NASA Astrophysics Data System (ADS)

Brædstrup, Christian Fredborg; Damsgaard, Anders; Egholm, David Lundbek

2014-11-01

Studies of glaciers and ice sheets have increased the demand for high performance numerical ice flow models over the past decades. When exploring the highly non-linear dynamics of fast flowing glaciers and ice streams, or when coupling multiple flow processes for ice, water, and sediment, researchers are often forced to use super-computing clusters. As an alternative to conventional high-performance computing hardware, the Graphical Processing Unit (GPU) is capable of massively parallel computing while retaining a compact design and low cost. In this study, we present a strategy for accelerating a higher-order ice flow model using a GPU. By applying the newest GPU hardware, we achieve up to 180× speedup compared to a similar but serial CPU implementation. Our results suggest that GPU acceleration is a competitive option for ice-flow modelling when compared to CPU-optimised algorithms parallelised by the OpenMP or Message Passing Interface (MPI) protocols.

Accelerating Climate and Weather Simulations through Hybrid Computing

NASA Technical Reports Server (NTRS)

Zhou, Shujia; Cruz, Carlos; Duffy, Daniel; Tucker, Robert; Purcell, Mark

2011-01-01

Unconventional multi- and many-core processors (e.g. IBM (R) Cell B.E.(TM) and NVIDIA (R) GPU) have emerged as effective accelerators in trial climate and weather simulations. Yet these climate and weather models typically run on parallel computers with conventional processors (e.g. Intel, AMD, and IBM) using Message Passing Interface. To address challenges involved in efficiently and easily connecting accelerators to parallel computers, we investigated using IBM's Dynamic Application Virtualization (TM) (IBM DAV) software in a prototype hybrid computing system with representative climate and weather model components. The hybrid system comprises two Intel blades and two IBM QS22 Cell B.E. blades, connected with both InfiniBand(R) (IB) and 1-Gigabit Ethernet. The system significantly accelerates a solar radiation model component by offloading compute-intensive calculations to the Cell blades. Systematic tests show that IBM DAV can seamlessly offload compute-intensive calculations from Intel blades to Cell B.E. blades in a scalable, load-balanced manner. However, noticeable communication overhead was observed, mainly due to IP over the IB protocol. Full utilization of IB Sockets Direct Protocol and the lower latency production version of IBM DAV will reduce this overhead.

Earth Observing System Data Gateway

NASA Technical Reports Server (NTRS)

Pfister, Robin; McMahon, Joe; Amrhein, James; Sefert, Ed; Marsans, Lorena; Solomon, Mark; Nestler, Mark

2006-01-01

The Earth Observing System Data Gateway (EDG) software provides a "one-stop-shopping" standard interface for exploring and ordering Earth-science data stored at geographically distributed sites. EDG enables a user to do the following: 1) Search for data according to high-level criteria (e.g., geographic location, time, or satellite that acquired the data); 2) Browse the results of a search, viewing thumbnail sketches of data that satisfy the user s criteria; and 3) Order selected data for delivery to a specified address on a chosen medium (e.g., compact disk or magnetic tape). EDG consists of (1) a component that implements a high-level client/server protocol, and (2) a collection of C-language libraries that implement the passing of protocol messages between an EDG client and one or more EDG servers. EDG servers are located at sites usually called "Distributed Active Archive Centers" (DAACs). Each DAAC may allow access to many individual data items, called "granules" (e.g., single Landsat images). Related granules are grouped into collections called "data sets." EDG enables a user to send a search query to multiple DAACs simultaneously, inspect the resulting information, select browseable granules, and then order selected data from the different sites in a seamless fashion.

Energy star compliant voice over internet protocol (VoIP) telecommunications network including energy star compliant VoIP devices

DOEpatents

Kouchri, Farrokh Mohammadzadeh

2012-11-06

A Voice over Internet Protocol (VoIP) communications system, a method of managing a communications network in such a system and a program product therefore. The system/network includes an ENERGY STAR (E-star) aware softswitch and E-star compliant communications devices at system endpoints. The E-star aware softswitch allows E-star compliant communications devices to enter and remain in power saving mode. The E-star aware softswitch spools messages and forwards only selected messages (e.g., calls) to the devices in power saving mode. When the E-star compliant communications devices exit power saving mode, the E-star aware softswitch forwards spooled messages.

Managing Emergency Situations in VANET Through Heterogeneous Technologies Cooperation.

PubMed

Santamaria, Amilcare Francesco; Tropea, Mauro; Fazio, Peppino; De Rango, Floriano

2018-05-08

Nowadays, the research on vehicular computing enhanced a very huge amount of services and protocols, aimed to vehicles security and comfort. The investigation of the IEEE802.11p, Wireless Access in Vehicular Environments (WAVE) and Dedicated Short Range Communication (DSRC) standards gave to the scientific world the chance to integrate new services, protocols, algorithms and devices inside vehicles. This opportunity attracted the attention of private/public organizations, which spent lot of resources and money to promote vehicular technologies. In this paper, the attention is focused on the design of a new approach for vehicular environments able to gather information during mobile node trips, for advising dangerous or emergency situations by exploiting on-board sensors. It is assumed that each vehicle has an integrated on-board unit composed of several sensors and Global Position System (GPS) device, able to spread alerting messages around the network, regarding warning and dangerous situations/conditions. On-board units, based on the standard communication protocols, share the collected information with the surrounding road-side units, while the sensing platform is able to recognize the environment that vehicles are passing through (obstacles, accidents, emergencies, dangerous situations, etc.). Finally, through the use of the GPS receiver, the exact location of the caught event is determined and spread along the network. In this way, if an accident occurs, the arriving cars will, probably, avoid delay and danger situations.

Managing Emergency Situations in VANET Through Heterogeneous Technologies Cooperation

PubMed Central

Tropea, Mauro; De Rango, Floriano

2018-01-01

Nowadays, the research on vehicular computing enhanced a very huge amount of services and protocols, aimed to vehicles security and comfort. The investigation of the IEEE802.11p, Wireless Access in Vehicular Environments (WAVE) and Dedicated Short Range Communication (DSRC) standards gave to the scientific world the chance to integrate new services, protocols, algorithms and devices inside vehicles. This opportunity attracted the attention of private/public organizations, which spent lot of resources and money to promote vehicular technologies. In this paper, the attention is focused on the design of a new approach for vehicular environments able to gather information during mobile node trips, for advising dangerous or emergency situations by exploiting on-board sensors. It is assumed that each vehicle has an integrated on-board unit composed of several sensors and Global Position System (GPS) device, able to spread alerting messages around the network, regarding warning and dangerous situations/conditions. On-board units, based on the standard communication protocols, share the collected information with the surrounding road-side units, while the sensing platform is able to recognize the environment that vehicles are passing through (obstacles, accidents, emergencies, dangerous situations, etc.). Finally, through the use of the GPS receiver, the exact location of the caught event is determined and spread along the network. In this way, if an accident occurs, the arriving cars will, probably, avoid delay and danger situations. PMID:29738453

Performance Evaluation of Remote Memory Access (RMA) Programming on Shared Memory Parallel Computers

NASA Technical Reports Server (NTRS)

Jin, Hao-Qiang; Jost, Gabriele; Biegel, Bryan A. (Technical Monitor)

2002-01-01

The purpose of this study is to evaluate the feasibility of remote memory access (RMA) programming on shared memory parallel computers. We discuss different RMA based implementations of selected CFD application benchmark kernels and compare them to corresponding message passing based codes. For the message-passing implementation we use MPI point-to-point and global communication routines. For the RMA based approach we consider two different libraries supporting this programming model. One is a shared memory parallelization library (SMPlib) developed at NASA Ames, the other is the MPI-2 extensions to the MPI Standard. We give timing comparisons for the different implementation strategies and discuss the performance.

Comparing the OpenMP, MPI, and Hybrid Programming Paradigm on an SMP Cluster

NASA Technical Reports Server (NTRS)

Jost, Gabriele; Jin, Hao-Qiang; anMey, Dieter; Hatay, Ferhat F.

2003-01-01

Clusters of SMP (Symmetric Multi-Processors) nodes provide support for a wide range of parallel programming paradigms. The shared address space within each node is suitable for OpenMP parallelization. Message passing can be employed within and across the nodes of a cluster. Multiple levels of parallelism can be achieved by combining message passing and OpenMP parallelization. Which programming paradigm is the best will depend on the nature of the given problem, the hardware components of the cluster, the network, and the available software. In this study we compare the performance of different implementations of the same CFD benchmark application, using the same numerical algorithm but employing different programming paradigms.

ADAPTIVE TETRAHEDRAL GRID REFINEMENT AND COARSENING IN MESSAGE-PASSING ENVIRONMENTS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hallberg, J.; Stagg, A.

2000-10-01

A grid refinement and coarsening scheme has been developed for tetrahedral and triangular grid-based calculations in message-passing environments. The element adaption scheme is based on an edge bisection of elements marked for refinement by an appropriate error indicator. Hash-table/linked-list data structures are used to store nodal and element formation. The grid along inter-processor boundaries is refined and coarsened consistently with the update of these data structures via MPI calls. The parallel adaption scheme has been applied to the solution of a transient, three-dimensional, nonlinear, groundwater flow problem. Timings indicate efficiency of the grid refinement process relative to the flow solvermore » calculations.« less

Security of a sessional blind signature based on quantum cryptograph

NASA Astrophysics Data System (ADS)

Wang, Tian-Yin; Cai, Xiao-Qiu; Zhang, Rui-Ling

2014-08-01

We analyze the security of a sessional blind signature protocol based on quantum cryptograph and show that there are two security leaks in this protocol. One is that the legal user Alice can change the signed message after she gets a valid blind signature from the signatory Bob, and the other is that an external opponent Eve also can forge a valid blind message by a special attack, which are not permitted for blind signature. Therefore, this protocol is not secure in the sense that it does not satisfy the non-forgeability of blind signatures. We also discuss the methods to prevent the attack strategies in the end.

Statistical mechanics of unsupervised feature learning in a restricted Boltzmann machine with binary synapses

NASA Astrophysics Data System (ADS)

Huang, Haiping

2017-05-01

Revealing hidden features in unlabeled data is called unsupervised feature learning, which plays an important role in pretraining a deep neural network. Here we provide a statistical mechanics analysis of the unsupervised learning in a restricted Boltzmann machine with binary synapses. A message passing equation to infer the hidden feature is derived, and furthermore, variants of this equation are analyzed. A statistical analysis by replica theory describes the thermodynamic properties of the model. Our analysis confirms an entropy crisis preceding the non-convergence of the message passing equation, suggesting a discontinuous phase transition as a key characteristic of the restricted Boltzmann machine. Continuous phase transition is also confirmed depending on the embedded feature strength in the data. The mean-field result under the replica symmetric assumption agrees with that obtained by running message passing algorithms on single instances of finite sizes. Interestingly, in an approximate Hopfield model, the entropy crisis is absent, and a continuous phase transition is observed instead. We also develop an iterative equation to infer the hyper-parameter (temperature) hidden in the data, which in physics corresponds to iteratively imposing Nishimori condition. Our study provides insights towards understanding the thermodynamic properties of the restricted Boltzmann machine learning, and moreover important theoretical basis to build simplified deep networks.

Principles for problem aggregation and assignment in medium scale multiprocessors

NASA Technical Reports Server (NTRS)

Nicol, David M.; Saltz, Joel H.

1987-01-01

One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior.

The Interlibrary Loan Protocol: An OSI Solution to ILL Messaging.

ERIC Educational Resources Information Center

Turner, Fay

1990-01-01

Discusses the interlibrary loan (ILL) protocol, a standard based on the principles of the Open Systems Interconnection (OSI) Reference Model. Benefits derived from protocol use are described, the status of the protocol as an international standard is reviewed, and steps taken by the National Library of Canada to facilitate migration to an ILL…

Double C-NOT attack and counterattack on `Three-step semi-quantum secure direct communication protocol'

NASA Astrophysics Data System (ADS)

Gu, Jun; Lin, Po-hua; Hwang, Tzonelih

2018-07-01

Recently, Zou and Qiu (Sci China Phys Mech Astron 57:1696-1702, 2014) proposed a three-step semi-quantum secure direct communication protocol allowing a classical participant who does not have a quantum register to securely send his/her secret message to a quantum participant. However, this study points out that an eavesdropper can use the double C-NOT attack to obtain the secret message. To solve this problem, a modification is proposed.

Recommended Methodology for Inter-Service/Agency Automated Message Processing Exchange (I-S/A AMPE). Cost and Schedule Analysis of Security Alternatives.

DTIC Science & Technology

1982-02-23

segregate the computer and storage from the outside world 2. Administrative security to control access to secure computer facilities 3. Network security to...Classification Alternative A- 8 NETWORK KG GENSER DSSCS AMPE TERMINALS TP No. 022-4668-A Figure A-2. Dedicated Switching Architecture Alternative A- 9...communications protocol with the network and GENSER message transmission to the - I-S/A AMPE processor. 7. DSSCS TPU - Handles communications protocol with

Deterministic and unambiguous dense coding

NASA Astrophysics Data System (ADS)

Wu, Shengjun; Cohen, Scott M.; Sun, Yuqing; Griffiths, Robert B.

2006-04-01

Optimal dense coding using a partially-entangled pure state of Schmidt rank Dmacr and a noiseless quantum channel of dimension D is studied both in the deterministic case where at most Ld messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability τx ) Bob knows for sure that Alice sent message x , and when it fails (probability 1-τx ) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For Dmacr ⩽D a bound is obtained for Ld in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes [Phys. Rev. A71, 012311 (2005)]. For Dmacr >D it is shown that Ld is strictly less than D2 unless Dmacr is an integer multiple of D , in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for Dmacr ⩽D , assuming τx>0 for a set of Dmacr D messages, and a bound is obtained for the average ⟨1/τ⟩ . A bound on the average ⟨τ⟩ requires an additional assumption of encoding by isometries (unitaries when Dmacr =D ) that are orthogonal for different messages. Both bounds are saturated when τx is a constant independent of x , by a protocol based on one-shot entanglement concentration. For Dmacr >D it is shown that (at least) D2 messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.

A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks.

PubMed

Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J; Pallarès Segarra, Esteve; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Sanvicente Gargallo, Emilio

2015-04-17

The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic. Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs.

Direction based Hazard Routing Protocol (DHRP) for disseminating road hazard information using road side infrastructures in VANETs.

PubMed

Berlin, M A; Anand, Sheila

2014-01-01

This paper presents Direction based Hazard Routing Protocol (DHRP) for disseminating information about fixed road hazards such as road blocks, tree fall, boulders on road, snow pile up, landslide, road maintenance work and other obstacles to the vehicles approaching the hazardous location. The proposed work focuses on dissemination of hazard messages on highways with sparse traffic. The vehicle coming across the hazard would report the presence of the hazard. It is proposed to use Road Side fixed infrastructure Units for reliable and timely delivery of hazard messages to vehicles. The vehicles can then take appropriate safety action to avoid the hazardous location. The proposed protocol has been implemented and tested using SUMO simulator to generate road traffic and NS 2.33 network simulator to analyze the performance of DHRP. The performance of the proposed protocol was also compared with simple flooding protocol and the results are presented.

Improving Health Worker Adherence to Malaria Treatment Guidelines in Papua New Guinea: Feasibility and Acceptability of a Text Message Reminder Service

PubMed Central

Kurumop, Serah F.; Bullen, Chris; Whittaker, Robyn; Betuela, Inoni; Hetzel, Manuel W.; Pulford, Justin

2013-01-01

The aim of this study is to assess whether a text message reminder service designed to support health worker adherence to a revised malaria treatment protocol is feasible and acceptable in Papua New Guinea (PNG). The study took place in six purposively selected health facilities located in the Eastern Highlands Province (EHP) of PNG. Ten text messages designed to remind participants of key elements of the new NMTP were transmitted to 42 health workers twice over a two week period (two text messages per day, Monday to Friday) via the country’s largest mobile network provider. The feasibility and acceptability of the text message reminder service was assessed by transmission reports, participant diaries and group discussions. Findings indicate that the vast majority of text messages were successfully transmitted, participants’ had regular mobile phone access and that most text messages were read most of the time and were considered both acceptable and clinically useful. Nevertheless, the study found that PNG health workers may tire of the service if the same messages are repeated too many times and that health workers may be reluctant to utilize more comprehensive, yet complementary, resources. In conclusion, a text message reminder service to support health worker adherence to the new malaria treatment protocol is feasible and acceptable in PNG. A rigorous pragmatic, effectiveness trial would be justified on the basis of these findings. PMID:24116122

Performance analysis of distributed applications using automatic classification of communication inefficiencies

DOEpatents

Vetter, Jeffrey S.

2005-02-01

The method and system described herein presents a technique for performance analysis that helps users understand the communication behavior of their message passing applications. The method and system described herein may automatically classifies individual communication operations and reveal the cause of communication inefficiencies in the application. This classification allows the developer to quickly focus on the culprits of truly inefficient behavior, rather than manually foraging through massive amounts of performance data. Specifically, the method and system described herein trace the message operations of Message Passing Interface (MPI) applications and then classify each individual communication event using a supervised learning technique: decision tree classification. The decision tree may be trained using microbenchmarks that demonstrate both efficient and inefficient communication. Since the method and system described herein adapt to the target system's configuration through these microbenchmarks, they simultaneously automate the performance analysis process and improve classification accuracy. The method and system described herein may improve the accuracy of performance analysis and dramatically reduce the amount of data that users must encounter.

User-oriented end-to-end transport protocols for the real-time distribution of telemetry data from NASA spacecraft

NASA Technical Reports Server (NTRS)

Hooke, A. J.

1979-01-01

A set of standard telemetry protocols for downlink data flow facilitating the end-to-end transport of instrument data from the spacecraft to the user in real time is proposed. The direct switching of data by autonomous message 'packets' that are assembled by the source instrument on the spacecraft is discussed. The data system consists thus of a format on a message rather than word basis, and such packet telemetry would include standardized protocol headers. Standards are being developed within the NASA End-to-End Data System (NEEDS) program for the source packet and transport frame protocols. The source packet protocol contains identification of both the sequence number of the packet as it is generated by the source and the total length of the packet, while the transport frame protocol includes a sequence count defining the serial number of the frame as it is generated by the spacecraft data system, and a field specifying any 'options' selected in the format of the frame itself.

Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction

NASA Astrophysics Data System (ADS)

Aarts, Fides; Jonsson, Bengt; Uijen, Johan

In order to facilitate model-based verification and validation, effort is underway to develop techniques for generating models of communication system components from observations of their external behavior. Most previous such work has employed regular inference techniques which generate modest-size finite-state models. They typically suppress parameters of messages, although these have a significant impact on control flow in many communication protocols. We present a framework, which adapts regular inference to include data parameters in messages and states for generating components with large or infinite message alphabets. A main idea is to adapt the framework of predicate abstraction, successfully used in formal verification. Since we are in a black-box setting, the abstraction must be supplied externally, using information about how the component manages data parameters. We have implemented our techniques by connecting the LearnLib tool for regular inference with the protocol simulator ns-2, and generated a model of the SIP component as implemented in ns-2.

Designing normative messages about active surveillance for men with localized prostate cancer

PubMed Central

Volk, Robert J.; Kinsman, Gianna T.; Le, Yen-Chi L.; Swank, Paul; Blumenthal-Barby, Jennifer; McFall, Stephanie L.; Byrd, Theresa L.; Mullen, Patricia Dolan; Cantor, Scott B.

2016-01-01

Active surveillance (AS) is increasingly recognized as a reasonable option for men with low-risk, localized prostate cancer, yet few men who might benefit from conservative management receive it. We examined the acceptability of normative messages about AS as a management option for patients with low-risk prostate cancer. Men with a diagnosis of localized prostate cancer who were recruited through prostate cancer support organizations completed a web-based survey (N=331). They rated messages about AS for believability, accuracy, and importance for men to hear when making treatment decisions. The message “you don’t have to panic…you have time to think about your options” was perceived as believable, accurate, and important by over 80% of the survivors. In contrast, messages about trust in the AS protocol and “knowing in plenty of time” if treatment is needed were rated as accurate by only about 36% of respondents. For AS to be viewed as a reasonable alternative, men will need reassurance that following an AS protocol is likely to allow time for curative treatment if the cancer progresses. PMID:26066011

Risk assessment, identification, and notification (RAIN) system : a novel approach for traffic management.

DOT National Transportation Integrated Search

2009-08-31

Primary research focused on the design and development of an energy-efficient Risk Notification Message Dissemination Protocol (RNMDP) for vehicular ad hoc networks (VANETs). RNMDP propagates Risk Notification Messages (RNMs) from a location of origi...

SAMP, the Simple Application Messaging Protocol: Letting applications talk to each other

NASA Astrophysics Data System (ADS)

Taylor, M. B.; Boch, T.; Taylor, J.

2015-06-01

SAMP, the Simple Application Messaging Protocol, is a hub-based communication standard for the exchange of data and control between participating client applications. It has been developed within the context of the Virtual Observatory with the aim of enabling specialised data analysis tools to cooperate as a loosely integrated suite, and is now in use by many and varied desktop and web-based applications dealing with astronomical data. This paper reviews the requirements and design principles that led to SAMP's specification, provides a high-level description of the protocol, and discusses some of its common and possible future usage patterns, with particular attention to those factors that have aided its success in practice.

Earth Observation

NASA Image and Video Library

2013-08-20

Earth observation taken during day pass by an Expedition 36 crew member on board the International Space Station (ISS). Per Twitter message: Looking southwest over northern Africa. Libya, Algeria, Niger.

Design, Implementation, and Verification of the Reliable Multicast Protocol. Thesis

NASA Technical Reports Server (NTRS)

Montgomery, Todd L.

1995-01-01

This document describes the Reliable Multicast Protocol (RMP) design, first implementation, and formal verification. RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service. RMP is fully and symmetrically distributed so that no site bears an undue portion of the communications load. RMP provides a wide range of guarantees, from unreliable delivery to totally ordered delivery, to K-resilient, majority resilient, and totally resilient atomic delivery. These guarantees are selectable on a per message basis. RMP provides many communication options, including virtual synchrony, a publisher/subscriber model of message delivery, a client/server model of delivery, mutually exclusive handlers for messages, and mutually exclusive locks. It has been commonly believed that total ordering of messages can only be achieved at great performance expense. RMP discounts this. The first implementation of RMP has been shown to provide high throughput performance on Local Area Networks (LAN). For two or more destinations a single LAN, RMP provides higher throughput than any other protocol that does not use multicast or broadcast technology. The design, implementation, and verification activities of RMP have occurred concurrently. This has allowed the verification to maintain a high fidelity between design model, implementation model, and the verification model. The restrictions of implementation have influenced the design earlier than in normal sequential approaches. The protocol as a whole has matured smoother by the inclusion of several different perspectives into the product development.

Application of a distributed network in computational fluid dynamic simulations

NASA Technical Reports Server (NTRS)

Deshpande, Manish; Feng, Jinzhang; Merkle, Charles L.; Deshpande, Ashish

1994-01-01

A general-purpose 3-D, incompressible Navier-Stokes algorithm is implemented on a network of concurrently operating workstations using parallel virtual machine (PVM) and compared with its performance on a CRAY Y-MP and on an Intel iPSC/860. The problem is relatively computationally intensive, and has a communication structure based primarily on nearest-neighbor communication, making it ideally suited to message passing. Such problems are frequently encountered in computational fluid dynamics (CDF), and their solution is increasingly in demand. The communication structure is explicitly coded in the implementation to fully exploit the regularity in message passing in order to produce a near-optimal solution. Results are presented for various grid sizes using up to eight processors.

Approximate message passing with restricted Boltzmann machine priors

NASA Astrophysics Data System (ADS)

Tramel, Eric W.; Drémeau, Angélique; Krzakala, Florent

2016-07-01

Approximate message passing (AMP) has been shown to be an excellent statistical approach to signal inference and compressed sensing problems. The AMP framework provides modularity in the choice of signal prior; here we propose a hierarchical form of the Gauss-Bernoulli prior which utilizes a restricted Boltzmann machine (RBM) trained on the signal support to push reconstruction performance beyond that of simple i.i.d. priors for signals whose support can be well represented by a trained binary RBM. We present and analyze two methods of RBM factorization and demonstrate how these affect signal reconstruction performance within our proposed algorithm. Finally, using the MNIST handwritten digit dataset, we show experimentally that using an RBM allows AMP to approach oracle-support performance.

New NAS Parallel Benchmarks Results

NASA Technical Reports Server (NTRS)

Yarrow, Maurice; Saphir, William; VanderWijngaart, Rob; Woo, Alex; Kutler, Paul (Technical Monitor)

1997-01-01

NPB2 (NAS (NASA Advanced Supercomputing) Parallel Benchmarks 2) is an implementation, based on Fortran and the MPI (message passing interface) message passing standard, of the original NAS Parallel Benchmark specifications. NPB2 programs are run with little or no tuning, in contrast to NPB vendor implementations, which are highly optimized for specific architectures. NPB2 results complement, rather than replace, NPB results. Because they have not been optimized by vendors, NPB2 implementations approximate the performance a typical user can expect for a portable parallel program on distributed memory parallel computers. Together these results provide an insightful comparison of the real-world performance of high-performance computers. New NPB2 features: New implementation (CG), new workstation class problem sizes, new serial sample versions, more performance statistics.

Internet Protocol Transition Workbook

DTIC Science & Technology

1982-03-01

U N C-* INTERNET PROTOCOL TRANSITION WORKBOOK March 1982 Network Information Canter SRI International Menlo Park, CA 94025 t tv l...Feinler Network Information Center SRI International Menlo Park. California 94025 (415) 859-3695 FEINLEROSRI-NIC (Online mail) [Page ii] I.7 Internet ...31 Postel. J., " Internet Control Message Protocol - DARPA Internet Program Protocol Specification." RFC 792, USC/ Information Sciences Institute

DARPA Internet Program. Internet and Transmission Control Specifications,

DTIC Science & Technology

1981-09-01

Internet Program Protocol Specification", RFC 791, USC/ Information Sciences Institute, September 1981. [34] Postel, J., ed., "Transmission Control Protocol...DARPA Internet Program Protocol Specification", RFC 793, USC/ Information Sciences Institute, September 1981. [35] Postel, J., "Echo Process", RFC 347...Newman, March 1981. [53] Postel, J., " Internet Control Message Protocol - DARPA Internet Program Protocol Specification", RFC 792, USC/ Information

Passing messages between biological networks to refine predicted interactions.

PubMed

Glass, Kimberly; Huttenhower, Curtis; Quackenbush, John; Yuan, Guo-Cheng

2013-01-01

Regulatory network reconstruction is a fundamental problem in computational biology. There are significant limitations to such reconstruction using individual datasets, and increasingly people attempt to construct networks using multiple, independent datasets obtained from complementary sources, but methods for this integration are lacking. We developed PANDA (Passing Attributes between Networks for Data Assimilation), a message-passing model using multiple sources of information to predict regulatory relationships, and used it to integrate protein-protein interaction, gene expression, and sequence motif data to reconstruct genome-wide, condition-specific regulatory networks in yeast as a model. The resulting networks were not only more accurate than those produced using individual data sets and other existing methods, but they also captured information regarding specific biological mechanisms and pathways that were missed using other methodologies. PANDA is scalable to higher eukaryotes, applicable to specific tissue or cell type data and conceptually generalizable to include a variety of regulatory, interaction, expression, and other genome-scale data. An implementation of the PANDA algorithm is available at www.sourceforge.net/projects/panda-net.

The Network Protocol Analysis Technique in Snort

NASA Astrophysics Data System (ADS)

Wu, Qing-Xiu

Network protocol analysis is a network sniffer to capture data for further analysis and understanding of the technical means necessary packets. Network sniffing is intercepted by packet assembly binary format of the original message content. In order to obtain the information contained. Required based on TCP / IP protocol stack protocol specification. Again to restore the data packets at protocol format and content in each protocol layer. Actual data transferred, as well as the application tier.

Earth observation taken by the Expedition 46 crew

NASA Image and Video Library

2016-01-23

ISS046e021993 (01/23/2016) --- Earth observation of the coast of Oman taken during a night pass by the Expedition 46 crew aboard the International Space Station. NASA astronaut Tim Kopra tweeted this image out with this message: "Passing over the Gulf of #Oman at night -- city lights of #Muscat #Dubai #AbuDhabi and #Doha in the distance".

Increasing the Automation and Autonomy for Spacecraft Operations with Criteria Action Table

NASA Technical Reports Server (NTRS)

Li, Zhen-Ping; Savki, Cetin

2005-01-01

The Criteria Action Table (CAT) is an automation tool developed for monitoring real time system messages for specific events and processes in order to take user defined actions based on a set of user-defined rules. CAT was developed by Lockheed Martin Space Operations as a part of a larger NASA effort at the Goddard Space Flight Center (GSFC) to create a component-based, middleware-based, and standard-based general purpose ground system architecture referred as GMSEC - the GSFC Mission Services Evolution Center. CAT has been integrated into the upgraded ground systems for Tropical Rainfall Measuring Mission (TRMM) and Small Explorer (SMEX) satellites and it plays the central role in their automation effort to reduce the cost and increase the reliability for spacecraft operations. The GMSEC architecture provides a standard communication interface and protocol for components to publish/describe messages to an information bus. It also provides a standard message definition so components can send and receive messages to the bus interface rather than each other, thus reducing the component-to-component coupling, interface, protocols, and link (socket) management. With the GMSEC architecture, components can publish standard event messages to the bus for all nominal, significant, and surprising events in regard to satellite, celestial, ground system, or any other activity. In addition to sending standard event messages, each GMSEC compliant component is required to accept and process GMSEC directive request messages.

Delay/Disruption Tolerant Network-Based Message Forwarding for a River Pollution Monitoring Wireless Sensor Network Application.

PubMed

Velásquez-Villada, Carlos; Donoso, Yezid

2016-03-25

Communications from remote areas that may be of interest is still a problem. Many innovative projects applied to remote sites face communications difficulties. The GOLDFISH project was an EU-funded project for river pollution monitoring in developing countries. It had several sensor clusters, with floating WiFi antennas, deployed along a downstream river's course. Sensor clusters sent messages to a Gateway installed on the riverbank. This gateway sent the messages, through a backhaul technology, to an Internet server where data was aggregated over a map. The communication challenge in this scenario was produced by the antennas' movement and network backhaul availability. Since the antennas were floating on the river, communications could be disrupted at any time. Also, 2G/3G availability near the river was not constant. For non-real-time applications, we propose a Delay/Disruption Tolerant Network (DTN)-based solution where all nodes have persistent storage capabilities and DTN protocols to be able to wait minutes or hours to transmit. A mechanical backhaul will periodically visit the river bank where the gateway is installed and it will automatically collect sensor data to be carried to an Internet-covered spot. The proposed forwarding protocol delivers around 98% of the messages for this scenario, performing better than other well-known DTN routing protocols.

A Research Protocol to Test the Effectiveness of Text Messaging and Reminder Calls to Increase Service Use Referrals in a Community Engagement Program.

PubMed

Varma, Deepthi Satheesa; Hart, Mark; McIntyre, Denise Sonya; Kwiatkowski, Evan; Cottler, Linda Bauer

2016-06-28

Mobile phoned-based interventions have been increasingly used in clinical populations to improve health and health care delivery. The literature has shown that mobile phone-based text messages (short message service, SMS) are instantaneous, cost effective, and have less chance of being misplaced. Studies using mobile phone based-text messages have reported text messages as effective reminders that have resulted in increased appointment attendance, adherence to treatment, and better self-management. There have been no reports of adverse events when using text messaging in terms of misreading or misinterpreting data, transmitting inaccurate data, losing verbal or nonverbal communication cues, privacy issues, or failure or delay in message delivery. However, the literature has cited a need for personalized messages that are more responsive to individual needs. In addition, there has been a dearth of information on the use of reminders in nonclinical populations. The goal of this study is to assess the effectiveness of adding reminders in the form of text messaging versus reminder calls versus text messages and reminder calls to increase use of service referrals provided through community outreach. A total of 300 participants will be recruited for the study. Each participant will be randomized to one of three arms: a group that receives only reminder calls (CALLSONLY); a group that receives only text message reminders (TEXTONLY); and a group that receives both reminder calls and text messages (CALLS+TEXT). All groups will receive their reminder intervention on the 15th and 45th day after baseline when they receive medical and social service referrals from the community health workers (CHWs). A standard script will be used to administer the call and text reminders and a 15-item telephone-based satisfaction survey will be administered to assess the participant satisfaction with the process of receiving periodic reminders. The study is in the recruitment and follow-up phase. The authors anticipate completion of recruitment, interventions, and data entry by July 2016. Preliminary results are expected to be available by September 2016. This study will provide an opportunity to test the effectiveness of mobile-based interventions on nonclinical, community-recruited populations. In particular, such a protocol would increase the effectiveness of a community-based engagement program by instating a formal reminder system for all program members who receive social and/or medical service referrals during outreach in the community. Findings from this study would guide the development and implementation of reminder protocols for community-based engagement programs nationwide.

Space Flight Middleware: Remote AMS over DTN for Delay-Tolerant Messaging

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2011-01-01

This paper describes a technique for implementing scalable, reliable, multi-source multipoint data distribution in space flight communications -- Delay-Tolerant Reliable Multicast (DTRM) -- that is fully supported by the "Remote AMS" (RAMS) protocol of the Asynchronous Message Service (AMS) proposed for standardization within the Consultative Committee for Space Data Systems (CCSDS). The DTRM architecture enables applications to easily "publish" messages that will be reliably and efficiently delivered to an arbitrary number of "subscribing" applications residing anywhere in the space network, whether in the same subnet or in a subnet on a remote planet or vehicle separated by many light minutes of interplanetary space. The architecture comprises multiple levels of protocol, each included for a specific purpose and allocated specific responsibilities: "application AMS" traffic performs end-system data introduction and delivery subject to access control; underlying "remote AMS" directs this application traffic to populations of recipients at remote locations in a multicast distribution tree, enabling the architecture to scale up to large networks; further underlying Delay-Tolerant Networking (DTN) Bundle Protocol (BP) advances RAMS protocol data units through the distribution tree using delay-tolerant storeand- forward methods; and further underlying reliable "convergence-layer" protocols ensure successful data transfer over each segment of the end-to-end route. The result is scalable, reliable, delay-tolerant multi-source multicast that is largely self-configuring.

Protocol for multiple node network

NASA Technical Reports Server (NTRS)

Kirkham, Harold (Inventor)

1995-01-01

The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs an antibody recognition message termination process performed by all remote nodes and a remote node polling process performed by other nodes which are master units controlling remote nodes in respective zones of the network assigned to respective master nodes. Each remote node repeats only those messages originated in the local zone, to provide isolation among the master nodes.

Protocol for multiple node network

NASA Technical Reports Server (NTRS)

Kirkham, Harold (Inventor)

1994-01-01

The invention is a multiple interconnected network of intelligent message-repeating remote nodes which employs an antibody recognition message termination process performed by all remote nodes and a remote node polling process performed by other nodes which are master units controlling remote nodes in respective zones of the network assigned to respective master nodes. Each remote node repeats only those messages originated in the local zone, to provide isolation among the master nodes.

Mean-field message-passing equations in the Hopfield model and its generalizations

NASA Astrophysics Data System (ADS)

Mézard, Marc

2017-02-01

Motivated by recent progress in using restricted Boltzmann machines as preprocessing algorithms for deep neural network, we revisit the mean-field equations [belief-propagation and Thouless-Anderson Palmer (TAP) equations] in the best understood of such machines, namely the Hopfield model of neural networks, and we explicit how they can be used as iterative message-passing algorithms, providing a fast method to compute the local polarizations of neurons. In the "retrieval phase", where neurons polarize in the direction of one memorized pattern, we point out a major difference between the belief propagation and TAP equations: The set of belief propagation equations depends on the pattern which is retrieved, while one can use a unique set of TAP equations. This makes the latter method much better suited for applications in the learning process of restricted Boltzmann machines. In the case where the patterns memorized in the Hopfield model are not independent, but are correlated through a combinatorial structure, we show that the TAP equations have to be modified. This modification can be seen either as an alteration of the reaction term in TAP equations or, more interestingly, as the consequence of message passing on a graphical model with several hidden layers, where the number of hidden layers depends on the depth of the correlations in the memorized patterns. This layered structure is actually necessary when one deals with more general restricted Boltzmann machines.

Earth Observation

NASA Image and Video Library

2013-08-03

Earth observation taken during day pass by an Expedition 36 crew member on board the International Space Station (ISS). Per Twitter message: Perhaps a dandelion losing its seeds in the wind? Love clouds!

Paralysis

MedlinePlus

Paralysis is the loss of muscle function in part of your body. It happens when something goes ... way messages pass between your brain and muscles. Paralysis can be complete or partial. It can occur ...

Advanced Numerical Techniques of Performance Evaluation. Volume 2

DTIC Science & Technology

1990-06-01

multiprocessor environment. This factor is determined by the overhead of the primitives available in the system ( semaphore , monitor , or message... semaphore , monitor , or message passing primitives ) and U the programming ability of the user who implements the simulation. " t,: the sequential...Warp Operating System . i Pro" lftevcnth ACM Symposum on Operating Systems Princlplcs, pages 77 9:3, Auslin, TX, Nov wicr 1987. ACM. [121 D.R. Jefferson

Benchmarking hypercube hardware and software

NASA Technical Reports Server (NTRS)

Grunwald, Dirk C.; Reed, Daniel A.

1986-01-01

It was long a truism in computer systems design that balanced systems achieve the best performance. Message passing parallel processors are no different. To quantify the balance of a hypercube design, an experimental methodology was developed and the associated suite of benchmarks was applied to several existing hypercubes. The benchmark suite includes tests of both processor speed in the absence of internode communication and message transmission speed as a function of communication patterns.

Data transfer using complete bipartite graph

NASA Astrophysics Data System (ADS)

Chandrasekaran, V. M.; Praba, B.; Manimaran, A.; Kailash, G.

2017-11-01

Information exchange extent is an estimation of the amount of information sent between two focuses on a framework in a given time period. It is an extremely significant perception in present world. There are many ways of message passing in the present situations. Some of them are through encryption, decryption, by using complete bipartite graph. In this paper, we recommend a method for communication using messages through encryption of a complete bipartite graph.

Compression-based aggregation model for medical web services.

PubMed

Al-Shammary, Dhiah; Khalil, Ibrahim

2010-01-01

Many organizations such as hospitals have adopted Cloud Web services in applying their network services to avoid investing heavily computing infrastructure. SOAP (Simple Object Access Protocol) is the basic communication protocol of Cloud Web services that is XML based protocol. Generally,Web services often suffer congestions and bottlenecks as a result of the high network traffic that is caused by the large XML overhead size. At the same time, the massive load on Cloud Web services in terms of the large demand of client requests has resulted in the same problem. In this paper, two XML-aware aggregation techniques that are based on exploiting the compression concepts are proposed in order to aggregate the medical Web messages and achieve higher message size reduction.

Network-wide BGP route prediction for traffic engineering

NASA Astrophysics Data System (ADS)

Feamster, Nick; Rexford, Jennifer

2002-07-01

The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering.

Exploring the Implementation of Steganography Protocols on Quantum Audio Signals

NASA Astrophysics Data System (ADS)

Chen, Kehan; Yan, Fei; Iliyasu, Abdullah M.; Zhao, Jianping

2018-02-01

Two quantum audio steganography (QAS) protocols are proposed, each of which manipulates or modifies the least significant qubit (LSQb) of the host quantum audio signal that is encoded as an FRQA (flexible representation of quantum audio) audio content. The first protocol (i.e. the conventional LSQb QAS protocol or simply the cLSQ stego protocol) is built on the exchanges between qubits encoding the quantum audio message and the LSQb of the amplitude information in the host quantum audio samples. In the second protocol, the embedding procedure to realize it implants information from a quantum audio message deep into the constraint-imposed most significant qubit (MSQb) of the host quantum audio samples, we refer to it as the pseudo MSQb QAS protocol or simply the pMSQ stego protocol. The cLSQ stego protocol is designed to guarantee high imperceptibility between the host quantum audio and its stego version, whereas the pMSQ stego protocol ensures that the resulting stego quantum audio signal is better immune to illicit tampering and copyright violations (a.k.a. robustness). Built on the circuit model of quantum computation, the circuit networks to execute the embedding and extraction algorithms of both QAS protocols are determined and simulation-based experiments are conducted to demonstrate their implementation. Outcomes attest that both protocols offer promising trade-offs in terms of imperceptibility and robustness.

Trellis Tone Modulation Multiple-Access for Peer Discovery in D2D Networks

PubMed Central

Lim, Chiwoo; Kim, Sang-Hyo

2018-01-01

In this paper, a new non-orthogonal multiple-access scheme, trellis tone modulation multiple-access (TTMMA), is proposed for peer discovery of distributed device-to-device (D2D) communication. The range and capacity of discovery are important performance metrics in peer discovery. The proposed trellis tone modulation uses single-tone transmission and achieves a long discovery range due to its low Peak-to-Average Power Ratio (PAPR). The TTMMA also exploits non-orthogonal resource assignment to increase the discovery capacity. For the multi-user detection of superposed multiple-access signals, a message-passing algorithm with supplementary schemes are proposed. With TTMMA and its message-passing demodulation, approximately 1.5 times the number of devices are discovered compared to the conventional frequency division multiple-access (FDMA)-based discovery. PMID:29673167

Statistical physics of hard combinatorial optimization: Vertex cover problem

NASA Astrophysics Data System (ADS)

Zhao, Jin-Hua; Zhou, Hai-Jun

2014-07-01

Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years, the replica-symmetry-breaking mean field theory of spin glasses and the associated message-passing algorithms have greatly deepened our understanding of typical-case computation complexity. In this paper, we use the vertex cover problem, a basic nondeterministic-polynomial (NP)-complete combinatorial optimization problem of wide application, as an example to introduce the statistical physical methods and algorithms. We do not go into the technical details but emphasize mainly the intuitive physical meanings of the message-passing equations. A nonfamiliar reader shall be able to understand to a large extent the physics behind the mean field approaches and to adjust the mean field methods in solving other optimization problems.

Trellis Tone Modulation Multiple-Access for Peer Discovery in D2D Networks.

PubMed

Lim, Chiwoo; Jang, Min; Kim, Sang-Hyo

2018-04-17

In this paper, a new non-orthogonal multiple-access scheme, trellis tone modulation multiple-access (TTMMA), is proposed for peer discovery of distributed device-to-device (D2D) communication. The range and capacity of discovery are important performance metrics in peer discovery. The proposed trellis tone modulation uses single-tone transmission and achieves a long discovery range due to its low Peak-to-Average Power Ratio (PAPR). The TTMMA also exploits non-orthogonal resource assignment to increase the discovery capacity. For the multi-user detection of superposed multiple-access signals, a message-passing algorithm with supplementary schemes are proposed. With TTMMA and its message-passing demodulation, approximately 1.5 times the number of devices are discovered compared to the conventional frequency division multiple-access (FDMA)-based discovery.

A Message Passing Approach to Side Chain Positioning with Applications in Protein Docking Refinement *

PubMed Central

Moghadasi, Mohammad; Kozakov, Dima; Mamonov, Artem B.; Vakili, Pirooz; Vajda, Sandor; Paschalidis, Ioannis Ch.

2013-01-01

We introduce a message-passing algorithm to solve the Side Chain Positioning (SCP) problem. SCP is a crucial component of protein docking refinement, which is a key step of an important class of problems in computational structural biology called protein docking. We model SCP as a combinatorial optimization problem and formulate it as a Maximum Weighted Independent Set (MWIS) problem. We then employ a modified and convergent belief-propagation algorithm to solve a relaxation of MWIS and develop randomized estimation heuristics that use the relaxed solution to obtain an effective MWIS feasible solution. Using a benchmark set of protein complexes we demonstrate that our approach leads to more accurate docking predictions compared to a baseline algorithm that does not solve the SCP. PMID:23515575

Multi-partitioning for ADI-schemes on message passing architectures

NASA Technical Reports Server (NTRS)

Vanderwijngaart, Rob F.

1994-01-01

A kind of discrete-operator splitting called Alternating Direction Implicit (ADI) has been found to be useful in simulating fluid flow problems. In particular, it is being used to study the effects of hot exhaust jets from high performance aircraft on landing surfaces. Decomposition techniques that minimize load imbalance and message-passing frequency are described. Three strategies that are investigated for implementing the NAS Scalar Penta-diagonal Parallel Benchmark (SP) are transposition, pipelined Gaussian elimination, and multipartitioning. The multipartitioning strategy, which was used on Ethernet, was found to be the most efficient, although it was considered only a moderate success because of Ethernet's limited communication properties. The efficiency derived largely from the coarse granularity of the strategy, which reduced latencies and allowed overlap of communication and computation.

Parallel and fault-tolerant algorithms for hypercube multiprocessors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aykanat, C.

1988-01-01

Several techniques for increasing the performance of parallel algorithms on distributed-memory message-passing multi-processor systems are investigated. These techniques are effectively implemented for the parallelization of the Scaled Conjugate Gradient (SCG) algorithm on a hypercube connected message-passing multi-processor. Significant performance improvement is achieved by using these techniques. The SCG algorithm is used for the solution phase of an FE modeling system. Almost linear speed-up is achieved, and it is shown that hypercube topology is scalable for an FE class of problem. The SCG algorithm is also shown to be suitable for vectorization, and near supercomputer performance is achieved on a vectormore » hypercube multiprocessor by exploiting both parallelization and vectorization. Fault-tolerance issues for the parallel SCG algorithm and for the hypercube topology are also addressed.« less

Ultrascalable petaflop parallel supercomputer

DOEpatents

Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY

2010-07-20

A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.

Incremental Parallelization of Non-Data-Parallel Programs Using the Charon Message-Passing Library

NASA Technical Reports Server (NTRS)

VanderWijngaart, Rob F.

2000-01-01

Message passing is among the most popular techniques for parallelizing scientific programs on distributed-memory architectures. The reasons for its success are wide availability (MPI), efficiency, and full tuning control provided to the programmer. A major drawback, however, is that incremental parallelization, as offered by compiler directives, is not generally possible, because all data structures have to be changed throughout the program simultaneously. Charon remedies this situation through mappings between distributed and non-distributed data. It allows breaking up the parallelization into small steps, guaranteeing correctness at every stage. Several tools are available to help convert legacy codes into high-performance message-passing programs. They usually target data-parallel applications, whose loops carrying most of the work can be distributed among all processors without much dependency analysis. Others do a full dependency analysis and then convert the code virtually automatically. Even more toolkits are available that aid construction from scratch of message passing programs. None, however, allows piecemeal translation of codes with complex data dependencies (i.e. non-data-parallel programs) into message passing codes. The Charon library (available in both C and Fortran) provides incremental parallelization capabilities by linking legacy code arrays with distributed arrays. During the conversion process, non-distributed and distributed arrays exist side by side, and simple mapping functions allow the programmer to switch between the two in any location in the program. Charon also provides wrapper functions that leave the structure of the legacy code intact, but that allow execution on truly distributed data. Finally, the library provides a rich set of communication functions that support virtually all patterns of remote data demands in realistic structured grid scientific programs, including transposition, nearest-neighbor communication, pipelining, gather/scatter, and redistribution. At the end of the conversion process most intermediate Charon function calls will have been removed, the non-distributed arrays will have been deleted, and virtually the only remaining Charon functions calls are the high-level, highly optimized communications. Distribution of the data is under complete control of the programmer, although a wide range of useful distributions is easily available through predefined functions. A crucial aspect of the library is that it does not allocate space for distributed arrays, but accepts programmer-specified memory. This has two major consequences. First, codes parallelized using Charon do not suffer from encapsulation; user data is always directly accessible. This provides high efficiency, and also retains the possibility of using message passing directly for highly irregular communications. Second, non-distributed arrays can be interpreted as (trivial) distributions in the Charon sense, which allows them to be mapped to truly distributed arrays, and vice versa. This is the mechanism that enables incremental parallelization. In this paper we provide a brief introduction of the library and then focus on the actual steps in the parallelization process, using some representative examples from, among others, the NAS Parallel Benchmarks. We show how a complicated two-dimensional pipeline-the prototypical non-data-parallel algorithm- can be constructed with ease. To demonstrate the flexibility of the library, we give examples of the stepwise, efficient parallel implementation of nonlocal boundary conditions common in aircraft simulations, as well as the construction of the sequence of grids required for multigrid.

An Interpersonal Approach to Writing Negative Messages.

ERIC Educational Resources Information Center

Salerno, Douglas

1988-01-01

Asserts that textbook advice regarding buffers and negative messages is simplistic and frequently wrong, and analyses 22 job-refusal letters and their effectiveness. Claims that recent research on cognitive complexity and social perspective-taking suggests the need for more sophisticated audience analysis protocols for dealing with the negative…

A novel process of viral vector barcoding and library preparation enables high-diversity library generation and recombination-free paired-end sequencing

PubMed Central

Davidsson, Marcus; Diaz-Fernandez, Paula; Schwich, Oliver D.; Torroba, Marcos; Wang, Gang; Björklund, Tomas

2016-01-01

Detailed characterization and mapping of oligonucleotide function in vivo is generally a very time consuming effort that only allows for hypothesis driven subsampling of the full sequence to be analysed. Recent advances in deep sequencing together with highly efficient parallel oligonucleotide synthesis and cloning techniques have, however, opened up for entirely new ways to map genetic function in vivo. Here we present a novel, optimized protocol for the generation of universally applicable, barcode labelled, plasmid libraries. The libraries are designed to enable the production of viral vector preparations assessing coding or non-coding RNA function in vivo. When generating high diversity libraries, it is a challenge to achieve efficient cloning, unambiguous barcoding and detailed characterization using low-cost sequencing technologies. With the presented protocol, diversity of above 3 million uniquely barcoded adeno-associated viral (AAV) plasmids can be achieved in a single reaction through a process achievable in any molecular biology laboratory. This approach opens up for a multitude of in vivo assessments from the evaluation of enhancer and promoter regions to the optimization of genome editing. The generated plasmid libraries are also useful for validation of sequencing clustering algorithms and we here validate the newly presented message passing clustering process named Starcode. PMID:27874090

Cluster Computing For Real Time Seismic Array Analysis.

NASA Astrophysics Data System (ADS)

Martini, M.; Giudicepietro, F.

A seismic array is an instrument composed by a dense distribution of seismic sen- sors that allow to measure the directional properties of the wavefield (slowness or wavenumber vector) radiated by a seismic source. Over the last years arrays have been widely used in different fields of seismological researches. In particular they are applied in the investigation of seismic sources on volcanoes where they can be suc- cessfully used for studying the volcanic microtremor and long period events which are critical for getting information on the volcanic systems evolution. For this reason arrays could be usefully employed for the volcanoes monitoring, however the huge amount of data produced by this type of instruments and the processing techniques which are quite time consuming limited their potentiality for this application. In order to favor a direct application of arrays techniques to continuous volcano monitoring we designed and built a small PC cluster able to near real time computing the kinematics properties of the wavefield (slowness or wavenumber vector) produced by local seis- mic source. The cluster is composed of 8 Intel Pentium-III bi-processors PC working at 550 MHz, and has 4 Gigabytes of RAM memory. It runs under Linux operating system. The developed analysis software package is based on the Multiple SIgnal Classification (MUSIC) algorithm and is written in Fortran. The message-passing part is based upon the LAM programming environment package, an open-source imple- mentation of the Message Passing Interface (MPI). The developed software system includes modules devote to receiving date by internet and graphical applications for the continuous displaying of the processing results. The system has been tested with a data set collected during a seismic experiment conducted on Etna in 1999 when two dense seismic arrays have been deployed on the northeast and the southeast flanks of this volcano. A real time continuous acquisition system has been simulated by a pro- gram which reads data from disk files and send them to a remote host by using the Internet protocols.

Message Passing on GPUs

NASA Astrophysics Data System (ADS)

Stuart, J. A.

2011-12-01

This paper explores the challenges in implementing a message passing interface usable on systems with data-parallel processors, and more specifically GPUs. As a case study, we design and implement the ``DCGN'' API on NVIDIA GPUs that is similar to MPI and allows full access to the underlying architecture. We introduce the notion of data-parallel thread-groups as a way to map resources to MPI ranks. We use a method that also allows the data-parallel processors to run autonomously from user-written CPU code. In order to facilitate communication, we use a sleep-based polling system to store and retrieve messages. Unlike previous systems, our method provides both performance and flexibility. By running a test suite of applications with different communication requirements, we find that a tolerable amount of overhead is incurred, somewhere between one and five percent depending on the application, and indicate the locations where this overhead accumulates. We conclude that with innovations in chipsets and drivers, this overhead will be mitigated and provide similar performance to typical CPU-based MPI implementations while providing fully-dynamic communication.

Instant Messaging by SIP

NASA Astrophysics Data System (ADS)

Muhi, Daniel; Dulai, Tibor; Jaskó, Szilárd

2008-11-01

SIP is a general-purpose application layer protocol which is able to establish sessions between two or more parties. These sessions are mainly telephone calls and multimedia conferences. However it can be used for other purposes like instant messaging and presence service. SIP has a very important role in mobile communication as more and more communicating applications are going mobile. In this paper we would like to show how SIP can be used for instant messaging purposes.

A Multi-User Game-Theoretical Multipath Routing Protocol to Send Video-Warning Messages over Mobile Ad Hoc Networks

PubMed Central

Mezher, Ahmad Mohamad; Igartua, Mónica Aguilar; de la Cruz Llopis, Luis J.; Segarra, Esteve Pallarès; Tripp-Barba, Carolina; Urquiza-Aguiar, Luis; Forné, Jordi; Gargallo, Emilio Sanvicente

2015-01-01

The prevention of accidents is one of the most important goals of ad hoc networks in smart cities. When an accident happens, dynamic sensors (e.g., citizens with smart phones or tablets, smart vehicles and buses, etc.) could shoot a video clip of the accident and send it through the ad hoc network. With a video message, the level of seriousness of the accident could be much better evaluated by the authorities (e.g., health care units, police and ambulance drivers) rather than with just a simple text message. Besides, other citizens would be rapidly aware of the incident. In this way, smart dynamic sensors could participate in reporting a situation in the city using the ad hoc network so it would be possible to have a quick reaction warning citizens and emergency units. The deployment of an efficient routing protocol to manage video-warning messages in mobile Ad hoc Networks (MANETs) has important benefits by allowing a fast warning of the incident, which potentially can save lives. To contribute with this goal, we propose a multipath routing protocol to provide video-warning messages in MANETs using a novel game-theoretical approach. As a base for our work, we start from our previous work, where a 2-players game-theoretical routing protocol was proposed to provide video-streaming services over MANETs. In this article, we further generalize the analysis made for a general number of N players in the MANET. Simulations have been carried out to show the benefits of our proposal, taking into account the mobility of the nodes and the presence of interfering traffic.Finally, we also have tested our approach in a vehicular ad hoc network as an incipient start point to develop a novel proposal specifically designed for VANETs. PMID:25897496

Guaranteeing synchronous message deadlines with the timed token medium access control protocol

NASA Technical Reports Server (NTRS)

Agrawal, Gopal; Chen, Baio; Zhao, Wei; Davari, Sadegh

1992-01-01

We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed token medium access control protocol is employed. Synchronous capacity, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. We address the issue of appropriate allocation of the synchronous capacities. Several synchronous capacity allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. We show that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed even if the synchronous traffic is extremely low. We propose a scheme called the normalized proportional allocation scheme which can guarantee the synchronous message deadlines for synchronous traffic of up to 33 percent of available utilization. To date, no other synchronous capacity allocation scheme has been reported to achieve such substantial performance. Another major contribution of this paper is an extension to the previous work on the bounded token rotation time. We prove that the time elapsed between any consecutive visits to a particular node is bounded by upsilon TTRT, where TTRT is the target token rotation time set up at system initialization time. The previous result by Johnson and Sevcik is a special case where upsilon = 2. We use this result in the analysis of various synchronous allocation schemes. It can also be applied in other similar studies.

Big data analytics : predicting traffic flow regimes from simulated connected vehicle messages using data analytics and machine learning.

DOT National Transportation Integrated Search

2016-12-25

The key objectives of this study were to: 1. Develop advanced analytical techniques that make use of a dynamically configurable connected vehicle message protocol to predict traffic flow regimes in near-real time in a virtual environment and examine ...

Improvement of One Quantum Encryption Scheme

NASA Astrophysics Data System (ADS)

Cao, Zhengjun; Liu, Lihua

2012-01-01

Zhou et al. proposed a quantum encryption scheme based on quantum computation in 2006 [N. Zhou et al., Physica A362 (2006) 305]. Each qubit of the ciphertext is constrained to two pairs of conjugate states. So, its implementation is feasible with the existing technology. But it is inefficient since it entails six key bits to encrypt one message bit, and the resulting ciphertext for one message bit consists of three qubits. In addition, its security cannot be directly reduced to the well-known BB84 protocol. In this paper, we improve it using the technique developed in BB84 protocol. The new scheme entails only two key bits to encrypt one message bit. The resulting ciphertext is just composed of two qubits. It saves about a half cost without the loss of security. Moreover, the new scheme is probabilistic instead of deterministic.

Improving security of the ping-pong protocol

NASA Astrophysics Data System (ADS)

Zawadzki, Piotr

2013-01-01

A security layer for the asymptotically secure ping-pong protocol is proposed and analyzed in the paper. The operation of the improvement exploits inevitable errors introduced by the eavesdropping in the control and message modes. Its role is similar to the privacy amplification algorithms known from the quantum key distribution schemes. Messages are processed in blocks which guarantees that an eavesdropper is faced with a computationally infeasible problem as long as the system parameters are within reasonable limits. The introduced additional information preprocessing does not require quantum memory registers and confidential communication is possible without prior key agreement or some shared secret.

Improving the capacity of the Boström-Felbinger protocol

NASA Astrophysics Data System (ADS)

Cai, Qing-Yu; Li, Bai-Wen

2004-05-01

We show that the capacity of the Boström-Felbinger (ping-pong) protocol [

The AI Bus architecture for distributed knowledge-based systems

NASA Technical Reports Server (NTRS)

Schultz, Roger D.; Stobie, Iain

1991-01-01

The AI Bus architecture is layered, distributed object oriented framework developed to support the requirements of advanced technology programs for an order of magnitude improvement in software costs. The consequent need for highly autonomous computer systems, adaptable to new technology advances over a long lifespan, led to the design of an open architecture and toolbox for building large scale, robust, production quality systems. The AI Bus accommodates a mix of knowledge based and conventional components, running on heterogeneous, distributed real world and testbed environment. The concepts and design is described of the AI Bus architecture and its current implementation status as a Unix C++ library or reusable objects. Each high level semiautonomous agent process consists of a number of knowledge sources together with interagent communication mechanisms based on shared blackboards and message passing acquaintances. Standard interfaces and protocols are followed for combining and validating subsystems. Dynamic probes or demons provide an event driven means for providing active objects with shared access to resources, and each other, while not violating their security.

Lossless quantum data compression and secure direct communication

NASA Astrophysics Data System (ADS)

Boström, Kim

2004-07-01

This thesis deals with the encoding and transmission of information through a quantum channel. A quantum channel is a quantum mechanical system whose state is manipulated by a sender and read out by a receiver. The individual state of the channel represents the message. The two topics of the thesis comprise 1) the possibility of compressing a message stored in a quantum channel without loss of information and 2) the possibility to communicate a message directly from one party to another in a secure manner, that is, a third party is not able to eavesdrop the message without being detected. The main results of the thesis are the following. A general framework for variable-length quantum codes is worked out. These codes are necessary to make lossless compression possible. Due to the quantum nature of the channel, the encoded messages are in general in a superposition of different lengths. It is found to be impossible to compress a quantum message without loss of information if the message is not apriori known to the sender. In the other case it is shown that lossless quantum data compression is possible and a lower bound on the compression rate is derived. Furthermore, an explicit compression scheme is constructed that works for arbitrarily given source message ensembles. A quantum cryptographic protocol - the “ping-pong protocol” - is presented that realizes the secure direct communication of classical messages through a quantum channel. The security of the protocol against arbitrary eavesdropping attacks is proven for the case of an ideal quantum channel. In contrast to other quantum cryptographic protocols, the ping-pong protocol is deterministic and can thus be used to transmit a random key as well as a composed message. The protocol is perfectly secure for the transmission of a key, and it is quasi-secure for the direct transmission of a message. The latter means that the probability of successful eavesdropping exponentially decreases with the length of the message. Diese Dissertation behandelt die Kodierung und Verschickung von Information durch einen Quantenkanal. Ein Quantenkanal besteht aus einem quantenmechanischen System, welches vom Sender manipuliert und vom Empfänger ausgelesen werden kann. Dabei repräsentiert der individuelle Zustand des Kanals die Nachricht. Die zwei Themen der Dissertation umfassen 1) die Möglichkeit, eine Nachricht in einem Quantenkanal verlustfrei zu komprimieren und 2) die Möglichkeit eine Nachricht von einer Partei zu einer einer anderen direkt und auf sichere Weise zu übermitteln, d.h. ohne dass es einer dritte Partei möglich ist, die Nachricht abzuhören und dabei unerkannt zu bleiben. Die wesentlichen Ergebnisse der Dissertation sind die folgenden. Ein allgemeiner Formalismus für Quantencodes mit variabler Länge wird ausgearbeitet. Diese Codes sind notwendig um verlustfreie Kompression zu ermöglichen. Wegen der Quantennatur des Kanals sind die codierten Nachrichten allgemein in einer Superposition von verschiedenen Längen. Es zeigt sich, daß es unmöglich ist eine Quantennachricht verlustfrei zu komprimieren, wenn diese dem Sender nicht apriori bekannt ist. Im anderen Falle wird die Möglichkeit verlustfreier Quantenkompression gezeigt und eine untere Schranke für die Kompressionsrate abgeleitet. Des weiteren wird ein expliziter Kompressionsalgorithmus konstruiert, der für beliebig vorgegebene Ensembles aus Quantennachrichten funktioniert. Ein quantenkryptografisches Prokoll - das “Ping-Pong Protokoll” - wird vorgestellt, welches die sichere direkte übertragung von klassischen Nachrichten durch einen Quantenkanal ermöglicht. Die Sicherheit des Protokolls gegen beliebige Abhörangriffe wird bewiesen für den Fall eines idealen Quantenkanals. Im Gegensatz zu anderen quantenkryptografischen Verfahren ist das Ping-Pong Protokoll deterministisch und kann somit sowohl für die Übermittlung eines zufälligen Schlüssels als auch einer komponierten Nachricht verwendet werden. Das Protokoll is perfekt sicher für die Übertragung eines Schlüssels und quasi-sicher für die direkte Übermittlung einer Nachricht. Letzteres bedeutet, dass die Wahrscheinlichkeit eines erfolgreichen Abhörangriffs exponenziell mit der Länge der Nachricht abnimmt.

Lightweight SIP/SDP compression scheme (LSSCS)

NASA Astrophysics Data System (ADS)

Wu, Jian J.; Demetrescu, Cristian

2001-10-01

In UMTS new IP based services with tight delay constraints will be deployed over the W-CDMA air interface such as IP multimedia and interactive services. To integrate the wireline and wireless IP services, 3GPP standard forum adopted the Session Initiation Protocol (SIP) as the call control protocol for the UMTS Release 5, which will implement next generation, all IP networks for real-time QoS services. In the current form the SIP protocol is not suitable for wireless transmission due to its large message size which will need either a big radio pipe for transmission or it will take far much longer to transmit than the current GSM Call Control (CC) message sequence. In this paper we present a novel compression algorithm called Lightweight SIP/SDP Compression Scheme (LSSCS), which acts at the SIP application layer and therefore removes the information redundancy before it is sent to the network and transport layer. A binary octet-aligned header is added to the compressed SIP/SDP message before sending it to the network layer. The receiver uses this binary header as well as the pre-cached information to regenerate the original SIP/SDP message. The key features of the LSSCS compression scheme are presented in this paper along with implementation examples. It is shown that this compression algorithm makes SIP transmission efficient over the radio interface without losing the SIP generality and flexibility.

Delay/Disruption Tolerant Network-Based Message Forwarding for a River Pollution Monitoring Wireless Sensor Network Application

PubMed Central

Velásquez-Villada, Carlos; Donoso, Yezid

2016-01-01

Communications from remote areas that may be of interest is still a problem. Many innovative projects applied to remote sites face communications difficulties. The GOLDFISH project was an EU-funded project for river pollution monitoring in developing countries. It had several sensor clusters, with floating WiFi antennas, deployed along a downstream river’s course. Sensor clusters sent messages to a Gateway installed on the riverbank. This gateway sent the messages, through a backhaul technology, to an Internet server where data was aggregated over a map. The communication challenge in this scenario was produced by the antennas’ movement and network backhaul availability. Since the antennas were floating on the river, communications could be disrupted at any time. Also, 2G/3G availability near the river was not constant. For non-real-time applications, we propose a Delay/Disruption Tolerant Network (DTN)-based solution where all nodes have persistent storage capabilities and DTN protocols to be able to wait minutes or hours to transmit. A mechanical backhaul will periodically visit the river bank where the gateway is installed and it will automatically collect sensor data to be carried to an Internet-covered spot. The proposed forwarding protocol delivers around 98% of the messages for this scenario, performing better than other well-known DTN routing protocols. PMID:27023554

47 CFR 11.56 - Obligation to process CAP-formatted EAS messages.

Code of Federal Regulations, 2013 CFR

2013-10-01

...), and Common Alerting Protocol, v. 1.2 USA Integrated Public Alert and Warning System Profile Version 1...) “Common Alerting Protocol, v. 1.2 USA Integrated Public Alert and Warning System Profile Version 1.0” (Oct...

47 CFR 11.56 - Obligation to process CAP-formatted EAS messages.

Code of Federal Regulations, 2012 CFR

2012-10-01

...), and Common Alerting Protocol, v. 1.2 USA Integrated Public Alert and Warning System Profile Version 1...) “Common Alerting Protocol, v. 1.2 USA Integrated Public Alert and Warning System Profile Version 1.0” (Oct...

47 CFR 11.56 - Obligation to process CAP-formatted EAS messages.

Code of Federal Regulations, 2014 CFR

2014-10-01

...), and Common Alerting Protocol, v. 1.2 USA Integrated Public Alert and Warning System Profile Version 1...) “Common Alerting Protocol, v. 1.2 USA Integrated Public Alert and Warning System Profile Version 1.0” (Oct...

Passing Messages between Biological Networks to Refine Predicted Interactions

PubMed Central

Glass, Kimberly; Huttenhower, Curtis; Quackenbush, John; Yuan, Guo-Cheng

2013-01-01

Regulatory network reconstruction is a fundamental problem in computational biology. There are significant limitations to such reconstruction using individual datasets, and increasingly people attempt to construct networks using multiple, independent datasets obtained from complementary sources, but methods for this integration are lacking. We developed PANDA (Passing Attributes between Networks for Data Assimilation), a message-passing model using multiple sources of information to predict regulatory relationships, and used it to integrate protein-protein interaction, gene expression, and sequence motif data to reconstruct genome-wide, condition-specific regulatory networks in yeast as a model. The resulting networks were not only more accurate than those produced using individual data sets and other existing methods, but they also captured information regarding specific biological mechanisms and pathways that were missed using other methodologies. PANDA is scalable to higher eukaryotes, applicable to specific tissue or cell type data and conceptually generalizable to include a variety of regulatory, interaction, expression, and other genome-scale data. An implementation of the PANDA algorithm is available at www.sourceforge.net/projects/panda-net. PMID:23741402

Applications of Probabilistic Combiners on Linear Feedback Shift Register Sequences

DTIC Science & Technology

2016-12-01

on the resulting output strings show a drastic increase in complexity, while simultaneously passing the stringent randomness tests required by the...a three-variable function. Our tests on the resulting output strings show a drastic increase in complex- ity, while simultaneously passing the...10001101 01000010 11101001 Decryption of a message that has been encrypted using bitwise XOR is quite simple. Since each bit is its own additive inverse

AMS Prototyping Activities

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2008-01-01

This slide presentation reviews the activity around the Asynchronous Message Service (AMS) prototype. An AMS reference implementation has been available since late 2005. It is aimed at supporting message exchange both in on-board environments and over space links. The implementation incoroporates all mandatory elements of the draft recommendation from July 2007: (1) MAMS, AMS, and RAMS protocols. (2) Failover, heartbeats, resync. (3) "Hooks" for security, but no cipher suites included in the distribution. The performance is reviewed, and a Benchmark latency test over VxWorks Message Queues is shown as histograms of a count vs microseconds per 1000-byte message

Earth Observation

NASA Image and Video Library

2013-07-26

Earth observation taken during day pass by an Expedition 36 crew member on board the International Space Station (ISS). Per Twitter message: Never tire of finding shapes in the clouds! These look very botanical to me. Simply perfect.

PREEMIE Reauthorization Act

THOMAS, 112th Congress

Sen. Alexander, Lamar [R-TN

2011-07-28

Senate - 12/19/2012 Message on House action received in Senate and at desk: House amendments to Senate bill. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Electronic Cigarettes on Twitter – Spreading the Appeal of Flavors

PubMed Central

Chu, Kar-Hai; Unger, Jennifer B.; Cruz, Tess Boley; Soto, Daniel W.

2016-01-01

Objectives Social media platforms are used by tobacco companies to promote products. This study examines message content on Twitter from e-cigarette brands and determines if messages about flavors are more likely than non-flavor messages to be passed along to other viewers. Methods We examined Twitter data from 2 e-cigarette brands and identified messages that contained terms related to e-cigarette flavors. Results Flavor-related posts were retweeted at a significantly higher rate by e-cigarette brands (p = .04) and other Twitter users (p < .01) than non-flavor posts. Conclusions E-cigarette brands and other Twitter users pay attention to flavor-related posts and retweet them often. These findings suggest flavors continue to be an attractive characteristic and their marketing should be monitored closely. PMID:27853734

Parallelization of the TRIGRS model for rainfall-induced landslides using the message passing interface

USGS Publications Warehouse

Alvioli, M.; Baum, R.L.

2016-01-01

We describe a parallel implementation of TRIGRS, the Transient Rainfall Infiltration and Grid-Based Regional Slope-Stability Model for the timing and distribution of rainfall-induced shallow landslides. We have parallelized the four time-demanding execution modes of TRIGRS, namely both the saturated and unsaturated model with finite and infinite soil depth options, within the Message Passing Interface framework. In addition to new features of the code, we outline details of the parallel implementation and show the performance gain with respect to the serial code. Results are obtained both on commercial hardware and on a high-performance multi-node machine, showing the different limits of applicability of the new code. We also discuss the implications for the application of the model on large-scale areas and as a tool for real-time landslide hazard monitoring.

Identifying an influential spreader from a single seed in complex networks via a message-passing approach

NASA Astrophysics Data System (ADS)

Min, Byungjoon

2018-01-01

Identifying the most influential spreaders is one of outstanding problems in physics of complex systems. So far, many approaches have attempted to rank the influence of nodes but there is still the lack of accuracy to single out influential spreaders. Here, we directly tackle the problem of finding important spreaders by solving analytically the expected size of epidemic outbreaks when spreading originates from a single seed. We derive and validate a theory for calculating the size of epidemic outbreaks with a single seed using a message-passing approach. In addition, we find that the probability to occur epidemic outbreaks is highly dependent on the location of the seed but the size of epidemic outbreaks once it occurs is insensitive to the seed. We also show that our approach can be successfully adapted into weighted networks.

The design of multi-core DSP parallel model based on message passing and multi-level pipeline

NASA Astrophysics Data System (ADS)

Niu, Jingyu; Hu, Jian; He, Wenjing; Meng, Fanrong; Li, Chuanrong

2017-10-01

Currently, the design of embedded signal processing system is often based on a specific application, but this idea is not conducive to the rapid development of signal processing technology. In this paper, a parallel processing model architecture based on multi-core DSP platform is designed, and it is mainly suitable for the complex algorithms which are composed of different modules. This model combines the ideas of multi-level pipeline parallelism and message passing, and summarizes the advantages of the mainstream model of multi-core DSP (the Master-Slave model and the Data Flow model), so that it has better performance. This paper uses three-dimensional image generation algorithm to validate the efficiency of the proposed model by comparing with the effectiveness of the Master-Slave and the Data Flow model.

Generalized hypercube structures and hyperswitch communication network

NASA Technical Reports Server (NTRS)

Young, Steven D.

1992-01-01

This paper discusses an ongoing study that uses a recent development in communication control technology to implement hybrid hypercube structures. These architectures are similar to binary hypercubes, but they also provide added connectivity between the processors. This added connectivity increases communication reliability while decreasing the latency of interprocessor message passing. Because these factors directly determine the speed that can be obtained by multiprocessor systems, these architectures are attractive for applications such as remote exploration and experimentation, where high performance and ultrareliability are required. This paper describes and enumerates these architectures and discusses how they can be implemented with a modified version of the hyperswitch communication network (HCN). The HCN is analyzed because it has three attractive features that enable these architectures to be effective: speed, fault tolerance, and the ability to pass multiple messages simultaneously through the same hyperswitch controller.

Universal Network Access System

DTIC Science & Technology

2003-11-01

128 Figure 37 The detail of the SCM TX , (LO; local oscillator, LPF; Low-pass filter, AMP; Amplifier, BPF ...with UNAS, ( BPF : band-pass filter, BM Rx; Burst Mode receiver, AWGR; Arrayed waveguide grating router, FBG; Fiber Bragg Grating, TL; Tunable Laser...protocols. Standard specifications and RFCs will be used as guidelines for implementation. Table 1 UNAS Serial I/O Formats Protocol Implement1

Modified Test Protocol Improves Sensitivity of the Stereo Fly Test.

PubMed

De La Cruz, Angie; Morale, Sarah E; Jost, Reed M; Kelly, Krista R; Birch, Eileen E

2016-01-01

Stereoacuity measurement is a common element of pediatric ophthalmic examinations. Although the Stereo Fly Test is routinely used to establish the presence of coarse stereopsis (3000 arcsecs), it often yields a false negative "pass" due to learned responses and non-stereoscopic cues. We developed and evaluated a modified Stereo Fly Test protocol aimed at increasing sensitivity, thus reducing false negatives. The Stereo Fly Test was administered according to manufacturer instructions to 321 children aged 3-12 years. Children with a "pass" outcome (n = 147) were re-tested wearing glasses fitted with polarizers of matching orientation for both eyes to verify that they were responding to stereoscopic cues (modified protocol). The response to the standard Stereo Fly Test was considered a false negative (pass) if the child still pinched above the plate after disparity cues were eliminated. Randot ® Preschool Stereoacuity and Butterfly Tests were used as gold standards. Sensitivity was 81% (95% CI: 0.75 - 0.86) for standard administration of the Stereo Fly Test (19% false negative "pass"). The modified protocol increased sensitivity to 90% (95% CI: 0.85 - 0.94). The modified two-step protocol is a simple and convenient way to administer the Stereo Fly Test with increased sensitivity in a clinical setting. © 2016 Board of regents of the University of Wisconsin System, American Orthoptic Journal, Volume 66, 2016, ISSN 0065-955X, E-ISSN 1553-4448.

Three-step semiquantum secure direct communication protocol

NASA Astrophysics Data System (ADS)

Zou, XiangFu; Qiu, DaoWen

2014-09-01

Quantum secure direct communication is the direct communication of secret messages without need for establishing a shared secret key first. In the existing schemes, quantum secure direct communication is possible only when both parties are quantum. In this paper, we construct a three-step semiquantum secure direct communication (SQSDC) protocol based on single photon sources in which the sender Alice is classical. In a semiquantum protocol, a person is termed classical if he (she) can measure, prepare and send quantum states only with the fixed orthogonal quantum basis {|0>, |1>}. The security of the proposed SQSDC protocol is guaranteed by the complete robustness of semiquantum key distribution protocols and the unconditional security of classical one-time pad encryption. Therefore, the proposed SQSDC protocol is also completely robust. Complete robustness indicates that nonzero information acquired by an eavesdropper Eve on the secret message implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol. In the proposed protocol, we suggest a method to check Eves disturbing in the doves returning phase such that Alice does not need to announce publicly any position or their coded bits value after the photons transmission is completed. Moreover, the proposed SQSDC protocol can be implemented with the existing techniques. Compared with many quantum secure direct communication protocols, the proposed SQSDC protocol has two merits: firstly the sender only needs classical capabilities; secondly to check Eves disturbing after the transmission of quantum states, no additional classical information is needed.

A large-alphabet three-party quantum key distribution protocol based on orbital and spin angular momenta hybrid entanglement

NASA Astrophysics Data System (ADS)

Lai, Hong; Luo, Mingxing; Zhang, Jun; Pieprzyk, Josef; Pan, Lei; Orgun, Mehmet A.

2018-07-01

The orthogonality of the orbital angular momentum (OAM) eigenstates enables a single photon carry an arbitrary number of bits. Moreover, additional degrees of freedom (DOFs) of OAM can span a high-dimensional Hilbert space, which could greatly increase information capacity and security. Moreover, the use of the spin angular momentum-OAM hybrid entangled state can increase Shannon dimensionality, because photons can be hybrid entangled in multiple DOFs. Based on these observations, we develop a hybrid entanglement quantum key distribution (QKD) protocol to achieve three-party quantum key distribution without classical message exchanges. In our proposed protocol, a communicating party uses a spatial light modulator (SLM) and a specific phase hologram to modulate photons' OAM state. Similarly, the other communicating parties use their SLMs and the fixed different phase holograms to modulate the OAM entangled photon pairs, producing the shared key among the parties Alice, Bob and Charlie without classical message exchanges. More importantly, when the same operation is repeated for every party, our protocol could be extended to a multiple-party QKD protocol.

[Design and realization of the communication system for the mobile medical terminal].

PubMed

Ji, Lei; Guo, Xu; Shi, Huayu

2013-01-01

Realizing wireless communication based on handset devices for medical staff; providing an instant messaging method. Constructing a set of communication protocols and standards; developing software both on server and client. Building an instant messaging system which follows the customized specification; based on Android the client provides functions like address book, message, voice service etc. As an independent module of the mobile medical terminal, the system can provide convenient communication for medical service with other mobile business.

System and method for transferring telemetry data between a ground station and a control center

NASA Technical Reports Server (NTRS)

Ray, Timothy J. (Inventor); Ly, Vuong T. (Inventor)

2012-01-01

Disclosed herein are systems, computer-implemented methods, and tangible computer-readable media for coordinating communications between a ground station, a control center, and a spacecraft. The method receives a call to a simple, unified application programmer interface implementing communications protocols related to outer space, when instruction relates to receiving a command at the control center for the ground station generate an abstract message by agreeing upon a format for each type of abstract message with the ground station and using a set of message definitions to configure the command in the agreed upon format, encode the abstract message to generate an encoded message, and transfer the encoded message to the ground station, and perform similar actions when the instruction relates to receiving a second command as a second encoded message at the ground station from the control center and when the determined instruction type relates to transmitting information to the control center.

Earth Observation

NASA Image and Video Library

2013-08-03

Earth observation taken during day pass by an Expedition 36 crew member on board the International Space Station (ISS). Per Twitter message: From southernmost point of orbit over the South Pacific- all clouds seemed to be leading to the South Pole.

Earth Observation

NASA Image and Video Library

2013-07-21

Earth observation taken during night pass by an Expedition 36 crew member on board the International Space Station (ISS). Per Twitter message this is labeled as : Tehran, Iran. Lights along the coast of the Caspian Sea visible through clouds. July 21.

Whistleblower Protection Enhancement Act of 2010

THOMAS, 111th Congress

Sen. Akaka, Daniel K. [D-HI

2009-02-03

Senate - 12/22/2010 Message on House action received in Senate and at desk: House amendments to Senate bill. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Earth Observation

NASA Image and Video Library

2014-05-31

Earth Observation taken during a day pass by the Expedition 40 crew aboard the International Space Station (ISS). Folder lists this as: CEO - Arena de Sao Paolo. View used for Twitter message: Cloudy skies over São Paulo Brazil

Text2Quit: results from a pilot test of a personalized, interactive mobile health smoking cessation program.

PubMed

Abroms, Lorien C; Ahuja, Meenakshi; Kodl, Yvonne; Thaweethai, Lalida; Sims, Justin; Winickoff, Jonathan P; Windsor, Richard A

2012-01-01

Text messaging programs on mobile phones have shown some promise in helping people quit smoking. Text2Quit is an automated, personalized, and interactive mobile health program that sends text messages and e-mails timed around a participant's quit date over the course of 3 months. The text messages include pre- and post-quit educational messages, peer ex-smoker messages, medication reminders and relapse messages, and multiple opportunities for interaction. Study participants were university students (N = 23) enrolled in the Text2Quit program. Participants were surveyed at baseline and at 2 and 4 weeks after enrollment. The majority of participants agreed that they liked the program at 2 and 4 weeks after enrollment (90.5% and 82.3%, respectively). Support for text messages was found to be moderate and higher than that of the e-mail and web components. Of participants, 75% reported reading most or all of the texts. On average, users made 11.8 responses to the texts over a 4-week period, although responses declined after the quit date. The interactive feature for tracking cigarettes was the most used interactive feature, followed by the craving trivia game. This pilot test provides some support for the Text2Quit program. A future iteration of the program will include additional tracking features in both the pre-quit and post-quit protocols and an easier entry into the not-quit protocol. Future studies are recommended that identify the value of the interactive and personalized features that characterize this program.

Text2Quit: Results from a Pilot Test of a Personalized, Interactive Mobile Health Smoking Cessation Program

PubMed Central

ABROMS, LORIEN C.; AHUJA, MEENAKSHI; KODL, YVONNE; THAWEETHAI, LALIDA; SIMS, JUSTIN; WINICKOFF, JONATHAN; WINDSOR, RICHARD A.

2012-01-01

Text messaging programs on mobile phones have shown some promise in helping people quit smoking. Text2Quit is an automated, personalized and interactive mobile health program that sends text messages and emails timed around a participant’s quit date over the course of 3 months. The text messages include pre- and post-quit educational messages, peer ex-smoker messages, medication reminders and relapse messages, as well as multiple opportunities for interaction. Study participants were university students (n=23) enrolled in the Text2Quit program. Participants were surveyed at baseline and at 2 and 4 weeks post-enrollment. The vast majority of participants agreed that they liked the program at 2 and 4 weeks post-enrollment (90.5% and 82.3%, respectively). Support for text messages was found to be moderate, and higher than that of the email and web components. Seventy-five percent of participants reported reading most or all of the texts. On average, users made 11.8 responses to the texts over a 4 week period, although responses declined following the quit date. The interactive feature for tracking cigarettes was the most used interactive feature, followed by the craving trivia game. This pilot test provides some support for the Text2Quit program. A future iteration of the program will include additional tracking features in both the pre-quit and post-quit protocol and an easier entry into the not-quit protocol. Future studies are recommended that identify the value of the interactive and personalized features that characterize this program. PMID:22548598

The multidriver: A reliable multicast service using the Xpress Transfer Protocol

NASA Technical Reports Server (NTRS)

Dempsey, Bert J.; Fenton, John C.; Weaver, Alfred C.

1990-01-01

A reliable multicast facility extends traditional point-to-point virtual circuit reliability to one-to-many communication. Such services can provide more efficient use of network resources, a powerful distributed name binding capability, and reduced latency in multidestination message delivery. These benefits will be especially valuable in real-time environments where reliable multicast can enable new applications and increase the availability and the reliability of data and services. We present a unique multicast service that exploits features in the next-generation, real-time transfer layer protocol, the Xpress Transfer Protocol (XTP). In its reliable mode, the service offers error, flow, and rate-controlled multidestination delivery of arbitrary-sized messages, with provision for the coordination of reliable reverse channels. Performance measurements on a single-segment Proteon ProNET-4 4 Mbps 802.5 token ring with heterogeneous nodes are discussed.

New secure communication-layer standard for medical image management (ISCL)

NASA Astrophysics Data System (ADS)

Kita, Kouichi; Nohara, Takashi; Hosoba, Minoru; Yachida, Masuyoshi; Yamaguchi, Masahiro; Ohyama, Nagaaki

1999-07-01

This paper introduces a summary of the standard draft of ISCL 1.00 which will be published by MEDIS-DC officially. ISCL is abbreviation of Integrated Secure Communication Layer Protocols for Secure Medical Image Management Systems. ISCL is a security layer which manages security function between presentation layer and TCP/IP layer. ISCL mechanism depends on basic function of a smart IC card and symmetric secret key mechanism. A symmetry key for each session is made by internal authentication function of a smart IC card with a random number. ISCL has three functions which assure authentication, confidently and integrity. Entity authentication process is done through 3 path 4 way method using functions of internal authentication and external authentication of a smart iC card. Confidentially algorithm and MAC algorithm for integrity are able to be selected. ISCL protocols are communicating through Message Block which consists of Message Header and Message Data. ISCL protocols are evaluating by applying to regional collaboration system for image diagnosis, and On-line Secure Electronic Storage system for medical images. These projects are supported by Medical Information System Development Center. These project shows ISCL is useful to keep security.

Interprocess Communication in Highly Distributed Systems - A Workshop Report - 20 to 22, November 1978.

DTIC Science & Technology

1979-12-01

Links between processes can be aLlocated strictLy to controL functions. In fact, the degree of separation of control and data is an important research is...delays or Loss of control messages. Cognoscienti agree that message-passing IPC schemes are equivalent in "power" to schemes which employ shared...THEORETICAL WORK Page 55 SECTION 6 THEORETICAL WORK 6.1 WORKING GRUP JIM REP.OR STRUCTURE of Discussion: Distributed system without central (or any) control

HIS-Based Support of Follow-Up Documentation – Concept and Implementation for Clinical Studies

PubMed Central

Herzberg, S.; Fritz, F.; Rahbar, K.; Stegger, L.; Schäfers, M.; Dugas, M.

2011-01-01

Objective Follow-up data must be collected according to the protocol of each clinical study, i.e. at certain time points. Missing follow-up information is a critical problem and may impede or bias the analysis of study data and result in delays. Moreover, additional patient recruitment may be necessary due to incomplete follow-up data. Current electronic data capture (EDC) systems in clinical studies are usually separated from hospital information systems (HIS) and therefore can provide limited functionality to support clinical workflow. In two case studies, we assessed the feasibility of HIS-based support of follow-up documentation. Methods We have developed a data model and a HIS-based workflow to provide follow-up forms according to clinical study protocols. If a follow-up form was due, a database procedure created a follow-up event which was translated by a communication server into an HL7 message and transferred to the import interface of the clinical information system (CIS). This procedure generated the required follow-up form and enqueued a link to it in a work list of the relating study nurses and study physicians, respectively. Results A HIS-based follow-up system automatically generated follow-up forms as defined by a clinical study protocol. These forms were scheduled into work lists of study nurses and study physicians. This system was integrated into the clinical workflow of two clinical studies. In a study from nuclear medicine, each scenario from the test concept according to the protocol of the single photon emission computer tomography/computer tomography (SPECT/CT) study was simulated and each scenario passed the test. For a study in psychiatry, 128 follow-up forms were automatically generated within 27 weeks, on average five forms per week (maximum 12, minimum 1 form per week). Conclusion HIS-based support of follow-up documentation in clinical studies is technically feasible and can support compliance with study protocols. PMID:23616857

Evaluation of a single-scan protocol for radiochromic film dosimetry.

PubMed

Shimohigashi, Yoshinobu; Araki, Fujio; Maruyama, Masato; Nakaguchi, Yuji; Kuwahara, Satoshi; Nagasue, Nozomu; Kai, Yudai

2015-03-08

The purpose of this study was to evaluate a single-scan protocol using Gafchromic EBT3 film (EBT3) by comparing it with the commonly used 24-hr measurement protocol for radiochromic film dosimetry. Radiochromic film is generally scanned 24 hr after film exposure (24-hr protocol). The single-scan protocol enables measurement results within a short time using only the verification film, one calibration film, and unirradiated film. The single-scan protocol was scanned 30 min after film irradiation. The EBT3 calibration curves were obtained with the multichannel film dosimetry method. The dose verifications for each protocol were performed with the step pattern, pyramid pattern, and clinical treatment plans for intensity-modulated radiation therapy (IMRT). The absolute dose distributions for each protocol were compared with those calculated by the treatment planning system (TPS) using gamma evaluation at 3% and 3 mm. The dose distribution for the single-scan protocol was within 2% of the 24-hr protocol dose distribution. For the step pattern, the absolute dose discrepancies between the TPS for the single-scan and 24-hr protocols were 2.0 ± 1.8 cGy and 1.4 ± 1.2 cGy at the dose plateau, respectively. The pass rates were 96.0% for the single-scan protocol and 95.9% for the 24-hr protocol. Similarly, the dose discrepancies for the pyramid pattern were 3.6 ± 3.5cGy and 2.9 ± 3.3 cGy, respectively, while the pass rates for the pyramid pattern were 95.3% and 96.4%, respectively. The average pass rates for the four IMRT plans were 96.7% ± 1.8% for the single-scan protocol and 97.3% ± 1.4% for the 24-hr protocol. Thus, the single-scan protocol measurement is useful for dose verification of IMRT, based on its accuracy and efficiency.

Evaluation of a single‐scan protocol for radiochromic film dosimetry

PubMed Central

Araki, Fujio; Maruyama, Masato; Nakaguchi, Yuji; Kuwahara, Satoshi; Nagasue, Nozomu; Kai, Yudai

2015-01-01

The purpose of this study was to evaluate a single‐scan protocol using Gafchromic EBT3 film (EBT3) by comparing it with the commonly used 24‐hr measurement protocol for radiochromic film dosimetry. Radiochromic film is generally scanned 24 hr after film exposure (24‐hr protocol). The single‐scan protocol enables measurement results within a short time using only the verification film, one calibration film, and unirradiated film. The single‐scan protocol was scanned 30 min after film irradiation. The EBT3 calibration curves were obtained with the multichannel film dosimetry method. The dose verifications for each protocol were performed with the step pattern, pyramid pattern, and clinical treatment plans for intensity‐modulated radiation therapy (IMRT). The absolute dose distributions for each protocol were compared with those calculated by the treatment planning system (TPS) using gamma evaluation at 3% and 3 mm. The dose distribution for the single‐scan protocol was within 2% of the 24‐hr protocol dose distribution. For the step pattern, the absolute dose discrepancies between the TPS for the single‐scan and 24‐hr protocols were 2.0±1.8 cGy and 1.4±1.2 cGy at the dose plateau, respectively. The pass rates were 96.0% for the single‐scan protocol and 95.9% for the 24‐hr protocol. Similarly, the dose discrepancies for the pyramid pattern were 3.6±3.5 cGy and 2.9±3.3 cGy, respectively, while the pass rates for the pyramid pattern were 95.3% and 96.4%, respectively. The average pass rates for the four IMRT plans were 96.7%±1.8% for the single‐scan protocol and 97.3%±1.4% for the 24‐hr protocol. Thus, the single‐scan protocol measurement is useful for dose verification of IMRT, based on its accuracy and efficiency. PACS number: 87.55.Qr PMID:26103194

Semi-quantum Dialogue Based on Single Photons

NASA Astrophysics Data System (ADS)

Ye, Tian-Yu; Ye, Chong-Qiang

2018-02-01

In this paper, we propose two semi-quantum dialogue (SQD) protocols by using single photons as the quantum carriers, where one requires the classical party to possess the measurement capability and the other does not have this requirement. The security toward active attacks from an outside Eve in the first SQD protocol is guaranteed by the complete robustness of present semi-quantum key distribution (SQKD) protocols, the classical one-time pad encryption, the classical party's randomization operation and the decoy photon technology. The information leakage problem of the first SQD protocol is overcome by the classical party' classical basis measurements on the single photons carrying messages which makes him share their initial states with the quantum party. The security toward active attacks from Eve in the second SQD protocol is guaranteed by the classical party's randomization operation, the complete robustness of present SQKD protocol and the classical one-time pad encryption. The information leakage problem of the second SQD protocol is overcome by the quantum party' classical basis measurements on each two adjacent single photons carrying messages which makes her share their initial states with the classical party. Compared with the traditional information leakage resistant QD protocols, the advantage of the proposed SQD protocols lies in that they only require one party to have quantum capabilities. Compared with the existing SQD protocol, the advantage of the proposed SQD protocols lies in that they only employ single photons rather than two-photon entangled states as the quantum carriers. The proposed SQD protocols can be implemented with present quantum technologies.

Terrorism Risk Insurance Program Reauthorization Act of 2014

THOMAS, 113th Congress

Sen. Schumer, Charles E. [D-NY

2014-04-10

Senate - 12/11/2014 Message on House action received in Senate and at desk: House amendment to Senate bill. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Electronic Message Preservation Act

THOMAS, 111th Congress

Rep. Hodes, Paul W. [D-NH-2

2009-03-09

Senate - 03/18/2010 Received in the Senate and Read twice and referred to the Committee on Homeland Security and Governmental Affairs. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Federal Financial Assistance Management Improvement Act of 2009

THOMAS, 111th Congress

Sen. Voinovich, George V. [R-OH

2009-01-22

Senate - 12/15/2009 Message on House action received in Senate and at desk: House amendment to Senate bill. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Messaging to Increase Public Support for Naloxone Distribution Policies in the United States: Results from a Randomized Survey Experiment.

PubMed

Bachhuber, Marcus A; McGinty, Emma E; Kennedy-Hendricks, Alene; Niederdeppe, Jeff; Barry, Colleen L

2015-01-01

Barriers to public support for naloxone distribution include lack of knowledge, concerns about potential unintended consequences, and lack of sympathy for people at risk of overdose. A randomized survey experiment was conducted with a nationally-representative web-based survey research panel (GfK KnowledgePanel). Participants were randomly assigned to read different messages alone or in combination: 1) factual information about naloxone; 2) pre-emptive refutation of potential concerns about naloxone distribution; and 3) a sympathetic narrative about a mother whose daughter died of an opioid overdose. Participants were then asked if they support or oppose policies related to naloxone distribution. For each policy item, logistic regression models were used to test the effect of each message exposure compared with the no-exposure control group. The final sample consisted of 1,598 participants (completion rate: 72.6%). Factual information and the sympathetic narrative alone each led to higher support for training first responders to use naloxone, providing naloxone to friends and family members of people using opioids, and passing laws to protect people who administer naloxone. Participants receiving the combination of the sympathetic narrative and factual information, compared to factual information alone, were more likely to support all policies: providing naloxone to friends and family members (OR: 2.0 [95% CI: 1.4 to 2.9]), training first responders to use naloxone (OR: 2.0 [95% CI: 1.2 to 3.4]), passing laws to protect people if they administer naloxone (OR: 1.5 [95% CI: 1.04 to 2.2]), and passing laws to protect people if they call for medical help for an overdose (OR: 1.7 [95% CI: 1.2 to 2.5]). All messages increased public support, but combining factual information and the sympathetic narrative was most effective. Public support for naloxone distribution can be improved through education and sympathetic portrayals of the population who stands to benefit from these policies.

Parallelization of KENO-Va Monte Carlo code

NASA Astrophysics Data System (ADS)

Ramón, Javier; Peña, Jorge

1995-07-01

KENO-Va is a code integrated within the SCALE system developed by Oak Ridge that solves the transport equation through the Monte Carlo Method. It is being used at the Consejo de Seguridad Nuclear (CSN) to perform criticality calculations for fuel storage pools and shipping casks. Two parallel versions of the code: one for shared memory machines and other for distributed memory systems using the message-passing interface PVM have been generated. In both versions the neutrons of each generation are tracked in parallel. In order to preserve the reproducibility of the results in both versions, advanced seeds for random numbers were used. The CONVEX C3440 with four processors and shared memory at CSN was used to implement the shared memory version. A FDDI network of 6 HP9000/735 was employed to implement the message-passing version using proprietary PVM. The speedup obtained was 3.6 in both cases.

Statistical analysis of loopy belief propagation in random fields

NASA Astrophysics Data System (ADS)

Yasuda, Muneki; Kataoka, Shun; Tanaka, Kazuyuki

2015-10-01

Loopy belief propagation (LBP), which is equivalent to the Bethe approximation in statistical mechanics, is a message-passing-type inference method that is widely used to analyze systems based on Markov random fields (MRFs). In this paper, we propose a message-passing-type method to analytically evaluate the quenched average of LBP in random fields by using the replica cluster variation method. The proposed analytical method is applicable to general pairwise MRFs with random fields whose distributions differ from each other and can give the quenched averages of the Bethe free energies over random fields, which are consistent with numerical results. The order of its computational cost is equivalent to that of standard LBP. In the latter part of this paper, we describe the application of the proposed method to Bayesian image restoration, in which we observed that our theoretical results are in good agreement with the numerical results for natural images.

Message-passing-interface-based parallel FDTD investigation on the EM scattering from a 1-D rough sea surface using uniaxial perfectly matched layer absorbing boundary.

PubMed

Li, J; Guo, L-X; Zeng, H; Han, X-B

2009-06-01

A message-passing-interface (MPI)-based parallel finite-difference time-domain (FDTD) algorithm for the electromagnetic scattering from a 1-D randomly rough sea surface is presented. The uniaxial perfectly matched layer (UPML) medium is adopted for truncation of FDTD lattices, in which the finite-difference equations can be used for the total computation domain by properly choosing the uniaxial parameters. This makes the parallel FDTD algorithm easier to implement. The parallel performance with different processors is illustrated for one sea surface realization, and the computation time of the parallel FDTD algorithm is dramatically reduced compared to a single-process implementation. Finally, some numerical results are shown, including the backscattering characteristics of sea surface for different polarization and the bistatic scattering from a sea surface with large incident angle and large wind speed.

Text messaging to support a perinatal collaborative care model for depression: A multi-methods inquiry.

PubMed

Bhat, Amritha; Mao, Johnny; Unützer, Jürgen; Reed, Susan; Unger, Jennifer

Mental health care integrated into obstetric settings improves access to perinatal depression treatments. Digital interactions such as text messaging between patient and provider can further improve access. We describe the use of text messaging within a perinatal Collaborative Care (CC) program, and explore the association of text messaging content with perinatal depression outcomes. We analyzed data from an open treatment trial of perinatal CC in a rural obstetric clinic. Twenty five women with Patient Health Questionnaire-9 score of ≥10 enrolled in CC, and used text messaging to communicate with their Care Manager(CM). We used surveys and focus groups to assessacceptability of text messaging with surveys and focus groups. We calculated the number of text messages exchanged, and analyzed content to understand usage patterns. We explored association between text messaging content and depression outcomes. CMs initiated 85.4% messages, and patients responded to 86.9% messages. CMs used text messaging for appointment reminders, and patients used it to obtain obstetric and parenting information. CMs had concerns about the likelihood of boundary violations. Patients appreciated the asynchronous nature of text messaging. Text messaging is feasible and acceptable within a perinatal CC program. We need further research into the effectiveness of text messaging content, and response protocols. Copyright © 2018 Elsevier Inc. All rights reserved.

Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments.

PubMed

Ayub, Qaisar; Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio.

Priority Queue Based Reactive Buffer Management Policy for Delay Tolerant Network under City Based Environments

PubMed Central

Ngadi, Asri; Rashid, Sulma; Habib, Hafiz Adnan

2018-01-01

Delay Tolerant Network (DTN) multi-copy routing protocols are privileged to create and transmit multiple copies of each message that causes congestion and some messages are dropped. This process is known as reactive drop because messages were dropped re-actively to overcome buffer overflows. The existing reactive buffer management policies apply a single metric to drop source, relay and destine messages. Hereby, selection to drop a message is dubious because each message as source, relay or destine may have consumed dissimilar magnitude of network resources. Similarly, DTN has included time to live (ttl) parameter which defines lifetime of message. Hence, when ttl expires then message is automatically destroyed from relay nodes. However, time-to-live (ttl) is not applicable on messages reached at their destinations. Moreover, nodes keep replicating messages till ttl expires even-though large number of messages has already been dispersed. In this paper, we have proposed Priority Queue Based Reactive Buffer Management Policy (PQB-R) for DTN under City Based Environments. The PQB-R classifies buffered messages into source, relay and destine queues. Moreover, separate drop metric has been applied on individual queue. The experiment results prove that proposed PQB-R has reduced number of messages transmissions, message drop and increases delivery ratio. PMID:29438438

Optimising text messaging to improve adherence to web-based smoking cessation treatment: a randomised control trial protocol

PubMed Central

Graham, Amanda L; Jacobs, Megan A; Cohn, Amy M; Cha, Sarah; Abroms, Lorien C; Papandonatos, George D; Whittaker, Robyn

2016-01-01

Introduction Millions of smokers use the Internet for smoking cessation assistance each year; however, most smokers engage minimally with even the best designed websites. The ubiquity of mobile devices and their effectiveness in promoting adherence in other areas of health behaviour change make them a promising tool to address adherence in Internet smoking cessation interventions. Text messaging is used by most adults, and messages can proactively encourage use of a web-based intervention. Text messaging can also be integrated with an Internet intervention to facilitate the use of core Internet intervention components. Methods and analysis We identified four aspects of a text message intervention that may enhance its effectiveness in promoting adherence to a web-based smoking cessation programme: personalisation, integration, dynamic tailoring and message intensity. Phase I will use a two-level full factorial design to test the impact of these four experimental features on adherence to a web-based intervention. The primary outcome is a composite metric of adherence that incorporates general utilisation metrics (eg, logins, page views) and specific feature utilisation shown to predict abstinence. Participants will be N=860 adult smokers who register on an established Internet cessation programme and enrol in its text message programme. Phase II will be a two-arm randomised trial to compare the efficacy of the web-based cessation programme alone and in conjunction with the optimised text messaging intervention on 30-day point prevalence abstinence at 9 months. Phase II participants will be N=600 adult smokers who register to use an established Internet cessation programme and enrol in text messaging. Secondary analyses will explore whether adherence mediates the effect of treatment condition on outcome. Ethics and dissemination This protocol was approved by Chesapeake IRB. We will disseminate study results through peer-reviewed manuscripts and conference presentations related to the methods and design, outcomes and exploratory analyses. Trial registration number NCT02585206. PMID:27029775

Net Results: Online Protocols Boost Group Learning Potential

ERIC Educational Resources Information Center

Dichter, Alan; Zydney, Janet Mannheimer

2015-01-01

Educators have begun to use protocols to facilitate professional development in online spaces--partly because people need to connect from different places, but also to take advantage of new environments for learning. For example, asynchronous tools, such as discussion forums, blogs, or Google+, where participants post messages to one another at…

Security Protocol Verification and Optimization by Epistemic Model Checking

DTIC Science & Technology

2010-11-05

Three cryptographers are sitting down to dinner at their favourite restau- rant. Their waiter informs them that arrangements have been made with the...Unfortunately, the protocol cannot be expected to satisfy this: suppose that all agents manage to broadcast their mes- sage and all messages have the

The Effects on Soccer Passing Skills When Warming Up with Two Different Sized Soccer Balls

ERIC Educational Resources Information Center

Burcak, Keskin

2015-01-01

The purpose of the present research is studying the effects of warm-up with two different sizes of balls on passing skills. Loughborough Soccer Passing Test (LSPT) was conducted on 28 non-elite football players, who participated in the present research for 10 training days. LSPT is a passing skill protocol established on completing 16 passes…

Secret-key expansion from covert communication

NASA Astrophysics Data System (ADS)

Arrazola, Juan Miguel; Amiri, Ryan

2018-02-01

Covert communication allows the transmission of messages in such a way that it is not possible for adversaries to detect that the communication is occurring. This provides protection in situations where knowledge that two parties are talking to each other may be incriminating to them. In this work, we study how covert communication can be used for a different purpose: secret key expansion. First, we show that any message transmitted in a secure covert protocol is also secret and therefore unknown to an adversary. We then propose a covert communication protocol where the amount of key consumed in the protocol is smaller than the transmitted key, thus leading to secure secret key expansion. We derive precise conditions for secret key expansion to occur, showing that it is possible when there are sufficiently low levels of noise for a given security level. We conclude by examining how secret key expansion from covert communication can be performed in a computational security model.

Achieving fast and stable failure detection in WDM Networks

NASA Astrophysics Data System (ADS)

Gao, Donghui; Zhou, Zhiyu; Zhang, Hanyi

2005-02-01

In dynamic networks, the failure detection time takes a major part of the convergence time, which is an important network performance index. To detect a node or link failure in the network, traditional protocols, like Hello protocol in OSPF or RSVP, exchanges keep-alive messages between neighboring nodes to keep track of the link/node state. But by default settings, it can get a minimum detection time in the measure of dozens of seconds, which can not meet the demands of fast network convergence and failure recovery. When configuring the related parameters to reduce the detection time, there will be notable instability problems. In this paper, we analyzed the problem and designed a new failure detection algorithm to reduce the network overhead of detection signaling. Through our experiment we found it is effective to enhance the stability by implicitly acknowledge other signaling messages as keep-alive messages. We conducted our proposal and the previous approaches on the ASON test-bed. The experimental results show that our algorithm gives better performances than previous schemes in about an order magnitude reduction of both false failure alarms and queuing delay to other messages, especially under light traffic load.

Network Analysis with SiLK

DTIC Science & Technology

2015-01-06

Carnegie Mellon University rwcut Default Display By default • sIP , sPort • dIP, dPort • protocol • packets, bytes • flags • sTime, eTime, duration...TCP/IP SOCKET IP address: 10.0.0.1 L4 protocol : TCP High-numbered ephemeral port # TCP/IP SOCKET IP address: 203.0.113.1 L4 protocol : TCP Low-numbered...Fields found to be useful in analysis: • source address, destination address • source port, destination port (Internet Control Message Protocol

The Use of Social Networking Sites (SNSs) in Health Communication Campaigns: Review and Recommendations.

PubMed

Shi, Jingyuan; Poorisat, Thanomwong; Salmon, Charles T

2018-01-01

The past decade has witnessed a rapid increase in the use of Social Networking Sites (SNSs) in health communication campaigns seeking to achieve an ambitious range of health-related impacts. This article provides a review of 40 studies and research protocols, with a focus on two key factors that differentiate SNSs from more traditional health communication approaches of the past. The first is the potential dualism between message sender and receiver, in which receivers become receiver-sources who forward and amplify the content and reach of health messages. The second is the potential dualism between message and message impact, in which the act of forwarding and modifying messages by receiver-sources itself becomes a measure of message impact. Each of these dualisms has implications for the design and evaluation of contemporary health communication campaigns. The review concludes with a series of observations and recommendations for future health communication research.

Knowledge and skill retention of a mobile phone data collection protocol in rural Liberia.

PubMed

Munro, Michelle L; Lori, Jody R; Boyd, Carol J; Andreatta, Pamela

2014-01-01

With a large number of births occurring outside the formal health system, it is difficult to determine the number of pregnant women in rural regions of Liberia. The exponential growth of mobile phone use in developing countries provides a potential avenue for data collection on maternal and child health in such rural, remote regions. A pre-, post-, and one-year posttest design was used to collect data on knowledge and skill retention for 7 essential items required for mobile phone use among traditional birth attendants (TBAs) trained in a short message service (SMS) texting data collection protocol (N = 99) in rural Liberia. Sixty-three participants (63.6% retention) completed the one-year posttest and displayed evidence of statistically significant knowledge and skill retention in 6 of the 7 tasks (P < .005), including the ability to: 1) turn on the phone, 2) use the mobile phone to make a call, 3) recognize that they have coverage, 4) recognize that the mobile phone is charged, 5) create a SMS text message without help, and 6) send a SMS text message without help. The TBAs continued to have difficulty with more complex tasks such as adding minutes to a phone. The mobile phone data-collection protocol proved feasible with TBAs demonstrating knowledge retention in a one-year posttest; however, clinical significance needs further investigation. The protocol increased communication and collaboration among TBAs, certified midwives, and clinic staff. © 2014 by the American College of Nurse-Midwives.

Patient privacy protection using anonymous access control techniques.

PubMed

Weerasinghe, D; Rajarajan, M; Elmufti, K; Rakocevic, V

2008-01-01

The objective of this study is to develop a solution to preserve security and privacy in a healthcare environment where health-sensitive information will be accessed by many parties and stored in various distributed databases. The solution should maintain anonymous medical records and it should be able to link anonymous medical information in distributed databases into a single patient medical record with the patient identity. In this paper we present a protocol that can be used to authenticate and authorize patients to healthcare services without providing the patient identification. Healthcare service can identify the patient using separate temporary identities in each identification session and medical records are linked to these temporary identities. Temporary identities can be used to enable record linkage and reverse track real patient identity in critical medical situations. The proposed protocol provides main security and privacy services such as user anonymity, message privacy, message confidentiality, user authentication, user authorization and message replay attacks. The medical environment validates the patient at the healthcare service as a real and registered patient for the medical services. Using the proposed protocol, the patient anonymous medical records at different healthcare services can be linked into one single report and it is possible to securely reverse track anonymous patient into the real identity. The protocol protects the patient privacy with a secure anonymous authentication to healthcare services and medical record registries according to the European and the UK legislations, where the patient real identity is not disclosed with the distributed patient medical records.

Detection of single-copy functional genes in prokaryotic cells by two-pass TSA-FISH with polynucleotide probes.

PubMed

Kawakami, Shuji; Hasegawa, Takuya; Imachi, Hiroyuki; Yamaguchi, Takashi; Harada, Hideki; Ohashi, Akiyoshi; Kubota, Kengo

2012-02-01

In situ detection of functional genes with single-cell resolution is currently of interest to microbiologists. Here, we developed a two-pass tyramide signal amplification (TSA)-fluorescence in situ hybridization (FISH) protocol with PCR-derived polynucleotide probes for the detection of single-copy genes in prokaryotic cells. The mcrA gene and the apsA gene in methanogens and sulfate-reducing bacteria, respectively, were targeted. The protocol showed bright fluorescence with a good signal-to-noise ratio and achieved a high efficiency of detection (>98%). The discrimination threshold was approximately 82-89% sequence identity. Microorganisms possessing the mcrA or apsA gene in anaerobic sludge samples were successfully detected by two-pass TSA-FISH with polynucleotide probes. The developed protocol is useful for identifying single microbial cells based on functional gene sequences. Copyright © 2011 Elsevier B.V. All rights reserved.

Message passing with queues and channels

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer

In an embodiment, a send thread receives an identifier that identifies a destination node and a pointer to data. The send thread creates a first send request in response to the receipt of the identifier and the data pointer. The send thread selects a selected channel from among a plurality of channels. The selected channel comprises a selected hand-off queue and an identification of a selected message unit. Each of the channels identifies a different message unit. The selected hand-off queue is randomly accessible. If the selected hand-off queue contains an available entry, the send thread adds the first sendmore » request to the selected hand-off queue. If the selected hand-off queue does not contain an available entry, the send thread removes a second send request from the selected hand-off queue and sends the second send request to the selected message unit.« less

Development of Participant-Informed Text Messages to Promote Physical Activity Among African American Women Attending College: A Qualitative Mixed-Methods Inquiry.

PubMed

Reese, Jasmine M; Joseph, Rodney P; Cherrington, Andrea; Allison, Jeroan; Kim, Young-Il; Spear, Bonnie; Childs, Gwendolyn; Simpson, Tina; Durant, Nefertiti H

2017-05-01

The purpose of this study was to develop a participant-informed technology-based physical activity (PA) promotion tool for young overweight and obese African American (AA) women. A mixed-method 3-phase study protocol design was used to develop text messages to promote PA in AA women attending the University of Alabama at Birmingham during the Spring of 2013. Nominal focus groups and a 2-week pilot were used to generate and test participant-developed messages. Participants ( n = 14) had a mean age of 19.79 years ( SD = 1.4) and mean body mass index of 35.9 ( SD = 5.926). Focus group data identified key themes associated with the use of text messages to promote PA including message frequency, length, tone, and time of day. Participants preferred text messages that were brief, specific, and time sensitive. Results showed that text messaging was a feasible and acceptable strategy to promote PA in overweight and obese AA women in a university setting.

Event Driven Messaging with Role-Based Subscriptions

NASA Technical Reports Server (NTRS)

Bui, Tung; Bui, Bach; Malhotra, Shantanu; Chen, Fannie; Kim, rachel; Allen, Christopher; Luong, Ivy; Chang, George; Zendejas, Silvino; Sadaqathulla, Syed

2009-01-01

Event Driven Messaging with Role-Based Subscriptions (EDM-RBS) is a framework integrated into the Service Management Database (SMDB) to allow for role-based and subscription-based delivery of synchronous and asynchronous messages over JMS (Java Messaging Service), SMTP (Simple Mail Transfer Protocol), or SMS (Short Messaging Service). This allows for 24/7 operation with users in all parts of the world. The software classifies messages by triggering data type, application source, owner of data triggering event (mission), classification, sub-classification and various other secondary classifying tags. Messages are routed to applications or users based on subscription rules using a combination of the above message attributes. This program provides a framework for identifying connected users and their applications for targeted delivery of messages over JMS to the client applications the user is logged into. EDMRBS provides the ability to send notifications over e-mail or pager rather than having to rely on a live human to do it. It is implemented as an Oracle application that uses Oracle relational database management system intrinsic functions. It is configurable to use Oracle AQ JMS API or an external JMS provider for messaging. It fully integrates into the event-logging framework of SMDB (Subnet Management Database).

Messages discriminated from the media about illicit drugs.

PubMed

Patterson, S J

1994-01-01

The electronic media have been an instrumental tool in the most recent efforts to address the issue of illicit drug abuse in the United States. Messages about illicit drugs appear in three places in the media: advertising content, news content, and entertainment content. Many studies have documented the amount and types of messages that appear on the electronic media, but few have asked the audience how they interpret these messages. The purpose of this study is to investigate how much and what type of information college students receive from the media about drugs. Interviews were conducted with 228 students using the message discrimination protocol. The messages were then content analyzed into theme areas. Results indicate the majority of messages discriminated from advertising content were fear appeals; that the majority of messages discriminated from news content documented the enforcement efforts in the war on drugs; and that messages about drugs in entertainment content were more likely to provide clear accurate information about drugs than the other two content sources. The results are discussed in terms of the audience receiving fear and fight messages from the electronic media rather than clear, accurate information necessary to make informed decisions about drugs.

Lightweight CoAP-Based Bootstrapping Service for the Internet of Things.

PubMed

Garcia-Carrillo, Dan; Marin-Lopez, Rafael

2016-03-11

The Internet of Things (IoT) is becoming increasingly important in several fields of industrial applications and personal applications, such as medical e-health, smart cities, etc. The research into protocols and security aspects related to this area is continuously advancing in making these networks more reliable and secure, taking into account these aspects by design. Bootstrapping is a procedure by which a user obtains key material and configuration information, among other parameters, to operate as an authenticated party in a security domain. Until now solutions have focused on re-using security protocols that were not developed for IoT constraints. For this reason, in this work we propose a design and implementation of a lightweight bootstrapping service for IoT networks that leverages one of the application protocols used in IoT : Constrained Application Protocol (CoAP). Additionally, in order to provide flexibility, scalability, support for large scale deployment, accountability and identity federation, our design uses technologies such as the Extensible Authentication Protocol (EAP) and Authentication Authorization and Accounting (AAA). We have named this service CoAP-EAP. First, we review the state of the art in the field of bootstrapping and specifically for IoT. Second, we detail the bootstrapping service: the architecture with entities and interfaces and the flow operation. Third, we obtain performance measurements of CoAP-EAP (bootstrapping time, memory footprint, message processing time, message length and energy consumption) and compare them with PANATIKI. The most significant and constrained representative of the bootstrapping solutions related with CoAP-EAP. As we will show, our solution provides significant improvements, mainly due to an important reduction of the message length.

Lightweight CoAP-Based Bootstrapping Service for the Internet of Things

PubMed Central

Garcia-Carrillo, Dan; Marin-Lopez, Rafael

2016-01-01

The Internet of Things (IoT) is becoming increasingly important in several fields of industrial applications and personal applications, such as medical e-health, smart cities, etc. The research into protocols and security aspects related to this area is continuously advancing in making these networks more reliable and secure, taking into account these aspects by design. Bootstrapping is a procedure by which a user obtains key material and configuration information, among other parameters, to operate as an authenticated party in a security domain. Until now solutions have focused on re-using security protocols that were not developed for IoT constraints. For this reason, in this work we propose a design and implementation of a lightweight bootstrapping service for IoT networks that leverages one of the application protocols used in IoT : Constrained Application Protocol (CoAP). Additionally, in order to provide flexibility, scalability, support for large scale deployment, accountability and identity federation, our design uses technologies such as the Extensible Authentication Protocol (EAP) and Authentication Authorization and Accounting (AAA). We have named this service CoAP-EAP. First, we review the state of the art in the field of bootstrapping and specifically for IoT. Second, we detail the bootstrapping service: the architecture with entities and interfaces and the flow operation. Third, we obtain performance measurements of CoAP-EAP (bootstrapping time, memory footprint, message processing time, message length and energy consumption) and compare them with PANATIKI. The most significant and constrained representative of the bootstrapping solutions related with CoAP-EAP. As we will show, our solution provides significant improvements, mainly due to an important reduction of the message length. PMID:26978362

An Improved Quantum Information Hiding Protocol Based on Entanglement Swapping of χ-type Quantum States

NASA Astrophysics Data System (ADS)

Xu, Shu-Jiang; Chen, Xiu-Bo; Wang, Lian-Hai; Ding, Qing-Yan; Zhang, Shu-Hui

2016-06-01

In 2011, Qu et al. proposed a quantum information hiding protocol based on the entanglement swapping of χ-type quantum states. Because a χ-type state can be described by the 4-particle cat states which have good symmetry, the possible output results of the entanglement swapping between a given χ-type state and all of the 16 χ-type states are divided into 8 groups instead of 16 groups of different results when the global phase is not considered. So it is difficult to read out the secret messages since each result occurs twice in each line (column) of the secret messages encoding rule for the original protocol. In fact, a 3-bit instead of a 4-bit secret message can be encoded by performing two unitary transformations on 2 particles of a χ-type quantum state in the original protocol. To overcome this defect, we propose an improved quantum information hiding protocol based on the general term formulas of the entanglement swapping among χ-type states. Supported by the National Natural Science Foundation of China under Grant Nos. 61572297, 61303199, 61272514, and 61373131, the Shandong Provincial Natural Science Foundation of China under Grant Nos. ZR2013FM025, ZR2013FQ001, ZR2014FM003, and ZY2015YL018, the Shandong Provincial Outstanding Research Award Fund for Young Scientists of China under Grant Nos. BS2015DX006 and BS2014DX007, the National Development Foundation for Cryptological Research, China under Grant No. MMJJ201401012, the Priority Academic Program Development of Jiangsu Higher Education Institutions and Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology Funds, and the Shandong Academy of Sciences Youth Fund Project, China under Grant Nos. 2015QN003 and 2013QN007

Scalable Optical-Fiber Communication Networks

NASA Technical Reports Server (NTRS)

Chow, Edward T.; Peterson, John C.

1993-01-01

Scalable arbitrary fiber extension network (SAFEnet) is conceptual fiber-optic communication network passing digital signals among variety of computers and input/output devices at rates from 200 Mb/s to more than 100 Gb/s. Intended for use with very-high-speed computers and other data-processing and communication systems in which message-passing delays must be kept short. Inherent flexibility makes it possible to match performance of network to computers by optimizing configuration of interconnections. In addition, interconnections made redundant to provide tolerance to faults.

Domestic Minor Sex Trafficking Deterrence and Victims Support Act of 2010

THOMAS, 111th Congress

Sen. Wyden, Ron [D-OR

2009-12-22

Senate - 12/21/2010 Message on House action received in Senate and at desk: House amendment to Senate bill. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Testing a TheoRY-inspired MEssage ('TRY-ME'): a sub-trial within the Ontario Printed Educational Message (OPEM) trial

PubMed Central

Francis, Jillian J; Grimshaw, Jeremy M; Zwarenstein, Merrick; Eccles, Martin P; Shiller, Susan; Godin, Gaston; Johnston, Marie; O'Rourke, Keith; Presseau, Justin; Tetroe, Jacqueline

2007-01-01

Background A challenge for implementation researchers is to develop principles that could generate testable hypotheses that apply across a range of clinical contexts, thus leading to generalisability of findings. Such principles may be provided by systematically developed theories. The opportunity has arisen to test some of these theoretical principles in the Ontario Printed Educational Materials (OPEM) trial by conducting a sub-trial within the existing trial structure. OPEM is a large factorial cluster-randomised trial evaluating the effects of short directive and long discursive educational messages embedded into informed, an evidence-based newsletter produced in Canada by the Institute for Clinical Evaluative Sciences (ICES) and mailed to all primary care physicians in Ontario. The content of educational messages in the sub-trial will be constructed using both standard methods and methods inspired by psychological theory. The aim of this study is to test the effectiveness of the TheoRY-inspired MEssage ('TRY-ME') compared with the 'standard' message in changing prescribing behaviour. Methods The OPEM trial participants randomised to receive the short directive message attached to the outside of informed (an 'outsert') will be sub-randomised to receive either a standard message or a message informed by the theory of planned behaviour (TPB) using a two (long insert or no insert) by three (theory-based outsert or standard outsert or no outsert) design. The messages will relate to prescription of thiazide diuretics as first line drug treatment for hypertension (described in the accompanying protocol, "The Ontario Printed Educational Materials trial"). The short messages will be developed independently by two research teams. The primary outcome is prescription of thiazide diuretics, measured by routinely collected data available within ICES. The study is designed to answer the question, is there any difference in guideline adherence (i.e., thiazide prescription rates) between physicians in the six groups? A process evaluation survey instrument based on the TPB will be administered pre- and post-intervention (described in the accompanying protocol, "Looking inside the black box"). The second research question concerns processes that may underlie observed differences in prescribing behaviour. We expect that effects of the messages on prescribing behaviour will be mediated through changes in physicians' cognitions. Trial registration number Current controlled trial ISRCTN72772651 PMID:18039363

Design and validation of key text messages (Tonsil-Text-To-Me) to improve parent and child perioperative tonsillectomy experience: A modified Delphi study.

PubMed

Song, Jin Soo A; Wozney, Lori; Chorney, Jill; Ishman, Stacey L; Hong, Paul

2017-11-01

Parents can struggle while providing perioperative tonsillectomy care for their children at home. Short message service (SMS) technology is an accessible and direct modality to communicate timely, evidence-based recommendations to parents across the perioperative period. This study focused on validating a SMS protocol, Tonsil-Text-To-Me (TTTM), for parents of children undergoing tonsillectomy. This study used a modified Delphi expert consensus method. Participants were an international sample of 27 clinicians/researchers. Participants rated level of agreement with recommendations across seven perioperative domains, derived systematically from scientific and lay literature. A priori consensus analysis was conducted using threshold criterion. A multidisciplinary team of local clinicians were also individually interviewed to consolidate text messages and implement recurrent suggestions. In the modified Delphi panel, 30 statements reached threshold agreement (>3.0 of 4.0); recommendations surrounding diet (3.87) and hygiene (3.83) had the highest level of consensus, while recommendations regarding activity (3.42) and non-pharmacologic pain management (3.55) had the lowest consensus. The 30 statements reconfigured into 12 concise text messages. After further interviews with local clinicians, 14 final text messages were included in the SMS protocol to be sent two weeks preoperatively to one week postoperatively. This study illustrates the development of TTTM which is designed to deliver key sequential text messages at the optimal time during the perioperative setting to parents caring for their children who are undergoing tonsillectomy. Copyright © 2017 Elsevier B.V. All rights reserved.

Fingerprinting Software Defined Networks and Controllers

DTIC Science & Technology

2015-03-01

24 2.5.3 Intrusion Prevention System with SDN . . . . . . . . . . . . . . . 25 2.5.4 Modular Security Services...Control Message Protocol IDS Intrusion Detection System IPS Intrusion Prevention System ISP Internet Service Provider LLDP Link Layer Discovery Protocol...layer functions (e.g., web proxies, firewalls, intrusion detection/prevention, load balancers, etc.). The increase in switch capabilities combined

Automatic Coding of Dialogue Acts in Collaboration Protocols

ERIC Educational Resources Information Center

Erkens, Gijsbert; Janssen, Jeroen

2008-01-01

Although protocol analysis can be an important tool for researchers to investigate the process of collaboration and communication, the use of this method of analysis can be time consuming. Hence, an automatic coding procedure for coding dialogue acts was developed. This procedure helps to determine the communicative function of messages in online…

Chaos synchronization communication using extremely unsymmetrical bidirectional injections.

PubMed

Zhang, Wei Li; Pan, Wei; Luo, Bin; Zou, Xi Hua; Wang, Meng Yao; Zhou, Zhi

2008-02-01

Chaos synchronization and message transmission between two semiconductor lasers with extremely unsymmetrical bidirectional injections (EUBIs) are discussed. By using EUBIs, synchronization is realized through injection locking. Numerical results show that if the laser subjected to strong injection serves as the receiver, chaos pass filtering (CPF) of the system is similar to that of unidirectional coupled systems. Moreover, if the other laser serves as the receiver, a stronger CPF can be obtained. Finally, we demonstrate that messages can be extracted successfully from either of the two transmission directions of the system.

Automation Framework for Flight Dynamics Products Generation

NASA Technical Reports Server (NTRS)

Wiegand, Robert E.; Esposito, Timothy C.; Watson, John S.; Jun, Linda; Shoan, Wendy; Matusow, Carla

2010-01-01

XFDS provides an easily adaptable automation platform. To date it has been used to support flight dynamics operations. It coordinates the execution of other applications such as Satellite TookKit, FreeFlyer, MATLAB, and Perl code. It provides a mechanism for passing messages among a collection of XFDS processes, and allows sending and receiving of GMSEC messages. A unified and consistent graphical user interface (GUI) is used for the various tools. Its automation configuration is stored in text files, and can be edited either directly or using the GUI.

The Deep Impact Network Experiment Operations Center Monitor and Control System

NASA Technical Reports Server (NTRS)

Wang, Shin-Ywan (Cindy); Torgerson, J. Leigh; Schoolcraft, Joshua; Brenman, Yan

2009-01-01

The Interplanetary Overlay Network (ION) software at JPL is an implementation of Delay/Disruption Tolerant Networking (DTN) which has been proposed as an interplanetary protocol to support space communication. The JPL Deep Impact Network (DINET) is a technology development experiment intended to increase the technical readiness of the JPL implemented ION suite. The DINET Experiment Operations Center (EOC) developed by JPL's Protocol Technology Lab (PTL) was critical in accomplishing the experiment. EOC, containing all end nodes of simulated spaces and one administrative node, exercised publish and subscribe functions for payload data among all end nodes to verify the effectiveness of data exchange over ION protocol stacks. A Monitor and Control System was created and installed on the administrative node as a multi-tiered internet-based Web application to support the Deep Impact Network Experiment by allowing monitoring and analysis of the data delivery and statistics from ION. This Monitor and Control System includes the capability of receiving protocol status messages, classifying and storing status messages into a database from the ION simulation network, and providing web interfaces for viewing the live results in addition to interactive database queries.

Three-party Quantum Secure Direct Communication with Single Photons in both Polarization and Spatial-mode Degrees of Freedom

NASA Astrophysics Data System (ADS)

Wang, LiLi; Ma, WenPing; Wang, MeiLing; Shen, DongSu

2016-05-01

We present an efficient three-party quantum secure direct communication (QSDC) protocol with single photos in both polarization and spatial-mode degrees of freedom. The three legal parties' messages can be encoded on the polarization and the spatial-mode states of single photons independently with desired unitary operations. A party can obtain the other two parties' messages simultaneously through a quantum channel. Because no extra public information is transmitted in the classical channels, the drawback of information leakage or classical correlation does not exist in the proposed scheme. Moreover, the comprehensive security analysis shows that the presented QSDC network protocol can defend the outsider eavesdropper's several sorts of attacks. Compared with the single photons with only one degree of freedom, our protocol based on the single photons in two degrees of freedom has higher capacity. Since the preparation and the measurement of single photon quantum states in both the polarization and the spatial-mode degrees of freedom are available with current quantum techniques, the proposed protocol is practical.

Mobile phone text messaging for improving the uptake of vaccinations: a systematic review protocol.

PubMed

Kalan, Robyn; Wiysonge, Charles S; Ramafuthole, Tshepiso; Allie, Kurt; Ebrahim, Fatima; Engel, Mark Emmanuel

2014-08-04

Low vaccine coverage is a major public health concern, the consequences of which contribute to around 1.5 million child deaths from vaccine-preventable diseases. Thus, innovative strategies to rapidly increase coverage and recall rates for vaccinations are urgently required. Mobile text messaging (or short messaging service, SMS) has the potential to help increase vaccination coverage and therefore we propose to conduct a review of the current best evidence for the use of SMS as an intervention to promote vaccination coverage. This article describes the protocol for a systematic review of the effectiveness of SMS in improving the uptake of vaccination. Primary and secondary outcomes of interest are prespecified. We will preferably include randomised controlled trials (RCTs). However, non-randomised studies (NRS) will be considered if there is an inadequate number of RCTs. We will search several bibliographic databases (eg,PubMed, EMBASE, CINAHL, CENTRAL, Science Citation Index, Africa-Wide Information and WHOLIS electronic databases and search sources for grey literature. Following data extraction and assessment of risk of bias, we will meta-analyse studies and conduct subgroup analyses, according to intervention subtypes. We will assess clinical heterogeneity and statistical heterogeneity. For outcomes without quantitative data, a descriptive analysis will be used. This review protocol is registered in the PROSPERO International Prospective Register of systematic reviews, registration number 2014:CRD42014007531 ETHICS AND DISSEMINATION: Ethics is not required for this study, given that this is a protocol for a systematic review, which uses published data. The findings of this study will be disseminated through peer-reviewed publications and conference presentations. We anticipate that the results could be used by researchers and policymakers to help inform them of the efficacy of mobile phone text messaging interventions to promote increased vaccination coverage. PROSPERO registration number 2014:CRD42014007531. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://group.bmj.com/group/rights-licensing/permissions.

Text messaging reminders for influenza vaccine in primary care: protocol for a cluster randomised controlled trial (TXT4FLUJAB).

PubMed

Herrett, Emily; van Staa, Tjeerd; Free, Caroline; Smeeth, Liam

2014-05-02

The UK government recommends that at least 75% of people aged under 64 with certain conditions receive an annual influenza vaccination. Primary care practices often fall short of this target and strategies to increase vaccine uptake are required. Text messaging reminders are already used in 30% of practices to remind patients about vaccination, but there has been no trial addressing their effectiveness in increasing influenza vaccine uptake in the UK. The aims of the study are (1) to develop the methodology for conducting cluster randomised trials of text messaging interventions utilising routine electronic health records and (2) to assess the effectiveness of using a text messaging influenza vaccine reminder in achieving an increase in influenza vaccine uptake in patients aged 18-64 with chronic conditions, compared with standard care. This cluster randomised trial will recruit general practices across three settings in English primary care (Clinical Practice Research Datalink, ResearchOne and London iPLATO text messaging software users) and randomise them to either standard care or a text messaging campaign to eligible patients. Flu vaccine uptake will be ascertained using routinely collected, anonymised electronic patient records. This protocol outlines the proposed study design and analysis methods. This study will determine the effectiveness of text messaging vaccine reminders in primary care in increasing influenza vaccine uptake, and will strengthen the methodology for using electronic health records in cluster randomised trials of text messaging interventions. This trial was approved by the Surrey Borders Ethics Committee (13/LO/0872). The trial results will be disseminated at national conferences and published in a peer-reviewed medical journal. The results will also be distributed to the Primary Care Research Network and to all participating general practices. This study is registered at controlled-trials.com ISRCTN48840025, July 2013.

Adolescents' receptivity to E-cigarette harms messages delivered using text messaging.

PubMed

Noar, Seth M; Rohde, Jacob A; Horvitz, Casey; Lazard, Allison J; Cornacchione Ross, Jennifer; Sutfin, Erin L

2018-06-02

E-cigarette use among adolescents has dramatically risen since 2011, yet little research has tested e-cigarette harms messages among adolescents. We conducted a pretest-posttest pilot study to examine adolescents' receptivity to e-cigarette health harms messages delivered using text messaging. N = 69 adolescents were enrolled in an 8-day pretest-posttest text messaging study. Participants completed a pretest survey on day one, were texted one of three e-cigarette health harms messages per day on days two through seven, and completed a posttest survey on day eight (88% retention). We assessed message ratings at posttest and knowledge, thoughts, and beliefs about e-cigarette harms at pretest and posttest. Adolescents rated the three messages favorably, with both the chemical and brain messages scoring higher than the nicotine message on fear arousal and perceived message effectiveness. More than one-third of adolescents showed the messages to others and talked to others about the messages. At posttest, knowledge about the harms of e-cigarettes, thinking about the risks of e-cigarettes, and perceived risks of e-cigarettes were all significantly higher compared to pretest (p < .05). Participants largely adhered to the text messaging protocol and found the study highly acceptable. This pilot study suggests that adolescents are receptive to e-cigarette health harms messages and that delivering such messages using text messaging is feasible and acceptable. Future research should systematically develop and test a broad set of e-cigarette health harms messages and examine their impact in a randomized controlled trial. Copyright © 2018 Elsevier Ltd. All rights reserved.

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

NASA Technical Reports Server (NTRS)

Mehra, Pankaj; VanVoorst, Brian; Yan, Jerry; Lum, Henry, Jr. (Technical Monitor)

1994-01-01

We present views and analysis of the execution of several PVM (Parallel Virtual Machine) codes for Computational Fluid Dynamics on a networks of Sparcstations, including: (1) NAS Parallel Benchmarks CG and MG; (2) a multi-partitioning algorithm for NAS Parallel Benchmark SP; and (3) an overset grid flowsolver. These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains: (1) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (2) Monitor, a library of runtime trace-collection routines; (3) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (4) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran 77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses XIIR5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (1) the impact of long message latencies; (2) the impact of multiprogramming overheads and associated load imbalance; (3) cache and virtual-memory effects; and (4) significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (1) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets: and (2) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

CDC WONDER: a cooperative processing architecture for public health.

PubMed Central

Friede, A; Rosen, D H; Reid, J A

1994-01-01

CDC WONDER is an information management architecture designed for public health. It provides access to information and communications without the user's needing to know the location of data or communication pathways and mechanisms. CDC WONDER users have access to extractions from some 40 databases; electronic mail (e-mail); and surveillance data processing. System components include the Remote Client, the Communications Server, the Queue Managers, and Data Servers and Process Servers. The Remote Client software resides in the user's machine; other components are at the Centers for Disease Control and Prevention (CDC). The Remote Client, the Communications Server, and the Applications Server provide access to the information and functions in the Data Servers and Process Servers. The system architecture is based on cooperative processing, and components are coupled via pure message passing, using several protocols. This architecture allows flexibility in the choice of hardware and software. One system limitation is that final results from some subsystems are obtained slowly. Although designed for public health, CDC WONDER could be useful for other disciplines that need flexible, integrated information exchange. PMID:7719813

Impact of the implementation of MPI point-to-point communications on the performance of two general sparse solvers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Amestoy, Patrick R.; Duff, Iain S.; L'Excellent, Jean-Yves

2001-10-10

We examine the mechanics of the send and receive mechanism of MPI and in particular how we can implement message passing in a robust way so that our performance is not significantly affected by changes to the MPI system. This leads us to using the Isend/Irecv protocol which will entail sometimes significant algorithmic changes. We discuss this within the context of two different algorithms for sparse Gaussian elimination that we have parallelized. One is a multifrontal solver called MUMPS, the other is a supernodal solver called SuperLU. Both algorithms are difficult to parallelize on distributed memory machines. Our initial strategiesmore » were based on simple MPI point-to-point communication primitives. With such approaches, the parallel performance of both codes are very sensitive to the MPI implementation, the way MPI internal buffers are used in particular. We then modified our codes to use more sophisticated nonblocking versions of MPI communication. This significantly improved the performance robustness (independent of the MPI buffering mechanism) and scalability, but at the cost of increased code complexity.« less

Securely Measuring the Overlap between Private Datasets with Cryptosets

PubMed Central

Swamidass, S. Joshua; Matlock, Matthew; Rozenblit, Leon

2015-01-01

Many scientific questions are best approached by sharing data—collected by different groups or across large collaborative networks—into a combined analysis. Unfortunately, some of the most interesting and powerful datasets—like health records, genetic data, and drug discovery data—cannot be freely shared because they contain sensitive information. In many situations, knowing if private datasets overlap determines if it is worthwhile to navigate the institutional, ethical, and legal barriers that govern access to sensitive, private data. We report the first method of publicly measuring the overlap between private datasets that is secure under a malicious model without relying on private protocols or message passing. This method uses a publicly shareable summary of a dataset’s contents, its cryptoset, to estimate its overlap with other datasets. Cryptosets approach “information-theoretic” security, the strongest type of security possible in cryptography, which is not even crackable with infinite computing power. We empirically and theoretically assess both the accuracy of these estimates and the security of the approach, demonstrating that cryptosets are informative, with a stable accuracy, and secure. PMID:25714898

Research in Parallel Algorithms and Software for Computational Aerosciences

NASA Technical Reports Server (NTRS)

Domel, Neal D.

1996-01-01

Phase I is complete for the development of a Computational Fluid Dynamics parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Research in Parallel Algorithms and Software for Computational Aerosciences

NASA Technical Reports Server (NTRS)

Domel, Neal D.

1996-01-01

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

The Integrated Safety-Critical Advanced Avionics Communication and Control (ISAACC) System Concept: Infrastructure for ISHM

NASA Technical Reports Server (NTRS)

Gwaltney, David A.; Briscoe, Jeri M.

2005-01-01

Integrated System Health Management (ISHM) architectures for spacecraft will include hard real-time, critical subsystems and soft real-time monitoring subsystems. Interaction between these subsystems will be necessary and an architecture supporting multiple criticality levels will be required. Demonstration hardware for the Integrated Safety-Critical Advanced Avionics Communication & Control (ISAACC) system has been developed at NASA Marshall Space Flight Center. It is a modular system using a commercially available time-triggered protocol, ?Tp/C, that supports hard real-time distributed control systems independent of the data transmission medium. The protocol is implemented in hardware and provides guaranteed low-latency messaging with inherent fault-tolerance and fault-containment. Interoperability between modules and systems of modules using the TTP/C is guaranteed through definition of messages and the precise message schedule implemented by the master-less Time Division Multiple Access (TDMA) communications protocol. "Plug-and-play" capability for sensors and actuators provides automatically configurable modules supporting sensor recalibration and control algorithm re-tuning without software modification. Modular components of controlled physical system(s) critical to control algorithm tuning, such as pumps or valve components in an engine, can be replaced or upgraded as "plug and play" components without modification to the ISAACC module hardware or software. ISAACC modules can communicate with other vehicle subsystems through time-triggered protocols or other communications protocols implemented over Ethernet, MIL-STD- 1553 and RS-485/422. Other communication bus physical layers and protocols can be included as required. In this way, the ISAACC modules can be part of a system-of-systems in a vehicle with multi-tier subsystems of varying criticality. The goal of the ISAACC architecture development is control and monitoring of safety critical systems of a manned spacecraft. These systems include spacecraft navigation and attitude control, propulsion, automated docking, vehicle health management and life support. ISAACC can integrate local critical subsystem health management with subsystems performing long term health monitoring. The ISAACC system and its relationship to ISHM will be presented.

Disaster Relief Appropriations Act, 2013

THOMAS, 112th Congress

Rep. Rogers, Harold [R-KY-5

2011-02-11

Senate - 12/30/2012 Message on Senate action sent to the House. (All Actions) Notes: This bill was for a time the Senate legislative vehicle for Hurricane Sandy supplemental appropriations. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Statistical Requirements For Pass-Fail Testing Of Contraband Detection Systems

NASA Astrophysics Data System (ADS)

Gilliam, David M.

2011-06-01

Contraband detection systems for homeland security applications are typically tested for probability of detection (PD) and probability of false alarm (PFA) using pass-fail testing protocols. Test protocols usually require specified values for PD and PFA to be demonstrated at a specified level of statistical confidence CL. Based on a recent more theoretical treatment of this subject [1], this summary reviews the definition of CL and provides formulas and spreadsheet functions for constructing tables of general test requirements and for determining the minimum number of tests required. The formulas and tables in this article may be generally applied to many other applications of pass-fail testing, in addition to testing of contraband detection systems.

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

NASA Technical Reports Server (NTRS)

DiNucci, David C.; Balley, David H. (Technical Monitor)

1997-01-01

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

New Models for Protocol Security

DTIC Science & Technology

2015-06-18

Rafael Pass, Alon Rosen , Eylon Yogev: One- Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 14. Joseph Y. Halpern, Rafael Pass, Lior Seeman...Conservative belief and rationality. Games and Economic Behavior 80: 186-192 (2013) 21. Rafael Pass, Alon Rosen , Wei-Lung Dustin Tseng: Public-Coin...Pass, Wei-Lung Dustin Tseng: The Knowledge Tightness of Par- allel Zero-Knowledge. TCC 2012: 512-529 44. Boaz Barak , Ran Canetti, Yehuda Lindell, Rafael

Interactive Supercomputing’s Star-P Platform

DOE Office of Scientific and Technical Information (OSTI.GOV)

Edelman, Alan; Husbands, Parry; Leibman, Steve

2006-09-19

The thesis of this extended abstract is simple. High productivity comes from high level infrastructures. To measure this, we introduce a methodology that goes beyond the tradition of timing software in serial and tuned parallel modes. We perform a classroom productivity study involving 29 students who have written a homework exercise in a low level language (MPI message passing) and a high level language (Star-P with MATLAB client). Our conclusions indicate what perhaps should be of little surprise: (1) the high level language is always far easier on the students than the low level language. (2) The early versions ofmore » the high level language perform inadequately compared to the tuned low level language, but later versions substantially catch up. Asymptotically, the analogy must hold that message passing is to high level language parallel programming as assembler is to high level environments such as MATLAB, Mathematica, Maple, or even Python. We follow the Kepner method that correctly realizes that traditional speedup numbers without some discussion of the human cost of reaching these numbers can fail to reflect the true human productivity cost of high performance computing. Traditional data compares low level message passing with serial computation. With the benefit of a high level language system in place, in our case Star-P running with MATLAB client, and with the benefit of a large data pool: 29 students, each running the same code ten times on three evolutions of the same platform, we can methodically demonstrate the productivity gains. To date we are not aware of any high level system as extensive and interoperable as Star-P, nor are we aware of an experiment of this kind performed with this volume of data.« less

Performance Measurement, Visualization and Modeling of Parallel and Distributed Programs

NASA Technical Reports Server (NTRS)

Yan, Jerry C.; Sarukkai, Sekhar R.; Mehra, Pankaj; Lum, Henry, Jr. (Technical Monitor)

1994-01-01

This paper presents a methodology for debugging the performance of message-passing programs on both tightly coupled and loosely coupled distributed-memory machines. The AIMS (Automated Instrumentation and Monitoring System) toolkit, a suite of software tools for measurement and analysis of performance, is introduced and its application illustrated using several benchmark programs drawn from the field of computational fluid dynamics. AIMS includes (i) Xinstrument, a powerful source-code instrumentor, which supports both Fortran77 and C as well as a number of different message-passing libraries including Intel's NX Thinking Machines' CMMD, and PVM; (ii) Monitor, a library of timestamping and trace -collection routines that run on supercomputers (such as Intel's iPSC/860, Delta, and Paragon and Thinking Machines' CM5) as well as on networks of workstations (including Convex Cluster and SparcStations connected by a LAN); (iii) Visualization Kernel, a trace-animation facility that supports source-code clickback, simultaneous visualization of computation and communication patterns, as well as analysis of data movements; (iv) Statistics Kernel, an advanced profiling facility, that associates a variety of performance data with various syntactic components of a parallel program; (v) Index Kernel, a diagnostic tool that helps pinpoint performance bottlenecks through the use of abstract indices; (vi) Modeling Kernel, a facility for automated modeling of message-passing programs that supports both simulation -based and analytical approaches to performance prediction and scalability analysis; (vii) Intrusion Compensator, a utility for recovering true performance from observed performance by removing the overheads of monitoring and their effects on the communication pattern of the program; and (viii) Compatibility Tools, that convert AIMS-generated traces into formats used by other performance-visualization tools, such as ParaGraph, Pablo, and certain AVS/Explorer modules.

Applications Performance Under MPL and MPI on NAS IBM SP2

NASA Technical Reports Server (NTRS)

Saini, Subhash; Simon, Horst D.; Lasinski, T. A. (Technical Monitor)

1994-01-01

On July 5, 1994, an IBM Scalable POWER parallel System (IBM SP2) with 64 nodes, was installed at the Numerical Aerodynamic Simulation (NAS) Facility Each node of NAS IBM SP2 is a "wide node" consisting of a RISC 6000/590 workstation module with a clock of 66.5 MHz which can perform four floating point operations per clock with a peak performance of 266 Mflop/s. By the end of 1994, 64 nodes of IBM SP2 will be upgraded to 160 nodes with a peak performance of 42.5 Gflop/s. An overview of the IBM SP2 hardware is presented. The basic understanding of architectural details of RS 6000/590 will help application scientists the porting, optimizing, and tuning of codes from other machines such as the CRAY C90 and the Paragon to the NAS SP2. Optimization techniques such as quad-word loading, effective utilization of two floating point units, and data cache optimization of RS 6000/590 is illustrated, with examples giving performance gains at each optimization step. The conversion of codes using Intel's message passing library NX to codes using native Message Passing Library (MPL) and the Message Passing Interface (NMI) library available on the IBM SP2 is illustrated. In particular, we will present the performance of Fast Fourier Transform (FFT) kernel from NAS Parallel Benchmarks (NPB) under MPL and MPI. We have also optimized some of Fortran BLAS 2 and BLAS 3 routines, e.g., the optimized Fortran DAXPY runs at 175 Mflop/s and optimized Fortran DGEMM runs at 230 Mflop/s per node. The performance of the NPB (Class B) on the IBM SP2 is compared with the CRAY C90, Intel Paragon, TMC CM-5E, and the CRAY T3D.

Parallelization of a hydrological model using the message passing interface

USGS Publications Warehouse

Wu, Yiping; Li, Tiejian; Sun, Liqun; Chen, Ji

2013-01-01

With the increasing knowledge about the natural processes, hydrological models such as the Soil and Water Assessment Tool (SWAT) are becoming larger and more complex with increasing computation time. Additionally, other procedures such as model calibration, which may require thousands of model iterations, can increase running time and thus further reduce rapid modeling and analysis. Using the widely-applied SWAT as an example, this study demonstrates how to parallelize a serial hydrological model in a Windows® environment using a parallel programing technology—Message Passing Interface (MPI). With a case study, we derived the optimal values for the two parameters (the number of processes and the corresponding percentage of work to be distributed to the master process) of the parallel SWAT (P-SWAT) on an ordinary personal computer and a work station. Our study indicates that model execution time can be reduced by 42%–70% (or a speedup of 1.74–3.36) using multiple processes (two to five) with a proper task-distribution scheme (between the master and slave processes). Although the computation time cost becomes lower with an increasing number of processes (from two to five), this enhancement becomes less due to the accompanied increase in demand for message passing procedures between the master and all slave processes. Our case study demonstrates that the P-SWAT with a five-process run may reach the maximum speedup, and the performance can be quite stable (fairly independent of a project size). Overall, the P-SWAT can help reduce the computation time substantially for an individual model run, manual and automatic calibration procedures, and optimization of best management practices. In particular, the parallelization method we used and the scheme for deriving the optimal parameters in this study can be valuable and easily applied to other hydrological or environmental models.

Robust quantum data locking from phase modulation

NASA Astrophysics Data System (ADS)

Lupo, Cosmo; Wilde, Mark M.; Lloyd, Seth

2014-08-01

Quantum data locking is a uniquely quantum phenomenon that allows a relatively short key of constant size to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the key by a proportionate amount. This implies that a constant size key can still lock an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random code words, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.

CERN alerter—RSS based system for information broadcast to all CERN offices

NASA Astrophysics Data System (ADS)

Otto, R.

2008-07-01

Nearly every large organization uses a tool to broadcast messages and information across the internal campus (messages like alerts announcing interruption in services or just information about upcoming events). These tools typically allow administrators (operators) to send 'targeted' messages which are sent only to specific groups of users or computers, e/g only those located in a specified building or connected to a particular computing service. CERN has a long history of such tools: CERNVMS's SPM_quotMESSAGE command, Zephyr [2] and the most recent the NICE Alerter based on the NNTP protocol. The NICE Alerter used on all Windows-based computers had to be phased out as a consequence of phasing out NNTP at CERN. The new solution to broadcast information messages on the CERN campus continues to provide the service based on cross-platform technologies, hence minimizing custom developments and relying on commercial software as much as possible. The new system, called CERN Alerter, is based on RSS (Really Simple Syndication) [9] for the transport protocol and uses Microsoft SharePoint as the backend for database and posting interface. The windows-based client relies on Internet Explorer 7.0 with custom code to trigger the window pop-ups and the notifications for new events. Linux and Mac OS X clients could also rely on any RSS readers to subscribe to targeted notifications. The paper covers the architecture and implementation aspects of the new system.

A low-dose, dual-phase cardiovascular CT protocol to assess left atrial appendage anatomy and exclude thrombus prior to left atrial intervention.

PubMed

Lazoura, Olga; Ismail, Tevfik F; Pavitt, Christopher; Lindsay, Alistair; Sriharan, Mona; Rubens, Michael; Padley, Simon; Duncan, Alison; Wong, Tom; Nicol, Edward

2016-02-01

Assessment of the left atrial appendage (LAA) for thrombus and anatomy is important prior to atrial fibrillation (AF) ablation and LAA exclusion. The use of cardiovascular CT (CCT) to detect LAA thrombus has been limited by the high incidence of pseudothrombus on single-pass studies. We evaluated the diagnostic accuracy of a two-phase protocol incorporating a limited low-dose delayed contrast-enhanced examination of the LAA, compared with a single-pass study for LAA morphological assessment, and transesophageal echocardiography (TEE) for the exclusion of thrombus. Consecutive patients (n = 122) undergoing left atrial interventions for AF were assessed. All had a two-phase CCT protocol (first-past scan plus a limited, 60-s delayed scan of the LAA) and TEE. Sensitivity, specificity, diagnostic accuracy, positive (PPV) and negative predictive values (NPV) were calculated for the detection of true thrombus on first-pass and delayed scans, using TEE as the gold standard. Overall, 20/122 (16.4 %) patients had filling defects on the first-pass study. All affected the full delineation of the LAA morphology; 17/20 (85 %) were confirmed as pseudo-filling defects. Three (15 %) were seen on late-pass and confirmed as true thrombi on TEE; a significant improvement in diagnostic performance relative to a single-pass scan (McNemar Chi-square 17, p < 0.001). The sensitivity, specificity, diagnostic accuracy, PPV and NPV was 100, 85.7, 86.1, 15.0 and 100 % respectively for first-pass scans, and 100 % for all parameters for the delayed scans. The median (range) additional radiation dose for the delayed scan was 0.4 (0.2-0.6) mSv. A low-dose delayed scan significantly improves the identification of true LAA anatomy and thrombus in patients undergoing LA intervention.

Optimising text messaging to improve adherence to web-based smoking cessation treatment: a randomised control trial protocol.

PubMed

Graham, Amanda L; Jacobs, Megan A; Cohn, Amy M; Cha, Sarah; Abroms, Lorien C; Papandonatos, George D; Whittaker, Robyn

2016-03-30

Millions of smokers use the Internet for smoking cessation assistance each year; however, most smokers engage minimally with even the best designed websites. The ubiquity of mobile devices and their effectiveness in promoting adherence in other areas of health behaviour change make them a promising tool to address adherence in Internet smoking cessation interventions. Text messaging is used by most adults, and messages can proactively encourage use of a web-based intervention. Text messaging can also be integrated with an Internet intervention to facilitate the use of core Internet intervention components. We identified four aspects of a text message intervention that may enhance its effectiveness in promoting adherence to a web-based smoking cessation programme: personalisation, integration, dynamic tailoring and message intensity. Phase I will use a two-level full factorial design to test the impact of these four experimental features on adherence to a web-based intervention. The primary outcome is a composite metric of adherence that incorporates general utilisation metrics (eg, logins, page views) and specific feature utilisation shown to predict abstinence. Participants will be N=860 adult smokers who register on an established Internet cessation programme and enrol in its text message programme. Phase II will be a two-arm randomised trial to compare the efficacy of the web-based cessation programme alone and in conjunction with the optimised text messaging intervention on 30-day point prevalence abstinence at 9 months. Phase II participants will be N=600 adult smokers who register to use an established Internet cessation programme and enrol in text messaging. Secondary analyses will explore whether adherence mediates the effect of treatment condition on outcome. This protocol was approved by Chesapeake IRB. We will disseminate study results through peer-reviewed manuscripts and conference presentations related to the methods and design, outcomes and exploratory analyses. NCT02585206. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

A lightweight messaging-based distributed processing and workflow execution framework for real-time and big data analysis

NASA Astrophysics Data System (ADS)

Laban, Shaban; El-Desouky, Aly

2014-05-01

To achieve a rapid, simple and reliable parallel processing of different types of tasks and big data processing on any compute cluster, a lightweight messaging-based distributed applications processing and workflow execution framework model is proposed. The framework is based on Apache ActiveMQ and Simple (or Streaming) Text Oriented Message Protocol (STOMP). ActiveMQ , a popular and powerful open source persistence messaging and integration patterns server with scheduler capabilities, acts as a message broker in the framework. STOMP provides an interoperable wire format that allows framework programs to talk and interact between each other and ActiveMQ easily. In order to efficiently use the message broker a unified message and topic naming pattern is utilized to achieve the required operation. Only three Python programs and simple library, used to unify and simplify the implementation of activeMQ and STOMP protocol, are needed to use the framework. A watchdog program is used to monitor, remove, add, start and stop any machine and/or its different tasks when necessary. For every machine a dedicated one and only one zoo keeper program is used to start different functions or tasks, stompShell program, needed for executing the user required workflow. The stompShell instances are used to execute any workflow jobs based on received message. A well-defined, simple and flexible message structure, based on JavaScript Object Notation (JSON), is used to build any complex workflow systems. Also, JSON format is used in configuration, communication between machines and programs. The framework is platform independent. Although, the framework is built using Python the actual workflow programs or jobs can be implemented by any programming language. The generic framework can be used in small national data centres for processing seismological and radionuclide data received from the International Data Centre (IDC) of the Preparatory Commission for the Comprehensive Nuclear-Test-Ban Treaty Organization (CTBTO). Also, it is possible to extend the use of the framework in monitoring the IDC pipeline. The detailed design, implementation,conclusion and future work of the proposed framework will be presented.

Overview of AMS (CCSDS Asynchronous Message Service)

NASA Technical Reports Server (NTRS)

Burleigh, Scott

2006-01-01

This viewgraph presentation gives an overview of the Consultative Committee for Space Data Systems (CCSDS) Asynchronous Message Service (AMS). The topics include: 1) Key Features; 2) A single AMS continuum; 3) The AMS Protocol Suite; 4) A multi-continuum venture; 5) Constraining transmissions; 6) Security; 7) Fault Tolerance; 8) Performance of Reference Implementation; 9) AMS vs Multicast (1); 10) AMS vs Multicast (2); 11) RAMS testing exercise; and 12) Results.

Automatic Traffic-Based Internet Control Message Protocol (ICMP) Model Generation for ns-3

DTIC Science & Technology

2015-12-01

through visiting the inferred automata o Fuzzing of an implementation by generating altered message formats We tested with 3 versions of Netzob. First...relationships. Afterwards, we used the Automata module to generate state machines using different functions: “generateChainedStateAutomata...The “generatePTAAutomata” takes as input several communication sessions and then identifies common paths and merges these into a single automata . The

Ada (Trademark) Case Studies II.

DTIC Science & Technology

1984-01-01

number ( CSN ) in that character set’s "transmission identifier". The array is named START CSN , but a better name would be STARTOFCSN. The word of...protocols), CSN (Channel Sequence Number), EON (End of Message), LMF (Line Media Format), MCB (Message Control Block), RI (Routing Indicator), and TI...component names should end with -PART, - FIELD , or COMPONENT.El - Package names should end with PACKAGE. - Enumeration literals should have suffixes

Enabling Energy Saving Innovations Act

THOMAS, 112th Congress

Rep. Aderholt, Robert B. [R-AL-4

2012-04-26

Senate - 09/24/2012 Message on Senate action sent to the House. (All Actions) Notes: For further action, see H.R.6582, which became Public Law 112-210 on 12/18/2012. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

A Model for Speedup of Parallel Programs

DTIC Science & Technology

1997-01-01

Sanjeev. K Setia . The interaction between mem- ory allocation and adaptive partitioning in message- passing multicomputers. In IPPS 󈨣 Workshop on Job...Scheduling Strategies for Parallel Processing, pages 89{99, 1995. [15] Sanjeev K. Setia and Satish K. Tripathi. A compar- ative analysis of static

Interstate Recognition of Notarizations Act of 2010

THOMAS, 111th Congress

Rep. Aderholt, Robert B. [R-AL-4

2009-10-14

House - 11/17/2010 On motion to refer the bill and the accompanying veto message to the Committee on the Judiciary. Agreed to without objection. (All Actions) Tracker: This bill has the status Failed to pass over vetoHere are the steps for Status of Legislation:

Communication Studies of DMP and SMP Machines

NASA Technical Reports Server (NTRS)

Sohn, Andrew; Biswas, Rupak; Chancellor, Marisa K. (Technical Monitor)

1997-01-01

Understanding the interplay between machines and problems is key to obtaining high performance on parallel machines. This paper investigates the interplay between programming paradigms and communication capabilities of parallel machines. In particular, we explicate the communication capabilities of the IBM SP-2 distributed-memory multiprocessor and the SGI PowerCHALLENGEarray symmetric multiprocessor. Two benchmark problems of bitonic sorting and Fast Fourier Transform are selected for experiments. Communication-efficient algorithms are developed to exploit the overlapping capabilities of the machines. Programs are written in Message-Passing Interface for portability and identical codes are used for both machines. Various data sizes and message sizes are used to test the machines' communication capabilities. Experimental results indicate that the communication performance of the multiprocessors are consistent with the size of messages. The SP-2 is sensitive to message size but yields a much higher communication overlapping because of the communication co-processor. The PowerCHALLENGEarray is not highly sensitive to message size and yields a low communication overlapping. Bitonic sorting yields lower performance compared to FFT due to a smaller computation-to-communication ratio.

Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis

NASA Astrophysics Data System (ADS)

Sakata, Ayaka; Xu, Yingying

2018-03-01

We analyse a linear regression problem with nonconvex regularization called smoothly clipped absolute deviation (SCAD) under an overcomplete Gaussian basis for Gaussian random data. We propose an approximate message passing (AMP) algorithm considering nonconvex regularization, namely SCAD-AMP, and analytically show that the stability condition corresponds to the de Almeida-Thouless condition in spin glass literature. Through asymptotic analysis, we show the correspondence between the density evolution of SCAD-AMP and the replica symmetric (RS) solution. Numerical experiments confirm that for a sufficiently large system size, SCAD-AMP achieves the optimal performance predicted by the replica method. Through replica analysis, a phase transition between replica symmetric and replica symmetry breaking (RSB) region is found in the parameter space of SCAD. The appearance of the RS region for a nonconvex penalty is a significant advantage that indicates the region of smooth landscape of the optimization problem. Furthermore, we analytically show that the statistical representation performance of the SCAD penalty is better than that of \

Message passing for integrating and assessing renewable generation in a redundant power grid

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zdeborova, Lenka; Backhaus, Scott; Chertkov, Michael

2009-01-01

A simplified model of a redundant power grid is used to study integration of fluctuating renewable generation. The grid consists of large number of generator and consumer nodes. The net power consumption is determined by the difference between the gross consumption and the level of renewable generation. The gross consumption is drawn from a narrow distribution representing the predictability of aggregated loads, and we consider two different distributions representing wind and solar resources. Each generator is connected to D consumers, and redundancy is built in by connecting R {le} D of these consumers to other generators. The lines are switchablemore » so that at any instance each consumer is connected to a single generator. We explore the capacity of the renewable generation by determining the level of 'firm' generation capacity that can be displaced for different levels of redundancy R. We also develop message-passing control algorithm for finding switch sellings where no generator is overloaded.« less

Mapping a battlefield simulation onto message-passing parallel architectures

NASA Technical Reports Server (NTRS)

Nicol, David M.

1987-01-01

Perhaps the most critical problem in distributed simulation is that of mapping: without an effective mapping of workload to processors the speedup potential of parallel processing cannot be realized. Mapping a simulation onto a message-passing architecture is especially difficult when the computational workload dynamically changes as a function of time and space; this is exactly the situation faced by battlefield simulations. This paper studies an approach where the simulated battlefield domain is first partitioned into many regions of equal size; typically there are more regions than processors. The regions are then assigned to processors; a processor is responsible for performing all simulation activity associated with the regions. The assignment algorithm is quite simple and attempts to balance load by exploiting locality of workload intensity. The performance of this technique is studied on a simple battlefield simulation implemented on the Flex/32 multiprocessor. Measurements show that the proposed method achieves reasonable processor efficiencies. Furthermore, the method shows promise for use in dynamic remapping of the simulation.

Time Warp Operating System (TWOS)

NASA Technical Reports Server (NTRS)

Bellenot, Steven F.

1993-01-01

Designed to support parallel discrete-event simulation, TWOS is complete implementation of Time Warp mechanism - distributed protocol for virtual time synchronization based on process rollback and message annihilation.

Development of an HL7 interface engine, based on tree structure and streaming algorithm, for large-size messages which include image data.

PubMed

Um, Ki Sung; Kwak, Yun Sik; Cho, Hune; Kim, Il Kon

2005-11-01

A basic assumption of Health Level Seven (HL7) protocol is 'No limitation of message length'. However, most existing commercial HL7 interface engines do limit message length because they use the string array method, which is run in the main memory for the HL7 message parsing process. Specifically, messages with image and multi-media data create a long string array and thus cause the computer system to raise critical and fatal problem. Consequently, HL7 messages cannot handle the image and multi-media data necessary in modern medical records. This study aims to solve this problem with the 'streaming algorithm' method. This new method for HL7 message parsing applies the character-stream object which process character by character between the main memory and hard disk device with the consequence that the processing load on main memory could be alleviated. The main functions of this new engine are generating, parsing, validating, browsing, sending, and receiving HL7 messages. Also, the engine can parse and generate XML-formatted HL7 messages. This new HL7 engine successfully exchanged HL7 messages with 10 megabyte size images and discharge summary information between two university hospitals.

Performance Analysis of the IEEE 802.11p Multichannel MAC Protocol in Vehicular Ad Hoc Networks

PubMed Central

2017-01-01

Vehicular Ad Hoc Networks (VANETs) employ multichannel to provide a variety of safety and non-safety applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. The safety applications require timely and reliable transmissions, while the non-safety applications require efficient and high throughput. In the IEEE 1609.4 protocol, operating interval is divided into alternating Control Channel (CCH) interval and Service Channel (SCH) interval with an identical length. During the CCH interval, nodes transmit safety-related messages and control messages, and Enhanced Distributed Channel Access (EDCA) mechanism is employed to allow four Access Categories (ACs) within a station with different priorities according to their criticality for the vehicle’s safety. During the SCH interval, the non-safety massages are transmitted. An analytical model is proposed in this paper to evaluate performance, reliability and efficiency of the IEEE 802.11p and IEEE 1609.4 protocols. The proposed model improves the existing work by taking serval aspects and the character of multichannel switching into design consideration. Extensive performance evaluations based on analysis and simulation help to validate the accuracy of the proposed model and analyze the capabilities and limitations of the IEEE 802.11p and IEEE 1609.4 protocols, and enhancement suggestions are given. PMID:29231882

Collocated Dataglyphs for large-message storage and retrieval

NASA Astrophysics Data System (ADS)

Motwani, Rakhi C.; Breidenbach, Jeff A.; Black, John R.

2004-06-01

In contrast to the security and integrity of electronic files, printed documents are vulnerable to damage and forgery due to their physical nature. Researchers at Palo Alto Research Center utilize DataGlyph technology to render digital characteristics to printed documents, which provides them with the facility of tamper-proof authentication and damage resistance. This DataGlyph document is known as GlyphSeal. Limited DataGlyph carrying capacity per printed page restricted the application of this technology to a domain of graphically simple and small-sized single-paged documents. In this paper the authors design a protocol motivated by techniques from the networking domain and back-up strategies, which extends the GlyphSeal technology to larger-sized, graphically complex, multi-page documents. This protocol provides fragmentation, sequencing and data loss recovery. The Collocated DataGlyph Protocol renders large glyph messages onto multiple printed pages and recovers the glyph data from rescanned versions of the multi-page documents, even when pages are missing, reordered or damaged. The novelty of this protocol is the application of ideas from RAID to the domain of DataGlyphs. The current revision of this protocol is capable of generating at most 255 pages, if page recovery is desired and does not provide enough data density to store highly detailed images in a reasonable amount of page space.

Performance Analysis of the IEEE 802.11p Multichannel MAC Protocol in Vehicular Ad Hoc Networks.

PubMed

Song, Caixia

2017-12-12

Vehicular Ad Hoc Networks (VANETs) employ multichannel to provide a variety of safety and non-safety applications, based on the IEEE 802.11p and IEEE 1609.4 protocols. The safety applications require timely and reliable transmissions, while the non-safety applications require efficient and high throughput. In the IEEE 1609.4 protocol, operating interval is divided into alternating Control Channel (CCH) interval and Service Channel (SCH) interval with an identical length. During the CCH interval, nodes transmit safety-related messages and control messages, and Enhanced Distributed Channel Access (EDCA) mechanism is employed to allow four Access Categories (ACs) within a station with different priorities according to their criticality for the vehicle's safety. During the SCH interval, the non-safety massages are transmitted. An analytical model is proposed in this paper to evaluate performance, reliability and efficiency of the IEEE 802.11p and IEEE 1609.4 protocols. The proposed model improves the existing work by taking serval aspects and the character of multichannel switching into design consideration. Extensive performance evaluations based on analysis and simulation help to validate the accuracy of the proposed model and analyze the capabilities and limitations of the IEEE 802.11p and IEEE 1609.4 protocols, and enhancement suggestions are given.

Implementation and Evaluation of Four Interoperable Open Standards for the Internet of Things.

PubMed

Jazayeri, Mohammad Ali; Liang, Steve H L; Huang, Chih-Yuan

2015-09-22

Recently, researchers are focusing on a new use of the Internet called the Internet of Things (IoT), in which enabled electronic devices can be remotely accessed over the Internet. As the realization of IoT concept is still in its early stages, manufacturers of Internet-connected devices and IoT web service providers are defining their proprietary protocols based on their targeted applications. Consequently, IoT becomes heterogeneous in terms of hardware capabilities and communication protocols. Addressing these heterogeneities by following open standards is a necessary step to communicate with various IoT devices. In this research, we assess the feasibility of applying existing open standards on resource-constrained IoT devices. The standard protocols developed in this research are OGC PUCK over Bluetooth, TinySOS, SOS over CoAP, and OGC SensorThings API. We believe that by hosting open standard protocols on IoT devices, not only do the devices become self-describable, self-contained, and interoperable, but innovative applications can also be easily developed with standardized interfaces. In addition, we use memory consumption, request message size, response message size, and response latency to benchmark the efficiency of the implemented protocols. In all, this research presents and evaluates standard-based solutions to better understand the feasibility of applying existing standards to the IoT vision.

Design and Implementation of BDS RTCM SSR Message

NASA Astrophysics Data System (ADS)

Xiao, Xia; Cheng, Fang; Liu, Feng; Lu, XiaoChun

2017-09-01

Based on the real-time differential positioning system of Beidou wide area, a set of Beidou high-precision differential information transmission protocol is studied and designed. After the system generates satellite precise orbit and clock difference products, it needs to be sent to the users in a certain data format through C band GEO communication satellite. The transport protocol should be designed according to the data volume and update rate of the system. At the same time, it is necessary to combine the signal system, satellite resources and the restriction and restriction of the receiver implementation technology. It refers to the relevant fields and international similar systems of technology and standards to design. This paper establishes a set of technical indicators which can measure the pros and cons of differential message organization and broadcasting strategy. Through modeling, simulation and actual test, this paper makes a comprehensive comparison of different strategies. Finally, a transmission protocol design scheme which has good performance and meets the system service requirements is presented.

A Mechanism for Reliable Mobility Management for Internet of Things Using CoAP

PubMed Central

Chun, Seung-Man; Park, Jong-Tae

2017-01-01

Under unreliable constrained wireless networks for Internet of Things (IoT) environments, the loss of the signaling message may frequently occur. Mobile Internet Protocol version 6 (MIPv6) and its variants do not consider this situation. Consequently, as a constrained device moves around different wireless networks, its Internet Protocol (IP) connectivity may be frequently disrupted and power can be drained rapidly. This can result in the loss of important sensing data or a large delay for time-critical IoT services such as healthcare monitoring and disaster management. This paper presents a reliable mobility management mechanism in Internet of Things environments with lossy low-power constrained device and network characteristics. The idea is to use the Internet Engineering Task Force (IETF) Constrained Application Protocol (CoAP) retransmission mechanism to achieve both reliability and simplicity for reliable IoT mobility management. Detailed architecture, algorithms, and message extensions for reliable mobility management are presented. Finally, performance is evaluated using both mathematical analysis and simulation. PMID:28085109

A Mechanism for Reliable Mobility Management for Internet of Things Using CoAP.

PubMed

Chun, Seung-Man; Park, Jong-Tae

2017-01-12

Under unreliable constrained wireless networks for Internet of Things (IoT) environments, the loss of the signaling message may frequently occur. Mobile Internet Protocol version 6 (MIPv6) and its variants do not consider this situation. Consequently, as a constrained device moves around different wireless networks, its Internet Protocol (IP) connectivity may be frequently disrupted and power can be drained rapidly. This can result in the loss of important sensing data or a large delay for time-critical IoT services such as healthcare monitoring and disaster management. This paper presents a reliable mobility management mechanism in Internet of Things environments with lossy low-power constrained device and network characteristics. The idea is to use the Internet Engineering Task Force (IETF) Constrained Application Protocol (CoAP) retransmission mechanism to achieve both reliability and simplicity for reliable IoT mobility management. Detailed architecture, algorithms, and message extensions for reliable mobility management are presented. Finally, performance is evaluated using both mathematical analysis and simulation.

Evaluation of post-authorization safety studies in the first cohort of EU Risk Management Plans at time of regulatory approval.

PubMed

Giezen, Thijs J; Mantel-Teeuwisse, Aukje K; Straus, Sabine M J M; Egberts, Toine C G; Blackburn, Stella; Persson, Ingemar; Leufkens, Hubert G M

2009-01-01

Since November 2005, an EU Risk Management Plan (EU-RMP) has had to be submitted as part of a marketing application for all new chemical entities in the EU. In the EU-RMP, the safety profile of the medicine has to be described and pharmacovigilance activities should be proposed to study further safety concerns during use of the drug in the real-world setting. These activities include, for example, collection of spontaneously reported adverse events and post-authorization safety studies (PASS). Since the submission of an EU-RMP is a relatively new requirement, there is limited knowledge on the quality and completeness of the study protocols of PASS at the time of approval and there are no data on the influence of certain drug characteristics on the proposed pharmacovigilance activities. To examine the types of proposed pharmacovigilance activities in a sample of EU-RMPs, describe and evaluate the methodology of PASS, identify problems and propose remedies, and compare characteristics between biologicals and small molecules. Eighteen EU-RMPs (nine for biologicals, nine for small molecules) given a positive decision regarding the marketing application by the Committee for Medicinal Products for Human Use between November 2005 and May 2007 were included in this descriptive cohort study. The EU-RMPs were selected over time and different therapeutic areas. Classification of the safety concerns ('important identified risks', 'important potential risks', 'important missing information' within the EU-RMP was studied. For PASS, data source (registry, population-based database, sponsor-owned clinical trial database), source of study population to be included in PASS and comprehensiveness of study protocol (full protocol, limited protocol, study synopsis, short description, commitment without further information) were studied. Compared to small molecules, safety concerns for biologicals were less frequently classified as important identified risks (relative risk [RR] 0.6; 95% CI 0.3, 1.0) and more frequently as important missing information (RR 1.6; 95% CI 1.0, 2.7). Forty-seven PASS were proposed; 31 for biologicals and 16 for small molecules. Compared with studies proposed in population-based databases (4 for biologicals, 8 for small molecules), studies in registries (18 for biologicals, 4 for small molecules) were more frequently proposed for biologicals than for small molecules (RR 2.5; 95% CI 1.1, 5.7). About 60% of the proposed PASS will include EU inhabitants. No full study protocols were submitted; 26% involved a limited study protocol, 33% a study synopsis, 37% a short description and 4% a commitment without further information. Approximately 40% of the study proposals for PASS were classified as a short description or a commitment to perform a study without further information, precluding an adequate scientific assessment. Studying non-EU populations may give rise to difficulties with generalizability of the results to the EU due to differences in patient characteristics, differences in the indication for the medicine and different healthcare systems. This study emphasizes the need for more complete study proposals to be submitted earlier on in the evaluation period and for the inclusion of EU inhabitants in PASS. In addition, differences in the characteristics between biologicals and small molecules, e.g. in the data source proposed, support the need for individualized tailored PASS depending on the type of drug.

Automated processing of first-pass radioisotope ventriculography data to determine essential central circulation parameters

NASA Astrophysics Data System (ADS)

Krotov, Aleksei; Pankin, Victor

2017-09-01

The assessment of central circulation (including heart function) parameters is vital in the preventive diagnostics of inherent and acquired heart failures and during polychemotherapy. The protocols currently applied in Russia do not fully utilize the first-pass assessment (FPRNA) and that results in poor data formalization, while the FPRNA is the one of the fastest, affordable and compact methods among other radioisotope diagnostics protocols. A non-imaging algorithm basing on existing protocols has been designed to use the readings of an additional detector above vena subclavia to determine the total blood volume (TBV), not requiring blood sampling in contrast to current protocols. An automated processing of precordial detector readings is presented, in order to determine the heart strike volume (SV). Two techniques to estimate the ejection fraction (EF) of the heart are discussed.

Kingman and Heritage Islands Act of 2009

THOMAS, 111th Congress

Rep. Norton, Eleanor Holmes [D-DC-At Large

2009-04-23

Senate - 09/28/2010 Message on Senate action sent to the House. (All Actions) Notes: For further action, see H.R.6278, which became Public Law 111-328 on 12/22/2010. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Distance Learning and Public School Finance.

ERIC Educational Resources Information Center

Monahan, Brian; Wimber, Charles

This discussion of the application of computers and telecommunications technology to distance learning begins by describing a workstation equipped to produce "lessonware" in such formats as audiocassettes, videocassettes, diskettes, and voice messages. Such workstations would be located in classrooms equipped with two-way reverse passes to a cable…

Reducing Flight Delays Act of 2013

THOMAS, 113th Congress

Sen. Collins, Susan M. [R-ME

2013-04-25

Senate - 04/30/2013 Message on Senate action sent to the House. (All Actions) Notes: For further action, see H.R.1765, which became Public Law 113-9 on 5/1/2013. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Temporary Bankruptcy Judgeships Extension Act of 2011

THOMAS, 112th Congress

Rep. Smith, Lamar [R-TX-21

2011-03-10

Senate - 04/23/2012 Message on Senate action sent to the House. (All Actions) Notes: For further action, see H.R.4967, which became Public Law 112-121 on 5/25/2012. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Statistical Requirements For Pass-Fail Testing Of Contraband Detection Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gilliam, David M.

2011-06-01

Contraband detection systems for homeland security applications are typically tested for probability of detection (PD) and probability of false alarm (PFA) using pass-fail testing protocols. Test protocols usually require specified values for PD and PFA to be demonstrated at a specified level of statistical confidence CL. Based on a recent more theoretical treatment of this subject [1], this summary reviews the definition of CL and provides formulas and spreadsheet functions for constructing tables of general test requirements and for determining the minimum number of tests required. The formulas and tables in this article may be generally applied to many othermore » applications of pass-fail testing, in addition to testing of contraband detection systems.« less

Six degrees of depolarization. Comment on "Network science of biological systems at different scales: A review" by Marko Gosak et al.

NASA Astrophysics Data System (ADS)

Wedgwood, Kyle C. A.; Satin, Leslie S.

2018-03-01

In 1967, the social psychologist Stanley Milgram asked how many intermediates would be required for a letter from participants in various U.S. states to be received by a contact in Boston, given that participants were given only basic information about the contact, and were instructed only to pass along the message to someone that might know the intended recipient [27]. The surprising answer was that, in spite of the social and geographical distances covered, on average, only 6 people were required for the message to reach its intended target.

A distributed infrastructure for publishing VO services: an implementation

NASA Astrophysics Data System (ADS)

Cepparo, Francesco; Scagnetto, Ivan; Molinaro, Marco; Smareglia, Riccardo

2016-07-01

This contribution describes both the design and the implementation details of a new solution for publishing VO services, enlightening its maintainable, distributed, modular and scalable architecture. Indeed, the new publisher is multithreaded and multiprocess. Multiple instances of the modules can run on different machines to ensure high performance and high availability, and this will be true both for the interface modules of the services and the back end data access ones. The system uses message passing to let its components communicate through an AMQP message broker that can itself be distributed to provide better scalability and availability.

Reliable Multihop Broadcast Protocol with a Low-Overhead Link Quality Assessment for ITS Based on VANETs in Highway Scenarios

PubMed Central

Galaviz-Mosqueda, Alejandro; Villarreal-Reyes, Salvador; Galeana-Zapién, Hiram; Rubio-Loyola, Javier; Covarrubias-Rosales, David H.

2014-01-01

Vehicular ad hoc networks (VANETs) have been identified as a key technology to enable intelligent transport systems (ITS), which are aimed to radically improve the safety, comfort, and greenness of the vehicles in the road. However, in order to fully exploit VANETs potential, several issues must be addressed. Because of the high dynamic of VANETs and the impairments in the wireless channel, one key issue arising when working with VANETs is the multihop dissemination of broadcast packets for safety and infotainment applications. In this paper a reliable low-overhead multihop broadcast (RLMB) protocol is proposed to address the well-known broadcast storm problem. The proposed RLMB takes advantage of the hello messages exchanged between the vehicles and it processes such information to intelligently select a relay set and reduce the redundant broadcast. Additionally, to reduce the hello messages rate dependency, RLMB uses a point-to-zone link evaluation approach. RLMB performance is compared with one of the leading multihop broadcast protocols existing to date. Performance metrics show that our RLMB solution outperforms the leading protocol in terms of important metrics such as packet dissemination ratio, overhead, and delay. PMID:25133224

ACR/NEMA Digital Image Interface Standard (An Illustrated Protocol Overview)

NASA Astrophysics Data System (ADS)

Lawrence, G. Robert

1985-09-01

The American College of Radiologists (ACR) and the National Electrical Manufacturers Association (NEMA) have sponsored a joint standards committee mandated to develop a universal interface standard for the transfer of radiology images among a variety of PACS imaging devicesl. The resulting standard interface conforms to the ISO/OSI standard reference model for network protocol layering. The standard interface specifies the lower layers of the reference model (Physical, Data Link, Transport and Session) and implies a requirement of the Network Layer should a requirement for a network exist. The message content has been considered and a flexible message and image format specified. The following Imaging Equipment modalities are supported by the standard interface... CT Computed Tomograpy DS Digital Subtraction NM Nuclear Medicine US Ultrasound MR Magnetic Resonance DR Digital Radiology The following data types are standardized over the transmission interface media.... IMAGE DATA DIGITIZED VOICE HEADER DATA RAW DATA TEXT REPORTS GRAPHICS OTHERS This paper consists of text supporting the illustrated protocol data flow. Each layer will be individually treated. Particular emphasis will be given to the Data Link layer (Frames) and the Transport layer (Packets). The discussion utilizes a finite state sequential machine model for the protocol layers.

Validation of the Pangao PG-800A11 wrist device assessed according to the European Society of Hypertension and the British Hypertension Society protocols.

PubMed

Xie, Peigen; Wang, Yanling; Xu, Xiaoying; Huang, Fei; Pan, Jingru

2015-04-01

The objective of this study was to determine the accuracy of the Pangao PG-800A11 wrist blood pressure monitor according to the European Society of Hypertension International Protocol (ESH-IP) revision 2010 and the protocol of the British Hypertension Society (BHS). The device evaluations were performed in 85 participants, 33 of whom were included according to the ESH-IP revision 2010 and 52 of whom were included on the basis of the requirements of the BHS protocol. The validation procedure and data analysis followed the protocols precisely. The device achieved an A/A grading for the BHS protocol and passed all phases of the ESH-IP revision 2010 protocol. The mean difference ±SD for the ESH and BHS protocols, respectively, was -0.6±4.5 and -0.8±6.2 mmHg for systolic pressure and 1.2±4.6 and -0.5±5.1 mmHg for diastolic pressure. The device maintained its A/A grading throughout the low, medium, and high-pressure ranges. The Pangao PG-800A11 wrist blood pressure monitor passed all requirements of the ESH-IP revision 2010 and achieved A/A grade of the BHS protocol in an adult population.

47 CFR 54.503 - Other supported special services.

Code of Federal Regulations, 2010 CFR

2010-10-01

... telecommunications carriers include voice mail, interconnected voice over Internet protocol (VoIP), text messaging, Internet access, and installation and maintenance of internal connections in addition to all reasonable...

Incorporating Brokers within Collaboration Environments

NASA Astrophysics Data System (ADS)

Rajasekar, A.; Moore, R.; de Torcy, A.

2013-12-01

A collaboration environment, such as the integrated Rule Oriented Data System (iRODS - http://irods.diceresearch.org), provides interoperability mechanisms for accessing storage systems, authentication systems, messaging systems, information catalogs, networks, and policy engines from a wide variety of clients. The interoperability mechanisms function as brokers, translating actions requested by clients to the protocol required by a specific technology. The iRODS data grid is used to enable collaborative research within hydrology, seismology, earth science, climate, oceanography, plant biology, astronomy, physics, and genomics disciplines. Although each domain has unique resources, data formats, semantics, and protocols, the iRODS system provides a generic framework that is capable of managing collaborative research initiatives that span multiple disciplines. Each interoperability mechanism (broker) is linked to a name space that enables unified access across the heterogeneous systems. The collaboration environment provides not only support for brokers, but also support for virtualization of name spaces for users, files, collections, storage systems, metadata, and policies. The broker enables access to data or information in a remote system using the appropriate protocol, while the collaboration environment provides a uniform naming convention for accessing and manipulating each object. Within the NSF DataNet Federation Consortium project (http://www.datafed.org), three basic types of interoperability mechanisms have been identified and applied: 1) drivers for managing manipulation at the remote resource (such as data subsetting), 2) micro-services that execute the protocol required by the remote resource, and 3) policies for controlling the execution. For example, drivers have been written for manipulating NetCDF and HDF formatted files within THREDDS servers. Micro-services have been written that manage interactions with the CUAHSI data repository, the DataONE information catalog, and the GeoBrain broker. Policies have been written that manage transfer of messages between an iRODS message queue and the Advanced Message Queuing Protocol. Examples of these brokering mechanisms will be presented. The DFC collaboration environment serves as the intermediary between community resources and compute grids, enabling reproducible data-driven research. It is possible to create an analysis workflow that retrieves data subsets from a remote server, assemble the required input files, automate the execution of the workflow, automatically track the provenance of the workflow, and share the input files, workflow, and output files. A collaborator can re-execute a shared workflow, compare results, change input files, and re-execute an analysis.

WinHPC System Programming | High-Performance Computing | NREL

Science.gov Websites

Programming WinHPC System Programming Learn how to build and run an MPI (message passing interface (mpi.h) and library (msmpi.lib) are. To build from the command line, run... Start > Intel Software Development Tools > Intel C++ Compiler Professional... > C++ Build Environment for applications running

Secure HL7 transactions using Internet mail (Internet draft).

PubMed

Schadow, Gunther; Tucker, Mark; Rishel, Wes

2002-01-01

The document describes the applicability of the Internet standardisation efforts on secure electronic data interchange (EDI) transactions for Health Level-7 (HL7), an EDI standard for Healthcare used world-wide. The document heavily relies on the work in progress by the IETF EDIINT working group. It is in most parts a restatement of the EDIINTs requirements document and application statement 1 (AS#1) tailored to the needs of the HL7 audience. The authors tried to make the document as self consistent as possible. The goal is to give to the reader who is not a security or Internet standards expert enough foundational and detail information to enable him to build communication software that complies to the Internet standards. Even though the authors rely on and promote the respective Internet standards and drafts, they did not withstand from commenting on and criticising the work where they see upcoming problems in use with HL7 or other EDI protocols that have not been in the initial focus of the EDIINT working group. The authors make suggestions to add parameters to the specification of the MIME type for EDI messages in RFC 1767 in order to enhance functionality. The authors give use cases for a larger subset of disposition types and modifiers of message disposition notifications. One key issue where the document goes beyond the current EDIINT drafts is the concept of non-repudiation of commitment to an EDI transaction. Secure EDI transactions should be regarded as "distributed contracts," i.e. not only the sending and receiving of single messages should be non-refutable but also the connection between messages interchanges. In anticipation of this requirement HL7 usually requires a response message to be sent to acknowledge every transaction. The authors therefore have the requirement to securely couple an EDI response message to its request message. Given the current shape of RFC 1767 this is generally possible only if a response message is coupled with an MDN receipt and the combination of both signed by the responder. The document describes a protocol to bundle MDN and response that uses the MIME multi-part/related content type in RFC 2112.

A Randomized Controlled Trial of the Effectiveness of Traditional and Mobile Public Health Communications With Health Care Providers.

PubMed

Baseman, Janet; Revere, Debra; Painter, Ian; Oberle, Mark; Duchin, Jeffrey; Thiede, Hanne; Nett, Randall; MacEachern, Dorothy; Stergachis, Andy

2016-02-01

Health care providers play an essential role in public health emergency preparedness and response. We conducted a 4-year randomized controlled trial to systematically compare the effectiveness of traditional and mobile communication strategies for sending time-sensitive public health messages to providers. Subjects (N=848) included providers who might be leveraged to assist with emergency preparedness and response activities, such as physicians, pharmacists, nurse practitioners, physician's assistants, and veterinarians. Providers were randomly assigned to a group that received time-sensitive quarterly messages via e-mail, fax, or cell phone text messaging (SMS) or to a no-message control group. Follow-up phone interviews elicited information about message receipt, topic recall, and perceived credibility and trustworthiness of message and source. Our main outcome measures were awareness and recall of message content, which was compared across delivery methods. Per-protocol analysis revealed that e-mail messages were recalled at a higher rate than were messaged delivered by fax or SMS, whereas the as-treated analysis found that e-mail and fax groups had similar recall rates and both had higher recall rates than the SMS group. This is the first study to systematically evaluate the relative effectiveness of public health message delivery systems. Our findings provide guidance to improve public health agency communications with providers before, during, and after a public health emergency.

Information processing in the CNS: a supramolecular chemistry?

PubMed

Tozzi, Arturo

2015-10-01

How does central nervous system process information? Current theories are based on two tenets: (a) information is transmitted by action potentials, the language by which neurons communicate with each other-and (b) homogeneous neuronal assemblies of cortical circuits operate on these neuronal messages where the operations are characterized by the intrinsic connectivity among neuronal populations. In this view, the size and time course of any spike is stereotypic and the information is restricted to the temporal sequence of the spikes; namely, the "neural code". However, an increasing amount of novel data point towards an alternative hypothesis: (a) the role of neural code in information processing is overemphasized. Instead of simply passing messages, action potentials play a role in dynamic coordination at multiple spatial and temporal scales, establishing network interactions across several levels of a hierarchical modular architecture, modulating and regulating the propagation of neuronal messages. (b) Information is processed at all levels of neuronal infrastructure from macromolecules to population dynamics. For example, intra-neuronal (changes in protein conformation, concentration and synthesis) and extra-neuronal factors (extracellular proteolysis, substrate patterning, myelin plasticity, microbes, metabolic status) can have a profound effect on neuronal computations. This means molecular message passing may have cognitive connotations. This essay introduces the concept of "supramolecular chemistry", involving the storage of information at the molecular level and its retrieval, transfer and processing at the supramolecular level, through transitory non-covalent molecular processes that are self-organized, self-assembled and dynamic. Finally, we note that the cortex comprises extremely heterogeneous cells, with distinct regional variations, macromolecular assembly, receptor repertoire and intrinsic microcircuitry. This suggests that every neuron (or group of neurons) embodies different molecular information that hands an operational effect on neuronal computation.

Novel methods to estimate antiretroviral adherence: protocol for a longitudinal study.

PubMed

Saberi, Parya; Ming, Kristin; Legnitto, Dominique; Neilands, Torsten B; Gandhi, Monica; Johnson, Mallory O

2018-01-01

There is currently no gold standard for assessing antiretroviral (ARV) adherence, so researchers often resort to the most feasible and cost-effective methods possible (eg, self-report), which may be biased or inaccurate. The goal of our study was to evaluate the feasibility and acceptability of innovative and remote methods to estimate ARV adherence, which can potentially be conducted with less time and financial resources in a wide range of clinic and research settings. Here, we describe the research protocol for studying these novel methods and some lessons learned. The 6-month pilot study aimed to examine the feasibility and acceptability of a remotely conducted study to evaluate the correlation between: 1) text-messaged photographs of pharmacy refill dates for refill-based adherence; 2) text-messaged photographs of pills for pill count-based adherence; and 3) home-collected hair sample measures of ARV concentration for pharmacologic-based adherence. Participants were sent monthly automated text messages to collect refill dates and pill counts that were taken and sent via mobile telephone photographs, and hair collection kits every 2 months by mail. At the study end, feasibility was calculated by specific metrics, such as the receipt of hair samples and responses to text messages. Participants completed a quantitative survey and qualitative exit interviews to examine the acceptability of these adherence evaluation methods. The relationship between the 3 novel metrics of adherence and self-reported adherence will be assessed. Investigators conducting adherence research are often limited to using either self-reported adherence, which is subjective, biased, and often overestimated, or other more complex methods. Here, we describe the protocol for evaluating the feasibility and acceptability of 3 novel and remote methods of estimating adherence, with the aim of evaluating the relationships between them. Additionally, we note the lessons learned from the protocol implementation to date. We expect that these novel measures will be feasible and acceptable. The implications of this research will be the identification and evaluation of innovative and accurate metrics of ARV adherence for future implementation.

Novel methods to estimate antiretroviral adherence: protocol for a longitudinal study

PubMed Central

Saberi, Parya; Ming, Kristin; Legnitto, Dominique; Neilands, Torsten B; Gandhi, Monica; Johnson, Mallory O

2018-01-01

Background There is currently no gold standard for assessing antiretroviral (ARV) adherence, so researchers often resort to the most feasible and cost-effective methods possible (eg, self-report), which may be biased or inaccurate. The goal of our study was to evaluate the feasibility and acceptability of innovative and remote methods to estimate ARV adherence, which can potentially be conducted with less time and financial resources in a wide range of clinic and research settings. Here, we describe the research protocol for studying these novel methods and some lessons learned. Methods The 6-month pilot study aimed to examine the feasibility and acceptability of a remotely conducted study to evaluate the correlation between: 1) text-messaged photographs of pharmacy refill dates for refill-based adherence; 2) text-messaged photographs of pills for pill count-based adherence; and 3) home-collected hair sample measures of ARV concentration for pharmacologic-based adherence. Participants were sent monthly automated text messages to collect refill dates and pill counts that were taken and sent via mobile telephone photographs, and hair collection kits every 2 months by mail. At the study end, feasibility was calculated by specific metrics, such as the receipt of hair samples and responses to text messages. Participants completed a quantitative survey and qualitative exit interviews to examine the acceptability of these adherence evaluation methods. The relationship between the 3 novel metrics of adherence and self-reported adherence will be assessed. Discussion Investigators conducting adherence research are often limited to using either self-reported adherence, which is subjective, biased, and often overestimated, or other more complex methods. Here, we describe the protocol for evaluating the feasibility and acceptability of 3 novel and remote methods of estimating adherence, with the aim of evaluating the relationships between them. Additionally, we note the lessons learned from the protocol implementation to date. We expect that these novel measures will be feasible and acceptable. The implications of this research will be the identification and evaluation of innovative and accurate metrics of ARV adherence for future implementation. PMID:29950816

Limitations on Design Principles for Public Key Protocols

DTIC Science & Technology

1996-01-01

preserves nonrepudiation|assuming, as in the last example, that signatures are added to each message. Note that for all the messages save one, the...digital money must be put up against any bid in their auction, the attack requires the active partic- ipation of a bank. Second, since they protect...ACM Press, New York, November 1993. [5] R. Bird, I. Gopal, A. Herzberg , P. Janson, S. Kut- ten, R. Molva, and M. Yung. Systematic Design of a Family

Controller-Independent Bidirectional Direct Communication with Four-Qubit Cluster States

NASA Astrophysics Data System (ADS)

Cao, Yong; Zha, Xin-Wei; Wang, Shu-Kai

2018-03-01

We propose a feasible scheme for implementing bidirectional quantum direct communication protocol using four-qubit cluster states. In this scheme, the quantum channel between the sender Alice and the receiver Bob consists of an ordered sequence of cluster states which are prepared by Alice. After ensuring the security of quantum channel, according to the secret messages, the sender will perform the unitary operation and the receiver can obtain different secret messages in a deterministic way.

Testing Dialog-Verification of SIP Phones with Single-Message Denial-of-Service Attacks

NASA Astrophysics Data System (ADS)

Seedorf, Jan; Beckers, Kristian; Huici, Felipe

The Session Initiation Protocol (SIP) is widely used for signaling in multimedia communications. However, many SIP implementations are still in their infancy and vulnerable to malicious messages. We investigate flaws in the SIP implementations of eight phones, showing that the deficient verification of SIP dialogs further aggravates the problem by making it easier for attacks to succeed. Our results show that the majority of the phones we tested are susceptible to these attacks.

Quantum CSMA/CD Synchronous Communication Protocol with Entanglement

NASA Astrophysics Data System (ADS)

Zhou, Nanrun; Zeng, Binyang; Gong, Lihua

By utilizing the characteristics of quantum entanglement, a quantum synchronous communication protocol for Carrier Sense Multiple Access with Collision Detection (CSMA/CD) is presented. The proposed protocol divides the link into the busy time and leisure one, where the data frames are sent via classical channels and the distribution of quantum entanglement is supposed to be completed at leisure time and the quantum acknowledge frames are sent via quantum entanglement channels. The time span between two successfully delivered messages can be significantly reduced in this proposed protocol. It is shown that the performance of the CSMA/CD protocol can be improved significantly since the collision can be reduced to a certain extent. The proposed protocol has great significance in quantum communication.

Comment on 'Quantum direct communication with authentication'

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Zhan-jun; Key Laboratory of Optoelectronic Information Acquisition and Manipulation of Ministry of Education of China, School of Physics and Material Science, Anhui University, Hefei 230039; Liu, Jun

2007-02-15

Two protocols of quantum direct communication with authentication [Phys. Rev. A 73, 042305 (2006)] were recently proposed by Lee, Lim, and Yang. In this paper we will show that in the two protocols the authenticator Trent should be prevented from knowing the secret message. The first protocol can be eavesdropped on by Trent using the intercept-measure-resend attack, while the second protocol can be eavesdropped on by Trent using a simple single-qubit measurement. To fix these leaks, we revise the original versions of the protocols by using the Pauli Z operation {sigma}{sub z} instead of the original bit-flip operation X. Asmore » a consequence, the attacks we present can be prevented and accordingly the protocol securities are improved.« less

Increasing the Operational Value of Event Messages

NASA Technical Reports Server (NTRS)

Li, Zhenping; Savkli, Cetin; Smith, Dan

2003-01-01

Assessing the health of a space mission has traditionally been performed using telemetry analysis tools. Parameter values are compared to known operational limits and are plotted over various time periods. This presentation begins with the notion that there is an incredible amount of untapped information contained within the mission s event message logs. Through creative advancements in message handling tools, the event message logs can be used to better assess spacecraft and ground system status and to highlight and report on conditions not readily apparent when messages are evaluated one-at-a-time during a real-time pass. Work in this area is being funded as part of a larger NASA effort at the Goddard Space Flight Center to create component-based, middleware-based, standards-based general purpose ground system architecture referred to as GMSEC - the GSFC Mission Services Evolution Center. The new capabilities and operational concepts for event display, event data analyses and data mining are being developed by Lockheed Martin and the new subsystem has been named GREAT - the GMSEC Reusable Event Analysis Toolkit. Planned for use on existing and future missions, GREAT has the potential to increase operational efficiency in areas of problem detection and analysis, general status reporting, and real-time situational awareness.

Scalable Replay with Partial-Order Dependencies for Message-Logging Fault Tolerance

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lifflander, Jonathan; Meneses, Esteban; Menon, Harshita

2014-09-22

Deterministic replay of a parallel application is commonly used for discovering bugs or to recover from a hard fault with message-logging fault tolerance. For message passing programs, a major source of overhead during forward execution is recording the order in which messages are sent and received. During replay, this ordering must be used to deterministically reproduce the execution. Previous work in replay algorithms often makes minimal assumptions about the programming model and application in order to maintain generality. However, in many cases, only a partial order must be recorded due to determinism intrinsic in the code, ordering constraints imposed bymore » the execution model, and events that are commutative (their relative execution order during replay does not need to be reproduced exactly). In this paper, we present a novel algebraic framework for reasoning about the minimum dependencies required to represent the partial order for different concurrent orderings and interleavings. By exploiting this theory, we improve on an existing scalable message-logging fault tolerance scheme. The improved scheme scales to 131,072 cores on an IBM BlueGene/P with up to 2x lower overhead than one that records a total order.« less

Implementation and Evaluation of Four Interoperable Open Standards for the Internet of Things

PubMed Central

Jazayeri, Mohammad Ali; Liang, Steve H. L.; Huang, Chih-Yuan

2015-01-01

Recently, researchers are focusing on a new use of the Internet called the Internet of Things (IoT), in which enabled electronic devices can be remotely accessed over the Internet. As the realization of IoT concept is still in its early stages, manufacturers of Internet-connected devices and IoT web service providers are defining their proprietary protocols based on their targeted applications. Consequently, IoT becomes heterogeneous in terms of hardware capabilities and communication protocols. Addressing these heterogeneities by following open standards is a necessary step to communicate with various IoT devices. In this research, we assess the feasibility of applying existing open standards on resource-constrained IoT devices. The standard protocols developed in this research are OGC PUCK over Bluetooth, TinySOS, SOS over CoAP, and OGC SensorThings API. We believe that by hosting open standard protocols on IoT devices, not only do the devices become self-describable, self-contained, and interoperable, but innovative applications can also be easily developed with standardized interfaces. In addition, we use memory consumption, request message size, response message size, and response latency to benchmark the efficiency of the implemented protocols. In all, this research presents and evaluates standard-based solutions to better understand the feasibility of applying existing standards to the IoT vision. PMID:26402683

47 CFR 7.9 - Information pass through.

Code of Federal Regulations, 2010 CFR

2010-10-01

...-manufacturer, non-proprietary, industry-standard codes, translation protocols, formats or other information..., signal compression technologies shall not remove information needed for access or shall restore it upon... 47 Telecommunication 1 2010-10-01 2010-10-01 false Information pass through. 7.9 Section 7.9...

E-mail, decisional styles, and rest breaks.

PubMed

Baker, James R; Phillips, James G

2007-10-01

E-mail is a common but problematic work application. A scale was created to measure tendencies to use e-mail to take breaks (e-breaking); and self-esteem and decisional style (vigilance, procrastination, buck-passing, hypervigilance) were used to predict the self-reported and actual e-mail behaviors of 133 participants (students and marketing employees). Individuals who were low in defensive avoidance (buck-passing) engaged in more e-mailing per week, both in time spent on e-mail and message volume. E-breakers were more likely to engage in behavioral procrastination and spent more time on personal e-mail.

PyPanda: a Python package for gene regulatory network reconstruction

PubMed Central

van IJzendoorn, David G.P.; Glass, Kimberly; Quackenbush, John; Kuijjer, Marieke L.

2016-01-01

Summary: PANDA (Passing Attributes between Networks for Data Assimilation) is a gene regulatory network inference method that uses message-passing to integrate multiple sources of ‘omics data. PANDA was originally coded in C ++. In this application note we describe PyPanda, the Python version of PANDA. PyPanda runs considerably faster than the C ++ version and includes additional features for network analysis. Availability and implementation: The open source PyPanda Python package is freely available at http://github.com/davidvi/pypanda. Contact: mkuijjer@jimmy.harvard.edu or d.g.p.van_ijzendoorn@lumc.nl PMID:27402905

PyPanda: a Python package for gene regulatory network reconstruction.

PubMed

van IJzendoorn, David G P; Glass, Kimberly; Quackenbush, John; Kuijjer, Marieke L

2016-11-01

PANDA (Passing Attributes between Networks for Data Assimilation) is a gene regulatory network inference method that uses message-passing to integrate multiple sources of 'omics data. PANDA was originally coded in C ++. In this application note we describe PyPanda, the Python version of PANDA. PyPanda runs considerably faster than the C ++ version and includes additional features for network analysis. The open source PyPanda Python package is freely available at http://github.com/davidvi/pypanda CONTACT: mkuijjer@jimmy.harvard.edu or d.g.p.van_ijzendoorn@lumc.nl. © The Author 2016. Published by Oxford University Press.

47 CFR 11.52 - EAS code and Attention Signal Monitoring requirements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... technologies, such as instant messaging and email) the distribution of Common Alert Protocol (CAP)-formatted... Integrated Public Alert and Warning System (IPAWS) to enable (whether through “pull” interface technologies...

47 CFR 11.52 - EAS code and Attention Signal Monitoring requirements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... technologies, such as instant messaging and email) the distribution of Common Alert Protocol (CAP)-formatted... Integrated Public Alert and Warning System (IPAWS) to enable (whether through “pull” interface technologies...

47 CFR 11.52 - EAS code and Attention Signal Monitoring requirements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... technologies, such as instant messaging and email) the distribution of Common Alert Protocol (CAP)-formatted... Integrated Public Alert and Warning System (IPAWS) to enable (whether through “pull” interface technologies...

Gateway-Assisted Retransmission for Lightweight and Reliable IoT Communications.

PubMed

Chang, Hui-Ling; Wang, Cheng-Gang; Wu, Mong-Ting; Tsai, Meng-Hsun; Lin, Chia-Ying

2016-09-22

Message Queuing Telemetry Transport for Sensor Networks (MQTT-SN) and Constrained Application Protocol (CoAP) are two protocols supporting publish/subscribe models for IoT devices to publish messages to interested subscribers. Retransmission mechanisms are introduced to compensate for the lack of data reliability. If the device does not receive the acknowledgement (ACK) before retransmission timeout (RTO) expires, the device will retransmit data. Setting an appropriate RTO is important because the delay may be large or retransmission may be too frequent when the RTO is inappropriate. We propose a Gateway-assisted CoAP (GaCoAP) to dynamically compute RTO for devices. Simulation models are proposed to investigate the performance of GaCoAP compared with four other methods. The experiment results show that GaCoAP is more suitable for IoT devices.

An evaluation plan of bus architectures and protocols using the NASA Ames intelligent redundant actuation system

NASA Technical Reports Server (NTRS)

Defeo, P.; Chen, M.

1987-01-01

Means for evaluating data bus architectures and protocols for highly integrated flight control system applications are needed. Described are the criteria and plans to do this by using the NASA/Ames Intelligent Redundant Actuation System (IRAS) experimental set-up. Candidate bus architectures differ from one another in terms of: topology, access control, message transfer schemes, message characteristics, initialization. data flow control, transmission rates, fault tolerance, and time synchronization. The evaluation criteria are developed relative to these features. A preliminary, analytical evaluation of four candidate busses (MIL-STD-1553B, DATAC, Ethernet, and HSIS) is described. A bus must be exercised in a real-time environment to evaluate its dynamic characteristics. A plan for real-time evaluation of these four busses using a combination of hardware and simulation techniques is presented.

Gateway-Assisted Retransmission for Lightweight and Reliable IoT Communications

PubMed Central

Chang, Hui-Ling; Wang, Cheng-Gang; Wu, Mong-Ting; Tsai, Meng-Hsun; Lin, Chia-Ying

2016-01-01

Message Queuing Telemetry Transport for Sensor Networks (MQTT-SN) and Constrained Application Protocol (CoAP) are two protocols supporting publish/subscribe models for IoT devices to publish messages to interested subscribers. Retransmission mechanisms are introduced to compensate for the lack of data reliability. If the device does not receive the acknowledgement (ACK) before retransmission timeout (RTO) expires, the device will retransmit data. Setting an appropriate RTO is important because the delay may be large or retransmission may be too frequent when the RTO is inappropriate. We propose a Gateway-assisted CoAP (GaCoAP) to dynamically compute RTO for devices. Simulation models are proposed to investigate the performance of GaCoAP compared with four other methods. The experiment results show that GaCoAP is more suitable for IoT devices. PMID:27669243

Simple algorithm for improved security in the FDDI protocol

NASA Astrophysics Data System (ADS)

Lundy, G. M.; Jones, Benjamin

1993-02-01

We propose a modification to the Fiber Distributed Data Interface (FDDI) protocol based on a simple algorithm which will improve confidential communication capability. This proposed modification provides a simple and reliable system which exploits some of the inherent security properties in a fiber optic ring network. This method differs from conventional methods in that end to end encryption can be facilitated at the media access control sublayer of the data link layer in the OSI network model. Our method is based on a variation of the bit stream cipher method. The transmitting station takes the intended confidential message and uses a simple modulo two addition operation against an initialization vector. The encrypted message is virtually unbreakable without the initialization vector. None of the stations on the ring will have access to both the encrypted message and the initialization vector except the transmitting and receiving stations. The generation of the initialization vector is unique for each confidential transmission and thus provides a unique approach to the key distribution problem. The FDDI protocol is of particular interest to the military in terms of LAN/MAN implementations. Both the Army and the Navy are considering the standard as the basis for future network systems. A simple and reliable security mechanism with the potential to support realtime communications is a necessary consideration in the implementation of these systems. The proposed method offers several advantages over traditional methods in terms of speed, reliability, and standardization.

Joining the yellow hub: Uses of the Simple Application Messaging Protocol in Space Physics analysis tools

NASA Astrophysics Data System (ADS)

Génot, V.; André, N.; Cecconi, B.; Bouchemit, M.; Budnik, E.; Bourrel, N.; Gangloff, M.; Dufourg, N.; Hess, S.; Modolo, R.; Renard, B.; Lormant, N.; Beigbeder, L.; Popescu, D.; Toniutti, J.-P.

2014-11-01

The interest for data communication between analysis tools in planetary sciences and space physics is illustrated in this paper via several examples of the uses of SAMP. The Simple Application Messaging Protocol is developed in the frame of the IVOA from an earlier protocol called PLASTIC. SAMP enables easy communication and interoperability between astronomy software, stand-alone and web-based; it is now increasingly adopted by the planetary sciences and space physics community. Its attractiveness is based, on one hand, on the use of common file formats for exchange and, on the other hand, on established messaging models. Examples of uses at the CDPP and elsewhere are presented. The CDPP (Centre de Données de la Physique des Plasmas, http://cdpp.eu/), the French data center for plasma physics, is engaged for more than a decade in the archiving and dissemination of data products from space missions and ground observatories. Besides these activities, the CDPP developed services like AMDA (Automated Multi Dataset Analysis, http://amda.cdpp.eu/) which enables in depth analysis of large amount of data through dedicated functionalities such as: visualization, conditional search and cataloging. Besides AMDA, the 3DView (http://3dview.cdpp.eu/) tool provides immersive visualizations and is further developed to include simulation and observational data. These tools and their interactions with each other, notably via SAMP, are presented via science cases of interest to planetary sciences and space physics communities.

Event-Driven Messaging for Offline Data Quality Monitoring at ATLAS

NASA Astrophysics Data System (ADS)

Onyisi, Peter

2015-12-01

During LHC Run 1, the information flow through the offline data quality monitoring in ATLAS relied heavily on chains of processes polling each other's outputs for handshaking purposes. This resulted in a fragile architecture with many possible points of failure and an inability to monitor the overall state of the distributed system. We report on the status of a project undertaken during the LHC shutdown to replace the ad hoc synchronization methods with a uniform message queue system. This enables the use of standard protocols to connect processes on multiple hosts; reliable transmission of messages between possibly unreliable programs; easy monitoring of the information flow; and the removal of inefficient polling-based communication.

Design and Feasibility of a Text Messaging Intervention to Prevent Indoor Tanning Among Young Adult Women: A Pilot Study

PubMed Central

Mays, Darren

2016-01-01

Background Although skin cancer is largely preventable, it affects nearly 1 of 5 US adults. There is a need for research on how to optimally design persuasive public health indoor tanning prevention messages. Objective The objective of our study was to examine whether framed messages on indoor tanning behavioral intentions delivered through short message service (SMS) text messaging would produce (1) positive responses to the messages, including message receptivity and emotional response; (2) indoor tanning efficacy beliefs, including response efficacy and self-efficacy; and (3) indoor tanning risk beliefs. Methods We conducted a pilot study of indoor tanning prevention messages delivered via mobile phone text messaging in a sample of 21 young adult women who indoor tan. Participants completed baseline measures, were randomly assigned to receive gain-, loss-, or balanced-framed text messages, and completed postexposure outcome measures on indoor tanning cognitions and behaviors. Participants received daily mobile phone indoor tanning prevention text messages for 1 week and completed the same postexposure measures as at baseline. Results Over the 1-week period there were trends or significant changes after receipt of the text messages, including increased perceived susceptibility (P<.001), response efficacy beliefs (P<.001), and message receptivity (P=.03). Ordinary least squares stepwise linear regression models showed an effect of text message exposure on self-efficacy to quit indoor tanning (t6=–2.475, P<.02). Ordinary least squares linear regression including all measured scales showed a marginal effect of SMS texts on self-efficacy (t20=1.905, P=.08). Participants endorsed highly favorable views toward the text messaging protocol. Conclusions This study supports this use of mobile text messaging as an indoor tanning prevention strategy. Given the nature of skin cancer risk perceptions, the addition of multimedia messaging service is another area of potential innovation for disseminating indoor tanning prevention messages. PMID:28007691

Design and Feasibility of a Text Messaging Intervention to Prevent Indoor Tanning Among Young Adult Women: A Pilot Study.

PubMed

Evans, William D; Mays, Darren

2016-12-22

Although skin cancer is largely preventable, it affects nearly 1 of 5 US adults. There is a need for research on how to optimally design persuasive public health indoor tanning prevention messages. The objective of our study was to examine whether framed messages on indoor tanning behavioral intentions delivered through short message service (SMS) text messaging would produce (1) positive responses to the messages, including message receptivity and emotional response; (2) indoor tanning efficacy beliefs, including response efficacy and self-efficacy; and (3) indoor tanning risk beliefs. We conducted a pilot study of indoor tanning prevention messages delivered via mobile phone text messaging in a sample of 21 young adult women who indoor tan. Participants completed baseline measures, were randomly assigned to receive gain-, loss-, or balanced-framed text messages, and completed postexposure outcome measures on indoor tanning cognitions and behaviors. Participants received daily mobile phone indoor tanning prevention text messages for 1 week and completed the same postexposure measures as at baseline. Over the 1-week period there were trends or significant changes after receipt of the text messages, including increased perceived susceptibility (P<.001), response efficacy beliefs (P<.001), and message receptivity (P=.03). Ordinary least squares stepwise linear regression models showed an effect of text message exposure on self-efficacy to quit indoor tanning (t 6 =-2.475, P<.02). Ordinary least squares linear regression including all measured scales showed a marginal effect of SMS texts on self-efficacy (t 20 =1.905, P=.08). Participants endorsed highly favorable views toward the text messaging protocol. This study supports this use of mobile text messaging as an indoor tanning prevention strategy. Given the nature of skin cancer risk perceptions, the addition of multimedia messaging service is another area of potential innovation for disseminating indoor tanning prevention messages. ©William Evans, Darren Mays. Originally published in JMIR Mhealth and Uhealth (http://mhealth.jmir.org), 22.12.2016.

To amend the DNA Analysis Backlog Elimination Act of 2000 to provide for Debbie Smith grants for auditing sexual assault evidence backlogs, and for other purposes.

THOMAS, 112th Congress

Sen. Cornyn, John [R-TX

2012-05-24

Senate - 01/02/2013 Message on House action received in Senate and at desk: House amendments to Senate bill. (All Actions) Tracker: This bill has the status Passed HouseHere are the steps for Status of Legislation:

Support for Debugging Automatically Parallelized Programs

NASA Technical Reports Server (NTRS)

Hood, Robert; Jost, Gabriele

2001-01-01

This viewgraph presentation provides information on support sources available for the automatic parallelization of computer program. CAPTools, a support tool developed at the University of Greenwich, transforms, with user guidance, existing sequential Fortran code into parallel message passing code. Comparison routines are then run for debugging purposes, in essence, ensuring that the code transformation was accurate.

Earth observation taken by the Expedition 43 crew.

NASA Image and Video Library

2015-03-13

Earth observation taken during a day pass by the Expedition 43 crew aboard the International Space Station (ISS). Sent as part of Twitter message: #HappyStPatrickDay with best wishes from the #E43 crew! From space you can see the “Emerald Isle” is very green!

New Frontier Congressional Gold Medal Act

THOMAS, 111th Congress

Sen. Nelson, Bill [D-FL

2009-05-01

Senate - 09/23/2010 Message received in the Senate: Returned to the Senate pursuant to the provisions of H.Res. 1653. (All Actions) Notes: For further action, see H.R.2245, which became Public Law 111-44 on 8/7/2009. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Travel Promotion Act of 2009

THOMAS, 111th Congress

Sen. Dorgan, Byron L. [D-ND

2009-05-12

Senate - 09/23/2010 Message received in the Senate: Returned to the Senate pursuant to the provisions of H.Res. 1653. (All Actions) Notes: For further action, see H.R.1299, which became Public Law 111-145 on 3/4/2010. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Union Agitators

ERIC Educational Resources Information Center

Honawar, Vaishali

2006-01-01

A decade has passed since a few union leaders formed the network known as Teacher Union Reform Network (TURN) to search for innovative ways to enhance education. Selling their message has not always been easy. Created in 1995, TURN was the brain child of Adam Urbanski, the president of the Rochester (N.Y.) Teachers Association for the past 25…

Monitoring Data-Structure Evolution in Distributed Message-Passing Programs

NASA Technical Reports Server (NTRS)

Sarukkai, Sekhar R.; Beers, Andrew; Woodrow, Thomas S. (Technical Monitor)

1996-01-01

Monitoring the evolution of data structures in parallel and distributed programs, is critical for debugging its semantics and performance. However, the current state-of-art in tracking and presenting data-structure information on parallel and distributed environments is cumbersome and does not scale. In this paper we present a methodology that automatically tracks memory bindings (not the actual contents) of static and dynamic data-structures of message-passing C programs, using PVM. With the help of a number of examples we show that in addition to determining the impact of memory allocation overheads on program performance, graphical views can help in debugging the semantics of program execution. Scalable animations of virtual address bindings of source-level data-structures are used for debugging the semantics of parallel programs across all processors. In conjunction with light-weight core-files, this technique can be used to complement traditional debuggers on single processors. Detailed information (such as data-structure contents), on specific nodes, can be determined using traditional debuggers after the data structure evolution leading to the semantic error is observed graphically.

PVM Wrapper

NASA Technical Reports Server (NTRS)

Katz, Daniel

2004-01-01

PVM Wrapper is a software library that makes it possible for code that utilizes the Parallel Virtual Machine (PVM) software library to run using the message-passing interface (MPI) software library, without needing to rewrite the entire code. PVM and MPI are the two most common software libraries used for applications that involve passing of messages among parallel computers. Since about 1996, MPI has been the de facto standard. Codes written when PVM was popular often feature patterns of {"initsend," "pack," "send"} and {"receive," "unpack"} calls. In many cases, these calls are not contiguous and one set of calls may even exist over multiple subroutines. These characteristics make it difficult to obtain equivalent functionality via a single MPI "send" call. Because PVM Wrapper is written to run with MPI- 1.2, some PVM functions are not permitted and must be replaced - a task that requires some programming expertise. The "pvm_spawn" and "pvm_parent" function calls are not replaced, but a programmer can use "mpirun" and knowledge of the ranks of parent and child tasks with supplied macroinstructions to enable execution of codes that use "pvm_spawn" and "pvm_parent."

Parallelized direct execution simulation of message-passing parallel programs

NASA Technical Reports Server (NTRS)

Dickens, Phillip M.; Heidelberger, Philip; Nicol, David M.

1994-01-01

As massively parallel computers proliferate, there is growing interest in findings ways by which performance of massively parallel codes can be efficiently predicted. This problem arises in diverse contexts such as parallelizing computers, parallel performance monitoring, and parallel algorithm development. In this paper we describe one solution where one directly executes the application code, but uses a discrete-event simulator to model details of the presumed parallel machine such as operating system and communication network behavior. Because this approach is computationally expensive, we are interested in its own parallelization specifically the parallelization of the discrete-event simulator. We describe methods suitable for parallelized direct execution simulation of message-passing parallel programs, and report on the performance of such a system, Large Application Parallel Simulation Environment (LAPSE), we have built on the Intel Paragon. On all codes measured to date, LAPSE predicts performance well typically within 10 percent relative error. Depending on the nature of the application code, we have observed low slowdowns (relative to natively executing code) and high relative speedups using up to 64 processors.

A Multi-Center Space Data System Prototype Based on CCSDS Standards

NASA Technical Reports Server (NTRS)

Rich, Thomas M.

2016-01-01

Deep space missions beyond earth orbit will require new methods of data communications in order to compensate for increasing RF propagation delay. The Consultative Committee for Space Data Systems (CCSDS) standard protocols Spacecraft Monitor & Control (SM&C), Asynchronous Message Service (AMS), and Delay/Disruption Tolerant Networking (DTN) provide such a method. The maturity level of this protocol set is, however, insufficient for mission inclusion at this time. This prototype is intended to provide experience which will raise the Technical Readiness Level (TRL) of these protocols..

Minimum expected delay-based routing protocol (MEDR) for Delay Tolerant Mobile Sensor Networks.

PubMed

Feng, Yong; Liu, Ming; Wang, Xiaomin; Gong, Haigang

2010-01-01

It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing performance by finding and using the connected paths formed dynamically by mobile sensors. In MEDR, each sensor maintains two important parameters: Minimum Expected Delay (MED) and its expiration time. According to MED, messages will be delivered to the sensor that has at least a connected path with their hosting nodes, and has the shortest expected delay to communication directly with the sink node. Because of the changing network topology, the path is fragile and volatile, so we use the expiration time of MED to indicate the valid time of the path, and avoid wrong transmissions. Simulation results show that the proposed MEDR achieves a higher message delivery ratio with lower transmission overhead and data delivery delay than other DTMSN routing approaches.

Internet Protocol Security (IPSEC): Testing and Implications on IPv4 and IPv6 Networks

DTIC Science & Technology

2008-08-27

Message Authentication Code-Message Digest 5-96). Due to the processing power consumption and slowness of public key authentication methods, RSA ...MODP) group with a 768 -bit modulus 2. a MODP group with a 1024-bit modulus 3. an Elliptic Curve Group over GF[ 2n ] (EC2N) group with a 155-bit...nonces, digital signatures using the Digital Signature Algorithm, and the Rivest-Shamir- Adelman ( RSA ) algorithm. For more information about the

Low-pass filtering of noisy Schlumberger sounding curves. Part I: Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Patella, D.

1986-02-01

A contribution is given to the solution of the problem of filtering noise-degraded Schlumberger sounding curves. It is shown that the transformation to the pole-pole system is actually a smoothing operation that filters high-frequency noise. In the case of residual noise contamination in the transformed pole-pole curve, it is demonstrated that a subsequent application of a conventional rectangular low-pass filter, with cut-off frequency not less than the right-hand frequency limit of the main message pass-band, may satisfactorily solve the problem by leaving a pole-pole curve available for interpretation. An attempt is also made to understand the essential peculiarities of themore » pole-pole system as far as penetration depth, resolving power and selectivity power are concerned.« less

Message passing with queues and channels

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer

In an embodiment, a reception thread receives a source node identifier, a type, and a data pointer from an application and, in response, creates a receive request. If the source node identifier specifies a source node, the reception thread adds the receive request to a fast-post queue. If a message received from a network does not match a receive request on a posted queue, a polling thread adds a receive request that represents the message to an unexpected queue. If the fast-post queue contains the receive request, the polling thread removes the receive request from the fast-post queue. If themore » receive request that was removed from the fast-post queue does not match the receive request on the unexpected queue, the polling thread adds the receive request that was removed from the fast-post queue to the posted queue. The reception thread and the polling thread execute asynchronously from each other.« less

Secure Web-Site Access with Tickets and Message-Dependent Digests

USGS Publications Warehouse

Donato, David I.

2008-01-01

Although there are various methods for restricting access to documents stored on a World Wide Web (WWW) site (a Web site), none of the widely used methods is completely suitable for restricting access to Web applications hosted on an otherwise publicly accessible Web site. A new technique, however, provides a mix of features well suited for restricting Web-site or Web-application access to authorized users, including the following: secure user authentication, tamper-resistant sessions, simple access to user state variables by server-side applications, and clean session terminations. This technique, called message-dependent digests with tickets, or MDDT, maintains secure user sessions by passing single-use nonces (tickets) and message-dependent digests of user credentials back and forth between client and server. Appendix 2 provides a working implementation of MDDT with PHP server-side code and JavaScript client-side code.

Real time explosive hazard information sensing, processing, and communication for autonomous operation

DOEpatents

Versteeg, Roelof J; Few, Douglas A; Kinoshita, Robert A; Johnson, Doug; Linda, Ondrej

2015-02-24

Methods, computer readable media, and apparatuses provide robotic explosive hazard detection. A robot intelligence kernel (RIK) includes a dynamic autonomy structure with two or more autonomy levels between operator intervention and robot initiative A mine sensor and processing module (ESPM) operating separately from the RIK perceives environmental variables indicative of a mine using subsurface perceptors. The ESPM processes mine information to determine a likelihood of a presence of a mine. A robot can autonomously modify behavior responsive to an indication of a detected mine. The behavior is modified between detection of mines, detailed scanning and characterization of the mine, developing mine indication parameters, and resuming detection. Real time messages are passed between the RIK and the ESPM. A combination of ESPM bound messages and RIK bound messages cause the robot platform to switch between modes including a calibration mode, the mine detection mode, and the mine characterization mode.

Real time explosive hazard information sensing, processing, and communication for autonomous operation

DOEpatents

Versteeg, Roelof J.; Few, Douglas A.; Kinoshita, Robert A.; Johnson, Douglas; Linda, Ondrej

2015-12-15

Methods, computer readable media, and apparatuses provide robotic explosive hazard detection. A robot intelligence kernel (RIK) includes a dynamic autonomy structure with two or more autonomy levels between operator intervention and robot initiative A mine sensor and processing module (ESPM) operating separately from the RIK perceives environmental variables indicative of a mine using subsurface perceptors. The ESPM processes mine information to determine a likelihood of a presence of a mine. A robot can autonomously modify behavior responsive to an indication of a detected mine. The behavior is modified between detection of mines, detailed scanning and characterization of the mine, developing mine indication parameters, and resuming detection. Real time messages are passed between the RIK and the ESPM. A combination of ESPM bound messages and RIK bound messages cause the robot platform to switch between modes including a calibration mode, the mine detection mode, and the mine characterization mode.

Machine-checked proofs of the design and implementation of a fault-tolerant circuit

NASA Technical Reports Server (NTRS)

Bevier, William R.; Young, William D.

1990-01-01

A formally verified implementation of the 'oral messages' algorithm of Pease, Shostak, and Lamport is described. An abstract implementation of the algorithm is verified to achieve interactive consistency in the presence of faults. This abstract characterization is then mapped down to a hardware level implementation which inherits the fault-tolerant characteristics of the abstract version. All steps in the proof were checked with the Boyer-Moore theorem prover. A significant results is the demonstration of a fault-tolerant device that is formally specified and whose implementation is proved correct with respect to this specification. A significant simplifying assumption is that the redundant processors behave synchronously. A mechanically checked proof that the oral messages algorithm is 'optimal' in the sense that no algorithm which achieves agreement via similar message passing can tolerate a larger proportion of faulty processor is also described.

Defense in Depth Added to Malicious Activities Simulation Tools (MAST)

DTIC Science & Technology

2015-09-01

cipher suites. The TLS Handshake is a combination of three components: handshake, change cipher spec, and alert. 41 (1) The Handshake ( Hello ) The...TLS Handshake, specifically the “ Hello ” portion, is designed to negotiate session parameters (cipher suite). The client informs the server of the...protocols and standards that it supports and then the server selects the highest common protocols and standards. Specifically, the Client Hello message

SVANET: A smart vehicular ad hoc network for efficient data transmission with wireless sensors.

PubMed

Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

2014-11-25

Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency.

SVANET: A Smart Vehicular Ad Hoc Network for Efficient Data Transmission with Wireless Sensors

PubMed Central

Sahoo, Prasan Kumar; Chiang, Ming-Jer; Wu, Shih-Lin

2014-01-01

Wireless sensors can sense any event, such as accidents, as well as icy roads, and can forward the rescue/warning messages through intermediate vehicles for any necessary help. In this paper, we propose a smart vehicular ad hoc network (SVANET) architecture that uses wireless sensors to detect events and vehicles to transmit the safety and non-safety messages efficiently by using different service channels and one control channel with different priorities. We have developed a data transmission protocol for the vehicles in the highway, in which data can be forwarded with the help of vehicles if they are connected with each other or data can be forwarded with the help of nearby wireless sensors. Our data transmission protocol is designed to increase the driving safety, to prevent accidents and to utilize channels efficiently by adjusting the control and service channel time intervals dynamically. Besides, our protocol can transmit information to vehicles in advance, so that drivers can decide an alternate route in case of traffic congestion. For various data sharing, we design a method that can select a few leader nodes among vehicles running along a highway to broadcast data efficiently. Simulation results show that our protocol can outperform the existing standard in terms of the end to end packet delivery ratio and latency. PMID:25429409

Parallel community climate model: Description and user`s guide

DOE Office of Scientific and Technical Information (OSTI.GOV)

Drake, J.B.; Flanery, R.E.; Semeraro, B.D.

This report gives an overview of a parallel version of the NCAR Community Climate Model, CCM2, implemented for MIMD massively parallel computers using a message-passing programming paradigm. The parallel implementation was developed on an Intel iPSC/860 with 128 processors and on the Intel Delta with 512 processors, and the initial target platform for the production version of the code is the Intel Paragon with 2048 processors. Because the implementation uses a standard, portable message-passing libraries, the code has been easily ported to other multiprocessors supporting a message-passing programming paradigm. The parallelization strategy used is to decompose the problem domain intomore » geographical patches and assign each processor the computation associated with a distinct subset of the patches. With this decomposition, the physics calculations involve only grid points and data local to a processor and are performed in parallel. Using parallel algorithms developed for the semi-Lagrangian transport, the fast Fourier transform and the Legendre transform, both physics and dynamics are computed in parallel with minimal data movement and modest change to the original CCM2 source code. Sequential or parallel history tapes are written and input files (in history tape format) are read sequentially by the parallel code to promote compatibility with production use of the model on other computer systems. A validation exercise has been performed with the parallel code and is detailed along with some performance numbers on the Intel Paragon and the IBM SP2. A discussion of reproducibility of results is included. A user`s guide for the PCCM2 version 2.1 on the various parallel machines completes the report. Procedures for compilation, setup and execution are given. A discussion of code internals is included for those who may wish to modify and use the program in their own research.« less

High Performance Programming Using Explicit Shared Memory Model on Cray T3D1

NASA Technical Reports Server (NTRS)

Simon, Horst D.; Saini, Subhash; Grassi, Charles

1994-01-01

The Cray T3D system is the first-phase system in Cray Research, Inc.'s (CRI) three-phase massively parallel processing (MPP) program. This system features a heterogeneous architecture that closely couples DEC's Alpha microprocessors and CRI's parallel-vector technology, i.e., the Cray Y-MP and Cray C90. An overview of the Cray T3D hardware and available programming models is presented. Under Cray Research adaptive Fortran (CRAFT) model four programming methods (data parallel, work sharing, message-passing using PVM, and explicit shared memory model) are available to the users. However, at this time data parallel and work sharing programming models are not available to the user community. The differences between standard PVM and CRI's PVM are highlighted with performance measurements such as latencies and communication bandwidths. We have found that the performance of neither standard PVM nor CRI s PVM exploits the hardware capabilities of the T3D. The reasons for the bad performance of PVM as a native message-passing library are presented. This is illustrated by the performance of NAS Parallel Benchmarks (NPB) programmed in explicit shared memory model on Cray T3D. In general, the performance of standard PVM is about 4 to 5 times less than obtained by using explicit shared memory model. This degradation in performance is also seen on CM-5 where the performance of applications using native message-passing library CMMD on CM-5 is also about 4 to 5 times less than using data parallel methods. The issues involved (such as barriers, synchronization, invalidating data cache, aligning data cache etc.) while programming in explicit shared memory model are discussed. Comparative performance of NPB using explicit shared memory programming model on the Cray T3D and other highly parallel systems such as the TMC CM-5, Intel Paragon, Cray C90, IBM-SP1, etc. is presented.

Space Network Time Distribution and Synchronization Protocol Development for Mars Proximity Link

NASA Technical Reports Server (NTRS)

Woo, Simon S.; Gao, Jay L.; Mills, David

2010-01-01

Time distribution and synchronization in deep space network are challenging due to long propagation delays, spacecraft movements, and relativistic effects. Further, the Network Time Protocol (NTP) designed for terrestrial networks may not work properly in space. In this work, we consider the time distribution protocol based on time message exchanges similar to Network Time Protocol (NTP). We present the Proximity-1 Space Link Interleaved Time Synchronization (PITS) algorithm that can work with the CCSDS Proximity-1 Space Data Link Protocol. The PITS algorithm provides faster time synchronization via two-way time transfer over proximity links, improves scalability as the number of spacecraft increase, lowers storage space requirement for collecting time samples, and is robust against packet loss and duplication which underlying protocol mechanisms provide.

Compositional Verification of a Communication Protocol for a Remotely Operated Vehicle

NASA Technical Reports Server (NTRS)

Goodloe, Alwyn E.; Munoz, Cesar A.

2009-01-01

This paper presents the specification and verification in the Prototype Verification System (PVS) of a protocol intended to facilitate communication in an experimental remotely operated vehicle used by NASA researchers. The protocol is defined as a stack-layered com- position of simpler protocols. It can be seen as the vertical composition of protocol layers, where each layer performs input and output message processing, and the horizontal composition of different processes concurrently inhabiting the same layer, where each process satisfies a distinct requirement. It is formally proven that the protocol components satisfy certain delivery guarantees. Compositional techniques are used to prove these guarantees also hold in the composed system. Although the protocol itself is not novel, the methodology employed in its verification extends existing techniques by automating the tedious and usually cumbersome part of the proof, thereby making the iterative design process of protocols feasible.

Comparing Mobile Health Strategies to Improve Medication Adherence for Veterans With Coronary Heart Disease (Mobile4Meds): Protocol for a Mixed-Methods Study.

PubMed

Park, Linda G; Collins, Eileen G; Shim, Janet K; Whooley, Mary A

2017-07-18

Adherence to antiplatelet medications is critical to prevent life threatening complications (ie, stent thrombosis) after percutaneous coronary interventions (PCIs), yet rates of nonadherence range from 21-57% by 12 months. Mobile interventions delivered via text messaging or mobile apps represent a practical and inexpensive strategy to promote behavior change and enhance medication adherence. The Mobile4Meds study seeks to determine whether text messaging or a mobile app, compared with an educational website control provided to all Veterans, can improve adherence to antiplatelet therapy among patients following acute coronary syndrome (ACS) or PCI. The three aims of the study are to: (1) determine preferences for content and frequency of text messaging to promote medication adherence through focus groups; (2) identify the most patient-centered app that promotes adherence, through a content analysis of all commercially available apps for medication adherence and focus groups centered on usability; and (3) compare adherence to antiplatelet medications in Veterans after ACS/PCI via a randomized clinical trial (RCT). We will utilize a mixed-methods design that uses focus groups to achieve the first and second aims (N=32). Patients will be followed for 12 months after being randomly assigned to one of three arms: (1) customized text messaging, (2) mobile app, or (3) website-control groups (N=225). Medication adherence will be measured with electronic monitoring devices, pharmacy records, and self-reports. Enrollment for the focus groups is currently in progress. We expect to enroll patients for the RCT in the beginning of 2018. Determining the efficacy of mobile technology using a Veteran-designed protocol to promote medication adherence will have a significant impact on Veteran health and public health, particularly for individuals with chronic diseases that require strict medication adherence. ClinicalTrials.gov NCT03022669. ©Linda G Park, Eileen G Collins, Janet K Shim, Mary A Whooley. Originally published in JMIR Research Protocols (http://www.researchprotocols.org), 18.07.2017.

Short message service (SMS) interventions for the prevention and treatment of sexually transmitted infections: a systematic review protocol

PubMed Central

2014-01-01

Background Globally, the incidence of sexually transmitted infections (STI) is rising, posing a challenge to its control and appropriate management. Text messaging has become the most common mode of communication among almost six billion mobile phone users worldwide. Text messaging can be used to remind patients about clinic appointments, to notify patients that it is time for STI re-testing, and to facilitate patient communication with their health professionals with any questions and concerns they may have about their sexual health. While there are a handful of systematic reviews published on short message service (SMS) interventions in a variety of health settings and issues, none are related to sexual health. We plan to conduct a systematic review to examine the impact text messaging might have on interventions for the prevention and care of patients with STIs. Methods/Design Eligible studies will include both quantitative and qualitative studies published after 1995 that discuss the efficacy and effectiveness of SMS interventions for STI prevention and management using text messaging. Data will be abstracted independently by two reviewers using a standardized pre-tested data abstraction form. Inter-rater reliability scores will be obtained to ensure consistency in the inclusion and data extraction of studies. Heterogeneity will be assessed using the I2 test and subgroup analyses. A nonhypothesis driven inductive reasoning approach as well as a coding framework will be applied to analyze qualitative studies. A meta-analysis may be conducted if sufficient quantitative studies are found using similar outcomes. Discussion For this protocol, we identified ten related systematic reviews. The reviews were limited to a particular disease or setting, were not exclusive to SMS interventions, or were out of date. This systematic review will be the first comprehensive examination of studies that discuss the effectiveness of SMS on multiple outcomes that relate to STI prevention and management, covering diverse settings and populations. Findings of the systematic review and any additional meta-analyses will be published and presented to our key knowledge users. This information will provide the evidence that is required to appropriately adopt text messaging into standard practice in STI care. PMID:24433348

Validation of the Omron M6 (HEM-7001-E) upper arm blood pressure measuring device according to the International Protocol in elderly patients.

PubMed

Altunkan, Sekip; Iliman, Nevzat; Altunkan, Erkan

2008-04-01

Despite the widespread use of automated self-measurement monitors, there is limited published evidence on their accuracy and reliability on different patient groups. The objective of this study was to evaluate the accuracy and reliability of the Omron M6 (HEM-7001-E) upper-arm blood pressure (BP) device against mercury sphygmomanometer on elderly patients according to the criteria of the International Protocol. Thirty-three patients above 65 years of age, who were classified based on the BP categories of the International Protocol, were recruited for the study. BP measurements at the upper arm with the Omron M6 were compared with the results obtained by two trained observers using a mercury sphygmomanometer. Nine sequential BP measurements were taken. During the validation study, 99 measurements were obtained from 33 patients for comparison. The first phase was carried out on 15 patients and if the device passed this phase, 18 more patients were selected. Mean discrepancies and standard deviations of the device sphygmomanometer were 1.4+/-5.3 mmHg for systolic BP (SBP) and -1.4+/-4.5 mmHg for diastolic BP (DBP) in the study group. The device passed phase 1 in 15 patients. In phase 2.1, from the total 99 comparisons, 76, 92, and 97 for SBP and 77, 94, and 99 for DBP were less than 5, 10, and 15 mmHg, respectively. The Omron M6 passed phases 2.1 and 2.2 in the elderly group of patients. The Omron M6 (HEM-7001-E) upper-arm BP monitor passed according to the International Protocol criteria and can be recommended for use in elderly patients.

Plasma skin regeneration technology.

PubMed

Bogle, M A

2006-09-01

Plasma skin regeneration (PSR) technology uses energy delivered from plasma rather than light or radiofrequency. Plasma is the fourth state of matter in which electrons are stripped from atoms to form an ionized gas. The plasma is emitted in a millisecond pulse to deliver energy to target tissue upon contact without reliance on skin chromophores. The technology can be used at varying energies for different depths of effect, from superficial epidermal sloughing to deeper dermal heating. With the Portrait PSR device (Rhytec, Inc.) there are three treatment guidelines termed PSR1, PSR2, and PSR3. The PSR1 protocol uses a series of low-energy treatments (1.0,1.2 Joules) spaced 3 weeks apart. The PSR2 protocol uses one high-energy pass (3.0, 4.0 Joules) performed in a single treatment, and the PSR3 protocol uses two high-energy passes (3.0 4.0 Joules) performed in a single treatment. All protocols improve fine lines, textural irregularities, and dyspigmentation; however, skin tightening is probably more pronounced with the high-energy treatments.

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

NASA Technical Reports Server (NTRS)

Mehra, Pankaj; VanVoorst, Brian; Yan, Jerry; Tucker, Deanne (Technical Monitor)

1994-01-01

We present views and analysis of the execution of several PVM codes for Computational Fluid Dynamics on a network of Sparcstations, including (a) NAS Parallel benchmarks CG and MG (White, Alund and Sunderam 1993); (b) a multi-partitioning algorithm for NAS Parallel Benchmark SP (Wijngaart 1993); and (c) an overset grid flowsolver (Smith 1993). These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains (a) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (b) Monitor, a library of run-time trace-collection routines; (c) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (d) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses X11R5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (a) the impact of long message latencies; (b) the impact of multiprogramming overheads and associated load imbalance; (c) cache and virtual-memory effects; and (4significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (a) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets; and (b) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Protocols for Handling Messages Between Simulation Computers

NASA Technical Reports Server (NTRS)

Balcerowski, John P.; Dunnam, Milton

2006-01-01

Practical Simulator Network (PSimNet) is a set of data-communication protocols designed especially for use in handling messages between computers that are engaging cooperatively in real-time or nearly-real-time training simulations. In a typical application, computers that provide individualized training at widely dispersed locations would communicate, by use of PSimNet, with a central host computer that would provide a common computational- simulation environment and common data. Originally intended for use in supporting interfaces between training computers and computers that simulate the responses of spacecraft scientific payloads, PSimNet could be especially well suited for a variety of other applications -- for example, group automobile-driver training in a classroom. Another potential application might lie in networking of automobile-diagnostic computers at repair facilities to a central computer that would compile the expertise of numerous technicians and engineers and act as an expert consulting technician.

Extended Theories of Gravitation. Observation Protocols and Experimental Tests

NASA Astrophysics Data System (ADS)

Fatibene, Lorenzo; Ferraris, Marco; Francaviglia, Mauro; Magnano, Guido

2013-09-01

Within the framework of extended theories of gravitation we shall discuss physical equivalences among different formalisms and classical tests. As suggested by the Ehlers-Pirani-Schild framework, the conformal invariance will be preserved and its effect on observational protocols discussed. Accordingly, we shall review standard tests showing how Palatini f(R)-theories naturally passes solar system tests. Observation protocols will be discussed in this wider framework.

A Technique for Presenting a Deceptive Dynamic Network Topology

DTIC Science & Technology

2013-03-01

Comment RIP Routing Information Protocol SNOS Systemic Network Obfuscation System SSH Secure Shell TCP Transmission Control Protocol TTL time to live...because it sacrifices elements available in Transmission Control Protocol ( TCP ) such as ordered delivery of packets, delivery confirmation and duplication...avoidance [4]. Of note, some traceroute implementations use TCP packets since they are able to pass through firewalls which are typically configured

Telemetry Standards, RCC Standard 106-17. Chapter 21. Telemetry Network Standard Introduction

DTIC Science & Technology

2017-07-01

Critical RF radio frequency RFC Request for Comment SNMP Simple Network Management Protocol TA test article TCP Transmission Control Protocol...chapters might be of most interest for a particular reader. In order to guide the reader toward the chapters of further interest , the applicable... Simple Network Management Protocol (SNMP) to pass management information through the system. The SNMP management information bases (MIBs) provide

Approving the renewal of import restrictions contained in the Burmese Freedom and Democracy Act of 2003.

THOMAS, 112th Congress

Rep. Crowley, Joseph [D-NY-7

2011-05-26

Senate - 09/15/2011 Message on Senate action sent to the House. (All Actions) Notes: For further action, see H.R.2017, which became Public Law 112-33 on 9/30/2011. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Final report: Compiled MPI. Cost-Effective Exascale Application Development

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gropp, William Douglas

2015-12-21

This is the final report on Compiled MPI: Cost-Effective Exascale Application Development, and summarizes the results under this project. The project investigated runtime enviroments that improve the performance of MPI (Message-Passing Interface) programs; work at Illinois in the last period of this project looked at optimizing data access optimizations expressed with MPI datatypes.

Emergency Border Security Supplemental Appropriations Act, 2010

THOMAS, 111th Congress

Rep. Price, David E. [D-NC-4

2010-07-27

Senate - 09/23/2010 Message received in the Senate: Returned to the Senate pursuant to the provisions of H.Res. 1653. (All Actions) Notes: For further action, see H.R.6080, which became Public Law 111-230 on 8/13/2010. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

A Down-to-Earth Educational Operating System for Up-in-the-Cloud Many-Core Architectures

ERIC Educational Resources Information Center

Ziwisky, Michael; Persohn, Kyle; Brylow, Dennis

2013-01-01

We present "Xipx," the first port of a major educational operating system to a processor in the emerging class of many-core architectures. Through extensions to the proven Embedded Xinu operating system, Xipx gives students hands-on experience with system programming in a distributed message-passing environment. We expose the software primitives…

LDPC Codes--Structural Analysis and Decoding Techniques

ERIC Educational Resources Information Center

Zhang, Xiaojie

2012-01-01

Low-density parity-check (LDPC) codes have been the focus of much research over the past decade thanks to their near Shannon limit performance and to their efficient message-passing (MP) decoding algorithms. However, the error floor phenomenon observed in MP decoding, which manifests itself as an abrupt change in the slope of the error-rate curve,…

Comprehensive Iran Sanctions, Accountability, and Divestment Act of 2009

THOMAS, 111th Congress

Sen. Dodd, Christopher J. [D-CT

2009-11-19

Senate - 09/23/2010 Message received in the Senate: Returned to the Senate pursuant to the provisions of H.Res. 1653. (All Actions) Notes: For further action, see H.R.2194, which became Public Law 111-195 on 7/1/2010. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Federal Aviation Administration Extension Act of 2010

THOMAS, 111th Congress

Sen. Rockefeller, John D., IV [D-WV

2010-03-25

Senate - 09/23/2010 Message received in the Senate: Returned to the Senate pursuant to the provisions of H.Res. 1653. (All Actions) Notes: For further action, see H.R.5147, which became Public Law 111-161 on 4/30/2010. Tracker: This bill has the status Passed SenateHere are the steps for Status of Legislation:

Minority Journalists Push Media to Maintain Diversity Commitment

ERIC Educational Resources Information Center

Anderson, Michelle D.

2008-01-01

In a media advisory released earlier this month, the National Association of Black Journalists (NABJ) had an urgent message for the newspaper industry: Diversity should not be treated like a passing fad and it should continue to be a top priority. The advocacy organization, where a majority of its 4,000 members are Black print journalists, warned…

New Results on Unconditionally Secure Multi-receiver Manual Authentication

NASA Astrophysics Data System (ADS)

Wang, Shuhong; Safavi-Naini, Reihaneh

Manual authentication is a recently proposed model of communication motivated by the settings where the only trusted infrastructure is a low bandwidth authenticated channel, possibly realized by the aid of a human, that connects the sender and the receiver who are otherwise connected through an insecure channel and do not have any shared key or public key infrastructure. A good example of such scenarios is pairing of devices in Bluetooth. Manual authentication systems are studied in computational and information theoretic security model and protocols with provable security have been proposed. In this paper we extend the results in information theoretic model in two directions. Firstly, we extend a single receiver scenario to multireceiver case where the sender wants to authenticate the same message to a group of receivers. We show new attacks (compared to single receiver case) that can launched in this model and demonstrate that the single receiver lower bound 2log(1/ɛ) + O(1) on the bandwidth of manual channel stays valid in the multireceiver scenario. We further propose a protocol that achieves this bound and provides security, in the sense that we define, if up to c receivers are corrupted. The second direction is the study of non-interactive protocols in unconditionally secure model. We prove that unlike computational security framework, without interaction a secure authentication protocol requires the bandwidth of the manual channel to be at least the same as the message size, hence non-trivial protocols do not exist.

Testing warning messages on smokers’ cigarette packages: A standardized protocol

PubMed Central

Brewer, Noel T.; Hall, Marissa G.; Lee, Joseph G. L.; Peebles, Kathryn; Noar, Seth M.; Ribisl, Kurt M.

2015-01-01

Purpose Lab experiments on cigarette warnings typically use a brief one-time exposure that is not paired with the cigarette packs smokers use every day, leaving open the question of how repeated warning exposure over several weeks may affect smokers. This proof of principle study sought to develop a new protocol for testing cigarette warnings that better reflects real-world exposure by presenting them on cigarette smokers’ own packs. Methods We tested a cigarette pack labeling protocol with 76 US smokers ages 18 and older. We applied graphic warnings to the front and back of smokers’ cigarette packs. Results Most smokers reported that at least 75% of the packs of cigarettes they smoked during the study had our warnings. Nearly all said they would participate in the study again. Using cigarette packs with the study warnings increased quit intentions (p<.05). Conclusion Our findings suggest a feasible pack labeling protocol with six steps: (1) schedule appointments at brief intervals; (2) determine typical cigarette consumption; (3) ask smokers to bring a supply of cigarette packs to study appointments; (4) apply labels to smokers’ cigarette packs; (5) provide participation incentives at the end of appointments; and (6) refer smokers to cessation services at end of the study. When used in randomized controlled trials in settings with real-world message exposure over time, this protocol may help identify the true impact of warnings and thus better inform tobacco product labeling policy. PMID:25564282

Proof of Concept Integration of a Single-Level Service-Oriented Architecture into a Multi-Domain Secure Environment

DTIC Science & Technology

2008-03-01

Machine [29]. OC4J applications support Java Servlets , Web services, and the following J2EE specific standards: Extensible Markup Language (XML...IMAP Internet Message Access Protocol IP Internet Protocol IT Information Technology xviii J2EE Java Enterprise Environment JSR 168 Java ...LDAP), World Wide Web Distributed Authoring and Versioning (WebDav), Java Specification Request 168 (JSR 168), and Web Services for Remote

Comment on "Bit-string oblivious transfer based on quantum state computational distinguishability"

NASA Astrophysics Data System (ADS)

He, Guang Ping

2015-10-01

We show that in the protocol proposed in Phys. Rev. A 91, 042306 (2015), 10.1103/PhysRevA.91.042306, a dishonest sender can always ensure with certainty that the receiver fails to get the secret message. Thus the security requirement of oblivious transfer is not met. This security problem also makes the protocol unsuitable for serving as a building block for 1-out-of-2 oblivious transfer.

Remote object authentication: confidence model, cryptosystem and protocol

NASA Astrophysics Data System (ADS)

Lancrenon, Jean; Gillard, Roland; Fournel, Thierry

2009-04-01

This paper follows a paper by Bringer et al.3 to adapt a security model and protocol used for remote biometric authentication to the case of remote morphometric object authentication. We use a different type of encryption technique that requires smaller key sizes and has a built-in mechanism to help control the integrity of the messages received by the server. We also describe the optical technology used to extract the morphometric templates.

ms2: A molecular simulation tool for thermodynamic properties

NASA Astrophysics Data System (ADS)

Deublein, Stephan; Eckl, Bernhard; Stoll, Jürgen; Lishchuk, Sergey V.; Guevara-Carrion, Gabriela; Glass, Colin W.; Merker, Thorsten; Bernreuther, Martin; Hasse, Hans; Vrabec, Jadran

2011-11-01

This work presents the molecular simulation program ms2 that is designed for the calculation of thermodynamic properties of bulk fluids in equilibrium consisting of small electro-neutral molecules. ms2 features the two main molecular simulation techniques, molecular dynamics (MD) and Monte-Carlo. It supports the calculation of vapor-liquid equilibria of pure fluids and multi-component mixtures described by rigid molecular models on the basis of the grand equilibrium method. Furthermore, it is capable of sampling various classical ensembles and yields numerous thermodynamic properties. To evaluate the chemical potential, Widom's test molecule method and gradual insertion are implemented. Transport properties are determined by equilibrium MD simulations following the Green-Kubo formalism. ms2 is designed to meet the requirements of academia and industry, particularly achieving short response times and straightforward handling. It is written in Fortran90 and optimized for a fast execution on a broad range of computer architectures, spanning from single processor PCs over PC-clusters and vector computers to high-end parallel machines. The standard Message Passing Interface (MPI) is used for parallelization and ms2 is therefore easily portable to different computing platforms. Feature tools facilitate the interaction with the code and the interpretation of input and output files. The accuracy and reliability of ms2 has been shown for a large variety of fluids in preceding work. Program summaryProgram title:ms2 Catalogue identifier: AEJF_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJF_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Special Licence supplied by the authors No. of lines in distributed program, including test data, etc.: 82 794 No. of bytes in distributed program, including test data, etc.: 793 705 Distribution format: tar.gz Programming language: Fortran90 Computer: The simulation tool ms2 is usable on a wide variety of platforms, from single processor machines over PC-clusters and vector computers to vector-parallel architectures. (Tested with Fortran compilers: gfortran, Intel, PathScale, Portland Group and Sun Studio.) Operating system: Unix/Linux, Windows Has the code been vectorized or parallelized?: Yes. Message Passing Interface (MPI) protocol Scalability. Excellent scalability up to 16 processors for molecular dynamics and >512 processors for Monte-Carlo simulations. RAM:ms2 runs on single processors with 512 MB RAM. The memory demand rises with increasing number of processors used per node and increasing number of molecules. Classification: 7.7, 7.9, 12 External routines: Message Passing Interface (MPI) Nature of problem: Calculation of application oriented thermodynamic properties for rigid electro-neutral molecules: vapor-liquid equilibria, thermal and caloric data as well as transport properties of pure fluids and multi-component mixtures. Solution method: Molecular dynamics, Monte-Carlo, various classical ensembles, grand equilibrium method, Green-Kubo formalism. Restrictions: No. The system size is user-defined. Typical problems addressed by ms2 can be solved by simulating systems containing typically 2000 molecules or less. Unusual features: Feature tools are available for creating input files, analyzing simulation results and visualizing molecular trajectories. Additional comments: Sample makefiles for multiple operation platforms are provided. Documentation is provided with the installation package and is available at http://www.ms-2.de. Running time: The running time of ms2 depends on the problem set, the system size and the number of processes used in the simulation. Running four processes on a "Nehalem" processor, simulations calculating VLE data take between two and twelve hours, calculating transport properties between six and 24 hours.

Concurrent hypercube system with improved message passing

NASA Technical Reports Server (NTRS)

Peterson, John C. (Inventor); Tuazon, Jesus O. (Inventor); Lieberman, Don (Inventor); Pniel, Moshe (Inventor)

1989-01-01

A network of microprocessors, or nodes, are interconnected in an n-dimensional cube having bidirectional communication links along the edges of the n-dimensional cube. Each node's processor network includes an I/O subprocessor dedicated to controlling communication of message packets along a bidirectional communication link with each end thereof terminating at an I/O controlled transceiver. Transmit data lines are directly connected from a local FIFO through each node's communication link transceiver. Status and control signals from the neighboring nodes are delivered over supervisory lines to inform the local node that the neighbor node's FIFO is empty and the bidirectional link between the two nodes is idle for data communication. A clocking line between neighbors, clocks a message into an empty FIFO at a neighbor's node and vica versa. Either neighbor may acquire control over the bidirectional communication link at any time, and thus each node has circuitry for checking whether or not the communication link is busy or idle, and whether or not the receive FIFO is empty. Likewise, each node can empty its own FIFO and in turn deliver a status signal to a neighboring node indicating that the local FIFO is empty. The system includes features of automatic message rerouting, block message transfer and automatic parity checking and generation.

Using Colored Stochastic Petri Net (CS-PN) software for protocol specification, validation, and evaluation

NASA Technical Reports Server (NTRS)

Zenie, Alexandre; Luguern, Jean-Pierre

1987-01-01

The specification, verification, validation, and evaluation, which make up the different steps of the CS-PN software are outlined. The colored stochastic Petri net software is applied to a Wound/Wait protocol decomposable into two principal modules: request or couple (transaction, granule) treatment module and wound treatment module. Each module is specified, verified, validated, and then evaluated separately, to deduce a verification, validation and evaluation of the complete protocol. The colored stochastic Petri nets tool is shown to be a natural extension of the stochastic tool, adapted to distributed systems and protocols, because the color conveniently takes into account the numerous sites, transactions, granules and messages.

Performance issues for domain-oriented time-driven distributed simulations

NASA Technical Reports Server (NTRS)

Nicol, David M.

1987-01-01

It has long been recognized that simulations form an interesting and important class of computations that may benefit from distributed or parallel processing. Since the point of parallel processing is improved performance, the recent proliferation of multiprocessors requires that we consider the performance issues that naturally arise when attempting to implement a distributed simulation. Three such issues are: (1) the problem of mapping the simulation onto the architecture, (2) the possibilities for performing redundant computation in order to reduce communication, and (3) the avoidance of deadlock due to distributed contention for message-buffer space. These issues are discussed in the context of a battlefield simulation implemented on a medium-scale multiprocessor message-passing architecture.

Parallel integer sorting with medium and fine-scale parallelism

NASA Technical Reports Server (NTRS)

Dagum, Leonardo

1993-01-01

Two new parallel integer sorting algorithms, queue-sort and barrel-sort, are presented and analyzed in detail. These algorithms do not have optimal parallel complexity, yet they show very good performance in practice. Queue-sort designed for fine-scale parallel architectures which allow the queueing of multiple messages to the same destination. Barrel-sort is designed for medium-scale parallel architectures with a high message passing overhead. The performance results from the implementation of queue-sort on a Connection Machine CM-2 and barrel-sort on a 128 processor iPSC/860 are given. The two implementations are found to be comparable in performance but not as good as a fully vectorized bucket sort on the Cray YMP.

Reducing Interprocessor Dependence in Recoverable Distributed Shared Memory

NASA Technical Reports Server (NTRS)

Janssens, Bob; Fuchs, W. Kent

1994-01-01

Checkpointing techniques in parallel systems use dependency tracking and/or message logging to ensure that a system rolls back to a consistent state. Traditional dependency tracking in distributed shared memory (DSM) systems is expensive because of high communication frequency. In this paper we show that, if designed correctly, a DSM system only needs to consider dependencies due to the transfer of blocks of data, resulting in reduced dependency tracking overhead and reduced potential for rollback propagation. We develop an ownership timestamp scheme to tolerate the loss of block state information and develop a passive server model of execution where interactions between processors are considered atomic. With our scheme, dependencies are significantly reduced compared to the traditional message-passing model.

[Old age in primary school readers: a journey through the end of the 19th century to the start of the 21st century in Argentina].

PubMed

Oddone, María Julieta

2013-04-01

This article presents the content (discourse) analysis of messages transmitted by primary school readers in the period between 1880 to 2012. This study allowed us to explore the image of old age and aging that society has and passes on to new generations as well as the role assigned to this generational group. The historical periods that provide the context for the data were defined according to the continuity of or the turning points in the social values transmitted in the reading materials. The role assigned to elderly people and the image of old age that the Argentine society passed on and continues to pass on to younger generations demonstrate that each period described has its own model of aging.

Security architecture for HL/7 message interchange.

PubMed

Chen, T S; Liao, B S; Lin, M G; Gough, T G

2001-01-01

The promotion of quality medical treatment is very important to the healthcare providers as well as to patients. It requires that the medical resources of different hospitals be combined to ensure that medical information is shared and that resources are not wasted. A computer-based patient record is one of the best methods to accomplish the interchange of the patient's clinical data. In our system, the Health Level/Seven (HL/7) format is used for the interchange of the clinical data, as it has been supported by many healthcare providers and become a â standard'. The security of the interchange of clinical data is a serious issue for people using the Internet for data communication. Several international well-developed security algorithms, models and secure policies are adopted in the design of a security handler for an HL/7 architecture. The goal of our system is to combine our security system with the end-to-end communication systems constructed from the HL/7 format to establish a safe delivery channel. A suitable security interchange environment is implemented to address some shortcomings in clinical data interchange. located at the application layer of the ISO/OSI reference model. The medical message components, sub-components, and related types of message event are the primary goals of the HL/7 protocols. The patient management system, the doctor's system for recording his advice, examination and diagnosis as well as any financial management system are all covered by the HL/7 protocols. Healthcare providers and hospitals in Taiwan are very interested in developing the HL/7 protocols as a common standard for clinical data interchange.

Coherent attack on oblivious transfer based on single-qubit rotations

NASA Astrophysics Data System (ADS)

He, Guang Ping

2018-04-01

Recently a bit-string quantum oblivious transfer (OT) protocol based on single-qubit rotations was proposed (Rodrigues et al 2017 J. Phys. A: Math. Theor. 50 205301) and proven secure against few-qubit measurements. However, it was left as an open question whether the protocol remains secure against general attacks. Here, we close the gap by showing that if the receiver Bob can perform collective measurements on all qubits, then he can learn Alice’s secret message with a probability close to one. Thus the protocol fails to meet the security criterion of OT.

A Multi-Center Space Data System Prototype Based on CCSDS Standards

NASA Technical Reports Server (NTRS)

Rich, Thomas M.

2016-01-01

Deep space missions beyond earth orbit will require new methods of data communications in order to compensate for increasing Radio Frequency (RF) propagation delay. The Consultative Committee for Space Data Systems (CCSDS) standard protocols Spacecraft Monitor & Control (SM&C), Asynchronous Message Service (AMS), and Delay/Disruption Tolerant Networking (DTN) provide such a method. However, the maturity level of this protocol stack is insufficient for mission inclusion at this time. This Space Data System prototype is intended to provide experience which will raise the Technical Readiness Level (TRL) of this protocol set. In order to reduce costs, future missions can take advantage of these standard protocols, which will result in increased interoperability between control centers. This prototype demonstrates these capabilities by implementing a realistic space data system in which telemetry is published to control center applications at the Jet Propulsion Lab (JPL), the Marshall Space Flight Center (MSFC), and the Johnson Space Center (JSC). Reverse publishing paths for commanding from each control center are also implemented. The target vehicle consists of realistic flight computer hardware running Core Flight Software (CFS) in the integrated Power, Avionics, and Power (iPAS) Pathfinder Lab at JSC. This prototype demonstrates a potential upgrade path for future Deep Space Network (DSN) modification, in which the automatic error recovery and communication gap compensation capabilities of DTN would be exploited. In addition, SM&C provides architectural flexibility by allowing new service providers and consumers to be added efficiently anywhere in the network using the common interface provided by SM&C's Message Abstraction Layer (MAL). In FY 2015, this space data system was enhanced by adding telerobotic operations capability provided by the Robot API Delegate (RAPID) family of protocols developed at NASA. RAPID is one of several candidates for consideration and inclusion in a new international standard being developed by the CCSDS Telerobotic Operations Working Group. Software gateways for the purpose of interfacing RAPID messages with the existing SM&C based infrastructure were developed. Telerobotic monitor, control, and bridge applications were written in the RAPID framework, which were then tailored to the NAO telerobotic test article hardware, a product of Aldebaran Robotics.

Using Sphinx to Improve Onion Routing Circuit Construction

NASA Astrophysics Data System (ADS)

Kate, Aniket; Goldberg, Ian

This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing, and certificateless onion routing. Our new circuit constructions are also secure in the universal composability framework, a property that was missing from the original constructions. Further, we compare the performance of our schemes with their older counterparts as well as with each other.

Validation of the Tensoval Duo Control II blood pressure monitor for clinic use and self-measurement according to the British Hypertension Society protocol and the European Society of Hypertension International Protocol Revision 2010.

PubMed

de Greeff, Annemarie; Shennan, Andrew H

2013-06-01

The Tensoval Duo Control II is an automated upper arm device that uses a combination of oscillometric and auscultatory technology to determine blood pressure noninvasively. The accuracy of this device was assessed according to the British Hypertension Society (BHS) protocol and the European Society of Hypertension International Protocol revision 2010 (ESH-IP2) in an adult population. Ethical approval was obtained. Eighty-five and 33 adult individuals, respectively, were recruited to fulfil the requirements of each protocol. Trained observers took nine sequential same-arm measurements alternating between a mercury sphygmomanometer and the device. The device had to achieve at least a B grade for both systolic and diastolic pressures to pass the BHS protocol and had to fulfil the criteria of all three phases of the ESH-IP2 protocol to receive recommendation. The device achieved an A/A grading for the BHS protocol and passed all three phases of the ESH-IP2 protocol. The mean difference±SD for the BHS/ESH protocols, respectively, was -1.8±6.5/-0.7±5.7 mmHg for systolic pressure and 1.9±5.1/2.4±4.5 mmHg for diastolic pressure. The device maintained its A/A grading throughout the low-pressure, medium-pressure and high-pressure ranges. The Tensoval Duo Control II device is recommended for clinical and home use according to both the BHS and the ESH-IP2 standard.

SPECS: Secure and Privacy Enhancing Communications Schemes for VANETs

NASA Astrophysics Data System (ADS)

Chim, T. W.; Yiu, S. M.; Hui, L. C. K.; Jiang, Zoe L.; Li, Victor O. K.

Vehicular ad hoc network (VANET) is an emerging type of networks which facilitates vehicles on roads to communicate for driving safety. The basic idea is to allow arbitrary vehicles to broadcast ad hoc messages (e.g. traffic accidents) to other vehicles. However, this raises the concern of security and privacy. Messages should be signed and verified before they are trusted while the real identity of vehicles should not be revealed, but traceable by authorized party. Existing solutions either rely heavily on a tamper-proof hardware device, or cannot satisfy the privacy requirement and do not have an effective message verification scheme. In this paper, we provide a software-based solution which makes use of only two shared secrets to satisfy the privacy requirement and gives lower message overhead and at least 45% higher successful rate than previous solutions in the message verification phase using the bloom filter and the binary search techniques. We also provide the first group communication protocol to allow vehicles to authenticate and securely communicate with others in a group of known vehicles.

Key exchange using biometric identity based encryption for sharing encrypted data in cloud environment

NASA Astrophysics Data System (ADS)

Hassan, Waleed K.; Al-Assam, Hisham

2017-05-01

The main problem associated with using symmetric/ asymmetric keys is how to securely store and exchange the keys between the parties over open networks particularly in the open environment such as cloud computing. Public Key Infrastructure (PKI) have been providing a practical solution for session key exchange for loads of web services. The key limitation of PKI solution is not only the need for a trusted third partly (e.g. certificate authority) but also the absent link between data owner and the encryption keys. The latter is arguably more important where accessing data needs to be linked with identify of the owner. Currently available key exchange protocols depend on using trusted couriers or secure channels, which can be subject to man-in-the-middle attack and various other attacks. This paper proposes a new protocol for Key Exchange using Biometric Identity Based Encryption (KE-BIBE) that enables parties to securely exchange cryptographic keys even an adversary is monitoring the communication channel between the parties. The proposed protocol combines biometrics with IBE in order to provide a secure way to access symmetric keys based on the identity of the users in unsecure environment. In the KE-BIOBE protocol, the message is first encrypted by the data owner using a traditional symmetric key before migrating it to a cloud storage. The symmetric key is then encrypted using public biometrics of the users selected by data owner to decrypt the message based on Fuzzy Identity-Based Encryption. Only the selected users will be able to decrypt the message by providing a fresh sample of their biometric data. The paper argues that the proposed solution eliminates the needs for a key distribution centre in traditional cryptography. It will also give data owner the power of finegrained sharing of encrypted data by control who can access their data.

Validation of the G.LAB MD2200 wrist blood pressure monitor according to the European Society of Hypertension, the British Hypertension Society, and the International Organization for Standardization Protocols.

PubMed

Liu, Ze-Yu; Zhang, Qing-Han; Ye, Xiao-Lei; Liu, Da-Peng; Cheng, Kang; Zhang, Chun-Hai; Wan, Yi

2017-04-01

To validate the G.LAB MD2200 automated wrist blood pressure (BP) monitors according to the European Society of Hypertension International Protocol (ESH-IP) revision 2010, the British Hypertension Society (BHS), and the International Organization for Standardization (ISO) 81060-2:2013 protocols. The device was assessed on 33 participants according to the ESH requirements and was then tested on 85 participants according to the BHS and ISO 81060-2:2013 criteria. The validation procedures and data analysis followed the protocols precisely. The G.LAB MD2200 devices passed all parts of ESH-IP revision 2010 for both systolic and diastolic BP, with a device-observer difference of 2.15±5.51 and 1.51±5.16 mmHg, respectively. The device achieved A/A grading for the BHS protocol and it also fulfilled the criteria of ISO 81060-2:2013, with mean differences of systolic and diastolic BP between the device and the observer of 2.19±5.21 and 2.11±4.70 mmHg, respectively. The G.LAB MD2200 automated wrist BP monitor passed the ESH-IP revision 2010 and the ISO 81060-2:2013 protocol, and achieved the A/A grade of the BHS protocol, which can be recommended for self-measurement in the general population.

Enabling IP Header Compression in COTS Routers via Frame Relay on a Simplex Link

NASA Technical Reports Server (NTRS)

Nguyen, Sam P.; Pang, Jackson; Clare, Loren P.; Cheng, Michael K.

2010-01-01

NASA is moving toward a networkcentric communications architecture and, in particular, is building toward use of Internet Protocol (IP) in space. The use of IP is motivated by its ubiquitous application in many communications networks and in available commercial off-the-shelf (COTS) technology. The Constellation Program intends to fit two or more voice (over IP) channels on both the forward link to, and the return link from, the Orion Crew Exploration Vehicle (CEV) during all mission phases. Efficient bandwidth utilization of the links is key for voice applications. In Voice over IP (VoIP), the IP packets are limited to small sizes to keep voice latency at a minimum. The common voice codec used in VoIP is G.729. This new algorithm produces voice audio at 8 kbps and in packets of 10-milliseconds duration. Constellation has designed the VoIP communications stack to use the combination of IP/UDP/RTP protocols where IP carries a 20-byte header, UDP (User Datagram Protocol) carries an 8-byte header, and RTP (Real Time Transport Protocol) carries a 12-byte header. The protocol headers total 40 bytes and are equal in length to a 40-byte G.729 payload, doubling the VoIP latency. Since much of the IP/UDP/RTP header information does not change from IP packet to IP packet, IP/UDP/RTP header compression can avoid transmission of much redundant data as well as reduce VoIP latency. The benefits of IP header compression are more pronounced at low data rate links such as the forward and return links during CEV launch. IP/UDP/RTP header compression codecs are well supported by many COTS routers. A common interface to the COTS routers is through frame relay. However, enabling IP header compression over frame relay, according to industry standard (Frame Relay IP Header Compression Agreement FRF.20), requires a duplex link and negotiations between the compressor router and the decompressor router. In Constellation, each forward to and return link from the CEV in space is treated independently as a simplex link. Without negotiation, the COTS routers are prevented from entering into the IP header compression mode, and no IP header compression would be performed. An algorithm is proposed to enable IP header compression in COTS routers on a simplex link with no negotiation or with a one-way messaging. In doing so, COTS routers can enter IP header compression mode without the need to handshake through a bidirectional link as required by FRF.20. This technique would spoof the routers locally and thereby allow the routers to enter into IP header compression mode without having the negotiations between routers actually occur. The spoofing function is conducted by a frame relay adapter (also COTS) with the capability to generate control messages according to the FRF.20 descriptions. Therefore, negotiation is actually performed between the FRF.20 adapter and the connecting COTS router locally and never occurs over the space link. Through understanding of the handshaking protocol described by FRF.20, the necessary FRF.20 negotiations messages can be generated to control the connecting router, not only to turn on IP header compression but also to adjust the compression parameters. The FRF.20 negotiation (or control) message is composed in the FRF.20 adapter by interpreting the incoming router request message. Many of the fields are simply transcribed from request to response while the control field indicating response and type are modified.

Adaptive Peer Sampling with Newscast

NASA Astrophysics Data System (ADS)

Tölgyesi, Norbert; Jelasity, Márk

The peer sampling service is a middleware service that provides random samples from a large decentralized network to support gossip-based applications such as multicast, data aggregation and overlay topology management. Lightweight gossip-based implementations of the peer sampling service have been shown to provide good quality random sampling while also being extremely robust to many failure scenarios, including node churn and catastrophic failure. We identify two problems with these approaches. The first problem is related to message drop failures: if a node experiences a higher-than-average message drop rate then the probability of sampling this node in the network will decrease. The second problem is that the application layer at different nodes might request random samples at very different rates which can result in very poor random sampling especially at nodes with high request rates. We propose solutions for both problems. We focus on Newscast, a robust implementation of the peer sampling service. Our solution is based on simple extensions of the protocol and an adaptive self-control mechanism for its parameters, namely—without involving failure detectors—nodes passively monitor local protocol events using them as feedback for a local control loop for self-tuning the protocol parameters. The proposed solution is evaluated by simulation experiments.

An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks

PubMed Central

Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

2014-01-01

This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter—a small, random variation in the timing of message emission—is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality. PMID:25111238

A high performance totally ordered multicast protocol

NASA Technical Reports Server (NTRS)

Montgomery, Todd; Whetten, Brian; Kaplan, Simon

1995-01-01

This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service such as IP Multicasting. RMP is fully and symmetrically distributed so that no site bears un undue portion of the communication load. RMP provides a wide range of guarantees, from unreliable delivery to totally ordered delivery, to K-resilient, majority resilient, and totally resilient atomic delivery. These QoS guarantees are selectable on a per packet basis. RMP provides many communication options, including virtual synchrony, a publisher/subscriber model of message delivery, an implicit naming service, mutually exclusive handlers for messages, and mutually exclusive locks. It has commonly been held that a large performance penalty must be paid in order to implement total ordering -- RMP discounts this. On SparcStation 10's on a 1250 KB/sec Ethernet, RMP provides totally ordered packet delivery to one destination at 842 KB/sec throughput and with 3.1 ms packet latency. The performance stays roughly constant independent of the number of destinations. For two or more destinations on a LAN, RMP provides higher throughput than any protocol that does not use multicast or broadcast.

Advanced Shipboard Control Systems

DTIC Science & Technology

2001-05-07

Nov 1989: 41-47. Carnivale, J. A. DD-21 Presentation. Jan 1999. Deitel H.M. and P. J. Deitel . C++ How To Program . Upper Saddle River...One distinct advantage to an OSI model is that each level of the network is clearly defined, allowing different users to understand how a specific...Pri) field that tells the layer how this message is to be sent. The L2Hdr is an 8 bit section of the Link Protocol Data Unit/MAC Protocol Data

Achieving the Holevo bound via a bisection decoding protocol

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rosati, Matteo; Giovannetti, Vittorio

2016-06-15

We present a new decoding protocol to realize transmission of classical information through a quantum channel at asymptotically maximum capacity, achieving the Holevo bound and thus the optimal communication rate. At variance with previous proposals, our scheme recovers the message bit by bit, making use of a series of “yes-no” measurements, organized in bisection fashion, thus determining which codeword was sent in log{sub 2} N steps, N being the number of codewords.

Unlinkable Serial Transactions: Protocols and Applications

DTIC Science & Technology

1999-11-01

4) intends for the blind signature to be secure from “one-more” forgery attacks [Pointcheval and Stern 1996]. Such forgery enables the originator to...protocols we describe. The signature indicated by S in message 2 uses the vendor’s signature key for service S and is only used to sign blinded hashes. We...make use of blind signatures ; although, not surprisingly, their sys- tems are rather different from the ones given here [Fujioka et al. 1993; Cranor 1996

How to Stop Disagreeing and Start Cooperatingin the Presence of Asymmetric Packet Loss.

PubMed

Morales-Ponce, Oscar; Schiller, Elad M; Falcone, Paolo

2018-04-22

We consider the design of a disagreement correction protocol in multi-vehicle systems. Vehicles broadcast in real-time vital information such as position, direction, speed, acceleration, intention, etc. This information is then used to identify the risks and adapt their trajectory to maintain the highest performance without compromising the safety. To minimize the risk due to the use of inconsistent information, all cooperating vehicles must agree whether to use the exchanged information to operate in a cooperative mode or use the only local information to operate in an autonomous mode. However, since wireless communications are prone to failures, it is impossible to deterministically reach an agreement. Therefore, any protocol will exhibit necessary disagreement periods. In this paper, we investigate whether vehicles can still cooperate despite communication failures even in the scenario where communication is suddenly not available. We present a deterministic protocol that allows all participants to either operate a cooperative mode when vehicles can exchange all the information in a timely manner or operate in autonomous mode when messages are lost. We show formally that the disagreement time is bounded by the time that the communication channel requires to deliver messages and validate our protocol using NS-3 simulations. We explain how the proposed solution can be used in vehicular platooning to attain high performance and still guarantee high safety standards despite communication failures.

How to Stop Disagreeing and Start Cooperatingin the Presence of Asymmetric Packet Loss

PubMed Central

2018-01-01

We consider the design of a disagreement correction protocol in multi-vehicle systems. Vehicles broadcast in real-time vital information such as position, direction, speed, acceleration, intention, etc. This information is then used to identify the risks and adapt their trajectory to maintain the highest performance without compromising the safety. To minimize the risk due to the use of inconsistent information, all cooperating vehicles must agree whether to use the exchanged information to operate in a cooperative mode or use the only local information to operate in an autonomous mode. However, since wireless communications are prone to failures, it is impossible to deterministically reach an agreement. Therefore, any protocol will exhibit necessary disagreement periods. In this paper, we investigate whether vehicles can still cooperate despite communication failures even in the scenario where communication is suddenly not available. We present a deterministic protocol that allows all participants to either operate a cooperative mode when vehicles can exchange all the information in a timely manner or operate in autonomous mode when messages are lost. We show formally that the disagreement time is bounded by the time that the communication channel requires to deliver messages and validate our protocol using NS-3 simulations. We explain how the proposed solution can be used in vehicular platooning to attain high performance and still guarantee high safety standards despite communication failures. PMID:29690572

Access Protocol For An Industrial Optical Fibre LAN

NASA Astrophysics Data System (ADS)

Senior, John M.; Walker, William M.; Ryley, Alan

1987-09-01

A structure for OSI levels 1 and 2 of a local area network suitable for use in a variety of industrial environments is reported. It is intended that the LAN will utilise optical fibre technology at the physical level and a hybrid of dynamically optimisable token passing and CSMA/CD techniques at the data link (IEEE 802 medium access control - logical link control) level. An intelligent token passing algorithm is employed which dynamically allocates tokens according to the known upper limits on the requirements of each device. In addition a system of stochastic tokens is used to increase efficiency when the stochastic traffic is significant. The protocol also allows user-defined priority systems to be employed and is suitable for distributed or centralised implementation. The results of computer simulated performance characteristics for the protocol using a star-ring topology are reported which demonstrate its ability to perform efficiently with the device and traffic loads anticipated within an industrial environment.

Commanding and Controlling Satellite Clusters (IEEE Intelligent Systems, November/December 2000)

DTIC Science & Technology

2000-01-01

real - time operating system , a message-passing OS well suited for distributed...ground Flight processors ObjectAgent RTOS SCL RTOS RDMS Space command language Real - time operating system Rational database management system TS-21 RDMS...engineer with Princeton Satellite Systems. She is working with others to develop ObjectAgent software to run on the OSE Real Time Operating System .

VAC: Versatile Advection Code

NASA Astrophysics Data System (ADS)

Tóth, Gábor; Keppens, Rony

2012-07-01

The Versatile Advection Code (VAC) is a freely available general hydrodynamic and magnetohydrodynamic simulation software that works in 1, 2 or 3 dimensions on Cartesian and logically Cartesian grids. VAC runs on any Unix/Linux system with a Fortran 90 (or 77) compiler and Perl interpreter. VAC can run on parallel machines using either the Message Passing Interface (MPI) library or a High Performance Fortran (HPF) compiler.

Sharing Content and Experiences in Smart Environments

NASA Astrophysics Data System (ADS)

Plomp, Johan; Heinilä, Juhani; Ikonen, Veikko; Kaasinen, Eija; Välkkynen, Pasi

Once upon a time… Stories used to be the only way to pass a message. The story teller would take his audience through the events by mere oration. Here and there he would hesitate, whisper, or gesticulate to emphasise his story or induce the right emotions in his audience. No doubt troubadourswere loved, they both brought news of the world as well as entertainment.

Performance of hybrid programming models for multiscale cardiac simulations: preparing for petascale computation.

PubMed

Pope, Bernard J; Fitch, Blake G; Pitman, Michael C; Rice, John J; Reumann, Matthias

2011-10-01

Future multiscale and multiphysics models that support research into human disease, translational medical science, and treatment can utilize the power of high-performance computing (HPC) systems. We anticipate that computationally efficient multiscale models will require the use of sophisticated hybrid programming models, mixing distributed message-passing processes [e.g., the message-passing interface (MPI)] with multithreading (e.g., OpenMP, Pthreads). The objective of this study is to compare the performance of such hybrid programming models when applied to the simulation of a realistic physiological multiscale model of the heart. Our results show that the hybrid models perform favorably when compared to an implementation using only the MPI and, furthermore, that OpenMP in combination with the MPI provides a satisfactory compromise between performance and code complexity. Having the ability to use threads within MPI processes enables the sophisticated use of all processor cores for both computation and communication phases. Considering that HPC systems in 2012 will have two orders of magnitude more cores than what was used in this study, we believe that faster than real-time multiscale cardiac simulations can be achieved on these systems.

Simulated Raman Spectral Analysis of Organic Molecules

NASA Astrophysics Data System (ADS)

Lu, Lu

The advent of the laser technology in the 1960s solved the main difficulty of Raman spectroscopy, resulted in simplified Raman spectroscopy instruments and also boosted the sensitivity of the technique. Up till now, Raman spectroscopy is commonly used in chemistry and biology. As vibrational information is specific to the chemical bonds, Raman spectroscopy provides fingerprints to identify the type of molecules in the sample. In this thesis, we simulate the Raman Spectrum of organic and inorganic materials by General Atomic and Molecular Electronic Structure System (GAMESS) and Gaussian, two computational codes that perform several general chemistry calculations. We run these codes on our CPU-based high-performance cluster (HPC). Through the message passing interface (MPI), a standardized and portable message-passing system which can make the codes run in parallel, we are able to decrease the amount of time for computation and increase the sizes and capacities of systems simulated by the codes. From our simulations, we will set up a database that allows search algorithm to quickly identify N-H and O-H bonds in different materials. Our ultimate goal is to analyze and identify the spectra of organic matter compositions from meteorites and compared these spectra with terrestrial biologically-produced amino acids and residues.

Petascale computation performance of lightweight multiscale cardiac models using hybrid programming models.

PubMed

Pope, Bernard J; Fitch, Blake G; Pitman, Michael C; Rice, John J; Reumann, Matthias

2011-01-01

Future multiscale and multiphysics models must use the power of high performance computing (HPC) systems to enable research into human disease, translational medical science, and treatment. Previously we showed that computationally efficient multiscale models will require the use of sophisticated hybrid programming models, mixing distributed message passing processes (e.g. the message passing interface (MPI)) with multithreading (e.g. OpenMP, POSIX pthreads). The objective of this work is to compare the performance of such hybrid programming models when applied to the simulation of a lightweight multiscale cardiac model. Our results show that the hybrid models do not perform favourably when compared to an implementation using only MPI which is in contrast to our results using complex physiological models. Thus, with regards to lightweight multiscale cardiac models, the user may not need to increase programming complexity by using a hybrid programming approach. However, considering that model complexity will increase as well as the HPC system size in both node count and number of cores per node, it is still foreseeable that we will achieve faster than real time multiscale cardiac simulations on these systems using hybrid programming models.

Detecting and Preventing Sybil Attacks in Wireless Sensor Networks Using Message Authentication and Passing Method.

PubMed

Dhamodharan, Udaya Suriya Raj Kumar; Vayanaperumal, Rajamani

2015-01-01

Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting.

Detecting and Preventing Sybil Attacks in Wireless Sensor Networks Using Message Authentication and Passing Method

PubMed Central

Dhamodharan, Udaya Suriya Raj Kumar; Vayanaperumal, Rajamani

2015-01-01

Wireless sensor networks are highly indispensable for securing network protection. Highly critical attacks of various kinds have been documented in wireless sensor network till now by many researchers. The Sybil attack is a massive destructive attack against the sensor network where numerous genuine identities with forged identities are used for getting an illegal entry into a network. Discerning the Sybil attack, sinkhole, and wormhole attack while multicasting is a tremendous job in wireless sensor network. Basically a Sybil attack means a node which pretends its identity to other nodes. Communication to an illegal node results in data loss and becomes dangerous in the network. The existing method Random Password Comparison has only a scheme which just verifies the node identities by analyzing the neighbors. A survey was done on a Sybil attack with the objective of resolving this problem. The survey has proposed a combined CAM-PVM (compare and match-position verification method) with MAP (message authentication and passing) for detecting, eliminating, and eventually preventing the entry of Sybil nodes in the network. We propose a scheme of assuring security for wireless sensor network, to deal with attacks of these kinds in unicasting and multicasting. PMID:26236773

Streaming data analytics via message passing with application to graph algorithms

DOE PAGES

Plimpton, Steven J.; Shead, Tim

2014-05-06

The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. We describe a lightweight, portable framework named PHISH which enables a set of independent processes to compute on a stream of data in a distributed-memory parallel manner. Datums are routed between processes in patterns defined by the application. PHISH can run on top of eithermore » message-passing via MPI or sockets via ZMQ. The former means streaming computations can be run on any parallel machine which supports MPI; the latter allows them to run on a heterogeneous, geographically dispersed network of machines. We illustrate how PHISH can support streaming MapReduce operations, and describe streaming versions of three algorithms for large, sparse graph analytics: triangle enumeration, subgraph isomorphism matching, and connected component finding. Lastly, we also provide benchmark timings for MPI versus socket performance of several kernel operations useful in streaming algorithms.« less

Lightweight causal and atomic group multicast

NASA Technical Reports Server (NTRS)

Birman, Kenneth P.; Schiper, Andre; Stephenson, Pat

1991-01-01

The ISIS toolkit is a distributed programming environment based on support for virtually synchronous process groups and group communication. A suite of protocols is presented to support this model. The approach revolves around a multicast primitive, called CBCAST, which implements a fault-tolerant, causally ordered message delivery. This primitive can be used directly or extended into a totally ordered multicast primitive, called ABCAST. It normally delivers messages immediately upon reception, and imposes a space overhead proportional to the size of the groups to which the sender belongs, usually a small number. It is concluded that process groups and group communication can achieve performance and scaling comparable to that of a raw message transport layer. This finding contradicts the widespread concern that this style of distributed computing may be unacceptably costly.

Teaching Controversial Topics to Skeptical High School Students

NASA Astrophysics Data System (ADS)

Ford, K. S.

2012-12-01

Tennessee passes the "Monkey Bill" (HB 0368, SB 0893), North Carolina's state government passes a law to criminalize reference in state documents to scientific models that predict sea level rise to reach at least one meter by the next century, and public concern still lags far behind the scientific community's concern on climate change. The American public and even science teachers across the country seem to have lost faith in the ability of the scientific community to unify a strong message about several important scientific lessons, including global warming in particular. This lack of a unified message has weakened the ability of science teachers to effectively teach the lesson of global warming. For science teachers in strongly conservative areas of the country, it is much easier to omit difficult topics and avoid angering parents and school board members. Teachers who do feel strongly about scientifically proven, yet publically controversial topics CAN teach these topics in conservative areas by confirming students' belief systems by being honest and open about motivations surrounding both sides of controversial topics, and by using vocabulary that avoids triggering negative perceptions about these controversial topics. For true learning and change of preconceived opinion to take place, it is important for students to come to the understanding in their own minds in an open and safe learning environment instead of having the message "preached" to them, which only serves to make them feel unintelligent and defensive if they disagree. This presentation will include lessons learned from a practicing science teacher who works in a community that overwhelmingly disputes the validity of human impacts on climate change.

A New On-Line Diagnosis Protocol for the SPIDER Family of Byzantine Fault Tolerant Architectures

NASA Technical Reports Server (NTRS)

Geser, Alfons; Miner, Paul S.

2004-01-01

This paper presents the formal verification of a new protocol for online distributed diagnosis for the SPIDER family of architectures. An instance of the Scalable Processor-Independent Design for Electromagnetic Resilience (SPIDER) architecture consists of a collection of processing elements communicating over a Reliable Optical Bus (ROBUS). The ROBUS is a specialized fault-tolerant device that guarantees Interactive Consistency, Distributed Diagnosis (Group Membership), and Synchronization in the presence of a bounded number of physical faults. Formal verification of the original SPIDER diagnosis protocol provided a detailed understanding that led to the discovery of a significantly more efficient protocol. The original protocol was adapted from the formally verified protocol used in the MAFT architecture. It required O(N) message exchanges per defendant to correctly diagnose failures in a system with N nodes. The new protocol achieves the same diagnostic fidelity, but only requires O(1) exchanges per defendant. This paper presents this new diagnosis protocol and a formal proof of its correctness using PVS.

Convergence of Health Level Seven Version 2 Messages to Semantic Web Technologies for Software-Intensive Systems in Telemedicine Trauma Care.

PubMed

Menezes, Pedro Monteiro; Cook, Timothy Wayne; Cavalini, Luciana Tricai

2016-01-01

To present the technical background and the development of a procedure that enriches the semantics of Health Level Seven version 2 (HL7v2) messages for software-intensive systems in telemedicine trauma care. This study followed a multilevel model-driven approach for the development of semantically interoperable health information systems. The Pre-Hospital Trauma Life Support (PHTLS) ABCDE protocol was adopted as the use case. A prototype application embedded the semantics into an HL7v2 message as an eXtensible Markup Language (XML) file, which was validated against an XML schema that defines constraints on a common reference model. This message was exchanged with a second prototype application, developed on the Mirth middleware, which was also used to parse and validate both the original and the hybrid messages. Both versions of the data instance (one pure XML, one embedded in the HL7v2 message) were equally validated and the RDF-based semantics recovered by the receiving side of the prototype from the shared XML schema. This study demonstrated the semantic enrichment of HL7v2 messages for intensive-software telemedicine systems for trauma care, by validating components of extracts generated in various computing environments. The adoption of the method proposed in this study ensures the compliance of the HL7v2 standard in Semantic Web technologies.

Bad News Has Wings: Dread Risk Mediates Social Amplification in Risk Communication.

PubMed

Jagiello, Robert D; Hills, Thomas T

2018-05-29

Social diffusion of information amplifies risk through processes of birth, death, and distortion of message content. Dread risk-involving uncontrollable, fatal, involuntary, and catastrophic outcomes (e.g., terrorist attacks and nuclear accidents)-may be particularly susceptible to amplification because of the psychological biases inherent in dread risk avoidance. To test this, initially balanced information about high or low dread topics was given to a set of individuals who then communicated this information through diffusion chains, each person passing a message to the next. A subset of these chains were also reexposed to the original information. We measured prior knowledge, perceived risk before and after transmission, and, at each link, number of positive and negative statements. Results showed that the more a message was transmitted the more negative statements it contained. This was highest for the high dread topic. Increased perceived risk and production of negative messages was closely related to the amount of negative information that was received, with domain knowledge mitigating this effect. Reexposue to the initial information was ineffectual in reducing bias, demonstrating the enhanced danger of socially transmitted information. © 2018 Society for Risk Analysis.

Motivational Text Message Intervention for Eating Disorders: A Single-Case Alternating Treatment Design Using Ecological Momentary Assessment.

PubMed

Shingleton, Rebecca M; Pratt, Elizabeth M; Gorman, Bernard; Barlow, David H; Palfai, Tibor P; Thompson-Brenner, Heather

2016-05-01

This study tested a motivational text message treatment adjunct for individuals with eating disorders (EDs) who exhibited high dietary restraint/restriction. A replicated single-case alternating treatment design was used to examine (a) the feasibility of combining a brief motivational interview with subsequent text messages and (b) the influence of the text messages on eating behaviors and motivation to change in individuals with EDs (N=12). The protocol was 8weeks and the text messages were adjunctive to cognitive-behavioral therapy. The intervention was well accepted (mean rating=7/10) and feasible within the context of monetary compensation (mean daily monitoring compliance =91%). Text messages did not impact behavioral outcomes: dietary restraint and kilocalorie intake. They had mixed effects on motivation to change dietary restraint, measured by the Readiness and Motivation Questionnaire (RMQ). When receiving text messages, RMQ precontemplation scores (desire to restrict) significantly increased, indicating decreased motivation; however, action scores (effort toward reducing dietary restraint) significantly increased, indicating increased motivation. These effects were moderated by weight status. Underweight individuals (n=4; body mass index [BMI]<19.0) reported increased ambivalence-that is, an increased desire to restrict and increased action toward reducing restriction-in response to the text messages. Normal weight participants (n=8; BMI>19.0) reported only increased action toward reducing restriction in response to the text messages. These data demonstrate text messages are a potentially feasible and acceptable treatment adjunct and may be effective at increasing motivation to change for normal weight individuals, while their influence on underweight patients is more complex. These findings provide a foundation for future research in technology-based motivational interventions for EDs and offer preliminary evidence for using these methods among normal weight individuals. Copyright © 2016. Published by Elsevier Ltd.

Performance analysis of local area networks

NASA Technical Reports Server (NTRS)

Alkhatib, Hasan S.; Hall, Mary Grace

1990-01-01

A simulation of the TCP/IP protocol running on a CSMA/CD data link layer was described. The simulation was implemented using the simula language, and object oriented discrete event language. It allows the user to set the number of stations at run time, as well as some station parameters. Those parameters are the interrupt time and the dma transfer rate for each station. In addition, the user may configure the network at run time with stations of differing characteristics. Two types are available, and the parameters of both types are read from input files at run time. The parameters include the dma transfer rate, interrupt time, data rate, average message size, maximum frame size and the average interarrival time of messages per station. The information collected for the network is the throughput and the mean delay per packet. For each station, the number of messages attempted as well as the number of messages successfully transmitted is collected in addition to the throughput and mean packet delay per station.

Testing warning messages on smokers' cigarette packages: a standardised protocol.

PubMed

Brewer, Noel T; Hall, Marissa G; Lee, Joseph G L; Peebles, Kathryn; Noar, Seth M; Ribisl, Kurt M

2016-03-01

Lab experiments on cigarette warnings typically use a brief one-time exposure that is not paired with the cigarette packs smokers use every day, leaving open the question of how repeated warning exposure over several weeks may affect smokers. This proof of principle study sought to develop a new protocol for testing cigarette warnings that better reflects real-world exposure by presenting them on cigarette smokers' own packs. We tested a cigarette pack labelling protocol with 76 US smokers ages 18 and older. We applied graphic warnings to the front and back of smokers' cigarette packs. Most smokers reported that at least 75% of the packs of cigarettes they smoked during the study had our warnings. Nearly all said they would participate in the study again. Using cigarette packs with the study warnings increased quit intentions (p<0.05). Our findings suggest a feasible pack labelling protocol with six steps: (1) schedule appointments at brief intervals; (2) determine typical cigarette consumption; (3) ask smokers to bring a supply of cigarette packs to study appointments; (4) apply labels to smokers' cigarette packs; (5) provide participation incentives at the end of appointments; and (6) refer smokers to cessation services at end of the study. When used in randomised controlled trials in settings with real-world message exposure over time, this protocol may help identify the true impact of warnings and thus better inform tobacco product labelling policy. NCT02247908. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/

Information and the Origin of Qualia

PubMed Central

Orpwood, Roger

2017-01-01

This article argues that qualia are a likely outcome of the processing of information in local cortical networks. It uses an information-based approach and makes a distinction between information structures (the physical embodiment of information in the brain, primarily patterns of action potentials), and information messages (the meaning of those structures to the brain, and the basis of qualia). It develops formal relationships between these two kinds of information, showing how information structures can represent messages, and how information messages can be identified from structures. The article applies this perspective to basic processing in cortical networks or ensembles, showing how networks can transform between the two kinds of information. The article argues that an input pattern of firing is identified by a network as an information message, and that the output pattern of firing generated is a representation of that message. If a network is encouraged to develop an attractor state through attention or other re-entrant processes, then the message identified each time physical information is cycled through the network becomes “representation of the previous message”. Using an example of olfactory perception, it is shown how this piggy-backing of messages on top of previous messages could lead to olfactory qualia. The message identified on each pass of information could evolve from inner identity, to inner form, to inner likeness or image. The outcome is an olfactory quale. It is shown that the same outcome could result from information cycled through a hierarchy of networks in a resonant state. The argument for qualia generation is applied to other sensory modalities, showing how, through a process of brain-wide constraint satisfaction, a particular state of consciousness could develop at any given moment. Evidence for some of the key predictions of the theory is presented, using ECoG data and studies of gamma oscillations and attractors, together with an outline of what further evidence is needed to provide support for the theory. PMID:28484376

Protocol for a Delay-Tolerant Data-Communication Network

NASA Technical Reports Server (NTRS)

Torgerson, Jordan; Hooke, Adrian; Burleigh, Scott; Fall, Kevin

2004-01-01

As its name partly indicates, the Delay-Tolerant Networking (DTN) Bundle Protocol is a protocol for delay-tolerant transmission of data via communication networks. This protocol was conceived as a result of studies of how to adapt Internet protocols so that Internet-like services could be provided across interplanetary distances in support of deep-space exploration. The protocol, and software to implement the protocol, is being developed in collaboration among experts at NASA's Jet Propulsion Laboratory and other institutions. No current Internet protocols can accommodate long transmission delay times or intermittent link connectivity. The DTN Bundle Protocol represents a departure from the standard Internet assumption that a continuous path is available from a host computer to a client computer: It provides for routing of data through networks that may be disjointed and may be characterized by long transmission delays. In addition to networks that include deepspace communication links, examples of such networks include terrestrial ones within which branches are temporarily disconnected. The protocol is based partly on the definition of a message-based overlay above the transport layers of the networks on which it is hosted.

Implementing the PM Programming Language using MPI and OpenMP - a New Tool for Programming Geophysical Models on Parallel Systems

NASA Astrophysics Data System (ADS)

Bellerby, Tim

2015-04-01

PM (Parallel Models) is a new parallel programming language specifically designed for writing environmental and geophysical models. The language is intended to enable implementers to concentrate on the science behind the model rather than the details of running on parallel hardware. At the same time PM leaves the programmer in control - all parallelisation is explicit and the parallel structure of any given program may be deduced directly from the code. This paper describes a PM implementation based on the Message Passing Interface (MPI) and Open Multi-Processing (OpenMP) standards, looking at issues involved with translating the PM parallelisation model to MPI/OpenMP protocols and considering performance in terms of the competing factors of finer-grained parallelisation and increased communication overhead. In order to maximise portability, the implementation stays within the MPI 1.3 standard as much as possible, with MPI-2 MPI-IO file handling the only significant exception. Moreover, it does not assume a thread-safe implementation of MPI. PM adopts a two-tier abstract representation of parallel hardware. A PM processor is a conceptual unit capable of efficiently executing a set of language tasks, with a complete parallel system consisting of an abstract N-dimensional array of such processors. PM processors may map to single cores executing tasks using cooperative multi-tasking, to multiple cores or even to separate processing nodes, efficiently sharing tasks using algorithms such as work stealing. While tasks may move between hardware elements within a PM processor, they may not move between processors without specific programmer intervention. Tasks are assigned to processors using a nested parallelism approach, building on ideas from Reyes et al. (2009). The main program owns all available processors. When the program enters a parallel statement then either processors are divided out among the newly generated tasks (number of new tasks < number of processors) or tasks are divided out among the available processors (number of tasks > number of processors). Nested parallel statements may further subdivide the processor set owned by a given task. Tasks or processors are distributed evenly by default, but uneven distributions are possible under programmer control. It is also possible to explicitly enable child tasks to migrate within the processor set owned by their parent task, reducing load unbalancing at the potential cost of increased inter-processor message traffic. PM incorporates some programming structures from the earlier MIST language presented at a previous EGU General Assembly, while adopting a significantly different underlying parallelisation model and type system. PM code is available at www.pm-lang.org under an unrestrictive MIT license. Reference Ruymán Reyes, Antonio J. Dorta, Francisco Almeida, Francisco de Sande, 2009. Automatic Hybrid MPI+OpenMP Code Generation with llc, Recent Advances in Parallel Virtual Machine and Message Passing Interface, Lecture Notes in Computer Science Volume 5759, 185-195

The Prodiguer Messaging Platform

NASA Astrophysics Data System (ADS)

Greenslade, Mark; Denvil, Sebastien; Raciazek, Jerome; Carenton, Nicolas; Levavasseur, Guillame

2014-05-01

CONVERGENCE is a French multi-partner national project designed to gather HPC and informatics expertise to innovate in the context of running French climate models with differing grids and at differing resolutions. Efficient and reliable execution of these models and the management and dissemination of model output (data and meta-data) are just some of the complexities that CONVERGENCE aims to resolve. The Institut Pierre Simon Laplace (IPSL) is responsible for running climate simulations upon a set of heterogenous HPC environments within France. With heterogeneity comes added complexity in terms of simulation instrumentation and control. Obtaining a global perspective upon the state of all simulations running upon all HPC environments has hitherto been problematic. In this presentation we detail how, within the context of CONVERGENCE, the implementation of the Prodiguer messaging platform resolves complexity and permits the development of real-time applications such as: 1. a simulation monitoring dashboard; 2. a simulation metrics visualizer; 3. an automated simulation runtime notifier; 4. an automated output data & meta-data publishing pipeline; The Prodiguer messaging platform leverages a widely used open source message broker software called RabbitMQ. RabbitMQ itself implements the Advanced Message Queue Protocol (AMPQ). Hence it will be demonstrated that the Prodiguer messaging platform is built upon both open source and open standards.

Performance analysis of the ALOHA protocol with replication in a fading channel for the Mobile Satellite Experiment

NASA Technical Reports Server (NTRS)

Clare, L. P.; Yan, T.-Y.

1985-01-01

The analysis of the ALOHA random access protocol for communications channels with fading is presented. The protocol is modified to send multiple contiguous copies of a message at each transmission attempt. Both pure and slotted ALOHA channels are considered. A general two state model is used for the channel error process to account for the channel fading memory. It is shown that greater throughput and smaller delay may be achieved using repetitions. The model is applied to the analysis of the delay-throughput performance in a fading mobile communications environment. Numerical results are given for NASA's Mobile Satellite Experiment.

Analysis of MD5 authentication in various routing protocols using simulation tools

NASA Astrophysics Data System (ADS)

Dinakaran, M.; Darshan, K. N.; Patel, Harsh

2017-11-01

Authentication being an important paradigm of security and Computer Networks require secure paths to make the flow of the data even more secure through some security protocols. So MD-5(Message Digest 5) helps in providing data integrity to the data being sent through it and authentication to the network devices. This paper gives a brief introduction to the MD-5, simulation of the networks by including MD-5 authentication using various routing protocols like OSPF, EIGRP and RIPv2. GNS3 is being used to simulate the scenarios. Analysis of the MD-5 authentication is done in the later sections of the paper.

Three-party quantum secure direct communication against collective noise

NASA Astrophysics Data System (ADS)

He, Ye-Feng; Ma, Wen-Ping

2017-10-01

Based on logical quantum states, two three-party quantum secure direct communication protocols are proposed, which can realize the exchange of the secret messages between three parties with the help of the measurement correlation property of six-particle entangled states. These two protocols can be immune to the collective-dephasing noise and the collective-rotation noise, respectively; neither of them has information leakage problem. The one-way transmission mode ensures that they can congenitally resist against the Trojan horse attacks and the teleportation attack. Furthermore, these two protocols are secure against other active attacks because of the use of the decoy state technology.

Using a Participatory Four-Step Protocol to Develop Culturally Targeted Cancer Education Brochures

PubMed Central

Kulukulualani, Manny; Braun, Kathryn L.; Tsark, JoAnn U.

2010-01-01

Native Hawaiians have a high cancer burden, but few culturally targeted cancer education brochures exist. The authors followed a participatory four-step protocol, involving more than 200 health providers and clients, to develop and test culturally targeted brochures on skin, oral, cervical, prostate, and testicular cancers. The final products featured Hawaiian faces, scenes, words, and activities. They proved more attractive than existing materials, in particular to younger Hawaiians, and posttests suggested good comprehension of intended messages. This protocol may have application in other communities that want to develop brochures that are attractive, acceptable, readable, and useful to minority clients and their providers. PMID:18353907

Using a participatory four-step protocol to develop culturally targeted cancer education brochures.

PubMed

Kulukulualani, Manny; Braun, Kathryn L; Tsark, JoAnn U

2008-10-01

Native Hawaiians have a high cancer burden, but few culturally targeted cancer education brochures exist. The authors followed a participatory four-step protocol, involving more than 200 health providers and clients, to develop and test culturally targeted brochures on skin, oral, cervical, prostate, and testicular cancers. The final products featured Hawaiian faces, scenes, words, and activities. They proved more attractive than existing materials, in particular to younger Hawaiians, and posttests suggested good comprehension of intended messages. This protocol may have application in other communities that want to develop brochures that are attractive, acceptable, readable, and useful to minority clients and their providers.

High-Performance, Reliable Multicasting: Foundations for Future Internet Groupware Applications

NASA Technical Reports Server (NTRS)

Callahan, John; Montgomery, Todd; Whetten, Brian

1997-01-01

Network protocols that provide efficient, reliable, and totally-ordered message delivery to large numbers of users will be needed to support many future Internet applications. The Reliable Multicast Protocol (RMP) is implemented on top of IP multicast to facilitate reliable transfer of data for replicated databases and groupware applications that will emerge on the Internet over the next decade. This paper explores some of the basic questions and applications of reliable multicasting in the context of the development and analysis of RMP.

Packet Controller For Wireless Headset

NASA Technical Reports Server (NTRS)

Christensen, Kurt K.; Swanson, Richard J.

1993-01-01

Packet-message controller implements communications protocol of network of wireless headsets. Designed for headset application, readily adapted to other uses; slight modification enables controller to implement Integrated Services Digital Network (ISDN) X.25 protocol, giving far-reaching applications in telecommunications. Circuit converts continuous voice signals into digital packets of data and vice versa. Operates in master or slave mode. Controller reduced to single complementary metal oxide/semiconductor integrated-circuit chip. Occupies minimal space in headset and consumes little power, extending life of headset battery.

Quantum direct communication protocol strengthening against Pavičić’s attack

NASA Astrophysics Data System (ADS)

Zhang, Bo; Shi, Wei-Xu; Wang, Jian; Tang, Chao-Jing

2015-12-01

A quantum circuit providing an undetectable eavesdropping of information in message mode, which compromises all two-state ψ-ϕ quantum direct communication (QDC) protocols, has been recently proposed by Pavičić [Phys. Rev. A 87 (2013) 042326]. A modification of the protocol’s control mode is proposed, which improves users’ 25% detection probability of Eve to 50% at best, as that in ping-pong protocol. The modification also improves the detection probability of Wójcik’s attack [Phys. Rev. Lett 90 (2003) 157901] to 75% at best. The resistance against man-in-the-middle (MITM) attack as well as the discussion of security for four Bell state protocols is presented. As a result, the protocol security is strengthened both theoretically and practically, and quantum advantage of superdense coding is restored.

Development of a Web Portal for Physical Activity and Symptom Tracking in Oncology Patients: Protocol for a Prospective Cohort Study.

PubMed

Marthick, Michael; Dhillon, Haryana M; Alison, Jennifer A; Cheema, Birinder S; Shaw, Tim

2018-05-15

Significant benefits accrue from increasing physical activity levels in people with a history of cancer. Physical activity levels can be increased using behavioral change interventions in this population. Access to Web portals and provision of activity monitors to provide feedback may support behavior change by encouraging patient engagement in physical therapy. The Web portal evaluated in this study will provide a system to monitor physical activity and sleep, for use by both clinician and patient, along with symptom and health-related quality of life tracking capabilities. The aim of this study was to outline a protocol for a feasibility study focused on a Web-based portal that provides activity monitoring and personalized messaging to increase physical activity in people with cancer. Using a longitudinal cohort design, people with cancer will be serially allocated to 3 intervention cohorts of 20 participants each and followed for 10 weeks. Cohort 1 will be provided a wearable activity monitor and access to a Web-based portal. Cohort 2 will receive the same content as Cohort 1 and in addition will receive a weekly activity summary message. Cohort 3 will receive the same content as Cohorts 1 and 2 and in addition will receive a personalized weekly coaching message. Feasibility of the use of the portal is the primary outcome. Results are expected in early 2018. Outcome measures will include goal attainment and completion rate. This study will provide information about the feasibility of investigating eHealth initiatives to promote physical activity in people with cancer. RR1-10.2196/9586. ©Michael Marthick, Haryana M Dhillon, Jennifer A Alison, Birinder S Cheema, Tim Shaw. Originally published in JMIR Research Protocols (http://www.researchprotocols.org), 15.05.2018.

Software architecture for time-constrained machine vision applications

NASA Astrophysics Data System (ADS)

Usamentiaga, Rubén; Molleda, Julio; García, Daniel F.; Bulnes, Francisco G.

2013-01-01

Real-time image and video processing applications require skilled architects, and recent trends in the hardware platform make the design and implementation of these applications increasingly complex. Many frameworks and libraries have been proposed or commercialized to simplify the design and tuning of real-time image processing applications. However, they tend to lack flexibility, because they are normally oriented toward particular types of applications, or they impose specific data processing models such as the pipeline. Other issues include large memory footprints, difficulty for reuse, and inefficient execution on multicore processors. We present a novel software architecture for time-constrained machine vision applications that addresses these issues. The architecture is divided into three layers. The platform abstraction layer provides a high-level application programming interface for the rest of the architecture. The messaging layer provides a message-passing interface based on a dynamic publish/subscribe pattern. A topic-based filtering in which messages are published to topics is used to route the messages from the publishers to the subscribers interested in a particular type of message. The application layer provides a repository for reusable application modules designed for machine vision applications. These modules, which include acquisition, visualization, communication, user interface, and data processing, take advantage of the power of well-known libraries such as OpenCV, Intel IPP, or CUDA. Finally, the proposed architecture is applied to a real machine vision application: a jam detector for steel pickling lines.

Average waiting time in FDDI networks with local priorities

NASA Technical Reports Server (NTRS)

Gercek, Gokhan

1994-01-01

A method is introduced to compute the average queuing delay experienced by different priority group messages in an FDDI node. It is assumed that no FDDI MAC layer priorities are used. Instead, a priority structure is introduced to the messages at a higher protocol layer (e.g. network layer) locally. Such a method was planned to be used in Space Station Freedom FDDI network. Conservation of the average waiting time is used as the key concept in computing average queuing delays. It is shown that local priority assignments are feasable specially when the traffic distribution is asymmetric in the FDDI network.

Clandestine Message Passing in Virtual Environments

DTIC Science & Technology

2008-09-01

accessed April 4, 2008). Weir, Laila. “Boring Game? Outsorce It.” (August 24, 2004). http://www.wired.com/ entertainment / music /news/2004/08/ 64638...Multiplayer Online MOVES - Modeling Virtual Environments and Simulation MTV – Music Television NPS - Naval Postgraduate School PAN – Personal Area...Network PSP - PlayStation Portable RPG – Role-playing Game SL - Second Life SVN - Subversion VE – Virtual Environments vMTV – Virtual Music

An Ode to Stuart Hall's "The Supply of Demand": The Case of Post-Secondary Education in Ontario Fifty Years Later

ERIC Educational Resources Information Center

FitzGerald Murphy, Maggie

2016-01-01

Despite the fact that over fifty years have passed since its publication, Stuart Hall's article "The Supply of Demand" (1960), is remarkably relevant today. The central message that society must not be blinded by "prosperity" such that it no longer envisions and demands a better world is especially pertinent in light of the…

The Guardian. Volume 9, Number 3, Winter 2007

DTIC Science & Technology

2007-01-01

message correctly. Muslims will ultimately determine whether the ideology of al Qaeda, its affiliates, franchisees , and fellow travelers represents...opined that the effort would not work or would not pass the cost– benefit comparison. Others wanted to develop comprehensive NATO doctrine to guide...full BAT capability, the access-control benefits of BAT/HIIDE are a significant improvement to overall ISAF force protection, even in stand-alone mode

PETSc Users Manual Revision 3.7

DOE Office of Scientific and Technical Information (OSTI.GOV)

Balay, Satish; Abhyankar, S.; Adams, M.

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication.

PETSc Users Manual Revision 3.8

DOE Office of Scientific and Technical Information (OSTI.GOV)

Balay, S.; Abhyankar, S.; Adams, M.

This manual describes the use of PETSc for the numerical solution of partial differential equations and related problems on high-performance computers. The Portable, Extensible Toolkit for Scientific Computation (PETSc) is a suite of data structures and routines that provide the building blocks for the implementation of large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all message-passing communication.

Statistical Inference in Graphical Models

DTIC Science & Technology

2008-06-17

fuse probability theory and graph theory in such a way as to permit efficient rep- resentation and computation with probability distributions. They...message passing. 59 viii 1. INTRODUCTION In approaching real-world problems, we often need to deal with uncertainty. Probability and statis- tics provide a...dynamic programming methods. However, for many sensors of interest, the signal-to-noise ratio does not allow such a treatment. Another source of

NAS Parallel Benchmark. Results 11-96: Performance Comparison of HPF and MPI Based NAS Parallel Benchmarks. 1.0

NASA Technical Reports Server (NTRS)

Saini, Subash; Bailey, David; Chancellor, Marisa K. (Technical Monitor)

1997-01-01

High Performance Fortran (HPF), the high-level language for parallel Fortran programming, is based on Fortran 90. HALF was defined by an informal standards committee known as the High Performance Fortran Forum (HPFF) in 1993, and modeled on TMC's CM Fortran language. Several HPF features have since been incorporated into the draft ANSI/ISO Fortran 95, the next formal revision of the Fortran standard. HPF allows users to write a single parallel program that can execute on a serial machine, a shared-memory parallel machine, or a distributed-memory parallel machine. HPF eliminates the complex, error-prone task of explicitly specifying how, where, and when to pass messages between processors on distributed-memory machines, or when to synchronize processors on shared-memory machines. HPF is designed in a way that allows the programmer to code an application at a high level, and then selectively optimize portions of the code by dropping into message-passing or calling tuned library routines as 'extrinsics'. Compilers supporting High Performance Fortran features first appeared in late 1994 and early 1995 from Applied Parallel Research (APR) Digital Equipment Corporation, and The Portland Group (PGI). IBM introduced an HPF compiler for the IBM RS/6000 SP/2 in April of 1996. Over the past two years, these implementations have shown steady improvement in terms of both features and performance. The performance of various hardware/ programming model (HPF and MPI (message passing interface)) combinations will be compared, based on latest NAS (NASA Advanced Supercomputing) Parallel Benchmark (NPB) results, thus providing a cross-machine and cross-model comparison. Specifically, HPF based NPB results will be compared with MPI based NPB results to provide perspective on performance currently obtainable using HPF versus MPI or versus hand-tuned implementations such as those supplied by the hardware vendors. In addition we would also present NPB (Version 1.0) performance results for the following systems: DEC Alpha Server 8400 5/440, Fujitsu VPP Series (VX, VPP300, and VPP700), HP/Convex Exemplar SPP2000, IBM RS/6000 SP P2SC node (120 MHz) NEC SX-4/32, SGI/CRAY T3E, SGI Origin2000.

Validation of the Pangao PG-800A36 automatic wrist blood pressure monitor according to the European Society of Hypertension and the British Hypertension Society protocols.

PubMed

Zhao, Hairong; Qiao, Weichang; Zhang, Rui; Cui, Peng; Hou, Fanglin; Zhang, Wenli

2018-02-01

The aim of this study was to validate the PG-800A36 automatic wrist blood pressure monitor according to the European Society of Hypertension International Protocol (ESH-IP) revision 2010 and the British Hypertension Society (BHS) protocols. A total of 33 participants were initially included on the basis of the ESH-IP, followed by examination of 85 participants according to the BHS protocol. The procedures and analysis methods of the protocols were followed precisely with left arm/wrist sequential measurements by two trained observers using a mercury sphygmomanometer and one supervisor using the device. The device passed the ESH-IP with an average difference of 1.45±6.46 mmHg for systolic blood pressure and 1.25±5.10 mmHg for diastolic blood pressure. Furthermore, the A/A grade of the BHS protocol was achieved with an average difference of 1.84±6.94 mmHg for systolic blood pressure and 1.15±6.49 mmHg for diastolic blood pressure, and thus, the device also fulfilled the requirements of the Association for the Advancement of Medical Instrumentation. The Pangao PG-800A36 passed the requirements of the ESH-IP revision 2010 and achieved the A/A grade of the BHS protocol, which can be recommended for self-measurement in the general population.

Local Area Networks: Part I.

ERIC Educational Resources Information Center

Dessy, Raymond E.

1982-01-01

Local area networks are common communication conduits allowing various terminals, computers, discs, printers, and other electronic devices to intercommunicate over short distances. Discusses the vocabulary of such networks including RS-232C point-to-point and IEEE-488 multidrop protocols; error detection; message packets; multiplexing; star, ring,…

Modified Dynamic Decode-and-Forward Relaying Protocol for Type II Relay in LTE-Advanced and Beyond

PubMed Central

Nam, Sung Sik; Alouini, Mohamed-Slim; Choi, Seyeong

2016-01-01

In this paper, we propose a modified dynamic decode-and-forward (MoDDF) relaying protocol to meet the critical requirements for user equipment (UE) relays in next-generation cellular systems (e.g., LTE-Advanced and beyond). The proposed MoDDF realizes the fast jump-in relaying and the sequential decoding with an application of random codeset to encoding and re-encoding process at the source and the multiple UE relays, respectively. A subframe-by-subframe decoding based on the accumulated (or buffered) messages is employed to achieve energy, information, or mixed combining. Finally, possible early termination of decoding at the end user can lead to the higher spectral efficiency and more energy saving by reducing the frequency of redundant subframe transmission and decoding. These attractive features eliminate the need of directly exchanging control messages between multiple UE relays and the end user, which is an important prerequisite for the practical UE relay deployment. PMID:27898712

Modified Dynamic Decode-and-Forward Relaying Protocol for Type II Relay in LTE-Advanced and Beyond.

PubMed

Nam, Sung Sik; Alouini, Mohamed-Slim; Choi, Seyeong

2016-01-01

In this paper, we propose a modified dynamic decode-and-forward (MoDDF) relaying protocol to meet the critical requirements for user equipment (UE) relays in next-generation cellular systems (e.g., LTE-Advanced and beyond). The proposed MoDDF realizes the fast jump-in relaying and the sequential decoding with an application of random codeset to encoding and re-encoding process at the source and the multiple UE relays, respectively. A subframe-by-subframe decoding based on the accumulated (or buffered) messages is employed to achieve energy, information, or mixed combining. Finally, possible early termination of decoding at the end user can lead to the higher spectral efficiency and more energy saving by reducing the frequency of redundant subframe transmission and decoding. These attractive features eliminate the need of directly exchanging control messages between multiple UE relays and the end user, which is an important prerequisite for the practical UE relay deployment.

An improved PRoPHET routing protocol in delay tolerant network.

PubMed

Han, Seung Deok; Chung, Yun Won

2015-01-01

In delay tolerant network (DTN), an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity) protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

Homemade Buckeye-Pi: A Learning Many-Node Platform for High-Performance Parallel Computing

NASA Astrophysics Data System (ADS)

Amooie, M. A.; Moortgat, J.

2017-12-01

We report on the "Buckeye-Pi" cluster, the supercomputer developed in The Ohio State University School of Earth Sciences from 128 inexpensive Raspberry Pi (RPi) 3 Model B single-board computers. Each RPi is equipped with fast Quad Core 1.2GHz ARMv8 64bit processor, 1GB of RAM, and 32GB microSD card for local storage. Therefore, the cluster has a total RAM of 128GB that is distributed on the individual nodes and a flash capacity of 4TB with 512 processors, while it benefits from low power consumption, easy portability, and low total cost. The cluster uses the Message Passing Interface protocol to manage the communications between each node. These features render our platform the most powerful RPi supercomputer to date and suitable for educational applications in high-performance-computing (HPC) and handling of large datasets. In particular, we use the Buckeye-Pi to implement optimized parallel codes in our in-house simulator for subsurface media flows with the goal of achieving a massively-parallelized scalable code. We present benchmarking results for the computational performance across various number of RPi nodes. We believe our project could inspire scientists and students to consider the proposed unconventional cluster architecture as a mainstream and a feasible learning platform for challenging engineering and scientific problems.

Validation of the Pangao PG-800B11 blood pressure monitor according to the European Society of Hypertension and the British Hypertension Society protocols.

PubMed

Bing, Sen; Zhang, Cunhai; Wang, Liping; Li, Linyi; Wan, Yi

2014-12-01

The study aimed to determine the accuracy of the fully automated oscillometric upper-arm blood pressure (BP) monitor Pangao PG-800B11 according to the European Society of Hypertension-International Protocol (ESH-IP) revision 2010 and the British Hypertension Society (BHS) protocol 1993. Data from 33 participants were initially examined according to the ESH-IP revision 2010. Furthermore, 52 participants were then enrolled to fulfill the BHS protocol requirements. In all participants, sequential left arm measurements were performed by two trained observers using a mercury sphygmomanometer and one supervisor using the device. The protocols' requirements were followed precisely. The device passed all parts of the ESH protocol for systolic blood pressure (SBP) and diastolic blood pressure (DBP) and was graded A according to the criteria of the BHS protocol for both SBP and DBP. The A/A grade was achieved in low (<130/80 mmHg), medium (130-160/80-100 mmHg), and high (>160/100 mmHg) BP categories. The mean BP difference between PG-800B11 and observers in the 85 participants was -0.6±5.0 mmHg for SBP and -0.6±4.5 mmHg for DBP; thus, the device also fulfilled the requirements of the Association for the Advancement of Medical Instrumentation (AAMI). The Pangao PG-800B11 passed all requirements of the ESH-IP revision 2010 and achieved A/A grade of the BHS protocol across a wide range of BPs.

Counterfactuality of ‘counterfactual’ communication

NASA Astrophysics Data System (ADS)

Vaidman, L.

2015-11-01

The counterfactuality of the recently proposed protocols for direct quantum communication is analyzed. It is argued that the protocols can be counterfactual only for one value of the transmitted bit. The protocols achieve a reduced probability of detection of the particle in the transmission channel by increasing the number of paths in the channel. However, this probability is not lower than the probability of detecting a particle actually passing through such a multi-path channel, which was found to be surprisingly small. The relation between security and counterfactuality of the protocols is discussed. An analysis of counterfactuality of the protocols in the framework of the Bohmian interpretation is performed.