Science.gov

Sample records for message passing algorithms

  1. A Message-Passing Algorithm for Wireless Network Scheduling *

    PubMed Central

    Paschalidis, Ioannis Ch.; Huang, Fuzhuo; Lai, Wei

    2015-01-01

    We consider scheduling in wireless networks and formulate it as Maximum Weighted Independent Set (MWIS) problem on a “conflict” graph that captures interference among simultaneous transmissions. We propose a novel, low-complexity, and fully distributed algorithm that yields high-quality feasible solutions. Our proposed algorithm consists of two phases, each of which requires only local information and is based on message-passing. The first phase solves a relaxation of the MWIS problem using a gradient projection method. The relaxation we consider is tighter than the simple linear programming relaxation and incorporates constraints on all cliques in the graph. The second phase of the algorithm starts from the solution of the relaxation and constructs a feasible solution to the MWIS problem. We show that our algorithm always outputs an optimal solution to the MWIS problem for perfect graphs. Simulation results compare our policies against Carrier Sense Multiple Access (CSMA) and other alternatives and show excellent performance. PMID:26752942

  2. A Message-Passing Algorithm for Wireless Network Scheduling.

    PubMed

    Paschalidis, Ioannis Ch; Huang, Fuzhuo; Lai, Wei

    2015-10-01

    We consider scheduling in wireless networks and formulate it as Maximum Weighted Independent Set (MWIS) problem on a "conflict" graph that captures interference among simultaneous transmissions. We propose a novel, low-complexity, and fully distributed algorithm that yields high-quality feasible solutions. Our proposed algorithm consists of two phases, each of which requires only local information and is based on message-passing. The first phase solves a relaxation of the MWIS problem using a gradient projection method. The relaxation we consider is tighter than the simple linear programming relaxation and incorporates constraints on all cliques in the graph. The second phase of the algorithm starts from the solution of the relaxation and constructs a feasible solution to the MWIS problem. We show that our algorithm always outputs an optimal solution to the MWIS problem for perfect graphs. Simulation results compare our policies against Carrier Sense Multiple Access (CSMA) and other alternatives and show excellent performance.

  3. Algorithms for parallel flow solvers on message passing architectures

    NASA Technical Reports Server (NTRS)

    Vanderwijngaart, Rob F.

    1995-01-01

    The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those

  4. Message passing in PUMA

    SciTech Connect

    Maccabe, A.B. |; Wheat, S.R.

    1993-05-01

    This paper provides an overview of the message passing primitives provided by PUMA (Performance-oriented, User-managed Messaging Architecture). Message passing in PUMA is based on the concept of a portal--an opening in the address space of an application process. Once an application process has established a portal, other processes can write values into the memory associated with the portal using a simple send operation. Because messages are written directly into the address space of the receiving process, there is not need to buffer messages in the PUMA kernel. This simplifies the design of the kernel, increasing its reliability and portability. Moreover, because messages are mapped directly into the address space of the application process, the application can manage the messages that it receives without needing direct support from the kernel.

  5. Compressive Imaging via Approximate Message Passing

    DTIC Science & Technology

    2015-09-04

    We propose novel compressive imaging algorithms that employ approximate message passing (AMP), which is an iterative signal estimation algorithm that...Approved for Public Release; Distribution Unlimited Final Report: Compressive Imaging via Approximate Message Passing The views, opinions and/or findings...Research Triangle Park, NC 27709-2211 approximate message passing , compressive imaging, compressive sensing, hyperspectral imaging, signal reconstruction

  6. Inferring the origin of an epidemic with a dynamic message-passing algorithm

    NASA Astrophysics Data System (ADS)

    Lokhov, Andrey Y.; Mézard, Marc; Ohta, Hiroki; Zdeborová, Lenka

    2014-07-01

    We study the problem of estimating the origin of an epidemic outbreak: given a contact network and a snapshot of epidemic spread at a certain time, determine the infection source. This problem is important in different contexts of computer or social networks. Assuming that the epidemic spread follows the usual susceptible-infected-recovered model, we introduce an inference algorithm based on dynamic message-passing equations and we show that it leads to significant improvement of performance compared to existing approaches. Importantly, this algorithm remains efficient in the case where the snapshot sees only a part of the network.

  7. Hybrid Approximate Message Passing

    NASA Astrophysics Data System (ADS)

    Rangan, Sundeep; Fletcher, Alyson K.; Goyal, Vivek K.; Byrne, Evan; Schniter, Philip

    2017-09-01

    The standard linear regression (SLR) problem is to recover a vector $\\mathbf{x}^0$ from noisy linear observations $\\mathbf{y}=\\mathbf{Ax}^0+\\mathbf{w}$. The approximate message passing (AMP) algorithm recently proposed by Donoho, Maleki, and Montanari is a computationally efficient iterative approach to SLR that has a remarkable property: for large i.i.d.\\ sub-Gaussian matrices $\\mathbf{A}$, its per-iteration behavior is rigorously characterized by a scalar state-evolution whose fixed points, when unique, are Bayes optimal. AMP, however, is fragile in that even small deviations from the i.i.d.\\ sub-Gaussian model can cause the algorithm to diverge. This paper considers a "vector AMP" (VAMP) algorithm and shows that VAMP has a rigorous scalar state-evolution that holds under a much broader class of large random matrices $\\mathbf{A}$: those that are right-rotationally invariant. After performing an initial singular value decomposition (SVD) of $\\mathbf{A}$, the per-iteration complexity of VAMP can be made similar to that of AMP. In addition, the fixed points of VAMP's state evolution are consistent with the replica prediction of the minimum mean-squared error recently derived by Tulino, Caire, Verd\\'u, and Shamai. The effectiveness and state evolution predictions of VAMP are confirmed in numerical experiments.

  8. 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

  9. Streaming data analytics via message passing with application to graph algorithms

    SciTech Connect

    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 either 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.

  10. 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.

  11. The ACL Message Passing Library

    SciTech Connect

    Painter, J.; McCormick, P.; Krogh, M.; Hansen, C.; Colin de Verdiere, G.

    1995-09-01

    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.

  12. Message passing for quantified Boolean formulas

    NASA Astrophysics Data System (ADS)

    Zhang, Pan; Ramezanpour, Abolfazl; Zdeborová, Lenka; Zecchina, Riccardo

    2012-05-01

    We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis-Putnam-Logemann-Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics give robust exponential efficiency gain with respect to state-of-the-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this, our study sheds light on using message passing in small systems and as subroutines in complete solvers.

  13. QMP: LQCD Message Passing API

    SciTech Connect

    Jie Chen; Robert Edwards; William Watson

    2003-03-01

    Recent changes are: (1) There is no longer a logical node number, only a node number which does not change as the logical machine is define. Thus there are two styles of messaging: messages are sent to a node by node number, or messages are sent to a relative (logical) node. (2) Methods related to node numbers have been changed (some dropped, some added). This note presents: (1) the requirements for message passing within Lattice QCD applications; (2) a draft message API for both C and C++; and (3) implementation design ideas. The API is intended to be sufficiently flexible to be used by all Lattice QCD applications, and execute efficiently on all existing and anticipated platforms, so that there is no need to directly call non-portable message passing routines. Because of the highly regular grid communications with LQCD, MPI calls (which are more general) impose some additional overhead that is predicted to be non-negligible for large machines. Depending upon demand, a subset of MPI could be implemented above this new API so that legacy codes which use MPI could function on the new architectures which implement (only) the new API. Further, the new API has been implemented atop MPI so that new applications using this new API can still be run on older machines for which only MPI is available. Interspersed with the API description are some descriptions for how the API could be implemented for myrinet clusters and the QCDOC machine. These are meant to more fully illustrate the functionality, and are not intended as the final design. At the time of writing, the following implementations exist: (1) QMP-GM -- Uses GM; (2) QMP-MPI -- Uses MPI; tested above MPICH-GM, MPICH-SM (shared memory), and MPICH-P4 (sockets).

  14. 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.

  15. Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for K-SAT at large clause-to-variable ratios

    NASA Astrophysics Data System (ADS)

    Altarelli, Fabrizio; Monasson, Rémi; Zamponi, Francesco

    2007-02-01

    For large clause-to-variable ratios, typical K-SAT instances drawn from the uniform distribution have no solution. We argue, based on statistical mechanics calculations using the replica and cavity methods, that rare satisfiable instances from the uniform distribution are very similar to typical instances drawn from the so-called planted distribution, where instances are chosen uniformly between the ones that admit a given solution. It then follows, from a recent article by Feige, Mossel and Vilenchik (2006 Complete convergence of message passing algorithms for some satisfiability problems Proc. Random 2006 pp 339-50), that these rare instances can be easily recognized (in O(log N) time and with probability close to 1) by a simple message-passing algorithm.

  16. CT reconstruction via denoising approximate message passing

    NASA Astrophysics Data System (ADS)

    Perelli, Alessandro; Lexa, Michael A.; Can, Ali; Davies, Mike E.

    2016-05-01

    In this paper, we adapt and apply a compressed sensing based reconstruction algorithm to the problem of computed tomography reconstruction for luggage inspection. Specifically, we propose a variant of the denoising generalized approximate message passing (D-GAMP) algorithm and compare its performance to the performance of traditional filtered back projection and to a penalized weighted least squares (PWLS) based reconstruction method. D-GAMP is an iterative algorithm that at each iteration estimates the conditional probability of the image given the measurements and employs a non-linear "denoising" function which implicitly imposes an image prior. Results on real baggage show that D-GAMP is well-suited to limited-view acquisitions.

  17. Message Passing Framework for Globally Interconnected Clusters

    NASA Astrophysics Data System (ADS)

    Hafeez, M.; Asghar, S.; Malik, U. A.; Rehman, A.; Riaz, N.

    2011-12-01

    In prevailing technology trends it is apparent that the network requirements and technologies will advance in future. Therefore the need of High Performance Computing (HPC) based implementation for interconnecting clusters is comprehensible for scalability of clusters. Grid computing provides global infrastructure of interconnecting clusters consisting of dispersed computing resources over Internet. On the other hand the leading model for HPC programming is Message Passing Interface (MPI). As compared to Grid computing, MPI is better suited for solving most of the complex computational problems. MPI itself is restricted to a single cluster. It does not support message passing over the internet to use the computing resources of different clusters in an optimal way. We propose a model that provides message passing capabilities between parallel applications over the internet. The proposed model is based on Architecture for Java Universal Message Passing (A-JUMP) framework and Enterprise Service Bus (ESB) named as High Performance Computing Bus. The HPC Bus is built using ActiveMQ. HPC Bus is responsible for communication and message passing in an asynchronous manner. Asynchronous mode of communication offers an assurance for message delivery as well as a fault tolerance mechanism for message passing. The idea presented in this paper effectively utilizes wide-area intercluster networks. It also provides scheduling, dynamic resource discovery and allocation, and sub-clustering of resources for different jobs. Performance analysis and comparison study of the proposed framework with P2P-MPI are also presented in this paper.

  18. Tracking particles by passing messages between images

    SciTech Connect

    Chertkov, Michael; Kroc, Lukas; Zdeborova, Lenka; Krakala, Florent; Vergassola, M

    2009-01-01

    Methods to extract information from the tracking of mobile objects/particles have broad interest in biological and physical sciences. Techniques based on the simple criterion of proximity in time-consecutive snapshots are useful to identify the trajectories of the particles. However, they become problematic as the motility and/or the density of the particles increases because of the uncertainties on the trajectories that particles have followed during the acquisition time of the images. Here, we report efficient methods for learning parameters of the dynamics of the particles from their positions in time-consecutive images. Our algorithm belongs to the class of message-passing algorithms, also known in computer science, information theory and statistical physics under the name of Belief Propagation (BP). The algorithm is distributed, thus allowing parallel implementation suitable for computations on multiple machines without significant inter-machine overhead. We test our method on the model example of particle tracking in turbulent flows, which is particularly challenging due to the strong transport that those flows produce. Our numerical experiments show that the BP algorithm compares in quality with exact Markov Chain Monte-Carlo algorithms, yet BP is far superior in speed. We also suggest and analyze a random-distance model that provides theoretical justification for BP accuracy. Methods developed here systematically formulate the problem of particle tracking and provide fast and reliable tools for its extensive range of applications.

  19. Active messages versus explicit message passing under SUNMOS

    SciTech Connect

    Riesen, R.; Wheat, S.R.; Maccabe, A.B.

    1994-07-01

    In the past few years much effort has been devoted to finding faster and more convenient ways to exchange data between nodes of massively parallel distributed memory machines. One such approach, taken by Thorsten von Eicken et al. is called Active Messages. The idea is to hide message passing latency and continue to compute while data is being sent and delivered. The authors have implemented Active Messages under SUNMOS for the Intel Paragon and performed various experiments to determine their efficiency and utility. In this paper they concentrate on the subset of the Active Message layer that is used by the implementation of the Split-C library. They compare performance to explicit message passing under SUNMOS and explore new ways to support Split-C without Active Messages. They also compare the implementation to the original one on the Thinking Machines CM-5 and try to determine what the effects of low latency and low band-width versus high latency and high bandwidth are on user codes.

  20. 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.

  1. Message-passing performance of various computers

    SciTech Connect

    Dongarra, J.J.; Dunigan, T.H.

    1996-02-01

    This report compares the performance of different computer systems message passing. Latency and bandwidth are measured on Convex, Cray, IBM, Intel, KSR, Meiko, nCUBE, NEC, SGI, and TMC multiprocessors. Communication performance is contrasted with the computational power of each system. The comparison includes both shared a memory computers as well as networked workstation cluster.

  2. 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.

  3. MPICH. Portable Implementation of the Standard Message Passing Interface

    SciTech Connect

    Gropp, W.; Lusk, E.; Doss, N.; Skjellum, A.

    1992-12-01

    MPICH is a portable implementation of the MPI Message Passing Interface standard. A general-purpose library, it contains routines with which to write message-passing programs for a variety of parallell computers and workstation networks.

  4. Generalized communicators in the message passing interface

    SciTech Connect

    Foster, I.; Kesselmman, C.; Snir, M.

    1996-12-31

    We propose extensions to the Message Passing Interface (MPI) that generalize the MPI communicator concept to allow multiple communication endpoints per process, dynamic creation of endpoints, and the transfer of endpoints between processes. The generalized communicator construct can be used to express a wide range of interesting communication structures, including collective communication operations involving multiple threads per process, communications between dynamically created threads, and object- oriented applications in which communications are directed to specific objects. Furthermore. this enriched functionality can be provided in a manner that preserves backward compatibility with MPI. We describe the proposed extensions, illustrate their use with examples, and discuss implementation issues.

  5. Message passing kernel for the hypercluster parallel processing test bed

    SciTech Connect

    Blech, R.A.; Quealy, A.; Cole, G.L.

    1989-01-01

    A Message-Passing Kernel (MPK) for the Hypercluster parallel-processing test bed is described. The Hypercluster is being developed at the NASA Lewis Research Center to support investigations of parallel algorithms and architectures for computational fluid and structural mechanics applications. The Hypercluster resembles the hypercube architecture except that each node consists of multiple processors communicating through shared memory. The MPK efficiently routes information through the Hypercluster, using a message-passing protocol when necessary and faster shared-memory communication whenever possible. The MPK also interfaces all of the processors with the Hypercluster operating system (HYCLOPS), which runs on a Front-End Processor (FEP). This approach distributes many of the I/O tasks to the Hypercluster processors and eliminates the need for a separate I/O support program on the FEP.

  6. Message passing with queues and channels

    DOEpatents

    Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer; Ratterman, Joseph D; Steinmacher-Burow, Burkhard; Wisniewski, Robert W

    2013-09-24

    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 send 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.

  7. Study of parallel efficiency in message passing environments

    SciTech Connect

    Hanebutte, U.R.; Tatsumi, Masahiro

    1996-03-01

    A benchmark test using the Message Passing Interface (MPI, an emerging standard for writing message passing programs) has been developed, to study parallel performance in message passing environments. The test is comprised of a computational task of independent calculations followed by a round-robin data communication step. Performance data as a function of computational granularity and message passing requirements are presented for the IBM SPx at Argonne National Laboratory and for a cluster of quasi-dedicated SUN SPARC Station 20`s. In the later portion of the paper a widely accepted communication cost model combined with Amdahl`s law is used to obtain performance predictions for uneven distributed computational work loads.

  8. 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.

  9. Message passing with a limited number of DMA byte counters

    DOEpatents

    Blocksome, Michael [Rochester, MN; Chen, Dong [Croton on Hudson, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kumar, Sameer [White Plains, NY; Parker, Jeffrey J [Rochester, MN

    2011-10-04

    A method for passing messages in a parallel computer system constructed as a plurality of compute nodes interconnected as a network where each compute node includes a DMA engine but includes only a limited number of byte counters for tracking a number of bytes that are sent or received by the DMA engine, where the byte counters may be used in shared counter or exclusive counter modes of operation. The method includes using rendezvous protocol, a source compute node deterministically sending a request to send (RTS) message with a single RTS descriptor using an exclusive injection counter to track both the RTS message and message data to be sent in association with the RTS message, to a destination compute node such that the RTS descriptor indicates to the destination compute node that the message data will be adaptively routed to the destination node. Using one DMA FIFO at the source compute node, the RTS descriptors are maintained for rendezvous messages destined for the destination compute node to ensure proper message data ordering thereat. Using a reception counter at a DMA engine, the destination compute node tracks reception of the RTS and associated message data and sends a clear to send (CTS) message to the source node in a rendezvous protocol form of a remote get to accept the RTS message and message data and processing the remote get (CTS) by the source compute node DMA engine to provide the message data to be sent.

  10. Direct Deposit -- When Message Passing Meets Shared Memory

    DTIC Science & Technology

    2000-05-19

    by H. Karl in [64]. The paper implements the pure DSM code, the pure message passing code and a few intermediate forms on the Charlotte DSM system [8...ASPLOS VI), pages 51–60, San Jose, October 1994. ACM. [64] H. Karl . Bridging the gap between distributed shared memory and message passing. Concurrency...pages 94 – 101, 1988. [73] P.N. Loewenstein and D.L. Dill. Verification of a multiprocessor cache protocol using simulation relations and higher-order

  11. 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.

  12. Charon Message-Passing Toolkit for Scientific Computations

    NASA Technical Reports Server (NTRS)

    VanderWijngarrt, Rob F.; Saini, Subhash (Technical Monitor)

    1998-01-01

    The Charon toolkit for piecemeal development of high-efficiency parallel programs for scientific computing is described. The portable toolkit, callable from C and Fortran, provides flexible domain decompositions and high-level distributed constructs for easy translation of serial legacy code or design to distributed environments. Gradual tuning can subsequently be applied to obtain high performance, possibly by using explicit message passing. Charon also features general structured communications that support stencil-based computations with complex recurrences. Through the separation of partitioning and distribution, the toolkit can also be used for blocking of uni-processor code, and for debugging of parallel algorithms on serial machines. An elaborate review of recent parallelization aids is presented to highlight the need for a toolkit like Charon. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability.

  13. Charon Message-Passing Toolkit for Scientific Computations

    NASA Technical Reports Server (NTRS)

    VanderWijngaart, Rob F.; Saini, Subhash (Technical Monitor)

    1998-01-01

    The Charon toolkit for piecemeal development of high-efficiency parallel programs for scientific computing is described. The portable toolkit, callable from C and Fortran, provides flexible domain decompositions and high-level distributed constructs for easy translation of serial legacy code or design to distributed environments. Gradual tuning can subsequently be applied to obtain high performance, possibly by using explicit message passing. Charon also features general structured communications that support stencil-based computations with complex recurrences. Through the separation of partitioning and distribution, the toolkit can also be used for blocking of uni-processor code, and for debugging of parallel algorithms on serial machines. An elaborate review of recent parallelization aids is presented to highlight the need for a toolkit like Charon. Some performance results of parallelizing the NAS Parallel Benchmark SP program using Charon are given, showing good scalability.

  14. Message passing with queues and channels

    DOEpatents

    Dozsa, Gabor J; Heidelberger, Philip; Kumar, Sameer; Ratterman, Joseph D; Steinmacher-Burrow, Burkhard

    2013-02-19

    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 the 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.

  15. Neuberger's double-pass algorithm

    NASA Astrophysics Data System (ADS)

    Chiu, Ting-Wai; Hsieh, Tung-Han

    2003-12-01

    We analyze Neuberger’s double-pass algorithm for the matrix-vector multiplication R(H)ṡY [where R(H) is (n-1,n)th degree rational polynomial of positive definite operator H], and show that the number of floating-point operations is independent of the degree n, provided that the number of sites is much larger than the number of iterations in the conjugate gradient. This implies that the matrix-vector product (H)-1/2Y≃R(n-1,n)(H)ṡY can be approximated to very high precision with sufficiently large n, without noticeably extra costs. Further, we show that there exists a threshold nT such that the double-pass is faster than the single pass for n>nT, where nT≃12 25 for most platforms.

  16. Development of Message Passing Routines for High Performance Parallel Computations

    NASA Technical Reports Server (NTRS)

    Summers, Edward K.

    2004-01-01

    Computational Fluid Dynamics (CFD) calculations require a great deal of computing power for completing the detailed computations involved. In an effort shorten the time it takes to complete such calculations they are implemented on a parallel computer. In the case of a parallel computer some sort of message passing structure must be used to communicate between the computers because, unlike a single machine, each computer in a parallel computing cluster does not have access to all the data or run all the parts of the total program. Thus, message passing is used to divide up the data and send instructions to each machine. The nature of my work this summer involves programming the "message passing" aspect of the parallel computer. I am working on modifying an existing program, which was written with OpenMP, and does not use a multi-machine parallel computing structure, to work with Message Passing Interface (MPI) routines. The actual code is being written in the FORTRAN 90 programming language. My goal is to write a parameterized message passing structure that could be used for a variety of individual applications and implement it on Silicon Graphics Incorporated s (SGI) IRIX operating system. With this new parameterized structure engineers would be able to speed up computations for a wide variety of purposes without having to use larger and more expensive computing equipment from another division or another NASA center.

  17. Development of Message Passing Routines for High Performance Parallel Computations

    NASA Technical Reports Server (NTRS)

    Summers, Edward K.

    2004-01-01

    Computational Fluid Dynamics (CFD) calculations require a great deal of computing power for completing the detailed computations involved. In an effort shorten the time it takes to complete such calculations they are implemented on a parallel computer. In the case of a parallel computer some sort of message passing structure must be used to communicate between the computers because, unlike a single machine, each computer in a parallel computing cluster does not have access to all the data or run all the parts of the total program. Thus, message passing is used to divide up the data and send instructions to each machine. The nature of my work this summer involves programming the "message passing" aspect of the parallel computer. I am working on modifying an existing program, which was written with OpenMP, and does not use a multi-machine parallel computing structure, to work with Message Passing Interface (MPI) routines. The actual code is being written in the FORTRAN 90 programming language. My goal is to write a parameterized message passing structure that could be used for a variety of individual applications and implement it on Silicon Graphics Incorporated s (SGI) IRIX operating system. With this new parameterized structure engineers would be able to speed up computations for a wide variety of purposes without having to use larger and more expensive computing equipment from another division or another NASA center.

  18. 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

  19. 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.

  20. Standards for message-passing in a distributed memory environment

    SciTech Connect

    Walker, D.W.

    1992-08-01

    This report presents a summary of the main ideas presented at the First CRPC Work-shop on Standards for Message Passing in a Distributed Memory Environment, held April 29-30, 1992, in Williamsburg, Virginia. This workshop attracted 68 attendees including representative from major hardware and software vendors, and was the first in a series of workshops sponsored by the Center for Research on Parallel Computation. The aim of this series of workshops is to develop and implement a standard for message passing on distributed memory concurrent computers, thereby making it easier to develop efficient, portable application codes for such machines. The report discusses the main issues raised in the CRPC workshop, and describes proposed desirable features of a message passing standard for distributed memory environments.

  1. 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.

  2. 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.

  3. Efficiently passing messages in distributed spiking neural network simulation

    PubMed Central

    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. PMID:23772213

  4. Physics/computer science. Passing messages between disciplines.

    PubMed

    Mézard, Marc

    2003-09-19

    Problems in computer science, such as error correction in information transfer and "satisfiability" in optimization, show phase transitions familiar from solid-state physics. In his Perspective, Mézard explains how recent advances in these three fields originate in similar "message passing" procedures. The exchange of elaborate messages between different variables and constraints, used in the study of phase transitions in physical systems, helps to make error correction and satisfiability codes more efficient.

  5. Extensible message passing application development and debugging with Python

    SciTech Connect

    Beazley, D.M.; Lomdahl, P.S.

    1996-09-19

    The authors describe how they have parallelized Python, an interpreted object oriented scripting language, and used it to build an extensible message-passing C/C++ applications for the CM-5, Cray T3D, and Sun multiprocessor servers running MPI. Using a parallelized Python interpreter, it is possible to interact with large-scale parallel applications, rapidly prototype new features, and perform application specific debugging. It is even possible to write message passing programs in Python itself. The authors describe some of the tools they have developed to extend Python and applications of this approach.

  6. Message passing in fault-tolerant quantum error correction

    NASA Astrophysics Data System (ADS)

    Evans, Zachary W. E.; Stephens, Ashley M.

    2008-12-01

    Inspired by Knill’s scheme for message passing error detection, here we develop a scheme for message passing error correction for the nine-qubit Bacon-Shor code. We show that for two levels of concatenated error correction, where classical information obtained at the first level is used to help interpret the syndrome at the second level, our scheme will correct all cases with four physical errors. This results in a reduction of the logical failure rate relative to conventional error correction by a factor proportional to the reciprocal of the physical error rate.

  7. Algorithms for TOC message transmission control

    NASA Astrophysics Data System (ADS)

    Wu, Hai-Tao; Zhang, Hui-Jun; Bian, Yu-Jing

    2001-12-01

    The algorithms and approach for TOC message broadcasting control are studied in this paper. The TOC message can be broadcasted, solely or alternating with DGNSS message, over one Loran-C channel. The availability of the messages in alternating broadcast mode is analyzed. The recurrence formulae of the sequence number of the header of the TOC message frames are given. The corresponding appraoch for braodcasting control is presented.

  8. Asynchronous Message Passing in the JPL Flight System Testbed

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott

    1996-01-01

    The flight mission simulation software in the Jet Propulsion Laboratory's Flight System Testbed (FST) is a heterogeneous, distributed system that is built on an interprocess communication model of asynchronous message passing rather than remote procedure calls (RPCs). The reasoning behind this design decision is discussed; the mechanism used to implement it (.

  9. Asynchronous Message Passing in the JPL Flight System Testbed

    NASA Technical Reports Server (NTRS)

    Burleigh, Scott

    1996-01-01

    The flight mission simulation software in the Jet Propulsion Laboratory's Flight System Testbed (FST) is a heterogeneous, distributed system that is built on an interprocess communication model of asynchronous message passing rather than remote procedure calls (RPCs). The reasoning behind this design decision is discussed; the mechanism used to implement it (.

  10. 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.

  11. Containing Epidemic Outbreaks by Message-Passing Techniques

    NASA Astrophysics Data System (ADS)

    Altarelli, F.; Braunstein, A.; Dall'Asta, L.; Wakeling, J. R.; Zecchina, R.

    2014-04-01

    The problem of targeted network immunization can be defined as the one of finding a subset of nodes in a network to immunize or vaccinate in order to minimize a tradeoff between the cost of vaccination and the final (stationary) expected infection under a given epidemic model. Although computing the expected infection is a hard computational problem, simple and efficient mean-field approximations have been put forward in the literature in recent years. The optimization problem can be recast into a constrained one in which the constraints enforce local mean-field equations describing the average stationary state of the epidemic process. For a wide class of epidemic models, including the susceptible-infected-removed and the susceptible-infected-susceptible models, we define a message-passing approach to network immunization that allows us to study the statistical properties of epidemic outbreaks in the presence of immunized nodes as well as to find (nearly) optimal immunization sets for a given choice of parameters and costs. The algorithm scales linearly with the size of the graph, and it can be made efficient even on large networks. We compare its performance with topologically based heuristics, greedy methods, and simulated annealing on both random graphs and real-world networks.

  12. 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

  13. A study of application sensitivity to variation in message passing latency and bandwidth

    SciTech Connect

    Worley, P.H.; Mackay, D.R.; Robinson, A.C.; Barragy, E.J.

    1996-06-01

    This study measures the effects of changes in message latency and bandwidth for production-level codes on a current generation tightly coupled MPP, the Intel Paragon. Messages are sent multiple times to study the application sensitivity to variations in band - width and latency. This method preserves the effects of contention on the interconnection network. Two applications are studied, PCTH, a shock physics code developed at Sandia National Laboratories, and PSTSWM, a spectral shallow water code developed at Oak Ridge National Laboratory and Argonne National Laboratory. These codes are significant in that PCTH is a {open_quote}full physics{close_quotes} application code in production use, while PSTSWM serves as a parallel algorithm test bed and benchmark for production codes used in atmospheric modeling. They are also significant in that the message-passing behavior differs significantly between the two codes, each representing an important class of scientific message-passing applications.

  14. 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.

  15. 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

  16. Variations over the message computation algorithm of lazy propagation.

    PubMed

    Madsen, Anders L

    2006-06-01

    Improving the performance of belief updating becomes increasingly important as real-world Bayesian networks continue to grow larger and more complex. In this paper, an investigation is done on how variations over the message-computation algorithm of lazy propagation may impact its performance. Lazy propagation is a junction-tree-based inference algorithm for belief updating in Bayesian networks. Lazy propagation combines variable elimination (VE) with a Shenoy-Shafer message-passing scheme in an attempt to exploit the independence properties induced by evidence in a junction-tree-based algorithm. The authors investigate, the use of arc reversal (AR) and symbolic probabilistic inference (SPI) as alternative algorithms for computing clique-to-clique messages in lazy propagation. The paper presents the results of an empirical evaluation of the performance of lazy propagation using AR, SPI, and VE as the message-computation algorithm. The results of the empirical evaluation show that no single algorithm outperforms or is outperformed by the other two alternatives. In many cases, there is no significant difference in the performance of the three algorithms.

  17. Unsupervised feature learning from finite data by message passing: Discontinuous versus continuous phase transition

    NASA Astrophysics Data System (ADS)

    Huang, Haiping; Toyoizumi, Taro

    2016-12-01

    Unsupervised neural network learning extracts hidden features from unlabeled training data. This is used as a pretraining step for further supervised learning in deep networks. Hence, understanding unsupervised learning is of fundamental importance. Here, we study the unsupervised learning from a finite number of data, based on the restricted Boltzmann machine where only one hidden neuron is considered. Our study inspires an efficient message-passing algorithm to infer the hidden feature and estimate the entropy of candidate features consistent with the data. Our analysis reveals that the learning requires only a few data if the feature is salient and extensively many if the feature is weak. Moreover, the entropy of candidate features monotonically decreases with data size and becomes negative (i.e., entropy crisis) before the message passing becomes unstable, suggesting a discontinuous phase transition. In terms of convergence time of the message-passing algorithm, the unsupervised learning exhibits an easy-hard-easy phenomenon as the training data size increases. All these properties are reproduced in an approximate Hopfield model, with an exception that the entropy crisis is absent, and only continuous phase transition is observed. This key difference is also confirmed in a handwritten digits dataset. This study deepens our understanding of unsupervised learning from a finite number of data and may provide insights into its role in training deep networks.

  18. A message passing kernel for the hypercluster parallel processing test bed

    NASA Technical Reports Server (NTRS)

    Blech, Richard A.; Quealy, Angela; Cole, Gary L.

    1989-01-01

    A Message-Passing Kernel (MPK) for the Hypercluster parallel-processing test bed is described. The Hypercluster is being developed at the NASA Lewis Research Center to support investigations of parallel algorithms and architectures for computational fluid and structural mechanics applications. The Hypercluster resembles the hypercube architecture except that each node consists of multiple processors communicating through shared memory. The MPK efficiently routes information through the Hypercluster, using a message-passing protocol when necessary and faster shared-memory communication whenever possible. The MPK also interfaces all of the processors with the Hypercluster operating system (HYCLOPS), which runs on a Front-End Processor (FEP). This approach distributes many of the I/O tasks to the Hypercluster processors and eliminates the need for a separate I/O support program on the FEP.

  19. 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.

  20. A Fine-Grain, Message-Passing Processing Node,

    DTIC Science & Technology

    1987-11-01

    is 2Ons. Wormhole routing (71 [8] [19] is used to give an idle-network latency of 201)+80L ns, where D is the distance in channels and L is the message...The NDFs deliver a message using wormhole routing. Buffering com- presses the message when blockage occurs. to (4,2) is in use). The tail of the message

  1. Message Passing vs. Shared Address Space on a Cluster of SMPs

    NASA Technical Reports Server (NTRS)

    Shan, Hongzhang; Singh, Jaswinder Pal; Oliker, Leonid; Biswas, Rupak

    2000-01-01

    The convergence of scalable computer architectures using clusters of PCs (or PC-SMPs) with commodity networking has become an attractive platform for high end scientific computing. Currently, message-passing and shared address space (SAS) are the two leading programming paradigms for these systems. Message-passing has been standardized with MPI, and is the most common and mature programming approach. However message-passing code development can be extremely difficult, especially for irregular 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 programming effort, required for six applications under both programming models on a 32 CPU PC-SMP cluster. Our application suite consists of codes that typically do not exhibit high efficiency under shared memory programming. due to their high communication to computation ratios and complex communication patterns. Results indicate that SAS can achieve about half the parallel efficiency of MPI for most of our applications: however, on certain classes of problems SAS performance is competitive with MPI. We also present new algorithms for improving the PC cluster performance of MPI collective operations.

  2. Space Reclamation for Uncoordinated Checkpointing in Message-Passing Systems. Ph.D. Thesis

    NASA Technical Reports Server (NTRS)

    Wang, Yi-Min

    1993-01-01

    Checkpointing and rollback recovery are techniques that can provide efficient recovery from transient process failures. In a message-passing system, the rollback of a message sender may cause the rollback of the corresponding receiver, and the system needs to roll back to a consistent set of checkpoints called recovery line. If the processes are allowed to take uncoordinated checkpoints, the above rollback propagation may result in the domino effect which prevents recovery line progression. Traditionally, only obsolete checkpoints before the global recovery line can be discarded, and the necessary and sufficient condition for identifying all garbage checkpoints has remained an open problem. A necessary and sufficient condition for achieving optimal garbage collection is derived and it is proved that the number of useful checkpoints is bounded by N(N+1)/2, where N is the number of processes. The approach is based on the maximum-sized antichain model of consistent global checkpoints and the technique of recovery line transformation and decomposition. It is also shown that, for systems requiring message logging to record in-transit messages, the same approach can be used to achieve optimal message log reclamation. As a final topic, a unifying framework is described by considering checkpoint coordination and exploiting piecewise determinism as mechanisms for bounding rollback propagation, and the applicability of the optimal garbage collection algorithm to domino-free recovery protocols is demonstrated.

  3. Intel NX to PVM 3.2 message passing conversion library

    NASA Technical Reports Server (NTRS)

    Arthur, Trey; Nelson, Michael L.

    1993-01-01

    NASA Langley Research Center has developed a library that allows Intel NX message passing codes to be executed under the more popular and widely supported Parallel Virtual Machine (PVM) message passing library. PVM was developed at Oak Ridge National Labs and has become the defacto standard for message passing. This library will allow the many programs that were developed on the Intel iPSC/860 or Intel Paragon in a Single Program Multiple Data (SPMD) design to be ported to the numerous architectures that PVM (version 3.2) supports. Also, the library adds global operations capability to PVM. A familiarity with Intel NX and PVM message passing is assumed.

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

    SciTech Connect

    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.

  5. Characterizing Computation-Communication Overlap in Message-Passing Systems

    SciTech Connect

    David E. Bernholdt; Jarek Nieplocha; P. Sadayappan; Aniruddha G. Shet; Vinod Tipparaju

    2008-01-31

    Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end computers. In this report, we describe an instrumentation framework developed for message-passing systems to characterize the degree of overlap of communication with computation in the execution of parallel applications. The inability to obtain precise time-stamps for pertinent communication events is a significant problem, and is addressed by generation of minimum and maximum bounds on achieved overlap. The overlap measures can aid application developers and system designers in investigating scalability issues. The approach has been used to instrument two MPI implementations as well as the ARMCI system. The implementation resides entirely within the communication library and thus integrates well with existing approaches that operate outside the library. The utility of the framework is demonstrated by analyzing communication-computation overlap for micro-benchmarks and the NAS benchmarks, and the insights obtained are used to modify the NAS SP benchmark, resulting in improved overlap.

  6. Automated Performance Prediction of Message Passing Parallel Programs

    NASA Technical Reports Server (NTRS)

    Block, Robert J.; Mehra, Pankaj; Sarukkai, Sekhar; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    As the trend toward massively parallel processing continues, the need for tools that can predict scalability trends becomes greater. While high level languages Eke HPF have come into greater use, explicit message-passing programs proliferate, and will probably do so for some time, thanks to the onslaught of standards such as MPI. Much work has been done to create simple models that represent important characteristics of parallel programs, such as latency, network contention, and communication volume. But many of these methods still require a substantial manual effort to represent an application in the model's format. The YAPP ("Yet Another Performance Predictor") tool is an attempt to automate the formation of first-order expressions for completion time, with a minimum of programmer assistance. The content of this paper is as follows: First, we explore the implementation details of YAPP, and illustrate with examples some of the reasons that automatic prediction is difficult. In the following sections, we present the results of four applications, using execution traces on the Intel i860, analyze the error in YAPP's predictions, explain the limitations of our implementation, and mention possible future additions. In particular, we illustrate techniques used to identify pipeline communication patterns, and demonstrate how compiler analysis and regression are combined to automate the prediction process.

  7. Automated Performance Prediction of Message Passing Parallel Programs

    NASA Technical Reports Server (NTRS)

    Block, Robert J.; Mehra, Pankaj; Sarukkai, Sekhar; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    As the trend toward massively parallel processing continues, the need for tools that can predict scalability trends becomes greater. While high level languages Eke HPF have come into greater use, explicit message-passing programs proliferate, and will probably do so for some time, thanks to the onslaught of standards such as MPI. Much work has been done to create simple models that represent important characteristics of parallel programs, such as latency, network contention, and communication volume. But many of these methods still require a substantial manual effort to represent an application in the model's format. The YAPP ("Yet Another Performance Predictor") tool is an attempt to automate the formation of first-order expressions for completion time, with a minimum of programmer assistance. The content of this paper is as follows: First, we explore the implementation details of YAPP, and illustrate with examples some of the reasons that automatic prediction is difficult. In the following sections, we present the results of four applications, using execution traces on the Intel i860, analyze the error in YAPP's predictions, explain the limitations of our implementation, and mention possible future additions. In particular, we illustrate techniques used to identify pipeline communication patterns, and demonstrate how compiler analysis and regression are combined to automate the prediction process.

  8. A proposal for a user-level, message passing interface in a distributed memory environment

    SciTech Connect

    Dongarra, J.J. . Dept. of Computer Science Oak Ridge National Lab., TN ); Hempel, R. ); Hey, A.J.G. . Dept. of Electronics and Computer Science); Walker, D.W. )

    1993-02-01

    This paper describes Message Passing Interface 1 (MPI1), a proposed library interface standard for supporting point-to-point message passing. The intended standard will be provided with Fortran 77 and C interfaces, and will form the basis of a standard high level communication environment featuring collective communication and data distribution transformations. The standard proposed here provides blocking, nonblocking, and synchronized message passing between pairs of processes, with message selectivity by source process and message type. Provision is made for noncontiguous messages. Context control provides a convenient means of avoiding message selectivity conflicts between different phases of an application. The ability to form and manipulate process groups permits task parallelism to be exploited, and is a useful abstraction in controlling certain types of collective communication.

  9. A proposal for a user-level, message passing interface in a distributed memory environment

    SciTech Connect

    Dongarra, J.J. |; Hempel, R.; Hey, A.J.G.; Walker, D.W.

    1993-02-01

    This paper describes Message Passing Interface 1 (MPI1), a proposed library interface standard for supporting point-to-point message passing. The intended standard will be provided with Fortran 77 and C interfaces, and will form the basis of a standard high level communication environment featuring collective communication and data distribution transformations. The standard proposed here provides blocking, nonblocking, and synchronized message passing between pairs of processes, with message selectivity by source process and message type. Provision is made for noncontiguous messages. Context control provides a convenient means of avoiding message selectivity conflicts between different phases of an application. The ability to form and manipulate process groups permits task parallelism to be exploited, and is a useful abstraction in controlling certain types of collective communication.

  10. ERIK: An Expert Ship Message Interpreter New Mechanisms For Flexible Passing

    NASA Astrophysics Data System (ADS)

    Rosenberg, J.

    1985-04-01

    ERIK (Evaluating Reports using Integrated Knowledge) is a working system that was developed for the U.S. Coast Guard to parse ship messages. ERIK is capable of parsing at an impressive rate of 1000 to 2000 messages per day, sent from merchant vessels in all parts of the world. Since these reports contain vital information it is important that the system can parse and correct them quickly and accurately, and furthermore know when it has failed to do so. This paper will focus on the following three algorithms: The IntaaLatad spaliaL/ReqQanizeL integrates the tasks of recognizing items on the input stream and spelling correction. Traditionally these tasks were separated, with items that could not be recognized passed on to a separate speller. We will describe the process that allows fast expectation-based spelling correction and recognition in one unit. The InteLRLatara is a general control structure that allows parsing of the various fields even when the reports fail to follow a fixed format, contains various types of ambiguities (both structurely and conceptually) and can handle the intrusion of noisy and irrelevant information. Changing Contaxta without laking has the ability to recover from wrong assumptions due to erroneous information and correct the previously parsed structures without the need to reparse what has already been processed. These three algorithms provided the core of the ERIK system allowing it to accurately parse and correct ship messages with confidence in a real time, real world situation.

  11. 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.

  12. Fine-Grain Message-Passing Concurrent Computers.

    DTIC Science & Technology

    1988-08-01

    bisetion widths their channels are typically Wormhole Routing inrwr and dowe than the channels in a low-dimensional metwork. When these factors are...entire message is received before forwarding the packoet to the mic Cube (281). As -ay 2-cube with 16-bit wide channels next node. Uzing wormhole routing...gives a network laecy, has the same wiring complexity. With wormhole routing and Twjr, that as the sum of a component due to message lenigth 256-bit

  13. High-level message-passing constructs for Zipcode 1.0: Design and implementation

    SciTech Connect

    Smith, S.G.; Falgout, R.D.; Still, C.H.; Skjellum, A.

    1993-10-01

    Zipcode is a message passing system that was initially designed for multicomputers and homogeneous networks of computers. This paper describes Zipcode ``invoices,`` which raise the message-passing interface of Zipcode to a higher level of abstraction. The ``gather-send`` and ``receive-scatter`` semantics enable heterogeneous communication. The higher level of abstraction also simplifies message passing and reveals more optimizations. We explain the utility of these features and give examples of the calling sequences that implement them. All of these features are seen as enablers for parallel library development and large applications.

  14. MICA, a facility to achieve portability for message-passing and dynamic memory management in FORTRAN

    SciTech Connect

    Brown, J.C.; Mirin, A.A.

    1994-01-01

    MICA, which stands for Macro Interface for Communication and Allocation, is a macro facility for message passing and dynamic memory management for Fortran programs on Unix platforms. A combination of CPP and M4 preprocessing is used to provide the macro interface. CPP is used for conditional compilation according to machine architecture and selected memory management and message passing options. M4 is used for translating the macro calls into the appropriate Fortran code sequences. Several supporting Fortran subprograms are included.

  15. 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.

  16. Concurrent Aggregates (CA): An Object-Oriented Language for Fine-Grained Message-Passing Machines

    DTIC Science & Technology

    1990-07-01

    MIMD computer. In IEEE Proceeding of the International Conference on Parallel Processing , pages 6-8. IEEE, 1978. [911 V. Strassen. Gaussian ... processing language message-passing massively parallel 20. ABSTRACT (Continue on reverse side If neceee, and Identify by block nember) Fine-grained parallel...Parallel Programming, Object-oriented, Fine-grained, Parallel Processing , Language, Message-Passing, Massively Parallel. Concurrent Aggregates (CA): An

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

    SciTech Connect

    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 switchable 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.

  18. Shared Memory versus Message Passing Architectures: An Application Based Study

    DTIC Science & Technology

    1988-11-09

    Driven Processor [3.9]. things are rapidly changing. Using specialized routing chips and the technique of wormhole routing [6]. the network latencies...between the two which force tradeoffs between the two architectures. The shared memory architecture considered in this paper has a single global...application programmer to control the degree of consistency explicitly. In this paper . we explore several such tradeoffs between shared-memory and message

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

    NASA Technical Reports Server (NTRS)

    VanderWijngaart, Rob F.

    2000-01-01

    , 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.

  20. Message-passing implementation of the data diffusion communication model in fast multipole methods: large scale biomolecular simulations.

    PubMed

    Kurzak, Jakub; Pettitt, B Montgomery

    2008-01-01

    Biomolecular simulations require increasingly efficient parallel codes. We present an efficient communication algorithm for irregular problems exhibiting an all-to-many communication pattern. The algorithm is developed using message passing on distributed memory machines and assumes explicit knowledge of the interconnection topology. The algorithm maximizes locality of interprocessor communication by adopting to an arbitrary interconnection topology and at the same time takes multiprocessor nodes into account. The solution is incorporated into our implementation of the fast multipole method with periodic boundary conditions used for molecular dynamics simulations, but we believe it generalizes to many algorithms demonstrating an all-to-many communication pattern. We show that an irregular algorithm can be forced to behave like a systolic algorithm.

  1. A test implementation of the MPI draft message-passing standard

    SciTech Connect

    Gropp, W.; Lusk, E.

    1992-12-01

    Message passing is a common method for programming parallel computers. The lack of a standard has significantly impeded the development of portable software libraries for these machines. Recently, an ad-hoc committee was formed to develop a standard for message-passing software for parallel computers. This group first met in April 1992 at a workshop sponsored in part by the Center for Research on Parallel Computation (CRPC). Four of the attendees at that meeting produced a draft standard, henceforth referred to as the MPI (Message-Passing Interface) draft standard. After review by a larger group, and significant changes in the document, a meeting was held in November to discuss the MPI draft standard. This document is a result of those discussions; it describes a running implementation of in most of the proposed standard,plus additional routines that were suggested by the discussions at the November meeting.

  2. A test implementation of the MPI draft message-passing standard

    SciTech Connect

    Gropp, W.; Lusk, E.

    1992-12-01

    Message passing is a common method for programming parallel computers. The lack of a standard has significantly impeded the development of portable software libraries for these machines. Recently, an ad-hoc committee was formed to develop a standard for message-passing software for parallel computers. This group first met in April 1992 at a workshop sponsored in part by the Center for Research on Parallel Computation (CRPC). Four of the attendees at that meeting produced a draft standard, henceforth referred to as the MPI (Message-Passing Interface) draft standard. After review by a larger group, and significant changes in the document, a meeting was held in November to discuss the MPI draft standard. This document is a result of those discussions; it describes a running implementation of in most of the proposed standard,plus additional routines that were suggested by the discussions at the November meeting.

  3. Optimizing spread dynamics on graphs by message passing

    NASA Astrophysics Data System (ADS)

    Altarelli, F.; Braunstein, A.; Dall'Asta, L.; Zecchina, R.

    2013-09-01

    Cascade processes are responsible for many important phenomena in natural and social sciences. Simple models of irreversible dynamics on graphs, in which nodes activate depending on the state of their neighbors, have been successfully applied to describe cascades in a large variety of contexts. Over the past decades, much effort has been devoted to understanding the typical behavior of the cascades arising from initial conditions extracted at random from some given ensemble. However, the problem of optimizing the trajectory of the system, i.e. of identifying appropriate initial conditions to maximize (or minimize) the final number of active nodes, is still considered to be practically intractable, with the only exception being models that satisfy a sort of diminishing returns property called submodularity. Submodular models can be approximately solved by means of greedy strategies, but by definition they lack cooperative characteristics which are fundamental in many real systems. Here we introduce an efficient algorithm based on statistical physics for the optimization of trajectories in cascade processes on graphs. We show that for a wide class of irreversible dynamics, even in the absence of submodularity, the spread optimization problem can be solved efficiently on large networks. Analytic and algorithmic results on random graphs are complemented by the solution of the spread maximization problem on a real-world network (the Epinions consumer reviews network).

  4. Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications

    NASA Astrophysics Data System (ADS)

    Lesieur, Thibault; Krzakala, Florent; Zdeborová, Lenka

    2017-07-01

    This article is an extended version of previous work of Lesieur et al (2015 IEEE Int. Symp. on Information Theory Proc. pp 1635-9 and 2015 53rd Annual Allerton Conf. on Communication, Control and Computing (IEEE) pp 680-7) on low-rank matrix estimation in the presence of constraints on the factors into which the matrix is factorized. Low-rank matrix factorization is one of the basic methods used in data analysis for unsupervised learning of relevant features and other types of dimensionality reduction. We present a framework to study the constrained low-rank matrix estimation for a general prior on the factors, and a general output channel through which the matrix is observed. We draw a parallel with the study of vector-spin glass models—presenting a unifying way to study a number of problems considered previously in separate statistical physics works. We present a number of applications for the problem in data analysis. We derive in detail a general form of the low-rank approximate message passing (Low-RAMP) algorithm, that is known in statistical physics as the TAP equations. We thus unify the derivation of the TAP equations for models as different as the Sherrington-Kirkpatrick model, the restricted Boltzmann machine, the Hopfield model or vector (xy, Heisenberg and other) spin glasses. The state evolution of the Low-RAMP algorithm is also derived, and is equivalent to the replica symmetric solution for the large class of vector-spin glass models. In the section devoted to result we study in detail phase diagrams and phase transitions for the Bayes-optimal inference in low-rank matrix estimation. We present a typology of phase transitions and their relation to performance of algorithms such as the Low-RAMP or commonly used spectral methods.

  5. Progressive Retry for Software Failure Recovery in Message-Passing Applications

    DTIC Science & Technology

    1993-10-01

    modeled as unavailable logical checkpoints 5A synchronized, distributed algorithm has been proposed by Sistla and Welch [271; an asynchronous...systems using optimistic message logging and checkpointing," J. Algorithms, Vol. 11, pp. 462-491, 1990. [27] A. P. Sistla and J. L. Welch, "Efficient

  6. QMP-MVIA: a message passing system for Linux clusters with gigabit Ethernet mesh connections

    SciTech Connect

    Jie Chen; W. Watson III; Robert Edwards; Weizhen Mao

    2004-09-01

    Recent progress in performance coupled with a decline in price for copper-based gigabit Ethernet (GigE) interconnects makes them an attractive alternative to expensive high speed network interconnects (NIC) when constructing Linux clusters. However traditional message passing systems based on TCP for GigE interconnects cannot fully utilize the raw performance of today's GigE interconnects due to the overhead of kernel involvement and multiple memory copies during sending and receiving messages. The overhead is more evident in the case of mesh connected Linux clusters using multiple GigE interconnects in a single host. We present a general message passing system called QMP-MVIA (QCD Message Passing over M-VIA) for Linux clusters with mesh connections using GigE interconnects. In particular, we evaluate and compare the performance characteristics of TCP and M-VIA (an implementation of the VIA specification) software for a mesh communication architecture to demonstrate the feasibility of using M-VIA as a point-to-point communication software, on which QMP-MVIA is based. Furthermore, we illustrate the design and implementation of QMP-MVIA for mesh connected Linux clusters with emphasis on both point-to-point and collective communications, and demonstrate that QMP-MVIA message passing system using GigE interconnects achieves bandwidth and latency that are not only better than systems based on TCP but also compare favorably to systems using some of the specialized high speed interconnects in a switched architecture at much lower cost.

  7. Probabilistic Algorithm for Sampler Siting (PASS)

    SciTech Connect

    Lorenzetti, David M.; Sohn, Michael D.

    2007-05-29

    PASS (Probabilistic Approach to Sampler Siting) optimizes the placement of samplers in buildings. The program exhaustively checks every sampler-network that can be formed, evaluating against user-supplied simulations of the possible release scenarios. The program identifies the networks that maximize the probablity of detecting a release from among the suite of user-supllied scenarios. The user may specify how many networks to report, in order to provide a number of choices in cases where many networks have very similar behavior.

  8. The design of a standard message passing interface for distributed memory concurrent computers

    SciTech Connect

    Walker, D.W.

    1993-10-01

    This paper presents an overview of MPI, a proposed standard message passing interface for MIMD distributed memory concurrent computers. The design of MPI has been a collective effort involving researchers in the United States and Europe from many organizations and institutions. MPI includes point-to-point and collective communication routines, as well as support for process groups, communication contexts, and application topologies. While making use of new ideas where appropriate, the MPI standard is based largely on current practice.

  9. Cloud Middleware Combining the Functionalities of Message Passing and Scaling Control

    NASA Astrophysics Data System (ADS)

    Iakushkin, O.

    2016-02-01

    The paper is focused on a solution providing middleware control over both message passing and scaling in a cloud environment. We provide a detailed analysis of the issue and present the restrictions particular to the load-balancing and communications systems. We also justify the need of such middleware development for a cloud infrastructure. The paper describes the problems emerged while working on a concrete project and presents the results obtained so far.

  10. The Portals 3.0 Message Passing Interface Revision 1.0

    SciTech Connect

    BRIGHTWELL,RONALD B.; HUDSON,TRAMMELL B.; RIESEN,ROLF E.; MACCABE,ARTHUR B.

    1999-12-01

    This report presents a specification for the Portals 3.0 message passing interface. Portals 3.0 is intended to allow scalable, high-performance network communication between nodes of a parallel computing system. Specifically, it is designed to support a parallel computing platform composed of clusters of commodity workstations connected by a commodity system area network fabric. In addition, Portals 3.0 is well suited to massively parallel processing and embedded systems. Portals 3.0 represents an adoption of the data movement layer developed for massively parallel processing platforms, such as the 4500-node Intel TeraFLOPS machine.

  11. Single-Pass Clustering Algorithm Based on Storm

    NASA Astrophysics Data System (ADS)

    Fang, LI; Longlong, DAI; Zhiying, JIANG; Shunzi, LI

    2017-02-01

    The dramatically increasing volume of data makes the computational complexity of traditional clustering algorithm rise rapidly accordingly, which leads to the longer time. So as to improve the efficiency of the stream data clustering, a distributed real-time clustering algorithm (S-Single-Pass) based on the classic Single-Pass [1] algorithm and Storm [2] computation framework was designed in this paper. By employing this kind of method in the Topic Detection and Tracking (TDT) [3], the real-time performance of topic detection arises effectively. The proposed method splits the clustering process into two parts: one part is to form clusters for the multi-thread parallel clustering, the other part is to merge the generated clusters in the previous process and update the global clusters. Through the experimental results, the conclusion can be drawn that the proposed method have the nearly same clustering accuracy as the traditional Single-Pass algorithm and the clustering accuracy remains steady, computing rate increases linearly when increasing the number of cluster machines and nodes (processing threads).

  12. Formal verification of an oral messages algorithm for interactive consistency

    NASA Technical Reports Server (NTRS)

    Rushby, John

    1992-01-01

    The formal specification and verification of an algorithm for Interactive Consistency based on the Oral Messages algorithm for Byzantine Agreement is described. We compare our treatment with that of Bevier and Young, who presented a formal specification and verification for a very similar algorithm. Unlike Bevier and Young, who observed that 'the invariant maintained in the recursive subcases of the algorithm is significantly more complicated than is suggested by the published proof' and who found its formal verification 'a fairly difficult exercise in mechanical theorem proving,' our treatment is very close to the previously published analysis of the algorithm, and our formal specification and verification are straightforward. This example illustrates how delicate choices in the formulation of the problem can have significant impact on the readability of its formal specification and on the tractability of its formal verification.

  13. Comparative Study of Message Passing and Shared Memory Parallel Programming Models in Neural Network Training

    SciTech Connect

    Vitela, J.; Gordillo, J.; Cortina, L; Hanebutte, U.

    1999-12-14

    It is presented a comparative performance study of a coarse grained parallel neural network training code, implemented in both OpenMP and MPI, standards for shared memory and message passing parallel programming environments, respectively. In addition, these versions of the parallel training code are compared to an implementation utilizing SHMEM the native SGI/CRAY environment for shared memory programming. The multiprocessor platform used is a SGI/Cray Origin 2000 with up to 32 processors. It is shown that in this study, the native CRAY environment outperforms MPI for the entire range of processors used, while OpenMP shows better performance than the other two environments when using more than 19 processors. In this study, the efficiency is always greater than 60% regardless of the parallel programming environment used as well as of the number of processors.

  14. 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.

  15. 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.

  16. Toward Automatic Scalability Analysis of Message Passing Programs: A Case Study

    NASA Technical Reports Server (NTRS)

    Sarukkai, Sekhar R.; Mehra, Pankaj; Block, Robert; Tucker, Deanne (Technical Monitor)

    1994-01-01

    Scalability analysis forms an important component of any performance debugging cycle, for massively parallel machines. However, tools that help in performing such analysis for parallel programs are non-existent. The primary reason for lack of such tools is the complexity involved in capturing program dynamics such as communication-computation overlap, communication latencies and memory hierarchy reference patterns. In this paper, we highlight some simple techniques that can be used to study scalability of explicit message-passing parallel programs that consider the above issues. We start from the high level source code and use a methodology for deducing communication characteristics and its impact on the total execution time of the program. The approach is validated with the help of a pipelined method for solving scalar tri-diagonal systems, using both simulations and symbolic cost models on the Intel hypercube.

  17. A grid-enabled MPI : message passing in heterogeneous distributed computing systems.

    SciTech Connect

    Foster, I.; Karonis, N. T.

    2000-11-30

    Application development for high-performance distributed computing systems, or computational grids as they are sometimes called, requires grid-enabled tools that hide mundate aspects of the heterogeneous grid environment without compromising performance. As part of an investigation of these issues, they have developed MPICH-G, a grid-enabled implementation of the Message Passing Interface (MPI) that allows a user to run MPI programs across multiple computers at different sites using the same commands that would be used on a parallel computer. This library extends the Argonne MPICH implementation of MPI to use services provided by the globus grid toolkit. In this paper, they describe the MPICH-G implementation and present preliminary performance results.

  18. 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.

  19. Supporting the Development of Soft-Error Resilient Message Passing Applications using Simulation

    SciTech Connect

    Engelmann, Christian; Naughton III, Thomas J

    2016-01-01

    Radiation-induced bit flip faults are of particular concern in extreme-scale high-performance computing systems. This paper presents a simulation-based tool that enables the development of soft-error resilient message passing applications by permitting the investigation of their correctness and performance under various fault conditions. The documented extensions to the Extreme-scale Simulator (xSim) enable the injection of bit flip faults at specific of injection location(s) and fault activation time(s), while supporting a significant degree of configurability of the fault type. Experiments show that the simulation overhead with the new feature is ~2,325% for serial execution and ~1,730% at 128 MPI processes, both with very fine-grain fault injection. Fault injection experiments demonstrate the usefulness of the new feature by injecting bit flips in the input and output matrices of a matrix-matrix multiply application, revealing vulnerability of data structures, masking and error propagation. xSim is the very first simulation-based MPI performance tool that supports both, the injection of process failures and bit flip faults.

  20. 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.

  1. 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.

  2. Two-Dimensional Pattern-Coupled Sparse Bayesian Learning via Generalized Approximate Message Passing.

    PubMed

    Fang, Jun; Zhang, Lizao; Li, Hohgbin

    2016-04-20

    We consider the problem of recovering twodimensional (2-D) block-sparse signals with unknown cluster patterns. Two-dimensional block-sparse patterns arise naturally in many practical applications such as foreground detection and inverse synthetic aperture radar imaging. To exploit the underlying block-sparse structure, we propose a 2-D pattern-coupled hierarchical Gaussian prior model. The proposed pattern-coupled hierarchical Gaussian prior model imposes a soft coupling mechanism among neighboring coefficients through their shared hyperparameters. This coupling mechanism enables effective and automatic learning of the underlying irregular cluster patterns, without requiring any a priori knowledge of the block partition of sparse signals. We develop a computationally efficient Bayesian inference method which integrates the generalized approximate message passing (GAMP) technique with the proposed prior model. Simulation results show that the proposed method offers competitive recovery performance for a range of 2-D sparse signal recovery and image processing applications over existing method, meanwhile achieving a significant reduction in computational complexity.

  3. 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

  4. 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.

  5. 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.

  6. Implementation of a Message Passing Interface into a Cloud-Resolving Model for Massively Parallel Computing

    NASA Technical Reports Server (NTRS)

    Juang, Hann-Ming Henry; Tao, Wei-Kuo; Zeng, Xi-Ping; Shie, Chung-Lin; Simpson, Joanne; Lang, Steve

    2004-01-01

    The capability for massively parallel programming (MPP) using a message passing interface (MPI) has been implemented into a three-dimensional version of the Goddard Cumulus Ensemble (GCE) model. The design for the MPP with MPI uses the concept of maintaining similar code structure between the whole domain as well as the portions after decomposition. Hence the model follows the same integration for single and multiple tasks (CPUs). Also, it provides for minimal changes to the original code, so it is easily modified and/or managed by the model developers and users who have little knowledge of MPP. The entire model domain could be sliced into one- or two-dimensional decomposition with a halo regime, which is overlaid on partial domains. The halo regime requires that no data be fetched across tasks during the computational stage, but it must be updated before the next computational stage through data exchange via MPI. For reproducible purposes, transposing data among tasks is required for spectral transform (Fast Fourier Transform, FFT), which is used in the anelastic version of the model for solving the pressure equation. The performance of the MPI-implemented codes (i.e., the compressible and anelastic versions) was tested on three different computing platforms. The major results are: 1) both versions have speedups of about 99% up to 256 tasks but not for 512 tasks; 2) the anelastic version has better speedup and efficiency because it requires more computations than that of the compressible version; 3) equal or approximately-equal numbers of slices between the x- and y- directions provide the fastest integration due to fewer data exchanges; and 4) one-dimensional slices in the x-direction result in the slowest integration due to the need for more memory relocation for computation.

  7. 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.

  8. Steganography algorithm multi pixel value differencing (MPVD) to increase message capacity and data security

    NASA Astrophysics Data System (ADS)

    Rojali, Siahaan, Ida Sri Rejeki; Soewito, Benfano

    2017-08-01

    Steganography is the art and science of hiding the secret messages so the existence of the message cannot be detected by human senses. The data concealment is using the Multi Pixel Value Differencing (MPVD) algorithm, utilizing the difference from each pixel. The development was done by using six interval tables. The objective of this algorithm is to enhance the message capacity and to maintain the data security.

  9. 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

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

    PubMed

    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.

  11. 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

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

    SciTech Connect

    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 matching 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.

  13. The development and performance of a message-passing version of the PAGOSA shock-wave physics code

    SciTech Connect

    Gardner, D.R.; Vaughan, C.T.

    1997-10-01

    A message-passing version of the PAGOSA shock-wave physics code has been developed at Sandia National Laboratories for multiple-instruction, multiple-data stream (MIMD) computers. PAGOSA is an explicit, Eulerian code for modeling the three-dimensional, high-speed hydrodynamic flow of fluids and the dynamic deformation of solids under high rates of strain. It was originally developed at Los Alamos National Laboratory for the single-instruction, multiple-data (SIMD) Connection Machine parallel computers. The performance of Sandia`s message-passing version of PAGOSA has been measured on two MIMD machines, the nCUBE 2 and the Intel Paragon XP/S. No special efforts were made to optimize the code for either machine. The measured scaled speedup (computational time for a single computational node divided by the computational time per node for fixed computational load) and grind time (computational time per cell per time step) show that the MIMD PAGOSA code scales linearly with the number of computational nodes used on a variety of problems, including the simulation of shaped-charge jets perforating an oil well casing. Scaled parallel efficiencies for MIMD PAGOSA are greater than 0.70 when the available memory per node is filled (or nearly filled) on hundreds to a thousand or more computational nodes on these two machines, indicating that the code scales very well. Thus good parallel performance can be achieved for complex and realistic applications when they are first implemented on MIMD parallel computers.

  14. Scalable High Performance Message Passing over InfiniBand for Open MPI

    SciTech Connect

    Friedley, A; Hoefler, T; Leininger, M L; Lumsdaine, A

    2007-10-24

    InfiniBand (IB) is a popular network technology for modern high-performance computing systems. MPI implementations traditionally support IB using a reliable, connection-oriented (RC) transport. However, per-process resource usage that grows linearly with the number of processes, makes this approach prohibitive for large-scale systems. IB provides an alternative in the form of a connectionless unreliable datagram transport (UD), which allows for near-constant resource usage and initialization overhead as the process count increases. This paper describes a UD-based implementation for IB in Open MPI as a scalable alternative to existing RC-based schemes. We use the software reliability capabilities of Open MPI to provide the guaranteed delivery semantics required by MPI. Results show that UD not only requires fewer resources at scale, but also allows for shorter MPI startup times. A connectionless model also improves performance for applications that tend to send small messages to many different processes.

  15. Quantifying statistical interdependence by message passing on graphs-part II: multidimensional point processes.

    PubMed

    Dauwels, J; Vialatte, F; Weber, T; Musha, T; Cichocki, A

    2009-08-01

    Stochastic event synchrony is a technique to quantify the similarity of pairs of signals. First, events are extracted from the two given time series. Next, one tries to align events from one time series with events from the other. The better the alignment, the more similar the two time series are considered to be. In Part I, the companion letter in this issue, one-dimensional events are considered; this letter concerns multidimensional events. Although the basic idea is similar, the extension to multidimensional point processes involves a significantly more difficult combinatorial problem and therefore is nontrivial. Also in the multidimensional case, the problem of jointly computing the pairwise alignment and SES parameters is cast as a statistical inference problem. This problem is solved by coordinate descent, more specifically, by alternating the following two steps: (1) estimate the SES parameters from a given pairwise alignment; (2) with the resulting estimates, refine the pairwise alignment. The SES parameters are computed by maximum a posteriori (MAP) estimation (step 1), in analogy to the one-dimensional case. The pairwise alignment (step 2) can no longer be obtained through dynamic programming, since the state space becomes too large. Instead it is determined by applying the max-product algorithm on a cyclic graphical model. In order to test the robustness and reliability of the SES method, it is first applied to surrogate data. Next, it is applied to detect anomalies in EEG synchrony of mild cognitive impairment (MCI) patients. Numerical results suggest that SES is significantly more sensitive to perturbations in EEG synchrony than a large variety of classical synchrony measures.

  16. A Study on the Effect of Communication Performance on Message-Passing Parallel Programs: Methodology and Case Studies

    NASA Technical Reports Server (NTRS)

    Sarukkai, Sekhar R.; Yan, Jerry; Woodrow, Thomas (Technical Monitor)

    1994-01-01

    From a source-program perspective, the performance achieved on distributed/parallel systems is governed by the underlying message-passing library overhead and the network capabilities of the architecture. Studying the impact of changes in these features on the source-program. can have a significant influence in the development of next-generation system designs. In this paper we introduce a simple and robust tool that can be used for this purpose. This tool is based on event-driven simulation of programs that generates a new set of trace events - that preserves causality and partial order - corresponding to the expected execution of the program in the simulated environment. Trace events can be visualized and source-level profile information can be used to pin-point locations of program which are most significantly affected with changing system parameters in the simulated environment. We present a number of examples from the NAS benchmark suite, executed on the Intel Paragon and iPSC/860 that are used to identify and expose performance bottlenecks with varying system parameters. Specific aspects of the system that significantly effect these benchmarks are presented and discussed,

  17. Task-parallel message passing interface implementation of Autodock4 for docking of very large databases of compounds using high-performance super-computers.

    PubMed

    Collignon, Barbara; Schulz, Roland; Smith, Jeremy C; Baudry, Jerome

    2011-04-30

    A message passing interface (MPI)-based implementation (Autodock4.lga.MPI) of the grid-based docking program Autodock4 has been developed to allow simultaneous and independent docking of multiple compounds on up to thousands of central processing units (CPUs) using the Lamarkian genetic algorithm. The MPI version reads a single binary file containing precalculated grids that represent the protein-ligand interactions, i.e., van der Waals, electrostatic, and desolvation potentials, and needs only two input parameter files for the entire docking run. In comparison, the serial version of Autodock4 reads ASCII grid files and requires one parameter file per compound. The modifications performed result in significantly reduced input/output activity compared with the serial version. Autodock4.lga.MPI scales up to 8192 CPUs with a maximal overhead of 16.3%, of which two thirds is due to input/output operations and one third originates from MPI operations. The optimal docking strategy, which minimizes docking CPU time without lowering the quality of the database enrichments, comprises the docking of ligands preordered from the most to the least flexible and the assignment of the number of energy evaluations as a function of the number of rotatable bounds. In 24 h, on 8192 high-performance computing CPUs, the present MPI version would allow docking to a rigid protein of about 300K small flexible compounds or 11 million rigid compounds.

  18. Task-parallel message passing interface implementation of Autodock4 for docking of very large databases of compounds using high-performance super-computers

    SciTech Connect

    Collignon, Barbara C; Schultz, Roland; Smith, Jeremy C; Baudry, Jerome Y

    2011-01-01

    A message passing interface (MPI)-based implementation (Autodock4.lga.MPI) of the grid-based docking program Autodock4 has been developed to allow simultaneous and independent docking of multiple compounds on up to thousands of central processing units (CPUs) using the Lamarkian genetic algorithm. The MPI version reads a single binary file containing precalculated grids that represent the protein-ligand interactions, i.e., van der Waals, electrostatic, and desolvation potentials, and needs only two input parameter files for the entire docking run. In comparison, the serial version of Autodock4 reads ASCII grid files and requires one parameter file per compound. The modifications performed result in significantly reduced input/output activity compared with the serial version. Autodock4.lga.MPI scales up to 8192 CPUs with a maximal overhead of 16.3%, of which two thirds is due to input/output operations and one third originates from MPI operations. The optimal docking strategy, which minimizes docking CPU time without lowering the quality of the database enrichments, comprises the docking of ligands preordered from the most to the least flexible and the assignment of the number of energy evaluations as a function of the number of rotatable bounds. In 24 h, on 8192 high-performance computing CPUs, the present MPI version would allow docking to a rigid protein of about 300K small flexible compounds or 11 million rigid compounds.

  19. Message Passing Semantics.

    DTIC Science & Technology

    1981-06-19

    IAP WorkshoD on Electronic Office of the Future, January 1979. 19. Hewitt, C. "Design of the APIARY for VLSI support of knowledge-based systems," MIT...AAAI Conference Stanford, Ca., August 1980, 157-164. 10. Hewitt, C.E. "The Apiary network architecture for knowledgeable systems," Proceedings of Lisp...Conference, Stanford, Ca., August 1980, 107-118. 11. Hewitt, C. " Apiary multiprocessor architecture knowlecigo system," 23 Proceedinas of the Joint

  20. An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility

    PubMed Central

    Park, Jihong; Kim, Ki-Hyung; Kim, Kangseok

    2017-01-01

    The IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) was proposed for various applications of IPv6 low power wireless networks. While RPL supports various routing metrics and is designed to be suitable for wireless sensor network environments, it does not consider the mobility of nodes. Therefore, there is a need for a method that is energy efficient and that provides stable and reliable data transmission by considering the mobility of nodes in RPL networks. This paper proposes an algorithm to support node mobility in RPL in an energy-efficient manner and describes its operating principle based on different scenarios. The proposed algorithm supports the mobility of nodes by dynamically adjusting the transmission interval of the messages that request the route based on the speed and direction of the motion of mobile nodes, as well as the costs between neighboring nodes. The performance of the proposed algorithm and previous algorithms for supporting node mobility were examined experimentally. From the experiment, it was observed that the proposed algorithm requires fewer messages per unit time for selecting a new parent node following the movement of a mobile node. Since fewer messages are used to select a parent node, the energy consumption is also less than that of previous algorithms. PMID:28422084

  1. An Algorithm for Timely Transmission of Solicitation Messages in RPL for Energy-Efficient Node Mobility.

    PubMed

    Park, Jihong; Kim, Ki-Hyung; Kim, Kangseok

    2017-04-19

    The IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) was proposed for various applications of IPv6 low power wireless networks. While RPL supports various routing metrics and is designed to be suitable for wireless sensor network environments, it does not consider the mobility of nodes. Therefore, there is a need for a method that is energy efficient and that provides stable and reliable data transmission by considering the mobility of nodes in RPL networks. This paper proposes an algorithm to support node mobility in RPL in an energy-efficient manner and describes its operating principle based on different scenarios. The proposed algorithm supports the mobility of nodes by dynamically adjusting the transmission interval of the messages that request the route based on the speed and direction of the motion of mobile nodes, as well as the costs between neighboring nodes. The performance of the proposed algorithm and previous algorithms for supporting node mobility were examined experimentally. From the experiment, it was observed that the proposed algorithm requires fewer messages per unit time for selecting a new parent node following the movement of a mobile node. Since fewer messages are used to select a parent node, the energy consumption is also less than that of previous algorithms.

  2. Message passing interface and multithreading hybrid for parallel molecular docking of large databases on petascale high performance computing machines.

    PubMed

    Zhang, Xiaohua; Wong, Sergio E; Lightstone, Felice C

    2013-04-30

    A mixed parallel scheme that combines message passing interface (MPI) and multithreading was implemented in the AutoDock Vina molecular docking program. The resulting program, named VinaLC, was tested on the petascale high performance computing (HPC) machines at Lawrence Livermore National Laboratory. To exploit the typical cluster-type supercomputers, thousands of docking calculations were dispatched by the master process to run simultaneously on thousands of slave processes, where each docking calculation takes one slave process on one node, and within the node each docking calculation runs via multithreading on multiple CPU cores and shared memory. Input and output of the program and the data handling within the program were carefully designed to deal with large databases and ultimately achieve HPC on a large number of CPU cores. Parallel performance analysis of the VinaLC program shows that the code scales up to more than 15K CPUs with a very low overhead cost of 3.94%. One million flexible compound docking calculations took only 1.4 h to finish on about 15K CPUs. The docking accuracy of VinaLC has been validated against the DUD data set by the re-docking of X-ray ligands and an enrichment study, 64.4% of the top scoring poses have RMSD values under 2.0 Å. The program has been demonstrated to have good enrichment performance on 70% of the targets in the DUD data set. An analysis of the enrichment factors calculated at various percentages of the screening database indicates VinaLC has very good early recovery of actives.

  3. QLWFPC2: Parallel-Processing Quick-Look WFPC2 Stellar Photometry Based on the Message Passing Interface

    NASA Astrophysics Data System (ADS)

    Mighell, K. J.

    2004-07-01

    I describe a new parallel-processing stellar photometry code called QLWFPC2 (http://www.noao.edu/staff/mighell/qlwfpc2) which is designed to do quick-look analysis of two entire WFPC2 observations from the Hubble Space Telescope in under 5 seconds using a fast Beowulf cluster with a Gigabit-Ethernet local network. This program is written in ANSI C and uses MPICH implementation of the Message Passing Interface from the Argonne National Laboratory for the parallel-processing communications, the CFITSIO library (from HEASARC at NASA's GSFC) for reading the standard FITS files from the HST Data Archive, and the Parameter Interface Library (from the INTEGRAL Science Data Center) for the IRAF parameter-file user interface. QLWFPC2 running on 4 processors takes about 2.4 seconds to analyze the WFPC2 archive datasets u37ga407r.c0.fits (F555W; 300 s) and u37ga401r.c0.fits (F814W; 300 s) of M54 (NGC 6715) which is the bright massive globular cluster near the center of the nearby Sagittarius dwarf spheroidal galaxy. The analysis of these HST observations of M54 lead to the serendipitous discovery of more than 50 new bright variable stars in the central region of M54. Most of the candidate variables stars are found on the PC1 images of the cluster center --- a region where no variables have been reported by previous ground-based studies of variables in M54. This discovery is an example of how QLWFPC2 can be used to quickly explore the time domain of observations in the HST Data Archive.

  4. QLWFPC2: Parallel-Processing Quick-Look WFPC2 Stellar Photometry based on the Message Passing Interface

    NASA Astrophysics Data System (ADS)

    Mighell, K. J.

    2003-12-01

    I describe a new parallel-processing stellar photometry code called QLWFPC2 which is designed to do quick-look analysis of two entire WFPC2 observations from the Hubble Space Telescope in under 5 seconds using a fast Beowulf cluster with a Gigabit Ethernet local network. This program is written in ANSI/ISO C and uses the MPICH implementation of the Message Passing Interface from the Argonne National Laboratory for the parallel-processing communications, the CFITSIO library (from HEASARC at NASA's GSFC) for reading the standard FITS files from the HST Data Archive and the Parameter Interface Library (from the INTEGRAL Science Data Center) for the IRAF parameter-file user interface. QLWFPC2 running on 4 processors takes about 2.4 seconds to analyze WFPC2 archive datasets u37ga407r.c0.fits (F555W; 300 s) and u37ga401r.c0.fits (F814W; 300 s) of M54 (NGC 6715) which is the bright massive globular cluster near the center of the nearby Sagittarius dwarf spheroidal galaxy. The analysis of these HST observations of M54 lead to the serendipitous discovery of more than 50 new bright variable stars in the central region of M54. Most of the candidate variables stars are found on the PC1 images of the cluster center --- a region where no variables have been reported by previous ground-based studies of variables in M54. This discovery is an example of how QLWFPC2 can be used to quickly explore the time domain of observations in the HST Data Archive. This work is supported by a grant from the National Aeronautics and Space Administration (NASA), Order No. S-13811-G, which was awarded by the Applied Information Systems Research Program (AISRP) of NASA's Office of Space Science (NRA 01-OSS-01).

  5. Fast one-pass algorithm to label objects and compute their features

    NASA Astrophysics Data System (ADS)

    Thai, Tan Q.

    1991-12-01

    In many image processing applications, labeling objects and computing their features for recognition are crucial steps for further analysis. In general these two steps are done separately. This paper proposes a new approach to label all objects and computer their features (such as moments, best fit ellipse, major and minor axis) in one pass. The basic idea of the algorithm is to detect interval overlaps among the line segments as the image is scanned from left to right, top to bottom. Ambiguity about an object's connectivity can also be resolved with the proposed algorithm. It is a fast algorithm and can be implemented on either serial or parallel processors.

  6. Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm.

    PubMed

    Chang, Wei-Der

    2015-01-01

    This paper develops a new design scheme for the phase response of an all-pass recursive digital filter. A variant of particle swarm optimization (PSO) algorithm will be utilized for solving this kind of filter design problem. It is here called the modified PSO (MPSO) algorithm in which another adjusting factor is more introduced in the velocity updating formula of the algorithm in order to improve the searching ability. In the proposed method, all of the designed filter coefficients are firstly collected to be a parameter vector and this vector is regarded as a particle of the algorithm. The MPSO with a modified velocity formula will force all particles into moving toward the optimal or near optimal solution by minimizing some defined objective function of the optimization problem. To show the effectiveness of the proposed method, two different kinds of linear phase response design examples are illustrated and the general PSO algorithm is compared as well. The obtained results show that the MPSO is superior to the general PSO for the phase response design of digital recursive all-pass filter.

  7. Ripple FPN reduced algorithm based on temporal high-pass filter and hardware implementation

    NASA Astrophysics Data System (ADS)

    Li, Yiyang; Li, Shuo; Zhang, Zhipeng; Jin, Weiqi; Wu, Lei; Jin, Minglei

    2016-11-01

    Cooled infrared detector arrays always suffer from undesired Ripple Fixed-Pattern Noise (FPN) when observe the scene of sky. The Ripple Fixed-Pattern Noise seriously affect the imaging quality of thermal imager, especially for small target detection and tracking. It is hard to eliminate the FPN by the Calibration based techniques and the current scene-based nonuniformity algorithms. In this paper, we present a modified space low-pass and temporal high-pass nonuniformity correction algorithm using adaptive time domain threshold (THP&GM). The threshold is designed to significantly reduce ghosting artifacts. We test the algorithm on real infrared in comparison to several previously published methods. This algorithm not only can effectively correct common FPN such as Stripe, but also has obviously advantage compared with the current methods in terms of detail protection and convergence speed, especially for Ripple FPN correction. Furthermore, we display our architecture with a prototype built on a Xilinx Virtex-5 XC5VLX50T field-programmable gate array (FPGA). The hardware implementation of the algorithm based on FPGA has two advantages: (1) low resources consumption, and (2) small hardware delay (less than 20 lines). The hardware has been successfully applied in actual system.

  8. New temporal high-pass filter non-uniformity correction algorithm based on change detection

    NASA Astrophysics Data System (ADS)

    Li, Hang; Zhou, Xiao; Hu, Ruo-lan; Jia, Jun-tao; Zhang, Gui-lin

    2009-07-01

    The spatial non-uniformity in the photo-response of the detectors in the array on the focal-plane array (FPA) Infrared imaging systems restricted the infrared applications. In this paper, we improve the method of temporal high-pass filter for the complex real scene sequence. Firstly, it adopts the one point non-uniformity correction algorithm which calibrates the FPA at distinct temperatures by use of flat-field data generated from a black-body radiation source. It realized simply and it compensated for the spatial non-uniformity coarsely. After this step, the convergent time of the temporal high-pass algorithm was reduced, and the grade of ghost-shading was alleviated. And then, we analyze the pixels of images and classify them to two categories. One is the changed pixels, another is the stillness pixels. For different kinds of pixels, deal with different strategies. For the changed pixels, estimate the offset with the temporal high-pass filter algorithm. For the stillness pixels, estimate the offset with the iterative steps. This strategy reduced the grade of scene-vanishing when scene was stillness, and the grade of ghost-shading when target moving fast after stillness. Testing on the real infrared image sequence, the experiments showed that this method was very promising.

  9. A robust SEM auto-focus algorithm using multiple band-pass filters

    NASA Astrophysics Data System (ADS)

    Harada, Minoru; Obara, Kenji; Nakamae, Koji

    2017-01-01

    An auto-focus algorithm using multiple band-pass filters for a scanning electron microscope (SEM) is proposed. To acquire sharp images of various kinds of defects by SEM defect observation in semiconductor manufacturing, the auto-focus process must be robust. A method for designing a band-pass filter for calculating the ‘focus measure’ (a key parameter of the auto-focus process) is proposed. To achieve an optimal specific frequency response for various images, multiple band-pass filters are introduced. As for the proposed method, two series of focus measures are calculated by using multiple band-pass filters independently, and it is selected according to reliability of the series of focus measures. The signal-to-noise ratio of an image for acceptable auto-focus precision is determined by simulation using pseudo images. In an experiment using the proposed method with real images, the success rate of auto focus is improved from 79.4% to 95.6%.

  10. Scaling and performance of a 3-D radiation hydrodynamics code on message-passing parallel computers: final report

    SciTech Connect

    Hayes, J C; Norman, M

    1999-10-28

    This report details an investigation into the efficacy of two approaches to solving the radiation diffusion equation within a radiation hydrodynamic simulation. Because leading-edge scientific computing platforms have evolved from large single-node vector processors to parallel aggregates containing tens to thousands of individual CPU's, the ability of an algorithm to maintain high compute efficiency when distributed over a large array of nodes is critically important. The viability of an algorithm thus hinges upon the tripartite question of numerical accuracy, total time to solution, and parallel efficiency.

  11. A hybrid method based on Band Pass Filter and Correlation Algorithm to improve debris sensor capacity

    NASA Astrophysics Data System (ADS)

    Hong, Wei; Wang, Shaoping; Liu, Haokuo; Tomovic, Mileta M.; Chao, Zhang

    2017-01-01

    The inductive debris detection is an effective method for monitoring mechanical wear, and could be used to prevent serious accidents. However, debris detection during early phase of mechanical wear, when small debris (<100 um) is generated, requires that the sensor has high sensitivity with respect to background noise. In order to detect smaller debris by existing sensors, this paper presents a hybrid method which combines Band Pass Filter and Correlation Algorithm to improve sensor signal-to-noise ratio (SNR). The simulation results indicate that the SNR will be improved at least 2.67 times after signal processing. In other words, this method ensures debris identification when the sensor's SNR is bigger than -3 dB. Thus, smaller debris will be detected in the same SNR. Finally, effectiveness of the proposed method is experimentally validated.

  12. A complexity-efficient and one-pass image compression algorithm for wireless capsule endoscopy.

    PubMed

    Liu, Gang; Yan, Guozheng; Zhao, Shaopeng; Kuang, Shuai

    2015-01-01

    As an important part of the application-specific integrated circuit (ASIC) in wireless capsule endoscopy (WCE), the efficient compressor is crucial for image transmission and power consumption. In this paper, a complexity-efficient and one-pass image compression method is proposed for WCE with Bayer format images. The algorithm is modified from the standard lossless algorithm (JPEG-LS). Firstly, a causal interpolation is used to acquire the context template of a current pixel to be encoded, thus determining different encoding modes. Secondly, a gradient predictor, instead of the median predictor, is designed to improve the accuracy of the predictions. Thirdly, the gradient context is quantized to obtain the context index (Q). Eventually, the encoding process is achieved in different modes. The experimental and comparative results show that our proposed near-lossless compression method provides a high compression rate (2.315) and a high image quality (46.31 dB) compared with other methods. It performs well in the designed wireless capsule system and could be applied in other image fields.

  13. Message passing for optimization and control of a power grid: model of a distribution system with redundancy.

    PubMed

    Zdeborová, Lenka; Decelle, Aurélien; Chertkov, Michael

    2009-10-01

    We use a power grid model with M generators and N consumption units to optimize the grid and its control. Each consumer demand is drawn from a predefined finite-size-support distribution, thus simulating the instantaneous load fluctuations. Each generator has a maximum power capability. A generator is not overloaded if the sum of the loads of consumers connected to a generator does not exceed its maximum production. In the standard grid each consumer is connected only to its designated generator, while we consider a more general organization of the grid allowing each consumer to select one generator depending on the load from a predefined consumer dependent and sufficiently small set of generators which can all serve the load. The model grid is interconnected in a graph with loops, drawn from an ensemble of random bipartite graphs, while each allowed configuration of loaded links represent a set of graph covering trees. Losses, the reactive character of the grid and the transmission-level connections between generators (and many other details relevant to realistic power grid) are ignored in this proof-of-principles study. We focus on the asymptotic limit, N-->infinity and N/M-->D=O(1)>1 , and we show that the interconnects allow significant expansion of the parameter domains for which the probability of a generator overload is asymptotically zero. Our construction explores the formal relation between the problem of grid optimization and the modern theory of sparse graphical models. We also design heuristic algorithms that achieve the asymptotically optimal selection of loaded links. We conclude discussing the ability of this approach to include other effects such as a more realistic modeling of the power grid and related optimization and control algorithms.

  14. An algorithm used for quality criterion automatic measurement of band-pass filters and its device implementation

    NASA Astrophysics Data System (ADS)

    Liu, Qianshun; Liu, Yan; Yu, Feihong

    2013-08-01

    As a kind of film device, band-pass filter is widely used in pattern recognition, infrared detection, optical fiber communication, etc. In this paper, an algorithm for automatic measurement of band-pass filter quality criterion is proposed based on the proven theory calculation of derivate spectral transmittance of filter formula. Firstly, wavelet transform to reduce spectrum data noises is used. Secondly, combining with the Gaussian curve fitting and least squares method, the algorithm fits spectrum curve and searches the peak. Finally, some parameters for judging band-pass filter quality are figure out. Based on the algorithm, a pipeline for band-pass filters automatic measurement system has been designed that can scan the filter array automatically and display spectral transmittance of each filter. At the same time, the system compares the measuring result with the user defined standards to determine if the filter is qualified or not. The qualified product will be market with green color, and the unqualified product will be marked with red color. With the experiments verification, the automatic measurement system basically realized comprehensive, accurate and rapid measurement of band-pass filter quality and achieved the expected results.

  15. Optimal message log reclamation for uncoordinated checkpointing

    NASA Technical Reports Server (NTRS)

    Wang, Yi-Min; Fuchs, W. K.

    1994-01-01

    Uncoordinated checkpointing for message-passing systems allows maximum process autonomy and general nondeterministic execution, but suffers from potential domino effect and the large space overhead for maintaining checkpoints and message logs. Traditionally, it has been assumed that only obsolete checkpoints and message logs before the global recovery line can be garbage-collected. Recently, an approach to identifying all garbage checkpoints based on recovery line transformation and decomposition has been developed. We show in this paper that the same approach can be applied to the problem of identifying all garbage message logs for systems requiring message logging to record in-transit messages. Communication trace-driven simulation for several parallel programs is used to evaluate the proposed algorithm.

  16. Optimal message log reclamation for uncoordinated checkpointing

    NASA Technical Reports Server (NTRS)

    Wang, Yi-Min; Fuchs, W. K.

    1994-01-01

    Uncoordinated checkpointing for message-passing systems allows maximum process autonomy and general nondeterministic execution, but suffers from potential domino effect and the large space overhead for maintaining checkpoints and message logs. Traditionally, it has been assumed that only obsolete checkpoints and message logs before the global recovery line can be garbage-collected. Recently, an approach to identifying all garbage checkpoints based on recovery line transformation and decomposition has been developed. We show in this paper that the same approach can be applied to the problem of identifying all garbage message logs for systems requiring message logging to record in-transit messages. Communication trace-driven simulation for several parallel programs is used to evaluate the proposed algorithm.

  17. Improved Noise Minimum Statistics Estimation Algorithm for Using in a Speech-Passing Noise-Rejecting Headset

    NASA Astrophysics Data System (ADS)

    Seyedtabaee, Saeed; Moazami Goodarzi, Hamze

    2010-12-01

    This paper deals with configuration of an algorithm to be used in a speech-passing angle grinder noise-canceling headset. Angle grinder noise is annoying and interrupts ordinary oral communication. Meaning that, low SNR noisy condition is ahead. Since variation in angle grinder working condition changes noise statistics, the noise will be nonstationary with possible jumps in its power. Studies are conducted for picking an appropriate algorithm. A modified version of the well-known spectral subtraction shows superior performance against alternate methods. Noise estimation is calculated through a multi-band fast adapting scheme. The algorithm is adapted very quickly to the non-stationary noise environment while inflecting minimum musical noise and speech distortion on the processed signal. Objective and subjective measures illustrating the performance of the proposed method are introduced.

  18. 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).

  19. 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.

  20. A novel pulse compression algorithm for frequency modulated active thermography using band-pass filter

    NASA Astrophysics Data System (ADS)

    Chatterjee, Krishnendu; Roy, Deboshree; Tuli, Suneet

    2017-05-01

    This paper proposes a novel pulse compression algorithm, in the context of frequency modulated thermal wave imaging. The compression filter is derived from a predefined reference pixel in a recorded video, which contains direct measurement of the excitation signal alongside the thermal image of a test piece. The filter causes all the phases of the constituent frequencies to be adjusted to nearly zero value, so that on reconstruction a pulse is obtained. Further, due to band-limited nature of the excitation, signal-to-noise ratio is improved by suppressing out-of-band noise. The result is similar to that of a pulsed thermography experiment, although the peak power is drastically reduced. The algorithm is successfully demonstrated on mild steel and carbon fibre reference samples. Objective comparisons of the proposed pulse compression algorithm with the existing techniques are presented.

  1. Parallelization of Edge Detection Algorithm using MPI on Beowulf Cluster

    NASA Astrophysics Data System (ADS)

    Haron, Nazleeni; Amir, Ruzaini; Aziz, Izzatdin A.; Jung, Low Tan; Shukri, Siti Rohkmah

    In this paper, we present the design of parallel Sobel edge detection algorithm using Foster's methodology. The parallel algorithm is implemented using MPI message passing library and master/slave algorithm. Every processor performs the same sequential algorithm but on different part of the image. Experimental results conducted on Beowulf cluster are presented to demonstrate the performance of the parallel algorithm.

  2. Accelerated multiple-pass moving average: a novel algorithm for baseline estimation in CE and its application to baseline correction on real-time bases.

    PubMed

    Solis, Alejandro; Rex, Mathew; Campiglia, Andres D; Sojo, Pedro

    2007-04-01

    We present a novel algorithm for baseline estimation in CE. The new algorithm which we have named as accelerated multiple-pass moving average (AMPMA) is combined to three preexisting low-pass filters, spike-removal, moving average, and multi-pass moving average filter, to achieve real-time baseline correction with commercial instrumentation. The successful performance of AMPMA is demonstrated with simulated and experimental data. Straightforward comparison of experimental data clearly shows the improvement AMPMA provides to the linear fitting, LOD, and accuracy (absolute error) of CE analysis.

  3. Effects of spectrometer band pass, sampling, and signal-to-noise ratio on spectral identification using the Tetracorder algorithm

    USGS Publications Warehouse

    Swayze, G.A.; Clark, R.N.; Goetz, A.F.H.; Chrien, T.H.; Gorelick, N.S.

    2003-01-01

    Estimates of spectrometer band pass, sampling interval, and signal-to-noise ratio required for identification of pure minerals and plants were derived using reflectance spectra convolved to AVIRIS, HYDICE, MIVIS, VIMS, and other imaging spectrometers. For each spectral simulation, various levels of random noise were added to the reflectance spectra after convolution, and then each was analyzed with the Tetracorder spectra identification algorithm [Clark et al., 2003]. The outcome of each identification attempt was tabulated to provide an estimate of the signal-to-noise ratio at which a given percentage of the noisy spectra were identified correctly. Results show that spectral identification is most sensitive to the signal-to-noise ratio at narrow sampling interval values but is more sensitive to the sampling interval itself at broad sampling interval values because of spectral aliasing, a condition when absorption features of different materials can resemble one another. The band pass is less critical to spectral identification than the sampling interval or signal-to-noise ratio because broadening the band pass does not induce spectral aliasing. These conclusions are empirically corroborated by analysis of mineral maps of AVIRIS data collected at Cuprite, Nevada, between 1990 and 1995, a period during which the sensor signal-to-noise ratio increased up to sixfold. There are values of spectrometer sampling and band pass beyond which spectral identification of materials will require an abrupt increase in sensor signal-to-noise ratio due to the effects of spectral aliasing. Factors that control this threshold are the uniqueness of a material's diagnostic absorptions in terms of shape and wavelength isolation, and the spectral diversity of the materials found in nature and in the spectral library used for comparison. Array spectrometers provide the best data for identification when they critically sample spectra. The sampling interval should not be broadened to

  4. 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.

  5. Parallel algorithm development

    SciTech Connect

    Adams, T.F.

    1996-06-01

    Rapid changes in parallel computing technology are causing significant changes in the strategies being used for parallel algorithm development. One approach is simply to write computer code in a standard language like FORTRAN 77 or with the expectation that the compiler will produce executable code that will run in parallel. The alternatives are: (1) to build explicit message passing directly into the source code; or (2) to write source code without explicit reference to message passing or parallelism, but use a general communications library to provide efficient parallel execution. Application of these strategies is illustrated with examples of codes currently under development.

  6. Deconvolution of continuous paleomagnetic data from pass-through magnetometer: A new algorithm to restore geomagnetic and environmental information based on realistic optimization

    NASA Astrophysics Data System (ADS)

    Oda, Hirokuni; Xuan, Chuang

    2014-10-01

    development of pass-through superconducting rock magnetometers (SRM) has greatly promoted collection of paleomagnetic data from continuous long-core samples. The output of pass-through measurement is smoothed and distorted due to convolution of magnetization with the magnetometer sensor response. Although several studies could restore high-resolution paleomagnetic signal through deconvolution of pass-through measurement, difficulties in accurately measuring the magnetometer sensor response have hindered the application of deconvolution. We acquired reliable sensor response of an SRM at the Oregon State University based on repeated measurements of a precisely fabricated magnetic point source. In addition, we present an improved deconvolution algorithm based on Akaike's Bayesian Information Criterion (ABIC) minimization, incorporating new parameters to account for errors in sample measurement position and length. The new algorithm was tested using synthetic data constructed by convolving "true" paleomagnetic signal containing an "excursion" with the sensor response. Realistic noise was added to the synthetic measurement using Monte Carlo method based on measurement noise distribution acquired from 200 repeated measurements of a u-channel sample. Deconvolution of 1000 synthetic measurements with realistic noise closely resembles the "true" magnetization, and successfully restored fine-scale magnetization variations including the "excursion." Our analyses show that inaccuracy in sample measurement position and length significantly affects deconvolution estimation, and can be resolved using the new deconvolution algorithm. Optimized deconvolution of 20 repeated measurements of a u-channel sample yielded highly consistent deconvolution results and estimates of error in sample measurement position and length, demonstrating the reliability of the new deconvolution algorithm for real pass-through measurements.

  7. Clandestine Message Passing in Virtual Environments

    DTIC Science & Technology

    2008-09-01

    Xbox 360 and PlayStation 3 as managerial software to set up person to person matches for any one of the hundreds of titles. The business world has... accounts are free; each additional account costs money. Virtual land can be purchased for a monthly fee. Recently, IBM reverse engineered their VE...million units sold worldwide up to and including the month of June 2008, the Nintendo Wii has outsold both the Xbox (19 million units) and PlayStation 3

  8. 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.

  9. 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.

  10. A hierarchical clustering algorithm for MIMD architecture.

    PubMed

    Du, Zhihua; Lin, Feng

    2004-12-01

    Hierarchical clustering is the most often used method for grouping similar patterns of gene expression data. A fundamental problem with existing implementations of this clustering method is the inability to handle large data sets within a reasonable time and memory resources. We propose a parallelized algorithm of hierarchical clustering to solve this problem. Our implementation on a multiple instruction multiple data (MIMD) architecture shows considerable reduction in computational time and inter-node communication overhead, especially for large data sets. We use the standard message passing library, message passing interface (MPI) for any MIMD systems.

  11. Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor

    NASA Technical Reports Server (NTRS)

    Belkhale, K. P.; Banerjee, P.

    1992-01-01

    Different algorithms for the geometric connected component labeling (GCCL) problem are defined each of which involves d stages of message passing, for a d-dimensional hypercube. The major idea is that in each stage a hypercube multiprocessor increases its knowledge of domain. The algorithms under consideration include the QUAD algorithm for small number of processors and the Overlap Quad algorithm for large number of processors, subject to the locality of the connected sets. These algorithms differ in their run time, memory requirements, and message complexity. They were implemented on an Intel iPSC2/D4/MX hypercube.

  12. Parameter optimization for a high-order band-pass continuous-time sigma-delta modulator MEMS gyroscope using a genetic algorithm approach

    NASA Astrophysics Data System (ADS)

    Chen, Fang; Chang, Honglong; Yuan, Weizheng; Wilcock, Reuben; Kraft, Michael

    2012-10-01

    This paper describes a novel multiobjective parameter optimization method based on a genetic algorithm (GA) for the design of a sixth-order continuous-time, force feedback band-pass sigma-delta modulator (BP-ΣΔM) interface for the sense mode of a MEMS gyroscope. The design procedure starts by deriving a parameterized Simulink model of the BP-ΣΔM gyroscope interface. The system parameters are then optimized by the GA. Consequently, the optimized design is tested for robustness by a Monte Carlo analysis to find a solution that is both optimal and robust. System level simulations result in a signal-to-noise ratio (SNR) larger than 90 dB in a bandwidth of 64 Hz with a 200° s-1 angular rate input signal; the noise floor is about -100 dBV Hz-1/2. The simulations are compared to measured data from a hardware implementation. For zero input rotation with the gyroscope operating at atmospheric pressure, the spectrum of the output bitstream shows an obvious band-pass noise shaping and a deep notch at the gyroscope resonant frequency. The noise floor of measured power spectral density (PSD) of the output bitstream agrees well with simulation of the optimized system level model. The bias stability, rate sensitivity and nonlinearity of the gyroscope controlled by an optimized BP-ΣΔM closed-loop interface are 34.15° h-1, 22.3 mV °-1 s-1, 98 ppm, respectively. This compares to a simple open-loop interface for which the corresponding values are 89° h-1, 14.3 mV °-1 s-1, 7600 ppm, and a nonoptimized BP-ΣΔM closed-loop interface with corresponding values of 60° h-1, 17 mV °-1 s-1, 200 ppm.

  13. Radiation transport calculations on unstructured grids using a spatially decomposed and threaded algorithm

    SciTech Connect

    Nemanic, M K; Nowak, P

    1999-04-12

    We consider the solution of time-dependent, energy-dependent, discrete ordinates, and nonlinear radiative transfer problems on three-dimensional unstructured spatial grids. We discuss the solution of this class of transport problems, using the code TETON, on large distributed-memory multinode computers having multiple processors per ''node'' (e.g. the IBM-SP). We discuss the use of both spatial decomposition using message passing between ''nodes'' and a threading algorithm in angle on each ''node''. We present timing studies to show how this algorithm scales to hundreds and thousands of processors. We also present an energy group ''batching'' algorithm that greatly enhances cache performance. Our conclusion, after considering cache performance, storage limitations and dependencies inherent in the physics, is that a model that uses a combination of message-passing and threading is superior to one that uses message-passing alone. We present numerical evidence to support our conclusion.

  14. Join-Graph Propagation Algorithms

    PubMed Central

    Mateescu, Robert; Kask, Kalev; Gogate, Vibhav; Dechter, Rina

    2010-01-01

    The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl's belief propagation algorithm (BP). We start with the bounded inference mini-clustering algorithm and then move to the iterative scheme called Iterative Join-Graph Propagation (IJGP), that combines both iteration and bounded inference. Algorithm IJGP belongs to the class of Generalized Belief Propagation algorithms, a framework that allowed connections with approximate algorithms from statistical physics and is shown empirically to surpass the performance of mini-clustering and belief propagation, as well as a number of other state-of-the-art algorithms on several classes of networks. We also provide insight into the accuracy of iterative BP and IJGP by relating these algorithms to well known classes of constraint propagation schemes. PMID:20740057

  15. President's Message

    ERIC Educational Resources Information Center

    Stephenson, Andy

    2007-01-01

    In this message from the International Technology Education Association (ITEA) president, Andy Stephenson stresses the need for technology, innovation, design, and engineering (TIDE) education. He cites the recent report--"Preparing for the Perfect Storm, a Report on the Forum, Taking Action Together: Developing a National Plan to Address the…

  16. Voice Messaging.

    ERIC Educational Resources Information Center

    Davis, Barbara D.; Tisdale, Judy Jones; Krapels, Roberta H.

    2001-01-01

    Surveys corporate use of voice message systems by interviewing employees in four different companies. Finds that all four companies viewed their voicemail systems as a supplement to personal contact (not a replacement) and provided training, but had no formal method to assess customer satisfaction with their system. Suggests business communication…

  17. Subtle Messages.

    ERIC Educational Resources Information Center

    Tamplin de Poinsot, Nan

    1999-01-01

    Describes a self-portrait assignment inspired by the work of Frida Kahlo. Discusses Frida Kahlo's artwork and use of surrealist and symbolist views. States that each student had to incorporate personal symbolism in the portrait to convey a message about him or herself in a subtle manner. (CMK)

  18. Subtle Messages.

    ERIC Educational Resources Information Center

    Tamplin de Poinsot, Nan

    1999-01-01

    Describes a self-portrait assignment inspired by the work of Frida Kahlo. Discusses Frida Kahlo's artwork and use of surrealist and symbolist views. States that each student had to incorporate personal symbolism in the portrait to convey a message about him or herself in a subtle manner. (CMK)

  19. President's Message

    ERIC Educational Resources Information Center

    Stephenson, Andy

    2007-01-01

    In this message from the International Technology Education Association (ITEA) president, Andy Stephenson stresses the need for technology, innovation, design, and engineering (TIDE) education. He cites the recent report--"Preparing for the Perfect Storm, a Report on the Forum, Taking Action Together: Developing a National Plan to Address the…

  20. Full tensor gravity gradiometry data inversion: Performance analysis of parallel computing algorithms

    NASA Astrophysics Data System (ADS)

    Hou, Zhen-Long; Wei, Xiao-Hui; Huang, Da-Nian; Sun, Xu

    2015-09-01

    We apply reweighted inversion focusing to full tensor gravity gradiometry data using message-passing interface (MPI) and compute unified device architecture (CUDA) parallel computing algorithms, and then combine MPI with CUDA to formulate a hybrid algorithm. Parallel computing performance metrics are introduced to analyze and compare the performance of the algorithms. We summarize the rules for the performance evaluation of parallel algorithms. We use model and real data from the Vinton salt dome to test the algorithms. We find good match between model and real density data, and verify the high efficiency and feasibility of parallel computing algorithms in the inversion of full tensor gravity gradiometry data.

  1. Optimal message log reclamation for independent checkpointing

    NASA Technical Reports Server (NTRS)

    Wang, Yi-Min; Fuchs, W. Kent

    1993-01-01

    Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

  2. Mixed messages

    PubMed Central

    Chen, Christopher B.; Hall, Kevin; Tsuyuki, Ross T.

    2014-01-01

    Background: More than 5 years ago, the Blueprint for Pharmacy developed a plan for transitioning pharmacy practice toward more patient-centred care. Much of the strategy for change involves communicating the new vision. Objective: To evaluate the communication of the Vision for Pharmacy by the organizations and corporations that signed the Blueprint for Pharmacy’s Commitment to Act. Methods: The list of 88 signatories of the Commitment to Act was obtained from the Blueprint for Pharmacy document. The website of each of these signatories was searched for all references to the Blueprint for Pharmacy or Vision for Pharmacy. Each of the identified references was then analyzed using summative content analysis. Results: A total of 934 references were identified from the webpages of the 88 signatories. Of these references, 549 were merely links to the Blueprint for Pharmacy’s website, 350 of the references provided some detailed information about the Blueprint for Pharmacy and only 35 references provided any specific plans to transition pharmacy practice. Conclusion: Widespread proliferation of the Vision for Pharmacy has not been achieved. One possible explanation for this is that communication of the vision by the signatories has been incomplete. To ensure the success of future communications, change leaders must develop strategies that consider how individual pharmacists and pharmacies understand the message. PMID:24660012

  3. Distributed System Fault Tolerance Using Message Logging and Checkpointing

    DTIC Science & Technology

    1989-12-01

    have been received, and Sistla and Welch [SistlaS9] require the sequence of messages received on each channel to be a prefix of those sent on it. Since...Recovery system [Strom85], and recently Sistla and Welch have proposed a new method using optimistic message logging [Sistla89], based in part on some...system. Sistla and Welch have proposed two alternative recovery algorithms based on op- timistic message logging [Sistla89]. One algorithm tags each

  4. Data communications in a parallel active messaging interface of a parallel computer

    DOEpatents

    Davis, Kristan D.; Faraj, Daniel A.

    2014-07-22

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and ranges of message sizes so that each algorithm is associated with a separate range of message sizes; receiving in an origin endpoint of the PAMI a data communications instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint, the data communications message characterized by a message size; selecting, from among the associated algorithms and ranges, a data communications algorithm in dependence upon the message size; and transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  5. Data communications in a parallel active messaging interface of a parallel computer

    DOEpatents

    Davis, Kristan D; Faraj, Daniel A

    2013-07-09

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and ranges of message sizes so that each algorithm is associated with a separate range of message sizes; receiving in an origin endpoint of the PAMI a data communications instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint, the data communications message characterized by a message size; selecting, from among the associated algorithms and ranges, a data communications algorithm in dependence upon the message size; and transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  6. Sharing Memory Robustly in Message-Passing Systems

    DTIC Science & Technology

    1990-02-16

    ust: a very restricted form of communication. Chor and Moscovici ([20]) present a hierarchy of resiliency for problems in shared-memory systems and...1985. [20] B. Chor, and L. Moscovici , Solvability in Asynchronous Environments, Proc. 30th Syrup. on Foun- * dations of Comp. Sc~en ce, pp. 422-427, 1989

  7. Characterizing Computation-Communication Overlap in Message-Passing Systems

    SciTech Connect

    David E. Bernholdt; Jarek Nieplocha; P. Sadayappan; Aniruddha G. Shet; Vinod Tipparaju

    2008-01-31

    Effective overlap of computation and communication is a well understood technique for latency hiding and can yield significant performance gains for applications on high-end computers. In this report, we describe an instrumentation framework developed for messagepassing systems to characterize the degree of overlap of communication with computation in the execution of parallel applications. The inability to obtain precise time-stamps for pertinent communication events is a significant problem, and is addressed by generation of minimum and maximum bounds on achieved overlap. The overlap measures can aid application developers and system designers in investigating scalability issues. The approach has been used to instrument two MPI implementations as well as the ARMCI system. The implementation resides entirely within the communication library and thus integrates well with existing approaches that operate outside the library. The utility of the framework is demonstrated by analyzing communication-computation overlap for micro-benchmarks and the NAS benchmarks, and the insights obtained are used to modify the NAS SP benchmark, resulting in improved overlap.

  8. Automated Scalability Analysis Tools for Message Passing Parallel Programs

    NASA Technical Reports Server (NTRS)

    Sarukkai, Sekhar R.; Mehra, Pankaj; Tucker, Deanne (Technical Monitor)

    1994-01-01

    In order to develop scalable parallel applications, a number of programming decisions have to be made during the development of the program. Performance tools that help in making these decisions are few, if existent. Traditionally, performance tools have focused on exposing performance bottlenecks of small-scale executions of the program. However, it is common knowledge that programs that perform exceptionally well on small processor configurations, more often than not, perform poorly when executed on larger processor configurations. Hence, new tools that predict the execution characteristics of scaled-up programs are an essential part of an application developers toolkit. In this paper we discuss important issues that need to be considered in order to build useful scalability analysis tools for parallel programs. We introduce a simple tool that automatically extracts scalability characteristics of a class of deterministic parallel programs. We show with the help of a number of results on the Intel iPSC/860, that predictions are within reasonable bounds.

  9. Automated Performance Prediction of Message-Passing Parallel Programs

    NASA Technical Reports Server (NTRS)

    Block, Robert J.; Sarukkai, Sekhar; Mehra, Pankaj; Woodrow, Thomas S. (Technical Monitor)

    1995-01-01

    The increasing use of massively parallel supercomputers to solve large-scale scientific problems has generated a need for tools that can predict scalability trends of applications written for these machines. Much work has been done to create simple models that represent important characteristics of parallel programs, such as latency, network contention, and communication volume. But many of these methods still require substantial manual effort to represent an application in the model's format. The NIK toolkit described in this paper is the result of an on-going effort to automate the formation of analytic expressions of program execution time, with a minimum of programmer assistance. In this paper we demonstrate the feasibility of our approach, by extending previous work to detect and model communication patterns automatically, with and without overlapped computations. The predictions derived from these models agree, within reasonable limits, with execution times of programs measured on the Intel iPSC/860 and Paragon. Further, we demonstrate the use of MK in selecting optimal computational grain size and studying various scalability metrics.

  10. Increasing fault resiliency in a message-passing environment.

    SciTech Connect

    Stearley, Jon R.; Riesen, Rolf E.; Laros, James H., III; Ferreira, Kurt Brian; Pedretti, Kevin Thomas Tauke; Oldfield, Ron A.; Kordenbrock, Todd; Brightwell, Ronald Brian

    2009-10-01

    Petaflops systems will have tens to hundreds of thousands of compute nodes which increases the likelihood of faults. Applications use checkpoint/restart to recover from these faults, but even under ideal conditions, applications running on more than 30,000 nodes will likely spend more than half of their total run time saving checkpoints, restarting, and redoing work that was lost. We created a library that performs redundant computations on additional nodes allocated to the application. An active node and its redundant partner form a node bundle which will only fail, and cause an application restart, when both nodes in the bundle fail. The goal of this library is to learn whether this can be done entirely at the user level, what requirements this library places on a Reliability, Availability, and Serviceability (RAS) system, and what its impact on performance and run time is. We find that our redundant MPI layer library imposes a relatively modest performance penalty for applications, but that it greatly reduces the number of applications interrupts. This reduction in interrupts leads to huge savings in restart and rework time. For large-scale applications the savings compensate for the performance loss and the additional nodes required for redundant computations.

  11. Suitability of Message Passing Computers for Implementing Production Systems

    DTIC Science & Technology

    1988-01-01

    tn.owns the buckets that it hashes to. The activities performed by the G s individual processors of the proceso pair are called nicro-tests, and C ho...our mapping, to allow the parallel processin Of (1) tokens all thes mcro-aks on the varios proceso pairs are performed in0 destined for the swe two

  12. Parallel Ray Tracing Using the Message Passing Interface

    DTIC Science & Technology

    2007-09-01

    Optica , which is a book on astronomy that contained the important principle that light rays travel from an object to an eye and not the other way around...this application. This interest is driven by commercial demands from the entertainment industry and a widespread in- terest in visualizing complex

  13. 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)

  14. Preparing EBS messages

    SciTech Connect

    Vogt, B.M., Sorensen, J.H.

    1992-09-01

    Warning messages transmitted to populations at risk from an accidental release of chemical agent must be carefully designed to maximize appropriate responses from affected publics. This guide develops an approach for preparing Emergency Broadcast System (EBS) messages for the Chemical Stockpile Emergency Preparedness Program (CSEPP). Sample messages illustrate the application of this approach. While the sample messages do not cover every emergency situation, the texts are generic in that accident and location specific factors can be incorporated into the final message developed by local emergency planners. Thus they provide a starting point, not an end product, for emergency planners.

  15. Research of a synchronized cooperative GIS system based on message

    NASA Astrophysics Data System (ADS)

    Sun, Yaqin; Du, Peijun; Zhou, Liangchen

    2010-11-01

    In traditional electronic government GIS (E-gov GIS), spatial data evaluation, examination and approval are dealt with by individuals, and the results are shared among collaborators in asynchronous mode. In order to improve the collaborative ability of E-gov GIS, a message-based synchronized cooperative GIS system (MSCGIS) is proposed in this paper. MSCGIS abstracts collaborators' GIS operations and encapsulates them into GIS command messages. And then the GIS command messages are passed and executed among related collaborators. Based on messaging, MSCGIS can realize the GIS synchronized cooperation of group. Some key issues are investigated in detail, such as the design scheme of MSCGIS, the encoding specification of GIS command message based on XML, and the interface and the collaborative process of prototype system. In a word, the construction idea of MSCGIS is sharing the GIS functions through passing collaborators' operations, rather than sharing spatial data among collaborators in traditional modes.

  16. Research of a synchronized cooperative GIS system based on message

    NASA Astrophysics Data System (ADS)

    Sun, Yaqin; Du, Peijun; Zhou, Liangchen

    2009-09-01

    In traditional electronic government GIS (E-gov GIS), spatial data evaluation, examination and approval are dealt with by individuals, and the results are shared among collaborators in asynchronous mode. In order to improve the collaborative ability of E-gov GIS, a message-based synchronized cooperative GIS system (MSCGIS) is proposed in this paper. MSCGIS abstracts collaborators' GIS operations and encapsulates them into GIS command messages. And then the GIS command messages are passed and executed among related collaborators. Based on messaging, MSCGIS can realize the GIS synchronized cooperation of group. Some key issues are investigated in detail, such as the design scheme of MSCGIS, the encoding specification of GIS command message based on XML, and the interface and the collaborative process of prototype system. In a word, the construction idea of MSCGIS is sharing the GIS functions through passing collaborators' operations, rather than sharing spatial data among collaborators in traditional modes.

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

    SciTech Connect

    Lifflander, Jonathan; Meneses, Esteban; Menon, Harshita; Miller, Phil; Krishnamoorthy, Sriram; Kale, Laxmikant

    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 by 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.

  18. The Argos seismic data message system.

    USGS Publications Warehouse

    Derr, J.S.; Hunter, R.N.

    1988-01-01

    A reliable, inexpensive method for sending limited daily seismic data messages from remote observatories to the National Earthquake Information Center has been developed for use with the Argos satellite system. Data messages are compressed on a microcomputer and passed automatically to a simple transmitter. About 4 hr later, the data are available at the National Earthquake Information Center, where they are decompressed and reformatted into standard telegrams for use in quick epicenter determinations. Epicenter data are available daily to the international scientific community.-Authors

  19. SMC Message Browser Projects

    NASA Technical Reports Server (NTRS)

    Wichmann, Benjamin C.

    2013-01-01

    I work directly with the System Monitoring and Control (SMC) software engineers who develop, test and release custom and commercial software in support of the Kennedy Space Center Spaceport Command and Control System. (SCCS). SMC uses Commercial Off-The-Shelf (COTS) Enterprise Management Systems (EMS) software which provides a centralized subsystem for configuring, monitoring, and controlling SCCS hardware and software used in the Control Rooms. There are multiple projects being worked on using the COTS EMS software. I am currently working with the HP Operations Manager for UNIX (OMU) software which allows Master Console Operators (MCO) to access, view and interpret messages regarding the status of the SCCS hardware and software. The OMU message browser gets cluttered with messages which can make it difficult for the MCO to manage. My main project involves determining ways to reduce the number of messages being displayed in the OMU message browser. I plan to accomplish this task in two different ways: (1) by correlating multiple messages into one single message being displayed and (2) to create policies that will determine the significance of each message and whether or not it needs to be displayed to the MCO. The core idea is to lessen the number of messages being sent to the OMU message browser so the MCO can more effectively use it.

  20. 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.

  1. Error message recording and reporting in the SLC control system

    SciTech Connect

    Spencer, N.; Bogart, J.; Phinney, N.; Thompson, K.

    1985-04-01

    Error or information messages that are signaled by control software either in the VAX host computer or the local microprocessor clusters are handled by a dedicated VAX process (PARANOIA). Messages are recorded on disk for further analysis and displayed at the appropriate console. Another VAX process (ERRLOG) can be used to sort, list and histogram various categories of messages. The functions performed by these processes and the algorithms used are discussed.

  2. Launching Family Message Journals.

    ERIC Educational Resources Information Center

    Wollman-Bonilla, Julie

    This lesson introduces Family Message Journals, a tool for encouraging family involvement and supporting writing to reflect and learn. First and second graders are led into composing through demonstration, guided writing, and finally independent writing of messages that they will bring home for family to read and write a reply. During the three…

  3. Message in a molecule.

    PubMed

    Sarkar, Tanmay; Selvakumar, Karuthapandi; Motiei, Leila; Margulies, David

    2016-05-03

    Since ancient times, steganography, the art of concealing information, has largely relied on secret inks as a tool for hiding messages. However, as the methods for detecting these inks improved, the use of simple and accessible chemicals as a means to secure communication was practically abolished. Here, we describe a method that enables one to conceal multiple different messages within the emission spectra of a unimolecular fluorescent sensor. Similar to secret inks, this molecular-scale messaging sensor (m-SMS) can be hidden on regular paper and the messages can be encoded or decoded within seconds using common chemicals, including commercial ingredients that can be obtained in grocery stores or pharmacies. Unlike with invisible inks, however, uncovering these messages by an unauthorized user is almost impossible because they are protected by three different defence mechanisms: steganography, cryptography and by entering a password, which are used to hide, encrypt or prevent access to the information, respectively.

  4. Message in a molecule

    PubMed Central

    Sarkar, Tanmay; Selvakumar, Karuthapandi; Motiei, Leila; Margulies, David

    2016-01-01

    Since ancient times, steganography, the art of concealing information, has largely relied on secret inks as a tool for hiding messages. However, as the methods for detecting these inks improved, the use of simple and accessible chemicals as a means to secure communication was practically abolished. Here, we describe a method that enables one to conceal multiple different messages within the emission spectra of a unimolecular fluorescent sensor. Similar to secret inks, this molecular-scale messaging sensor (m-SMS) can be hidden on regular paper and the messages can be encoded or decoded within seconds using common chemicals, including commercial ingredients that can be obtained in grocery stores or pharmacies. Unlike with invisible inks, however, uncovering these messages by an unauthorized user is almost impossible because they are protected by three different defence mechanisms: steganography, cryptography and by entering a password, which are used to hide, encrypt or prevent access to the information, respectively. PMID:27138465

  5. Establishing Passing Scores.

    ERIC Educational Resources Information Center

    McLarty, Joyce R.

    The problem of establishing appropriate passing scores is one of evaluation rather than estimation and not amenable to exact solution. It must therefore be approached by (1) identifying criteria for judging the acceptability of the passing score, (2) collecting the data appropriate to assessing each relevant criterion, and (3) judging how well the…

  6. A parallel encryption algorithm for dual-core processor based on chaotic map

    NASA Astrophysics Data System (ADS)

    Liu, Jiahui; Song, Dahua; Xu, Yiqiu

    2011-12-01

    In this paper, we propose a parallel chaos-based encryption scheme in order to take advantage of the dual-core processor. The chaos-based cryptosystem is combinatorially generated by the logistic map and Fibonacci sequence. Fibonacci sequence is employed to convert the value of the logistic map to integer data. The parallel algorithm is designed with a master/slave communication model with the Message Passing Interface (MPI). The experimental results show that chaotic cryptosystem possesses good statistical properties, and the parallel algorithm provides more enhanced performance against the serial version of the algorithm. It is suitable for encryption/decryption large sensitive data or multimedia.

  7. Particle-particle, particle-scaling function algorithm for electrostatic problems in free boundary conditions.

    PubMed

    Neelov, Alexey; Ghasemi, S Alireza; Goedecker, Stefan

    2007-07-14

    An algorithm for fast calculation of the Coulombic forces and energies of point particles with free boundary conditions is proposed. Its calculation time scales as N log N for N particles. This novel method has lower crossover point with the full O(N(2)) direct summation than the fast multipole method. The forces obtained by our algorithm are analytical derivatives of the energy which guarantees energy conservation during a molecular dynamics simulation. Our algorithm is very simple. A version of the code parallelized with the Message Passing Interface can be downloaded under the GNU General Public License from the website of our group.

  8. Parallel implementation of the FETI-DPEM algorithm for general 3D EM simulations

    NASA Astrophysics Data System (ADS)

    Li, Yu-Jia; Jin, Jian-Ming

    2009-05-01

    A parallel implementation of the electromagnetic dual-primal finite element tearing and interconnecting algorithm (FETI-DPEM) is designed for general three-dimensional (3D) electromagnetic large-scale simulations. As a domain decomposition implementation of the finite element method, the FETI-DPEM algorithm provides fully decoupled subdomain problems and an excellent numerical scalability, and thus is well suited for parallel computation. The parallel implementation of the FETI-DPEM algorithm on a distributed-memory system using the message passing interface (MPI) is discussed in detail along with a few practical guidelines obtained from numerical experiments. Numerical examples are provided to demonstrate the efficiency of the parallel implementation.

  9. A parallelization of the row-searching algorithm

    NASA Astrophysics Data System (ADS)

    Yaici, Malika; Khaled, Hayet; Khaled, Zakia; Bentahar, Athmane

    2012-11-01

    The problem dealt in this paper concerns the parallelization of the row-searching algorithm which allows the search for linearly dependant rows on a given matrix and its implementation on MPI (Message Passing Interface) environment. This algorithm is largely used in control theory and more specifically in solving the famous diophantine equation. An introduction to the diophantine equation is presented, then two parallelization approaches of the algorithm are detailed. The first distributes a set of rows on processes (processors) and the second makes a distribution per blocks. The sequential algorithm and its two parallel forms are implemented using MPI routines, then modelled using UML (Unified Modelling Language) and finally evaluated using algorithmic complexity.

  10. Learning factorizations in estimation of distribution algorithms using affinity propagation.

    PubMed

    Santana, Roberto; Larrañaga, Pedro; Lozano, José A

    2010-01-01

    Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of mainly binary optimization problems. In this paper, we introduce the affinity propagation EDA (AffEDA) which learns a marginal product model by clustering a matrix of mutual information learned from the data using a very efficient message-passing algorithm known as affinity propagation. The introduced algorithm is tested on a set of binary and nonbinary decomposable functions and using a hard combinatorial class of problem known as the HP protein model. The results show that the algorithm is a very efficient alternative to other EDAs that use marginal product model factorizations such as the extended compact genetic algorithm (ECGA) and improves the quality of the results achieved by ECGA when the cardinality of the variables is increased.

  11. Passing and Catching in Rugby.

    ERIC Educational Resources Information Center

    Namudu, Mike M.

    This booklet contains the fundamentals for rugby at the primary school level. It deals primarily with passing and catching the ball. It contains instructions on (1) holding the ball for passing, (2) passing the ball to the left--standing, (3) passing the ball to the left--running, (4) making a switch pass, (5) the scrum half's normal pass, (6) the…

  12. Passing and Catching in Rugby.

    ERIC Educational Resources Information Center

    Namudu, Mike M.

    This booklet contains the fundamentals for rugby at the primary school level. It deals primarily with passing and catching the ball. It contains instructions on (1) holding the ball for passing, (2) passing the ball to the left--standing, (3) passing the ball to the left--running, (4) making a switch pass, (5) the scrum half's normal pass, (6) the…

  13. Launch Control System Message Reduction

    NASA Technical Reports Server (NTRS)

    Nguyen, Uyen

    2014-01-01

    System Monitoring and Control (SMC) message browsers receive many messages daily that operators do not need to see. My job is to reduce the number of messages so that warning and emergency messages can be seen easily and therefore, responded to promptly. There are two methods to reduce messages: duplicate and state-based message correlations. With duplicate message correlation, SMC display the message the first time it shows up. The next times it occurs, a duplicate number will count the number of times the message appears. State-based message correlation is a process in which more informative messages acknowledge less useful ones and send them to history. I also work on correcting the severity level and text formats of messages. I follow two SMC message filtering tenets as I'm working on this project. Firstly, before filtering an offending message, a non-conformance (NC) must be created in order to attempt fixing that message through hardware or software. Only after the NC assessment states that it cannot fix an offending message, it can be filtered by SMC. Secondly, per Launch Control System (LCS) Coding Standards, SMC does not send information messages to the active message browser unless it's a response to an operator action.

  14. YAMPA: Yet Another Matching Pursuit Algorithm for compressive sensing

    NASA Astrophysics Data System (ADS)

    Lodhi, Muhammad A.; Voronin, Sergey; Bajwa, Waheed U.

    2016-05-01

    State-of-the-art sparse recovery methods often rely on the restricted isometry property for their theoretical guarantees. However, they cannot explicitly incorporate metrics such as restricted isometry constants within their recovery procedures due to the computational intractability of calculating such metrics. This paper formulates an iterative algorithm, termed yet another matching pursuit algorithm (YAMPA), for recovery of sparse signals from compressive measurements. YAMPA differs from other pursuit algorithms in that: (i) it adapts to the measurement matrix using a threshold that is explicitly dependent on two computable coherence metrics of the matrix, and (ii) it does not require knowledge of the signal sparsity. Performance comparisons of YAMPA against other matching pursuit and approximate message passing algorithms are made for several types of measurement matrices. These results show that while state-of-the-art approximate message passing algorithms outperform other algorithms (including YAMPA) in the case of well-conditioned random matrices, they completely break down in the case of ill-conditioned measurement matrices. On the other hand, YAMPA and comparable pursuit algorithms not only result in reasonable performance for well-conditioned matrices, but their performance also degrades gracefully for ill-conditioned matrices. The paper also shows that YAMPA uniformly outperforms other pursuit algorithms for the case of thresholding parameters chosen in a clairvoyant fashion. Further, when combined with a simple and fast technique for selecting thresholding parameters in the case of ill-conditioned matrices, YAMPA outperforms other pursuit algorithms in the regime of low undersampling, although some of these algorithms can outperform YAMPA in the regime of high undersampling in this setting.

  15. The Research of Message Bus Structure in LAMOST Control System

    NASA Astrophysics Data System (ADS)

    Xu, Ling-Zhe

    2008-09-01

    The LAMOST (Large sky Area Multi-Object fibre Spectroscopic Telescope) has now come to its final completion of R&D stage. Major functions of the telescope have successfully passed serial site tests recently, and various kinds of applications integrated into the automation of the telescope chamber is being under vigorous tests too. The TCS (Telescope Control System) is built on multi-layer distributed network platform with many sub-systems at different levels. How to efficiently process the enormous amount of messages with particular implications running in and out of the TCS is one of the major issues of the TCS software programming. This paper describes the mechanism and methodology of the LAMOST message bus structure. The realisation of message bus structure as a result of years of research and site test is presented in general, and dealing with the message priority and manipulating smallest pieces of message in parallel or in serial sequence are elaborated in particular.

  16. Expedition 34 Thanksgiving Message

    NASA Image and Video Library

    Expedition 34 Commander Kevin Ford shares a Thanksgiving message from the International Space Station. Ford demonstrates how the crew will spend the holiday on orbit and describes the menu he and h...

  17. 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.

  18. 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.

  19. A no-key-exchange secure image sharing scheme based on Shamir's three-pass cryptography protocol and the multiple-parameter fractional Fourier transform.

    PubMed

    Lang, Jun

    2012-01-30

    In this paper, we propose a novel secure image sharing scheme based on Shamir's three-pass protocol and the multiple-parameter fractional Fourier transform (MPFRFT), which can safely exchange information with no advance distribution of either secret keys or public keys between users. The image is encrypted directly by the MPFRFT spectrum without the use of phase keys, and information can be shared by transmitting the encrypted image (or message) three times between users. Numerical simulation results are given to verify the performance of the proposed algorithm.

  20. LBNL SecureMessaging

    SciTech Connect

    Pery, Marcia; Agarwal, Deb

    2003-03-17

    The LBNLSecureMessaging application enables collaboration among colocated or geograhically dispersed users by supporting secure synchronous and asynchronous communication. This application is the graphical user interface client that is meant to be used in conjunction with servers (LBNL's PCCEServer and a customized IRC server) to allow group and one-to-one conversations via text-based instant messaging. Conversations may be private (by invitation only) or public (open to any member of a collaboratory group_ and they may be permanent and on-going or temporary and ad hoc. Users may leave notes for other people who are online or offline. By providing presence and awareness information, collaborators can easily locate each other and rendezvous. Written in Java/Swing, this application is cross-platform. To gain access to functionality, users have to be registered with an authorization server (PCCEServer) that maintains an access control list. Thus a collaboration group is comprised of a set of PCCE-registered users. Registered users can log in via either X.509 certificate or a username and password combination. PKI and SSL are used to authenticate servers and clients and to encrypt messages sent over the network. The LBNLSecureMessaging application offers instant messaging capabilities in a secure environment that provides data integrity, privacyk authorization, and authentication.

  1. 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.

  2. LBNL SecureMessaging

    SciTech Connect

    Pery, Marcia; Agarwal, Deb

    2003-03-17

    The LBNLSecureMessaging application enables collaboration among colocated or geograhically dispersed users by supporting secure synchronous and asynchronous communication. This application is the graphical user interface client that is meant to be used in conjunction with servers (LBNL's PCCEServer and a customized IRC server) to allow group and one-to-one conversations via text-based instant messaging. Conversations may be private (by invitation only) or public (open to any member of a collaboratory group_ and they may be permanent and on-going or temporary and ad hoc. Users may leave notes for other people who are online or offline. By providing presence and awareness information, collaborators can easily locate each other and rendezvous. Written in Java/Swing, this application is cross-platform. To gain access to functionality, users have to be registered with an authorization server (PCCEServer) that maintains an access control list. Thus a collaboration group is comprised of a set of PCCE-registered users. Registered users can log in via either X.509 certificate or a username and password combination. PKI and SSL are used to authenticate servers and clients and to encrypt messages sent over the network. The LBNLSecureMessaging application offers instant messaging capabilities in a secure environment that provides data integrity, privacyk authorization, and authentication.

  3. Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

    NASA Astrophysics Data System (ADS)

    Moryakov, A. V.

    2016-12-01

    An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

  4. Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

    SciTech Connect

    Moryakov, A. V.

    2016-12-15

    An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

  5. 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.

  6. An Examination of Adolescent Recall of Anti-Smoking Messages: Attitudes, Message Type, and Message Perceptions.

    PubMed

    Bigsby, Elisabeth; Monahan, Jennifer L; Ewoldsen, David R

    2017-04-01

    Delayed message recall may be influenced by currently held accessible attitudes, the nature of the message, and message perceptions (perception of bias and message elaboration). This study examined the potential of message perceptions to mediate the influence of valenced attitude accessibility and message type on unaided recall of anti-smoking Public Service Announcements (PSAs). In a field experiment, ninth grade students (N = 244) watched three PSAs and responded to items on laptop computers. Twelve weeks later, follow-up telephone surveys were conducted to assess unaided recall. Both valenced attitude accessibility and message type were associated with message perceptions. However, only perception of message bias partially mediated the relationship between message type and unaided recall.

  7. Making your message competitive

    SciTech Connect

    Burns, D.B.; Ulick, B.D.; Bradford, D.M.

    1994-12-31

    Even in the best of situations, effective communication can be difficult to achieve. For those working in fields that are highly controversial and technical, where an ability to communicate effectively with the general public is fundamental to the success of a project or program, this task can be particularly onerous. This is especially true for communicators working in the nuclear arena, such as the US Department of Energy`s Yucca Mountain Site Characterization Project (YMP). Although these difficulties exist as a part of daily communications, numerous lessons have been learned that may be applicable for others in the field. A variety of factors can influence the effectiveness of communications. These include a message`s relative complexity, its salience, competing messages, verbal and nonverbal cues, and, perhaps most importantly, the role played by the news media. To communicate effectively with one`s audience, it is essential that each of these factors be considered and used to advantage.

  8. EMS -- Error Message Service

    NASA Astrophysics Data System (ADS)

    Rees, P. C. T.; Chipperfield, A. J.; Draper, P. W.

    This document describes the Error Message Service, EMS, and its use in system software. The purpose of EMS is to provide facilities for constructing and storing error messages for future delivery to the user -- usually via the Starlink Error Reporting System, ERR (see SUN/104). EMS can be regarded as a simplified version of ERR without the binding to any software environment (e.g., for message output or access to the parameter and data systems). The routines in this library conform to the error reporting conventions described in SUN/104. A knowledge of these conventions, and of the ADAM system (see SG/4), is assumed in what follows. This document is intended for Starlink systems programmers and can safely be ignored by applications programmers and users.

  9. On "Passing" through Adolescence.

    ERIC Educational Resources Information Center

    Uttermohlen, T. L.

    1997-01-01

    The author, born with a severe visual impairment, addresses the tendency of adolescents with visual impairments to try to hide the disability and "pass" as unimpaired with their peers. It is suggested that these adolescents be helped to find a comfortable balance between taking excessive risks and allowing visual impairment or blindness to be an…

  10. On "Passing" through Adolescence.

    ERIC Educational Resources Information Center

    Uttermohlen, T. L.

    1997-01-01

    The author, born with a severe visual impairment, addresses the tendency of adolescents with visual impairments to try to hide the disability and "pass" as unimpaired with their peers. It is suggested that these adolescents be helped to find a comfortable balance between taking excessive risks and allowing visual impairment or blindness to be an…

  11. Authentication of quantum messages.

    SciTech Connect

    Barnum, Howard; Crépeau, Jean-Claude; Gottesman, D.; Smith, A.; Tapp, Alan

    2001-01-01

    Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical private key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definition of authentication in the quantum setting. Assuming A and B have access to an insecure quantum channel and share a private, classical random key, we provide a non-interactive scheme that both enables A to encrypt and authenticate (with unconditional security) an m qubit message by encoding it into m + s qubits, where the probability decreases exponentially in the security parameter s. The scheme requires a private key of size 2m + O(s). To achieve this, we give a highly efficient protocol for testing the purity of shared EPR pairs. It has long been known that learning information about a general quantum state will necessarily disturb it. We refine this result to show that such a disturbance can be done with few side effects, allowing it to circumvent cryptographic protections. Consequently, any scheme to authenticate quantum messages must also encrypt them. In contrast, no such constraint exists classically: authentication and encryption are independent tasks, and one can authenticate a message while leaving it publicly readable. This reasoning has two important consequences: On one hand, it allows us to give a lower bound of 2m key bits for authenticating m qubits, which makes our protocol asymptotically optimal. On the other hand, we use it to show that digitally signing quantum states is impossible, even with only computational security.

  12. Delivering the Starry Message

    NASA Astrophysics Data System (ADS)

    Krupp, Ed

    2009-05-01

    Although Galileo's telescopic revelations 400 years ago prompted the International Year of Astronomy, Galileo didn't just get a starry message at the instrument's eyepiece. He also sent one. He targeted a narrow audience_astronomers, philosphers, and scholars_with his account of his discoveries, but his report, his telescopes, and his observations became famous. Ordinary people were energized by astronomical discovery, and that continues today. The content of the astronomical messages has evolved, and so have the mechanisms of transmission. Public astronomy now helps sustain support for research, and like Galileo's telescope, it also transforms people personally and society broadly. The process is illustrated with a few highly subjective examples.

  13. 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)…

  14. Concurrent Smalltalk on the Message-Driven Processor

    DTIC Science & Technology

    1991-09-01

    NDPSim -x 2 -y 2 - maize Ox1O00 ::Coamoa:Coamoa.m NewFact.mdp Message-Driven Processor Simulator Version 7.0 Rev B Accompanies MDP Architecture Document...it could peel invocations of recursive functions forever. However, the sin- gle pass of inlining does not mean that functions are only inlined one

  15. President's Message: "Forward"

    ERIC Educational Resources Information Center

    Starkman, Ken

    2006-01-01

    In this message from the ITEA president, he states that it is imperative that ITEA convey a shared mission and philosophy, foster leadership, and grow a large audience of supportive professional members while remaining agile enough to withstand generational and political changes that naturally occur over time. The strategic plan of ITEA focuses on…

  16. Evaluating Personalized Risk Messages.

    ERIC Educational Resources Information Center

    Weinstein, Neil D.; And Others

    1992-01-01

    An experiment with 766 homeowners compared 3 strategies for delivering radon test results to homeowners. Small improvements in consumer satisfaction were found for personalized messages (a telephone call or personal letter) over a form letter. No detectable improvement was found in recall of advice or compliance for any strategy. (SLD)

  17. Message in a Bottle

    ERIC Educational Resources Information Center

    Gallagher, Joy

    2008-01-01

    In this article, the author shares a lesson that uses the Message in a Bottle concept. This lesson combines social studies, language arts, technology, and art, particularly studying and drawing portraits and utilizing values within a drawing. As part of their grade-four art curriculum, students are required to correctly proportion the face and the…

  18. Making health messages interesting.

    PubMed

    Gebreel, A O; Butt, J

    1997-01-01

    In Afghanistan a radio drama serial carrying messages vital to the well-being of the population, backed up by more detailed information in reinforcing radio programmes and a cartoon magazine, is proving effective in increasing people's knowledge of immunization and other subjects.

  19. Research Messages 2014

    ERIC Educational Resources Information Center

    National Centre for Vocational Education Research (NCVER), 2015

    2015-01-01

    "Research Messages 2014" is a collection of summaries of research published by the National Centre for Vocational Education Research (NCVER) in 2014 in the context of changing economic, industrial, social and education conditions, organised under the following broad categories: (1) Productivity: to sustain and build Australia's human…

  20. President's Message: "Forward"

    ERIC Educational Resources Information Center

    Starkman, Ken

    2006-01-01

    In this message from the ITEA president, he states that it is imperative that ITEA convey a shared mission and philosophy, foster leadership, and grow a large audience of supportive professional members while remaining agile enough to withstand generational and political changes that naturally occur over time. The strategic plan of ITEA focuses on…

  1. Grounding in Instant Messaging

    ERIC Educational Resources Information Center

    Fox Tree, Jean E.; Mayer, Sarah A.; Betts, Teresa E.

    2011-01-01

    In two experiments, we investigated predictions of the "collaborative theory of language use" (Clark, 1996) as applied to instant messaging (IM). This theory describes how the presence and absence of different grounding constraints causes people to interact differently across different communicative media (Clark & Brennan, 1991). In Study 1, we…

  2. Editor's message: Student involvement

    Treesearch

    Bill Block

    2012-01-01

    In the initial Editor's Message of this volume, I stated my intent to involve more students in the publication process. A number of people commented on it being a good idea, but only a couple have followed up. One was Paul Krausman, President of The Wildlife Society. We matched graduate students from the University of Montana wildlife program with manuscripts...

  3. Research Messages 2011

    ERIC Educational Resources Information Center

    National Centre for Vocational Education Research (NCVER), 2012

    2012-01-01

    "Research messages 2011" is a collection of summaries of research projects published by National Centre for Vocational Education Research (NCVER) in 2011. The publication also has an overview essay that captures the themes and highlights from the research for the year, including: (1) the initial education and training of young people and…

  4. Listening and Message Interpretation

    ERIC Educational Resources Information Center

    Edwards, Renee

    2011-01-01

    Message interpretation, the notion that individuals assign meaning to stimuli, is related to listening presage, listening process, and listening product. As a central notion of communication, meaning includes (a) denotation and connotation, and (b) content and relational meanings, which can vary in ambiguity and vagueness. Past research on message…

  5. Evaluating Personalized Risk Messages.

    ERIC Educational Resources Information Center

    Weinstein, Neil D.; And Others

    1992-01-01

    An experiment with 766 homeowners compared 3 strategies for delivering radon test results to homeowners. Small improvements in consumer satisfaction were found for personalized messages (a telephone call or personal letter) over a form letter. No detectable improvement was found in recall of advice or compliance for any strategy. (SLD)

  6. Research Messages 2010

    ERIC Educational Resources Information Center

    National Centre for Vocational Education Research (NCVER), 2011

    2011-01-01

    Research messages 2010 is a collection of summaries of research projects published by the National Centre for Vocational Education Research (NCVER). The summaries are clustered under five broad themes used by NCVER to organise its research and analysis: Industry and employers; Students and individuals; Teaching and learning: VET system; and VET in…

  7. Grounding in Instant Messaging

    ERIC Educational Resources Information Center

    Fox Tree, Jean E.; Mayer, Sarah A.; Betts, Teresa E.

    2011-01-01

    In two experiments, we investigated predictions of the "collaborative theory of language use" (Clark, 1996) as applied to instant messaging (IM). This theory describes how the presence and absence of different grounding constraints causes people to interact differently across different communicative media (Clark & Brennan, 1991). In Study 1, we…

  8. Are Instant Messages Speech?

    NASA Astrophysics Data System (ADS)

    Baron, Naomi S.

    Instant messaging (IM) is commonly viewed as a “spoken” medium, in light of its reputation for informality, non-standard spelling and punctuation, and use of lexical shortenings and emoticons. However, the actual nature of IM is an empirical issue that bears linguistic analysis.

  9. Understanding Telex Messages.

    ERIC Educational Resources Information Center

    Kitto, Michael

    1984-01-01

    Examines the problems of writing grammatical rules for the writing of telexes and makes some suggestions as to how to teach comprehension of telex messages. Emphasizes the inconsistency in style, length, and form of telexes, and the impact this has had on international correspondence, which involves many nonnative speakers of English. (SL)

  10. Research Messages 2016

    ERIC Educational Resources Information Center

    National Centre for Vocational Education Research (NCVER), 2017

    2017-01-01

    The "Research messages" annual series presents a summary of the research-focused reports produced by the National Centre for Vocational Education Research (NCVER) each year. In addition to presenting the research reports published by NCVER during 2016, NCVER has expanded this edition to include other relevant and informative resources,…

  11. The Prodiguer Messaging Platform

    NASA Astrophysics Data System (ADS)

    Denvil, S.; Greenslade, M. A.; Carenton, N.; Levavasseur, G.; Raciazek, J.

    2015-12-01

    CONVERGENCE is a French multi-partner national project designed to gather HPC and informatics expertise to innovate in the context of running French global climate models with differing grids and at differing resolutions. Efficient and reliable execution of these models and the management and dissemination of model output are some of the complexities that CONVERGENCE aims to resolve.At any one moment in time, researchers affiliated with the Institut Pierre Simon Laplace (IPSL) climate modeling group, are running hundreds of global climate simulations. These simulations execute upon a heterogeneous set of French High Performance Computing (HPC) environments. The IPSL's simulation execution runtime libIGCM (library for IPSL Global Climate Modeling group) has recently been enhanced so as to support hitherto impossible realtime use cases such as simulation monitoring, data publication, metrics collection, simulation control, visualizations … etc. At the core of this enhancement is Prodiguer: an AMQP (Advanced Message Queue Protocol) based event driven asynchronous distributed messaging platform. libIGCM now dispatches copious amounts of information, in the form of messages, to the platform for remote processing by Prodiguer software agents at IPSL servers in Paris. Such processing takes several forms: Persisting message content to database(s); Launching rollback jobs upon simulation failure; Notifying downstream applications; Automation of visualization pipelines; We will describe and/or demonstrate the platform's: Technical implementation; Inherent ease of scalability; Inherent adaptiveness in respect to supervising simulations; Web portal receiving simulation notifications in realtime.

  12. Multi-pass microscopy

    PubMed Central

    Juffmann, Thomas; Klopfer, Brannon B.; Frankort, Timmo L.I.; Haslinger, Philipp; Kasevich, Mark A.

    2016-01-01

    Microscopy of biological specimens often requires low light levels to avoid damage. This yields images impaired by shot noise. An improved measurement accuracy at the Heisenberg limit can be achieved exploiting quantum correlations. If sample damage is the limiting resource, an equivalent limit can be reached by passing photons through a specimen multiple times sequentially. Here we use self-imaging cavities and employ a temporal post-selection scheme to present full-field multi-pass polarization and transmission micrographs with variance reductions of 4.4±0.8 dB (11.6±0.8 dB in a lossless setup) and 4.8±0.8 dB, respectively, compared with the single-pass shot-noise limit. If the accuracy is limited by the number of detected probe particles, our measurements show a variance reduction of 25.9±0.9 dB. The contrast enhancement capabilities in imaging and in diffraction studies are demonstrated with nanostructured samples and with embryonic kidney 293T cells. This approach to Heisenberg-limited microscopy does not rely on quantum state engineering. PMID:27670525

  13. Multi-pass microscopy

    NASA Astrophysics Data System (ADS)

    Juffmann, Thomas; Klopfer, Brannon B.; Frankort, Timmo L. I.; Haslinger, Philipp; Kasevich, Mark A.

    2016-09-01

    Microscopy of biological specimens often requires low light levels to avoid damage. This yields images impaired by shot noise. An improved measurement accuracy at the Heisenberg limit can be achieved exploiting quantum correlations. If sample damage is the limiting resource, an equivalent limit can be reached by passing photons through a specimen multiple times sequentially. Here we use self-imaging cavities and employ a temporal post-selection scheme to present full-field multi-pass polarization and transmission micrographs with variance reductions of 4.4+/-0.8 dB (11.6+/-0.8 dB in a lossless setup) and 4.8+/-0.8 dB, respectively, compared with the single-pass shot-noise limit. If the accuracy is limited by the number of detected probe particles, our measurements show a variance reduction of 25.9+/-0.9 dB. The contrast enhancement capabilities in imaging and in diffraction studies are demonstrated with nanostructured samples and with embryonic kidney 293T cells. This approach to Heisenberg-limited microscopy does not rely on quantum state engineering.

  14. A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

    SciTech Connect

    Gamarnik, David; Misra, Sidhant

    2016-06-06

    Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performs significantly better.

  15. 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.

  16. Sequoia Messaging Rate Benchmark

    SciTech Connect

    Friedley, Andrew

    2008-01-22

    The purpose of this benchmark is to measure the maximal message rate of a single compute node. The first num_cores ranks are expected to reside on the 'core' compute node for which message rate is being tested. After that, the next num_nbors ranks are neighbors for the first core rank, the next set of num_nbors ranks are neighbors for the second core rank, and so on. For example, testing an 8-core node (num_cores = 8) with 4 neighbors (num_nbors = 4) requires 8 + 8 * 4 - 40 ranks. The first 8 of those 40 ranks are expected to be on the 'core' node being benchmarked, while the rest of the ranks are on separate nodes.

  17. Extracting hidden messages in steganographic images

    DOE PAGES

    Quach, Tu-Thach

    2014-07-17

    The eventual goal of steganalytic forensic is to extract the hidden messages embedded in steganographic images. A promising technique that addresses this problem partially is steganographic payload location, an approach to reveal the message bits, but not their logical order. It works by finding modified pixels, or residuals, as an artifact of the embedding process. This technique is successful against simple least-significant bit steganography and group-parity steganography. The actual messages, however, remain hidden as no logical order can be inferred from the located payload. This paper establishes an important result addressing this shortcoming: we show that the expected mean residualsmore » contain enough information to logically order the located payload provided that the size of the payload in each stego image is not fixed. The located payload can be ordered as prescribed by the mean residuals to obtain the hidden messages without knowledge of the embedding key, exposing the vulnerability of these embedding algorithms. We provide experimental results to support our analysis.« less

  18. Extracting hidden messages in steganographic images

    SciTech Connect

    Quach, Tu-Thach

    2014-07-17

    The eventual goal of steganalytic forensic is to extract the hidden messages embedded in steganographic images. A promising technique that addresses this problem partially is steganographic payload location, an approach to reveal the message bits, but not their logical order. It works by finding modified pixels, or residuals, as an artifact of the embedding process. This technique is successful against simple least-significant bit steganography and group-parity steganography. The actual messages, however, remain hidden as no logical order can be inferred from the located payload. This paper establishes an important result addressing this shortcoming: we show that the expected mean residuals contain enough information to logically order the located payload provided that the size of the payload in each stego image is not fixed. The located payload can be ordered as prescribed by the mean residuals to obtain the hidden messages without knowledge of the embedding key, exposing the vulnerability of these embedding algorithms. We provide experimental results to support our analysis.

  19. An enhanced simulated annealing routing algorithm for semi-diagonal torus network

    NASA Astrophysics Data System (ADS)

    Adzhar, Noraziah; Salleh, Shaharuddin

    2017-09-01

    Multiprocessor is another great technology that helps in advancing human civilization due to high demands for solving complex problems. A multiprocessing system can have a lot of replicated processor-memory pairs (henceforth regard as net) or also called as processing nodes. Each of these nodes is connected to each other through interconnection networks and passes message using a standard message passing mechanism. In this paper, we present a routing algorithm based on enhanced simulated annealing technique to provide the connection between nodes in a semi-diagonal torus (SD-Torus) network. This network is both symmetric and regular; thus, make it very beneficial in the implementation process. The main objective is to maximize the number of established connection between nodes in this SD-Torus network. In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra’s method. While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. Through simulation program, our proposed algorithm succeeded in performing complete routing up to 81 nodes with 40 nets in 9×9 SD-Torus network size.

  20. A fast distributed algorithm for mining association rules

    SciTech Connect

    Cheung, D.W.; Fu, A.W.; Ng, V.T.

    1996-12-31

    With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems, and the easy partition and distribution of a centralized database, it is important to investigate efficient methods for distributed mining of association rules. This study discloses some interesting relationships between locally large and globally large itemsets and proposes an interesting distributed association rule mining algorithm, FDM (Fast Distributed Mining of association rules), which generates a small number of candidate sets and substantially reduces the number of messages to be passed at mining association rules. Our performance study shows that FDM has a superior performance over the direct application of a typical sequential algorithm Further performance enhancement leads to a few variations of the algorithm.

  1. Khyber Pass, Afghanistan-Pakistan

    NASA Image and Video Library

    2010-11-08

    The ASTER instrument onboard NASA Terra spacecraft imaged the Khyber Pass, a mountain pass that links Afghanistan and Pakistan. Throughout its history it has been an important trade route between Central Asia and South Asia.

  2. Congress passes space year

    NASA Astrophysics Data System (ADS)

    The year 1992 will mark the 500th anniversary of Christopher Columbus' arrival in America and the 35th anniversary of both the International Geophysical Year and the launch of Sputnik. The U.S. Senate passed a joint resolution (S.J.Res. 177) on November 21 recommending that the President endorse an International Space Year (ISY) in 1992. A similar resolution introduced in the House of Representatives was incorporated into the conference report (House Report 99-379) accompanying the authorization bill for the National Aeronautics and Space Administration (NASA) and approved by both houses, also on November 21. As Eos went to press, the NASA authorization bill (H.R. 1714) awaited President Ronald Reagan's signature.

  3. Secret Message Science Goggles

    ERIC Educational Resources Information Center

    DeVita, Christina; Ruppert, Sarah

    2007-01-01

    Light is radiation in wavelengths composed of many colors that are visible to the eyes. These wavelengths can be separated. One way to separate colors is with a filter. Filters keep certain wavelengths out and allow other wavelengths to pass through. In this article, the authors discuss an activity to provide students the opportunity to build a…

  4. Secret Message Science Goggles

    ERIC Educational Resources Information Center

    DeVita, Christina; Ruppert, Sarah

    2007-01-01

    Light is radiation in wavelengths composed of many colors that are visible to the eyes. These wavelengths can be separated. One way to separate colors is with a filter. Filters keep certain wavelengths out and allow other wavelengths to pass through. In this article, the authors discuss an activity to provide students the opportunity to build a…

  5. Electronic Message Preservation Act

    THOMAS, 111th Congress

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

    2009-03-09

    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:

  6. 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:

  7. Electronic Message Preservation Act

    THOMAS, 111th Congress

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

    2009-03-09

    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:

  8. Message Technology Research and Development

    DTIC Science & Technology

    1976-08-01

    for immediate sending or for further editing. New automatic HERMES-crcated fields are generated corresponding to the new sender and date. We also...are not copied, so that the new outgoing message receives a new SENDER field, a new DATE, and a new MESSAGE-ID. 2. Three new message-fields were...switches were installed a) STARTWITHINBOX (Ask-Yes-No) controls whether KERMES Gets the user’s Inbox , MESSAGE.TXT;1, when the user enters the system

  9. A Perijove Pass

    NASA Image and Video Library

    2017-05-25

    This sequence of enhanced-color images shows how quickly the viewing geometry changes for NASA's Juno spacecraft as it swoops by Jupiter. The images were obtained by JunoCam. Once every 53 days the Juno spacecraft swings close to Jupiter, speeding over its clouds. In just two hours, the spacecraft travels from a perch over Jupiter's north pole through its closest approach (perijove), then passes over the south pole on its way back out. This sequence shows 14 enhanced-color images. The first image on the left shows the entire half-lit globe of Jupiter, with the north pole approximately in the center. As the spacecraft gets closer to Jupiter, the horizon moves in and the range of visible latitudes shrinks. The third and fourth images in this sequence show the north polar region rotating away from our view while a band of wavy clouds at northern mid-latitudes comes into view. By the fifth image of the sequence the band of turbulent clouds is nicely centered in the image. The seventh and eighth images were taken just before the spacecraft was at its closest point to Jupiter, near Jupiter's equator. Even though these two pictures were taken just four minutes apart, the view is changing quickly. As the spacecraft crossed into the southern hemisphere, the bright "south tropical zone" dominates the ninth, 10th and 11th images. The white ovals in a feature nicknamed Jupiter's "String of Pearls" are visible in the 12th and 13th images. In the 14th image Juno views Jupiter's south poles. https://photojournal.jpl.nasa.gov/catalog/PIA21645

  10. [Message from Lyme].

    PubMed

    Wahlberg, P

    1993-01-01

    The background to the discovery of Lyme disease teaches a salutary lesson. The symptoms and signs of this disease had been observed by doctors for a century, particularly in the Scandinavian countries, without anybody being able to draw the right conclusions. The first patients were identified in the USA by their relatives or by themselves. Recognition of their plight by the medical profession was chiefly due to the patients' tenacity. We must remember to pay attention to what patients tell us; they may often be right, even when they seem to be wrong. Where fact and theory are incompatible, it is theory, not fact, that needs to be amended. In all likelihood, we all from time to time observe disorders in our patients that are inconsistent with established scientific models, but which we nevertheless attempt to squeeze into these models. Such an approach is not uncommon in the history of medicine. The message from Lyme calls for humility and reflexion.

  11. A parallel systematic-Monte Carlo algorithm for exploring conformational space.

    PubMed

    Perez-Riverol, Yasset; Vera, Roberto; Mazola, Yuliet; Musacchio, Alexis

    2012-01-01

    Computational algorithms to explore the conformational space of small molecules are complex and computer demand field in chemoinformatics. In this paper a hybrid algorithm to explore the conformational space of organic molecules is presented. This hybrid algorithm is based in a systematic search approach combined with a Monte Carlo based method in order to obtain an ensemble of low-energy conformations simulating the flexibility of small chemical compounds. The Monte Carlo method uses the Metropolis criterion to accept or reject a conformation through an in-house implementation of the MMFF94s force field to calculate the conformational energy. The parallel design of this algorithm, based on the message passing interface (MPI) paradigm, was implemented. The results showed a performance increase in the terms of speed and efficiency.

  12. Improving scalability with loop transformations and message aggregation in parallel object-oriented frameworks for scientific computing

    SciTech Connect

    Bassetti, F.; Davis, K.; Quinlan, D.

    1998-09-01

    Application codes reliably achieve performance far less than the advertised capabilities of existing architectures, and this problem is worsening with increasingly-parallel machines. For large-scale numerical applications, stencil operations often impose the great part of the computational cost, and the primary sources of inefficiency are the costs of message passing and poor cache utilization. This paper proposes and demonstrates optimizations for stencil and stencil-like computations for both serial and parallel environments that ameliorate these sources of inefficiency. Achieving scalability, they believe, requires both algorithm design and compile-time support. The optimizations they present are automatable because the stencil-like computations are implemented at a high level of abstraction using object-oriented parallel array class libraries. These optimizations, which are beyond the capabilities of today compilers, may be performed automatically by a preprocessor such as the one they are currently developing.

  13. Spectral element methods: Algorithms and architectures

    NASA Technical Reports Server (NTRS)

    Fischer, Paul; Ronquist, Einar M.; Dewey, Daniel; Patera, Anthony T.

    1988-01-01

    Spectral element methods are high-order weighted residual techniques for partial differential equations that combine the geometric flexibility of finite element methods with the rapid convergence of spectral techniques. Spectral element methods are described for the simulation of incompressible fluid flows, with special emphasis on implementation of spectral element techniques on medium-grained parallel processors. Two parallel architectures are considered: the first, a commercially available message-passing hypercube system; the second, a developmental reconfigurable architecture based on Geometry-Defining Processors. High parallel efficiency is obtained in hypercube spectral element computations, indicating that load balancing and communication issues can be successfully addressed by a high-order technique/medium-grained processor algorithm-architecture coupling.

  14. Multiple pass laser amplifier system

    DOEpatents

    Brueckner, Keith A.; Jorna, Siebe; Moncur, N. Kent

    1977-01-01

    A laser amplification method for increasing the energy extraction efficiency from laser amplifiers while reducing the energy flux that passes through a flux limited system which includes apparatus for decomposing a linearly polarized light beam into multiple components, passing the components through an amplifier in delayed time sequence and recombining the amplified components into an in phase linearly polarized beam.

  15. Streamlined one-pass modelling

    SciTech Connect

    Jones, J.H.; Harne, R.L.; Firth, K.J.; Meyer, G.A.

    1986-01-01

    Streamlined one-pass models provide an alternative to the standard type of one-pass models for departure from nucleate boiling ratio (DNBR) studies, which require a large number of computer simulations. The standard one-pass models simulate the limiting subchannel (subchannel in which minimum DNBR occurs), a ring of subchannels around the limiting subchannel, the remainder of the limiting bundle, and the remainder of the core. Typically, these standard models use from 8 to 12 channels and approx.20 cross-flow gaps. Babcock and Wilcox (B and W) has developed streamlined one-pass models that require approximately one-half the number of channels and approx.20% of the computer resources as the standard one-pass models. These streamlined models are applicable in one-pass analysis codes such as the B and W code LYNXT and the Electric Power Research Institute VIPRE code. Streamlined one-pass models are particularly suited to extensive studies wherein computer cost and turnaround are critical, without sacrificing DNBR accuracy. Examples of such studies are reactor protection operating limit determination, limiting transient selection, and scoping studies. Moreover, streamlined one-pass models make it possible to perform DNBR studies on personal computers (PCs) using PC-adapted codes such as COBRAPC.

  16. A parallel adaptive mesh refinement algorithm

    NASA Technical Reports Server (NTRS)

    Quirk, James J.; Hanebutte, Ulf R.

    1993-01-01

    Over recent years, Adaptive Mesh Refinement (AMR) algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block-structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developer's viewpoint, this class of scheme is quite involved; these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirk's AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm.

  17. Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

    NASA Technical Reports Server (NTRS)

    Banerjee, Prithviraj; Jones, Mark Howard; Sargent, Jeff S.

    1990-01-01

    Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

  18. Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

    NASA Technical Reports Server (NTRS)

    Banerjee, Prithviraj; Jones, Mark Howard; Sargent, Jeff S.

    1990-01-01

    Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

  19. The psychology of nutrition messages.

    PubMed

    Schofield, Heather; Mullainathan, Sendhil

    2008-01-01

    The purpose of this paper is to explore consumer thinking about nutrition decisions and how firms can use consumers' awareness of the links between nutrients and health generated by public health messages to market products, including ones, which have little nutritional value. We approach this issue by tracking the development of public health messages based on scientific research, dissemination of those messages in the popular press, and use of nutrition claims in food advertisements to assess whether firms are timing the use of nutrition claims to take advantage of heuristic-based decision-making. Our findings suggest that the timing of the development of nutrition information, its dissemination in the press, and use in advertising accords well with a heuristic processing model in which firms take advantage of associations between nutrient information and health in their advertisements. However, the demonstrated relationships may not be causal. Further research will be needed to provide stronger and more comprehensive evidence regarding the proposed message hijacking process. If the message hijacking framework is borne out: (1) simple overall health rating scales could significantly improve consumer decision-making, (2) the impact of misleading advertisements could be mitigated by encouraging a multidimensional view of nutrition, and (3) more intensive regulation of product labeling could limit the impact of hijacked messages. Overall, this paper considers a novel hypothesis about the impact of public health messages on nutrition and health.

  20. Distributed-Memory Computing With the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA)

    NASA Technical Reports Server (NTRS)

    Riley, Christopher J.; Cheatwood, F. McNeil

    1997-01-01

    The Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA), a Navier-Stokes solver, has been modified for use in a parallel, distributed-memory environment using the Message-Passing Interface (MPI) standard. A standard domain decomposition strategy is used in which the computational domain is divided into subdomains with each subdomain assigned to a processor. Performance is examined on dedicated parallel machines and a network of desktop workstations. The effect of domain decomposition and frequency of boundary updates on performance and convergence is also examined for several realistic configurations and conditions typical of large-scale computational fluid dynamic analysis.

  1. Model of stacked long Josephson junctions: Parallel algorithm and numerical results in case of weak coupling

    NASA Astrophysics Data System (ADS)

    Zemlyanaya, E. V.; Bashashin, M. V.; Rahmonov, I. R.; Shukrinov, Yu. M.; Atanasova, P. Kh.; Volokhova, A. V.

    2016-10-01

    We consider a model of system of long Josephson junctions (LJJ) with inductive and capacitive coupling. Corresponding system of nonlinear partial differential equations is solved by means of the standard three-point finite-difference approximation in the spatial coordinate and utilizing the Runge-Kutta method for solution of the resulting Cauchy problem. A parallel algorithm is developed and implemented on a basis of the MPI (Message Passing Interface) technology. Effect of the coupling between the JJs on the properties of LJJ system is demonstrated. Numerical results are discussed from the viewpoint of effectiveness of parallel implementation.

  2. Skil: An imperative language with algorithmic skeletons for efficient distributed programming

    SciTech Connect

    Botorog, G.H.; Kuchen, H.

    1996-12-31

    In this paper we present Skil, an imperative language enhanced with higher-order functions and currying, as well as with a polymorphic type system. The high level of Skil allows the integration of algorithmic skeletons, i.e. of higher-order functions representing parallel computation patterns. At the same time, the language can be efficiently implemented. After describing a series of skeletons which work with distributed arrays, we give two examples of parallel programs implemented on the basis of skeletons, namely shortest paths in graphs and Gaussian elimination. Runtime measurements show that we approach the efficiency of message-passing C up to a factor between 1 and 2.5.

  3. Priority nutrition messages.

    PubMed

    1991-01-01

    The Philippine Food and Nutrition Program deliver priority short, simple, clear, and action filled nutrition messages in different languages and dialects to different audiences. Its 1st priority task is to promote breast feeding. It informs mothers that breast milk is the most nutritious food for infants and that it protects them from infectious diseases. The program also encourages breast feeding as long as possible. If mothers cannot breast feed, they should talk to an infant nutrition expert to help them choose the best formula and learn about proper preparation. A 4-6 month infant needs to begin eating small amounts of semisolid nutritious foods. Moreover these foods must include body building foods, such as meat and eggs, and energy providing foods, such as corn and rice. Mothers must 1st attend to food needs of infants and preschoolers since they are more likely to suffer malnutrition than older children and adults. This is especially important when they suffer from an infection. Specifically, the very young need a variety of foods each day including the vitamin and mineral rich vegetables and fruits. In fact, families should grow their own fruits and vegetables to ensure an adequate supply. Hands must be cleaned with soap and water after defecation and before preparing foods. Mothers should add fats and oils when preparing foods because they provide concentrated energy, fatty acids, and fat soluble vitamins. Pregnant mothers must consume increased amounts of fish, beans, and other body building foods as well as regulating foods (vegetables and fruits). Mothers must also space births. They should weigh children each month to monitor nutritional levels. Moreover they must pay attention to signs indicating inadequate and insufficient food intake e.g., underweight and night blindness.

  4. Decoding a Geological Message

    NASA Image and Video Library

    2017-06-14

    A close-up image from NASA's Mars Reconnaissance Orbiter of a recent 150-meter diameter impact crater near Amazonis Mensa and Medusae Fossae is another great example of geologic complexity of Mars. The spider web-like texture of this crater is intriguing. But what does it mean? On Earth, we have many geologic mechanisms that embrace the surface of the planet in an almost constant state of metamorphosis. Although Mars is not nearly as geologically active as Earth, it is still a host to many processes that shape its surface even today (e.g., aeolian modification, periglacial processes, recent impacts, etc.). The appearance of the ejecta of this crater is likely a combination of both the characteristics of the target material it was deposited on, and processes that modified and degraded it over time. When we look to other images in this region we find a similar texture. This texture is referred to as “yardangs” by scientists who study wind erosion. Yardangs are streamlined ridge-and-trough patterns formed by the erosion of wind dominating from a specific direction; in this particular case, from the southeast to the northwest. The specific direction of the winds is supported by regional context images that show many craters in the region have wind streak "tails" that points to the northwest. Craters of this size have been observed to form recently on Mars, so the fact that this crater is modified speaks volumes, and gives us a chance to decode some geological messages from Mars. https://photojournal.jpl.nasa.gov/catalog/PIA21759

  5. Expedition 32 Video Message Recording

    NASA Image and Video Library

    2012-07-25

    ISS032-E-009061 (25 July 2012) --- NASA astronauts Joe Acaba and Sunita Williams, both Expedition 32 flight engineers, perform video message recording in the Destiny laboratory of the International Space Station.

  6. Broadcasting a message in a parallel computer

    DOEpatents

    Archer, Charles J; Faraj, Ahmad A

    2013-04-16

    Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

  7. Broadcasting a message in a parallel computer

    DOEpatents

    Archer, Charles J; Faraj, Daniel A

    2014-11-18

    Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

  8. Military Message Experiment. Volume II.

    DTIC Science & Technology

    1982-04-01

    elements of the Department of Defense. This resulted in a memorandum from the Director, Telecomunications and Comand and Control, OSD, in June 1975...1978 to April 1979 and provides a discussion of the telecomunications inter- face aspects of the experiment. This Final Report covers the period of...arise in the telecomunication system which require A retransmission of an outgoing message. A "service" message may be created within the

  9. Text messaging during simulated driving.

    PubMed

    Drews, Frank A; Yazdani, Hina; Godfrey, Celeste N; Cooper, Joel M; Strayer, David L

    2009-10-01

    This research aims to identify the impact of text messaging on simulated driving performance. In the past decade, a number of on-road, epidemiological, and simulator-based studies reported the negative impact of talking on a cell phone on driving behavior. However, the impact of text messaging on simulated driving performance is still not fully understood. Forty participants engaged in both a single task (driving) and a dual task (driving and text messaging) in a high-fidelity driving simulator. Analysis of driving performance revealed that participants in the dual-task condition responded more slowly to the onset of braking lights and showed impairments in forward and lateral control compared with a driving-only condition. Moreover, text-messaging drivers were involved in more crashes than drivers not engaged in text messaging. Text messaging while driving has a negative impact on simulated driving performance. This negative impact appears to exceed the impact of conversing on a cell phone while driving. The results increase our understanding of driver distraction and have potential implications for public safety and device development.

  10. Fast parallel algorithms for short-range molecular dynamics

    SciTech Connect

    Plimpton, S.

    1993-05-01

    Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a subset of atoms; the second assigns each a subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently -- those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 10,000,000 atoms on three parallel supercomputers, the nCUBE 2, Intel iPSC/860, and Intel Delta. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and the Intel Delta performs about 30 times faster than a single Y-MP processor and 12 times faster than a single C90 processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

  11. DoD Message Protocol Report. Volume II. Message Transfer Protocol Requirements Analysis.

    DTIC Science & Technology

    1981-12-15

    transmission instructions. This assurance can, in principle, be provided by either the message service (where a message is prepared) or by the message...transfer protocol. This document does not assume it is always practical for a message service to assure message correctness and so prescribes... assure service and speed to urgent messages. The protocol must also ensure aginst unauthorized access to high precedence service . When a message

  12. Data communications for a collective operation in a parallel active messaging interface of a parallel computer

    DOEpatents

    Faraj, Daniel A.

    2015-11-19

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks, a data communications algorithm in dependence upon the constructed bit mask; and executing the collective instruction, transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  13. Data communications for a collective operation in a parallel active messaging interface of a parallel computer

    DOEpatents

    Faraj, Daniel A

    2013-07-16

    Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks, a data communications algorithm in dependence upon the constructed bit mask; and executing the collective instruction, transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

  14. Simultaneous message framing and error detection

    NASA Technical Reports Server (NTRS)

    Frey, A. H., Jr.

    1968-01-01

    Circuitry simultaneously inserts message framing information and detects noise errors in binary code data transmissions. Separate message groups are framed without requiring both framing bits and error-checking bits, and predetermined message sequence are separated from other message sequences without being hampered by intervening noise.

  15. Boosting Achievement with Messages that Motivate

    ERIC Educational Resources Information Center

    Dweck, Carol S.

    2007-01-01

    Almost everything educators say to their students sends a message. Some messages enhance students' motivation, but other messages undermine it. What should teachers say to students to send messages that motivate? In a survey given to parents, over 80% of them thought that it was necessary to praise their children's intelligence in order to give…

  16. Using Text Messages to Communicate with Patrons

    ERIC Educational Resources Information Center

    Konshak, Peter

    2009-01-01

    Text messaging is an ideal communications method for libraries, which often want to send short, concise messages to their patrons near and far. Uses for text messaging in libraries include reminders about items' due dates, hold pickup notices, program reminders, and even short messages of content. Some libraries are already using text messaging…

  17. 47 CFR 10.420 - Message elements.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 47 Telecommunication 1 2010-10-01 2010-10-01 false Message elements. 10.420 Section 10.420 Telecommunication FEDERAL COMMUNICATIONS COMMISSION GENERAL COMMERCIAL MOBILE ALERT SYSTEM Alert Message Requirements § 10.420 Message elements. A CMAS Alert Message processed by a Participating CMS Provider shall...

  18. Mission Services Evolution Center Message Bus

    NASA Technical Reports Server (NTRS)

    Mayorga, Arturo; Bristow, John O.; Butschky, Mike

    2011-01-01

    The Goddard Mission Services Evolution Center (GMSEC) Message Bus is a robust, lightweight, fault-tolerant middleware implementation that supports all messaging capabilities of the GMSEC API. This architecture is a distributed software system that routes messages based on message subject names and knowledge of the locations in the network of the interested software components.

  19. Performance analysis of wavefront algorithms on very-large scale distributed systems

    SciTech Connect

    Hoisie, A.; Lubeck, O.; Wasserman, H.

    1999-04-01

    The authors present a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message passing environment. The model combines the separate contributions of computation and communication wavefronts. They validate the model on three important supercomputer systems, on up to 500 processors. They use data from a deterministic particle transport application taken from the ASCI workload, although the model is general to any wavefront algorithm implemented on a 2-D processor domain. They also use the validated model to make estimates of performance and scalability of wavefront algorithms on 100-TFLOPS computer systems expected to be in existence within the next decade as part of the ASCI program and elsewhere. On such machines the analysis shows that, contrary to conventional wisdom, interprocessor communication performance is not the bottleneck. Single-node efficiency is the dominant factor.

  20. Evaluation of a new parallel numerical parameter optimization algorithm for a dynamical system

    NASA Astrophysics Data System (ADS)

    Duran, Ahmet; Tuncel, Mehmet

    2016-10-01

    It is important to have a scalable parallel numerical parameter optimization algorithm for a dynamical system used in financial applications where time limitation is crucial. We use Message Passing Interface parallel programming and present such a new parallel algorithm for parameter estimation. For example, we apply the algorithm to the asset flow differential equations that have been developed and analyzed since 1989 (see [3-6] and references contained therein). We achieved speed-up for some time series to run up to 512 cores (see [10]). Unlike [10], we consider more extensive financial market situations, for example, in presence of low volatility, high volatility and stock market price at a discount/premium to its net asset value with varying magnitude, in this work. Moreover, we evaluated the convergence of the model parameter vector, the nonlinear least squares error and maximum improvement factor to quantify the success of the optimization process depending on the number of initial parameter vectors.

  1. Parallel OSEM Reconstruction Algorithm for Fully 3-D SPECT on a Beowulf Cluster.

    PubMed

    Rong, Zhou; Tianyu, Ma; Yongjie, Jin

    2005-01-01

    In order to improve the computation speed of ordered subset expectation maximization (OSEM) algorithm for fully 3-D single photon emission computed tomography (SPECT) reconstruction, an experimental beowulf-type cluster was built and several parallel reconstruction schemes were described. We implemented a single-program-multiple-data (SPMD) parallel 3-D OSEM reconstruction algorithm based on message passing interface (MPI) and tested it with combinations of different number of calculating processors and different size of voxel grid in reconstruction (64×64×64 and 128×128×128). Performance of parallelization was evaluated in terms of the speedup factor and parallel efficiency. This parallel implementation methodology is expected to be helpful to make fully 3-D OSEM algorithms more feasible in clinical SPECT studies.

  2. MessageSpace: a messaging system for health research

    NASA Astrophysics Data System (ADS)

    Escobar, Rodrigo D.; Akopian, David; Parra-Medina, Deborah; Esparza, Laura

    2013-03-01

    Mobile Health (mHealth) has emerged as a promising direction for delivery of healthcare services via mobile communication devices such as cell phones. Examples include texting-based interventions for chronic disease monitoring, diabetes management, control of hypertension, smoking cessation, monitoring medication adherence, appointment keeping and medical test result delivery; as well as improving patient-provider communication, health information communication, data collection and access to health records. While existing messaging systems very well support bulk messaging and some polling applications, they are not designed for data collection and processing of health research oriented studies. For that reason known studies based on text-messaging campaigns have been constrained in participant numbers. In order to empower healthcare promotion and education research, this paper presents a system dedicated for healthcare research. It is designed for convenient communication with various study groups, feedback collection and automated processing.

  3. Reactions to threatening health messages

    PubMed Central

    2012-01-01

    Background Threatening health messages that focus on severity are popular, but frequently have no effect or even a counterproductive effect on behavior change. This paradox (i.e. wide application despite low effectiveness) may be partly explained by the intuitive appeal of threatening communication: it may be hard to predict the defensive reactions occurring in response to fear appeals. We examine this hypothesis by using two studies by Brown and colleagues, which provide evidence that threatening health messages in the form of distressing imagery in anti-smoking and anti-alcohol campaigns cause defensive reactions. Methods We simulated both Brown et al. experiments, asking participants to estimate the reactions of the original study subjects to the threatening health information (n = 93). Afterwards, we presented the actual original study outcomes. One week later, we assessed whether this knowledge of the actual study outcomes helped participants to more successfully estimate the effectiveness of the threatening health information (n = 72). Results Results showed that participants were initially convinced of the effectiveness of threatening health messages and were unable to anticipate the defensive reactions that in fact occurred. Furthermore, these estimates did not improve after participants had been explained the dynamics of threatening communication as well as what the effects of the threatening communication had been in reality. Conclusions These findings are consistent with the hypothesis that the effectiveness of threatening health messages is intuitively appealing. What is more, providing empirical evidence against the use of threatening health messages has very little effect on this intuitive appeal. PMID:23171445

  4. Extraction of Questions Behind Messages

    NASA Astrophysics Data System (ADS)

    Matsumura, Naohiro; Kawahara, Daisuke; Okamoto, Masashi; Kurohashi, Sadao; Nishida, Toyoaki

    To overcome the limitation of conventional text-mining approaches in which frequent patterns of word occurrences are to be extracted to understand obvious user needs, this paper proposes an approach to extracting questions behind messages to understand potential user needs. We first extract characteristic case frames by comparing the case frames constructed from target messages with the ones from 25M sentences in the Web and 20M sentences in newspaper articles of 20 years. Then we extract questions behind messages by transforming the characteristic case frames into interrogative sentences based on new information and old information, i.e., replacing new information with WH-question words. The proposed approach is, in other words, a kind of classification of word occurrence pattern. Qualitative evaluations of our preliminary experiments suggest that extracted questions show problem consciousness and alternative solutions -- all of which help to understand potential user needs.

  5. Modularity, reuse and efficiency with message-driven libraries

    SciTech Connect

    Kale, L.V.; Gursoy, A.

    1995-12-01

    Software re-use via libraries is a strategy that allows the cost of software to be amortized. A parallel programming system must support the ability to develop modules that can be {open_quotes}fitted together{close_quotes} in a variety of contexts. Although it is important to be able to reuse parallel libraries, it is also more difficult to use parallel modules in comparison to sequential module. We present a methodology for developing libraries that addresses these issues effectively. The methodology, which is embodied in the Charm system, employs message-driven execution (in contrast to traditional, receive based message passing), information sharing abstractions, the notion of branched objects, and explicit support for modules.

  6. The mushroom message.

    PubMed

    Zimmerman, M

    1992-04-28

    A basic law of ecology is that living things are tightly dependent on one another, often in ways that are not easy to imagine. Who, for example, would have predicted that when the last dodo was killed in 1675, that death would lead to the slow extermination of the tambalocoque tree, whose fruits germinate only after passing through the dodo's digestive system? Now no natural strands of tambalocoque younger than 300 years can be found. Or who would have predicted that clear-cutting tropical rainforests would so significantly alter local weather patterns that the tropical rainforest biome itself and its vast diversity of life might not survive? Such interactions are worth noting because of the possible ramifications of a phenomenon that ecologists have just begun to document. Mushrooms worldwide appear to be in a catastrophic state of decline. Throughout Europe, in countries with terrains as diverse as Holland, Germany, Austria, Czechoslovakia, Poland and England, wild mushrooms are becoming increasingly difficult to find. Those fungi that are found are significantly smaller than those found years ago. Preliminary data suggest that the same troubling situation is occurring throughout North American as well. The decline has been so precipitous that biologists have begun to refer to it as a mass extinction. The 2 obvious explanations for the demise of the mushrooms--habitat destruction and overpicking of edible types by an ever growing human population--have been ruled out. Sophisticated sampling schemes designed by ecologists control for the fact that there is less land available for wild mushrooms; they have been declining at a rate that far exceeds the rate at which land is being developed. The fact that the decline has affected both edible and inedible mushrooms equally indicates that humans hunting for tasty treats are not the main cause of the problem. The loss of wild mushrooms worldwide might not seem like that big a deal, but the consequences may well be grave

  7. Multi-pass light amplifier

    NASA Technical Reports Server (NTRS)

    Plaessmann, Henry (Inventor); Grossman, William M. (Inventor)

    1997-01-01

    A multiple-pass laser amplifier that uses optical focusing between subsequent passes through a single gain medium so that a reproducibly stable beam size is achieved within the gain region. A confocal resonator or White Cell resonator is provided, including two or three curvilinearly shaped mirrors facing each other along a resonator axis and an optical gain medium positioned on the resonator axis between the mirrors (confocal resonator) or adjacent to one of the mirrors (White Cell). In a first embodiment, two mirrors, which may include adjacent lenses, are configured so that a light beam passing through the gain medium and incident on the first mirror is reflected by that mirror toward the second mirror in a direction approximately parallel to the resonator axis. A light beam translator, such as an optical flat of transparent material, is positioned to translate this light beam by a controllable amount toward or away from the resonator axis for each pass of the light beam through the translator. The optical gain medium may be solid-state, liquid or gaseous medium and may be pumped longitudinally or transversely. In a second embodiment, first and second mirrors face a third mirror in a White Cell configuration, and the optical gain medium is positioned at or adjacent to one of the mirrors. Defocusing means and optical gain medium cooling means are optionally provided with either embodiment, to controllably defocus the light beam, to cool the optical gain medium and to suppress thermal lensing in the gain medium.

  8. EDITORIAL: Message from the Editor

    NASA Astrophysics Data System (ADS)

    Thomas, Paul

    2009-01-01

    The end of 2008 cannot pass without remarking that the economic news has repeatedly strengthened the case for nuclear fusion; not perhaps to solve the immediate crises but to offer long-term security of energy supply. Although temporary, the passage of the price of oil through 100 per barrel is a portent of things to come and should bolster our collective determination to develop nuclear fusion into a viable energy source. It is with great pride, therefore, that I can highlight the contributions that the Nuclear Fusion journal has made to the research programme and the consolidation of its position as the lead journal in the field. Of course, the journal would be nothing without its authors and referees and I would like to pass on my sincere thanks to them all for their work in 2008 and look forward to a continuing, successful collaboration in 2009. Refereeing The Nuclear Fusion Editorial Office understands how much effort is required of our referees. The Editorial Board decided that an expression of thanks to our most loyal referees is appropriate and so, since January 2005, we have been offering the top ten most loyal referees over the past year a personal subscription to Nuclear Fusion with electronic access for one year, free of charge. To select the top referees we have adopted the criterion that a researcher should have acted as a referee or adjudicator for at least two different manuscripts during the period from November 2007 to November 2008 and provided particularly detailed advice to the authors. We have excluded our Board members and those referees who were already listed in the last four years. According to our records the following people met this criterion. Congratulations and many, many thanks! T. Hino (Hokkaido University, Japan) M. Sugihara (ITER Cadarache, France) M. Dreval (Saskatchewan University, Canada) M. Fenstermacher (General Atomics, USA) V.S. Marchenko (Institute for Nuclear Research, Ukraine) G.V. Pereverzev (Max-Planck-Institut fuer

  9. A Decompositional Approach to Executing Quality Data Model Algorithms on the i2b2 Platform.

    PubMed

    Mo, Huan; Jiang, Guoqian; Pacheco, Jennifer A; Kiefer, Richard; Rasmussen, Luke V; Pathak, Jyotishman; Denny, Joshua C; Thompson, William K

    2016-01-01

    The Quality Data Model (QDM) is an established standard for representing electronic clinical quality measures on electronic health record (EHR) repositories. The Informatics for Integrated Biology and the Bedside (i2b2) is a widely used platform for implementing clinical data repositories. However, translation from QDM to i2b2 is challenging, since QDM allows for complex queries beyond the capability of single i2b2 messages. We have developed an approach to decompose complex QDM algorithms into workflows of single i2b2 messages, and execute them on the KNIME data analytics platform. Each workflow operation module is composed of parameter lists, a template for the i2b2 message, an mechanism to create parameter updates, and a web service call to i2b2. The communication between workflow modules relies on passing keys ofi2b2 result sets. As a demonstration of validity, we describe the implementation and execution of a type 2 diabetes mellitus phenotype algorithm against an i2b2 data repository.

  10. A Decompositional Approach to Executing Quality Data Model Algorithms on the i2b2 Platform

    PubMed Central

    Mo, Huan; Jiang, Guoqian; Pacheco, Jennifer A.; Kiefer, Richard; Rasmussen, Luke V.; Pathak, Jyotishman; Denny, Joshua C.; Thompson, William K.

    2016-01-01

    The Quality Data Model (QDM) is an established standard for representing electronic clinical quality measures on electronic health record (EHR) repositories. The Informatics for Integrated Biology and the Bedside (i2b2) is a widely used platform for implementing clinical data repositories. However, translation from QDM to i2b2 is challenging, since QDM allows for complex queries beyond the capability of single i2b2 messages. We have developed an approach to decompose complex QDM algorithms into workflows of single i2b2 messages, and execute them on the KNIME data analytics platform. Each workflow operation module is composed of parameter lists, a template for the i2b2 message, an mechanism to create parameter updates, and a web service call to i2b2. The communication between workflow modules relies on passing keys ofi2b2 result sets. As a demonstration of validity, we describe the implementation and execution of a type 2 diabetes mellitus phenotype algorithm against an i2b2 data repository. PMID:27570665

  11. Re: Design Changing the Message

    ERIC Educational Resources Information Center

    Wall, Miranda Wakeman

    2008-01-01

    The advertisements that flood everyone's visual culture are designed to create desire. From the author's experience, most high school students are not aware of the messages that they are bombarded with every day, and if they are, few care or think about them critically. The author's goals for this lesson were to increase students' awareness of the…

  12. The Media and the Message.

    ERIC Educational Resources Information Center

    Cook, Glenn

    2001-01-01

    The experiences of Columbine and El Cajon high schools with media onslaughts following traumatic shooting incidents underscore the importance of getting the message across and sticking to known facts. In a crisis, speculation can hurt everyone. The most important elements in crisis communications are planning and media relations. (MLH)

  13. [Presidential Message on Indian Affairs.

    ERIC Educational Resources Information Center

    Nixon, Richard

    President Nixon's message pointed out the deprivation and the injustices which the American Indians have suffered for centuries. It was noted that now is the time to break with the past and create conditions for a new era in which the Indian future is determined by Indian acts and decisions. The relationship between the Federal Government and the…

  14. Radiating Messages: An International Perspective.

    ERIC Educational Resources Information Center

    Walker, Janet

    2003-01-01

    Negative messages about the detrimental impacts of divorce on children prompted urgent calls in the United Kingdom for a reinstatement of traditional family values. Suggests that although the effects of divorce are real, care should be taken to avoid exaggeration, thus moving the debate to one centered on providing better support, advice, and…

  15. Re: Design Changing the Message

    ERIC Educational Resources Information Center

    Wall, Miranda Wakeman

    2008-01-01

    The advertisements that flood everyone's visual culture are designed to create desire. From the author's experience, most high school students are not aware of the messages that they are bombarded with every day, and if they are, few care or think about them critically. The author's goals for this lesson were to increase students' awareness of the…

  16. Radiating Messages: An International Perspective.

    ERIC Educational Resources Information Center

    Walker, Janet

    2003-01-01

    Negative messages about the detrimental impacts of divorce on children prompted urgent calls in the United Kingdom for a reinstatement of traditional family values. Suggests that although the effects of divorce are real, care should be taken to avoid exaggeration, thus moving the debate to one centered on providing better support, advice, and…

  17. Monitors, messages, and clusters : the p4 parallel programming system.

    SciTech Connect

    Butler, R. M.; Lusk, E. T.; Mathematics and Computer Science; Univ. of North Florida

    1994-01-01

    p4 is a portable library of C and Fortran subroutines for programming parallel computers. It is the current version of a system that has been in use since 1984. It includes features for explicit parallel programming of shared-memory machines, distributed-memory machines (including heterogeneous networks of workstations), and clusters, by which we mean shared-memory multiprocessors communicating via message passing. We discuss here the design goals, history, and system architecture of p4 and describe briefly a diverse collection of applications that have demonstrated the utility of p4.

  18. Messages from the Abyss

    NASA Astrophysics Data System (ADS)

    2003-10-01

    . Never before had anybody witnessed the last "scream" from matter in the deadly grip of a black hole, about to pass the point of no return towards an unknown fate. At the border ESO PR Photo 29b/03 ESO PR Photo 29b/03 [Preview - JPEG: 400 x 516 pix - 87k [Normal - JPEG: 800 x 1032 pix - 219k] Captions : PR Photo 29b/03 displays the "light curve" of a light flare from the galactic centre, as observed in the K-band (wavelength 2.2 µm) on June 16, 2003. This and a second flare discovered about 24 hours earlier show variability on a time scale of a few minutes and appear to show larger variations (arrows) with a 17-minute periodicity. The rapid variability implies that the infrared emission comes from just outside (the event horizon of) the black hole. If the periodicity is a fundamental property of the motion of gas orbiting the black hole, the Galactic Centre black hole must rotate with about half the maximum spin rate allowed by General Relativity. The present observations thus probe the space-time structure in the immediate vicinity of that event horizon. A careful analysis of the new observational data, reported in this week's issue of the Nature magazine, has revealed that the infrared emission originates from within a few thousandths of an arcsecond [4] from the position of the black hole (corresponding to a distance of a few light-hours) and that it varies on time scales of minutes ( PR Photo 29b/03 ). This proves that the infrared signals must come from just outside the so-called "event horizon" of the black hole, that is the "surface of no return" from which even light cannot escape. The rapid variability seen in all data obtained by the VLT clearly indicates that the region around this horizon must have chaotic properties - very much like those seen in thunderstorms or solar flares [5]. " Our data give us unprecedented information about what happens just outside the event horizon and let us test the predictions of General Relativity " explains Daniel Rouan , a

  19. 78 FR 35625 - Sabine Pass Liquefaction Expansion, LLC; Sabine Pass Liquefaction, LLC; Sabine Pass LNG, L.P...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-06-13

    ..., LLC; Sabine Pass LNG, L.P.; Cheniere Creole Trail Pipeline, L.P.: Notice of Intent To Prepare an... Sabine Pass Liquefaction Expansion, LLC; Sabine Pass Liquefaction, LLC; and Sabine Pass LNG, L.P... metric tonnes of liquefied natural gas (LNG) per annum (mtpa) via LNG carriers. Trains 5 and 6...

  20. Txt2MEDLINE: Text-Messaging Access to MEDLINE/PubMed

    PubMed Central

    Fontelo, Paul; Liu, Fang; Muin, Michael; Tolentino, Herman; Ackerman, Michael

    2006-01-01

    We developed a text messaging system for processing incoming Short Message Service (SMS) queries, retrieving medical journal citations from MEDLINE/PubMed and sending them back to the user in the text message format. A database of medical terminology abbreviations and acronyms was developed to reduce the size of text in journal citations and abstracts because of the 160-character per message limit of text messages. Queries may be sent as full-length terms or abbreviations. An algorithm transforms the citations into the SMS format. An abbreviated TBL (the bottom-line) summary instead of the full abstract is sent to the mobile device to shorten the resulting text. The system decreases citation size by 77.5±7.9%. Txt2MEDLINE provides physicians and healthcare personnel another rapid and convenient method for searching MEDLINE/PubMed through wireless mobile devices. It is accessible from any location worldwide where GSM wireless service is available. PMID:17238343

  1. Run-time scheduling and execution of loops on message passing machines

    NASA Technical Reports Server (NTRS)

    Saltz, Joel; Crowley, Kathleen; Mirchandaney, Ravi; Berryman, Harry

    1990-01-01

    Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

  2. Automated Generation of Message-Passing Programs: An Evaluation Using CAPTools

    NASA Technical Reports Server (NTRS)

    Hribar, Michelle R.; Yan, Jerry C.; Jin, Haoqiang; Saini, Subhah (Technical Monitor)

    2002-01-01

    Scientists at NASA Ames Research Center have been developing computational aeroscience applications on highly parallel architectures over the past ten years. During that same time period, a steady transition of hardware and system software also occurred, forcing us to expend great efforts into migrating and re-coding our applications. As applications and machine architectures become increasingly complex, the cost and time required for this process will become prohibitive. In this paper, we present the first set of results in our evaluation of interactive parallelization tools. In particular, we evaluate CAPTool's ability to parallelize computational aeroscience applications. CAPTools was tested on serial versions of the NAS Parallel Benchmarks and ARC3D, a computational fluid dynamics application, on two platforms: the SGI Origin 2000 and the Cray T3E. This evaluation includes performance, amount of user interaction required, limitations and portability. Based on these results, a discussion on the feasibility of computer aided parallelization of aerospace applications is presented along with suggestions for future work.

  3. Automated Generation of Message-Passing Programs: An Evaluation of CAPTools using NAS Benchmarks

    NASA Technical Reports Server (NTRS)

    Hribar, Michelle R.; Jin, Hao-Qiang; Yan, Jerry C.; Bailey, David (Technical Monitor)

    1998-01-01

    Scientists at NASA Ames Research Center have been developing computational aeroscience applications on highly parallel architectures over the past ten years. During the same time period, a steady transition of hardware and system software also occurred, forcing us to expand great efforts into migrating and receding our applications. As applications and machine architectures continue to become increasingly complex, the cost and time required for this process will become prohibitive. Various attempts to exploit software tools to assist and automate the parallelization process have not produced favorable results. In this paper, we evaluate an interactive parallelization tool, CAPTools, for parallelizing serial versions of the NAB Parallel Benchmarks. Finally, we compare the performance of the resulting CAPTools generated code to the hand-coded benchmarks on the Origin 2000 and IBM SP2. Based on these results, a discussion on the feasibility of automated parallelization of aerospace applications is presented along with suggestions for future work.

  4. Static analysis techniques for semiautomatic synthesis of message passing software skeletons

    SciTech Connect

    Sottile, Matthew; Dagit, Jason; Zhang, Deli; Hendry, Gilbert; Dechev, Damian

    2015-06-29

    The design of high-performance computing architectures demands performance analysis of large-scale parallel applications to derive various parameters concerning hardware design and software development. The process of performance analysis and benchmarking an application can be done in several ways with varying degrees of fidelity. One of the most cost-effective ways is to do a coarse-grained study of large-scale parallel applications through the use of program skeletons. The concept of a “program skeleton” that we discuss in this article is an abstracted program that is derived from a larger program where source code that is determined to be irrelevant is removed for the purposes of the skeleton. In this work, we develop a semiautomatic approach for extracting program skeletons based on compiler program analysis. Finally, we demonstrate correctness of our skeleton extraction process by comparing details from communication traces, as well as show the performance speedup of using skeletons by running simulations in the SST/macro simulator.

  5. Automated Generation of Message-Passing Programs: An Evaluation Using CAPTools

    NASA Technical Reports Server (NTRS)

    Hribar, Michelle R.; Jin, Haoqiang; Yan, Jerry C.; Saini, Subhash (Technical Monitor)

    1998-01-01

    Scientists at NASA Ames Research Center have been developing computational aeroscience applications on highly parallel architectures over the past ten years. During that same time period, a steady transition of hardware and system software also occurred, forcing us to expend great efforts into migrating and re-coding our applications. As applications and machine architectures become increasingly complex, the cost and time required for this process will become prohibitive. In this paper, we present the first set of results in our evaluation of interactive parallelization tools. In particular, we evaluate CAPTool's ability to parallelize computational aeroscience applications. CAPTools was tested on serial versions of the NAS Parallel Benchmarks and ARC3D, a computational fluid dynamics application, on two platforms: the SGI Origin 2000 and the Cray T3E. This evaluation includes performance, amount of user interaction required, limitations and portability. Based on these results, a discussion on the feasibility of computer aided parallelization of aerospace applications is presented along with suggestions for future work.

  6. rMPI : increasing fault resiliency in a message-passing environment.

    SciTech Connect

    Stearley, Jon R.; Laros, James H., III; Ferreira, Kurt Brian; Pedretti, Kevin Thomas Tauke; Oldfield, Ron A.; Riesen, Rolf; Brightwell, Ronald Brian

    2011-04-01

    As High-End Computing machines continue to grow in size, issues such as fault tolerance and reliability limit application scalability. Current techniques to ensure progress across faults, like checkpoint-restart, are unsuitable at these scale due to excessive overheads predicted to more than double an applications time to solution. Redundant computation, long used in distributed and mission critical systems, has been suggested as an alternative to checkpoint-restart on its own. In this paper we describe the rMPI library which enables portable and transparent redundant computation for MPI applications. We detail the design of the library as well as two replica consistency protocols, outline the overheads of this library at scale on a number of real-world applications, and finally outline the significant increase in an applications time to solution at extreme scale as well as show the scenarios in which redundant computation makes sense.

  7. Techniques for Enabling Highly Efficient Message Passing on Many-Core Architectures

    SciTech Connect

    Si, Min; Balaji, Pavan; Ishikawa, Yutaka

    2015-01-01

    Many-core architecture provides a massively parallel environment with dozens of cores and hundreds of hardware threads. Scientific application programmers are increasingly looking at ways to utilize such large numbers of lightweight cores for various programming models. Efficiently executing these models on massively parallel many-core environments is not easy, however and performance may be degraded in various ways. The first author's doctoral research focuses on exploiting the capabilities of many-core architectures on widely used MPI implementations. While application programmers have studied several approaches to achieve better parallelism and resource sharing, many of those approaches still face communication problems that degrade performance. In the thesis, we investigate the characteristics of MPI on such massively threaded architectures and propose two efficient strategies -- a multi-threaded MPI approach and a process-based asynchronous model -- to optimize MPI communication for modern scientific applications.

  8. A Survey of Rollback-Recovery Protocols in Message-Passing Systems,

    DTIC Science & Technology

    1996-10-03

    needs to be accordingly designed . Whether failures that occur during recovery need to be tolerated or not also affects the choice of recovery...the log of one machine is automatically stored on a designated backup without blocking the execution of the application program. This scheme, however...piecewise determinism [41,184,190]. Although most rollback-recovery techniques were originally designed for tolerating hardware failures, they have also

  9. Some Aspects of Parallel Implementation of the Finite Element Method on Message Passing Architectures

    DTIC Science & Technology

    1988-05-01

    for Advanced Computer Studies and Department of Computer Science University of Maryland College Park, MD 20742 4, ABSTRACT We discuss some aspects of...Computer Studies and Technology & Dept. of Compute. Scienc II. CONTROLLING OFFICE NAME AND ADDRESS Viyriyf~ 12. REPORT DATE Department of the Navy uo...number)-1/ 2.) We study the performance of CG and PCG by examining its performance for u E (0,1), for solving the two model problems with an accuracy

  10. Static analysis techniques for semiautomatic synthesis of message passing software skeletons

    DOE PAGES

    Sottile, Matthew; Dagit, Jason; Zhang, Deli; ...

    2015-06-29

    The design of high-performance computing architectures demands performance analysis of large-scale parallel applications to derive various parameters concerning hardware design and software development. The process of performance analysis and benchmarking an application can be done in several ways with varying degrees of fidelity. One of the most cost-effective ways is to do a coarse-grained study of large-scale parallel applications through the use of program skeletons. The concept of a “program skeleton” that we discuss in this article is an abstracted program that is derived from a larger program where source code that is determined to be irrelevant is removed formore » the purposes of the skeleton. In this work, we develop a semiautomatic approach for extracting program skeletons based on compiler program analysis. Finally, we demonstrate correctness of our skeleton extraction process by comparing details from communication traces, as well as show the performance speedup of using skeletons by running simulations in the SST/macro simulator.« less

  11. Run-time scheduling and execution of loops on message passing machines

    NASA Technical Reports Server (NTRS)

    Crowley, Kay; Saltz, Joel; Mirchandaney, Ravi; Berryman, Harry

    1989-01-01

    Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

  12. Run-time scheduling and execution of loops on message passing machines

    NASA Technical Reports Server (NTRS)

    Saltz, Joel; Crowley, Kathleen; Mirchandaney, Ravi; Berryman, Harry

    1990-01-01

    Sparse system solvers and general purpose codes for solving partial differential equations are examples of the many types of problems whose irregularity can result in poor performance on distributed memory machines. Often, the data structures used in these problems are very flexible. Crucial details concerning loop dependences are encoded in these structures rather than being explicitly represented in the program. Good methods for parallelizing and partitioning these types of problems require assignment of computations in rather arbitrary ways. Naive implementations of programs on distributed memory machines requiring general loop partitions can be extremely inefficient. Instead, the scheduling mechanism needs to capture the data reference patterns of the loops in order to partition the problem. First, the indices assigned to each processor must be locally numbered. Next, it is necessary to precompute what information is needed by each processor at various points in the computation. The precomputed information is then used to generate an execution template designed to carry out the computation, communication, and partitioning of data, in an optimized manner. The design is presented for a general preprocessor and schedule executer, the structures of which do not vary, even though the details of the computation and of the type of information are problem dependent.

  13. A public-key cryptosystem for quantum message transmission

    NASA Astrophysics Data System (ADS)

    Yang, Li

    2005-01-01

    We present a quantum public-key cryptography protocol for quantum message transmission. The private key of this protocol includes three classical matrices: a generator matrix of a Goppa code, an invertible matrix and a permutation matrix. The public key is product of these three matrices. The encryption and decryption algorithms are merely quantum computations related with the transformations between bases of the quantum registers. The security of this protocol is based on the hypothesis that there is no effective algorithm of NP-complete problem.

  14. Representing culture in interstellar messages

    NASA Astrophysics Data System (ADS)

    Vakoch, Douglas A.

    2008-09-01

    As scholars involved with the Search for Extraterrestrial Intelligence (SETI) have contemplated how we might portray humankind in any messages sent to civilizations beyond Earth, one of the challenges they face is adequately representing the diversity of human cultures. For example, in a 2003 workshop in Paris sponsored by the SETI Institute, the International Academy of Astronautics (IAA) SETI Permanent Study Group, the International Society for the Arts, Sciences and Technology (ISAST), and the John Templeton Foundation, a varied group of artists, scientists, and scholars from the humanities considered how to encode notions of altruism in interstellar messages . Though the group represented 10 countries, most were from Europe and North America, leading to the group's recommendation that subsequent discussions on the topic should include more globally representative perspectives. As a result, the IAA Study Group on Interstellar Message Construction and the SETI Institute sponsored a follow-up workshop in Santa Fe, New Mexico, USA in February 2005. The Santa Fe workshop brought together scholars from a range of disciplines including anthropology, archaeology, chemistry, communication science, philosophy, and psychology. Participants included scholars familiar with interstellar message design as well as specialists in cross-cultural research who had participated in the Symposium on Altruism in Cross-cultural Perspective, held just prior to the workshop during the annual conference of the Society for Cross-cultural Research . The workshop included discussion of how cultural understandings of altruism can complement and critique the more biologically based models of altruism proposed for interstellar messages at the 2003 Paris workshop. This paper, written by the chair of both the Paris and Santa Fe workshops, will explore the challenges of communicating concepts of altruism that draw on both biological

  15. Presentation of dynamically overlapping auditory messages in user interfaces

    SciTech Connect

    Papp, III, Albert Louis

    1997-09-01

    This dissertation describes a methodology and example implementation for the dynamic regulation of temporally overlapping auditory messages in computer-user interfaces. The regulation mechanism exists to schedule numerous overlapping auditory messages in such a way that each individual message remains perceptually distinct from all others. The method is based on the research conducted in the area of auditory scene analysis. While numerous applications have been engineered to present the user with temporally overlapped auditory output, they have generally been designed without any structured method of controlling the perceptual aspects of the sound. The method of scheduling temporally overlapping sounds has been extended to function in an environment where numerous applications can present sound independently of each other. The Centralized Audio Presentation System is a global regulation mechanism that controls all audio output requests made from all currently running applications. The notion of multimodal objects is explored in this system as well. Each audio request that represents a particular message can include numerous auditory representations, such as musical motives and voice. The Presentation System scheduling algorithm selects the best representation according to the current global auditory system state, and presents it to the user within the request constraints of priority and maximum acceptable latency. The perceptual conflicts between temporally overlapping audio messages are examined in depth through the Computational Auditory Scene Synthesizer. At the heart of this system is a heuristic-based auditory scene synthesis scheduling method. Different schedules of overlapped sounds are evaluated and assigned penalty scores. High scores represent presentations that include perceptual conflicts between over-lapping sounds. Low scores indicate fewer and less serious conflicts. A user study was conducted to validate that the perceptual difficulties predicted by

  16. Remote beacon location from a single satellite pass

    NASA Technical Reports Server (NTRS)

    Lynn, J. J.; Schmid, P. E.

    1977-01-01

    This paper describes the techniques and associated dedicated hardware utilized in locating remote beacons via satellites. Applications include those associated with a 'distress' situation or for monitoring the location of floating data collection platforms. Results obtained from experiments involving the NASA Nimbus-6 and the Amateur Satellite Corporation (AMSAT) OSCAR spacecrafts indicate position accuracies on the order of one and two kilometers are possible. The geographical location of a low power VHF transmitter is determined from Doppler data collected during a single satellite pass. A dedicated microcomputer utilizes an efficient algorithm to provide beacon position coordinates within a minute after the end of the satellite pass.

  17. A total ordering protocol using a dynamic token-passing scheme

    NASA Astrophysics Data System (ADS)

    Kim, Jongsung; Kim, Cheeha

    1997-06-01

    Solutions to the total ordering problem can be used to maintain consistency in distributed system applications such as replicated databases. We propose a total ordering protocol based on a dynamic token-passing scheme which determines the next token holder dynamically, not in predetermined order. The proposed protocol provides fast stability time, uses a small buffer, and distributes evenly the load of ordering messages to accomplish a total message ordering. We present simulation results to illustrate that the performance of the proposed protocol is superior to that of existing token-based total ordering protocols.

  18. Toward Predicting Popularity of Social Marketing Messages

    NASA Astrophysics Data System (ADS)

    Yu, Bei; Chen, Miao; Kwok, Linchi

    Popularity of social marketing messages indicates the effectiveness of the corresponding marketing strategies. This research aims to discover the characteristics of social marketing messages that contribute to different level of popularity. Using messages posted by a sample of restaurants on Facebook as a case study, we measured the message popularity by the number of "likes" voted by fans, and examined the relationship between the message popularity and two properties of the messages: (1) content, and (2) media type. Combining a number of text mining and statistics methods, we have discovered some interesting patterns correlated to "more popular" and "less popular" social marketing messages. This work lays foundation for building computational models to predict the popularity of social marketing messages in the future.

  19. Practice What You Preach about Goodwill Messages.

    ERIC Educational Resources Information Center

    Casady, Mona J.

    1985-01-01

    Suggests ways for students to experience the impact of written messages and for teachers to promote good public relations through the use of goodwill messages. Examples include the use of verbal compliments and personal business letters. (EL)

  20. Perceived effectiveness of messages promoting hand hygiene.

    PubMed

    Taylor, Ronald E

    2017-03-01

    Eighty-six infection control specialists evaluated 24 messages promoting hand hygiene (HH). Brief, simple messages using appeals to social situations and to ego (self-efficacy) were rated as most likely to increase HH compliance.

  1. Network-Control Algorithm

    NASA Technical Reports Server (NTRS)

    Chan, Hak-Wai; Yan, Tsun-Yee

    1989-01-01

    Algorithm developed for optimal routing of packets of data along links of multilink, multinode digital communication network. Algorithm iterative and converges to cost-optimal assignment independent of initial assignment. Each node connected to other nodes through links, each containing number of two-way channels. Algorithm assigns channels according to message traffic leaving and arriving at each node. Modified to take account of different priorities among packets belonging to different users by using different delay constraints or imposing additional penalties via cost function.

  2. 27 CFR 9.88 - Pacheco Pass.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2010-04-01 2010-04-01 false Pacheco Pass. 9.88 Section... Pass. (a) Name. The name of the viticultural area described in this section is “Pacheco Pass.” (b) Approved maps. The appropriate maps for determining the boundaries of Pacheco Pass viticultural area...

  3. 34 CFR 668.147 - Passing scores.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 34 Education 3 2010-07-01 2010-07-01 false Passing scores. 668.147 Section 668.147 Education...; Specification of Passing Score; Approval of State Process § 668.147 Passing scores. Except as provided in §§ 668... education and training offered, the Secretary specifies that the passing score on each approved test is...

  4. 34 CFR 668.147 - Passing scores.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 34 Education 3 2011-07-01 2011-07-01 false Passing scores. 668.147 Section 668.147 Education...; Specification of Passing Score; Approval of State Process § 668.147 Passing scores. Except as provided in §§ 668... education and training offered by the institution, the Secretary specifies that the passing score on each...

  5. 27 CFR 9.88 - Pacheco Pass.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2014-04-01 2014-04-01 false Pacheco Pass. 9.88 Section... Pass. (a) Name. The name of the viticultural area described in this section is “Pacheco Pass.” (b) Approved maps. The appropriate maps for determining the boundaries of Pacheco Pass viticultural area are...

  6. 34 CFR 668.147 - Passing scores.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 34 Education 3 2013-07-01 2013-07-01 false Passing scores. 668.147 Section 668.147 Education...; Specification of Passing Score; Approval of State Process § 668.147 Passing scores. Except as provided in §§ 668... education and training offered by the institution, the Secretary specifies that the passing score on each...

  7. 34 CFR 668.147 - Passing scores.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 34 Education 3 2014-07-01 2014-07-01 false Passing scores. 668.147 Section 668.147 Education...; Specification of Passing Score; Approval of State Process § 668.147 Passing scores. Except as provided in §§ 668... education and training offered by the institution, the Secretary specifies that the passing score on each...

  8. 27 CFR 9.88 - Pacheco Pass.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2012-04-01 2012-04-01 false Pacheco Pass. 9.88 Section... Pass. (a) Name. The name of the viticultural area described in this section is “Pacheco Pass.” (b) Approved maps. The appropriate maps for determining the boundaries of Pacheco Pass viticultural area are...

  9. 27 CFR 9.88 - Pacheco Pass.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2013-04-01 2013-04-01 false Pacheco Pass. 9.88 Section... Pass. (a) Name. The name of the viticultural area described in this section is “Pacheco Pass.” (b) Approved maps. The appropriate maps for determining the boundaries of Pacheco Pass viticultural area are...

  10. 27 CFR 9.88 - Pacheco Pass.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 27 Alcohol, Tobacco Products and Firearms 1 2011-04-01 2011-04-01 false Pacheco Pass. 9.88 Section... Pass. (a) Name. The name of the viticultural area described in this section is “Pacheco Pass.” (b) Approved maps. The appropriate maps for determining the boundaries of Pacheco Pass viticultural area are...

  11. 34 CFR 668.147 - Passing scores.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 34 Education 3 2012-07-01 2012-07-01 false Passing scores. 668.147 Section 668.147 Education...; Specification of Passing Score; Approval of State Process § 668.147 Passing scores. Except as provided in §§ 668... education and training offered by the institution, the Secretary specifies that the passing score on each...

  12. 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.

  13. Deaf Children's Referential Messages to Mother.

    ERIC Educational Resources Information Center

    MacKay-Soroka, Sherri; And Others

    1987-01-01

    Examination of the nature and quality of deaf children's referential messages to their mothers, the outcome of such messages, and the reformulations of "failed" messages. Deaf children 6-10 years old, from oral or bimodal educational programs, were tested in two tasks involving identification and description of a picture. (Author/BN)

  14. 47 CFR 10.420 - Message elements.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 47 Telecommunication 1 2014-10-01 2014-10-01 false Message elements. 10.420 Section 10.420... § 10.420 Message elements. A WEA Alert Message processed by a Participating CMS Provider shall include five mandatory CAP elements—Event Type; Area Affected; Recommended Action; Expiration Time (with time...

  15. 47 CFR 10.420 - Message elements.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 1 2011-10-01 2011-10-01 false Message elements. 10.420 Section 10.420... Requirements § 10.420 Message elements. A CMAS Alert Message processed by a Participating CMS Provider shall include five mandatory CAP elements—Event Type; Area Affected; Recommended Action; Expiration Time (with...

  16. 47 CFR 10.420 - Message elements.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 47 Telecommunication 1 2013-10-01 2013-10-01 false Message elements. 10.420 Section 10.420... § 10.420 Message elements. A WEA Alert Message processed by a Participating CMS Provider shall include five mandatory CAP elements—Event Type; Area Affected; Recommended Action; Expiration Time (with time...

  17. 47 CFR 10.420 - Message elements.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 47 Telecommunication 1 2012-10-01 2012-10-01 false Message elements. 10.420 Section 10.420... Requirements § 10.420 Message elements. A CMAS Alert Message processed by a Participating CMS Provider shall include five mandatory CAP elements—Event Type; Area Affected; Recommended Action; Expiration Time (with...

  18. Interpreting a Museum Exhibit: The Message Effectiveness and Cost Effectiveness of Alternative Audio Messages.

    ERIC Educational Resources Information Center

    Hambleton, Susan K.

    In this Masters Thesis, the message effectiveness and cost effectiveness (in terms of costs and monetary benefits) of two interpretive audio messages were evaluated. Ninety-nine randomly selected visitors to a Central Ohio interpretive museum were exposed to one of two audio tape recorded messages. One message used interpretive technique; the…

  19. Instant Messaging in Dental Education.

    PubMed

    Khatoon, Binish; Hill, Kirsty B; Walmsley, A Damien

    2015-12-01

    Instant messaging (IM) is when users communicate instantly via their mobile devices, and it has become one of the most preferred choices of tools to communicate amongst health professions students. The aim of this study was to understand how dental students communicate via IM, faculty members' perspectives on using IM to communicate with students, and whether such tools are useful in the learning environment. After free-associating themes on online communication, two draft topic guides for structured interviews were designed that focussed on mobile device-related communication activities. A total of 20 students and six faculty members at the University of Birmingham School of Dentistry agreed to take part in the interviews. Students were selected from years 1-5 representing each year group. The most preferred communication tools were emails, social networking, and IM. Emails were used for more formal messages, and IM and social networking sites were used for shorter messages. WhatsApp was the most used IM app because of its popular features such as being able to check if recipients have read and received messages and group work. The students reported that changes were necessary to improve their communication with faculty members. The faculty members reported having mixed feelings toward the use of IM to communicate with students. The students wished to make such tools a permanent part of their learning environment, but only with the approval of faculty members. The faculty members were willing to accept IM as a communication tool only if it is monitored and maintained by the university and has a positive effect on learning.

  20. Astronaut Akers with TIPS messages

    NASA Image and Video Library

    1996-09-22

    STS79-E-5246 (22 September 1996) --- Astronauts Thomas D. Akers and Shannon W. Lucid check the latest send-up of "mail" on the Space Shuttle Atlantis' mid deck, during Flight Day 7. The Thermal Imaging Printing System (TIPS) messages likely include information pertinent to the final day of joint activities with the Mir-22 crew members whom Lucid will leave behind for her return to Earth later this week.

  1. The hidden messages managers send.

    PubMed

    McCaskey, M B

    1979-01-01

    If a manager in an organization talks about making an "end run," what is he saying? Is he seeing life in the organization as a game; is he seeing it as hazardous and maybe nominating himself for a hero role; or is he merely saying he's going all the way with a project, regardless. The truth is we don't know what he's saying. It is all too easy both to interpret the metaphors others use to fit out own meanings and to ignore the fact that metaphors have idiosyncratic meanings that should be listened to. The author describes three ways managers convey messages about themselves and the ways they see the world. He encourages the reader to see these ways--their metaphors, office settings, and body language and tones that accompany their speech--as means of communicating. Just as speech or mathematics, these are languages that can be learned. With skill in them, a manager can see or hear what is really going on when people talk, what hidden messages we are sending all the time. The author gives some hints on what to look and listen for in trying to understand others, but he warns against simplistic interpretations: all messages occur in context.

  2. A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

    DOE PAGES

    Gamarnik, David; Misra, Sidhant

    2016-06-06

    Here, we consider the problem of reconstructing a low-rank matrix from a subset of its entries and analyze two variants of the so-called alternating minimization algorithm, which has been proposed in the past.We establish that when the underlying matrix has rank one, has positive bounded entries, and the graph underlying the revealed entries has diameter which is logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization.We further provide simulation results which suggest that the second variant which is based on the message passing type updates performsmore » significantly better.« less

  3. Distributed parallel messaging for multiprocessor systems

    DOEpatents

    Chen, Dong; Heidelberger, Philip; Salapura, Valentina; Senger, Robert M; Steinmacher-Burrow, Burhard; Sugawara, Yutaka

    2013-06-04

    A method and apparatus for distributed parallel messaging in a parallel computing system. The apparatus includes, at each node of a multiprocessor network, multiple injection messaging engine units and reception messaging engine units, each implementing a DMA engine and each supporting both multiple packet injection into and multiple reception from a network, in parallel. The reception side of the messaging unit (MU) includes a switch interface enabling writing of data of a packet received from the network to the memory system. The transmission side of the messaging unit, includes switch interface for reading from the memory system when injecting packets into the network.

  4. Preparing EBS messages. [Emergency Broadcast System (EBS)

    SciTech Connect

    Vogt, B.M., Sorensen, J.H.

    1992-09-01

    Warning messages transmitted to populations at risk from an accidental release of chemical agent must be carefully designed to maximize appropriate responses from affected publics. This guide develops an approach for preparing Emergency Broadcast System (EBS) messages for the Chemical Stockpile Emergency Preparedness Program (CSEPP). Sample messages illustrate the application of this approach. While the sample messages do not cover every emergency situation, the texts are generic in that accident and location specific factors can be incorporated into the final message developed by local emergency planners. Thus they provide a starting point, not an end product, for emergency planners.

  5. Nonblocking and orphan free message logging protocols

    NASA Technical Reports Server (NTRS)

    Alvisi, Lorenzo; Hoppe, Bruce; Marzullo, Keith

    1992-01-01

    Currently existing message logging protocols demonstrate a classic pessimistic vs. optimistic tradeoff. We show that the optimistic-pessimistic tradeoff is not inherent to the problem of message logging. We construct a message-logging protocol that has the positive features of both optimistic and pessimistic protocol: our protocol prevents orphans and allows simple failure recovery; however, it requires no blocking in failure-free runs. Furthermore, this protocol does not introduce any additional message overhead as compared to one implemented for a system in which messages may be lost but processes do not crash.

  6. Multi-pass light amplifier

    NASA Technical Reports Server (NTRS)

    Plaessmann, Henry (Inventor); Grossman, William M. (Inventor); Olson, Todd E. (Inventor)

    1996-01-01

    A multiple-pass laser amplifier that uses optical focusing between subsequent passes through a single gain medium so that a reproducibly stable beam size is achieved within the gain region. A resonator or a White Cell cavity is provided, including two or more mirrors (planar or curvilinearly shaped) facing each other along a resonator axis and an optical gain medium positioned on a resonator axis between the mirrors or adjacent to one of the mirrors. In a first embodiment, two curvilinear mirrors, which may include adjacent lenses, are configured so that a light beam passing through the gain medium and incident on the first mirror is reflected by that mirror toward the second mirror in a direction approximately parallel to the resonator axis. A light beam translator, such as an optical flat of transparent material, is positioned to translate this light beam by a controllable amount toward or away from the resonator axis for each pass of the light beam through the translator. A second embodiment uses two curvilinear mirrors and one planar mirror, with a gain medium positioned in the optical path between each curvilinear mirror and the planar mirror. A third embodiment uses two curvilinear mirrors and two planar mirrors, with a gain medium positioned adjacent to a planar mirror. A fourth embodiment uses a curvilinear mirror and three planar mirrors, with a gain medium positioned adjacent to a planar mirror. A fourth embodiment uses four planar mirrors and a focusing lens system, with a gain medium positioned between the four mirrors. A fifth embodiment uses first and second planar mirrors, a focusing lens system and a third mirror that may be planar or curvilinear, with a gain medium positioned adjacent to the third mirror. A sixth embodiment uses two planar mirrors and a curvilinear mirror and a fourth mirror that may be planar or curvilinear, with a gain medium positioned adjacent to the fourth mirror. In a seventh embodiment, first and second mirrors face a third

  7. Messages about appearance, food, weight and exercise in "tween" television.

    PubMed

    Simpson, Courtney C; Kwitowski, Melissa; Boutte, Rachel; Gow, Rachel W; Mazzeo, Suzanne E

    2016-12-01

    Tweens (children ages ~8-14years) are a relatively recently defined age group, increasingly targeted by marketers. Individuals in this age group are particularly vulnerable to opinions and behaviors presented in media messages, given their level of cognitive and social development. However, little research has examined messages about appearance, food, weight, and exercise in television specifically targeting tweens, despite the popularity of this media type among this age group. This study used a content analytic approach to explore these messages in the five most popular television shows for tweens on the Disney Channel (as of 2015). Using a multiple-pass approach, relevant content in episodes from the most recently completed seasons of each show was coded. Appearance related incidents occurred in every episode; these most frequently mentioned attractiveness/beauty. Food related incidents were also present in every episode; typically, these situations were appearance and weight neutral. Exercise related incidents occurred in 53.3% of episodes; the majority expressed resistance to exercise. Weight related incidents occurred in 40.0% of the episodes; the majority praised the muscular ideal. Women were more likely to initiate appearance incidents, and men were more likely to initiate exercise incidents. These results suggest that programs specifically marketed to tweens reinforce appearance ideals, including stereotypes about female attractiveness and male athleticism, two constructs linked to eating pathology and body dissatisfaction. Given the developmental vulnerability of the target group, these findings are concerning, and highlight potential foci for prevention programming, including media literacy, for tweens.

  8. 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

  9. Is Provider Secure Messaging Associated With Patient Messaging Behavior? Evidence From the US Army.

    PubMed

    Wolcott, Vickee; Agarwal, Ritu; Nelson, D Alan

    2017-04-06

    Secure messaging with health care providers offers the promise of improved patient-provider relationships, potentially facilitating outcome improvements. But, will patients use messaging technology in the manner envisioned by policy-makers if their providers do not actively use it? We hypothesized that the level and type of secure messaging usage by providers might be associated with messaging initiation by their patients. The study employed a dataset of health care and secure messaging records of more than 81,000 US Army soldiers and nearly 3000 clinicians with access to a patient portal system. We used a negative binomial regression model on over 25 million observations to determine the adjusted association between provider-initiated and provider-response messaging and subsequent messaging by their patients in this population over a 4-year period. Prior provider-initiated and response messaging levels were associated with new patient messaging when controlling for the patient's health care utilization and diagnoses, with the strongest association for high provider-response messaging level. Patients whose providers were highly responsive to the messages of other patients initiated 334% more secure messages (P<.001) than patients with providers who did not personally respond to other patients' messages. Our results indicate that provider messaging usage levels and types thereof predict their patients' subsequent communication behavior. The findings suggest the need for more study into the factors associated with provider messaging to fully understand the mechanisms of this relationship.

  10. Low-pass spatial filtering of satellite radar data

    NASA Technical Reports Server (NTRS)

    Mueller, Paul W.; Hoffer, Roger N.

    1989-01-01

    Thirty-four low-pass spatial filter treatments were applied to a multi-angle SIR-B data set to reduce speckle effects and improve classification performance. These treatments were based on four algorithms: square mean, separable mean, square median, and separable recursive median. The filtered images were evaluated using both quantitative and qualitative techniques. It was determined that the square median algorithm implemented at two iterations with a window size of 3 by 3 produced the best overall results with the 28.5-m SIR-B data.

  11. Low-pass spatial filtering of satellite radar data

    NASA Technical Reports Server (NTRS)

    Mueller, Paul W.; Hoffer, Roger N.

    1989-01-01

    Thirty-four low-pass spatial filter treatments were applied to a multi-angle SIR-B data set to reduce speckle effects and improve classification performance. These treatments were based on four algorithms: square mean, separable mean, square median, and separable recursive median. The filtered images were evaluated using both quantitative and qualitative techniques. It was determined that the square median algorithm implemented at two iterations with a window size of 3 by 3 produced the best overall results with the 28.5-m SIR-B data.

  12. 78 FR 62344 - Sabine Pass Liquefaction Expansion, LLC, Sabine Pass Liquefaction, LLC, and Sabine Pass LNG, L.P...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-10-18

    ... Sabine Pass LNG, L.P., Cheniere Creole Trail Pipeline, L.P.; Notice of Application Take notice that on... LNG, L.P. (collectively referred to as Sabine Pass) filed with the Federal Energy Regulatory..., construct, and operate additional liquefied natural gas (LNG) export facilities at the Sabine Pass LNG...

  13. State passes physician-aided suicide; now asks, 'What have we done'?

    PubMed

    1995-01-01

    It's hard to tell whether we're hearing a collective sigh of relief or the catching of one's breath as Oregon's Death with Dignity Act was passed but put on hold. Regardless, the show's not over, although the devil in the details is starting to emerge. Many are calling the vote a "wake-up call," although it appears that opposing messages are being heard. Moreover, the distinction between physician-aided suicide and euthanasia are becoming ever more blurred.

  14. A parallel finite volume algorithm for large-eddy simulation of turbulent flows

    NASA Astrophysics Data System (ADS)

    Bui, Trong Tri

    1998-11-01

    A parallel unstructured finite volume algorithm is developed for large-eddy simulation of compressible turbulent flows. Major components of the algorithm include piecewise linear least-square reconstruction of the unknown variables, trilinear finite element interpolation for the spatial coordinates, Roe flux difference splitting, and second-order MacCormack explicit time marching. The computer code is designed from the start to take full advantage of the additional computational capability provided by the current parallel computer systems. Parallel implementation is done using the message passing programming model and message passing libraries such as the Parallel Virtual Machine (PVM) and Message Passing Interface (MPI). The development of the numerical algorithm is presented in detail. The parallel strategy and issues regarding the implementation of a flow simulation code on the current generation of parallel machines are discussed. The results from parallel performance studies show that the algorithm is well suited for parallel computer systems that use the message passing programming model. Nearly perfect parallel speedup is obtained on MPP systems such as the Cray T3D and IBM SP2. Performance comparison with the older supercomputer systems such as the Cray YMP show that the simulations done on the parallel systems are approximately 10 to 30 times faster. The results of the accuracy and performance studies for the current algorithm are reported. To validate the flow simulation code, a number of Euler and Navier-Stokes simulations are done for internal duct flows. Inviscid Euler simulation of a very small amplitude acoustic wave interacting with a shock wave in a quasi-1D convergent-divergent nozzle shows that the algorithm is capable of simultaneously tracking the very small disturbances of the acoustic wave and capturing the shock wave. Navier-Stokes simulations are made for fully developed laminar flow in a square duct, developing laminar flow in a

  15. When you pass your due date

    MedlinePlus

    ... medlineplus.gov/ency/patientinstructions/000515.htm When you pass your due date To use the sharing features ... link between you and your baby. As you pass your due date, the placenta may not work ...

  16. Processes of incremental message planning during conversation.

    PubMed

    Brown-Schmidt, Sarah; Konopka, Agnieszka E

    2015-06-01

    Speaking begins with the formulation of an intended preverbal message and linguistic encoding of this information. The transition from thought to speech occurs incrementally, with cascading planning at subsequent levels of production. In this article, we aim to specify the mechanisms that support incremental message preparation. We contrast two hypotheses about the mechanisms responsible for incorporating message-level information into a linguistic plan. According to the Initial Preparation view, messages can be encoded as fluent utterances if all information is ready before speaking begins. By contrast, on the Continuous Incrementality view, messages can be continually prepared and updated throughout the production process, allowing for fluent production even if new information is added to the message while speaking is underway. Testing these hypotheses, eye-tracked speakers in two experiments produced unscripted, conjoined noun phrases with modifiers. Both experiments showed that new message elements can be incrementally incorporated into the utterance even after articulation begins, consistent with a Continuous Incrementality view of message planning, in which messages percolate to linguistic encoding immediately as that information becomes available in the mind of the speaker. We conclude by discussing the functional role of incremental message planning in conversational speech and the situations in which this continuous incremental planning would be most likely to be observed.

  17. The PASS project architectural model

    SciTech Connect

    Day, C.T.; Loken, S.; Macfarlane, J.F.

    1994-08-01

    The PASS project has as its goal the implementation of solutions to the foreseen data access problems of the next generation of scientific experiments. The architectural model results from an evaluation of the operational and technical requirements and is described in terms of an abstract reference model, an implementation model and a discussion of some design aspects. The abstract reference model describes a system that matches the requirements in terms of its components and the mechanisms by which they communicate, but does not discuss policy or design issues that would be necessary to match the model to an actual implementation. Some of these issues are discussed, but more detailed design and simulation work will be necessary before choices can be made.

  18. Senate passes clean air bill

    NASA Astrophysics Data System (ADS)

    In an 89 to 11 vote the Senate passed a clean air bill aimed at reducing pollution by the turn of the century by imposing tougher controls on American industry. The bill is the first revision of the Clean Air Act of 1970 in 13 years and calls for new limits on auto pollution to clean up smog in most U.S. cities, decreasing by half emissions by power plants that cause acid rain to protect the ecology, and increasing technological controls on factories to protect against cancer-causing and toxic substances. The bill will add about $20 billion per year to the estimated $33 billion cost of complying with current pollution laws.

  19. Regulatory fit messages and physical activity motivation.

    PubMed

    Pfeffer, Ines

    2013-04-01

    Targeted communication about health behaviors seems to be more effective than mass communication in which undifferentiated audiences receive identical messages. Regulatory focus is psychological variable that can be used to build two target groups: promotion-focused or prevention-focused people. It is hypothesized that targeting messages to an individual's regulatory focus creates regulatory fit and is more successful to promote a physically active lifestyle than nonfit messages. Two different print messages promoting a physically active lifestyle derived from regulatory focus theory (promotion message vs. prevention message) were randomly assigned to N = 98 participants after measuring their regulatory focus. It was examined whether regulatory fit between the regulatory focus and the assigned print message would lead to more positive evaluations in the dependent variables inclination toward the message (preference for the message), intention to perform the behavior, prospective and retrospective feelings associated with the behavior (positive and negative), and perceived value of the behavior directly after reading the message. Hierarchical linear regression analyses revealed that regulatory fit led to stronger intentions in the prevention-message condition and more prospective positive and retrospective positive feelings associated with the behavior in the promotion-message condition in contrast to the nonfit conditions. Prospective positive feelings associated with the behavior mediated the effect of regulatory fit on intention. The results partly provided support for the regulatory fit concept. Matching print messages to the regulatory focus of individuals seems to be a useful approach to enhance physical activity motivation. Future studies should include an objective measure of physical activity behavior.

  20. A new collage steganographic algorithm using cartoon design

    NASA Astrophysics Data System (ADS)

    Yi, Shuang; Zhou, Yicong; Pun, Chi-Man; Chen, C. L. Philip

    2014-02-01

    Existing collage steganographic methods suffer from low payload of embedding messages. To improve the payload while providing a high level of security protection to messages, this paper introduces a new collage steganographic algorithm using cartoon design. It embeds messages into the least significant bits (LSBs) of color cartoon objects, applies different permutations to each object, and adds objects to a cartoon cover image to obtain the stego image. Computer simulations and comparisons demonstrate that the proposed algorithm shows significantly higher capacity of embedding messages compared with existing collage steganographic methods.

  1. Key paediatric messages from Amsterdam

    PubMed Central

    Barben, Jürg; Bohlin, Kajsa; Everard, Mark L.; Hall, Graham; Pijnenburg, Mariëlle; Priftis, Kostas N.; Rusconi, Franca; Midulla, Fabio

    2016-01-01

    The Paediatric Assembly of the European Respiratory Society (ERS) maintained its high profile at the 2015 ERS International Congress in Amsterdam. There were symposia on preschool wheeze, respiratory sounds and cystic fibrosis; an educational skills workshop on paediatric respiratory resuscitation; a hot topic session on risk factors and early origins of respiratory diseases; a meet the expert session on paediatric lung function test reference values; and the annual paediatric grand round. In this report the Chairs of the Paediatric Assembly's Groups highlight the key messages from the abstracts presented at the Congress. PMID:27730186

  2. Message Technology Research and Development

    DTIC Science & Technology

    1976-12-01

    and continue with your work. 5. New Mail Notice Before Quitting If you Quit HERMES and there is new mail in your INBOX , HERMES notifies you, then...uses the Mail Forwarding Data Base (MFDB) to check addresses. At present, an active MFDB is implemented only on the five BBN systems. The MFDB...names in the Tor-field of the original message. a i l ä I •5 + a a y 1. Host Names Supplied Correctly a) Replying to the From: and Sender

  3. Parallel algorithm to analyze the brain signals: application on epileptic spikes.

    PubMed

    Keshri, Anup Kumar; Das, Barda Nand; Mallick, Dheeresh Kumar; Sinha, Rakesh Kumar

    2011-02-01

    In the current work, we have proposed a parallel algorithm for the recognition of Epileptic Spikes (ES) in EEG. The automated systems are used in biomedical field to help the doctors and pathologist by producing the result of an inspection in real time. Generally, the biomedical signal data to be processed are very large in size. A uniprocessor computer is having its own limitation regarding its speed. So the fastest available computer with latest configuration also may not produce results in real time for the immense computation. Parallel computing can be proved as a useful tool for processing the huge data with higher speed. In the proposed algorithm 'Data Parallelism' has been applied where multiple processors perform the same operation on different part of the data to produce fast result. All the processors are interconnected with each other by an interconnection network. The complexity of the algorithm was analyzed as Θ((n + δn) / N) where, 'n' is the length of the input data, 'N' is the number of processor used in the algorithm and 'δn' is the amount of overlapped data between two consecutive intermediate processors (IPs). This algorithm is scalable as the level of parallelism increase linearly with the increase in number of processors. The algorithm has been implemented in Message Passing Interface (MPI). It was tested with 60 min recorded EEG signal data files. The recognition rate of ES on an average was 95.68%.

  4. A parallel dynamic programming algorithm for multi-reservoir system optimization

    NASA Astrophysics Data System (ADS)

    Li, Xiang; Wei, Jiahua; Li, Tiejian; Wang, Guangqian; Yeh, William W.-G.

    2014-05-01

    This paper develops a parallel dynamic programming algorithm to optimize the joint operation of a multi-reservoir system. First, a multi-dimensional dynamic programming (DP) model is formulated for a multi-reservoir system. Second, the DP algorithm is parallelized using a peer-to-peer parallel paradigm. The parallelization is based on the distributed memory architecture and the message passing interface (MPI) protocol. We consider both the distributed computing and distributed computer memory in the parallelization. The parallel paradigm aims at reducing the computation time as well as alleviating the computer memory requirement associated with running a multi-dimensional DP model. Next, we test the parallel DP algorithm on the classic, benchmark four-reservoir problem on a high-performance computing (HPC) system with up to 350 cores. Results indicate that the parallel DP algorithm exhibits good performance in parallel efficiency; the parallel DP algorithm is scalable and will not be restricted by the number of cores. Finally, the parallel DP algorithm is applied to a real-world, five-reservoir system in China. The results demonstrate the parallel efficiency and practical utility of the proposed methodology.

  5. Petascale self-consistent electromagnetic computations using scalable and accurate algorithms for complex structures

    NASA Astrophysics Data System (ADS)

    Cary, John R.; Abell, D.; Amundson, J.; Bruhwiler, D. L.; Busby, R.; Carlsson, J. A.; Dimitrov, D. A.; Kashdan, E.; Messmer, P.; Nieter, C.; Smithe, D. N.; Spentzouris, P.; Stoltz, P.; Trines, R. M.; Wang, H.; Werner, G. R.

    2006-09-01

    As the size and cost of particle accelerators escalate, high-performance computing plays an increasingly important role; optimization through accurate, detailed computermodeling increases performance and reduces costs. But consequently, computer simulations face enormous challenges. Early approximation methods, such as expansions in distance from the design orbit, were unable to supply detailed accurate results, such as in the computation of wake fields in complex cavities. Since the advent of message-passing supercomputers with thousands of processors, earlier approximations are no longer necessary, and it is now possible to compute wake fields, the effects of dampers, and self-consistent dynamics in cavities accurately. In this environment, the focus has shifted towards the development and implementation of algorithms that scale to large numbers of processors. So-called charge-conserving algorithms evolve the electromagnetic fields without the need for any global solves (which are difficult to scale up to many processors). Using cut-cell (or embedded) boundaries, these algorithms can simulate the fields in complex accelerator cavities with curved walls. New implicit algorithms, which are stable for any time-step, conserve charge as well, allowing faster simulation of structures with details small compared to the characteristic wavelength. These algorithmic and computational advances have been implemented in the VORPAL7 Framework, a flexible, object-oriented, massively parallel computational application that allows run-time assembly of algorithms and objects, thus composing an application on the fly.

  6. 33 CFR 117.311 - New Pass.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false New Pass. 117.311 Section 117.311... REGULATIONS Specific Requirements Florida § 117.311 New Pass. The drawspan for the State Road 789 Drawbridge... must be passed at anytime....

  7. Effect of multiple extrusion passes on zein

    USDA-ARS?s Scientific Manuscript database

    Zein was repeatedly processed up to seven times using a single screw extruder at a temperature of 145 °C and at approximately 15 grams per minute to determine the extent of degradation that occurs with multiple extrusion passes. SDS-PAGE shows that with the second pass, and each additional pass, the...

  8. Iterative pass optimization of sequence data.

    PubMed

    Wheeler, Ward C

    2003-06-01

    The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

  9. Iterative pass optimization of sequence data

    NASA Technical Reports Server (NTRS)

    Wheeler, Ward C.

    2003-01-01

    The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

  10. Iterative pass optimization of sequence data

    NASA Technical Reports Server (NTRS)

    Wheeler, Ward C.

    2003-01-01

    The problem of determining the minimum-cost hypothetical ancestral sequences for a given cladogram is known to be NP-complete. This "tree alignment" problem has motivated the considerable effort placed in multiple sequence alignment procedures. Wheeler in 1996 proposed a heuristic method, direct optimization, to calculate cladogram costs without the intervention of multiple sequence alignment. This method, though more efficient in time and more effective in cladogram length than many alignment-based procedures, greedily optimizes nodes based on descendent information only. In their proposal of an exact multiple alignment solution, Sankoff et al. in 1976 described a heuristic procedure--the iterative improvement method--to create alignments at internal nodes by solving a series of median problems. The combination of a three-sequence direct optimization with iterative improvement and a branch-length-based cladogram cost procedure, provides an algorithm that frequently results in superior (i.e., lower) cladogram costs. This iterative pass optimization is both computation and memory intensive, but economies can be made to reduce this burden. An example in arthropod systematics is discussed. c2003 The Willi Hennig Society. Published by Elsevier Science (USA). All rights reserved.

  11. Diabetes education via mobile text messaging.

    PubMed

    Wangberg, Silje C; Arsand, Eirik; Andersson, Niklas

    2006-01-01

    Living with diabetes makes great educational demands on a family. We have tested the feasibility of using the mobile phone short message service (SMS) for reaching people with diabetes information. We also assessed user satisfaction and perceived pros and cons of the medium through interviews. Eleven parents of children with type 1 diabetes received messages for 11 weeks. The parents were positive about the system and said that they would like to continue to use it. The pop-up reminding effect of SMS messages in busy everyday life was noted as positive. Some parents experienced the messages as somewhat intrusive, arriving too often and at inconvenient times. The parents also noted the potential of the messages to facilitate communication with their adolescent children. The inability to store all of the messages or to print them out were seen as major disadvantages. Overall, the SMS seems to hold promise as means of delivering diabetes information.

  12. Application of a Tsunami Warning Message Metric to refine NOAA NWS Tsunami Warning Messages

    NASA Astrophysics Data System (ADS)

    Gregg, C. E.; Johnston, D.; Sorensen, J.; Whitmore, P.

    2013-12-01

    In 2010, the U.S. National Weather Service (NWS) funded a three year project to integrate social science into their Tsunami Program. One of three primary requirements of the grant was to make improvements to tsunami warning messages of the NWS' two Tsunami Warning Centers- the West Coast/Alaska Tsunami Warning Center (WCATWC) in Palmer, Alaska and the Pacific Tsunami Warning Center (PTWC) in Ewa Beach, Hawaii. We conducted focus group meetings with a purposive sample of local, state and Federal stakeholders and emergency managers in six states (AK, WA, OR, CA, HI and NC) and two US Territories (US Virgin Islands and American Samoa) to qualitatively asses information needs in tsunami warning messages using WCATWC tsunami messages for the March 2011 Tohoku earthquake and tsunami event. We also reviewed research literature on behavioral response to warnings to develop a tsunami warning message metric that could be used to guide revisions to tsunami warning messages of both warning centers. The message metric is divided into categories of Message Content, Style, Order and Formatting and Receiver Characteristics. A message is evaluated by cross-referencing the message with the operational definitions of metric factors. Findings are then used to guide revisions of the message until the characteristics of each factor are met. Using findings from this project and findings from a parallel NWS Warning Tiger Team study led by T. Nicolini, the WCATWC implemented the first of two phases of revisions to their warning messages in November 2012. A second phase of additional changes, which will fully implement the redesign of messages based on the metric, is in progress. The resulting messages will reflect current state-of-the-art knowledge on warning message effectiveness. Here we present the message metric; evidence-based rational for message factors; and examples of previous, existing and proposed messages.

  13. Damage detection method based on operating deflection shape curvature extracted from dynamic response of a passing vehicle

    NASA Astrophysics Data System (ADS)

    Zhang, Yao; Lie, Seng Tjhen; Xiang, Zhihai

    2013-02-01

    This paper describes the development of a local damage detection method for beam and plate like structures based on operating deflection shape curvature extracted from dynamic response of a passing vehicle, which serves both as "exciter" and "message carrier". Based on the operating deflection shape curvature and the assumption that the intact structure is smooth and homogenous, a new damage detection algorithm called Global Filtering Method (GFM) is proposed. The new method using only information from damaged structures has been verified by both numerical simulations and experiments. Even if only using operating deflection shape curvatures at relatively few frequencies near the first natural frequency, not only local damage in beam could be detected in the numerical simulation, delamination as small as 8 mm in composite plate could also be detected in the laboratory. Compared with traditional methods using operating deflection shape data extracted from FRFs; it is time-saving, easier to implement and produces greater accuracy as it does not require many preinstalled sensors and solving eigenvector or singular value problems.

  14. Identification of SPAM messages using an approach inspired on the immune system.

    PubMed

    Guzella, T S; Mota-Santos, T A; Uchôa, J Q; Caminhas, W M

    2008-06-01

    In this paper, an immune-inspired model, named innate and adaptive artificial immune system (IA-AIS) is proposed and applied to the problem of identification of unsolicited bulk e-mail messages (SPAM). It integrates entities analogous to macrophages, B and T lymphocytes, modeling both the innate and the adaptive immune systems. An implementation of the algorithm was capable of identifying more than 99% of legitimate or SPAM messages in particular parameter configurations. It was compared to an optimized version of the naive Bayes classifier, which has been attained extremely high correct classification rates. It has been concluded that IA-AIS has a greater ability to identify SPAM messages, although the identification of legitimate messages is not as high as that of the implemented naive Bayes classifier.

  15. Evaluation of sexual communication message strategies.

    PubMed

    Evans, W Douglas; Davis, Kevin C; Umanzor, Cindy; Patel, Kajal; Khan, Munziba

    2011-05-20

    Parent-child communication about sex is an important proximal reproductive health outcome. But while campaigns to promote it such as the Parents Speak Up National Campaign (PSUNC) have been effective, little is known about how messages influence parental cognitions and behavior. This study examines which message features explain responses to sexual communication messages. We content analyzed 4 PSUNC ads to identify specific, measurable message and advertising execution features. We then develop quantitative measures of those features, including message strategies, marketing strategies, and voice and other stylistic features, and merged the resulting data into a dataset drawn from a national media tracking survey of the campaign. Finally, we conducted multivariable logistic regression models to identify relationships between message content and ad reactions/receptivity, and between ad reactions/receptivity and parents' cognitions related to sexual communication included in the campaign's conceptual model. We found that overall parents were highly receptive to the PSUNC ads. We did not find significant associations between message content and ad reactions/receptivity. However, we found that reactions/receptivity to specific PSUNC ads were associated with increased norms, self-efficacy, short- and long-term expectations about parent-child sexual communication, as theorized in the conceptual model. This study extends previous research and methods to analyze message content and reactions/receptivity. The results confirm and extend previous PSUNC campaign evaluation and provide further evidence for the conceptual model. Future research should examine additional message content features and the effects of reactions/receptivity.

  16. Evaluation of Sexual Communication Message Strategies

    PubMed Central

    2011-01-01

    Parent-child communication about sex is an important proximal reproductive health outcome. But while campaigns to promote it such as the Parents Speak Up National Campaign (PSUNC) have been effective, little is known about how messages influence parental cognitions and behavior. This study examines which message features explain responses to sexual communication messages. We content analyzed 4 PSUNC ads to identify specific, measurable message and advertising execution features. We then develop quantitative measures of those features, including message strategies, marketing strategies, and voice and other stylistic features, and merged the resulting data into a dataset drawn from a national media tracking survey of the campaign. Finally, we conducted multivariable logistic regression models to identify relationships between message content and ad reactions/receptivity, and between ad reactions/receptivity and parents' cognitions related to sexual communication included in the campaign's conceptual model. We found that overall parents were highly receptive to the PSUNC ads. We did not find significant associations between message content and ad reactions/receptivity. However, we found that reactions/receptivity to specific PSUNC ads were associated with increased norms, self-efficacy, short- and long-term expectations about parent-child sexual communication, as theorized in the conceptual model. This study extends previous research and methods to analyze message content and reactions/receptivity. The results confirm and extend previous PSUNC campaign evaluation and provide further evidence for the conceptual model. Future research should examine additional message content features and the effects of reactions/receptivity. PMID:21599875

  17. Message framing in social networking sites.

    PubMed

    Kao, Danny Tengti; Chuang, Shih-Chieh; Wang, Sui-Min; Zhang, Lei

    2013-10-01

    Online social networking sites represent significant new opportunities for Internet advertisers. However, results based on the real world cannot be generalized to all virtual worlds. In this research, the moderating effects of need for cognition (NFC) and knowledge were applied to examine the impact of message framing on attitudes toward social networking sites. A total of 216 undergraduates participated in the study. Results reveal that for social networking sites, while high-NFC individuals form more favorable attitudes toward negatively framed messages than positively framed messages, low-NFC individuals form more favorable attitudes toward positively framed messages than negatively framed messages. In addition, low-knowledge individuals demonstrate more favorable attitudes toward negatively framed messages than positively framed messages; however, the framing effect does not differentially affect the attitudes of high-knowledge individuals. Furthermore, the framing effect does not differentially affect the attitudes of high-NFC individuals with high knowledge. In contrast, low-NFC individuals with low knowledge hold more favorable attitudes toward positively framed messages than negatively framed messages.

  18. Portable and Transparent Message Compression in MPI Libraries to Improve the Performance and Scalability of Parallel Applications

    SciTech Connect

    Albonesi, David; Burtscher, Martin

    2009-04-17

    The goal of this project has been to develop a lossless compression algorithm for message-passing libraries that can accelerate HPC systems by reducing the communication time. Because both compression and decompression have to be performed in software in real time, the algorithm has to be extremely fast while still delivering a good compression ratio. During the first half of this project, they designed a new compression algorithm called FPC for scientific double-precision data, made the source code available on the web, and published two papers describing its operation, the first in the proceedings of the Data Compression Conference and the second in the IEEE Transactions on Computers. At comparable average compression ratios, this algorithm compresses and decompresses 10 to 100 times faster than BZIP2, DFCM, FSD, GZIP, and PLMI on the three architectures tested. With prediction tables that fit into the CPU's L1 data acache, FPC delivers a guaranteed throughput of six gigabits per second on a 1.6 GHz Itanium 2 system. The C source code and documentation of FPC are posted on-line and have already been downloaded hundreds of times. To evaluate FPC, they gathered 13 real-world scientific datasets from around the globe, including satellite data, crash-simulation data, and messages from HPC systems. Based on the large number of requests they received, they also made these datasets available to the community (with permission of the original sources). While FPC represents a great step forward, it soon became clear that its throughput was too slow for the emerging 10 gigabits per second networks. Hence, no speedup can be gained by including this algorithm in an MPI library. They therefore changed the aim of the second half of the project. Instead of implementing FPC in an MPI library, they refocused their efforts to develop a parallel compression algorithm to further boost the throughput. After all, all modern high-end microprocessors contain multiple CPUs on a single die

  19. Parallelized FVM algorithm for three-dimensional viscoelastic flows

    NASA Astrophysics Data System (ADS)

    Dou, H.-S.; Phan-Thien, N.

    A parallel implementation for the finite volume method (FVM) for three-dimensional (3D) viscoelastic flows is developed on a distributed computing environment through Parallel Virtual Machine (PVM). The numerical procedure is based on the SIMPLEST algorithm using a staggered FVM discretization in Cartesian coordinates. The final discretized algebraic equations are solved with the TDMA method. The parallelisation of the program is implemented by a domain decomposition strategy, with a master/slave style programming paradigm, and a message passing through PVM. A load balancing strategy is proposed to reduce the communications between processors. The three-dimensional viscoelastic flow in a rectangular duct is computed with this program. The modified Phan-Thien-Tanner (MPTT) constitutive model is employed for the equation system closure. Computing results are validated on the secondary flow problem due to non-zero second normal stress difference N2. Three sets of meshes are used, and the effect of domain decomposition strategies on the performance is discussed. It is found that parallel efficiency is strongly dependent on the grid size and the number of processors for a given block number. The convergence rate as well as the total efficiency of domain decomposition depends upon the flow problem and the boundary conditions. The parallel efficiency increases with increasing problem size for given block number. Comparing to two-dimensional flow problems, 3D parallelized algorithm has a lower efficiency owing to largely overlapped block interfaces, but the parallel algorithm is indeed a powerful means for large scale flow simulations.

  20. 78 FR 62657 - Proposed Information Collection; The Interagency Access Pass and Senior Pass Application Processes

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-10-22

    ... National Park Service Proposed Information Collection; The Interagency Access Pass and Senior Pass... Parks and Federal Recreation Lands Pass Program covers recreation opportunities on public lands managed... U.S. Forest Service. The passes provide U.S. citizens and visitors an affordable and convenient...

  1. 33 CFR 110.196 - Sabine Pass Channel, Sabine Pass, Tex.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Sabine Pass Channel, Sabine Pass, Tex. 110.196 Section 110.196 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY ANCHORAGES ANCHORAGE REGULATIONS Anchorage Grounds § 110.196 Sabine Pass Channel, Sabine Pass,...

  2. 33 CFR 110.196 - Sabine Pass Channel, Sabine Pass, Tex.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 33 Navigation and Navigable Waters 1 2011-07-01 2011-07-01 false Sabine Pass Channel, Sabine Pass, Tex. 110.196 Section 110.196 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY ANCHORAGES ANCHORAGE REGULATIONS Anchorage Grounds § 110.196 Sabine Pass Channel, Sabine Pass,...

  3. 33 CFR 110.196 - Sabine Pass Channel, Sabine Pass, Tex.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 33 Navigation and Navigable Waters 1 2014-07-01 2014-07-01 false Sabine Pass Channel, Sabine Pass, Tex. 110.196 Section 110.196 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY ANCHORAGES ANCHORAGE REGULATIONS Anchorage Grounds § 110.196 Sabine Pass Channel, Sabine Pass, Tex...

  4. 33 CFR 110.196 - Sabine Pass Channel, Sabine Pass, Tex.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 33 Navigation and Navigable Waters 1 2013-07-01 2013-07-01 false Sabine Pass Channel, Sabine Pass, Tex. 110.196 Section 110.196 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY ANCHORAGES ANCHORAGE REGULATIONS Anchorage Grounds § 110.196 Sabine Pass Channel, Sabine Pass, Tex...

  5. Coding for Parallel Links to Maximize the Expected Value of Decodable Messages

    NASA Technical Reports Server (NTRS)

    Klimesh, Matthew A.; Chang, Christopher S.

    2011-01-01

    When multiple parallel communication links are available, it is useful to consider link-utilization strategies that provide tradeoffs between reliability and throughput. Interesting cases arise when there are three or more available links. Under the model considered, the links have known probabilities of being in working order, and each link has a known capacity. The sender has a number of messages to send to the receiver. Each message has a size and a value (i.e., a worth or priority). Messages may be divided into pieces arbitrarily, and the value of each piece is proportional to its size. The goal is to choose combinations of messages to send on the links so that the expected value of the messages decodable by the receiver is maximized. There are three parts to the innovation: (1) Applying coding to parallel links under the model; (2) Linear programming formulation for finding the optimal combinations of messages to send on the links; and (3) Algorithms for assisting in finding feasible combinations of messages, as support for the linear programming formulation. There are similarities between this innovation and methods developed in the field of network coding. However, network coding has generally been concerned with either maximizing throughput in a fixed network, or robust communication of a fixed volume of data. In contrast, under this model, the throughput is expected to vary depending on the state of the network. Examples of error-correcting codes that are useful under this model but which are not needed under previous models have been found. This model can represent either a one-shot communication attempt, or a stream of communications. Under the one-shot model, message sizes and link capacities are quantities of information (e.g., measured in bits), while under the communications stream model, message sizes and link capacities are information rates (e.g., measured in bits/second). This work has the potential to increase the value of data returned from

  6. Steganographic embedding of a secret message in a video flow

    NASA Astrophysics Data System (ADS)

    Datcu, Octaviana; Dobre, Robert A.; Stanciu, Mihai

    2016-12-01

    The paper presents a steganographic method which hides a secret message in a video flow. The secret message represents the result of a chaos-based encryption scheme. One of the flaws which make the algorithm unpractical for real-time applications is that, while the elements of the plain-message are represented using 8 bits (ASCII characters) the corresponding encrypted values need to be represented using 16 bits. Since the pixels of a typical image are represented using 24 bits (8 bits for each color component), each encrypted character fits in only one pixel. Moreover, since the resolution of today's video materials is very large, the pixel previously established to carry in its evolution the hidden content will not be obvious to unaware spectators, but only to the one which knows its coordinates. In addition to the steganographic procedure, the work presents preliminary results on the degree of pseudo-randomness of video flows. The study is based upon the idea behind Lyapunov exponents. The evolution of two pixels which initially differ only by the minimum possible value (the color representation's resolution) is followed for a large number of video frames. The distance between such points, for pseudo-random behavior, is known to evolve over time in a Gaussian manner. A Kolmogorov-Smirnov statistic is computed and illustrated in order to conclude over the provenience of the data series representing the evolution of the distance between the two initially neighboring pixels from a standard normal law.

  7. A Computerized Communication Message Preparation Program that "Learns" the User's Vocabulary.

    ERIC Educational Resources Information Center

    Scull, John; Hill, Linda

    1988-01-01

    "Cued Typing" is a computerized communication message preparation program, written for Apple II Plus, using frequency-based prediction algorithms and menu selection to reduce word cost while maintaining vocabulary flexibility. "Cued Typing" was more efficient than letter-by-letter typing, but word cost was still quite high, and…

  8. Messages about Sexuality: An Ecological Perspective

    ERIC Educational Resources Information Center

    Boone, Tanya L.

    2015-01-01

    The goal of this two-part study was to identify the perceived influence of sexuality messages from parents, peers, school and the media--four microsystems within the Ecological Model--on emerging adult US college women's sexual attitudes. Findings suggest that parents were the most likely source of the message to "remain abstinent until…

  9. Should We Ban Instant Messaging In School?

    ERIC Educational Resources Information Center

    Texley, Sharon; DeGennaro, Donna

    2005-01-01

    This article is a brief debate on the pros and cons of allowing students to use instant messaging (IM) in school. On one hand, teenagers' desire to socialize can overcome other priorities and schools may set policies to ban instant messaging. The contrary view is that schools should embrace the IM technology being popularized by youth and find…

  10. 78 FR 52166 - Quantitative Messaging Research

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-22

    ... qualitative message testing research (for which CFTC received fast-track OMB approval) and is necessary to... the survey as well as other qualitative research. Findings from the summary report will be used to... COMMISSION Quantitative Messaging Research AGENCY: Commodity Futures Trading Commission. ACTION: Notice...

  11. Intervening in Family Systems with Observer Messages.

    ERIC Educational Resources Information Center

    Breunlin, Douglas C.; Cade, Brian

    1981-01-01

    Presents an approach to family therapy where a group of observers becomes part of a therapeutic team by introducing strategic messages into the sessions. Messages are described in terms of five components: function, target, timing, content, and delivery. Suggests guidelines for effective team functioning and discusses implications for training.…

  12. Memorable Messages for Navigating College Life

    ERIC Educational Resources Information Center

    Nazione, Samantha; Laplante, Carolyn; Smith, Sandi W.; Cornacchione, Jennifer; Russell, Jessica; Stohl, Cynthia

    2011-01-01

    This manuscript details an investigation of memorable messages that help students navigate college life using a control theory framework. Researchers conducted face-to-face interviews with 61 undergraduate students who recalled a specific memorable message that helped them as they navigated college. Results of this formative study show the…

  13. Memorable Messages for Navigating College Life

    ERIC Educational Resources Information Center

    Nazione, Samantha; Laplante, Carolyn; Smith, Sandi W.; Cornacchione, Jennifer; Russell, Jessica; Stohl, Cynthia

    2011-01-01

    This manuscript details an investigation of memorable messages that help students navigate college life using a control theory framework. Researchers conducted face-to-face interviews with 61 undergraduate students who recalled a specific memorable message that helped them as they navigated college. Results of this formative study show the…

  14. Message T-Shirts and School Safety

    ERIC Educational Resources Information Center

    Workman, Jane E.; Webb, Ashley L.; Freeburg, Beth Winfrey

    2011-01-01

    The purpose of this study was to investigate message T-shirts and school safety as rated by high school teachers (n = 47) and students (n = 275). Wearing message T-shirts displaying offensive statements/images may contribute to perceptions of a psychologically and/or physically unsafe school environment. Participants gave their impressions of 12…

  15. Messages about Sexuality: An Ecological Perspective

    ERIC Educational Resources Information Center

    Boone, Tanya L.

    2015-01-01

    The goal of this two-part study was to identify the perceived influence of sexuality messages from parents, peers, school and the media--four microsystems within the Ecological Model--on emerging adult US college women's sexual attitudes. Findings suggest that parents were the most likely source of the message to "remain abstinent until…

  16. Persuasive email messages for patient communication.

    PubMed

    Walji, Muhammad; Johnson-Throop, Kathy; Johnson, Todd; Bernstam, Elmer; Zhang, Jiajie

    2005-01-01

    To improve health and reduce costs, we need to encourage patients to make better health care decisions. Since email is widely available, it may be useful for patient-directed interventions. However, we know little about how the contents of an email message can influence a health-related decision. We propose a model to understand how patients may process persuasive email messages.

  17. Maintaining High Assurance in Asynchronous Messaging

    DTIC Science & Technology

    2015-10-24

    assurance environment. Index Terms—Asynchronous Communication, Publish Subscribe, IT Security, Encryption, Key Management I. INTRODUCTION...synchronous communication take place in or how these relate to each other. It is possible to implement synchronous communication using an asynchronous...continuing its processing. At the completion of message transmission, the sender does not know when or whether the receiver received it . The message

  18. Relational Messages Associated with Nonverbal Behaviors.

    ERIC Educational Resources Information Center

    Burgoon, Judee K.; And Others

    Based on the assumptions that relational messages are multidimensional and that they are largely communicated by nonverbal cues, this experiment manipulated five nonverbal cues--eye contact, proximity, body lean, smiling, and touch--to determine what meanings they convey along four relational message dimensions: emotionality/arousal/composure,…

  19. Hidden Messages: Instructional Materials for Investigating Culture.

    ERIC Educational Resources Information Center

    Finkelstein, Barbara, Ed.; Eder, Elizabeth K., Ed.

    This book, intended to be used in the middle and high school classroom, provides teachers with unique ideas and lesson plans for exploring culture and adding a multicultural perspective to diverse subjects. "Hidden messages" are the messages of culture that are entwined in everyday lives, but which are seldom recognized or appreciated…

  20. Text Messaging for Student Communication and Voting

    ERIC Educational Resources Information Center

    McClean, Stephen; Hagan, Paul; Morgan, Jason

    2010-01-01

    Text messaging has gained widespread popularity in higher education as a communication tool and as a means of engaging students in the learning process. In this study we report on the use of text messaging in a large, year-one introductory chemistry module where students were encouraged to send questions and queries to a dedicated text number both…

  1. Correlating Log Messages for System Diagnostics

    SciTech Connect

    Gunasekaran, Raghul; Dillow, David A; Shipman, Galen M; Maxwell, Don E; Hill, Jason J; Park, Byung H; Geist, Al

    2010-01-01

    In large-scale computing systems, the sheer volume of log data generated presents daunting challenges for debugging and monitoring of these systems. The Oak Ridge Leadership Computing Facility s premier simulation platform, the Cray XT5 known as Jaguar, can generate a few hundred thousand log entries in less than a minute for many system level events. Determining the root cause of such system events requires analyzing and interpretation of a large number of log messages. Most often, the log messages are best understood when they are interpreted collectively rather than individually. In this paper, we present our approach to interpreting log messages by identifying their commonalities and grouping them into clusters. Given a set of log messages within a time interval, we group the messages based on source, target, and/or error type, and correlate the messages with hardware and application information. We monitor the Lustre log messages in the XT5 console log and show that such grouping of log messages assists in detecting the source of system events. By intelligent grouping and correlation of events in the log, we are able to provide system administrators with meaningful information in a concise format for root cause analysis.

  2. A De-centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

    NASA Technical Reports Server (NTRS)

    Arora, Manish; Das, Sajal K.; Biswas, Rupak

    2002-01-01

    In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is decentralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

  3. A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

    NASA Technical Reports Server (NTRS)

    Arora, Manish; Das, Sajal K.; Biswas, Rupak; Biegel, Bryan (Technical Monitor)

    2002-01-01

    In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

  4. Message from the Editor Message from the Editor

    NASA Astrophysics Data System (ADS)

    Thomas, Paul

    2012-04-01

    Whilst travelling to Vienna to hand over the Editorship of Nuclear Fusion to Ron Stambaugh, I jotted down a few ideas to put in a farewell message. Somewhat unsurprisingly, I find them almost identical to the remarks that Chris Schueller made in handing over to me five years ago. Both of us served in this role for five years, which seems like a good timescale to replace presidents and editors alike; just to allow a fresh approach. In addition, since I have been directly involved in ITER, I have found it increasingly difficult, due to time pressure, to give the journal the attention that it deserves. Therefore, I am very pleased that Ron Stambaugh has agreed to take over as Editor. Not only does he bring the experience as a leading figure in the US fusion programme but, in addition, he has all the contacts, worldwide, from his leadership of the ITPA. I am completely assured that the journal is in a highly competent pair of hands. Such a farewell should not lack my heartfelt thanks to all of those who have made being Editor of Nuclear Fusion so enjoyable and stimulating; readership, authors, referees, the Editorial Board and the NF Office alike. I wish Ron all the best for his tenure and have offered such help and support as I am able to give.

  5. Pass-transistor very large scale integration

    NASA Technical Reports Server (NTRS)

    Maki, Gary K. (Inventor); Bhatia, Prakash R. (Inventor)

    2004-01-01

    Logic elements are provided that permit reductions in layout size and avoidance of hazards. Such logic elements may be included in libraries of logic cells. A logical function to be implemented by the logic element is decomposed about logical variables to identify factors corresponding to combinations of the logical variables and their complements. A pass transistor network is provided for implementing the pass network function in accordance with this decomposition. The pass transistor network includes ordered arrangements of pass transistors that correspond to the combinations of variables and complements resulting from the logical decomposition. The logic elements may act as selection circuits and be integrated with memory and buffer elements.

  6. Photoacoustic Soot Spectrometer (PASS) Instrument Handbook

    SciTech Connect

    Dubey, M; Springston, S; Koontz, A; Aiken, A

    2013-01-17

    The photoacoustic soot spectrometer (PASS) measures light absorption by aerosol particles. As the particles pass through a laser beam, the absorbed energy heats the particles and in turn the surrounding air, which sets off a pressure wave that can be detected by a microphone. The PASS instruments deployed by ARM can also simultaneously measure the scattered laser light at three wavelengths and therefore provide a direct measure of the single-scattering albedo. The Operator Manual for the PASS-3100 is included here with the permission of Droplet Measurement Technologies, the instrument’s manufacturer.

  7. Effects of color scheme and message lines of variable message signs on driver performance.

    PubMed

    Lai, Chien-Jung

    2010-07-01

    The advancement in variable message signs (VMS) technology has made it possible to display message with various formats. This study presented an ergonomic study on the message design of Chinese variable message signs on urban roads in Taiwan. Effects of color scheme (one, two and three) and number of message lines (single, double and triple) of VMS on participants' response performance were investigated through a laboratory experiment. Results of analysis showed that color scheme and number of message lines are significant factors for participants' response time to VMS. Participants responded faster for two-color than for one- and three-color scheme. Participants also took less response time for double line message than for single and triple line message. Both color scheme and number of message lines had no significant effect on participants' response accuracy. The preference survey after the experiment showed that most participants preferred two-color scheme and double line message to the other combinations. The results can assist in adopting appropriate color scheme and number of message lines of Chinese VMS. Copyright 2009 Elsevier Ltd. All rights reserved.

  8. Message communications of particular message types between compute nodes using DMA shadow buffers

    DOEpatents

    Blocksome, Michael A.; Parker, Jeffrey J.

    2010-11-16

    Message communications of particular message types between compute nodes using DMA shadow buffers includes: receiving a buffer identifier specifying an application buffer having a message of a particular type for transmission to a target compute node through a network; selecting one of a plurality of shadow buffers for a DMA engine on the compute node for storing the message, each shadow buffer corresponding to a slot of an injection FIFO buffer maintained by the DMA engine; storing the message in the selected shadow buffer; creating a data descriptor for the message stored in the selected shadow buffer; injecting the data descriptor into the slot of the injection FIFO buffer corresponding to the selected shadow buffer; selecting the data descriptor from the injection FIFO buffer; and transmitting the message specified by the selected data descriptor through the data communications network to the target compute node.

  9. Improving the Effectiveness of Fundraising Messages: The Impact of Charity Goal Attainment, Message Framing, and Evidence on Persuasion

    ERIC Educational Resources Information Center

    Das, Enny; Kerkhof, Peter; Kuiper, Joyce

    2008-01-01

    This experimental study assessed the effectiveness of fundraising messages. Based on recent findings regarding the effects of message framing and evidence, effective fundraising messages should combine abstract, statistical information with a negative message frame and anecdotal evidence with a positive message frame. In addition, building on…

  10. Improving the Effectiveness of Fundraising Messages: The Impact of Charity Goal Attainment, Message Framing, and Evidence on Persuasion

    ERIC Educational Resources Information Center

    Das, Enny; Kerkhof, Peter; Kuiper, Joyce

    2008-01-01

    This experimental study assessed the effectiveness of fundraising messages. Based on recent findings regarding the effects of message framing and evidence, effective fundraising messages should combine abstract, statistical information with a negative message frame and anecdotal evidence with a positive message frame. In addition, building on…

  11. LSB Based Quantum Image Steganography Algorithm

    NASA Astrophysics Data System (ADS)

    Jiang, Nan; Zhao, Na; Wang, Luo

    2016-01-01

    Quantum steganography is the technique which hides a secret message into quantum covers such as quantum images. In this paper, two blind LSB steganography algorithms in the form of quantum circuits are proposed based on the novel enhanced quantum representation (NEQR) for quantum images. One algorithm is plain LSB which uses the message bits to substitute for the pixels' LSB directly. The other is block LSB which embeds a message bit into a number of pixels that belong to one image block. The extracting circuits can regain the secret message only according to the stego cover. Analysis and simulation-based experimental results demonstrate that the invisibility is good, and the balance between the capacity and the robustness can be adjusted according to the needs of applications.

  12. Information Theory, Inference and Learning Algorithms

    NASA Astrophysics Data System (ADS)

    Mackay, David J. C.

    2003-10-01

    Information theory and inference, often taught separately, are here united in one entertaining textbook. These topics lie at the heart of many exciting areas of contemporary science and engineering - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics, and cryptography. This textbook introduces theory in tandem with applications. Information theory is taught alongside practical communication systems, such as arithmetic coding for data compression and sparse-graph codes for error-correction. A toolbox of inference techniques, including message-passing algorithms, Monte Carlo methods, and variational approximations, are developed alongside applications of these tools to clustering, convolutional codes, independent component analysis, and neural networks. The final part of the book describes the state of the art in error-correcting codes, including low-density parity-check codes, turbo codes, and digital fountain codes -- the twenty-first century standards for satellite communications, disk drives, and data broadcast. Richly illustrated, filled with worked examples and over 400 exercises, some with detailed solutions, David MacKay's groundbreaking book is ideal for self-learning and for undergraduate or graduate courses. Interludes on crosswords, evolution, and sex provide entertainment along the way. In sum, this is a textbook on information, communication, and coding for a new generation of students, and an unparalleled entry point into these subjects for professionals in areas as diverse as computational biology, financial engineering, and machine learning.

  13. 14 CFR 189.3 - Kinds of messages accepted or relayed.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... address: (1) Distress messages and distress traffic. (2) Messages concerning the safety of human life. (3) Flight safety messages concerning— (i) Air traffic control, including— (A) Messages concerning...

  14. 78 FR 25432 - Sabine Pass LNG, L.P., Sabine Pass Liquefaction, LLC; Notice of Availability of the Environmental...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-01

    ... Energy Regulatory Commission Sabine Pass LNG, L.P., Sabine Pass Liquefaction, LLC; Notice of Availability... Sabine Pass Sabine Pass LNG, L.P. and Sabine Pass Liquefaction, LLC (Sabine Pass) in the above-referenced... construction at the existing Sabine Pass LNG terminal in Cameron Parish, Louisiana. The EA assesses the...

  15. Message Variability and Heterogeneity: A Core Challenge for Communication Research

    PubMed Central

    Slater, Michael D.; Peter, Jochen; Valkenberg, Patti

    2015-01-01

    Messages are central to human social experience, and pose key conceptual and methodological challenges in the study of communication. In response to these challenges, we outline a systematic approach to conceptualizing, operationalizing, and analyzing messages. At the conceptual level, we distinguish between two core aspects of messages: message variability (the defined and operationalized features of messages) and message heterogeneity (the undefined and unmeasured features of messages), and suggest preferred approaches to defining message variables. At the operational level, we identify message sampling, selection, and research design strategies responsive to issues of message variability and heterogeneity in experimental and survey research. At the analytical level, we highlight effective techniques to deal with message variability and heterogeneity. We conclude with seven recommendations to increase rigor in the study of communication through appropriately addressing the challenges presented by messages. PMID:26681816

  16. Global Identification of Protein Post-translational Modifications in a Single-Pass Database Search.

    PubMed

    Shortreed, Michael R; Wenger, Craig D; Frey, Brian L; Sheynkman, Gloria M; Scalf, Mark; Keller, Mark P; Attie, Alan D; Smith, Lloyd M

    2015-11-06

    Bottom-up proteomics database search algorithms used for peptide identification cannot comprehensively identify post-translational modifications (PTMs) in a single-pass because of high false discovery rates (FDRs). A new approach to database searching enables global PTM (G-PTM) identification by exclusively looking for curated PTMs, thereby avoiding the FDR penalty experienced during conventional variable modification searches. We identified over 2200 unique, high-confidence modified peptides comprising 26 different PTM types in a single-pass database search.

  17. Communicating Concepts about Altruism in Interstellar Messages

    NASA Astrophysics Data System (ADS)

    Vakoch, Douglas A.

    2002-01-01

    This project identifies key principles of altruism that can be translated into interstellar messages for communication with extraterrestrial intelligence. The message contents will focus specifically on the evolution of altruism, drawing on recent insights in evolutionary biology, with particular emphasis on sociobiological accounts of kin selection and reciprocal altruism. This focus on altruism for message contents has several advantages. First, the subject can be translated into interstellar messages both via an existing formal interstellar language and via pictorial messages. For example, aspects of reciprocal altruism can be described through mathematical modeling, such as game theoretic approaches, which in turn can be described readily in the interstellar language Lincos. Second, concentrating on altruism as a message content may facilitate communications with extraterrestrial intelligence. Some scientists have argued that humans may be expected to communicate something about their moral status and development in an exchange with extraterrestrials. One of the most salient ways that terrestrial and extraterrestrial civilizations might be expected to evaluate one another is in terms of ethical motivations. Indeed, current search strategies assume some measure of altruism on the part of transmitting civilizations; with no guarantee of a response, the other civilization would be providing information to us with no direct payoff. Thus, concepts about altruism provide an appropriate content for interstellar messages, because the concepts themselves might be understood by extraterrestrial civilizations.

  18. Dynamic hybrid algorithms for MAP inference in discrete MRFs.

    PubMed

    Alahari, Karteek; Kohli, Pushmeet; Torr, Philip H S

    2010-10-01

    In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multilabel energy functions arising from discrete mrfs or crfs. These methods are motivated by the observations that the performance of minimization algorithms depends on: 1) the initialization used for the primal and dual variables and 2) the number of primal variables involved in the energy function. Our first method (dynamic alpha-expansion) works by "recycling" results from previous problem instances. The second method simplifies the energy function by "reducing" the number of unknown variables present in the problem. Further, we show that it can also be used to generate a good initialization for the dynamic alpha-expansion algorithm by "reusing" dual variables. We test the performance of our methods on energy functions encountered in the problems of stereo matching and color and object-based segmentation. Experimental results show that our methods achieve a substantial improvement in the performance of alpha-expansion, as well as other popular algorithms such as sequential tree-reweighted message passing and max-product belief propagation. We also demonstrate the applicability of our schemes for certain higher order energy functions, such as the one described in [1], for interactive texture-based image and video segmentation. In most cases, we achieve a 10-15 times speed-up in the computation time. Our modified alpha-expansion algorithm provides similar performance to Fast-PD, but is conceptually much simpler. Both alpha-expansion and Fast-PD can be made orders of magnitude faster when used in conjunction with the "reduce" scheme proposed in this paper.

  19. 33 CFR 117.484 - Pass Manchac.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Pass Manchac. 117.484 Section 117.484 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.484 Pass Manchac. The draw of the...

  20. 33 CFR 117.303 - Matlacha Pass.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Matlacha Pass. 117.303 Section 117.303 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.303 Matlacha Pass. The draw of the...

  1. 33 CFR 117.487 - Pierre Pass.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 33 Navigation and Navigable Waters 1 2010-07-01 2010-07-01 false Pierre Pass. 117.487 Section 117.487 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.487 Pierre Pass. The draw of the S70...

  2. 33 CFR 117.303 - Matlacha Pass.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 33 Navigation and Navigable Waters 1 2011-07-01 2011-07-01 false Matlacha Pass. 117.303 Section 117.303 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.303 Matlacha Pass. The draw of the SR78...

  3. 33 CFR 117.303 - Matlacha Pass.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 33 Navigation and Navigable Waters 1 2012-07-01 2012-07-01 false Matlacha Pass. 117.303 Section 117.303 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.303 Matlacha Pass. The draw of the SR78...

  4. 33 CFR 117.303 - Matlacha Pass.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 33 Navigation and Navigable Waters 1 2013-07-01 2013-07-01 false Matlacha Pass. 117.303 Section 117.303 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.303 Matlacha Pass. The draw of the SR78...

  5. 33 CFR 117.484 - Pass Manchac.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 33 Navigation and Navigable Waters 1 2014-07-01 2014-07-01 false Pass Manchac. 117.484 Section 117.484 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.484 Pass Manchac. The draw of the Canadian...

  6. 33 CFR 117.487 - Pierre Pass.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 33 Navigation and Navigable Waters 1 2012-07-01 2012-07-01 false Pierre Pass. 117.487 Section 117.487 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.487 Pierre Pass. The draw of the S70 bridge...

  7. 33 CFR 117.303 - Matlacha Pass.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 33 Navigation and Navigable Waters 1 2014-07-01 2014-07-01 false Matlacha Pass. 117.303 Section 117.303 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.303 Matlacha Pass. The draw of the SR78...

  8. 33 CFR 117.487 - Pierre Pass.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 33 Navigation and Navigable Waters 1 2011-07-01 2011-07-01 false Pierre Pass. 117.487 Section 117.487 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.487 Pierre Pass. The draw of the S70 bridge...

  9. 33 CFR 117.487 - Pierre Pass.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 33 Navigation and Navigable Waters 1 2014-07-01 2014-07-01 false Pierre Pass. 117.487 Section 117.487 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.487 Pierre Pass. The draw of the S70 bridge...

  10. 33 CFR 117.484 - Pass Manchac.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 33 Navigation and Navigable Waters 1 2012-07-01 2012-07-01 false Pass Manchac. 117.484 Section 117.484 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.484 Pass Manchac. The draw of the Canadian...

  11. 33 CFR 117.484 - Pass Manchac.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 33 Navigation and Navigable Waters 1 2013-07-01 2013-07-01 false Pass Manchac. 117.484 Section 117.484 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.484 Pass Manchac. The draw of the Canadian...

  12. 33 CFR 117.487 - Pierre Pass.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 33 Navigation and Navigable Waters 1 2013-07-01 2013-07-01 false Pierre Pass. 117.487 Section 117.487 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.487 Pierre Pass. The draw of the S70 bridge...

  13. 33 CFR 117.484 - Pass Manchac.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 33 Navigation and Navigable Waters 1 2011-07-01 2011-07-01 false Pass Manchac. 117.484 Section 117.484 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Louisiana § 117.484 Pass Manchac. The draw of the Canadian...

  14. 33 CFR 117.311 - New Pass.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 33 Navigation and Navigable Waters 1 2011-07-01 2011-07-01 false New Pass. 117.311 Section 117.311 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.311 New Pass. The drawspan for the State Road 789 Drawbridge...

  15. 33 CFR 117.311 - New Pass.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 33 Navigation and Navigable Waters 1 2013-07-01 2013-07-01 false New Pass. 117.311 Section 117.311 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.311 New Pass. The drawspan for the State Road 789 Drawbridge...

  16. 33 CFR 117.311 - New Pass.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 33 Navigation and Navigable Waters 1 2012-07-01 2012-07-01 false New Pass. 117.311 Section 117.311 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.311 New Pass. The drawspan for the State Road 789 Drawbridge...

  17. 33 CFR 117.311 - New Pass.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 33 Navigation and Navigable Waters 1 2014-07-01 2014-07-01 false New Pass. 117.311 Section 117.311 Navigation and Navigable Waters COAST GUARD, DEPARTMENT OF HOMELAND SECURITY BRIDGES DRAWBRIDGE OPERATION REGULATIONS Specific Requirements Florida § 117.311 New Pass. The drawspan for the State Road 789 Drawbridge...

  18. Multifrequency, single pass free electron laser

    DOEpatents

    Szoke, Abraham; Prosnitz, Donald

    1985-01-01

    A method for simultaneous amplification of laser beams with a sequence of frequencies in a single pass, using a relativistic beam of electrons grouped in a sequence of energies corresponding to the sequence of laser beam frequencies. The method allows electrons to pass from one potential well or "bucket" to another adjacent bucket, thus increasing efficiency of trapping and energy conversion.

  19. On sampling band-pass signals

    NASA Technical Reports Server (NTRS)

    Sadr, R.; Shahshahani, M.

    1989-01-01

    Four techniques for uniform sampling of band-bass signals are examined. The in-phase and quadrature components of the band-pass signal are computed in terms of the samples of the original band-pass signal. The relative implementation merits of these techniques are discussed with reference to the Deep Space Network (DSN).

  20. UAVSAR: Airborne L-band Radar for Repeat Pass Interferometry

    NASA Technical Reports Server (NTRS)

    Moes, Timothy R.

    2009-01-01

    The primary objectives of the UAVSAR Project were to: a) develop a miniaturized polarimetric L-band synthetic aperture radar (SAR) for use on an unmanned aerial vehicle (UAV) or piloted vehicle. b) develop the associated processing algorithms for repeat-pass differential interferometric measurements using a single antenna. c) conduct measurements of geophysical interest, particularly changes of rapidly deforming surfaces such as volcanoes or earthquakes. Two complete systems were developed. Operational Science Missions began on February 18, 2009 ... concurrent development and testing of the radar system continues.

  1. Single pass Doppler positioning for Search and Rescue satellite missions

    NASA Technical Reports Server (NTRS)

    Schmid, P. E.; Vonbun, F. O.; Lynn, J. J.

    1976-01-01

    This paper describes the implementation of beacon location experiments involving the NASA Nimbus-6 and the Amateur Satellite Corporation (AMSAT) Oscar-6 and Oscar-7 spacecraft. The purpose of these experiments is to demonstrate the feasibility of determining the geographical location of a low power VHF 'distress beacon' via satellite. Doppler data collected during satellite passes is reduced in a mini-computer by means of a simple algorithm resulting in the simultaneous recovery of the unknown receiver coordinates and the unknown Doppler bias frequency. Results indicate point positioning to within a few kilometers - which is within the required accuracies for the positioning of downed aircraft for Search/Rescue missions.

  2. Single pass Doppler positioning for Search and Rescue satellite missions

    NASA Technical Reports Server (NTRS)

    Schmid, P. E.; Vonbun, F. O.; Lynn, J. J.

    1976-01-01

    This paper describes the implementation of beacon location experiments involving the NASA Nimbus-6 and the Amateur Satellite Corporation (AMSAT) Oscar-6 and Oscar-7 spacecraft. The purpose of these experiments is to demonstrate the feasibility of determining the geographical location of a low power VHF 'distress beacon' via satellite. Doppler data collected during satellite passes is reduced in a mini-computer by means of a simple algorithm resulting in the simultaneous recovery of the unknown receiver coordinates and the unknown Doppler bias frequency. Results indicate point positioning to within a few kilometers - which is within the required accuracies for the positioning of downed aircraft for Search/Rescue missions.

  3. Vehicle passes detector based on multi-sensor analysis

    NASA Astrophysics Data System (ADS)

    Bocharov, D.; Sidorchuk, D.; Konovalenko, I.; Koptelov, I.

    2015-02-01

    The study concerned deals with a new approach to the problem of detecting vehicle passes in vision-based automatic vehicle classification system. Essential non-affinity image variations and signals from induction loop are the events that can be considered as detectors of an object presence. We propose several vehicle detection techniques based on image processing and induction loop signal analysis. Also we suggest a combined method based on multi-sensor analysis to improve vehicle detection performance. Experimental results in complex outdoor environments show that the proposed multi-sensor algorithm is effective for vehicles detection.

  4. When message-frame fits salient cultural-frame, messages feel more persuasive.

    PubMed

    Uskul, Ayse K; Oyserman, Daphna

    2010-03-01

    The present study examines the persuasive effects of tailored health messages comparing those tailored to match (versus not match) both chronic cultural frame and momentarily salient cultural frame. Evidence from two studies (Study 1: n = 72 European Americans; Study 2: n = 48 Asian Americans) supports the hypothesis that message persuasiveness increases when chronic cultural frame, health message tailoring and momentarily salient cultural frame all match. The hypothesis was tested using a message about health risks of caffeine consumption among individuals prescreened to be regular caffeine consumers. After being primed for individualism, European Americans who read a health message that focused on the personal self were more likely to accept the message-they found it more persuasive, believed they were more at risk and engaged in more message-congruent behaviour. These effects were also found among Asian Americans who were primed for collectivism and who read a health message that focused on relational obligations. The findings point to the importance of investigating the role of situational cues in persuasive effects of health messages and suggest that matching content to primed frame consistent with the chronic frame may be a way to know what to match messages to.

  5. The Zen Scavenger Hunt: Constructing and Presenting Persuasive Messages

    ERIC Educational Resources Information Center

    Hamilton, Heidi

    2017-01-01

    Courses: Persuasion; Persuasive Speaking. Objectives: Students will demonstrate the ability to apply persuasive concepts in constructing persuasive messages creatively, and students will present and analyze their persuasive messages.

  6. Cockpit Interfaces, Displays, and Alerting Messages for the Interval Management Alternative Clearances (IMAC) Experiment

    NASA Technical Reports Server (NTRS)

    Baxley, Brian T.; Palmer, Michael T.; Swieringa, Kurt A.

    2015-01-01

    This document describes the IM cockpit interfaces, displays, and alerting capabilities that were developed for and used in the IMAC experiment, which was conducted at NASA Langley in the summer of 2015. Specifically, this document includes: (1) screen layouts for each page of the interface; (2) step-by-step instructions for data entry, data verification and input error correction; (3) algorithm state messages and error condition alerting messages; (4) aircraft speed guidance and deviation indications; and (5) graphical display of the spatial relationships between the Ownship aircraft and the Target aircraft. The controller displays for IM will be described in a separate document.

  7. Risk-based scheduling of multiple search passes for UUVs

    NASA Astrophysics Data System (ADS)

    Baylog, John G.; Wettergren, Thomas A.

    2016-05-01

    This paper addresses selected computational aspects of collaborative search planning when multiple search agents seek to find hidden objects (i.e. mines) in operating environments where the detection process is prone to false alarms. A Receiver Operator Characteristic (ROC) analysis is applied to construct a Bayesian cost objective function that weighs and combines missed detection and false alarm probabilities. It is shown that for fixed ROC operating points and a validation criterion consisting of a prerequisite number of detection outcomes, an interval exists in the number of conducted search passes over which the risk objective function is supermodular. We show that this property is not retained beyond validation criterion boundaries. We investigate the use of greedy algorithms for distributing search effort and, in particular, examine the double greedy algorithm for its applicability under conditions of varying criteria. Numerical results are provided to demonstrate the effectiveness of the approach.

  8. P-RnaPredict--a parallel evolutionary algorithm for RNA folding: effects of pseudorandom number quality.

    PubMed

    Wiese, Kay C; Hendriks, Andrew; Deschênes, Alain; Ben Youssef, Belgacem

    2005-09-01

    This paper presents a fully parallel version of RnaPredict, a genetic algorithm (GA) for RNA secondary structure prediction. The research presented here builds on previous work and examines the impact of three different pseudorandom number generators (PRNGs) on the GA's performance. The three generators tested are the C standard library PRNG RAND, a parallelized multiplicative congruential generator (MCG), and a parallelized Mersenne Twister (MT). A fully parallel version of RnaPredict using the Message Passing Interface (MPI) was implemented on a 128-node Beowulf cluster. The PRNG comparison tests were performed with known structures whose sequences are 118, 122, 468, 543, and 556 nucleotides in length. The effects of the PRNGs are investigated and the predicted structures are compared to known structures. Results indicate that P-RnaPredict demonstrated good prediction accuracy, particularly so for shorter sequences.

  9. An Interpersonal Approach to Writing Negative Messages.

    ERIC Educational Resources Information Center

    Salerno, Douglas

    1986-01-01

    Examines commonly held notions about writing negative messages and suggests that these notions could be improved by incorporating research in audience analysis and interpersonal communication. Argues that letter writing is not simply information transfer. (MS)

  10. Text messaging is a useful reminder tool.

    PubMed

    Balzer, Ben W R; Kelly, Patrick J; Hazell, Philip; Paxton, Karen; Hawke, Catherine; Steinbeck, Katharine S

    2014-07-01

    Longitudinal studies of adolescents must be 'adolescent-friendly', to collect data and to encourage maintenance in the study cohort. Text messaging may offer a feasible means to do both. Adolescents in the Adolescent Rural Cohort, Hormones and Health, Education, Environments and Relationships (ARCHER) study (n=342) are sent automated text messages every 3 months, prompting biological specimen collection. A total of 99.2% of participants (or their parents) owned a mobile phone, of which 89.1% of participants responded to text messages and 97.3% of intended urine samples were collected. The average time to provide a urine sample after prompting correlated with time to reply to Short Message Service (SMS). This study shows SMS can be used effectively in longitudinal research involving adolescents and is feasible and useful as a reminder tool for regular biological specimen collection.

  11. Books about Teen Parents: Messages and Omissions.

    ERIC Educational Resources Information Center

    Davis, Joy B.; MacGillivray, Laurie

    2001-01-01

    Examines narratives and novels written for young adults that deal with teenage pregnancy and parenting. Discusses eight common messages found in 17 such short stories and books, and notes three areas of significant silence. (SR)

  12. Understanding Messages in a Diagnostic Domain.

    ERIC Educational Resources Information Center

    Ciravegna, Fabio

    1995-01-01

    Introduces characteristics of the sublanguage found in diagnostic messages about automotive equipment failures and discusses a system for minimizing jargon. Proposes using general knowledge sources and evaluates levels of communication accuracy, robustness and efficiency. (AEF)

  13. Inoculating against reactance to persuasive health messages.

    PubMed

    Richards, Adam S; Banas, John A

    2015-01-01

    This investigation examined the possibility of decreasing psychological reactance to health campaigns through the use of inoculation messages. It was hypothesized that an inoculation message, which forewarned of the potential of subsequent reactance, would decrease participants' likelihood of reacting negatively to a freedom-threatening message aimed to reduce excessive alcohol consumption. Participants (N = 275) who were inoculated against potential reactance felt less threatened and experienced less reactance compared to those who did not read an inoculation message. Structural equation modeling showed that inoculation indirectly predicted lower intention to drink alcohol via the theorized mediated reactance process. This research suggests that it is possible to inoculate against self-generated cognitions that might otherwise lead toward negative health behaviors.

  14. Is Your Drug Program Sending Deadly Messages?

    ERIC Educational Resources Information Center

    Horton, Lowell

    1989-01-01

    Many drug education programs send a mixed and confusing message to students. Others are clearly wrong. Cites examples and advises administrators to conduct a critical review of all drug education programs. (MLF)

  15. Six-Message Electromechanical Display System

    NASA Technical Reports Server (NTRS)

    Howard, Richard T.

    2007-01-01

    A proposed electromechanical display system would be capable of presenting as many as six distinct messages. In the proposed system, each display element would include a cylinder having a regular hexagonal cross section.

  16. Books about Teen Parents: Messages and Omissions.

    ERIC Educational Resources Information Center

    Davis, Joy B.; MacGillivray, Laurie

    2001-01-01

    Examines narratives and novels written for young adults that deal with teenage pregnancy and parenting. Discusses eight common messages found in 17 such short stories and books, and notes three areas of significant silence. (SR)

  17. Send-side matching of data communications messages

    DOEpatents

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2014-07-01

    Send-side matching of data communications messages includes a plurality of compute nodes organized for collective operations, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

  18. Send-side matching of data communications messages

    DOEpatents

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2014-06-17

    Send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

  19. Persuasive Email Messages for Patient Communication

    PubMed Central

    Walji, Muhammad; Johnson-Throop, Kathy; Johnson, Todd; Bernstam, Elmer; Zhang, Jiajie

    2005-01-01

    To improve health and reduce costs, we need to encourage patients to make better health care decisions. Since email is widely available, it may be useful for patient-directed interventions. However, we know little about how the contents of an email message can influence a health-related decision. We propose a model to understand how patients may process persuasive email messages. PMID:16779434

  20. Effect of Outreach Messages on Medicaid Enrollment.

    PubMed

    Hom, Jeffrey K; Stillson, Christian; Rosin, Roy; Cahill, Rachel; Kruger, Evelyne; Grande, David

    2017-05-01

    To measure the impact of different outreach messages on health insurance enrollment among Medicaid-eligible adults. Between March 2015 and April 2016, we conducted a series of experiments using mail-based outreach that encouraged individuals to enroll in Pennsylvania's expanded Medicaid program. Recipients were randomized to receive 1 of 4 different messages describing the benefits of health insurance. The primary outcome was the response rate to each letter. We mailed outreach letters to 32 993 adults in Philadelphia. Messages that emphasized the dental benefits of insurance were significantly more likely to result in a response than messages emphasizing the health benefits (odds ratio = 1.33; 95% confidence interval = 1.10, 1.61). Medicaid enrollment outreach messages that emphasized the dental benefits of insurance were more effective than those that emphasized the health-related benefits. Public Health Implications. Although the structure and eligibility of the Medicaid program are likely to change, testing and identifying successful outreach and enrollment strategies remains important. Outreach messages that emphasize dental benefits may be more effective at motivating enrollment among individuals of low socioeconomic status.

  1. Effect of Outreach Messages on Medicaid Enrollment

    PubMed Central

    Stillson, Christian; Rosin, Roy; Cahill, Rachel; Kruger, Evelyne; Grande, David

    2017-01-01

    Objectives. To measure the impact of different outreach messages on health insurance enrollment among Medicaid-eligible adults. Methods. Between March 2015 and April 2016, we conducted a series of experiments using mail-based outreach that encouraged individuals to enroll in Pennsylvania’s expanded Medicaid program. Recipients were randomized to receive 1 of 4 different messages describing the benefits of health insurance. The primary outcome was the response rate to each letter. Results. We mailed outreach letters to 32 993 adults in Philadelphia. Messages that emphasized the dental benefits of insurance were significantly more likely to result in a response than messages emphasizing the health benefits (odds ratio = 1.33; 95% confidence interval = 1.10, 1.61). Conclusions. Medicaid enrollment outreach messages that emphasized the dental benefits of insurance were more effective than those that emphasized the health-related benefits. Public Health Implications. Although the structure and eligibility of the Medicaid program are likely to change, testing and identifying successful outreach and enrollment strategies remains important. Outreach messages that emphasize dental benefits may be more effective at motivating enrollment among individuals of low socioeconomic status. PMID:28661816

  2. Model for multi-messages spreading over complex networks considering the relationship between messages

    NASA Astrophysics Data System (ADS)

    Wang, Xingyuan; Zhao, Tianfang

    2017-07-01

    A novel messages spreading model is suggested in this paper. The model is a natural generalization of the SIS (susceptible-infective-susceptible) model, in which two relevant messages with same probability of acceptance may spread among nodes. One of the messages has a higher priority to be adopted than the other only in the sense that both messages act on the same node simultaneously. Node in the model is termed as supporter when it adopts either of messages. The transition probability allows that two kinds of supports may transform into each other with a certain rate, and it varies inversely with the associated levels which are discretely distributed in the symmetrical interval around original point. Results of numerical simulations show that individuals tend to believe the messages with a better consistency. If messages are conflicting with each other, the one with higher priority would be spread more and another would be ignored. Otherwise, the number of both supports remains at a uniformly higher level. Besides, in a network with lower connected degree, over a half of the individuals would keep neutral, and the message with lower priority becomes harder to diffuse than the prerogative one. This paper explores the propagation of multi-messages by considering their correlation degree, contributing to the understanding and predicting of the potential propagation trends.

  3. A New Distributed Algorithm for Side-Chain Positioning in the Process of Protein Docking*

    PubMed Central

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

    2014-01-01

    Side-chain positioning (SCP) is an important component of computational protein docking methods. Existing SCP methods and available software have been designed for protein folding applications where side-chain positioning is also important. As a result they do not take into account significant special structure that SCP for docking exhibits. We propose a new algorithm which poses SCP as a Maximum Weighted Independent Set (MWIS) problem on an appropriately constructed graph. We develop an approximate algorithm which solves a relaxation of the MWIS and then rounds the solution to obtain a high-quality feasible solution to the problem. The algorithm is fully distributed and can be executed on a large network of processing nodes requiring only local information and message-passing between neighboring nodes. Motivated by the special structure in docking, we establish optimality guarantees for a certain class of graphs. Our results on a benchmark set of enzyme-inhibitor protein complexes show that our predictions are close to the native structure and are comparable to the ones obtained by a state-of-the-art method. The results are substantially improved if rotamers from unbound protein structures are included in the search. We also establish that the use of our SCP algorithm substantially improves docking results. PMID:24844567

  4. Unreasonable effectiveness of learning neural networks: From accessible states and robust ensembles to basic algorithmic schemes

    PubMed Central

    Borgs, Christian; Chayes, Jennifer T.; Ingrosso, Alessandro; Lucibello, Carlo; Saglietti, Luca; Zecchina, Riccardo

    2016-01-01

    In artificial neural networks, learning from data is a computationally demanding task in which a large number of connection weights are iteratively tuned through stochastic-gradient-based heuristic processes over a cost function. It is not well understood how learning occurs in these systems, in particular how they avoid getting trapped in configurations with poor computational performance. Here, we study the difficult case of networks with discrete weights, where the optimization landscape is very rough even for simple architectures, and provide theoretical and numerical evidence of the existence of rare—but extremely dense and accessible—regions of configurations in the network weight space. We define a measure, the robust ensemble (RE), which suppresses trapping by isolated configurations and amplifies the role of these dense regions. We analytically compute the RE in some exactly solvable models and also provide a general algorithmic scheme that is straightforward to implement: define a cost function given by a sum of a finite number of replicas of the original cost function, with a constraint centering the replicas around a driving assignment. To illustrate this, we derive several powerful algorithms, ranging from Markov Chains to message passing to gradient descent processes, where the algorithms target the robust dense states, resulting in substantial improvements in performance. The weak dependence on the number of precision bits of the weights leads us to conjecture that very similar reasoning applies to more conventional neural networks. Analogous algorithmic schemes can also be applied to other optimization problems. PMID:27856745

  5. An events based algorithm for distributing concurrent tasks on multi-core architectures

    NASA Astrophysics Data System (ADS)

    Holmes, David W.; Williams, John R.; Tilke, Peter

    2010-02-01

    In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application to a wide range of numerical simulation problems. Such problems involve time stepping or iteration algorithms where synchronization of multiple threads of execution is required. It is shown that traditional approaches to parallelism including message passing and scatter-gather can be improved upon in terms of speed-up and memory management. Using spatial decomposition to create orthogonal computational tasks, a new task management algorithm called H-Dispatch is developed. This algorithm makes efficient use of memory resources by limiting the need for garbage collection and takes optimal advantage of multiple cores by employing a "hungry" pull strategy. The technique is demonstrated on a simple finite difference solver and results are compared to traditional MPI and scatter-gather approaches. The H-Dispatch approach achieves near linear speed-up with results for efficiency of 85% on a 24-core machine. It is noted that the H-Dispatch algorithm is quite general and can be applied to a wide class of computational tasks on heterogeneous architectures involving multi-core and GPGPU hardware.

  6. Max-product algorithms for the generalized multiple-fault diagnosis problem.

    PubMed

    Le, Tung; Hadjicostis, Christoforos N

    2007-12-01

    In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be unreliable. The MPA and the improved sequential MPA (SMPA) that we develop in this paper are local-message-passing algorithms that operate on the bipartite diagnosis graph (BDG) associated with the GMFD problem and converge to the maximum a posteriori probability (MAP) solution if this graph is acyclic (in addition, the MPA requires the MAP solution to be unique). Our simulations suggest that both the MPA and the SMPA perform well in more general systems that may exhibit cycles in the associated BDGs (the SMPA also appears to outperform the MPA in these more general systems). In this paper, we provide analytical results for acyclic BDGs and also assess the performance of both algorithms under particular patterns of alarm observations in general graphs; this allows us to obtain analytical bounds on the probability of making erroneous diagnosis with respect to the MAP solution. We also evaluate the performance of the MPA and the SMPA algorithms via simulations, and provide comparisons with previously developed heuristics for this type of diagnosis problems. We conclude that the MPA and the SMPA perform well under reasonable computational complexity when the underlying diagnosis graph is sparse.

  7. A Parallel, Finite-Volume Algorithm for Large-Eddy Simulation of Turbulent Flows

    NASA Technical Reports Server (NTRS)

    Bui, Trong T.

    1999-01-01

    A parallel, finite-volume algorithm has been developed for large-eddy simulation (LES) of compressible turbulent flows. This algorithm includes piecewise linear least-square reconstruction, trilinear finite-element interpolation, Roe flux-difference splitting, and second-order MacCormack time marching. Parallel implementation is done using the message-passing programming model. In this paper, the numerical algorithm is described. To validate the numerical method for turbulence simulation, LES of fully developed turbulent flow in a square duct is performed for a Reynolds number of 320 based on the average friction velocity and the hydraulic diameter of the duct. Direct numerical simulation (DNS) results are available for this test case, and the accuracy of this algorithm for turbulence simulations can be ascertained by comparing the LES solutions with the DNS results. The effects of grid resolution, upwind numerical dissipation, and subgrid-scale dissipation on the accuracy of the LES are examined. Comparison with DNS results shows that the standard Roe flux-difference splitting dissipation adversely affects the accuracy of the turbulence simulation. For accurate turbulence simulations, only 3-5 percent of the standard Roe flux-difference splitting dissipation is needed.

  8. Para-GMRF: parallel algorithm for anomaly detection of hyperspectral image

    NASA Astrophysics Data System (ADS)

    Dong, Chao; Zhao, Huijie; Li, Na; Wang, Wei

    2007-12-01

    The hyperspectral imager is capable of collecting hundreds of images corresponding to different wavelength channels for the observed area simultaneously, which make it possible to discriminate man-made objects from natural background. However, the price paid for the wealthy information is the enormous amounts of data, usually hundreds of Gigabytes per day. Turning the huge volume data into useful information and knowledge in real time is critical for geoscientists. In this paper, the proposed parallel Gaussian-Markov random field (Para-GMRF) anomaly detection algorithm is an attempt of applying parallel computing technology to solve the problem. Based on the locality of GMRF algorithm, we partition the 3-D hyperspectral image cube in spatial domain and distribute data blocks to multiple computers for concurrent detection. Meanwhile, to achieve load balance, a work pool scheduler is designed for task assignment. The Para-GMRF algorithm is organized in master-slave architecture, coded in C programming language using message passing interface (MPI) library and tested on a Beowulf cluster. Experimental results show that Para-GMRF algorithm successfully conquers the challenge and can be used in time sensitive areas, such as environmental monitoring and battlefield reconnaissance.

  9. 77 FR 65546 - Sabine Pass Liquefaction, LLC; Sabine Pass LNG, L.P.; Notice of Petition To Amend Authorizations...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-10-29

    ... Energy Regulatory Commission Sabine Pass Liquefaction, LLC; Sabine Pass LNG, L.P.; Notice of Petition To... Pass Liquefaction, LLC and Sabine Pass LNG, L.P. (collectively, Sabine Pass), 700 Milam Street, Suite... and operate certain related facilities (Modification Project) at the existing Sabine Pass LNG...

  10. Hurricane Sandy -- Pass 1, Oct. 29, 2012

    NASA Image and Video Library

    Hurricane Sandy was viewed Monday morning from the International Space Station as it orbited 260 miles above the Atlantic Ocean. Sandy had sustained winds of 90 miles an hour as the station passed ...

  11. Hurricane Sandy -- Pass 2, Oct. 29, 2012

    NASA Image and Video Library

    Hurricane Sandy was viewed Monday morning from the International Space Station as it orbited 260 miles above the Atlantic Ocean. Sandy had sustained winds of 90 miles an hour as the station passed ...

  12. Automated Procedure for Roll Pass Design

    NASA Astrophysics Data System (ADS)

    Lambiase, F.; Langella, A.

    2009-04-01

    The aim of this work has been to develop an automatic roll pass design method, capable of minimizing the number of roll passes. The adoption of artificial intelligence technologies, particularly expert systems, and a hybrid model for the surface profile evaluation of rolled bars, has allowed us to model the search for the minimal sequence with a tree path search. This approach permitted a geometrical optimization of roll passes while allowing automation of the roll pass design process. Moreover, the heuristic nature of the inferential engine contributes a great deal toward reducing search time, thus allowing such a system to be employed for industrial purposes. Finally, this new approach was compared with other recently developed automatic systems to validate and measure possible improvements among them.

  13. SCALAR MULTI-PASS ATOMIC MAGNETOMETER

    DTIC Science & Technology

    2017-08-01

    active volume including relaxation on cell walls. 4 Approved for public release; distribution is unlimited. Fig. 6...measurements, and suppression of spin-exchange relaxation to achieve the highest sensitivity per unit volume. We developed a new multi-pass cell geometry...suppression of spin-exchange relaxation to achieve the highest sensitivity per unit volume. During the project we developed a new multi-pass cell geometry

  14. 47 CFR 32.5100 - Long distance message revenue.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 47 Telecommunication 2 2011-10-01 2011-10-01 false Long distance message revenue. 32.5100 Section... Long distance message revenue. This account shall include revenue derived from message services that... includes those message services which utilize the public long distance switching network and the basic...

  15. Replacing the Message Service Component In an Integration Framework.

    DTIC Science & Technology

    1994-10-01

    routine: add- eventO if (event->type == Message && event->tt~pattern 1= NULL) tt-pattern-register(event->tt~pattern); A..4 ToolTalk Message Pattern...Message Pattern Destruction A.5.1 routine: free- eventO if (event->type == Message && event->tt~pattern 1= NULL) tt-free (event->tt~pattern); A.6

  16. Framing Flames: The Structure of Argumentative Messages on the Net.

    ERIC Educational Resources Information Center

    Mabry, Edward A.

    1997-01-01

    Assesses the use of the strategic message structuring tactic known as framing. Analyzes 3,000 messages obtained from a diverse sampling of computer-mediated discussion groups and forums. Finds that a speaker's emotional involvement was significantly and curvilinearly related to two message framing devices (message dependency and coalition…

  17. Launch Control System Master Console Event Message Reduction

    NASA Technical Reports Server (NTRS)

    Nguyen, Uyen

    2014-01-01

    System monitoring and control (SMC) message browsers receive so many messages daily that operators do not need to see. Important messages are often mixed up among the less important ones. My job is to reduce the messages displayed in the message browser so that warning and emergency messages can be seen easily and therefore, responded promptly. There are multiple methods to achieve this. Firstly, duplicate messages should not appear many times in the message browser. Instead, the message should appear only once but with a number that counts the times that it appears. This method is called duplicate message suppression. Secondly, messages that update the most recent state (e.g. up/down) of a component should replace the old-state messages. This method is called state based message correlation. Thirdly, messages that display "normal" alarm level should be suppressed unless it's a response to an operator action. In addition to message reduction, I also work on correcting the severity level and text formats on messages.

  18. An Analysis of Normative Messages in Signs at Recreation Settings.

    ERIC Educational Resources Information Center

    Winter, Patricia L.; Cialdini, Robert B.; Bator, Renee J.; Rhoads, Kelton; Sagarin, Brad J.

    1998-01-01

    A systematic evaluation of signs and messages at 42 recreation areas in California and Arizona focused on type of site, managing agency, density of message locales, sign attributes, and message content. The vast majority of messages presented behavioral commands and were negatively worded. This striking imbalance points to concerns in visitor…

  19. Gambling warning messages: The impact of winning and losing on message reception across a gambling session.

    PubMed

    Ginley, Meredith K; Whelan, James P; Keating, Holly A; Meyers, Andrew W

    2016-12-01

    Gambling warning messages have been shown to lead to prevention and modification of risk-taking behaviors. Laboratory studies have shown messages can increase a player's knowledge about gambling specific risks, modify their gambling-related cognitive distortions, and even change play. In the present laboratory study, participants were randomly assigned to a winning or losing slot machine gambling experience where they either viewed periodic warning messages or not. It was hypothesized that those in the message conditions would place smaller bets, spend more time considering bets, and spend less time gambling than those in the control conditions. We also hypothesized participants would play differently across the contexts of winning or losing. The results showed those who received warning messages while winning made the fewest number of spins and did not speed up their bet rate over the course of play as much as those in other conditions. Players who received warning messages while losing decreased the size of their bets over the course of play compared to those who received messages while winning. Despite receiving warning messages, losing players did not decrease their number of spins or rate of betting. Winning or losing during slot machine play appears to have significant consequences on the impact of a warning message. Whereas a message to change gambling behavior may encourage a winning gambler to stop play, the same message for a losing player may lead to a small minimization in harm by helping them to decrease bet size, though not their rate of betting. (PsycINFO Database Record

  20. Art messaging to engage homeless young adults.

    PubMed

    Nyamathi, Adeline; Slagle, Alexandra; Thomas, Alexandra; Hudson, Angela; Kahilifard, Farinaz; Avila, Glenna; Orser, Julie; Cuchilla, Manuel

    2011-01-01

    Art has been shown to be an empowering and engaging entity with numerous benefits to vulnerable populations, including the homeless persons and young adults. However, little is known how homeless young adults perceive the use of art as messages that can communicate the danger of initiating or continuing drug and alcohol use. The purpose of this study was to solicit perspectives of homeless, drug-using young adults as to how art can be used to design messages for their peers about the danger of initiating or continuing drug and alcohol use. Qualitative methodology via focus group discussions was utilized to engage 24 homeless young adults enrolled from a drop-in site in Santa Monica, California. The findings revealed support for a myriad of delivery styles, including in-person communication, flyers, music, documentary film, and creative writing. The young adults also provided insight into the importance of the thematic framework of messages. Such themes ranged from empowering and hopeful messages to those designed to scare young homeless adults into not experimenting with drugs. The findings indicate that in addition to messages communicating the need to prevent or reduce drug and alcohol use, homeless young adults respond to messages that remind them of goals and dreams they once had for their future, and to content that is personal, real, and truthful. Our research indicates that messages that reinforce protective factors such as hope for the future and self-esteem may be as important to homeless young adults as information about the risks and consequences of drug use.

  1. On the conceptual ambiguity surrounding perceived message effectiveness.

    PubMed

    Yzer, Marco; LoRusso, Susan; Nagler, Rebekah H

    2015-01-01

    Health message quality is best understood in terms of a message's ability to effectively produce change in the variables that it was designed to change. The importance of determining a message's effectiveness in producing change prior to implementation is clear: The better a message's potential effectiveness is understood, the better able interventionists are to distinguish effective from ineffective messages before allocating scarce resources to message implementation. For this purpose, research has relied on perceived message effectiveness measures as a proxy of a message's potential effectiveness. Remarkably, however, very little conceptual work has been done on perceived message effectiveness, which renders its measures underinformed and inconsistent across studies. To encourage greater conceptual work on this important construct, we review several threats to the validity of existing measures and consider strategies for improving our understanding of perceived message effectiveness.

  2. The Physical Therapy and Society Summit (PASS) Meeting: observations and opportunities.

    PubMed

    Kigin, Colleen M; Rodgers, Mary M; Wolf, Steven L

    2010-11-01

    The construct of delivering high-quality and cost-effective health care is in flux, and the profession must strategically plan how to meet the needs of society. In 2006, the House of Delegates of the American Physical Therapy Association passed a motion to convene a summit on "how physical therapists can meet current, evolving, and future societal health care needs." The Physical Therapy and Society Summit (PASS) meeting on February 27-28, 2009, in Leesburg, Virginia, sent a clear message that for physical therapists to be effective and thrive in the health care environment of the future, a paradigm shift is required. During the PASS meeting, participants reframed our traditional focus on the physical therapist and the patient/client (consumer) to one in which physical therapists are an integral part of a collaborative, multidisciplinary health care team with the health care consumer as its focus. The PASS Steering Committee recognized that some of the opportunities that surfaced during the PASS meeting may be disruptive or may not be within the profession's present strategic or tactical plans. Thus, adopting a framework that helps to establish the need for change that is provocative and potentially disruptive to our present care delivery, yet prioritizes opportunities, is a critical and essential step. Each of us in the physical therapy profession must take on post-PASS roles and responsibilities to accomplish the systemic change that is so intimately intertwined with our destiny. This article offers a perspective of the dynamic dialogue and suggestions that emerged from the PASS event, providing further opportunities for discussion and action within our profession.

  3. Chaos pass filter: linear response of synchronized chaotic systems.

    PubMed

    Zeeb, Steffen; Kestler, Johannes; Kanter, Ido; Kinzel, Wolfgang

    2013-04-01

    The linear response of synchronized time-delayed chaotic systems to small external perturbations, i.e., the phenomenon of chaos pass filter, is investigated for iterated maps. The distribution of distances, i.e., the deviations between two synchronized chaotic units due to external perturbations on the transferred signal, is used as a measure of the linear response. It is calculated numerically and, for some special cases, analytically. Depending on the model parameters this distribution has power law tails in the region of synchronization leading to diverging moments of distances. This is a consequence of multiplicative and additive noise in the corresponding linear equations due to chaos and external perturbations. The linear response can also be quantified by the bit error rate of a transmitted binary message which perturbs the synchronized system. The bit error rate is given by an integral over the distribution of distances and is calculated analytically and numerically. It displays a complex nonmonotonic behavior in the region of synchronization. For special cases the distribution of distances has a fractal structure leading to a devil's staircase for the bit error rate as a function of coupling strength. The response to small harmonic perturbations shows resonances related to coupling and feedback delay times. A bidirectionally coupled chain of three units can completely filter out the perturbation. Thus the second moment and the bit error rate become zero.

  4. Can Messages Make a Difference? The Association between E-Mail Messages and Health Outcomes in Diabetes Patients

    ERIC Educational Resources Information Center

    Turner, Jeanine Warisse; Robinson, James D.; Tian, Yan; Neustadtl, Alan; Angelus, Pam; Russell, Marie; Mun, Seong K.; Levine, Betty

    2013-01-01

    This investigation examined the impact of social support messages on patient health outcomes. Forty-one American Indian, Alaska Native, and Native Hawaiian patients received a total of 618 e-mail messages from their healthcare provider (HCP). The e-mail messages were divided into 3,565 message units and coded for instances of emotional social…

  5. Can Messages Make a Difference? The Association between E-Mail Messages and Health Outcomes in Diabetes Patients

    ERIC Educational Resources Information Center

    Turner, Jeanine Warisse; Robinson, James D.; Tian, Yan; Neustadtl, Alan; Angelus, Pam; Russell, Marie; Mun, Seong K.; Levine, Betty

    2013-01-01

    This investigation examined the impact of social support messages on patient health outcomes. Forty-one American Indian, Alaska Native, and Native Hawaiian patients received a total of 618 e-mail messages from their healthcare provider (HCP). The e-mail messages were divided into 3,565 message units and coded for instances of emotional social…

  6. Promoting stair use: single versus multiple stair-riser messages.

    PubMed

    Webb, Oliver J; Eves, Frank F

    2005-09-01

    Message banners attached to stair risers produced a significant increase in pedestrian stair use, exceeding effects previously reported for conventional posters. Multiple instances of the same message banner, however, were as effective as banners featuring different messages. Therefore, greater visibility, rather than message variety, appears to account for the superiority of the banner format. Our findings indicate the feasibility of simple stair-use promotion campaigns based around the repetition of a single message.

  7. A Comprehensive Voice Message Vocabulary for Air Force Tactical Aircraft

    DTIC Science & Technology

    1985-07-01

    Surveys of airframe manufacturers and Air Force tactical aircraft pilots regarding the use of voice messages in current and future tactical aircraft...and F-16. The basic 38-item vocabulary necessary to generate those messages (except threat-warning messages ) is presented and the usage of each...vocabulary item is summarized by voice message function and by aircraft. An additional 35- item vocabulary for use in threat-warning messages is also presented. Conclusions and recommendations for further research are discussed.

  8. Scaffolding Collaborative Argumentation in Asynchronous Discussions with Message Constraints and Message Labels

    ERIC Educational Resources Information Center

    Jeong, Allan; Joung, Sunyoung

    2007-01-01

    This study examined the effects of message constraints and labels on collaborative argumentation in asynchronous online discussions. Thirty-eight undergraduate students in an introductory educational technology course were assigned to one of three groups. In one group, students posted specific types of messages using a prescribed set of message…

  9. Impact of Product Involvement, Message Format, and Receiver Sex on the Efficacy of Comparative Advertising Messages.

    ERIC Educational Resources Information Center

    Pfau, Michael

    1994-01-01

    Investigates the role and impact of receiver involvement in product class, comparative message format, and receiver sex on the relative effectiveness of comparative advertising messages. Indicates that females and males respond uniquely to comparative advertising, revealing consistent patterns regarding both circumstances and approaches. (SR)

  10. Impact of Product Involvement, Message Format, and Receiver Sex on the Efficacy of Comparative Advertising Messages.

    ERIC Educational Resources Information Center

    Pfau, Michael

    1994-01-01

    Investigates the role and impact of receiver involvement in product class, comparative message format, and receiver sex on the relative effectiveness of comparative advertising messages. Indicates that females and males respond uniquely to comparative advertising, revealing consistent patterns regarding both circumstances and approaches. (SR)

  11. An improved coarse-grained parallel algorithm for computational acceleration of ordinary Kriging interpolation

    NASA Astrophysics Data System (ADS)

    Hu, Hongda; Shu, Hong

    2015-05-01

    Heavy computation limits the use of Kriging interpolation methods in many real-time applications, especially with the ever-increasing problem size. Many researchers have realized that parallel processing techniques are critical to fully exploit computational resources and feasibly solve computation-intensive problems like Kriging. Much research has addressed the parallelization of traditional approach to Kriging, but this computation-intensive procedure may not be suitable for high-resolution interpolation of spatial data. On the basis of a more effective serial approach, we propose an improved coarse-grained parallel algorithm to accelerate ordinary Kriging interpolation. In particular, the interpolation task of each unobserved point is considered as a basic parallel unit. To reduce time complexity and memory consumption, the large right hand side matrix in the Kriging linear system is transformed and fixed at only two columns and therefore no longer directly relevant to the number of unobserved points. The MPI (Message Passing Interface) model is employed to implement our parallel programs in a homogeneous distributed memory system. Experimentally, the improved parallel algorithm performs better than the traditional one in spatial interpolation of annual average precipitation in Victoria, Australia. For example, when the number of processors is 24, the improved algorithm keeps speed-up at 20.8 while the speed-up of the traditional algorithm only reaches 9.3. Likewise, the weak scaling efficiency of the improved algorithm is nearly 90% while that of the traditional algorithm almost drops to 40% with 16 processors. Experimental results also demonstrate that the performance of the improved algorithm is enhanced by increasing the problem size.

  12. Symmetrical band-pass loudspeaker systems

    NASA Astrophysics Data System (ADS)

    Matusiak, Grzegorz Piotr

    2001-12-01

    Loudspeaker systems are analyzed in a doctoral dissertation. The dissertation concerns loudspeaker systems, which are known as subwoofers or band-pass loudspeaker systems. Their advantages include: high- quality sound reproduction in the low-frequency range, small dimensions, small nonlinear distortions and the fact that they can be placed anywhere in a room or car. Band-pass loudspeaker systems are used widely in the so- called Home Theatre as well as to provide sound in cinema, theatre, concert, discotheque, opera, operetta, philharmonic and amphitheater halls, at open-air concerts, and so on. Various designs are mass-produced by a large number of manufacturers. The study covers an analysis of band-pass loudspeaker systems to which the frequency transformation, i.e. the reactance transformation, has been applied. Since this is a symmetrical transformation, amplitude frequency responses of the studied band-pass systems are also symmetrical (logarithmic scale of a frequency). As a result, the high-pass loudspeaker system design method, known as the Thiele-Small, Benson analysis, can be employed. The investigations include the formulation of band-pass system equations (fourth, sixth and eighth-order polynomials) and the subsequent derivation of relations for the calculation of system parameters. The obtained results enable the calculation of optimum designs for prescribed alignments, e.g. (Chebyshev) equal-ripple, (Butterworth) maximally flat, or quasi-maximally flat (QB). The analysis covers fourth, sixth and eighth-order symmetrical systems. Eighth-order systems have been divided into three kinds according to three ways of physical realization. The doctoral dissertation includes band-pass loudspeaker systems, which can be designed with active or passive filters or without the filter. Designed systems consist of a loudspeaker whose front of a diaphragm is loaded with a Helmholtz resonator, i.e. an enclosure with a vent, which radiates sound outwards. The back is

  13. A Scheduling Algorithm for Minimizing Exclusive Window Durations in Time-Triggered Controller Area Network

    NASA Astrophysics Data System (ADS)

    Ryu, Minsoo

    Time-Triggered Controller Area Network is widely accepted as a viable solution for real-time communication systems such as in-vehicle communications. However, although TTCAN has been designed to support both periodic and sporadic real-time messages, previous studies mostly focused on providing deterministic real-time guarantees for periodic messages while barely addressing the performance issue of sporadic messages. In this paper, we present an O(n2) scheduling algorithm that can minimize the maximum duration of exclusive windows occupied by periodic messages, thereby minimizing the worst-case scheduling delays experienced by sporadic messages.

  14. Positive messaging promotes walking in older adults

    PubMed Central

    Notthoff, Nanna; Carstensen, Laura L.

    2014-01-01

    Walking is among the most cost-effective and accessible means of exercise. Mounting evidence suggests that walking may help to maintain physical and cognitive independence in old age by preventing a variety of health problems. However, older Americans fall far short of meeting the daily recommendations for walking. In two studies, we examined whether considering older adults’ preferential attention to positive information may effectively enhance interventions aimed at promoting walking. In Study 1, we compared the effectiveness of positive, negative, and neutral messages to encourage walking (as measured with pedometers). Older adults who were informed about the benefits of walking walked more than those who were informed about the negative consequences of failing to walk, whereas younger adults were unaffected by framing valence. In Study 2, we examined within-person change in walking in older adults in response to positively- or negatively-framed messages over a 28-day period. Once again, positively-framed messages more effectively promoted walking than negatively-framed messages, and the effect was sustained across the intervention period. Together, these studies suggest that consideration of age-related changes in preferences for positive and negative information may inform the design of effective interventions to promote healthy lifestyles. Future research is needed to examine the mechanisms underlying the greater effectiveness of positively as opposed to negatively framed messages and the generalizability of findings to other intervention targets and other subpopulations of older adults. PMID:24956001

  15. Supervising simulations with the Prodiguer Messaging Platform

    NASA Astrophysics Data System (ADS)

    Greenslade, Mark; Carenton, Nicolas; Denvil, Sebastien

    2015-04-01

    At any one moment in time, researchers affiliated with the Institut Pierre Simon Laplace (IPSL) climate modeling group, are running hundreds of global climate simulations. These simulations execute upon a heterogeneous set of High Performance Computing (HPC) environments spread throughout France. The IPSL's simulation execution runtime is called libIGCM (library for IPSL Global Climate Modeling group). libIGCM has recently been enhanced so as to support realtime operational use cases. Such use cases include simulation monitoring, data publication, environment metrics collection, automated simulation control … etc. At the core of this enhancement is the Prodiguer messaging platform. libIGCM now emits information, in the form of messages, for remote processing at IPSL servers in Paris. The remote message processing takes several forms, for example: 1. Persisting message content to database(s); 2. Notifying an operator of changes in a simulation's execution status; 3. Launching rollback jobs upon simulation failure; 4. Dynamically updating controlled vocabularies; 5. Notifying downstream applications such as the Prodiguer web portal; We will describe how the messaging platform has been implemented from a technical perspective and demonstrate the Prodiguer web portal receiving realtime notifications.

  16. Emotional flow in persuasive health messages.

    PubMed

    Nabi, Robin L

    2015-01-01

    Overwhelmingly, the literature on the persuasive influence of emotions has focused on individual emotions, fear in particular, though some recent attention has been given to mixed emotions in persuasive appeals. Building on this newer wave of research, this article argues that instead of focusing on singular emotional states or collections of emotions evoked by a message, it might prove valuable to explore the flow, or evolution, of emotional experience over the course of exposure to a health message. The article offers a brief introduction to the concept of emotion, followed by a review of the state of the literature on the use of emotion in health messages. The concept of emotional flow is then introduced along with a consideration of how it has been tacitly incorporated into the study of emotional health messages. Finally, the utility of the concept of emotional flow is elaborated by articulating the ways in which it might be harnessed to facilitate the creation of more effective health messages, individually as well as across campaigns. The article concludes with an agenda for future research.

  17. The message development tool: a case for effective operationalization of messaging in social marketing practice.

    PubMed

    Mattson, Marifran; Basu, Ambar

    2010-07-01

    That messages are essential, if not the most critical component of any communicative process, seems like an obvious claim. More so when the communication is about health--one of the most vital and elemental of human experiences (Babrow & Mattson, 2003). Any communication campaign that aims to change a target audience's health behaviors needs to centralize messages. Even though messaging strategies are an essential component of social marketing and are a widely used campaign model, health campaigns based on this framework have not always been able to effectively operationalize this key component, leading to cases where initiating and sustaining prescribed health behavior has been difficult (MacStravic, 2000). Based on an examination of the VERB campaign and an Australian breastfeeding promotion campaign, we propose a message development tool within the ambit of the social marketing framework that aims to extend the framework and ensure that the messaging component of the model is contextualized at the core of planning, implementation, and evaluation efforts.

  18. Comparison of Item Targeting Strategies for Pass/Fail Computer Adaptive Tests.

    ERIC Educational Resources Information Center

    Bergstrom, Betty A.; Gershon, Richard

    The most useful method of item selection for making pass-fail decisions with a Computerized Adaptive Test (CAT) was studied. Medical technology students (n=86) took a computer adaptive test in which items were targeted to the ability of the examinee. The adaptive algorithm that selected items and estimated person measures used the Rasch model and…

  19. Improved multiple-pass Raman spectrometer

    NASA Astrophysics Data System (ADS)

    Kc, Utsav; Silver, Joel A.; Hovde, David C.; Varghese, Philip L.

    2011-08-01

    An improved Raman gain spectrometer for flame measurements of gas temperature and species concentrations is described. This instrument uses a multiple-pass optical cell to enhance the incident light intensity in the measurement volume. The Raman signal is 83 times larger than from a single pass, and the Raman signal-to-noise ratio (SNR) in room-temperature air of 153 is an improvement over that from a single-pass cell by a factor of 9.3 when the cell is operated with 100 passes and the signal is integrated over 20 laser shots. The SNR improvement with the multipass cell is even higher for flame measurements at atmospheric pressure, because detector readout noise is more significant for single-pass measurements when the gas density is lower. Raman scattering is collected and dispersed in a spectrograph with a transmission grating and recorded with a fast gated CCD array detector to help eliminate flame interferences. The instrument is used to record spontaneous Raman spectra from N2, CO2, O2, and CO in a methane--air flame. Curve fits of the recorded Raman spectra to detailed simulations of nitrogen spectra are used to determine the flame temperature from the shapes of the spectral signatures and from the ratio of the total intensities of the Stokes and anti-Stokes signals. The temperatures measured are in good agreement with radiation-corrected thermocouple measurements for a range of equivalence ratios.

  20. Low Latency Messages on Distributed Memory Multiprocessors

    DOE PAGES

    Rosing, Matt; Saltz, Joel

    1995-01-01

    This article describes many of the issues in developing an efficient interface for communication on distributed memory machines. Although the hardware component of message latency is less than 1 ws on many distributed memory machines, the software latency associated with sending and receiving typed messages is on the order of 50 μs. The reason for this imbalance is that the software interface does not match the hardware. By changing the interface to match the hardware more closely, applications with fine grained communication can be put on these machines. This article describes several tests performed and many of the issues involvedmore » in supporting low latency messages on distributed memory machines.« less