WorldWideScience

Sample records for asynchronous multiparty computation

  1. Asynchronous Multiparty Computation

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Geisler, Martin; Krøigaard, Mikkel

    2009-01-01

    We propose an asynchronous protocol for general multiparty computation. The protocol has perfect security and communication complexity  where n is the number of parties, |C| is the size of the arithmetic circuit being computed, and k is the size of elements in the underlying field. The protocol g...

  2. Multiparty Asynchronous Session Types

    DEFF Research Database (Denmark)

    Honda, Kohei; Yoshida, Nobuko; Carbone, Marco

    2016-01-01

    peers are directly abstracted as a global scenario. Global types retain the friendly type syntax of binary session types while specifying dependencies and capturing complex causal chains of multiparty asynchronous interactions. A global type plays the role of a shared agreement among communication peers...

  3. Multiparty Computations

    DEFF Research Database (Denmark)

    Dziembowski, Stefan

    papers [1,2]. In [1] we assume that the adversary can corrupt any set from a given adversary structure. In this setting we study a problem of doing efficient VSS and MPC given an access to a secret sharing scheme (SS). For all adversary structures where VSS is possible at all, we show that, up...... an impossibility result indicating that a similar equivalence does not hold for Multiparty Computation (MPC): we show that even if protocols are given black-box access for free to an idealized secret sharing scheme secure for the access structure in question, it is not possible to handle all relevant access...... adversary structure. We propose new VSS and MPC protocols that are substantially more efficient than the ones previously known. Another contribution of [2] is an attack against a Weak Secret Sharing Protocol (WSS) of [3]. The attack exploits the fact that the adversary is adaptive. We present this attack...

  4. Asynchronous Session Types – Exceptions and Multiparty Interactions

    DEFF Research Database (Denmark)

    Carbone, Marco; Yoshida, Nobuko; Honda, Kohei

    2009-01-01

    to capture many real scenarios, there are cases where they are not powerful enough for describing and validating interactions involving more complex scenarios. In this note, we shall explore two extensions of session types to interactional exceptions and multiparty session in presence of asynchronous...

  5. Secure multiparty computation goes live

    DEFF Research Database (Denmark)

    Bogetoft, Peter; Christensen, Dan Lund; Damgård, Ivan Bjerre

    2009-01-01

    Commision. Tomas Toft’s work was partially performed at Aarhus University. In Holland, he was supported by the research program Sentinels, financed by Technology Foundation STW, the Netherlands Organization for Scientific Research (NWO), and the Dutch Ministry of Economic Affairs.......In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used. This work was supported by the Danish Strategic Research Council and the European...

  6. Semi-Homomorphic Encryption and Multiparty Computation

    DEFF Research Database (Denmark)

    Bendlin, Rikke; Damgård, Ivan Bjerre; Orlandi, Claudio

    2011-01-01

    , the online phase is extremely efficient as it requires no cryptographic operations: the parties only need to exchange additive shares and verify information theoretic MACs. Our contribution is therefore twofold: from a theoretical point of view, we can base multiparty computation on a variety of different...

  7. Robust Multiparty Computation with Linear Communication Complexity

    DEFF Research Database (Denmark)

    Hirt, Martin; Nielsen, Jesper Buus

    2006-01-01

    We present a robust multiparty computation protocol. The protocol is for the cryptographic model with open channels and a poly-time adversary, and allows n parties to actively securely evaluate any poly-sized circuit with resilience t < n/2. The total communication complexity in bits over the poi...

  8. Scalable and Unconditionally Secure Multiparty Computation

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Nielsen, Jesper Buus

    2007-01-01

    We present a multiparty computation protocol that is unconditionally secure against adaptive and active adversaries, with communication complexity O(Cn)k+O(Dn^2)k+poly(nk), where C is the number of gates in the circuit, n is the number of parties, k is the bit-length of the elements of the field...... over which the computation is carried out, D is the multiplicative depth of the circuit, and κ is the security parameter. The corruption threshold is t security the corruption threshold is t secure......, the protocol has so called everlasting security....

  9. Key Technologies and Applications of Secure Multiparty Computation

    Directory of Open Access Journals (Sweden)

    Xiaoqiang Guo

    2013-07-01

    Full Text Available With the advent of the information age, the network security is particularly important. The secure multiparty computation is a very important branch of cryptography. It is a hotspot in the field of information security. It expanded the scope of the traditional distributed computing and information security, provided a new computing model for the network collaborative computing. First we introduced several key technologies of secure multiparty computation: secret sharing and verifiable secret sharing, homomorphic public key cryptosystem, mix network, zero knowledge proof, oblivious transfer, millionaire protocol. Second we discussed the applications of secure multiparty computation in electronic voting, electronic auctions, threshold signature, database queries, data mining, mechanical engineering and other fields.

  10. Confidential benchmarking based on multiparty computation

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Damgård, Kasper Lyneborg; Nielsen, Kurt;

    We report on the design and implementation of a system that uses multiparty computation to enable banks to benchmark their customers' confidential performance data against a large representative set of confidential performance data from a consultancy house. The system ensures that both the banks......' and the consultancy house's data stays confidential, the banks as clients learn nothing but the computed benchmarking score. In the concrete business application, the developed prototype help Danish banks to find the most efficient customers among a large and challenging group of agricultural customers with too much...... debt. We propose a model based on linear programming for doing the benchmarking and implement it using the SPDZ protocol by Damgård et al., which we modify using a new idea that allows clients to supply data and get output without having to participate in the preprocessing phase and without keeping...

  11. Multiparty Computation from Threshold Homomorphic Encryption

    DEFF Research Database (Denmark)

    Cramer, Ronald; Damgård, Ivan Bjerre; Nielsen, Jesper Buus

    2001-01-01

    We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPC protocols for n parties can be devised which are secure against an active adversary that corrupts...... any minority of the parties. The total number of bits broadcast is O(nk|C|), where k is the security parameter and |C| is the size of a (Boolean) circuit computing the function to be securely evaluated. An earlier proposal by Franklin and Haber with the same complexity was only secure for passive...... adversaries, while all earlier protocols with active security had complexity at least quadratic in n. We give two examples of threshold cryptosystems that can support our construction and lead to the claimed complexities....

  12. Zero-Knowledge Protocols and Multiparty Computation

    DEFF Research Database (Denmark)

    Pastro, Valerio

    in a finite field, in which the third one is the product of the first two. We extend this protocol in two ways: first we consider the case where the values are integers, and then we consider tuples of values that satisfy more general algebraic relations. Our basic scheme achieves optimal amortized......This thesis presents results in two branches of cryptography. In the first part we construct two general multiparty computation protocols that can evaluate any arithmetic circuit over a finite field. Both are built in the preprocessing model and achieve active security in the setting of a dishonest......+ 13] yields a more efficient protocol than that originally proposed in [DPSZ12]. Our preprocessing phases make use of a somewhat homomorphic encryption scheme, and significantly improve on the previous state of the art, both asymptotically and in practice. The online phase we present relies...

  13. Multiparty Computation from El Gamal/Paillier Conversion

    Science.gov (United States)

    Chida, Koji; Kikuchi, Hiroaki; Hirota, Keiichi; Morohashi, Gembu

    We propose a protocol for converting the encryption function of a ciphertext into another encryption function while keeping the corresponding message secret. The proposed protocol allows conversions of the El Gamal and Paillier cryptosystems and has the potential to design an efficient multiparty protocol intended for circuits consisting of arithmetic and logical operations. We clarify the condition of circuits such that the multiparty protocol based on the proposed protocol provides better performance than previous approaches. In addition, we introduce some privacy-preserving statistical computations as an effective application of the proposed protocol.

  14. Peer-to-Peer Secure Multi-Party Numerical Computation

    CERN Document Server

    Bickson, Danny; Dolev, Danny; Pinkas, Benny

    2008-01-01

    We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering, distributed computation of trust and reputation, monitoring and numerous other tasks, where the computing nodes would like to preserve the privacy of their inputs while performing a joint computation of a certain function. Although there is a rich literature in the field of distributed systems security concerning secure multi-party computation, in practice it is hard to deploy those methods in very large scale Peer-to-Peer networks. In this work, we examine several possible approaches and discuss their feasibility. Among the possible approaches, we identify a single approach which is both scalable and theoretically secure. An additional novel contribution is that we show how to compute the neighborhood based collaborative filtering, a state-of-the-art collaborative filtering algorithm, winner of the Netflix progress ...

  15. Scalable Multiparty Computation with Nearly Optimal Work and Resilience

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Krøigaard, Mikkel; Ishai, Yuval;

    2008-01-01

    We present the first general protocol for secure multiparty computation in which the total amount of work required by n players to compute a function f grows only polylogarithmically with n (ignoring an additive term that depends on n but not on the complexity of f). Moreover, the protocol is als...... nearly optimal in terms of resilience, providing computational security against an active, adaptive adversary corrupting a (1/2 − ε) fraction of the players, for an arbitrary ε> 0....

  16. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Nielsen, Jesper Buus

    2003-01-01

    We present a new general multiparty computation protocol for the cryptographic scenario which is universally composable — in particular, it is secure against an active and adaptive adversary, corrupting any minority of the parties. The protocol is as efficient as the best known statically secure...... solutions, in particular the number of bits broadcast (which dominates the complexity) is Ω (nk |C|), where n is the number of parties, k is a security parameter, and |C| is the size of a circuit doing the desired computation. Unlike previous adaptively secure protocols for the cryptographic model, our...

  17. Secure data structures based on multi-party computation

    DEFF Research Database (Denmark)

    Toft, Tomas

    2011-01-01

    This work considers data structures based on multi-party computation (MPC) primitives: structuring secret (e.g. secret shared and potentially unknown) data such that it can both be queried and updated efficiently. Implementing an oblivious RAM (ORAM) using MPC allows any existing data structure...... to be realized using MPC primitives, however, by focusing on a specific example -- a priority queue -- it is shown that it is possible to achieve much better results than the generic solutions can provide. Moreover, the techniques differ significantly from existing ORAM constructions. Indeed it has recently been...

  18. Efficient Multi-Party Computation over Rings

    DEFF Research Database (Denmark)

    Cramer, Ronald; Fehr, Serge; Ishai, Yuval;

    2003-01-01

    by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these techniques: – Generality. Existing protocols do not apply to computation over more general algebraic structures (except via a brute-force simulation of computation in these structures). – Efficiency. The best...... known constant-round protocols do not efficiently scale even to the case of large finite fields. Our contribution goes in these two directions. First, we propose a basis for unconditionally secure MPC over an arbitrary ginite ring, an algebraic object with a much less nice structure than a field...... the usefulness of the above results by presenting a novel application of MPC over (non-field) rings to the round-efficient secure computation of the maximum function. Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation....

  19. Secure multi-party computation solution to Yao's millionaires' problem based on set-inclusion

    Institute of Scientific and Technical Information of China (English)

    LI Shundong; DAI Yiqi; YOU Qiyou

    2005-01-01

    Secure multi-party computation is a focus of international cryptography in recent years. Protocols for Yao's millionaires' problem have become an important building block of many secure multi-party computation protocols. Their efficiency are crucial to the efficiency of many secure multi-party computation protocols. Unfortunately, known protocols for Yao's millionaires' problem have high computational complexity or communication complexity. In this study, based on the 1-out-of-m oblivious transfer and set-inclusion problem, we propose a new protocol to solve this problem. This new protocol is very efficient in terms of both computational and communication complexities. Its privacy-preserving property is also proved by simulation paradigm which is generally accepted in the study of secure multi-party computation. We also compare the information leakage of our new protocol and the known protocols.

  20. Two-Cloud-Servers-Assisted Secure Outsourcing Multiparty Computation

    Directory of Open Access Journals (Sweden)

    Yi Sun

    2014-01-01

    Full Text Available We focus on how to securely outsource computation task to the cloud and propose a secure outsourcing multiparty computation protocol on lattice-based encrypted data in two-cloud-servers scenario. Our main idea is to transform the outsourced data respectively encrypted by different users’ public keys to the ones that are encrypted by the same two private keys of the two assisted servers so that it is feasible to operate on the transformed ciphertexts to compute an encrypted result following the function to be computed. In order to keep the privacy of the result, the two servers cooperatively produce a custom-made result for each user that is authorized to get the result so that all authorized users can recover the desired result while other unauthorized ones including the two servers cannot. Compared with previous research, our protocol is completely noninteractive between any users, and both of the computation and the communication complexities of each user in our solution are independent of the computing function.

  1. Two-cloud-servers-assisted secure outsourcing multiparty computation.

    Science.gov (United States)

    Sun, Yi; Wen, Qiaoyan; Zhang, Yudong; Zhang, Hua; Jin, Zhengping; Li, Wenmin

    2014-01-01

    We focus on how to securely outsource computation task to the cloud and propose a secure outsourcing multiparty computation protocol on lattice-based encrypted data in two-cloud-servers scenario. Our main idea is to transform the outsourced data respectively encrypted by different users' public keys to the ones that are encrypted by the same two private keys of the two assisted servers so that it is feasible to operate on the transformed ciphertexts to compute an encrypted result following the function to be computed. In order to keep the privacy of the result, the two servers cooperatively produce a custom-made result for each user that is authorized to get the result so that all authorized users can recover the desired result while other unauthorized ones including the two servers cannot. Compared with previous research, our protocol is completely noninteractive between any users, and both of the computation and the communication complexities of each user in our solution are independent of the computing function.

  2. An Integrated Computational Model of Multiparty Electoral Competition

    NARCIS (Netherlands)

    Quinn, Kevin M.; Martin, Andrew D.

    2002-01-01

    Most theoretic models of multiparty electoral competition make the assumption that party leaders are motivated to maximize their vote share or seat share. In plurality-rule systems this is a sensible assumption. However, in proportional representation systems, this assumption is questionable since t

  3. Computing by Temporal Order: Asynchronous Cellular Automata

    Directory of Open Access Journals (Sweden)

    Michael Vielhaber

    2012-08-01

    Full Text Available Our concern is the behaviour of the elementary cellular automata with state set 0,1 over the cell set Z/nZ (one-dimensional finite wrap-around case, under all possible update rules (asynchronicity. Over the torus Z/nZ (n<= 11,we will see that the ECA with Wolfram rule 57 maps any v in F_2^n to any w in F_2^n, varying the update rule. We furthermore show that all even (element of the alternating group bijective functions on the set F_2^n = 0,...,2^n-1, can be computed by ECA57, by iterating it a sufficient number of times with varying update rules, at least for n <= 10. We characterize the non-bijective functions computable by asynchronous rules.

  4. Quantum-Classical Complexity-Security Tradeoff In Secure Multi-Party Computation

    OpenAIRE

    Chau, HF

    1999-01-01

    I construct a secure multi-party scheme to compute a classical function by a succinct use of a specially designed fault-tolerant random polynomial quantum error correction code. This scheme is secure provided that (asymptotically) strictly greater than five-sixths of the players are honest. Moreover, the security of this scheme follows directly from the theory of quantum error correcting code, and hence is valid without any computational assumption. I also discuss the quantum-classical comple...

  5. Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries

    CERN Document Server

    Bickson, Danny; Dolev, Danny; Pinkas, Benny

    2009-01-01

    We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering, distributed computation of trust and reputation, monitoring and other tasks, where the computing nodes is expected to preserve the privacy of their inputs while performing a joint computation of a certain function. Although there is a rich literature in the field of distributed systems security concerning secure multi-party computation, in practice it is hard to deploy those methods in very large scale Peer-to-Peer networks. In this work, we try to bridge the gap between theoretical algorithms in the security domain, and a practical Peer-to-Peer deployment. We consider two security models. The first is the semi-honest model where peers correctly follow the protocol, but try to reveal private information. We provide three possible schemes for secure multi-party numerical computation for this model and identify a singl...

  6. Parallel Oblivious Array Access for Secure Multiparty Computation and Privacy-Preserving Minimum Spanning Trees

    Directory of Open Access Journals (Sweden)

    Laud Peeter

    2015-06-01

    Full Text Available In this paper, we describe efficient protocols to perform in parallel many reads and writes in private arrays according to private indices. The protocol is implemented on top of the Arithmetic Black Box (ABB and can be freely composed to build larger privacypreserving applications. For a large class of secure multiparty computation (SMC protocols, our technique has better practical and asymptotic performance than any previous ORAM technique that has been adapted for use in SMC.

  7. A secure multi-party computation solution to intersection problems of sets and rectangles

    Institute of Scientific and Technical Information of China (English)

    LI Shundong; DAI Yiqi; WANG Daoshun; LUO Ping

    2006-01-01

    Secure multi-party computation (SMC) is a research focus in international cryptographic community. At present, there is no SMC solution to the intersection problem of sets. In this paper, we first propose a SMC solution to this problem. Applying Cantor encoding method to computational geometry problems, and based on the solution to set-intersection problem, we further propose solutions to points inclusion problem and intersection problem of rectangles and further prove their privacy-preserving property with widely accepted simulation paradigm. Compared with the known solutions, these new solutions are of less computational complexity and less communication complexity, and have obvious superiority in computational and communication complexity.

  8. High-performance secure multi-party computation for data mining applications

    DEFF Research Database (Denmark)

    Bogdanov, Dan; Niitsoo, Margus; Toft, Tomas

    2012-01-01

    Secure multi-party computation (MPC) is a technique well suited for privacy-preserving data mining. Even with the recent progress in two-party computation techniques such as fully homomorphic encryption, general MPC remains relevant as it has shown promising performance metrics in real...... operations such as multiplication and comparison. Secondly, the confidential processing of financial data requires the use of more complex primitives, including a secure division operation. This paper describes new protocols in the Sharemind model for secure multiplication, share conversion, equality, bit...

  9. Experimental realization of an entanglement access network and secure multi-party computation

    Science.gov (United States)

    Chang, X.-Y.; Deng, D.-L.; Yuan, X.-X.; Hou, P.-Y.; Huang, Y.-Y.; Duan, L.-M.

    2016-07-01

    To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.

  10. Experimental realization of secure multi-party computation in an entanglement access to network

    CERN Document Server

    Chang, X Y; Yuan, X X; Hou, P Y; Huang, Y Y; Duan, L M

    2015-01-01

    To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.

  11. Experimental realization of an entanglement access network and secure multi-party computation

    Science.gov (United States)

    Chang, X.-Y.; Deng, D.-L.; Yuan, X.-X.; Hou, P.-Y.; Huang, Y.-Y.; Duan, L.-M.

    2016-01-01

    To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography. PMID:27404561

  12. Two Studies Examining Argumentation in Asynchronous Computer Mediated Communication

    Science.gov (United States)

    Joiner, Richard; Jones, Sarah; Doherty, John

    2008-01-01

    Asynchronous computer mediated communication (CMC) would seem to be an ideal medium for supporting development in student argumentation. This paper investigates this assumption through two studies. The first study compared asynchronous CMC with face-to-face discussions. The transactional and strategic level of the argumentation (i.e. measures of…

  13. A Domain-Specific Programming Language for Secure Multiparty Computation

    DEFF Research Database (Denmark)

    Nielsen, Janus Dam; Schwartzbach, Michael Ignatieff

    2007-01-01

    , but at the same time significant value can often be obtained by combining confidential information from various sources. This fundamental conflict between the benefits of confidentiality and the benefits of information sharing may be overcome using the cryptographic method of SMC where computations are performed...... on secret values and results are only revealed according to specific protocols. We identify the key linguistic concepts of SMC and bridge the gap between high-level security requirements and low-level cryptographic operations constituting an SMC platform, thus improving the efficiency and security of SMC...... application development. The language is implemented in a prototype compiler that generates Java code exploiting a distributed cryptographic runtime....

  14. Quantum And Relativistic Protocols For Secure Multi-Party Computation

    CERN Document Server

    Colbeck, Roger

    2009-01-01

    After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new protocol for non-relativistic strong coin tossing. This protocol matches the security of the best protocol known to date while using a conceptually different approach to achieve the task. In the second part variable bias coin tossing is introduced. This is a variant of coin tossing in which one party secretly chooses one of two biased coins to toss. It is shown that this can be achieved with unconditional security for a specified range of biases, and with cheat-evident security for any bias. We also discuss two further protocols which are conjectured to be unconditionally secure for any bias. The third section looks at other two-party secure computations for which, prior to our work, protocols and no-go theorems were unknown. We introduce a gene...

  15. A Secure Multi-Party Computation Protocol for Malicious Computation Prevention for preserving privacy during Data Mining

    CERN Document Server

    Mishra, Dr Durgesh Kumar; Kapoor, Nikhil; Bahety, Ravish

    2009-01-01

    Secure Multi-Party Computation (SMC) allows parties with similar background to compute results upon their private data, minimizing the threat of disclosure. The exponential increase in sensitive data that needs to be passed upon networked computers and the stupendous growth of internet has precipitated vast opportunities for cooperative computation, where parties come together to facilitate computations and draw out conclusions that are mutually beneficial; at the same time aspiring to keep their private data secure. These computations are generally required to be done between competitors, who are obviously weary of each-others intentions. SMC caters not only to the needs of such parties but also provides plausible solutions to individual organizations for problems like privacy-preserving database query, privacy-preserving scientific computations, privacy-preserving intrusion detection and privacy-preserving data mining. This paper is an extension to a previously proposed protocol Encrytpo_Random, which prese...

  16. Buffered Communication Analysis in Distributed Multiparty Sessions

    Science.gov (United States)

    Deniélou, Pierre-Malo; Yoshida, Nobuko

    Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchrony, the communication buffers can happen to grow inconsiderately over time. This paper proposes a static verification methodology based on multiparty session types which can efficiently compute the upper bounds on buffer sizes. Our analysis relies on a uniform causality audit of the entire collaboration pattern - an examination that is not always possible from each end-point type. We extend this method to design algorithms that allocate communication channels in order to optimise the memory requirements of session executions. From these analyses, we propose two refinements methods which respect buffer bounds: a global protocol refinement that automatically inserts confirmation messages to guarantee stipulated buffer sizes and a local protocol refinement to optimise asynchronous messaging without buffer overflow. Finally our work is applied to overcome a buffer overflow problem of the multi-buffering algorithm.

  17. Secure Multi-party Computation Protocol for Defense Applications in Military Operations Using Virtual Cryptography

    Science.gov (United States)

    Pathak, Rohit; Joshi, Satyadhar

    With the advent into the 20th century whole world has been facing the common dilemma of Terrorism. The suicide attacks on US twin towers 11 Sept. 2001, Train bombings in Madrid Spain 11 Mar. 2004, London bombings 7 Jul. 2005 and Mumbai attack 26 Nov. 2008 were some of the most disturbing, destructive and evil acts by terrorists in the last decade which has clearly shown their evil intent that they can go to any extent to accomplish their goals. Many terrorist organizations such as al Quaida, Harakat ul-Mujahidin, Hezbollah, Jaish-e-Mohammed, Lashkar-e-Toiba, etc. are carrying out training camps and terrorist operations which are accompanied with latest technology and high tech arsenal. To counter such terrorism our military is in need of advanced defense technology. One of the major issues of concern is secure communication. It has to be made sure that communication between different military forces is secure so that critical information is not leaked to the adversary. Military forces need secure communication to shield their confidential data from terrorist forces. Leakage of concerned data can prove hazardous, thus preservation and security is of prime importance. There may be a need to perform computations that require data from many military forces, but in some cases the associated forces would not want to reveal their data to other forces. In such situations Secure Multi-party Computations find their application. In this paper, we propose a new highly scalable Secure Multi-party Computation (SMC) protocol and algorithm for Defense applications which can be used to perform computation on encrypted data. Every party encrypts their data in accordance with a particular scheme. This encrypted data is distributed among some created virtual parties. These Virtual parties send their data to the TTP through an Anonymizer layer. TTP performs computation on encrypted data and announces the result. As the data sent was encrypted its actual value can’t be known by TTP

  18. Asynchronous Replica Exchange Software for Grid and Heterogeneous Computing

    Science.gov (United States)

    Gallicchio, Emilio; Xia, Junchao; Flynn, William F.; Zhang, Baofeng; Samlalsingh, Sade; Mentes, Ahmet; Levy, Ronald M.

    2015-01-01

    Parallel replica exchange sampling is an extended ensemble technique often used to accelerate the exploration of the conformational ensemble of atomistic molecular simulations of chemical systems. Inter-process communication and coordination requirements have historically discouraged the deployment of replica exchange on distributed and heterogeneous resources. Here we describe the architecture of a software (named ASyncRE) for performing asynchronous replica exchange molecular simulations on volunteered computing grids and heterogeneous high performance clusters. The asynchronous replica exchange algorithm on which the software is based avoids centralized synchronization steps and the need for direct communication between remote processes. It allows molecular dynamics threads to progress at different rates and enables parameter exchanges among arbitrary sets of replicas independently from other replicas. ASyncRE is written in Python following a modular design conducive to extensions to various replica exchange schemes and molecular dynamics engines. Applications of the software for the modeling of association equilibria of supramolecular and macromolecular complexes on BOINC campus computational grids and on the CPU/MIC heterogeneous hardware of the XSEDE Stampede supercomputer are illustrated. They show the ability of ASyncRE to utilize large grids of desktop computers running the Windows, MacOS, and/or Linux operating systems as well as collections of high performance heterogeneous hardware devices. PMID:27103749

  19. Asynchronous replica exchange software for grid and heterogeneous computing

    Science.gov (United States)

    Gallicchio, Emilio; Xia, Junchao; Flynn, William F.; Zhang, Baofeng; Samlalsingh, Sade; Mentes, Ahmet; Levy, Ronald M.

    2015-11-01

    Parallel replica exchange sampling is an extended ensemble technique often used to accelerate the exploration of the conformational ensemble of atomistic molecular simulations of chemical systems. Inter-process communication and coordination requirements have historically discouraged the deployment of replica exchange on distributed and heterogeneous resources. Here we describe the architecture of a software (named ASyncRE) for performing asynchronous replica exchange molecular simulations on volunteered computing grids and heterogeneous high performance clusters. The asynchronous replica exchange algorithm on which the software is based avoids centralized synchronization steps and the need for direct communication between remote processes. It allows molecular dynamics threads to progress at different rates and enables parameter exchanges among arbitrary sets of replicas independently from other replicas. ASyncRE is written in Python following a modular design conducive to extensions to various replica exchange schemes and molecular dynamics engines. Applications of the software for the modeling of association equilibria of supramolecular and macromolecular complexes on BOINC campus computational grids and on the CPU/MIC heterogeneous hardware of the XSEDE Stampede supercomputer are illustrated. They show the ability of ASyncRE to utilize large grids of desktop computers running the Windows, MacOS, and/or Linux operating systems as well as collections of high performance heterogeneous hardware devices.

  20. Students experiences with collaborative learning in asynchronous computer-supported collaborative learning environments.

    OpenAIRE

    Dewiyanti, Silvia; Brand-Gruwel, Saskia; Jochems, Wim; Broers, Nick

    2008-01-01

    Dewiyanti, S., Brand-Gruwel, S., Jochems, W., & Broers, N. (2007). Students experiences with collaborative learning in asynchronous computer-supported collaborative learning environments. Computers in Human Behavior, 23, 496-514.

  1. Research and Application of Secure Multi-Party Computation%安全多方计算技术研究与应用

    Institute of Scientific and Technical Information of China (English)

    张卷美; 徐荣华

    2016-01-01

    认为同态密码的本质是通过密文运算,实现相对应的明文运算。基于同态密码、格理论密码,分别设计了安全多方计算协议,解决了安全两方线段求解直线相交问题和聚类分析中一种经常遇到的加权平均问题。认为目前安全多方计算的实际应用比较滞后,但随着其理论的不断成熟以及各种密码理论基础技术的不断发展,安全多方计算最终会为新时代下的信息安全提供服务。%The essence of homomorphic encryption is to realize the corresponding plaintext operation by calculating cipher text. In this paper, we propose some secure multi-party computation schemes based on homomorphic encryption and lattice theory. With these protocols, the secure two-party line segment intersection problem and weighted-average problem, which are often encountered when solving the problem of clustering analysis, are solved. Practical application of secure multi-party computation is lagging, but with the continuous development of its theory and various kinds of cryptography, secure multi-party computation wil increase information security in the future.

  2. Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Nielsen, Jesper Buus; Toft, Tomas

    2006-01-01

    We show that if a set of players hold shares of a value aFp for some prime p (where the set of shares is written [a] p ), it is possible to compute, in constant rounds and with unconditional security, sharings of the bits of a, i.e., compute sharings [a 0] p , ..., [a ℓ− − 1] p such that ℓ = ⌈ log2...

  3. An Examination of Computer Engineering Students' Perceptions about Asynchronous Discussion Forums

    Science.gov (United States)

    Ozyurt, Ozcan; Ozyurt, Hacer

    2013-01-01

    This study was conducted in order to reveal the usage profiles and perceptions of Asynchronous Discussion Forums (ADFs) of 126 computer engineering students from the Computer Engineering Department in a university in Turkey. By using a mixed methods research design both quantitative and qualitative data were collected and analyzed. Research…

  4. Establishing Goals and Maintaining Coherence in Multiparty Computer-Mediated Communication

    Science.gov (United States)

    Groen, Martin; Noyes, Jan

    2013-01-01

    Communicating via text-only computer-mediated communication (CMC) channels is associated with a number of issues that would impair users in achieving dialogue coherence and goals. It has been suggested that humans have devised novel adaptive strategies to deal with those issues. However, it could be that humans rely on "classic"…

  5. Computer Learner Corpora: Analysing Interlanguage Errors in Synchronous and Asynchronous Communication

    Science.gov (United States)

    MacDonald, Penny; Garcia-Carbonell, Amparo; Carot, Sierra, Jose Miguel

    2013-01-01

    This study focuses on the computer-aided analysis of interlanguage errors made by the participants in the telematic simulation IDEELS (Intercultural Dynamics in European Education through on-Line Simulation). The synchronous and asynchronous communication analysed was part of the MiLC Corpus, a multilingual learner corpus of texts written by…

  6. Ecological Affordance and Anxiety in an Oral Asynchronous Computer-Mediated Environment

    Science.gov (United States)

    McNeil, Levi

    2014-01-01

    Previous research suggests that the affordances (van Lier, 2000) of asynchronous computer-mediated communication (ACMC) environments help reduce foreign language anxiety (FLA). However, FLA is rarely the focus of these studies and research has not adequately addressed the relationship between FLA and the affordances that students use. This study…

  7. Research Notes ~ Simulating the Computer Science Closed Laboratory in an Asynchronous Learning Network

    Directory of Open Access Journals (Sweden)

    Timothy Margush

    2002-10-01

    Full Text Available The quiz tool that is part of the WebCT package is used to provide an asynchronous simulation of a (synchronous closed laboratory experience to beginner computer science students. The technique suggested in this paper and which may be applied to other disciplines, offers students a guided path through an exploratory, discovery based learning experience.

  8. An efficient algorithm for computing attractors of synchronous and asynchronous Boolean networks.

    Directory of Open Access Journals (Sweden)

    Desheng Zheng

    Full Text Available Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD, we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly [Formula: see text] faster in computing attractors for empirical experimental systems.The software package is available at https://sites.google.com/site/desheng619/download.

  9. An Efficient Algorithm for Computing Attractors of Synchronous And Asynchronous Boolean Networks

    Science.gov (United States)

    Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei

    2013-01-01

    Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840

  10. Evaluation of a Computer-Based, Asynchronous Activity on Student Learning of Leadership Concepts.

    Science.gov (United States)

    Boyd, Barry L.; Murphrey, Theresa Pesl

    2002-01-01

    Students taught leadership and ethics using asynchronous computer simulation (n=83) were compared with 113 taught conventionally. The treatment group performed better on questions written at the knowledge, comprehension, and analysis levels of Bloom's Taxonomy, regardless of learning mode preferences. (Contains 26 references.) (SK)

  11. THE ROLE OF OFFLINE METALANGUAGE TALK IN ASYNCHRONOUS COMPUTER-MEDIATED COMMUNICATION

    Directory of Open Access Journals (Sweden)

    Keiko Kitade

    2008-02-01

    Full Text Available In order to demonstrate how learners utilize the text-based asynchronous attributes of the Bulletin Board System, this study explored Japanese-as-a-second-language learners' metalanguage episodes (Swain & Lapkin, 1995, 1998 in offline verbal peer speech and online asynchronous discussions with their Japanese key pals. The findings suggest the crucial role of offline collaborative dialogue, the interactional modes in which the episodes occur, and the unique discourse structure of metalanguage episodes concerning online and offline interactions. A high score on the posttest also suggests the high retention of linguistic knowledge constructed through offline peer dialogue. In the offline mode, the learners were able to collaboratively construct knowledge with peers in the stipulated time, while simultaneously focusing on task content in the online interaction. The retrospective interviews and questionnaires reveal the factors that could affect the benefits of the asynchronous computer-mediated communication medium for language learning.

  12. Differences in Electronic Exchanges in Synchronous and Asynchronous Computer-Mediated Communication: The Effect of Culture as a Mediating Variable

    Science.gov (United States)

    Angeli, Charoula; Schwartz, Neil H.

    2016-01-01

    Two hundred and eighty undergraduates from universities in two countries were asked to read didactic material, and then think and write about potential solutions to an ill-defined problem. The writing was conducted within a synchronous or asynchronous computer-mediated communication (CMC) environment. Asynchronous CMC took the form of email…

  13. Partition Arguments in Multiparty Communication Complexity

    NARCIS (Netherlands)

    Draisma, J.; Kushilevitz, E.; Weinreb, E.; Albers, S.; et al, not CWI

    2009-01-01

    Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x_1,..,x_k in {0, 1}^n (respectively) communicate in order to compute the value f(x_1,...,x_k). The main lower bound technique for the communication complexity of such problems is that of partitio

  14. Asynchronous P300 classification in a reactive brain-computer interface during an outlier detection task

    Science.gov (United States)

    Krumpe, Tanja; Walter, Carina; Rosenstiel, Wolfgang; Spüler, Martin

    2016-08-01

    Objective. In this study, the feasibility of detecting a P300 via an asynchronous classification mode in a reactive EEG-based brain-computer interface (BCI) was evaluated. The P300 is one of the most popular BCI control signals and therefore used in many applications, mostly for active communication purposes (e.g. P300 speller). As the majority of all systems work with a stimulus-locked mode of classification (synchronous), the field of applications is limited. A new approach needs to be applied in a setting in which a stimulus-locked classification cannot be used due to the fact that the presented stimuli cannot be controlled or predicted by the system. Approach. A continuous observation task requiring the detection of outliers was implemented to test such an approach. The study was divided into an offline and an online part. Main results. Both parts of the study revealed that an asynchronous detection of the P300 can successfully be used to detect single events with high specificity. It also revealed that no significant difference in performance was found between the synchronous and the asynchronous approach. Significance. The results encourage the use of an asynchronous classification approach in suitable applications without a potential loss in performance.

  15. Asynchronous Distributed Execution of Fixpoint-Based Computational Fields

    DEFF Research Database (Denmark)

    Lluch Lafuente, Alberto; Loreti, Michele; Montanari, Ugo

    2016-01-01

    Coordination is essential for dynamic distributed systems whose components exhibit interactive and autonomous behaviors. Spatially distributed, locally interacting, propagating computational fields are particularly appealing for allowing components to join and leave with little or no overhead....... Computational fields are a key ingredient of aggregate programming, a promising software engineering methodology particularly relevant for the Internet of Things. In our approach, space topology is represented by a fixed graph-shaped field, namely a network with attributes on both nodes and arcs, where arcs...

  16. ASYNCHRONOUS COMPUTER-MEDIATED CORRECTIVE FEEDBACK AND THE CORRECT USE OF PREPOSITIONS: Is It Really Effective?

    Directory of Open Access Journals (Sweden)

    Seyyed Behrooz HOSSEINI

    2012-08-01

    Full Text Available An area that has recently attracted increasing attention is providing feedback on learners’ writing accuracy through the Internet. However, research in this area has largely focused on synchronous communication, i.e., chatting, with fewer studies assessing asynchronous technologies, i.e., e-mailing. Therefore, this study investigates the effectiveness of asynchronous computer-mediated corrective feedback-explicit and implicit, on increasing the correct use of prepositions. Forty-five Iranian elementary EFL learners at the ILI in Tehran were randomly assigned to two experimental groups, receiving explicit and implicit corrective feedback respectively, and one control group receiving no corrective feedback. Each group included 15 participants. After the treatment, a post-test was administered to assess the probable increase in the correct use of prepositions for the experimental groups compared to the control group. Analysis of the results through a one-way ANOVA revealed that the experimental group 1 who received explicit corrective feedback significantly outperformed the experimental group 2 and the control group. The experimental group 2 who received implicit corrective feedback showed no significant improvement over the experimental group 1 and the control group. Computer-mediated communication, asynchronous CMC, synchronous CMC, the Internet, corrective feedback, e-mail, chat. Although the findings support the current view on feedback through technology, due to the scarcity of research, more investigation is merited as there is much to gain regarding this burgeoning field.

  17. Distance Based Asynchronous Recovery Approach In Mobile Computing Environment

    Directory of Open Access Journals (Sweden)

    Yogita Khatri,

    2012-06-01

    Full Text Available A mobile computing system is a distributed system in which at least one of the processes is mobile. They are constrained by lack of stable storage, low network bandwidth, mobility, frequent disconnection andlimited battery life. Checkpointing is one of the commonly used techniques to provide fault tolerance in mobile computing environment. In order to suit the mobile environment a distance based recovery schemeis proposed which is based on checkpointing and message logging. After the system recovers from failures, only the failed processes rollback and restart from their respective recent checkpoints, independent of the others. The salient feature of this scheme is to reduce the transfer and recovery cost. While the mobile host moves with in a specific range, recovery information is not moved and thus only be transferred nearby if the mobile host moves out of certain range.

  18. Tiling and Asynchronous Communication Optimizations for Stencil Computations

    KAUST Repository

    Malas, Tareq

    2015-12-07

    The importance of stencil-based algorithms in computational science has focused attention on optimized parallel implementations for multilevel cache-based processors. Temporal blocking schemes leverage the large bandwidth and low latency of caches to accelerate stencil updates and approach theoretical peak performance. A key ingredient is the reduction of data traffic across slow data paths, especially the main memory interface. Most of the established work concentrates on updating separate cache blocks per thread, which works on all types of shared memory systems, regardless of whether there is a shared cache among the cores. This approach is memory-bandwidth limited in several situations, where the cache space for each thread can be too small to provide sufficient in-cache data reuse. We introduce a generalized multi-dimensional intra-tile parallelization scheme for shared-cache multicore processors that results in a significant reduction of cache size requirements and shows a large saving in memory bandwidth usage compared to existing approaches. It also provides data access patterns that allow efficient hardware prefetching. Our parameterized thread groups concept provides a controllable trade-off between concurrency and memory usage, shifting the pressure between the memory interface and the Central Processing Unit (CPU).We also introduce efficient diamond tiling structure for both shared memory cache blocking and distributed memory relaxed-synchronization communication, demonstrated using one-dimensional domain decomposition. We describe the approach and our open-source testbed implementation details (called Girih), present performance results on contemporary Intel processors, and apply advanced performance modeling techniques to reconcile the observed performance with hardware capabilities. Furthermore, we conduct a comparison with the state-of-the-art stencil frameworks PLUTO and Pochoir in shared memory, using corner-case stencil operators. We study the

  19. Self-calibration algorithm in an asynchronous P300-based brain-computer interface

    Science.gov (United States)

    Schettini, F.; Aloise, F.; Aricò, P.; Salinari, S.; Mattia, D.; Cincotti, F.

    2014-06-01

    Objective. Reliability is a desirable characteristic of brain-computer interface (BCI) systems when they are intended to be used under non-experimental operating conditions. In addition, their overall usability is influenced by the complex and frequent procedures that are required for configuration and calibration. Earlier studies examined the issue of asynchronous control in P300-based BCIs, introducing dynamic stopping and automatic control suspension features. This report proposes and evaluates an algorithm for the automatic recalibration of the classifier's parameters using unsupervised data. Approach. Ten healthy subjects participated in five P300-based BCI sessions throughout a single day. First, we examined whether continuous adaptation of control parameters improved the accuracy of the asynchronous system over time. Then, we assessed the performance of the self-calibration algorithm with respect to the no-recalibration and supervised calibration conditions with regard to system accuracy and communication efficiency. Main results. Offline tests demonstrated that continuous adaptation of the control parameters significantly increased the communication efficiency of asynchronous P300-based BCIs. The self-calibration algorithm correctly assigned labels to unsupervised data with 95% accuracy, effecting communication efficiency that was comparable with that of supervised repeated calibration. Significance. Although additional online tests that involve end-users under non-experimental conditions are needed, these preliminary results are encouraging, from which we conclude that the self-calibration algorithm is a promising solution to improve P300-based BCI usability and reliability.

  20. Merging Multiparty Protocols in Multiparty Choreographies

    Directory of Open Access Journals (Sweden)

    Fabrizio Montesi

    2013-02-01

    Full Text Available Choreography-based programming is a powerful paradigm for defining communication-based systems from a global viewpoint. A choreography can be checked against multiparty protocol specifications, given as behavioural types, that may be instantiated indefinitely at runtime. Each protocol instance is started with a synchronisation among the involved peers. We analyse a simple transformation from a choreography with a possibly unbounded number of protocol instantiations to a choreography instantiating a single protocol, which is the merge of the original ones. This gives an effective methodology for obtaining new protocols by composing existing ones. Moreover, by removing all synchronisations required for starting protocol instances, our transformation reduces the number of communications and resources needed to execute a choreography.

  1. Multiparty Quantum Cryptographic Protocol

    Institute of Scientific and Technical Information of China (English)

    M. Ramzan; M. K. Khan

    2008-01-01

    We propose a multiparty quantum cryptographic protocol. Unitary operators applied by Bob and Charlie, on their respective qubits of a tripartite entangled state encoding a classical symbol that can be decoded at Alice's end with the help of a decoding matrix. Eve's presence can be detected by the disturbance of the decoding matrix. Our protocol is secure against intercept-resend attacks. Furthermore, it is efficient and deterministic in the sense that two classical bits can be transferred per entangled pair of qubits. It is worth mentioning that in this protocol, the same symbol can be used for key distribution and Eve's detection that enhances the effciency of the protocol.

  2. Automatic analysis of multiparty meetings

    Indian Academy of Sciences (India)

    Steve Renals

    2011-10-01

    This paper is about the recognition and interpretation of multiparty meetings captured as audio, video and other signals. This is a challenging task since the meetings consist of spontaneous and conversational interactions between a number of participants: it is a multimodal, multiparty, multistream problem. We discuss the capture and annotation of the Augmented Multiparty Interaction (AMI) meeting corpus, the development of a meeting speech recognition system, and systems for the automatic segmentation, summarization and social processing of meetings, together with some example applications based on these systems.

  3. Effects of Synchronous and Asynchronous Computer-Mediated Communication (CMC) Oral Conversations on English Language Learners' Discourse Functions

    Science.gov (United States)

    AbuSeileek, Ali Farhan; Qatawneh, Khaleel

    2013-01-01

    This study aimed to explore the effects of synchronous and asynchronous computer mediated communication (CMC) oral discussions on question types and strategies used by English as a Foreign Language (EFL) learners. The participants were randomly assigned to two treatment conditions/groups; the first group used synchronous CMC, while the second…

  4. The Effects of Computer-Mediated Synchronous and Asynchronous Direct Corrective Feedback on Writing: A Case Study

    Science.gov (United States)

    Shintani, Natsuko

    2016-01-01

    This case study investigated the characteristics of computer-mediated synchronous corrective feedback (SCF, provided while students wrote) and asynchronous corrective feedback (ACF, provided after students had finished writing) in an EFL writing task. The task, designed to elicit the use of the hypothetical conditional, was completed by two…

  5. Asynchronous P300-based brain-computer interface to control a virtual environment: initial tests on end users.

    Science.gov (United States)

    Aloise, Fabio; Schettini, Francesca; Aricò, Pietro; Salinari, Serenella; Guger, Christoph; Rinsma, Johanna; Aiello, Marco; Mattia, Donatella; Cincotti, Febo

    2011-10-01

    Motor disability and/or ageing can prevent individuals from fully enjoying home facilities, thus worsening their quality of life. Advances in the field of accessible user interfaces for domotic appliances can represent a valuable way to improve the independence of these persons. An asynchronous P300-based Brain-Computer Interface (BCI) system was recently validated with the participation of healthy young volunteers for environmental control. In this study, the asynchronous P300-based BCI for the interaction with a virtual home environment was tested with the participation of potential end-users (clients of a Frisian home care organization) with limited autonomy due to ageing and/or motor disabilities. System testing revealed that the minimum number of stimulation sequences needed to achieve correct classification had a higher intra-subject variability in potential end-users with respect to what was previously observed in young controls. Here we show that the asynchronous modality performed significantly better as compared to the synchronous mode in continuously adapting its speed to the users' state. Furthermore, the asynchronous system modality confirmed its reliability in avoiding misclassifications and false positives, as previously shown in young healthy subjects. The asynchronous modality may contribute to filling the usability gap between BCI systems and traditional input devices, representing an important step towards their use in the activities of daily living.

  6. Learner Perceptions of Asynchronous Oral Computer-mediated Communication: Proficiency and Second Langauge Selves

    Directory of Open Access Journals (Sweden)

    Jesse Gleason

    2012-06-01

    Full Text Available Abstract The present study addresses the perceptions of international teaching assistants regarding the role of language learning tasks using Wimba Voice (WV in aiding the improvement of their second language (L2 oral skills. It specifically examines how this asynchronous computer-mediated communication (CMC technology can foster the development of these learners’ L2 selves. According to Dörnyei (2009, the more clearly learners can envision their future L2 selves, the more motivated they will be to achieve their L2 goals. With increased planning of oral production, access to instructor and peer feedback, and additional opportunities for self-reflection, asynchronous CMC technologies have been found to enable L2 learners to express their thoughts at their own pace and feel more relaxed and confident than in more threatening face-to-face situations (Sun, 2009. The findings suggest that learners have a variety of opinions regarding the role of asynchronous WV tasks in motivating them to develop their L2 oral proficiency. Also, many may prefer oral CMC environments that facilitate interaction and meaning negotiation. Results were inconclusive concerning the effect of WV-based tasks on students' perceptions of their future L2 selves; however, this may have been due to the short time frame in which these activities were employed. Résumé Nous étudions ici les perceptions d’un groupe d’assistants internationaux sur le rôle des tâches d’apprentissage linguistique à l’aide de Wimba Voice (WV. Le projet avait pour but d’améliorer les compétences orales des participants dans leur langue seconde. La présente étude examine en particulier la voie par laquelle cette technologie de la communication asynchrone par ordinateur peut favoriser l’évolution de la langue seconde des apprenants. Selon Dörnyei (2009, plus les apprenants peuvent envisager clairement un futur emploi de leur langue seconde, plus ils seront motivés à atteindre

  7. Multiparty Symmetric Sum Types

    DEFF Research Database (Denmark)

    Nielsen, Lasse; Yoshida, Nobuko; Honda, Kohei

    2010-01-01

    This paper introduces a new theory of multiparty session types based on symmetric sum types, by which we can type non-deterministic orchestration choice behaviours. While the original branching type in session types can represent a choice made by a single participant and accepted by others...... determining how the session proceeds, the symmetric sum type represents a choice made by agreement among all the participants of a session. Such behaviour can be found in many practical systems, including collaborative workflow in healthcare systems for clinical practice guidelines (CPGs). Processes...... with the symmetric sums can be embedded into the original branching types using conductor processes. We show that this type-driven embedding preserves typability, satisfies semantic soundness and completeness, and meets the encodability criteria adapted to the typed setting. The theory leads to an efficient...

  8. Computationally Efficient Blind Code Synchronization for Asynchronous DS-CDMA Systems with Adaptive Antenna Arrays

    Directory of Open Access Journals (Sweden)

    Chia-Chang Hu

    2005-04-01

    Full Text Available A novel space-time adaptive near-far robust code-synchronization array detector for asynchronous DS-CDMA systems is developed in this paper. There are the same basic requirements that are needed by the conventional matched filter of an asynchronous DS-CDMA system. For the real-time applicability, a computationally efficient architecture of the proposed detector is developed that is based on the concept of the multistage Wiener filter (MWF of Goldstein and Reed. This multistage technique results in a self-synchronizing detection criterion that requires no inversion or eigendecomposition of a covariance matrix. As a consequence, this detector achieves a complexity that is only a linear function of the size of antenna array (J, the rank of the MWF (M, the system processing gain (N, and the number of samples in a chip interval (S, that is, 𝒪(JMNS. The complexity of the equivalent detector based on the minimum mean-squared error (MMSE or the subspace-based eigenstructure analysis is a function of 𝒪((JNS3. Moreover, this multistage scheme provides a rapid adaptive convergence under limited observation-data support. Simulations are conducted to evaluate the performance and convergence behavior of the proposed detector with the size of the J-element antenna array, the amount of the L-sample support, and the rank of the M-stage MWF. The performance advantage of the proposed detector over other DS-CDMA detectors is investigated as well.

  9. Efficient multiparty protocols via log-depth threshold formulae

    DEFF Research Database (Denmark)

    Cohen, Gil; Damgård, Ivan Bjerre; Ishai, Yuval;

    2013-01-01

    We put forward a new approach for the design of efficient multiparty protocols: Design a protocol π for a small number of parties (say, 3 or 4) which achieves security against a single corrupted party. Such protocols are typically easy to construct, as they may employ techniques that do not scale...... of efficient protocols for Secure Multiparty Computation (MPC) in the presence of an honest majority, as well as broadcast protocols from point-to-point channels and a 2-cast primitive. We obtain new results on MPC over blackbox groups and other algebraic structures. The above results rely on the following...

  10. General polygamy inequality of multiparty quantum entanglement

    Science.gov (United States)

    Kim, Jeong San

    2012-06-01

    Using entanglement of assistance, we establish a general polygamy inequality of multiparty entanglement in arbitrary-dimensional quantum systems. For multiparty closed quantum systems, we relate our result with the monogamy of entanglement, and clarify that the entropy of entanglement bounds both monogamy and polygamy of multiparty quantum entanglement.

  11. Multiparty Quantum Secret Report

    Institute of Scientific and Technical Information of China (English)

    DENG Fu-Guo; LI Xi-Han; LI Chun-Yan; ZHOU Ping; LIANG Yu-Jie; ZHOU Hong-Yu

    2006-01-01

    @@ A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her M agents first share a sequence of (M + 1)-particle Greenberger-Horne-Zeilinger (GHZ) states that only Alice knows which state each (M + 1)-particle quantum system is in. Each agent exploits a controlled-not (CNot) gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a σx operation on her particle in the GHZ state or not.After the GHZ states (the quantum key) are used up, the parties check whether there is a vicious eavesdropper,say Eve, monitoring the quantum line, by picking out some samples from the GHZ states shared and measuring them with two measuring bases. After confirming the security of the quantum key, they use the remaining GHZ states repeatedly for the next round of quantum communication. This scheme has the advantage of high intrinsic efficiency for the qubits and total efficiency.

  12. Quantum channel capacities - multiparty communication

    CERN Document Server

    Demianowicz, M; Demianowicz, Maciej; Horodecki, Pawel

    2006-01-01

    We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of minimal subspace transmission fidelity and entanglement transmission fidelity. We also provide alternative, local, versions of fidelities and show their equivalence to the global ones in context of capacity regions defined. The equivalence of two different capacity notions with respect to two types of the fidelities is proven. In analogy to bipartite case it is shown, via sufficiency of isometric encoding theorem, that additional classical forward side channel does not increase capacity region of any quantum channel with $k$ senders and $m$ receivers which represents a compact unit of general quantum networks theory. The result proves that recently provided capacity region of multiple access channel ([M. Horodecki et al, Nature {\\bf 436} 673 (2005)], [J.Yard et al, quant-ph/0...

  13. P300-based brain-computer interface for environmental control: an asynchronous approach

    Science.gov (United States)

    Aloise, F.; Schettini, F.; Aricò, P.; Leotta, F.; Salinari, S.; Mattia, D.; Babiloni, F.; Cincotti, F.

    2011-04-01

    Brain-computer interface (BCI) systems allow people with severe motor disabilities to communicate and interact with the external world. The P300 potential is one of the most used control signals for EEG-based BCIs. Classic P300-based BCIs work in a synchronous mode; the synchronous control assumes that the user is constantly attending to the stimulation, and the number of stimulation sequences is fixed a priori. This issue is an obstacle for the use of these systems in everyday life; users will be engaged in a continuous control state, their distractions will cause misclassification and the speed of selection will not take into account users' current psychophysical condition. An efficient BCI system should be able to understand the user's intentions from the ongoing EEG instead. Also, it has to refrain from making a selection when the user is engaged in a different activity and it should increase or decrease its speed of selection depending on the current user's state. We addressed these issues by introducing an asynchronous BCI and tested its capabilities for effective environmental monitoring, involving 11 volunteers in three recording sessions. Results show that this BCI system can increase the bit rate during control periods while the system is proved to be very efficient in avoiding false negatives when the users are engaged in other tasks.

  14. Hybrid EEG-fNIRS Asynchronous Brain-Computer Interface for Multiple Motor Tasks.

    Directory of Open Access Journals (Sweden)

    Alessio Paolo Buccino

    Full Text Available Non-invasive Brain-Computer Interfaces (BCI have demonstrated great promise for neuroprosthetics and assistive devices. Here we aim to investigate methods to combine Electroencephalography (EEG and functional Near-Infrared Spectroscopy (fNIRS in an asynchronous Sensory Motor rhythm (SMR-based BCI. We attempted to classify 4 different executed movements, namely, Right-Arm-Left-Arm-Right-Hand-Left-Hand tasks. Previous studies demonstrated the benefit of EEG-fNIRS combination. However, since normally fNIRS hemodynamic response shows a long delay, we investigated new features, involving slope indicators, in order to immediately detect changes in the signals. Moreover, Common Spatial Patterns (CSPs have been applied to both EEG and fNIRS signals. 15 healthy subjects took part in the experiments and since 25 trials per class were available, CSPs have been regularized with information from the entire population of participants and optimized using genetic algorithms. The different features have been compared in terms of performance and the dynamic accuracy over trials shows that the introduced methods diminish the fNIRS delay in the detection of changes.

  15. Multiparty Computation for Dishonest Majority

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Orlandi, Claudio

    2010-01-01

    theory and practice. We propose a new protocol to securely evaluate reactive arithmetic circuits, that offers security against an active adversary in the universally composable security framework. Instead of the "do-and-compile" approach (where the parties use zero-knowledge proofs to show...... that they are following the protocol) our key ingredient is an efficient version of the "cut-and-choose" technique, that allow us to achieve active security for just a (small) constant amount of work more than for passive security....

  16. Identity formation in multiparty negotiations

    NARCIS (Netherlands)

    Swaab, R; Postmes, T.; Spears, R.

    2008-01-01

    Based on the recently proposed Interactive Model of Identity Formation, we examine how top-down deductive and bottom-up inductive identity formations influence intentions and behaviour in multiparty negotiations. Results show that a shared identity can be deduced from the social context through reco

  17. Student participation and interactivity using asynchronous computer-mediated communication for resolution of an undergraduate capstone management case study.

    Science.gov (United States)

    Miller, Paulette J

    2012-01-01

    Online discussion activities are designed for computer-mediated learning activities in face-to-face, hybrid, and totally online courses. The use of asynchronous computer-mediated communication (A-CMC) coupled with authentic workplace case studies provides students in the protected learning environment with opportunities to practice workplace decision making and communication. In this study, communication behaviors of transmitter and receiver were analyzed to determine participation and interactivity in communication among small-group participants in a health information management capstone management course.

  18. Study of the asynchronous traction drive's operating modes by computer simulation. Part 1: Problem formulation and computer model

    Directory of Open Access Journals (Sweden)

    Pavel KOLPAHCHYAN

    2015-06-01

    Full Text Available In this paper, the problems arising from the design of electric locomotives with asynchronous traction drive (with three-phase AC induction motors are considered as including the debugging of control algorithms. The electrical circuit provides the individual (by axle control of traction motors. This allows realizing the operational disconnection/connection of one or more axles in the automatic mode, with account of actual load. In perspective, the evaluation of locomotive's energy efficiency at the realization of various control algorithms must be obtained. Another objective is to research the dynamic processes in various modes of the electric locomotive operation (start and acceleration, traction regime, coasting movement, wheel-slide protection, etc. To solve these problems, a complex computer model based on the representation of AC traction drive as controlled electromechanical system, is developed in Part 1. The description of methods applied in modeling of traction drive elements (traction motors, power converters, control systems, as well as of mechanical part and of "wheel-rail" contact, is given. The control system provides the individual control of the traction motors. Part 2 of the paper focuses on the results of dynamic processes modeling in various modes of electric locomotive operation.

  19. Multi-Party Pseudo-Telepathy

    CERN Document Server

    Brassard, G; Tapp, A; Brassard, Gilles; Broadbent, Anne; Tapp, Alain

    2003-01-01

    Quantum entanglement, perhaps the most non-classical manifestation of quantum information theory, cannot be used to transmit information between remote parties. Yet, it can be used to reduce the amount of communication required to process a variety of distributed computational tasks. We speak of pseudo-telepathy when quantum entanglement serves to eliminate the classical need to communicate. In earlier examples of pseudo-telepathy, classical protocols could succeed with high probability unless the inputs were very large. Here we present a simple multi-party distributed problem for which the inputs and outputs consist of a single bit per player, and we present a perfect quantum protocol for it. We prove that no classical protocol can succeed with a probability that differs from 1/2 by more than a fraction that is exponentially small in the number of players. This could be used to circumvent the detection loophole in experimental tests of nonlocality.

  20. Multiparty Session Types as Coherence Proofs

    DEFF Research Database (Denmark)

    Carbone, Marco; Montesi, Fabrizio; Schürmann, Carsten;

    2015-01-01

    We propose a Curry-Howard correspondence between a language for programming multiparty sessions and a generalisation of Classical Linear Logic (CLL). In this framework, propositions correspond to the local behaviour of a participant in a multiparty session type, proofs to processes, and proof...

  1. 7 CFR 1726.203 - Multiparty negotiation.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 11 2010-01-01 2010-01-01 false Multiparty negotiation. 1726.203 Section 1726.203... negotiation. Multiparty negotiation may only be used where permitted under subpart F of this part or where... negotiation: (a) Selection of qualified bidders. The borrower (acting through its engineer, if...

  2. Ownership Proofs of Digital Works Based on Secure Multiparty Computation%基于安全多方计算的数字作品所有权证明

    Institute of Scientific and Technical Information of China (English)

    朱岩; 杨永田; 孙中伟; 冯登国

    2006-01-01

    Ownership proofs of digital works allow to justify the copyright claim to the buyers without revealing any secret information and prevent the owner from deceiving without the assumption of the trus ted individual. This paper proposes an ownership proofs scheme for digital works based on proactive verifiable secret sharing and secure multiparty computation. In the proposed scheme, verifiable secret sharing ensures the correctness of ownership secrets and achieves security against cheating participants. Proactive security provides an automatic recovery feature to maintain the integrity and security of secret throughout the lifetime of the scheme. Furthermore,the ownership verification is implemented by using secure multiparty computation and zero-knowledge proofs with homomorphic commitments. Without the assumption of the existence of a trusted individual, the proposed scheme can provide effective computation and discover the dishonesty if not too many individuals collude.%数字作品的所有权证明允许在不泄漏任何秘密信息和防止所有者欺骗的前提下,对版权声明进行验证.提出一种基于Proactive可验证秘密共享和安全多方计算的数字作品所有权证明方案.在该方案中,可验证秘密共享,保证了所有权秘密的正确性,并防止对协议参与者的欺骗.通过Proactive安全提供自动恢复功能来保证协议生存周期内秘密的完整性和安全性.使用安全多方计算和同态承诺的零知识证明,实现了所有权验证.在不假设可信方存在的前提下,所提出方案能够在没有太多成员合谋的情况下,完成有效计算并发现不忠实成员.

  3. XMPP for cloud computing in bioinformatics supporting discovery and invocation of asynchronous web services

    Directory of Open Access Journals (Sweden)

    Willighagen Egon L

    2009-09-01

    Full Text Available Abstract Background Life sciences make heavily use of the web for both data provision and analysis. However, the increasing amount of available data and the diversity of analysis tools call for machine accessible interfaces in order to be effective. HTTP-based Web service technologies, like the Simple Object Access Protocol (SOAP and REpresentational State Transfer (REST services, are today the most common technologies for this in bioinformatics. However, these methods have severe drawbacks, including lack of discoverability, and the inability for services to send status notifications. Several complementary workarounds have been proposed, but the results are ad-hoc solutions of varying quality that can be difficult to use. Results We present a novel approach based on the open standard Extensible Messaging and Presence Protocol (XMPP, consisting of an extension (IO Data to comprise discovery, asynchronous invocation, and definition of data types in the service. That XMPP cloud services are capable of asynchronous communication implies that clients do not have to poll repetitively for status, but the service sends the results back to the client upon completion. Implementations for Bioclipse and Taverna are presented, as are various XMPP cloud services in bio- and cheminformatics. Conclusion XMPP with its extensions is a powerful protocol for cloud services that demonstrate several advantages over traditional HTTP-based Web services: 1 services are discoverable without the need of an external registry, 2 asynchronous invocation eliminates the need for ad-hoc solutions like polling, and 3 input and output types defined in the service allows for generation of clients on the fly without the need of an external semantics description. The many advantages over existing technologies make XMPP a highly interesting candidate for next generation online services in bioinformatics.

  4. Understanding the Dynamics of Collaborative Multi-Party Discourse

    Energy Technology Data Exchange (ETDEWEB)

    Cowell, Andrew J.; Gregory, Michelle L.; Bruce, Joseph R.; Haack, Jereme N.; Love, Douglas V.; Rose, Stuart J.; Andrew, Adrienne H.

    2006-12-01

    In this manuscript, we discuss the efforts underway at the Pacific Northwest National Laboratory in understanding the dynamics of multi-party discourse across a number of communication mo-dalities, such as email, instant messaging traffic and meeting data. Two prototype systems are dis-cussed. The Conversation Analysis Tool (ChAT) is an experimental test-bed for the development of computational linguistic components, and provides users with the ability to easily identify top-ics or persons of interest within multi-party conversations, including who talked to whom, when, entities that were discussed, etc. The Retrospective Analysis of Communication Events (RACE) prototype, leveraging many of the ChAT components, is an application built specifically for knowledge workers and focuses on merging different types of communications data so that the underlying message can be discovered in an efficient, timely fashion.

  5. Multi-Party Quantum Steganography

    Science.gov (United States)

    Mihara, Takashi

    2017-02-01

    Steganography has been proposed as a data hiding technique. As a derivation, quantum steganography based on quantum physics has also been proposed. In this paper, we extend the results in presented (Mihara, Phys. Lett. 379, 952 2015) and propose a multi-party quantum steganography technique that combines quantum error-correcting codes with entanglement. The proposed protocol shares an entangled state among n +1 parties and sends n secret messages, corresponding to the n parties, to the other party. With no knowledge of the other secret messages, the n parties can construct a stego message by cooperating with each other. Finally, we propose a protocol for sending qubits using the same technique.

  6. Labeled Postings for Asynchronous Interaction

    Science.gov (United States)

    ChanLin, Lih-Juan; Chen, Yong-Ting; Chan, Kung-Chi

    2009-01-01

    The Internet promotes computer-mediated communications, and so asynchronous learning network systems permit more flexibility in time, space, and interaction than synchronous mode of learning. The key point of asynchronous learning is the materials for web-aided teaching and the flow of knowledge. This research focuses on improving online…

  7. The Impact of Asynchronous Computer-Assisted Language Learning Approaches on English as a Foreign Language High and Low Achievers' Vocabulary Retention and Recall

    Science.gov (United States)

    Gorjian, Bahman; Moosavinia, Seyyed Rahim; Kavari, Kamal Ebrahimi; Asgari, Parviz; Hydarei, Alireza

    2011-01-01

    This study measured the impact of asynchronous computer-assisted language learning (CALL) approaches on high and low achievers' vocabulary retention and recall of English as foreign language learners. Fifty participants were assigned into two homogeneous groups. Both groups covered eight expository passages, which included "Select readings:…

  8. A Two-Stage State Recognition Method for Asynchronous SSVEP-Based Brain-Computer Interface System

    Institute of Scientific and Technical Information of China (English)

    ZHANG Zimu; DENG Zhidong

    2013-01-01

    A two-stage state recognition method is proposed for asynchronous SSVEP (steady-state visual evoked potential) based brain-computer interface (SBCI) system.The two-stage method is composed of the idle state (IS) detection and control state (CS) discrimination modules.Based on blind source separation and continuous wavelet transform techniques,the proposed method integrates functions of multi-electrode spatial filtering and feature extraction.In IS detection module,a method using the ensemble IS feature is proposed.In CS discrimination module,the ensemble CS feature is designed as feature vector for control intent classification.Further,performance comparisons are investigated among our IS detection module and other existing ones.Also the experimental results validate the satisfactory performance of our CS discrimination module.

  9. Enhancing robustness of multiparty quantum correlations using weak measurement

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Uttam, E-mail: uttamsingh@hri.res.in [Quantum Information and Computation Group, Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019 (India); Mishra, Utkarsh, E-mail: utkarsh@hri.res.in [Quantum Information and Computation Group, Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019 (India); Dhar, Himadri Shekhar, E-mail: dhar.himadri@gmail.com [School of Physical Sciences, Jawaharlal Nehru University, New Delhi 110067 (India)

    2014-11-15

    Multipartite quantum correlations are important resources for the development of quantum information and computation protocols. However, the resourcefulness of multipartite quantum correlations in practical settings is limited by its fragility under decoherence due to environmental interactions. Though there exist protocols to protect bipartite entanglement under decoherence, the implementation of such protocols for multipartite quantum correlations has not been sufficiently explored. Here, we study the effect of local amplitude damping channel on the generalized Greenberger–Horne–Zeilinger state, and use a protocol of optimal reversal quantum weak measurement to protect the multipartite quantum correlations. We observe that the weak measurement reversal protocol enhances the robustness of multipartite quantum correlations. Further it increases the critical damping value that corresponds to entanglement sudden death. To emphasize the efficacy of the technique in protection of multipartite quantum correlation, we investigate two proximately related quantum communication tasks, namely, quantum teleportation in a one sender, many receivers setting and multiparty quantum information splitting, through a local amplitude damping channel. We observe an increase in the average fidelity of both the quantum communication tasks under the weak measurement reversal protocol. The method may prove beneficial, for combating external interactions, in other quantum information tasks using multipartite resources. - Highlights: • Extension of weak measurement reversal scheme to protect multiparty quantum correlations. • Protection of multiparty quantum correlation under local amplitude damping noise. • Enhanced fidelity of quantum teleportation in one sender and many receivers setting. • Enhanced fidelity of quantum information splitting protocol.

  10. Asynchronous P300 BCI

    DEFF Research Database (Denmark)

    Panicker, Rajesh; Puthusserypady, Sadasivan; Sun, Ying

    2010-01-01

    An asynchronous hybrid brain-computer interface (BCI) system combining the P300 and steady-state visually evoked potentials (SSVEP) paradigms is introduced. A P300 base system is used for information transfer, and is augmented to include SSVEP for control state detection. The proposed system has...

  11. Redundant Asynchronous Microprocessor System

    Science.gov (United States)

    Meyer, G.; Johnston, J. O.; Dunn, W. R.

    1985-01-01

    Fault-tolerant computer structure called RAMPS (for redundant asynchronous microprocessor system) has simplicity of static redundancy but offers intermittent-fault handling ability of complex, dynamically redundant systems. New structure useful wherever several microprocessors are employed for control - in aircraft, industrial processes, robotics, and automatic machining, for example.

  12. General polygamy inequality of multi-party quantum entanglement

    CERN Document Server

    Kim, Jeong San

    2012-01-01

    Using entanglement of assistance, we establish a general polygamy inequality of multi-party entanglement in arbitrary dimensional quantum systems. For multi-party closed quantum systems, we relate our result with the monogamy of entanglement to show that the entropy of entanglement is an universal entanglement measure that bounds both monogamy and polygamy of multi-party quantum entanglement.

  13. Multiparty Compatibility for Concurrent Objects

    Directory of Open Access Journals (Sweden)

    Roly Perera

    2016-06-01

    Full Text Available Objects and actors are communicating state machines, offering and consuming different services at different points in their lifecycle. Two complementary challenges arise when programming such systems. When objects interact, their state machines must be "compatible", so that services are requested only when they are available. Dually, when objects refine other objects, their state machines must be "compliant", so that services are honoured whenever they are promised. In this paper we show how the idea of multiparty compatibility from the session types literature can be applied to both of these problems. We present an untyped language in which concurrent objects are checked automatically for compatibility and compliance. For simple objects, checking can be exhaustive and has the feel of a type system. More complex objects can be partially validated via test cases, leading to a methodology closer to continuous testing. Our proof-of-concept implementation is limited in some important respects, but demonstrates the potential value of the approach and the relationship to existing software development practices.

  14. 'Proxy-equation' paradigm - A novel strategy for massively-parallel asynchronous computations

    CERN Document Server

    Mittal, Ankita

    2016-01-01

    Massively parallel simulations of physical systems call for a paradigm change in algorithm development to achieve efficient scalability. Traditional approaches require time synchronization of processing elements (PEs) which severely restricts scalability. Relaxing synchronization requirement introduces error and slows down convergence rate. In this paper, we propose a novel 'proxy-equation' concept for a general transport equation that (i) tolerates asynchrony without introducing much error, (ii) preserves convergence characteristics and (iii) scales efficiently. The central idea is to modify a priori the transport characteristics (e.g., advection speed, diffusivity) at the PE boundaries to counteract asynchrony errors. We develop the theoretical framework and derive the relationship between characteristics and degree of PE time delay. Proof-of-concept computations are performed using a one-dimensional advection-diffusion equation. Error and convergence rates for various discretization levels and wavelengths ...

  15. Narcissistic group dynamics of multiparty systems

    NARCIS (Netherlands)

    Schruijer, S.G.L.

    2015-01-01

    Purpose – This paper aims to introduce and illustrate the notion of narcissistic group dynamics. It is claimed that narcissism does not simply reside within individuals but can be characteristic of groups and social systems. In this case, the focus is on narcissistic dynamics in multiparty systems.

  16. An Asynchronous P300-Based Brain-Computer Interface Web Browser for Severely Disabled People.

    Science.gov (United States)

    Martinez-Cagigal, Victor; Gomez-Pilar, Javier; Alvarez, Daniel; Hornero, Roberto

    2016-10-31

    This paper presents an electroencephalographic (EEG) P300-based brain-computer interface (BCI) Internet browser. The system uses the "odd-ball" row-col paradigm for generating the P300 evoked potentials on the scalp of the user, which are immediately processed and translated into web browser commands. There were previous approaches for controlling a BCI web browser. However, to the best of our knowledge, none of them was focused on an assistive context, failing to test their applications with a suitable number of end users. In addition, all of them were synchronous applications, where it was necessary to introduce a "read-mode" command in order to avoid a continuous command selection. Thus, the aim of this study is twofold: (i) to test our web browser with a population of multiple sclerosis (MS) patients in order to assess the usefulness of our proposal to meet their daily communication needs; and (ii) to overcome the aforementioned limitation by adding a threshold that discerns between control and non-control states, allowing the user to calmly read the web page without undesirable selections. The browser was tested with sixteen MS patients and five healthy volunteers. Both quantitative and qualitative metrics were obtained. MS participants reached an average accuracy of 84.14%, whereas 95.75% was achieved by control subjects. Results show that MS patients can successfully control the BCI web browser, improving their personal autonomy.

  17. Asynchronous Parallelization of a CFD Solver

    Directory of Open Access Journals (Sweden)

    Daniel S. Abdi

    2015-01-01

    Full Text Available A Navier-Stokes equations solver is parallelized to run on a cluster of computers using the domain decomposition method. Two approaches of communication and computation are investigated, namely, synchronous and asynchronous methods. Asynchronous communication between subdomains is not commonly used in CFD codes; however, it has a potential to alleviate scaling bottlenecks incurred due to processors having to wait for each other at designated synchronization points. A common way to avoid this idle time is to overlap asynchronous communication with computation. For this to work, however, there must be something useful and independent a processor can do while waiting for messages to arrive. We investigate an alternative approach of computation, namely, conducting asynchronous iterations to improve local subdomain solution while communication is in progress. An in-house CFD code is parallelized using message passing interface (MPI, and scalability tests are conducted that suggest asynchronous iterations are a viable way of parallelizing CFD code.

  18. Asynchronous P300-Based Brain-Computer Interface to Control a Virtual Environment : Initial Tests on End Users

    NARCIS (Netherlands)

    Aloise, Fabio; Schettini, Francesca; Arico, Pietro; Salinari, Serenella; Guger, Christoph; Rinsma, Johanna; Aiello, Marco; Mattia, Donatella; Cincotti, Febo

    2011-01-01

    Motor disability and/or ageing can prevent individuals from fully enjoying home facilities, thus worsening their quality of life. Advances in the field of accessible user interfaces for domotic appliances can represent a valuable way to improve the independence of these persons. An asynchronous P300

  19. Applying reflection and moderation in an asynchronous computer-supported collaborative learning environment in campus-based higher education.

    NARCIS (Netherlands)

    Dewiyanti, Silvia; Brand-Gruwel, Saskia; Jochems, Wim

    2007-01-01

    Working together while accomplishing a task is a characteristic of a powerful learning environment that aims at active knowledge construction. Studies have demonstrated that collaborative learning by using asynchronous communication tools can have advantages over collaboration in a face-to-face sett

  20. Multiparty Quantum Secret Sharing Using Quantum Fourier Transform

    Institute of Scientific and Technical Information of China (English)

    HUANG Da-Zu; CHEN Zhi-Gang; GUO Ying

    2009-01-01

    A (n, n )-threshold scheme of multiparty quantum secret sharing of classical or quantum message is proposed based on the discrete quantum Fourier transform.In our proposed scheme, the secret message, which is encoded by using the forward quantum Fourier transform and decoded by using the reverse, is split and shared in such a way that it can be reconstructed among them only if all the participants work in concert.Furthermore, we also discuss how this protocol must be carefully designed for correcting errors and checking eavesdropping or a dishonest participant.Security analysis shows that our scheme is secure.Also, this scheme has an advantage that it is completely compatible with quantum computation and easier to realize in the distributed quantum secure computation.

  1. Remote Operation on Quantum State Among Multiparty

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In this paper, a scheme is proposed for performing remote operation on quantum state among multiparty.We use three-particle GHZ state as quantum channels to prepare a state operator, which describes quantum correlation between states and operations. Based on the special characteristic of the state operator, observers can perform unitary operation on a system that is away from observers. Our studies show this process is deterministic. We further consider remote operation among N spatially distributed observers, and the results show the successful realization of remote operation needs collective participation of N parties, that is, there exists strong correlation among multiparty. In addition, we investigate the case in which observers share a three-particle W state as quantum channels to perform remote operation and studies find this process is probabilistic.

  2. Sociometry Based Multiparty Audio Recordings Segmentation

    OpenAIRE

    Vinciarelli, Alessandro

    2005-01-01

    This paper shows how Social Network Analysis, the sociological domain studying the interaction between people in specific social environments, can be used to assign roles to different speakers in multiparty recordings. The experiments presented in this work focus on radio news recordings involving around 11 speakers on average. Each of them is assigned automatically a role (e.g. anchorman or guest) without using any information related to their identity or the amount of time they talk. The re...

  3. An Erlang Implementation of Multiparty Session Actors

    Directory of Open Access Journals (Sweden)

    Simon Fowler

    2016-08-01

    Full Text Available By requiring co-ordination to take place using explicit message passing instead of relying on shared memory, actor-based programming languages have been shown to be effective tools for building reliable and fault-tolerant distributed systems. Although naturally communication-centric, communication patterns in actor-based applications remain informally specified, meaning that errors in communication are detected late, if at all. Multiparty session types are a formalism to describe, at a global level, the interactions between multiple communicating entities. This article describes the implementation of a prototype framework for monitoring Erlang/OTP gen_server applications against multiparty session types, showing how previous work on multiparty session actors can be adapted to a purely actor-based language, and how monitor violations and termination of session participants can be reported in line with the Erlang mantra of "let it fail". Finally, the framework is used to implement two case studies: an adaptation of a freely-available DNS server, and a chat server.

  4. Efficient generation of photonic entanglement and multiparty quantum communication

    Energy Technology Data Exchange (ETDEWEB)

    Trojek, Pavel

    2007-09-15

    This thesis deals largely with the problem of efficient generation of photonic entanglement with the principal aim of developing a bright source of polarization-entangled photon pairs, which meets the requirements for reliable and economic operation of quantum communication prototypes and demonstrators. Our approach uses a cor-related photon-pair emission in nonlinear process of spontaneous parametric downconversion pumped by light coming from a compact and cheap blue laser diode. Two alternative source configurations are examined within the thesis. The first makes use of a well established concept of degenerate non-collinear emission from a single type-II nonlinear crystal and the second relies on a novel method where the emissions from two adjacent type-I phase-matched nonlinear crystals operated in collinear non-degenerate regime are coherently overlapped. The latter approach showed to be more effective, yielding a total detected rate of almost 10{sup 6} pairs/s at >98% quantum interference visibility of polarization correlations. The second issue addressed within the thesis is the simplification and practical implementation of quantum-assisted solutions to multiparty communication tasks. We show that entanglement is not the only non-classical resource endowing the quantum multiparty information processing its power. Instead, only the sequential communication and transformation of a single qubit can be sufficient to accomplish certain tasks. This we prove for two distinct communication tasks, secret sharing and communication complexity. Whereas the goal of the first is to split a cryptographic key among several parties in a way that its reconstruction requires their collaboration, the latter aims at reducing the amount of communication during distributed computational tasks. Importantly, our qubitassisted solutions to the problems are feasible with state-of-the-art technology. This we clearly demonstrate in the laboratory implementation for 6 and 5 parties

  5. Asynchronous reference frame agreement in a quantum network

    Science.gov (United States)

    Islam, Tanvirul; Wehner, Stephanie

    2016-03-01

    An efficient implementation of many multiparty protocols for quantum networks requires that all the nodes in the network share a common reference frame. Establishing such a reference frame from scratch is especially challenging in an asynchronous network where network links might have arbitrary delays and the nodes do not share synchronised clocks. In this work, we study the problem of establishing a common reference frame in an asynchronous network of n nodes of which at most t are affected by arbitrary unknown error, and the identities of the faulty nodes are not known. We present a protocol that allows all the correctly functioning nodes to agree on a common reference frame as long as the network graph is complete and not more than t\\lt n/4 nodes are faulty. As the protocol is asynchronous, it can be used with some assumptions to synchronise clocks over a network. Also, the protocol has the appealing property that it allows any existing two-node asynchronous protocol for reference frame agreement to be lifted to a robust protocol for an asynchronous quantum network.

  6. Retrospective Analysis of Communication Events - Understanding the Dynamics of Collaborative Multi-Party Discourse

    Energy Technology Data Exchange (ETDEWEB)

    Cowell, Andrew J.; Haack, Jereme N.; McColgin, Dave W.

    2006-06-08

    This research is aimed at understanding the dynamics of collaborative multi-party discourse across multiple communication modalities. Before we can truly make sig-nificant strides in devising collaborative communication systems, there is a need to understand how typical users utilize com-putationally supported communications mechanisms such as email, instant mes-saging, video conferencing, chat rooms, etc., both singularly and in conjunction with traditional means of communication such as face-to-face meetings, telephone calls and postal mail. Attempting to un-derstand an individual’s communications profile with access to only a single modal-ity is challenging at best and often futile. Here, we discuss the development of RACE – Retrospective Analysis of Com-munications Events – a test-bed prototype to investigate issues relating to multi-modal multi-party discourse.

  7. Sociometry Based Multiparty Audio Recordings Summarization

    OpenAIRE

    Vinciarelli, Alessandro

    2006-01-01

    This paper shows how Social Network Analysis, the study of relational data in specific social environments, can be used to summarize multiparty radio news recordings. A social network is extracted from each recording and it is analyzed in order to detect the role of each speaker (e.g. anchorman, guest, etc.). The role is then used as a criterion to select the segments that are more representative of the recording content. The results show that the length of the recordings can be reduced by mo...

  8. Experimental quantum multiparty communication protocols

    Science.gov (United States)

    Smania, Massimiliano; Elhassan, Ashraf M.; Tavakoli, Armin; Bourennane, Mohamed

    2016-06-01

    Quantum information science breaks limitations of conventional information transfer, cryptography and computation by using quantum superpositions or entanglement as resources for information processing. Here we report on the experimental realisation of three-party quantum communication protocols using single three-level quantum system (qutrit) communication: secret-sharing, detectable Byzantine agreement and communication complexity reduction for a three-valued function. We have implemented these three schemes using the same optical fibre interferometric setup. Our realisation is easily scalable without compromising on detection efficiency or generating extremely complex many-particle entangled states.

  9. Precise subtyping for synchronous multiparty sessions

    Directory of Open Access Journals (Sweden)

    Mariangiola Dezani-Ciancaglini

    2016-02-01

    Full Text Available The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: operational and denotational. The former preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. The latter preciseness is based on the denotation of a type which is a mathematical object that describes the meaning of the type in accordance with the denotations of other expressions from the language. The result of this paper is the operational and denotational preciseness of the subtyping for a synchronous multiparty session calculus. The novelty of this paper is the introduction of characteristic global types to prove the operational completeness.

  10. Compositional asynchronous membrane systems

    Institute of Scientific and Technical Information of China (English)

    Cosmin Bonchis; Cornel Izbasa; Gabriel Ciobanu

    2007-01-01

    This paper presents an algorithmic way of building complex membrane systems by coupling elementary membranes. Its application seems particularly valuable in the case of asynchronous membrane systems, since the resulting membrane system remains asynchronous. The composition method is based on a handshake mechanism implemented by using antiport rules and promoters.

  11. ASYNCHRONOUS BYZANTINE AGREEMENT PROTOCOL BASED ON VERIFIABLE SIGNATURE SHARING

    Institute of Scientific and Technical Information of China (English)

    Ji Dongyao; Feng Dengguo

    2006-01-01

    An ([n / 3]- 1 )-resilient Asynchronous Byzantine Agreement Protocol (ABAP) that combines verifiable signature sharing and random secret sharing is proposed. The protocol works in the asynchronous network environment and produces Byzantine agreement within a fixed expected number of computational rounds. The correctness of the protocol is proved in theory.

  12. Cryptanalysis and Improvement of Quantum Secret Sharing Protocol between Multiparty and Multiparty with Single Photons and Unitary Transformations

    Institute of Scientific and Technical Information of China (English)

    LIN Song; WEN Qiao-Yan; LIU Xiao-Fen

    2009-01-01

    In a recent paper[Yan F L et al.Chin.Phys.Lett.25(2008)1187],a quantum secret sharing the protocol between multiparty and multiparty with single photons and unitary transformations was presented.We analyze the security of the protocol and find that a dishonest participant can eavesdrop the key by using a special attack.Finally,we give a description of this strategy and put forward an improved version of this protocol which can stand against this kind of attack.

  13. VOLTAGE REGULATORS ASYNCHRONOUS GENERATORS

    Directory of Open Access Journals (Sweden)

    Grigorash O. V.

    2015-06-01

    Full Text Available A promising is currently the use of asynchronous generators with capacitive excitation as a source of electricity in stand-alone power systems. Drive asynchronous generators may exercise as a thermal engine and wind wheel wind power plant or turbines of small hydropower plants. The article discusses the structural and schematics of voltage stabilizers and frequency of asynchronous generators with improved operational and technical specifications. Technical novelty of design solutions of the magnetic system and stabilizers asynchronous generator of electricity parameters confirmed by the patents for the invention of the Russian Federation. The proposed technical solution voltage stabilizer asynchronous generators, can reduce the weight of the block capacitors excitation and reactive power compensation, as well as to simplify the control system power circuit which has less power electronic devices. For wind power plants it is an important issue not only to stabilize the voltage of the generator, but also the frequency of the current. Recommend functionality stabilizer schemes parameters of electric power made for direct frequency converters with artificial and natural switching power electronic devices. It is also proposed as part of stabilization systems use single-phase voltage, three-phase transformers with rotating magnetic field, reduce the level of electromagnetic interference generated by power electronic devices for switching, enhance the efficiency and reliability of the stabilizer.

  14. A simple asynchronous replica-exchange implementation

    CERN Document Server

    Bussi, Giovanni

    2008-01-01

    We discuss the possibility of implementing asynchronous replica-exchange (or parallel tempering) molecular dynamics. In our scheme, the exchange attempts are driven by asynchronous messages sent by one of the computing nodes, so that different replicas are allowed to perform a different number of time-steps between subsequent attempts. The implementation is simple and based on the message-passing interface (MPI). We illustrate the advantages of our scheme with respect to the standard synchronous algorithm and we benchmark it for a model Lennard-Jones liquid on an IBM-LS21 blade center cluster.

  15. Multiparty quantum secret sharing of classical and quantum messages

    Institute of Scientific and Technical Information of China (English)

    CHEN Pan; DENG Fuguo; LONG Guilu

    2007-01-01

    A scheme for multiparty quantum secret sharing of classical and quantum messages is proposed by using entanglement swapping. This scheme can distribute not only the classical information but also the quantum information between N agents. The security of our scheme is also confirmed.

  16. Choosing the enemy: attack behaviour in a multiparty system

    NARCIS (Netherlands)

    A.S. Walter

    2012-01-01

    This article examines which political parties are the most likely targets of negative campaigning in a multiparty system. The choice of target is an important strategic decision parties make when deciding on their campaign strategy. The article advances existing research on negative campaigning in s

  17. Measurement study of multi-party video conferencing

    NARCIS (Netherlands)

    Lu, Y.; Zhao, Y.; Kuipers, F.A.; Van Mieghem, P.

    2010-01-01

    More and more free multi-party video conferencing applications are readily available over the Internet and both Server-to-Client (S/C) or Peer-to-Peer (P2P) technologies are used. Investigating their mechanisms, analyzing their system performance, and measuring their quality are important objectives

  18. Monitoring multi-party contracts for E-business

    NARCIS (Netherlands)

    Xu, L.

    2004-01-01

    "Monitoring multi-party contracts for E-business" investigates the issues involved in the performance of econtract monitoring of business automations in business to business e-commerce environment. A pro-active monitoring contract model and monitoring mechanism have been designed and developed. A ne

  19. On Adaptive vs. Non-adaptive Security of Multiparty Protocols

    DEFF Research Database (Denmark)

    Canetti, Ran; Damgård, Ivan Bjerre; Dziembowski, Stefan

    2001-01-01

    Security analysis of multiparty cryptographic protocols distinguishes between two types of adversarialsettings: In the non-adaptive setting, the set of corrupted parties is chosen in advance, before the interaction begins. In the adaptive setting, the adversary chooses who to corrupt during...

  20. A requirement analysis for a multi-party conferencing testbed

    NARCIS (Netherlands)

    Pijpers, S.A.G.

    2014-01-01

    Current videoconferencing services such as Skype and Google+Hangouts provide mechanisms for engaging in multi-party conversations. Although these services provide basic support, they lack functionalities that take into account the users roles and context. Currently, the multimedia research community

  1. Student Representation and Multiparty Politics in African Higher Education

    Science.gov (United States)

    Luescher-Mamashela, Thierry M.; Mugume, Taabo

    2014-01-01

    The transition from one-party rule and other forms of authoritarianism to multiparty democracy in the 1990s has had a profound impact on the organisation and role of student politics in Africa. Against the background of student involvement in African politics in the twentieth century, leading up to student participation in Africa's…

  2. An active attack on a multiparty key exchange protocol

    Directory of Open Access Journals (Sweden)

    Reto Schnyder

    2016-01-01

    Full Text Available The multiparty key exchange introduced in Steiner et al. and presented in more general form by the authors is known to be secure against passive attacks. In this paper, an active attack is presented assuming malicious control of the communications of the last two users for the duration of only the key exchange.

  3. Student Representation and Multiparty Politics in African Higher Education

    Science.gov (United States)

    Luescher-Mamashela, Thierry M.; Mugume, Taabo

    2014-01-01

    The transition from one-party rule and other forms of authoritarianism to multiparty democracy in the 1990s has had a profound impact on the organisation and role of student politics in Africa. Against the background of student involvement in African politics in the twentieth century, leading up to student participation in Africa's "second…

  4. Technologies That Assist in Online Group Work: A Comparison of Synchronous and Asynchronous Computer Mediated Communication Technologies on Students' Learning and Community

    Science.gov (United States)

    Rockinson-Szapkiw, Amanda; Wendt, Jillian

    2015-01-01

    While the benefits of online group work completed using asynchronous CMC technology is documented, researchers have identified a number of challenges that result in ineffective and unsuccessful online group work. Fewer channels of communication and lack of immediacy when compared to face-to-face group work are a few of the noted limitations. Thus,…

  5. Asynchronized synchronous machines

    CERN Document Server

    Botvinnik, M M

    1964-01-01

    Asynchronized Synchronous Machines focuses on the theoretical research on asynchronized synchronous (AS) machines, which are "hybrids” of synchronous and induction machines that can operate with slip. Topics covered in this book include the initial equations; vector diagram of an AS machine; regulation in cases of deviation from the law of full compensation; parameters of the excitation system; and schematic diagram of an excitation regulator. The possible applications of AS machines and its calculations in certain cases are also discussed. This publication is beneficial for students and indiv

  6. A Humanoid Robot Control System with SSVEP-based Asynchronous Brain-Computer Interface%一种基于SSVEP的仿人机器人异步脑机接口控制系统

    Institute of Scientific and Technical Information of China (English)

    邓志东; 李修全; 郑宽浩; 姚文韬

    2011-01-01

    A feature extraction method is proposed for steady-state visual evoked potential (SSVEP) idle state detection.By designing a two-level classifier structure, SSVEP-based asynchronous brain-computer interface (BCI) is established.A wireless sensor network (WSN) hardware node embedded with TI CC2430 is implemented for remote transmission of robot control command. The developed humanoid robot control system has multiple control modes, such as mind control,voice interaction, joystick input, machine vision, and obstacle avoidance. The effectiveness of brain-computer interface asynchronous control is validated through experiments on SSVEP idle-state detection.%设计了稳态视觉诱发电位(SSVEP)空闲状态检测的特征提取方法,建立了基于SSVEP的异步脑机接口二级分类器结构,开发了基于TICC2430芯片的无线传感器网络模块,实现了机器人控制命令的远程传送,使该仿人机器人系统具有脑电控制、语音交互、游戏手柄交互、机器视觉与避障等功能.通过SSVEP窄闲状态检测实验验证了脑机接口系统异步控制的有效性.

  7. Quantum Steganography for Multi-party Covert Communication

    Science.gov (United States)

    Liu, Lin; Tang, Guang-Ming; Sun, Yi-Feng; Yan, Shu-Fan

    2016-01-01

    A novel multi-party quantum steganography protocol based on quantum secret sharing is proposed in this paper. Hidden channels are built in HBB and improved HBB quantum secret sharing protocols for secret messages transmitting, via the entanglement swapping of GHZ states and Bell measurement. Compared with the original protocol, there are only a few different GHZ sates transmitted in the proposed protocol, making the hidden channel with good imperceptibility. Moreover, the secret messages keep secure even when the hidden channel is under the attack from the dishonest participators, for the sub-secretmessages distributed randomly to different participators. With good imperceptibility and security, the capacity of proposed protocol is higher than previous multi-party quantum steganography protocol.

  8. Quantum Clock Synchronization a Multi-Party Protocol

    CERN Document Server

    Krco, M; Krco, Marko; Paul, Prabasaj

    2001-01-01

    We present a multi-party quantum clock synchronization protocol that utilizes shared prior entanglement and broadcast of classical information to synchronize spatially separated clocks. Notably, it is necessary only for any one party to publish classical information. Consequently, the efficacy of the method is independent of the relative location of the parties. The suggested protocol is robust and does not require precise sequencing of procedural steps.

  9. Asynchronous DSP-core

    OpenAIRE

    Østvand, Jon

    2007-01-01

    In this thesis multipliers with and without completion detection has been implemented using a 90 nm library to compare their properties reguarding completion time, area and power consumption. The structures tested were array and shiftand-add multipliers. The results were that when having larger bit-lengths, an asynchronous shift-and-add multiplier with completion detection can yield good completion times compared to a regular shift-and-add multiplier. Due to the large cost in area and power c...

  10. Text Mining: (Asynchronous Sequences

    Directory of Open Access Journals (Sweden)

    Sheema Khan

    2014-12-01

    Full Text Available In this paper we tried to correlate text sequences those provides common topics for semantic clues. We propose a two step method for asynchronous text mining. Step one check for the common topics in the sequences and isolates these with their timestamps. Step two takes the topic and tries to give the timestamp of the text document. After multiple repetitions of step two, we could give optimum result.

  11. Behavioral synthesis of asynchronous circuits

    DEFF Research Database (Denmark)

    Nielsen, Sune Fallgaard

    2005-01-01

    This thesis presents a method for behavioral synthesis of asynchronous circuits, which aims at providing a synthesis flow which uses and tranfers methods from synchronous circuits to asynchronous circuits. We move the synchronous behavioral synthesis abstraction into the asynchronous handshake...... is idle. This reduces unnecessary switching activity in the individual functional units and therefore the energy consumption of the entire circuit. A collection of behavioral synthesis algorithms have been developed allowing the designer to perform time and power constrained design space exploration...

  12. Inhibition Controls Asynchronous States of Neuronal Networks

    Science.gov (United States)

    Treviño, Mario

    2016-01-01

    Computations in cortical circuits require action potentials from excitatory and inhibitory neurons. In this mini-review, I first provide a quick overview of findings that indicate that GABAergic neurons play a fundamental role in coordinating spikes and generating synchronized network activity. Next, I argue that these observations helped popularize the notion that network oscillations require a high degree of spike correlations among interneurons which, in turn, produce synchronous inhibition of the local microcircuit. The aim of this text is to discuss some recent experimental and computational findings that support a complementary view: one in which interneurons participate actively in producing asynchronous states in cortical networks. This requires a proper mixture of shared excitation and inhibition leading to asynchronous activity between neighboring cells. Such contribution from interneurons would be extremely important because it would tend to reduce the spike correlation between neighboring pyramidal cells, a drop in redundancy that could enhance the information-processing capacity of neural networks. PMID:27274721

  13. Inhibition Controls Asynchronous States of Neuronal Networks.

    Science.gov (United States)

    Treviño, Mario

    2016-01-01

    Computations in cortical circuits require action potentials from excitatory and inhibitory neurons. In this mini-review, I first provide a quick overview of findings that indicate that GABAergic neurons play a fundamental role in coordinating spikes and generating synchronized network activity. Next, I argue that these observations helped popularize the notion that network oscillations require a high degree of spike correlations among interneurons which, in turn, produce synchronous inhibition of the local microcircuit. The aim of this text is to discuss some recent experimental and computational findings that support a complementary view: one in which interneurons participate actively in producing asynchronous states in cortical networks. This requires a proper mixture of shared excitation and inhibition leading to asynchronous activity between neighboring cells. Such contribution from interneurons would be extremely important because it would tend to reduce the spike correlation between neighboring pyramidal cells, a drop in redundancy that could enhance the information-processing capacity of neural networks.

  14. Bounds on relative entropy of entanglement for multi-party systems

    OpenAIRE

    Plenio, M. B.; Vedral, V.

    2000-01-01

    We present upper and lower bounds to the relative entropy of entanglement of multi-party systems in terms of the bi-partite entanglements of formation and distillation and entropies of various subsystems. We point out implications of our results to the local reversible convertibility of multi-party pure states and discuss their physical basis in terms of deleting of information.

  15. Bounds on relative entropy of entanglement for multi-party systems

    Energy Technology Data Exchange (ETDEWEB)

    Plenio, M.B. [Optics Section, Blackett Laboratory, Imperial College, London (United Kingdom); Vedral, V. [Optics Section, Blackett Laboratory, Imperial College, London (United Kingdom); Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Oxford (United Kingdom)

    2001-09-07

    We present upper and lower bounds to the relative entropy of entanglement of multi-party systems in terms of the bi-partite entanglements of formation and distillation and entropies of various subsystems. We point out implications of our results to the local reversible convertibility of multi-party pure states and discuss their physical basis in terms of deleting information. (author)

  16. Strong polygamy of quantum correlations in multi-party quantum systems

    Science.gov (United States)

    San Kim, Jeong

    2014-10-01

    We propose a new type of polygamy inequality for multi-party quantum entanglement. We first consider the possible amount of bipartite entanglement distributed between a fixed party and any subset of the rest parties in a multi-party quantum system. By using the summation of these distributed entanglements, we provide an upper bound of the distributed entanglement between a party and the rest in multi-party quantum systems. We then show that this upper bound also plays as a lower bound of the usual polygamy inequality, therefore the strong polygamy of multi-party quantum entanglement. For the case of multi-party pure states, we further show that the strong polygamy of entanglement implies the strong polygamy of quantum discord.

  17. Mechanical Proofs about BW Multi-Party Contract Signing Protocol

    Institute of Scientific and Technical Information of China (English)

    ZHANG Ningrong; ZHANG Xingyuan; WANG Yuanyuan

    2006-01-01

    We report on the verification of a multi-party contract signing protocol described by Baum-Waidner and Waidner (BW). Based on Paulson' inductive approach, we give the protocol model that includes infinitely many signatories and contract texts signing simultaneously. We consider composite attacks of the dishonest signatory and the external intruder, formalize cryptographic primitives and protocol arithmetic including attack model, show formal description of key distribution, and prove signature key secrecy theorems and fairness property theorems of the BW protocol using the interactive theorem prover Isabelle/HOL.

  18. Universally Composable Multiparty Computation with Partially Isolated Parties

    DEFF Research Database (Denmark)

    Damgård, Ivan Bjerre; Nielsen, Jesper Buus; Wichs, Daniel

    2009-01-01

    -proof hardware token and assuming that Alice can prevent this token from communicating to the outside world. Alternatively, Alice may interact with Bob directly but in a special office which she administers and where there are no high-bandwidth communication channels to the outside world. We show that, under standard cryptographic...

  19. Celerity: A Low-Delay Multi-Party Conferencing Solution

    CERN Document Server

    Chen, X; Li, B; Zhao, Y; Wu, Y; Li, J

    2011-01-01

    In this paper, we attempt to revisit the problem of multi-party conferencing from a practical perspective, and to rethink the design space involved in this problem. We believe that an emphasis onlow end-to-end delays between any two parties in the conference is a must, and the source sending rate in a session should adapt to bandwidth availability and congestion. We present Celerity, a multi-party conferencing solution specifically designed to achieve our objectives. It is entirely Peer-to-Peer (P2P), and as such eliminating the cost of maintaining centrally administered servers. It is designed to deliver video with low end-to-end delays, at quality levels commensurate with available network resources over arbitrary network topologies where bottlenecks can be anywhere in the network. This is in contrast to commonly assumed P2P scenarios where bandwidth bottlenecks reside only at the edge of the network. The highlight in our design is a distributed and adaptive rate control protocol, that can discover and adap...

  20. Pro asynchronous programming with .NET

    CERN Document Server

    Blewett, Richard; Ltd, Rock Solid Knowledge

    2014-01-01

    Pro Asynchronous Programming with .NET teaches the essential skill of asynchronous programming in .NET. It answers critical questions in .NET application development, such as: how do I keep my program responding at all times to keep my users happy how do I make the most of the available hardware how can I improve performanceIn the modern world, users expect more and more from their applications and devices, and multi-core hardware has the potential to provide it. But it takes carefully crafted code to turn that potential into responsive, scalable applications.With Pro Asynchronous Programming

  1. Asynchronous event-based binocular stereo matching.

    Science.gov (United States)

    Rogister, Paul; Benosman, Ryad; Ieng, Sio-Hoi; Lichtsteiner, Patrick; Delbruck, Tobi

    2012-02-01

    We present a novel event-based stereo matching algorithm that exploits the asynchronous visual events from a pair of silicon retinas. Unlike conventional frame-based cameras, recent artificial retinas transmit their outputs as a continuous stream of asynchronous temporal events, in a manner similar to the output cells of the biological retina. Our algorithm uses the timing information carried by this representation in addressing the stereo-matching problem on moving objects. Using the high temporal resolution of the acquired data stream for the dynamic vision sensor, we show that matching on the timing of the visual events provides a new solution to the real-time computation of 3-D objects when combined with geometric constraints using the distance to the epipolar lines. The proposed algorithm is able to filter out incorrect matches and to accurately reconstruct the depth of moving objects despite the low spatial resolution of the sensor. This brief sets up the principles for further event-based vision processing and demonstrates the importance of dynamic information and spike timing in processing asynchronous streams of visual events.

  2. Adding effect of current displacement and magnetic circuit saturation in an asynchronous motor mathematical model

    Directory of Open Access Journals (Sweden)

    I.A. Tsodik

    2014-04-01

    Full Text Available A methodology of an asynchronous motor mathematical model synthesis is described. Experiments are suggested to be conducted in the following sequence. Geometrical models are first built in AutoCAD, then imported to Comsol Multiphysics, and further processed in Matlab with computation of coefficients and dependences applied in the asynchronous motor mathematical model.

  3. Protocol for multi-party superdense coding by using multi-atom in cavity QED

    Institute of Scientific and Technical Information of China (English)

    Tan Jia; Fang Mao-Fa

    2006-01-01

    We present a protocol for multi-party superdense coding by using multi-atom in cavity quantum electrodynamics (QED). It is shown that, with a highly detuned cavity mode and a strong driving field, the protocol is insensitive to both cavity decay and thermal field. It is even certain to identify GHZ states via detecting the atomic states. Therefore we can realize the quantum dense coding in a simple way in the multiparty system.

  4. Attack on the Enhanced Multiparty Quantum Secret Sharing

    Institute of Scientific and Technical Information of China (English)

    杨帅; 陈秀波; 杨义先

    2012-01-01

    Recently, Gao et al.'s [Commun. Theor. Phys. 52 (2009) 421] multiparty quantum secret sharing (MQSS) protocol with two-photon three-dimensional Bell states was enhanced by Hwang et al. [Commun. Theor. Phys. 56 (2011) 79]. The improved protocol removes some unnecessary unitary operations, devices, and transmissions by the technique of decoy single photons and careful modification. However, in this paper, we investigate the security of the improved protocol and find it is insecure. The eavesdropper can steal all Alice's secret information. Furthermore, a feasible modification to remedy the security loophole is put forward. Our improved protocol provides a basic method to modify a kind of MQSS protocols which cannot resist the collusion attack.

  5. Multiparty simultaneous quantum identity authentication with secret sharing

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol,the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA,the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share,each user performs the corresponding unitary operations on the single photon sequence sequentially. At last,the TTP can judge whether the impersonator exists. The sec-ond protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technol-ogy.

  6. Multiparty simultaneous quantum identity authentication with secret sharing

    Institute of Scientific and Technical Information of China (English)

    YANG YuGuang; WEN QiaoYan; ZHANG Xing

    2008-01-01

    Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented.All the users can be authenticated by a trusted third party (TTP) simultaneously.In the first protocol, the TTP shares a random key K with all the users using quantum secret sharing.The ith share acts as the authentication key of the ith user.When it is necessary to perform MSQIA, the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users.According to his share, each user performs the corresponding unitary operations on the single photon sequence sequentially.At last, the TTP can judge whether the impersonator exists.The sec-ond protocol is a modified version with a circular structure.The two protocols can be efficiently used for MSQIA in a network.They are feasible with current technol-ogy.

  7. Asynchronous updating of threshold-coupled chaotic neurons

    Indian Academy of Sciences (India)

    Manish Dev Shirmali; Sudeshna Sinha; Kazuyuki Aihara

    2008-06-01

    We study a network of chaotic model neurons incorporating threshold activated coupling. We obtain a wide range of spatiotemporal patterns under varying degrees of asynchronicity in the evolution of the neuronal components. For instance, we find that sequential updating of threshold-coupled chaotic neurons can yield dynamical switching of the individual neurons between two states. So varying the asynchronicity in the updating scheme can serve as a control mechanism to extract different responses, and this can have possible applications in computation and information processing.

  8. Students' Use of Asynchronous Discussions for Academic Discourse Socialization

    Science.gov (United States)

    Beckett, Gulbahar H.; Amaro-Jimenez, Carla; Beckett, Kelvin S.

    2010-01-01

    Our universities are becoming increasingly diverse at the same time as online asynchronous discussions (OADs) are emerging as the most important forum for computer mediated communication (CMC) in distance education. But there is shortage of studies that explore how graduate students from different ethnic, linguistic and cultural backgrounds use…

  9. Asynchronous Bounded Expected Delay Networks

    CERN Document Server

    Bakhshi, Rena; Fokkink, Wan; Pang, Jun

    2010-01-01

    The commonly used asynchronous bounded delay (ABD) network models assume a fixed bound on message delay. We propose a probabilistic network model, called asynchronous bounded expected delay (ABE) model. Instead of a strict bound, the ABE model requires only a bound on the expected message delay. While the conditions of ABD networks restrict the set of possible executions, in ABE networks all asynchronous executions are possible, but executions with extremely long delays are less probable. In contrast to ABD networks, ABE networks cannot be synchronised efficiently. At the example of an election algorithm, we show that the minimal assumptions of ABE networks are sufficient for the development of efficient algorithms. For anonymous, unidirectional ABE rings of known size N we devise a probabilistic leader election algorithm having average message and time complexity O(N).

  10. Asymptotic behavior of asynchronous stochasticapproximation

    Institute of Scientific and Technical Information of China (English)

    方海涛; 陈翰馥

    2001-01-01

    The pathwise convergence of a distributed, asynchronous stochastic approximation (SA) scheme is analyzed. The conditions imposed on the step size and noise are the weakest in comparison with the existing ones. The step sizes in different processors are allowed to be different, and the time_delays between processors are also allowed to be different and even time_varying.

  11. Acquiring Knowledge from Asynchronous Discussion

    Science.gov (United States)

    Teo, Yiong Hwee; Webster, Len

    2008-01-01

    This article discusses a study which was designed to explore how online scaffolding can be incorporated to support knowledge acquisition in asynchronous discussion. A group of Singapore preservice teachers engaged in collaborative critiquing of videos before they embarked on their video projects to illustrate what constitutes good and bad video…

  12. Asynchronous sequential machine design and analysis

    CERN Document Server

    Tinder, Richard

    2009-01-01

    Asynchronous Sequential Machine Design and Analysis provides a lucid, in-depth treatment of asynchronous state machine design and analysis presented in two parts: Part I on the background fundamentals related to asynchronous sequential logic circuits generally, and Part II on self-timed systems, high-performance asynchronous programmable sequencers, and arbiters.Part I provides a detailed review of the background fundamentals for the design and analysis of asynchronous finite state machines (FSMs). Included are the basic models, use of fully documented state diagrams, and the design and charac

  13. Sandia`s network for SC `97: Supporting visualization, distributed cluster computing, and production data networking with a wide area high performance parallel asynchronous transfer mode (ATM) network

    Energy Technology Data Exchange (ETDEWEB)

    Pratt, T.J.; Martinez, L.G.; Vahle, M.O.; Archuleta, T.V.; Williams, V.K.

    1998-05-01

    The advanced networking department at Sandia National Laboratories has used the annual Supercomputing conference sponsored by the IEEE and ACM for the past several years as a forum to demonstrate and focus communication and networking developments. At SC `97, Sandia National Laboratories (SNL), Los Alamos National Laboratory (LANL), and Lawrence Livermore National Laboratory (LLNL) combined their SC `97 activities within a single research booth under the Advance Strategic Computing Initiative (ASCI) banner. For the second year in a row, Sandia provided the network design and coordinated the networking activities within the booth. At SC `97, Sandia elected to demonstrate the capability of the Computation Plant, the visualization of scientific data, scalable ATM encryption, and ATM video and telephony capabilities. At SC `97, LLNL demonstrated an application, called RIPTIDE, that also required significant networking resources. The RIPTIDE application had computational visualization and steering capabilities. This paper documents those accomplishments, discusses the details of their implementation, and describes how these demonstrations support Sandia`s overall strategies in ATM networking.

  14. Selective particle capture by asynchronously beating cilia

    Science.gov (United States)

    Ding, Yang; Kanso, Eva

    2015-12-01

    Selective particle filtration is fundamental in many engineering and biological systems. For example, many aquatic microorganisms use filter feeding to capture food particles from the surrounding fluid, using motile cilia. One of the capture strategies is to use the same cilia to generate feeding currents and to intercept particles when the particles are on the downstream side of the cilia. Here, we develop a 3D computational model of ciliary bands interacting with flow suspended particles and calculate particle trajectories for a range of particle sizes. Consistent with experimental observations, we find optimal particle sizes that maximize capture rate. The optimal size depends nonlinearly on cilia spacing and cilia coordination, synchronous vs. asynchronous. These parameters affect the cilia-generated flow field, which in turn affects particle trajectories. The low capture rate of smaller particles is due to the particles' inability to cross the flow streamlines of neighboring cilia. Meanwhile, large particles have difficulty entering the sub-ciliary region once advected downstream, also resulting in low capture rates. The optimal range of particle sizes is enhanced when cilia beat asynchronously. These findings have potentially important implications on the design and use of biomimetic cilia in processes such as particle sorting in microfluidic devices.

  15. A Polynomial Subset-Based Efficient Multi-Party Key Management System for Lightweight Device Networks.

    Science.gov (United States)

    Mahmood, Zahid; Ning, Huansheng; Ghafoor, AtaUllah

    2017-03-24

    Wireless Sensor Networks (WSNs) consist of lightweight devices to measure sensitive data that are highly vulnerable to security attacks due to their constrained resources. In a similar manner, the internet-based lightweight devices used in the Internet of Things (IoT) are facing severe security and privacy issues because of the direct accessibility of devices due to their connection to the internet. Complex and resource-intensive security schemes are infeasible and reduce the network lifetime. In this regard, we have explored the polynomial distribution-based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied. It becomes more costly when these polynomials are regenerated dynamically after each node join or leave operation and whenever key is refreshed. To reduce the computation, we have proposed an Efficient Key Management (EKM) scheme for multiparty communication-based scenarios. The proposed session key management protocol is established by applying a symmetric polynomial for group members, and the group head acts as a responsible node. The polynomial generation method uses security credentials and secure hash function. Symmetric cryptographic parameters are efficient in computation, communication, and the storage required. The security justification of the proposed scheme has been completed by using Rubin logic, which guarantees that the protocol attains mutual validation and session key agreement property strongly among the participating entities. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs during authentication, session key generation, node migration, secure joining, and leaving phases. EKM is efficient regarding storage, computation, and communication overhead and can protect WSN-based IoT infrastructure.

  16. A novel protocol for multiparty quantum key management

    Science.gov (United States)

    Xu, Gang; Chen, Xiu-Bo; Dou, Zhao; Yang, Yi-Xian; Li, Zongpeng

    2015-08-01

    Key management plays a fundamental role in the field of cryptography. In this paper, we propose a novel multiparty quantum key management (QKM) protocol. Departing from single-function quantum cryptography protocols, our protocol has a salient feature in that it accomplishes a complete QKM process. In this process, we can simultaneously realize the functions of key generation, key distribution and key backup by executing the protocol once. Meanwhile, for the first time, we propose the idea of multi-function QKM. Firstly, the secret key is randomly generated by managers via the quantum measurements in -level Bell basis. Then, through entanglement swapping, the secret key is successfully distributed to users. Under circumstances of urgent requirement, all managers can cooperate to recover the users' secret key, but neither of them can recover it unilaterally. Furthermore, this protocol is further generalized into the multi-manager and multi-user QKM scenario. It has clear advantages in the burgeoning area of quantum security group communication. In this system, all group members share the same group key, and group key management is the foundation of secure group communication and hence an important subject of study.

  17. Towards behavioral synthesis of asynchronous circuits - an implementation template targeting syntax directed compilation

    DEFF Research Database (Denmark)

    Nielsen, Sune Fallgaard; Sparsø, Jens; Madsen, Jan

    2004-01-01

    This paper presents a method for behavioral synthesis of asynchronous circuits. Our approach aims at providing a synthesis flow which is very similar to what is found in existing synchronous design tools. We adapt the synchronous behavioral synthesis abstraction into the asynchronous handshake...... domain by introducing a computation model, which resembles the synchronous datapath and control architecture, but which is completely asynchronous. The datapath and control architecture is then expressed in the Balsa-language, and using syntax directed compilation a corresponding handshake circuit...... implementation is produced. The paper also reports area, speed and power figures for a couple of benchmark circuits, which have been synthesized to layout....

  18. 基于异步并行诱发策略的混合范式脑-机接口技术%A Technical Study of Hybrid Brain-Computer Interface Based on Asynchronous Parallel Evoked Strategy

    Institute of Scientific and Technical Information of China (English)

    明东; 肖晓琳; 汤佳贝; 许敏鹏

    2015-01-01

    A hybrid SSVEP-P300 brain-computer interface ( SP-BCI) system combining steady-state visu-al evoked potential ( SSVEP) and P300 component of event-related potential ( ERP) could induce both signals at the same time, and take advantage of high signal-to-noise ratio and asynchronous compatibility of SSVEP and the ability to present a large number of commands of P300 .It also has the potential to im-prove information transfer rate ( ITR) of the system, but existing evoked paradigms could not give full play to the aforementioned characteristics.This paper proposed a new strategy to make SSVEP evoked and blocked ( SSVEP-B) asynchronously according to the respective frequency, to evoke P300 at the same time, and to combine SSVEP-B with P300 to make classification as well.Ten healthy subjects par-ticipated in the study.The results of the offline tests show that the system could reach the average accura-cy of 84.5% and the highest theoretical information transfer rate of 89.5 bit/min.The results prove that the new strategy is conductive to improve accuracy and information transfer rate of the BCI system, and that related research ideas and technologies can be used as reference to design and generalize a hybrid BCI system.%稳态视觉诱发电位( SSVEP)与事件相关电位中P300成分相结合的混合范式脑-机接口( SP-BCI)系统可同时诱发两种特征脑电信号并综合前者的高信噪比和异步兼容特点及后者的大指令集优势,具有提高系统信息传输速率的潜在能力,但现有脑电诱发范式未能充分发挥上述特长.本文提出一种SSVEP按各自频率异步诱发和阻断( SSVEP-B)且与P300并行诱发的新策略,并融合SSVEP-B与P300特征信息进行脑电分类识别.经10名健康年轻被试离线测试实验结果表明,被试总体平均分类正确率为84.5%,系统最高理论信息传输速率为89.5 bit/min,表明新型诱发策略有助于提高BCI信息识别

  19. Asynchronous control for networked systems

    CERN Document Server

    Rubio, Francisco; Bencomo, Sebastián

    2015-01-01

    This book sheds light on networked control systems; it describes different techniques for asynchronous control, moving away from the periodic actions of classical control, replacing them with state-based decisions and reducing the frequency with which communication between subsystems is required. The text focuses specially on event-based control. Split into two parts, Asynchronous Control for Networked Systems begins by addressing the problems of single-loop networked control systems, laying out various solutions which include two alternative model-based control schemes (anticipatory and predictive) and the use of H2/H∞ robust control to deal with network delays and packet losses. Results on self-triggering and send-on-delta sampling are presented to reduce the need for feedback in the loop. In Part II, the authors present solutions for distributed estimation and control. They deal first with reliable networks and then extend their results to scenarios in which delays and packet losses may occur. The novel ...

  20. Implementation of Universal Asynchronous Receiver and Transmitter

    Directory of Open Access Journals (Sweden)

    Payata Srikanth Yadav

    2015-03-01

    Full Text Available Universal Asynchronous Receiver Transmitter (UART is the serial communication protocol that is used for data exchange between computer & peripherals. UART is a low velocity, short-distance, low-cost protocol. UART includes three modules which are received, the baud rate generator and transmitter. The UART design with Very High Description Language can be integrated into the Field Programmable Gate Array to achieve stable data transmission and to make system reliable and compact. In the result and simulation part, this project will focus on check the receive data with error free & baud rate generation at different frequencies. Before synthesizing of UART a baud rate generator is incorporated into the system. We use the frequency divider which sets itself to required frequency for the functionality at lower frequency. All modules are designed using VERILOG and implemented on Xilinx Suite development board.

  1. GAMIFICATION IN ASYNCHRONOUS EDUCATION PROCESS

    Directory of Open Access Journals (Sweden)

    B. P. Dyakonov

    2016-01-01

    Full Text Available The author of the paper discourses on the prospects of education in the context of the global tendency towards informatization and virtualization of the modern world, influence of these processes on personalized senses of education and educational values and related problems of methodological and technological education in relation to the personalized meanings and educational values. Educational individualization is defined by the author as the most expected way of educational evolution. Distance learning is studied as the main example of the modern transformative educational model. Asynchronous education is explored and characterized as one of the distance learning examples. While defining what asynchronous distance learning is, the author explores its role in the specifics of forming a subject to subject educational approach, while forecasting difficulties in creating holistic asynchronous educational environment. Gamification techniques in the educational process are studied with their respective opportunities and threats, examples in grad and post grad professional studies are provided, including but not limited to foreign language studies. Addictiveness as the goal and means of a build in gamification process is explored as the way to bridge the gap between students and the educators. The author studies gamification in the context of minimizing negative connotations from the educational process, while controversies between pain and game approaches of getting knowledge are brought into light.

  2. Asynchronous τ-leaping

    Science.gov (United States)

    JÈ©drzejewski-Szmek, Zbigniew; Blackwell, Kim T.

    2016-03-01

    Stochastic simulation of cell signaling pathways and genetic regulatory networks has contributed to the understanding of cell function; however, investigation of larger, more complicated systems requires computationally efficient algorithms. τ-leaping methods, which improve efficiency when some molecules have high copy numbers, either use a fixed leap size, which does not adapt to changing state, or recalculate leap size at a heavy computational cost. We present a hybrid simulation method for reaction-diffusion systems which combines exact stochastic simulation and τ-leaping in a dynamic way. Putative times of events are stored in a priority queue, which reduces the cost of each step of the simulation. For every reaction and diffusion channel at each step of the simulation the more efficient of an exact stochastic event or a τ-leap is chosen. This new approach removes the inherent trade-off between speed and accuracy in stiff systems which was present in all τ-leaping methods by allowing each reaction channel to proceed at its own pace. Both directions of reversible reactions and diffusion are combined in a single event, allowing bigger leaps to be taken. This improves efficiency for systems near equilibrium where forward and backward events are approximately equally frequent. Comparison with existing algorithms and behaviour for five test cases of varying complexity shows that the new method is almost as accurate as exact stochastic simulation, scales well for large systems, and for various problems can be significantly faster than τ-leaping.

  3. Scalable asynchronous execution of cellular automata

    Science.gov (United States)

    Folino, Gianluigi; Giordano, Andrea; Mastroianni, Carlo

    2016-10-01

    The performance and scalability of cellular automata, when executed on parallel/distributed machines, are limited by the necessity of synchronizing all the nodes at each time step, i.e., a node can execute only after the execution of the previous step at all the other nodes. However, these synchronization requirements can be relaxed: a node can execute one step after synchronizing only with the adjacent nodes. In this fashion, different nodes can execute different time steps. This can be a notable advantageous in many novel and increasingly popular applications of cellular automata, such as smart city applications, simulation of natural phenomena, etc., in which the execution times can be different and variable, due to the heterogeneity of machines and/or data and/or executed functions. Indeed, a longer execution time at a node does not slow down the execution at all the other nodes but only at the neighboring nodes. This is particularly advantageous when the nodes that act as bottlenecks vary during the application execution. The goal of the paper is to analyze the benefits that can be achieved with the described asynchronous implementation of cellular automata, when compared to the classical all-to-all synchronization pattern. The performance and scalability have been evaluated through a Petri net model, as this model is very useful to represent the synchronization barrier among nodes. We examined the usual case in which the territory is partitioned into a number of regions, and the computation associated with a region is assigned to a computing node. We considered both the cases of mono-dimensional and two-dimensional partitioning. The results show that the advantage obtained through the asynchronous execution, when compared to the all-to-all synchronous approach is notable, and it can be as large as 90% in terms of speedup.

  4. Managing Mutual Orientation in the Absence of Physical Copresence: Multiparty Voice-Based Chat Room Interaction

    Science.gov (United States)

    Jenks, Christopher Joseph; Brandt, Adam

    2013-01-01

    This study investigates the interactional work involved in ratifying mutual participation in online, multiparty, voice-based chat rooms. The purpose of this article is to provide a preliminary sketch of how talk and participation is managed in a spoken communication environment that comprises interactants who are not physically copresent but are…

  5. 1Mbps is enough: Video quality and individual idiosyncrasies in multiparty HD video-conferencing

    NARCIS (Netherlands)

    Schmitt, M.R.; Redi, J.A.; Cesar Garcia, P.S.; Bulterman, D.C.A.; Redi, J.A.; Bulterman, D.C.A.; Cesar Garcia, P.S.; Schmitt, M.R.

    2016-01-01

    Most video platforms deliver HD video in high bitrate encoding. Modern video-conferencing systems are capable of handling HD streams, but using multiparty conferencing, average internet connections in the home are on their bandwidth limit. For properly managing the encoding bitrate in videoconferenc

  6. Adaptive versus Non-Adaptive Security of Multi-Party Protocols

    DEFF Research Database (Denmark)

    Canetti, Ran; Damgård, Ivan Bjerre; Dziembowski, Stefan

    2004-01-01

    Security analysis of multi-party cryptographic protocols distinguishes between two types of adversarial settings: In the non-adaptive setting the set of corrupted parties is chosen in advance, before the interaction begins. In the adaptive setting the adversary chooses who to corrupt during...

  7. Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

    DEFF Research Database (Denmark)

    Phillips, Jeff; Verbin, Elad; Zhang, Qin

    2012-01-01

    In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players to see) and (mainly) in the message-passing model, where messages are sent player-to-player. We introduce a new...

  8. Changing Patterns in the Impact of Information on Party Choice in a Multiparty System

    DEFF Research Database (Denmark)

    Hansen, Kasper Møller

    2009-01-01

    Simulations of changing levels of political knowledge among Danish voters in the 1971 and 2005 general elections reveal a strong impact on party choice. The analysis advances previous simulations from the American two-party system to a multiparty system by applying survey data from the Danish Ele...

  9. High-dimension multiparty quantum secret sharing scheme with Einstein-Podolsky-Rosen pairs

    Institute of Scientific and Technical Information of China (English)

    Chen Pan; Deng Fu-Guo; Long Gui-Lu

    2006-01-01

    In this paper a high-dimension multiparty quantum secret sharing scheme is proposed by using Einstein-Podolsky-Rosen pairs and local unitary operators. This scheme has the advantage of not only having higher capacity, but also saving storage space. The security analysis is also given.

  10. Financial Data Modeling by Using Asynchronous Parallel Evolutionary Algorithms

    Institute of Scientific and Technical Information of China (English)

    Wang Chun; Li Qiao-yun

    2003-01-01

    In this paper, the high-level knowledge of financial data modeled by ordinary differential equations (ODEs) is discovered in dynamic data by using an asynchronous parallel evolutionary modeling algorithm (APHEMA). A numerical example of Nasdaq index analysis is used to demonstrate the potential of APHEMA. The results show that the dynamic models automatically discovered in dynamic data by computer can be used to predict the financial trends.

  11. Asynchronous Learning Forums for Business Acculturation

    Science.gov (United States)

    Pence, Christine Cope; Wulf, Catharina

    2009-01-01

    The use of IT as a facilitator for student collaboration in higher business education has grown rapidly since 2000. Asynchronous discussion forums are used abundantly for collaborative training purposes and for teaching students business-relevant tools for their future careers. This article presents an analysis of the asynchronous discussion forum…

  12. Students' Activity Focus in Online Asynchronous Peer Learning Forums

    Directory of Open Access Journals (Sweden)

    Naomi BOYER

    2010-04-01

    Full Text Available This qualitative study explores how using Peer Learning Forums (PLF in an online asynchronous computer programming course can be analyzed to derive information about Student Activity Focus (SAF for adult Information Technology students. Three instruments are proposed to assist instructors classify questions posted by students on these forums, obtain easy quantitative measures of their SAF, and use it to gain a better understanding of the type of learning barriers they are encountering. In addition, we also look at the difference in SAF between passing and failing students based on their exam performance. The PLF learning activity and the classification instruments are easily adaptable to other disciplines or courses and allow instructors and students alike to gain a better understanding of what kind of participation is helpful in online asynchronous discussion forums.

  13. Inference of asynchronous Boolean network from biological pathways.

    Science.gov (United States)

    Das, Haimabati; Layek, Ritwik Kumar

    2015-01-01

    Gene regulation is a complex process with multiple levels of interactions. In order to describe this complex dynamical system with tractable parameterization, the choice of the dynamical system model is of paramount importance. The right abstraction of the modeling scheme can reduce the complexity in the inference and intervention design, both computationally and experimentally. This article proposes an asynchronous Boolean network framework to capture the transcriptional regulation as well as the protein-protein interactions in a genetic regulatory system. The inference of asynchronous Boolean network from biological pathways information and experimental evidence are explained using an algorithm. The suitability of this paradigm for the variability of several reaction rates is also discussed. This methodology and model selection open up new research challenges in understanding gene-protein interactive system in a coherent way and can be beneficial for designing effective therapeutic intervention strategy.

  14. Asynchronous Rate Chaos in Spiking Neuronal Circuits

    Science.gov (United States)

    Harish, Omri; Hansel, David

    2015-01-01

    The brain exhibits temporally complex patterns of activity with features similar to those of chaotic systems. Theoretical studies over the last twenty years have described various computational advantages for such regimes in neuronal systems. Nevertheless, it still remains unclear whether chaos requires specific cellular properties or network architectures, or whether it is a generic property of neuronal circuits. We investigate the dynamics of networks of excitatory-inhibitory (EI) spiking neurons with random sparse connectivity operating in the regime of balance of excitation and inhibition. Combining Dynamical Mean-Field Theory with numerical simulations, we show that chaotic, asynchronous firing rate fluctuations emerge generically for sufficiently strong synapses. Two different mechanisms can lead to these chaotic fluctuations. One mechanism relies on slow I-I inhibition which gives rise to slow subthreshold voltage and rate fluctuations. The decorrelation time of these fluctuations is proportional to the time constant of the inhibition. The second mechanism relies on the recurrent E-I-E feedback loop. It requires slow excitation but the inhibition can be fast. In the corresponding dynamical regime all neurons exhibit rate fluctuations on the time scale of the excitation. Another feature of this regime is that the population-averaged firing rate is substantially smaller in the excitatory population than in the inhibitory population. This is not necessarily the case in the I-I mechanism. Finally, we discuss the neurophysiological and computational significance of our results. PMID:26230679

  15. GPU-Accelerated Asynchronous Error Correction for Mixed Precision Iterative Refinement

    Energy Technology Data Exchange (ETDEWEB)

    Antz, Hartwig [Karlsruhe Inst. of Technology (KIT) (Germany); Luszczek, Piotr [Univ. of Tennessee, Knoxville, TN (United States); Dongarra, Jack [Univ. of Tennessee, Knoxville, TN (United States); Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Univ. of Manchester (United Kingdom); Heuveline, Vinent [Karlsruhe Inst. of Technology (KIT) (Germany)

    2011-12-14

    In hardware-aware high performance computing, block- asynchronous iteration and mixed precision iterative refinement are two techniques that are applied to leverage the computing power of SIMD accelerators like GPUs. Although they use a very different approach for this purpose, they share the basic idea of compensating the convergence behaviour of an inferior numerical algorithm by a more efficient usage of the provided computing power. In this paper, we want to analyze the potential of combining both techniques. Therefore, we implement a mixed precision iterative refinement algorithm using a block-asynchronous iteration as an error correction solver, and compare its performance with a pure implementation of a block-asynchronous iteration and an iterative refinement method using double precision for the error correction solver. For matrices from theUniversity of FloridaMatrix collection,we report the convergence behaviour and provide the total solver runtime using different GPU architectures.

  16. Asynchronous design of Networks-on-Chip

    DEFF Research Database (Denmark)

    Sparsø, Jens

    2007-01-01

    The Network-on-chip concept has evolved as a solution to a broad range of problems related to the design of complex systems-on-chip (SoC) with tenths or hundreds of (heterogeneous) IP-cores. The paper introduces the NoC concept, identifies a range of possible timing organizations (globally......-synchronous, mesochronous, globally-asynchronous locally-synchronous and fully asynchronous), discusses the circuitry needed to implement these timing methodologies, and provides some implementation details for a couple of asynchronous NoCs designed at the Technical University of Denmark (DTU). The paper is written...

  17. Burst-Mode Asynchronous Controllers on FPGA

    Directory of Open Access Journals (Sweden)

    Duarte L. Oliveira

    2008-01-01

    Full Text Available FPGAs have been mainly used to design synchronous circuits. Asynchronous design on FPGAs is difficult because the resulting circuit may suffer from hazard problems. We propose a method that implements a popular class of asynchronous circuits, known as burst mode, on FPGAs based on look-up table architectures. We present two conditions that, if satisfied, guarantee essential hazard-free implementation on any LUT-based FPGA. By doing that, besides all the intrinsic advantages of asynchronous over synchronous circuits, they also take advantage of the shorter design time and lower cost associated with FPGA designs.

  18. W-state Analyzer and Multi-party Measurement-device-independent Quantum Key Distribution

    Science.gov (United States)

    Zhu, Changhua; Xu, Feihu; Pei, Changxing

    2015-12-01

    W-state is an important resource for many quantum information processing tasks. In this paper, we for the first time propose a multi-party measurement-device-independent quantum key distribution (MDI-QKD) protocol based on W-state. With linear optics, we design a W-state analyzer in order to distinguish the four-qubit W-state. This analyzer constructs the measurement device for four-party MDI-QKD. Moreover, we derived a complete security proof of the four-party MDI-QKD, and performed a numerical simulation to study its performance. The results show that four-party MDI-QKD is feasible over 150 km standard telecom fiber with off-the-shelf single photon detectors. This work takes an important step towards multi-party quantum communication and a quantum network.

  19. Formal analysis and design of multi-party fair exchange protocols

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Based on the origin of message items and channel combination between transacting parties, and events and relations among events, this paper presents a concise, precise, and hierarchical model for general fair exchange protocols, formally specifies various security requirements which are able to reflect inherent requirements for fair exchange protocols more rigorously, and partition these security requirements with fine granularity. This work helps analyze, debug, and design multi-party fair exchange protocols more effectively and elaborately.

  20. Economical multiparty simultaneous quantum identity authentication based on Greenberger-Horne-Zeilinger states

    Institute of Scientific and Technical Information of China (English)

    Yang Yu-Guang; Wen Qiao-Yan

    2009-01-01

    A multiparty simultaneous quantum identity authentication protocol based on Greenberger-Horne-Zeilinger (GHZ) states is proposed.The multi-user can be authenticated by a trusted third party (TTP) simultaneously.Compared with the scheme proposed recently (Wang et al 2006 Chin.Phys.Lett.23(9) 2360),the proposed scheme has the advantages of consuming fewer quantum and classical resources and lessening the difficulty and intensity of necessary operations.

  1. Asynchronous networks and event driven dynamics

    Science.gov (United States)

    Bick, Christian; Field, Michael

    2017-02-01

    Real-world networks in technology, engineering and biology often exhibit dynamics that cannot be adequately reproduced using network models given by smooth dynamical systems and a fixed network topology. Asynchronous networks give a theoretical and conceptual framework for the study of network dynamics where nodes can evolve independently of one another, be constrained, stop, and later restart, and where the interaction between different components of the network may depend on time, state, and stochastic effects. This framework is sufficiently general to encompass a wide range of applications ranging from engineering to neuroscience. Typically, dynamics is piecewise smooth and there are relationships with Filippov systems. In this paper, we give examples of asynchronous networks, and describe the basic formalism and structure. In the following companion paper, we make the notion of a functional asynchronous network rigorous, discuss the phenomenon of dynamical locks, and present a foundational result on the spatiotemporal factorization of the dynamics for a large class of functional asynchronous networks.

  2. Asynchronous stochastic approximation with differential inclusions

    Directory of Open Access Journals (Sweden)

    David S. Leslie

    2012-01-01

    Full Text Available The asymptotic pseudo-trajectory approach to stochastic approximation of Benaïm, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into the mean field to produce convergence results which remain similar to those of an equivalent synchronous process. In addition, this allows many of the restrictive assumptions previously associated with asynchronous stochastic approximation to be removed. The framework is extended for a coupled asynchronous stochastic approximation process with set-valued mean fields. Two-timescales arguments are used here in a similar manner to the original work in this area by Borkar. The applicability of this approach is demonstrated through learning in a Markov decision process.

  3. Wind Generator Stabilization with Doubly-Fed Asynchronous Machine

    Institute of Scientific and Technical Information of China (English)

    WU Li; WANG Zhi-xin

    2007-01-01

    This paper investigates the function of doubly-fed asynchronous machine(DASM) with emphasis placed on its ability to the stabilization of the power system including wind generators. P(active power) and Q(reactive power) compensation from DASM can be regulated independently through secondary-excitation controlling. Simulation results by power system computer aided design(PSCAD) show that DASM can restore the wind-generator system to a normal operating condition rapidly even following severe transmission-line failures. Comparison studies have also been performed between wind turbine pitch control and proposed method.

  4. A wavelet approach to binary blackholes with asynchronous multitasking

    Science.gov (United States)

    Lim, Hyun; Hirschmann, Eric; Neilsen, David; Anderson, Matthew; Debuhr, Jackson; Zhang, Bo

    2016-03-01

    Highly accurate simulations of binary black holes and neutron stars are needed to address a variety of interesting problems in relativistic astrophysics. We present a new method for the solving the Einstein equations (BSSN formulation) using iterated interpolating wavelets. Wavelet coefficients provide a direct measure of the local approximation error for the solution and place collocation points that naturally adapt to features of the solution. Further, they exhibit exponential convergence on unevenly spaced collection points. The parallel implementation of the wavelet simulation framework presented here deviates from conventional practice in combining multi-threading with a form of message-driven computation sometimes referred to as asynchronous multitasking.

  5. IHadoop: Asynchronous iterations for MapReduce

    KAUST Repository

    Elnikety, Eslam Mohamed Ibrahim

    2011-11-01

    MapReduce is a distributed programming frame-work designed to ease the development of scalable data-intensive applications for large clusters of commodity machines. Most machine learning and data mining applications involve iterative computations over large datasets, such as the Web hyperlink structures and social network graphs. Yet, the MapReduce model does not efficiently support this important class of applications. The architecture of MapReduce, most critically its dataflow techniques and task scheduling, is completely unaware of the nature of iterative applications; tasks are scheduled according to a policy that optimizes the execution for a single iteration which wastes bandwidth, I/O, and CPU cycles when compared with an optimal execution for a consecutive set of iterations. This work presents iHadoop, a modified MapReduce model, and an associated implementation, optimized for iterative computations. The iHadoop model schedules iterations asynchronously. It connects the output of one iteration to the next, allowing both to process their data concurrently. iHadoop\\'s task scheduler exploits inter-iteration data locality by scheduling tasks that exhibit a producer/consumer relation on the same physical machine allowing a fast local data transfer. For those iterative applications that require satisfying certain criteria before termination, iHadoop runs the check concurrently during the execution of the subsequent iteration to further reduce the application\\'s latency. This paper also describes our implementation of the iHadoop model, and evaluates its performance against Hadoop, the widely used open source implementation of MapReduce. Experiments using different data analysis applications over real-world and synthetic datasets show that iHadoop performs better than Hadoop for iterative algorithms, reducing execution time of iterative applications by 25% on average. Furthermore, integrating iHadoop with HaLoop, a variant Hadoop implementation that caches

  6. ON THE ISSUE OF VECTOR CONTROL OF THE ASYNCHRONOUS MOTORS

    Directory of Open Access Journals (Sweden)

    B. I. Firago

    2015-01-01

    of the computer based simulation of a specific electric drive on the basis of an asynchronous motor 4А132S4У3 (7,5 kW with direct vector control at the rated loading. The results confirm validity of the presented technique to investigation of the

  7. Exploring Asynchronous Many-Task Runtime Systems toward Extreme Scales

    Energy Technology Data Exchange (ETDEWEB)

    Knight, Samuel [O8953; Baker, Gavin Matthew; Gamell, Marc [Rutgers U; Hollman, David [08953; Sjaardema, Gregor [SNL; Kolla, Hemanth [SNL; Teranishi, Keita; Wilke, Jeremiah J; Slattengren, Nicole [SNL; Bennett, Janine Camille

    2015-10-01

    Major exascale computing reports indicate a number of software challenges to meet the dramatic change of system architectures in near future. While several-orders-of-magnitude increase in parallelism is the most commonly cited of those, hurdles also include performance heterogeneity of compute nodes across the system, increased imbalance between computational capacity and I/O capabilities, frequent system interrupts, and complex hardware architectures. Asynchronous task-parallel programming models show a great promise in addressing these issues, but are not yet fully understood nor developed su ciently for computational science and engineering application codes. We address these knowledge gaps through quantitative and qualitative exploration of leading candidate solutions in the context of engineering applications at Sandia. In this poster, we evaluate MiniAero code ported to three leading candidate programming models (Charm++, Legion and UINTAH) to examine the feasibility of these models that permits insertion of new programming model elements into an existing code base.

  8. Asynchronous Task-Based Polar Decomposition on Manycore Architectures

    KAUST Repository

    Sukkari, Dalal

    2016-10-25

    This paper introduces the first asynchronous, task-based implementation of the polar decomposition on manycore architectures. Based on a new formulation of the iterative QR dynamically-weighted Halley algorithm (QDWH) for the calculation of the polar decomposition, the proposed implementation replaces the original and hostile LU factorization for the condition number estimator by the more adequate QR factorization to enable software portability across various architectures. Relying on fine-grained computations, the novel task-based implementation is also capable of taking advantage of the identity structure of the matrix involved during the QDWH iterations, which decreases the overall algorithmic complexity. Furthermore, the artifactual synchronization points have been severely weakened compared to previous implementations, unveiling look-ahead opportunities for better hardware occupancy. The overall QDWH-based polar decomposition can then be represented as a directed acyclic graph (DAG), where nodes represent computational tasks and edges define the inter-task data dependencies. The StarPU dynamic runtime system is employed to traverse the DAG, to track the various data dependencies and to asynchronously schedule the computational tasks on the underlying hardware resources, resulting in an out-of-order task scheduling. Benchmarking experiments show significant improvements against existing state-of-the-art high performance implementations (i.e., Intel MKL and Elemental) for the polar decomposition on latest shared-memory vendors\\' systems (i.e., Intel Haswell/Broadwell/Knights Landing, NVIDIA K80/P100 GPUs and IBM Power8), while maintaining high numerical accuracy.

  9. Asynchronous parallel generating set search for linearly-constrained optimization.

    Energy Technology Data Exchange (ETDEWEB)

    Kolda, Tamara G.; Griffin, Joshua; Lewis, Robert Michael

    2007-04-01

    We describe an asynchronous parallel derivative-free algorithm for linearly-constrained optimization. Generating set search (GSS) is the basis of ourmethod. At each iteration, a GSS algorithm computes a set of search directionsand corresponding trial points and then evaluates the objective function valueat each trial point. Asynchronous versions of the algorithm have been developedin the unconstrained and bound-constrained cases which allow the iterations tocontinue (and new trial points to be generated and evaluated) as soon as anyother trial point completes. This enables better utilization of parallel resourcesand a reduction in overall runtime, especially for problems where the objec-tive function takes minutes or hours to compute. For linearly-constrained GSS,the convergence theory requires that the set of search directions conform to the3 nearby boundary. The complexity of developing the asynchronous algorithm forthe linearly-constrained case has to do with maintaining a suitable set of searchdirections as the search progresses and is the focus of this research. We describeour implementation in detail, including how to avoid function evaluations bycaching function values and using approximate look-ups. We test our imple-mentation on every CUTEr test problem with general linear constraints and upto 1000 variables. Without tuning to individual problems, our implementationwas able to solve 95% of the test problems with 10 or fewer variables, 75%of the problems with 11-100 variables, and nearly half of the problems with100-1000 variables. To the best of our knowledge, these are the best resultsthat have ever been achieved with a derivative-free method. Our asynchronousparallel implementation is freely available as part of the APPSPACK software.4

  10. An Asynchronous P300 BCI With SSVEP-Based Control State Detection

    DEFF Research Database (Denmark)

    Panicker, Rajesh C.; Puthusserypady, Sadasivan; Sun, Ying

    2011-01-01

    In this paper, an asynchronous brain–computer interface (BCI) system combining the P300 and steady-state visually evoked potentials (SSVEPs) paradigms is proposed. The information transfer is accomplished using P300 event-related potential paradigm and the control state (CS) detection is achieved...

  11. Modelling and Simulation of Asynchronous Real-Time Systems using Timed Rebeca

    CERN Document Server

    Aceto, Luca; Ingolfsdottir, Anna; Reynisson, Arni Hermann; Sigurdarson, Steinar Hugi; Sirjani, Marjan; 10.4204/EPTCS.58.1

    2011-01-01

    In this paper we propose an extension of the Rebeca language that can be used to model distributed and asynchronous systems with timing constraints. We provide the formal semantics of the language using Structural Operational Semantics, and show its expressiveness by means of examples. We developed a tool for automated translation from timed Rebeca to the Erlang language, which provides a first implementation of timed Rebeca. We can use the tool to set the parameters of timed Rebeca models, which represent the environment and component variables, and use McErlang to run multiple simulations for different settings. Timed Rebeca restricts the modeller to a pure asynchronous actor-based paradigm, where the structure of the model represents the service oriented architecture, while the computational model matches the network infrastructure. Simulation is shown to be an effective analysis support, specially where model checking faces almost immediate state explosion in an asynchronous setting.

  12. EXPERIMENTAL STUDY OF THE ASYNCHRONOUS MULTISPLITTING RELAXATION METHODS FOR THE LINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Zhong-zhi Bai

    2002-01-01

    We study the numerical behaviours of the relaxed asynchronous multisplitting methods for the linear complementarity problems by solving some typical problems from practical applications on a real multiprocessor system. Numerical results show that the parallel multisplitting relaxation methods always perform much better than the corresponding sequential alternatives, and that the asynchronous multisplitting relaxation methods often outperform their corresponding synchronous counterparts. Moreover, the two-sweep relaxed multisplitting methods have better convergence properties than their corresponding one-sweep relaxed ones in the sense that they have larger convergence domains and faster convergence speeds. Hence, the asynchronous multisplitting unsymmetric relaxation iterations should be the methods of choice for solving the large sparse linear complementarity problems in the parallel computing environments.

  13. Issue Evolution and the Remaking of Partisan Alignments in a European Multiparty System

    DEFF Research Database (Denmark)

    Arndt, Christoph

    Issue evolution has become a well-established theoretical perspective in the analysis of long-term electoral behavior and partisan alignments in the U.S. after the emergence of the cultural wars. Outside the U.S., however, this perspective has been rarely used to analyze electoral behavior...... analytical validity and usefulness in the analysis of electoral behavior beyond the U.S.-case....... two party systems, fringe parties act as catalysts of issue evolution on the elite-level which is then followed by mainstream party adaption and the mass electorate realignment. Applying and refining the issue evolution perspective to a multiparty context, this paper therefore demonstrates its...

  14. FAST: A fully asynchronous and status-tracking pattern for geoprocessing services orchestration

    Science.gov (United States)

    Wu, Huayi; You, Lan; Gui, Zhipeng; Gao, Shuang; Li, Zhenqiang; Yu, Jingmin

    2014-09-01

    Geoprocessing service orchestration (GSO) provides a unified and flexible way to implement cross-application, long-lived, and multi-step geoprocessing service workflows by coordinating geoprocessing services collaboratively. Usually, geoprocessing services and geoprocessing service workflows are data and/or computing intensive. The intensity feature may make the execution process of a workflow time-consuming. Since it initials an execution request without blocking other interactions on the client side, an asynchronous mechanism is especially appropriate for GSO workflows. Many critical problems remain to be solved in existing asynchronous patterns for GSO including difficulties in improving performance, status tracking, and clarifying the workflow structure. These problems are a challenge when orchestrating performance efficiency, making statuses instantly available, and constructing clearly structured GSO workflows. A Fully Asynchronous and Status-Tracking (FAST) pattern that adopts asynchronous interactions throughout the whole communication tier of a workflow is proposed for GSO. The proposed FAST pattern includes a mechanism that actively pushes the latest status to clients instantly and economically. An independent proxy was designed to isolate the status tracking logic from the geoprocessing business logic, which assists the formation of a clear GSO workflow structure. A workflow was implemented in the FAST pattern to simulate the flooding process in the Poyang Lake region. Experimental results show that the proposed FAST pattern can efficiently tackle data/computing intensive geoprocessing tasks. The performance of all collaborative partners was improved due to the asynchronous mechanism throughout communication tier. A status-tracking mechanism helps users retrieve the latest running status of a GSO workflow in an efficient and instant way. The clear structure of the GSO workflow lowers the barriers for geospatial domain experts and model designers to

  15. Spatiotemporal Features for Asynchronous Event-based Data

    Directory of Open Access Journals (Sweden)

    Xavier eLagorce

    2015-02-01

    Full Text Available Bio-inspired asynchronous event-based vision sensors are currently introducing a paradigm shift in visual information processing. These new sensors rely on a stimulus-driven principle of light acquisition similar to biological retinas. They are event-driven and fully asynchronous, thereby reducing redundancy and encoding exact times of input signal changes, leading to a very precise temporal resolution. Approaches for higher-level computer vision often rely on the realiable detection of features in visual frames, but similar definitions of features for the novel dynamic and event-based visual input representation of silicon retinas have so far been lacking. This article addresses the problem of learning and recognizing features for event-based vision sensors, which capture properties of truly spatiotemporal volumes of sparse visual event information. A novel computational architecture for learning and encoding spatiotemporal features is introduced based on a set of predictive recurrent reservoir networks, competing via winner-take-all selection. Features are learned in an unsupervised manner from real-world input recorded with event-based vision sensors. It is shown that the networks in the architecture learn distinct and task-specific dynamic visual features, and can predict their trajectories over time.

  16. Handbook of asynchronous machines with variable speed

    CERN Document Server

    Razik, Hubert

    2013-01-01

    This handbook deals with the asynchronous machine in its close environment. It was born from a reflection on this electromagnetic converter whose integration in industrial environments takes a wide part. Previously this type of motor operated at fixed speed, from now on it has been integrated more and more in processes at variable speed. For this reason it seemed useful, or necessary, to write a handbook on the various aspects from the motor in itself, via the control and while finishing by the diagnosis aspect. Indeed, an asynchronous motor is used nowadays in industry where variation speed a

  17. Existence test for asynchronous interval iterations

    DEFF Research Database (Denmark)

    Madsen, Kaj; Caprani, O.; Stauning, Ole

    1997-01-01

    as a synchronous (sequential) interval iteration:In each iteration step all components of the iterate are calculatedbased on the previous iterate. In this case it is straight forward to base simple interval existence and non-existencetests on the calculations done in each step of the iteration. The search can also...... be performed as an asynchronous (parallel) iteration: Only a few components are changed in each stepand this calculation is in general based on components from differentprevious iterates. For the asynchronous iteration it turns out thatsimple tests of existence and non-existence can be based...

  18. A Provably Secure Asynchronous Proactive RSA Scheme

    Institute of Scientific and Technical Information of China (English)

    ZHANG Rui-shan; LI Qiang; CHEN Ke-fei

    2005-01-01

    The drawback of the first asynchronous proactive RSA scheme presented by Zhou in 2001, is that the se curity definition and security proof do not follow the approach of provable security. This paper presented a provably secure asynchronous proactive RSA scheme, which includes three protocols: initial key distribution protocol,signature generation protocol and share refreshing protocol. Taken these protocols together, a complete provably secure proactive RSA scheme was obtained. And the efficiency of the scheme is approximate to that of the scheme of Zhou.

  19. Processor arrays with asynchronous TDM optical buses

    Science.gov (United States)

    Li, Y.; Zheng, S. Q.

    1997-04-01

    We propose a pipelined asynchronous time division multiplexing optical bus. Such a bus can use one of the two hardwared priority schemes, the linear priority scheme and the round-robin priority scheme. Our simulation results show that the performances of our proposed buses are significantly better than the performances of known pipelined synchronous time division multiplexing optical buses. We also propose a class of processor arrays connected by pipelined asynchronous time division multiplexing optical buses. We claim that our proposed processor array not only have better performance, but also have better scalabilities than the existing processor arrays connected by pipelined synchronous time division multiplexing optical buses.

  20. Synchronization of Asynchronous Switched Boolean Network.

    Science.gov (United States)

    Zhang, Hao; Wang, Xingyuan; Lin, Xiaohui

    2015-01-01

    In this paper, the complete synchronizations for asynchronous switched Boolean network with free Boolean sequence controllers and close-loop controllers are studied. First, the basic asynchronous switched Boolean network model is provided. With the method of semi-tensor product, the Boolean dynamics is translated into linear representation. Second, necessary and sufficient conditions for ASBN synchronization with free Boolean sequence control and close-loop control are derived, respectively. Third, some illustrative examples are provided to show the efficiency of the proposed methods.

  1. Distributed Computing for Signal Processing: Modeling of Asynchronous Parallel Computation.

    Science.gov (United States)

    1986-03-01

    indirect binars n-cubc microprocessor artas Il:I:/ I ron (omput. (C-26 tMay 1977). 458-473. 31. Pradhan. D. K and Kodandapani. K. L. A uniformn...detection pur- tataire i’eed i the -Ietinaii~n or nothr hoti , poses to the owl1 As the train. ince the train is created, the host’s star - -. titl If 5

  2. Asynchronous Rumor Spreading on Random Graphs

    CERN Document Server

    Panagiotou, Konstantinos

    2016-01-01

    We perform a thorough study of various characteristics of the asynchronous push-pull protocol for spreading a rumor on Erd\\H{o}s-R\\'enyi random graphs $G_{n,p}$, for any $p>c\\ln(n)/n$ with $c>1$. In particular, we provide a simple strategy for analyzing the asynchronous push-pull protocol on arbitrary graph topologies and apply this strategy to $G_{n,p}$. We prove tight bounds of logarithmic order for the total time that is needed until the information has spread to all nodes. Surprisingly, the time required by the asynchronous push-pull protocol is asymptotically almost unaffected by the average degree of the graph. Similarly tight bounds for Erd\\H{o}s-R\\'enyi random graphs have previously only been obtained for the synchronous push protocol, where it has been observed that the total running time increases significantly for sparse random graphs. Finally, we quantify the robustness of the protocol with respect to transmission and node failures. Our analysis suggests that the asynchronous protocols are particu...

  3. Asynchronous ASCII Event Count Status Code

    Science.gov (United States)

    2012-03-01

    IRIG STANDARD 215-12 TELECOMMUNICATIONS AND TIMING GROUP ASYNCHRONOUS ASCII EVENT COUNT STATUS CODES...Inter-range Instrumentation Group ( IRIG ) Standard for American Standard Code for Information Interchange (ASCII)-formatted EC status transfer which can be...circuits and Ethernet networks. Provides systems engineers and equipment vendors with an Inter-range Instrumentation Group ( IRIG ) Standard for American

  4. Increasing Student Engagement Using Asynchronous Learning

    Science.gov (United States)

    Northey, Gavin; Bucic, Tania; Chylinski, Mathew; Govind, Rahul

    2015-01-01

    Student engagement is an ongoing concern for educators because of its positive association with deep learning and educational outcomes. This article tests the use of a social networking site (Facebook) as a tool to facilitate asynchronous learning opportunities that complement face-to-face interactions and thereby enable a stronger learning…

  5. Asynchronous stream processing with S-Net

    NARCIS (Netherlands)

    Grelck, C.; Scholz, S.-B.; Shafarenko, A.

    2010-01-01

    We present the rationale and design of S-Net, a coordination language for asynchronous stream processing. The language achieves a near-complete separation between the application code, written in any conventional programming language, and the coordination/communication code written in S-Net. Our app

  6. The Effect of Asynchronous/Synchronous Approaches on English Vocabulary Achievement: A Study of Iranian EFL Learners

    Science.gov (United States)

    Khodaparast, Fatemeh; Ghafournia, Narjes

    2015-01-01

    The contribution of computer-assisted instructional programs to language learning process has been the focus of researchers for about two decades. However, the effect of synchronous and asynchronous computer-assisted approaches of language teaching on improving L2 vocabulary has been scarcely investigated. This study explored whether synchronous,…

  7. Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders.

    Science.gov (United States)

    Balasubramanian, P; Yamashita, S

    2016-01-01

    This article presents two area/latency optimized gate level asynchronous full adder designs which correspond to early output logic. The proposed full adders are constructed using the delay-insensitive dual-rail code and adhere to the four-phase return-to-zero handshaking. For an asynchronous ripple carry adder (RCA) constructed using the proposed early output full adders, the relative-timing assumption becomes necessary and the inherent advantages of the relative-timed RCA are: (1) computation with valid inputs, i.e., forward latency is data-dependent, and (2) computation with spacer inputs involves a bare minimum constant reverse latency of just one full adder delay, thus resulting in the optimal cycle time. With respect to different 32-bit RCA implementations, and in comparison with the optimized strong-indication, weak-indication, and early output full adder designs, one of the proposed early output full adders achieves respective reductions in latency by 67.8, 12.3 and 6.1 %, while the other proposed early output full adder achieves corresponding reductions in area by 32.6, 24.6 and 6.9 %, with practically no power penalty. Further, the proposed early output full adders based asynchronous RCAs enable minimum reductions in cycle time by 83.4, 15, and 8.8 % when considering carry-propagation over the entire RCA width of 32-bits, and maximum reductions in cycle time by 97.5, 27.4, and 22.4 % for the consideration of a typical carry chain length of 4 full adder stages, when compared to the least of the cycle time estimates of various strong-indication, weak-indication, and early output asynchronous RCAs of similar size. All the asynchronous full adders and RCAs were realized using standard cells in a semi-custom design fashion based on a 32/28 nm CMOS process technology.

  8. Low Latency High Throughout Circular Asynchronous FIFO

    Institute of Scientific and Technical Information of China (English)

    XIAO Yong; ZHOU Runde

    2008-01-01

    This paper describes a circular first in first out (FIFO) and its protocols which have a very low la-tency while still maintaining high throughput. Unlike the existing serial FIFOs based on asynchronous micro-pipelines, this FIFO's cells communicate directly with the input and output ports through a common bus, which effectively eliminates the data movement from the input port to the output port, thereby reducing the latency and the power consumption. Furthermore, the latency does not increase with the number of FIFO stages. Single-track asynchronous protocols are used to simplify the FIFO controller design, with only three C-gates needed in each cell controller, which substantially reduces the area. Simulations with the TSMC 0.25 Ijm CMOS logic process show that the latency of the 4-stage FIFO is less than 581 ps and the throughput is higher than 2.2 GHz.

  9. Asynchronous exponential growth of a bacterial population

    Directory of Open Access Journals (Sweden)

    Mohamed Boulanouar

    2014-01-01

    Full Text Available In this work, we complete a study started earlier in [1,2] wherein a model of growing bacterial population has been the matter of a mathematical analysis. We show that the full model is governed by a strongly continuous semigroup. Beside the positivity and the irreducibility of the generated semigroup, we describe its asymptotic behavior in the uniform topology which leads to the asynchronous exponential growth of the bacterial population.

  10. Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory

    KAUST Repository

    Pearce, Roger

    2010-11-01

    Processing large graphs is becoming increasingly important for many domains such as social networks, bioinformatics, etc. Unfortunately, many algorithms and implementations do not scale with increasing graph sizes. As a result, researchers have attempted to meet the growing data demands using parallel and external memory techniques. We present a novel asynchronous approach to compute Breadth-First-Search (BFS), Single-Source-Shortest-Paths, and Connected Components for large graphs in shared memory. Our highly parallel asynchronous approach hides data latency due to both poor locality and delays in the underlying graph data storage. We present an experimental study applying our technique to both In-Memory and Semi-External Memory graphs utilizing multi-core processors and solid-state memory devices. Our experiments using synthetic and real-world datasets show that our asynchronous approach is able to overcome data latencies and provide significant speedup over alternative approaches. For example, on billion vertex graphs our asynchronous BFS scales up to 14x on 16-cores. © 2010 IEEE.

  11. Simple Post Quantum Scheme for Higher Key Rate Multiparty Quantum Key Distribution

    Directory of Open Access Journals (Sweden)

    Abudhahir Buhari

    2012-10-01

    Full Text Available We propose a multi-party quantum key distribution protocol which enables all the receivers can converttheir respective private shared key into common secret key without use of entanglement. The maincomponent of our protocol is a simple post quantum scheme for achieving the higher secret key rate.Efficiency of the extracted key rate is almost 100%. We assume that sender established the pre-sharedprivate secret keys and a common secret number with the receivers. Our proposed scheme sends n stringsof number to n receivers in the public channel to convert their respective shared secret key into commonsecret key in the presence of Eve. We also analyze the complexity of attack by the adversary to guess thesecret key

  12. Multiparty Quantum Secret Sharing of Classical Message using Cavity Quantum Electrodynamic System

    Institute of Scientific and Technical Information of China (English)

    HAN Lian-Fang; LIU Yi-Min; ZHANG Zhan-Jun

    2006-01-01

    @@ An experimental feasible scheme of multiparty secret sharing of classical messages is proposed, based on a cavity quantum electrodynamic system. The secret messages are imposed on atomic Bell states initially in the sender's possession by local unitary operations. By swapping quantum entanglement of atomic Bell states, the secret messages are split into several parts and each part is distributed to a separate party. In this case, any subset of the entire party group can not read out the secret message but the entirety via mutual cooperations. In this scheme, to discriminate atomic Bell states, additional classical fields are employed besides the same highly-detuned single-mode cavities used to prepare atomic Bell states. This scheme is insensitive to the cavity decay and the thermal field, and usual joint Bell-state measurements are unnecessary.

  13. Constructive interference between disordered couplings enhances multiparty entanglement in quantum Heisenberg spin glass models

    Science.gov (United States)

    Mishra, Utkarsh; Rakshit, Debraj; Prabhu, R.; Sen(De, Aditi; Sen, Ujjwal

    2016-08-01

    Disordered systems form one of the centrestages of research in many body sciences and lead to a plethora of interesting phenomena and applications. A paradigmatic disordered system consists of a one-dimensional array of quantum spin-1/2 particles, governed by the Heisenberg spin glass Hamiltonian with natural or engineered quenched disordered couplings in an external magnetic field. These systems allow disorder-induced enhancement for bipartite and multipartite observables. Here we show that simultaneous application of independent quenched disorders results in disorder-induced enhancement, while the same is absent with individual application of the same disorders. We term the phenomenon as constructive interference and the corresponding parameter stretches as the Venus regions. Interestingly, it has only been observed for multiparty entanglement and is absent for the single- and two-party physical quantities.

  14. Efficient Multiparty Quantum Secret Sharing with Greenberger-Horne-Zeilinger States

    Institute of Scientific and Technical Information of China (English)

    DENG Fu-Guo; ZHOU Ping; LI Xi-Han; LI Chun-Yan; ZHOU Hong-Yu

    2006-01-01

    @@ An efficient multiparty quantum secret sharing scheme is proposed with Greenberger-Horne-Zeilinger (GHZ)states following some ideas in quantum dense coding. The agents take the single-photon measurements on the photons received for eavesdropping check and exploit the four local unitary operations I, σz, σx and iσy tocode their message. This scheme has the advantage of high capacity as each GHZ state can carry two bits of information. The parties do not need to announce the measuring bases for almost all the photons, which will reduce the classical information exchanged largely. The intrinsic efficiency for qubits and the total efficiency both approach the maximal values.

  15. Normalized and Asynchronous Mirror Alignment for Cherenkov Telescopes

    CERN Document Server

    Ahnen, M L; Balbo, M; Bergmann, M; Biland, A; Blank, M; Bretz, T; Bruegge, K A; Buss, J; Domke, M; Dorner, D; Einecke, S; Hempfling, C; Hildebrand, D; Hughes, G; Lustermann, W; Mannheim, K; Mueller, S A; Neise, D; Neronov, A; Noethe, M; Overkemping, A -K; Paravac, A; Pauss, F; Rhode, W; Shukla, A; Temme, F; Thaele, J; Toscano, S; Vogler, P; Walter, R; Wilbert, A

    2016-01-01

    Imaging Atmospheric Cherenkov Telescopes (IACTs) need imaging optics with large apertures and high image intensities to map the faint Cherenkov light emitted from cosmic ray air showers onto their image sensors. Segmented reflectors fulfill these needs, and as they are composed from mass production mirror facets they are inexpensive and lightweight. However, as the overall image is a superposition of the individual facet images, alignment is a challenge. Here we present a computer vision based star tracking alignment method, which also works for limited or changing star light visibility. Our method normalizes the mirror facet reflection intensities to become independent of the reference star's intensity or the cloud coverage. Using two CCD cameras, our method records the mirror facet orientations asynchronously of the telescope drive system, and thus makes the method easy to integrate into existing telescopes. It can be combined with remote facet actuation, but does not require one to work. Furthermore, it ca...

  16. Estimation of delays in generalized asynchronous Boolean networks.

    Science.gov (United States)

    Das, Haimabati; Layek, Ritwik Kumar

    2016-10-20

    A new generalized asynchronous Boolean network (GABN) model has been proposed in this paper. This continuous-time discrete-state model captures the biological reality of cellular dynamics without compromising the computational efficiency of the Boolean framework. The GABN synthesis procedure is based on the prior knowledge of the logical structure of the regulatory network, and the experimental transcriptional parameters. The novelty of the proposed methodology lies in considering different delays associated with the activation and deactivation of a particular protein (especially the transcription factors). A few illustrative examples of some well-studied network motifs have been provided to explore the scope of using the GABN model for larger networks. The GABN model of the p53-signaling pathway in response to γ-irradiation has also been simulated in the current paper to provide an indirect validation of the proposed schema.

  17. Blending Online Asynchronous and Synchronous Learning

    Directory of Open Access Journals (Sweden)

    Lisa C. Yamagata-Lynch

    2014-04-01

    Full Text Available In this article I will share a qualitative self-study about a 15-week blended 100% online graduate level course facilitated through synchronous meetings on Blackboard Collaborate and asynchronous discussions on Blackboard. I taught the course at the University of Tennessee (UT during the spring 2012 semester and the course topic was online learning environments. The primary research question of this study was: How can the designer/instructor optimize learning experiences for students who are studying about online learning environments in a blended online course relying on both synchronous and asynchronous technologies? I relied on student reflections of course activities during the beginning, middle, and the end of the semester as the primary data source to obtain their insights regarding course experiences. Through the experiences involved in designing and teaching the course and engaging in this study I found that there is room in the instructional technology research community to address strategies for facilitating online synchronous learning that complement asynchronous learning. Synchronous online whole class meetings and well-structured small group meetings can help students feel a stronger sense of connection to their peers and instructor and stay engaged with course activities. In order to provide meaningful learning spaces in synchronous learning environments, the instructor/designer needs to balance the tension between embracing the flexibility that the online space affords to users and designing deliberate structures that will help them take advantage of the flexible space.

  18. FPGA Architecture for Multi-Style Asynchronous Logic

    CERN Document Server

    Huot, N; Fesquet, L; Renaudin, M

    2011-01-01

    This paper presents a novel FPGA architecture for implementing various styles of asynchronous logic. The main objective is to break the dependency between the FPGA architecture dedicated to asynchronous logic and the logic style. The innovative aspects of the architecture are described. Moreover the structure is well suited to be rebuilt and adapted to fit with further asynchronous logic evolutions thanks to the architecture genericity. A full-adder was implemented in different styles of logic to show the architecture flexibility.

  19. Designing asynchronous circuits using NULL convention logic (NCL)

    CERN Document Server

    Smith, Scott

    2009-01-01

    Designing Asynchronous Circuits using NULL Convention Logic (NCL) begins with an introduction to asynchronous (clockless) logic in general, and then focuses on delay-insensitive asynchronous logic design using the NCL paradigm. The book details design of input-complete and observable dual-rail and quad-rail combinational circuits, and then discusses implementation of sequential circuits, which require datapath feedback. Next, throughput optimization techniques are presented, including pipelining, embedding registration, early completion, and NULL cycle reduction. Subsequently, low-power design

  20. EPOS for Coordination of Asynchronous Sensor Webs Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Develop, integrate, and deploy software-based tools to coordinate asynchronous, distributed missions and optimize observation planning spanning simultaneous...

  1. Multi-Agent Model using Secure Multi-Party Computing in e-Governance

    CERN Document Server

    Mishra, Durgesh Kumar

    2009-01-01

    Information management and retrieval of all the citizen occurs in almost all the public service functions. Electronic Government system is an emerging trend in India through which efforts are made to strive maximum safety and security. Various solutions for this have been proposed like Shibboleth, Public Key Infrastructure, Smart Cards and Light Weight Directory Access Protocols. Still, none of these guarantee 100 percent security. Efforts are being made to provide common national identity solution to various diverse Government identity cards. In this paper, we discuss issues related to these solutions.

  2. Transforming Participation Frameworks in Multi-Party Mandarin Conversation: The Use of Discourse Particles and Body Behavior

    OpenAIRE

    Wu, Ruey-Jiuan Regina

    1997-01-01

    Within the framework of conversation analysis (Sacks, Schegloff, & Jefferson, 1974), this paper investigates how Mandarin speakers negotiate their participatory roles in multi-party conversation through the use of linguistic and non-linguistic resources. Specifically, the present paper focuses on two sequential contexts: (1) parties who have otherwise been playing a marginal role try to make themselves focal, and (2) others incorporate a previously not actively participating party. C...

  3. Arguing as an Academic Purpose: The Role of Asynchronous Conferencing in Supporting Argumentative Dialogue in School and University

    Science.gov (United States)

    Coffin, Caroline; Hewings, Ann; North, Sarah

    2012-01-01

    Learning to argue is a key academic purpose for both first and second language students. It has been claimed that computer mediated asynchronous text-based conferencing is a useful medium for developing argumentation skills (Andriessen, Baker, & Suthers, 2003). This paper reports on two research studies which explore this claim. One study focused…

  4. Investigation on the spectral properties of 2D asynchronous fluorescence spectra generated by using variable excitation wavelengths as a perturbation

    Science.gov (United States)

    Wang, Jingdan; He, Anqi; Guo, Ran; Wei, Yongju; Feng, Juan; Xu, Yizhuang; Noda, Isao; Wu, Jinguang

    2016-11-01

    Properties of 2D asynchronous spectra generated from a series of fluorescence emission spectra are investigated. Variable excitation wavelengths are utilized as an external perturbation. Based on the results of mathematical analysis and computer simulation, we find that no cross peak will be produced on the 2D asynchronous spectrum if the fluorescent solute under investigation occurs in a single micro-environment. The observation of cross peaks implies that the fluorescent molecule may occur in different micro-environments in a solution. Based on these results, we use 2D asynchronous spectra to investigate the emission spectra of anthracene dissolved in cyclohexane. When the concentration of anthracene is low, no cross peak is produced in the resultant 2D asynchronous spectrum, confirming that anthracene is dissolved as single molecule in the solution. As the concentration elevated, cross peaks appear in the corresponding 2D asynchronous spectra. A plausible explanation of this phenomenon is that anthracene may undergo aggregation via π-π interaction or π-C-H interaction.

  5. Asynchronous Event-Driven Particle Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Donev, A

    2007-08-30

    We present, in a unifying way, the main components of three asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel stochastic molecular-dynamics algorithm that builds on the Direct Simulation Monte Carlo (DSMC). We explain how to effectively combine event-driven and classical time-driven handling, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

  6. Asynchronous Event-Driven Particle Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Donev, A

    2007-02-28

    We present in a unifying way the main components of three examples of asynchronous event-driven algorithms for simulating physical systems of interacting particles. The first example, hard-particle molecular dynamics (MD), is well-known. We also present a recently-developed diffusion kinetic Monte Carlo (DKMC) algorithm, as well as a novel event-driven algorithm for Direct Simulation Monte Carlo (DSMC). Finally, we describe how to combine MD with DSMC in an event-driven framework, and discuss some promises and challenges for event-driven simulation of realistic physical systems.

  7. Globally coupled maps with asynchronous updating

    CERN Document Server

    Abramson, G; Abramson, Guillermo; Zanette, Damian H.

    1998-01-01

    We analyze a system of globally coupled logistic maps with asynchronous updating. We show that its dynamics differs considerably from that of the synchronous case. For growing values of the coupling intensity, an inverse bifurcation cascade replaces the structure of clusters and ordering in the phase diagram. We present numerical simulations and an analytical description based on an effective single-element dynamics affected by internal fluctuations. Both of them show how global coupling is able to suppress the complexity of the single-element evolution. We find that, in contrast to systems with synchronous update, internal fluctuations satisfy the law of large numbers.

  8. Asynchronous Learning Sources in a High-Tech Organization

    Science.gov (United States)

    Bouhnik, Dan; Giat, Yahel; Sanderovitch, Yafit

    2009-01-01

    Purpose: The purpose of this study is to characterize learning from asynchronous sources among research and development (R&D) personnel. It aims to examine four aspects of asynchronous source learning: employee preferences regarding self-learning; extent of source usage; employee satisfaction with these sources and the effect of the sources on the…

  9. Localized radio frequency communication using asynchronous transfer mode protocol

    Science.gov (United States)

    Witzke, Edward L.; Robertson, Perry J.; Pierson, Lyndon G.

    2007-08-14

    A localized wireless communication system for communication between a plurality of circuit boards, and between electronic components on the circuit boards. Transceivers are located on each circuit board and electronic component. The transceivers communicate with one another over spread spectrum radio frequencies. An asynchronous transfer mode protocol controls communication flow with asynchronous transfer mode switches located on the circuit boards.

  10. Designing Asynchronous Circuits for Low Power: An IFIR Filter

    DEFF Research Database (Denmark)

    Nielsen, Lars Skovby; Sparsø, Jens

    1999-01-01

    by numerically small samples). Apart from the improved RAM design, these measures are only viable in an asynchronous design. The principles and techniques explained in this paper are of a general nature, and they apply to the design of asynchronous low-power digital signal-processing circuits in a broader......This paper addresses the design of asynchronous circuits for low power through an example: a filter bank for a digital hearing aid. The asynchronous design re-implements an existing synchronous circuit which is used in a commercial product. For comparison, both designs have been fabricated...... in the same 0.7 /spl mu/m CMOS technology. When processing typical data (less than 50 dB sound pressure), the asynchronous control and data-path logic, an improved RAM design, and by a mechanism that adapts the number range to the actual need (exploiting the fact that typical audio signals are characterized...

  11. Evaluating economic strategies for multi-party application of performance contracting

    Science.gov (United States)

    Zhao, Haiyan

    2007-12-01

    Scope and method of study. This subject matter is focused on the economic justification for energy management projects which involve both an energy client and an energy service company (ESCO) (and possibly other parties) in an Energy Savings Performance Contracting (ESPC) project. In this research, an analysis model is developed which includes multi-party involvement in justifying energy management projects that require expertise and capital beyond that found in the energy client. Examples include energy generation from waste heat, solar applications, and so on. The model is built on a system level and expands risk analysis beyond the simple party views. It is a multi-party model which seeks to find "win-win" solutions for all parties (or to expose shortcomings of projects where all parties cannot "win"). Such model application will help in justifying projects that might otherwise be discarded as too complex and too risky, or expose projects that will not produce demanded economic performance. Findings and conclusions. The inputs of the model are referred to as being probabilistic and deterministic. The outputs of the model are the Net Present Values (NPV) of the client and the ESCO, respectively. The probabilistic inputs are either probability-distributed or simulated with the correlation coefficients from historical data. The deterministic inputs are referred to as either discrete arrays or single values. Multiple scenarios are generated in accordance with the number of the discrete arrays and the number of the values in each array. In each scenario, all probabilistic inputs are simulated, combined with the values randomly picked from the discrete arrays, and entered into the model. The output analysis is based on simulated NPVs for the primary parties (client and ESCO). The major contributions of the research include: (1) develop an analysis protocol for the parties involved in an ESPC project depending on the inputs and outputs of the proposed energy system, (2

  12. Asynchronicity of facial blood perfusion in migraine.

    Directory of Open Access Journals (Sweden)

    Nina Zaproudina

    Full Text Available Asymmetrical changes in blood perfusion and asynchronous blood supply to head tissues likely contribute to migraine pathophysiology. Imaging was widely used in order to understand hemodynamic variations in migraine. However, mapping of blood pulsations in the face of migraineurs has not been performed so far. We used the Blood Pulsation Imaging (BPI technique, which was recently developed in our group, to establish whether 2D-imaging of blood pulsations parameters can reveal new biomarkers of migraine. BPI characteristics were measured in migraineurs during the attack-free interval and compared to healthy subjects with and without a family history of migraine. We found a novel phenomenon of transverse waves of facial blood perfusion in migraineurs in contrast to healthy subjects who showed synchronous blood delivery to both sides of the face. Moreover, the amplitude of blood pulsations was symmetrically distributed over the face of healthy subjects, but asymmetrically in migraineurs and subjects with a family history of migraine. In the migraine patients we found a remarkable correlation between the side of unilateral headache and the direction of the blood perfusion wave. Our data suggest that migraine is associated with lateralization of blood perfusion and asynchronous blood pulsations in the facial area, which could be due to essential dysfunction of the autonomic vascular control in the face. These findings may further enhance our understanding of migraine pathophysiology and suggest new easily available biomarkers of this pathology.

  13. Asynchronicity of facial blood perfusion in migraine.

    Science.gov (United States)

    Zaproudina, Nina; Teplov, Victor; Nippolainen, Ervin; Lipponen, Jukka A; Kamshilin, Alexei A; Närhi, Matti; Karjalainen, Pasi A; Giniatullin, Rashid

    2013-01-01

    Asymmetrical changes in blood perfusion and asynchronous blood supply to head tissues likely contribute to migraine pathophysiology. Imaging was widely used in order to understand hemodynamic variations in migraine. However, mapping of blood pulsations in the face of migraineurs has not been performed so far. We used the Blood Pulsation Imaging (BPI) technique, which was recently developed in our group, to establish whether 2D-imaging of blood pulsations parameters can reveal new biomarkers of migraine. BPI characteristics were measured in migraineurs during the attack-free interval and compared to healthy subjects with and without a family history of migraine. We found a novel phenomenon of transverse waves of facial blood perfusion in migraineurs in contrast to healthy subjects who showed synchronous blood delivery to both sides of the face. Moreover, the amplitude of blood pulsations was symmetrically distributed over the face of healthy subjects, but asymmetrically in migraineurs and subjects with a family history of migraine. In the migraine patients we found a remarkable correlation between the side of unilateral headache and the direction of the blood perfusion wave. Our data suggest that migraine is associated with lateralization of blood perfusion and asynchronous blood pulsations in the facial area, which could be due to essential dysfunction of the autonomic vascular control in the face. These findings may further enhance our understanding of migraine pathophysiology and suggest new easily available biomarkers of this pathology.

  14. Controllability of asynchronous Boolean multiplex control networks

    Science.gov (United States)

    Luo, Chao; Wang, Xingyuan; Liu, Hong

    2014-09-01

    In this article, the controllability of asynchronous Boolean multiplex control networks (ABMCNs) is studied. First, the model of Boolean multiplex control networks under Harvey' asynchronous update is presented. By means of semi-tensor product approach, the logical dynamics is converted into linear representation, and a generalized formula of control-depending network transition matrices is achieved. Second, a necessary and sufficient condition is proposed to verify that only control-depending fixed points of ABMCNs can be controlled with probability one. Third, using two types of controls, the controllability of system is studied and formulae are given to show: (a) when an initial state is given, the reachable set at time s under a group of specified controls; (b) the reachable set at time s under arbitrary controls; (c) the specific probability values from a given initial state to destination states. Based on the above formulae, an algorithm to calculate overall reachable states from a specified initial state is presented. Moreover, we also discuss an approach to find the particular control sequence which steers the system between two states with maximum probability. Examples are shown to illustrate the feasibility of the proposed scheme.

  15. Controllability of asynchronous Boolean multiplex control networks.

    Science.gov (United States)

    Luo, Chao; Wang, Xingyuan; Liu, Hong

    2014-09-01

    In this article, the controllability of asynchronous Boolean multiplex control networks (ABMCNs) is studied. First, the model of Boolean multiplex control networks under Harvey' asynchronous update is presented. By means of semi-tensor product approach, the logical dynamics is converted into linear representation, and a generalized formula of control-depending network transition matrices is achieved. Second, a necessary and sufficient condition is proposed to verify that only control-depending fixed points of ABMCNs can be controlled with probability one. Third, using two types of controls, the controllability of system is studied and formulae are given to show: (a) when an initial state is given, the reachable set at time s under a group of specified controls; (b) the reachable set at time s under arbitrary controls; (c) the specific probability values from a given initial state to destination states. Based on the above formulae, an algorithm to calculate overall reachable states from a specified initial state is presented. Moreover, we also discuss an approach to find the particular control sequence which steers the system between two states with maximum probability. Examples are shown to illustrate the feasibility of the proposed scheme.

  16. Resynchronization of the Asynchronous Polar CD Ind

    Science.gov (United States)

    Myers, Gordon; Patterson, Joseph; de Miguel, Enrique; Hambsch, Franz-Josef; Monard, Berto; Bolt, Greg; McCormick, Jennie; Rea, Robert; Allen, William

    2017-04-01

    CD Ind is one of only four confirmed asynchronous polars (APs). APs are strongly magnetic cataclysmic variables of the AM Herculis subclass with the characteristic that their white dwarfs rotate a few percent out of synchronism with their binary orbit. Theory suggests that nova eruptions disrupt previously synchronized states. Following the eruption, the system is expected to rapidly resynchronize over a timescale of centuries. The other three asynchronous polars—V1432 Aql, BY Cam, and V1500 Cyg—have resynchronization time estimates ranging from 100 to more than 3500 years, with all but one being less than 1200 years. We report on the analysis of over 46,000 observations of CD Ind taken between 2007 and 2016, combined with previous observations from 1996, and estimate a CD Ind resynchronization time of 6400 ± 800 years. We also estimate an orbital period of 110.820(1) minutes and a current (2016.4) white dwarf spin period of 109.6564(1) minutes.

  17. A New Model for Interference Analysis in Asynchronous Multi-Carrier Transmission

    CERN Document Server

    Medjahdi, Yahia; Ruyet, Didier Le; Roviras, Daniel

    2010-01-01

    Interference at the radio receiver is a key source of degradation in quality of service of wireless communication systems. This paper presents a unified framework for OFDM/FBMC interference characterization and analysis in asynchronous environment. Multi-user interference is caused by the timing synchronization errors which lead to the destruction of the orthogonality between subcarriers. In this paper, we develop a theoretical analysis of the asynchronous interference considering the multi-path effects on the interference signal. We further propose an accurate model for interference that provides a useful computational tool in order to evaluate the performance of an OFDM/FBMC system in a frequency selective fading environment. Finally, simulation results confirmed the accuracy of the proposed model.

  18. An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience

    CERN Document Server

    Abraham, Ittai; Halpern, Joseph Y

    2008-01-01

    Consider an asynchronous system with private channels and $n$ processes, up to $t$ of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement protocol that simultaneously achieves three properties: 1. (optimal) resilience: it works as long as $n>3t$ 2. (almost-sure) termination: with probability one, all nonfaulty processes terminate 3. (polynomial) efficiency: the expected computation time, memory consumption, message size, and number of messages sent are all polynomial in $n$. Earlier protocols have achieved only two of these three properties. In particular, the protocol of Bracha is not polynomially efficient, the protocol of Feldman and Micali is not optimally resilient, and the protocol of Canetti and Rabin does not have almost-sure termination. Our protocol utilizes a new primitive called shunning (asynchronous) verifiable secret sharing (SVSS), which ensures, roughly speaking, that either a secret is successfully shared or a new faulty process is ignored from this...

  19. Realistic modelling of the effects of asynchronous motion at the base of bridge piers

    CERN Document Server

    Romanelli, F; Vaccari, F

    2002-01-01

    Frequently long-span bridges provide deep valley crossings, which require special consideration due to the possibility of local amplification of the ground motion as a consequence of topographical irregularities and local soil conditions. This does in fact cause locally enhanced seismic input with the possibility for the bridge piers to respond asynchronously. This introduces special design requirements so that possible out-of-phase ground displacements and the associated large relative displacements of adjacent piers can be accommodated without excessive damage. Assessment of the local variability of the ground motion due to local lateral heterogeneities and to attenuation properties is thus crucial toward the realistic definition of the asynchronous motion at the base of the bridge piers. We illustrate the work done in the framework of a large international cooperation to assess the importance of non-synchronous seismic excitation of long structures. To accomplish this task we compute complete synthetic acc...

  20. MMSE Multiuser Detector Alleviating Edge Effect in Asynchronous DS-CDMA Systems

    Institute of Scientific and Technical Information of China (English)

    WANGLing; JIAOLicheng; TAOHaihong; LIUFang

    2005-01-01

    Multiuser detection is a key technique in DS-CDMA systems. At the base station, the received signal is the compositive signal transmitted by active users in the system over asynchronous channels, the Multiple access interference (MAI) components of which is more serious than that in synchronous systems. In this paper, based on the compact matrix signal model of the asynchronous system, a MMSE (Minimum mean square error) Multiuser detector alleviating edge effect (MMSEAEE) with low complexity is proposed. The asymptotic efficiency, near-far effect resistance and computational complexity of the multiuser detector are analyzed qualitatively. Finally, the bit error rate is simulated via plentiful Monte Carlo numerical experiments. With performance analysis and numerical simulation, it is shown that MMSEAEE with low complexity offers significant performance improvement over some existing popular detectors in eliminating multiple access interference and near-far resistance.

  1. Multi-Party Energy Management for Clusters of Roof Leased PV Prosumers: A Game Theoretical Approach

    Directory of Open Access Journals (Sweden)

    Nian Liu

    2016-07-01

    Full Text Available The roof-leased business mode is an important development method for the distributed photovoltaic (PV systems. In this paper, the benefits of the PV energy are considered in a PV cluster (PVC consisting of a certain number of prosumers and a PVC operator (PVCO. In order to distribute the benefits, a multi-party energy management method for the PVC is proposed, including an internal pricing model and a demand response (DR model. First, the dynamic internal pricing model for the trading between PVCO and prosumers is formulated according to the economic principle of demand and supply relation. Moreover, in order to improve the local consumption of PV energy, the DR model is formulated as a non-cooperative game among the prosumers. Meanwhile, the existence and uniqueness of the Nash Equilibrium (NE are proved, and a distributed solving algorithm is introduced to approach the NE solution. Finally, the PVC including four prosumers is selected as the study object, the results have shown that the internal pricing model and DR model can improve the benefit of both prosumers and PVCO, as well as the local consumption of PV energy.

  2. Multi-Party Quantum Private Comparison Protocol Based on Entanglement Swapping of Bell Entangled States

    Science.gov (United States)

    Ye, Tian-Yu

    2016-09-01

    Recently, Liu et al. proposed a two-party quantum private comparison (QPC) protocol using entanglement swapping of Bell entangled state (Commun. Theor. Phys. 57 (2012) 583). Subsequently Liu et al. pointed out that in Liu et al.'s protocol, the TP can extract the two users' secret inputs without being detected by launching the Bell-basis measurement attack, and suggested the corresponding improvement to mend this loophole (Commun. Theor. Phys. 62 (2014) 210). In this paper, we first point out the information leakage problem toward TP existing in both of the above two protocols, and then suggest the corresponding improvement by using the one-way hash function to encrypt the two users' secret inputs. We further put forward the three-party QPC protocol also based on entanglement swapping of Bell entangled state, and then validate its output correctness and its security in detail. Finally, we generalize the three-party QPC protocol into the multi-party case, which can accomplish arbitrary pair's comparison of equality among K users within one execution. Supported by the National Natural Science Foundation of China under Grant No. 61402407

  3. Commande adaptive d'une machine asynchrone

    OpenAIRE

    I. Slama-Belkhodja; De Fornel, B.

    1996-01-01

    Cat article décrit une stratégie de commande adaptive indirecte à Placement de Pôles (PP), appliquée à la commande en vitesse d'une machine asynchrone alimentée par un ensemble hacheur-filtre-onduleur de tension. L'algorithme des Moindres Carrés Récursifs (MCR) est utilisé pour l'identification des modèles de comportement type entrées/sorties. Un intérêt particulier est porté à la mise en oeuvre de cet algorithme et à la discussion de ses résultats, tenant compte des erreurs de modélisation e...

  4. Asynchronous Parallel Evolutionary Algorithms for Constrained Optimizations

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    Recently Guo Tao proposed a stochastic search algorithm in his PhD thesis for solving function op-timization problems. He combined the subspace search method (a general multi-parent recombination strategy) with the population hill-climbing method. The former keeps a global search for overall situation,and the latter keeps the convergence of the algorithm. Guo's algorithm has many advantages ,such as the sim-plicity of its structure ,the higher accuracy of its results, the wide range of its applications ,and the robustness of its use. In this paper a preliminary theoretical analysis of the algorithm is given and some numerical experiments has been done by using Guo's algorithm for demonstrating the theoretical results. Three asynchronous paral-lel evolutionary algorithms with different granularities for MIMD machines are designed by parallelizing Guo's Algorithm.

  5. Evaluating the Efficiency of Asynchronous Systems with FASE

    CERN Document Server

    Buti, Federico; Corradini, Flavio; Di Berardini, Maria Rita; Vogler, Walter

    2011-01-01

    In this paper, we present FASE (Faster Asynchronous Systems Evaluation), a tool for evaluating the worst-case efficiency of asynchronous systems. The tool is based on some well-established results in the setting of a timed process algebra (PAFAS: a Process Algebra for Faster Asynchronous Systems). To show the applicability of FASE to concrete meaningful examples, we consider three implementations of a bounded buffer and use FASE to automatically evaluate their worst-case efficiency. We finally contrast our results with previous ones where the efficiency of the same implementations has already been considered.

  6. Towards Cloud-based Asynchronous Elasticity for Iterative HPC Applications

    Science.gov (United States)

    da Rosa Righi, Rodrigo; Facco Rodrigues, Vinicius; André da Costa, Cristiano; Kreutz, Diego; Heiss, Hans-Ulrich

    2015-10-01

    Elasticity is one of the key features of cloud computing. It allows applications to dynamically scale computing and storage resources, avoiding over- and under-provisioning. In high performance computing (HPC), initiatives are normally modeled to handle bag-of-tasks or key-value applications through a load balancer and a loosely-coupled set of virtual machine (VM) instances. In the joint-field of Message Passing Interface (MPI) and tightly-coupled HPC applications, we observe the need of rewriting source codes, previous knowledge of the application and/or stop-reconfigure-and-go approaches to address cloud elasticity. Besides, there are problems related to how profit this new feature in the HPC scope, since in MPI 2.0 applications the programmers need to handle communicators by themselves, and a sudden consolidation of a VM, together with a process, can compromise the entire execution. To address these issues, we propose a PaaS-based elasticity model, named AutoElastic. It acts as a middleware that allows iterative HPC applications to take advantage of dynamic resource provisioning of cloud infrastructures without any major modification. AutoElastic provides a new concept denoted here as asynchronous elasticity, i.e., it provides a framework to allow applications to either increase or decrease their computing resources without blocking the current execution. The feasibility of AutoElastic is demonstrated through a prototype that runs a CPU-bound numerical integration application on top of the OpenNebula middleware. The results showed the saving of about 3 min at each scaling out operations, emphasizing the contribution of the new concept on contexts where seconds are precious.

  7. An FDES-Based Shared Control Method for Asynchronous Brain-Actuated Robot.

    Science.gov (United States)

    Liu, Rong; Wang, Yong-Xuan; Zhang, Lin

    2016-06-01

    The asynchronous brain-computer interface (BCI) offers more natural human-machine interaction. However, it is still considered insufficient to control rapid and complex sequences of movements for a robot without any advanced control method. This paper proposes a new shared controller based on the supervisory theory of fuzzy discrete event system (FDES) for brain-actuated robot control. The developed supervisory theory allows the more reliable control mode to play a dominant role in the robot control which is beneficial to reduce misoperation and improve the robustness of the system. The experimental procedures consist of real-time direct manual control and BCI control tests from ten volunteers. Both tests have shown that the proposed method significantly improves the performance and robustness of the robotic control. In an online BCI experiment, eight of the participants successfully controlled the robot to circumnavigate obstacles and reached the target with a three mental states asynchronous BCI while the other two participants failed in all the BCI control sessions. Furthermore, the FDES-based shared control method also helps to reduce the workload. It can be stated that the asynchronous BCI, in combination with FDES-based shared controller, is feasible for the real-time and robust control of robotics.

  8. A Methodology for the Design and Verification of Globally Asynchronous/Locally Synchronous Architectures

    Science.gov (United States)

    Miller, Steven P.; Whalen, Mike W.; O'Brien, Dan; Heimdahl, Mats P.; Joshi, Anjali

    2005-01-01

    Recent advanced in model-checking have made it practical to formally verify the correctness of many complex synchronous systems (i.e., systems driven by a single clock). However, many computer systems are implemented by asynchronously composing several synchronous components, where each component has its own clock and these clocks are not synchronized. Formal verification of such Globally Asynchronous/Locally Synchronous (GA/LS) architectures is a much more difficult task. In this report, we describe a methodology for developing and reasoning about such systems. This approach allows a developer to start from an ideal system specification and refine it along two axes. Along one axis, the system can be refined one component at a time towards an implementation. Along the other axis, the behavior of the system can be relaxed to produce a more cost effective but still acceptable solution. We illustrate this process by applying it to the synchronization logic of a Dual Fight Guidance System, evolving the system from an ideal case in which the components do not fail and communicate synchronously to one in which the components can fail and communicate asynchronously. For each step, we show how the system requirements have to change if the system is to be implemented and prove that each implementation meets the revised system requirements through modelchecking.

  9. A Formal Framework for Multi-Party Business Protocols (Replaced by CentER DP 2009-05)

    NARCIS (Netherlands)

    Mancioppi, M.

    2008-01-01

    Service Oriented Architecture deployments comprise large numbers of long-running, highly dynamic complex end-to-end service interactions reflecting asynchronous message flows that typically transcend several organizations and span several geographical locations. Business protocols are formalisms to

  10. Stand-Alone and Hybrid Positioning Using Asynchronous Pseudolites

    Directory of Open Access Journals (Sweden)

    Ciro Gioia

    2014-12-01

    Full Text Available global navigation satellite system (GNSS receivers are usually unable to achieve satisfactory performance in difficult environments, such as open-pit mines, urban canyons and indoors. Pseudolites have the potential to extend GNSS usage and significantly improve receiver performance in such environments by providing additional navigation signals. This also applies to asynchronous pseudolite systems, where different pseudolites operate in an independent way. Asynchronous pseudolite systems require, however, dedicated strategies in order to properly integrate GNSS and pseudolite measurements. In this paper, several asynchronous pseudolite/GNSS integration strategies are considered: loosely- and tightly-coupled approaches are developed and combined with pseudolite proximity and receiver signal strength (RSS-based positioning. The performance of the approaches proposed has been tested in different scenarios, including static and kinematic conditions. The tests performed demonstrate that the methods developed are effective techniques for integrating heterogeneous measurements from different sources, such as asynchronous pseudolites and GNSS.

  11. Optimum Multiuser Detector for Multipath Slow Fading Asynchronous CDMA Channels

    Institute of Scientific and Technical Information of China (English)

    WangZhaocheng; YangZhixing; 等

    1995-01-01

    A structure of optimum multiuser detector for asynchronous CDMA in multipath slow fading channels is derived and the significant performance gain over the conventional RAKE receiv-er is shown by simulation.

  12. A proof system for asynchronously communicating deterministic processes

    NARCIS (Netherlands)

    de Boer, F.S.; van Hulst, M.

    1994-01-01

    We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO buffers, to cope with an indeterminate environment. We develop for the resulting parallel programming language, which subsumes deterministi

  13. TCDQ-TCT retraction and losses during asynchronous beam dump

    CERN Document Server

    Bracco, Chiara; Quaranta, Elena; CERN. Geneva. ATS Department

    2016-01-01

    The protection provided by the TCDQs in case of asynchronous beam dump depends strongly on their correct setup. They have to respect the strict hierarchy of the full collimation system and shield the tertiary collimators in the experimental regions. This MD aimed at performing asynchronous beam dump tests with different configurations, in order to assess the minimum allowed retraction between TCTs and TCDQs and, as a consequence, on the The protection provided by the TCDQs in case of asynchronous beam dump depends strongly on their correct setup. They have to respect the strict hierarchy of the full collimation system and shield the tertiary collimators in the experimental regions. This MD aimed at performing asynchronous beam dump tests with different configurations, in order to assess the minimum allowed retraction between TCTs and TCDQs and, as a consequence, on the β* reach.

  14. Normalized and asynchronous mirror alignment for Cherenkov telescopes

    Science.gov (United States)

    Ahnen, M. L.; Baack, D.; Balbo, M.; Bergmann, M.; Biland, A.; Blank, M.; Bretz, T.; Bruegge, K. A.; Buss, J.; Domke, M.; Dorner, D.; Einecke, S.; Hempfling, C.; Hildebrand, D.; Hughes, G.; Lustermann, W.; Mannheim, K.; Mueller, S. A.; Neise, D.; Neronov, A.; Noethe, M.; Overkemping, A.-K.; Paravac, A.; Pauss, F.; Rhode, W.; Shukla, A.; Temme, F.; Thaele, J.; Toscano, S.; Vogler, P.; Walter, R.; Wilbert, A.

    2016-09-01

    Imaging Atmospheric Cherenkov Telescopes (IACTs) need imaging optics with large apertures and high image intensities to map the faint Cherenkov light emitted from cosmic ray air showers onto their image sensors. Segmented reflectors fulfill these needs, and as they are composed from mass production mirror facets they are inexpensive and lightweight. However, as the overall image is a superposition of the individual facet images, alignment is a challenge. Here we present a computer vision based star tracking alignment method, which also works for limited or changing star light visibility. Our method normalizes the mirror facet reflection intensities to become independent of the reference star's intensity or the cloud coverage. Using two CCD cameras, our method records the mirror facet orientations asynchronously of the telescope drive system, and thus makes the method easy to integrate into existing telescopes. It can be combined with remote facet actuation, but does not require one to work. Furthermore, it can reconstruct all individual mirror facet point spread functions without moving any mirror. We present alignment results on the 4 m First Geiger-mode Avalanche Cherenkov Telescope (FACT).

  15. Novel Asynchronous Wrapper and Its Application to GALS Systems

    Institute of Scientific and Technical Information of China (English)

    Zhuang Shengxian; Peng Anjin; Lars Wanhammar

    2006-01-01

    An asynchronous wrapper with novel handshake circuits for data communication in globally asynchronous locally synchronous (GALS) systems is proposed. The handshake circuits include two communication ports and a local clock generator. Two approaches for the implementation of communication ports are presented, one with pure standard cells and the others with Müller-C elements. The detailed design methodology for GALS systems is given and the circuits are validated with VHDL and circuits simulation in standard CMOS technology.

  16. Experimental 3D Asynchronous Field Programmable Gate Array (FPGA)

    Science.gov (United States)

    2015-03-01

    EXPERIMENTAL 3D ASYNCHRONOUS FIELD PROGRAMMABLE GATE ARRAY ( FPGA ) CORNELL UNIVERSITY MARCH 2015 FINAL TECHNICAL REPORT APPROVED FOR PUBLIC...From - To) OCT 2011 – OCT 2014 4. TITLE AND SUBTITLE EXPERIMENTAL 3D ASYNCHRONOUS FIELD PROGRAMMABLE GATE ARRAY ( FPGA ) 5a. CONTRACT NUMBER...in collaboration with Albany’s College of Nanoscale Science and Engineering. 15. SUBJECT TERMS 3D Technology, vertical interconnects, AFPGA, FPGA

  17. MODIFIED MICROPIPLINE ARCHITECTURE FOR SYNTHESIZABLE ASYNCHRONOUS FIR FILTER DESIGN

    Directory of Open Access Journals (Sweden)

    Basel Halak

    2016-02-01

    Full Text Available The use of asynchronous design approaches to construct digital signal processing (DSP systems is a rapidly growing research area driven by a wide range of emerging energy constrained applications such as wireless sensor network, portable medical devices and brain implants. The asynchronous design techniques allow the construction of systems which are samples driven, which means they only dissipate dynamic energy when there processing data and idle otherwise. This inherent advantage of asynchronous design over conventional synchronous circuits allows them to be energy efficient. However the implementation flow of asynchronous systems is still difficult due to its lack of compatibility with industrystandard synchronous design tools and modelling languages. This paper devises a novel asynchronous design for a finite impulse response (FIR filter, an essential building block of DSP systems, which is synthesizable and suitable for implementation using conventional synchronous systems design flow and tools. The proposed design is based on a modified version of the micropipline architecture and it is constructed using four phase bundled data protocol. A hardware prototype of the proposed filter has been developed on an FPGA, and systematically verified. The results prove correct functionality of the novel design and a superior performance compared to a synchronous FIR implementation. The findings of this work will allow a wider adoption of asynchronous circuits by DSP designers to harness their energy and performance benefits.

  18. Commande adaptive d'une machine asynchrone

    Science.gov (United States)

    Slama-Belkhodja, I.; de Fornel, B.

    1996-06-01

    The paper deals with an indirect self-tuning speed control for an induction motor supplied by a chopper-filter-inverter system. Input/Output models are identified with the recursive least squares algorithm and the controller adaptation is based on a pole assignement strategy. Emphasis is put on the evaluation of the parameter identification in order to avoid instabilities because of disturbances or insufficient excitations. This is especially of importance when the adaptive control is carried out in closed loop systems and without additional test signals. Simulation results show the improvement of the dynamic responses and the robustness against load variations or parameters variations (rotor resistance, inertia). Cat article décrit une stratégie de commande adaptive indirecte à Placement de Pôles (PP), appliquée à la commande en vitesse d'une machine asynchrone alimentée par un ensemble hacheur-filtre-onduleur de tension. L'algorithme des Moindres Carrés Récursifs (MCR) est utilisé pour l'identification des modèles de comportement type entrées/sorties. Un intérêt particulier est porté à la mise en oeuvre de cet algorithme et à la discussion de ses résultats, tenant compte des erreurs de modélisation et de la nature peu riche en excitations des entrées du processus. Différents régimes transitoires ont été simulés pour apprécier l'apport de cette association (MCR-PP) : démarrages et inversion des sens de rotation, à vide et en charges, applications d'échelons de couple résistant, variations paramétriques. Les résultats permettent d'illustrer, tant au niveau des performances que de la robustesse, l'apport d'une telle commande adaptive pour des entraînements électriques avec une machine asynchrone.

  19. Rapid, generalized adaptation to asynchronous audiovisual speech.

    Science.gov (United States)

    Van der Burg, Erik; Goodbourn, Patrick T

    2015-04-01

    The brain is adaptive. The speed of propagation through air, and of low-level sensory processing, differs markedly between auditory and visual stimuli; yet the brain can adapt to compensate for the resulting cross-modal delays. Studies investigating temporal recalibration to audiovisual speech have used prolonged adaptation procedures, suggesting that adaptation is sluggish. Here, we show that adaptation to asynchronous audiovisual speech occurs rapidly. Participants viewed a brief clip of an actor pronouncing a single syllable. The voice was either advanced or delayed relative to the corresponding lip movements, and participants were asked to make a synchrony judgement. Although we did not use an explicit adaptation procedure, we demonstrate rapid recalibration based on a single audiovisual event. We find that the point of subjective simultaneity on each trial is highly contingent upon the modality order of the preceding trial. We find compelling evidence that rapid recalibration generalizes across different stimuli, and different actors. Finally, we demonstrate that rapid recalibration occurs even when auditory and visual events clearly belong to different actors. These results suggest that rapid temporal recalibration to audiovisual speech is primarily mediated by basic temporal factors, rather than higher-order factors such as perceived simultaneity and source identity.

  20. Managing Asynchronous Data in ATLAS's Concurrent Framework

    CERN Document Server

    Leggett, Charles; The ATLAS collaboration

    2016-01-01

    In order to be able to make effective use of emerging hardware, where the amount of memory available to any CPU is rapidly decreasing as the core count continues to rise, ATLAS has begun a migration to a concurrent, multi-threaded software framework, known as AthenaMT. Significant progress has been made in implementing AthenaMT - we can currently run realistic Geant4 simulations on massively concurrent machines. the migration of realistic prototypes of reconstruction workflows is more difficult, given the large amounts of legacy code and the complexity and challenges of reconstruction software. These types of workflows, however, are the types that will most benefit from the memory reduction features of a multi-threaded framework. One of the challenges that we will report on in this paper is the re-design and implementation of several key asynchronous technologies whose behaviour is radically different in a concurrent environment than in a serial one, namely the management of Conditions data and the Detector D...

  1. Proximity-Based Asynchronous Messaging Platform for Location-Based Internet of Things Service

    Directory of Open Access Journals (Sweden)

    Hyeong gon Jo

    2016-07-01

    Full Text Available The Internet of Things (IoT opens up tremendous opportunities to provide location-based applications. However, despite the services around a user being physically adjacent, common IoT platforms use a centralized structure, like a cloud-computing architecture, which transfers large amounts of data to a central server. This raises problems, such as traffic concentration, long service latency, and high communication cost. In this paper, we propose a physical distance-based asynchronous messaging platform that specializes in processing personalized data and location-based messages. The proposed system disperses traffic using a location-based message-delivery protocol, and has high stability.

  2. Specification and verification of gate-level VHDL models of synchronous and asynchronous circuits

    Science.gov (United States)

    Russinoff, David M.

    1995-01-01

    We present a mathematical definition of hardware description language (HDL) that admits a semantics-preserving translation to a subset of VHDL. Our HDL includes the basic VHDL propagation delay mechanisms and gate-level circuit descriptions. We also develop formal procedures for deriving and verifying concise behavioral specifications of combinational and sequential devices. The HDL and the specification procedures have been formally encoded in the computational logic of Boyer and Moore, which provides a LISP implementation as well as a facility for mechanical proof-checking. As an application, we design, specify, and verify a circuit that achieves asynchronous communication by means of the biphase mark protocol.

  3. Internal end-effect problem in a linear asynchronous MHD machine with arbitrary current load

    Energy Technology Data Exchange (ETDEWEB)

    Vilnitis, A.Ya.

    1977-01-01

    The internal end-effect problem in a bilateral linear asynchronous engine is solved by variation of constants for a surface current load of any type, including discrete conductors. Mathematically correct formulae for this case are given for computing the mechanical force on wound coils and the active power. Known methods of end-effect compensation are examined. The requirements for the surface load of inductors were found for the case where the requirements may be limited to an internal problem and scattering along the magnetic circuit ends.

  4. iHadoop: Asynchronous Iterations Support for MapReduce

    KAUST Repository

    Elnikety, Eslam

    2011-08-01

    MapReduce is a distributed programming framework designed to ease the development of scalable data-intensive applications for large clusters of commodity machines. Most machine learning and data mining applications involve iterative computations over large datasets, such as the Web hyperlink structures and social network graphs. Yet, the MapReduce model does not efficiently support this important class of applications. The architecture of MapReduce, most critically its dataflow techniques and task scheduling, is completely unaware of the nature of iterative applications; tasks are scheduled according to a policy that optimizes the execution for a single iteration which wastes bandwidth, I/O, and CPU cycles when compared with an optimal execution for a consecutive set of iterations. This work presents iHadoop, a modified MapReduce model, and an associated implementation, optimized for iterative computations. The iHadoop model schedules iterations asynchronously. It connects the output of one iteration to the next, allowing both to process their data concurrently. iHadoop\\'s task scheduler exploits inter- iteration data locality by scheduling tasks that exhibit a producer/consumer relation on the same physical machine allowing a fast local data transfer. For those iterative applications that require satisfying certain criteria before termination, iHadoop runs the check concurrently during the execution of the subsequent iteration to further reduce the application\\'s latency. This thesis also describes our implementation of the iHadoop model, and evaluates its performance against Hadoop, the widely used open source implementation of MapReduce. Experiments using different data analysis applications over real-world and synthetic datasets show that iHadoop performs better than Hadoop for iterative algorithms, reducing execution time of iterative applications by 25% on average. Furthermore, integrating iHadoop with HaLoop, a variant Hadoop implementation that caches

  5. ASCERTAINMENT OF THE EQUIVALENT CIRCUIT PARAMETERS OF THE ASYNCHRONOUS MACHINE

    Directory of Open Access Journals (Sweden)

    V. S. Safaryan

    2015-01-01

    Full Text Available The article considers experimental and analytical determination of the asynchronous machine equivalent-circuit parameters with application of the reference data. Transient processes investigation of the asynchronous machines necessitates the equivalent circuit parameters (resistance impedance, inductances and coefficient of the stator-rotor contours mutual inductance that help form the transitory-process mathematical simulation model. The reference books do not provide those parameters; they instead give the rated ones (active power, voltage, slide, coefficient of performance and capacity coefficient as well as the ratio of starting and nominal currents and torques. The noted studies on the asynchronous machine equivalent-circuits parametrization fail to solve the problems ad finem or solve them with admissions. The paper presents experimental and analytical determinations of the asynchronous machine equivalent-circuit parameters: the experimental one based on the results of two measurements and the analytical one where the problem boils down to solving a system of nonlineal algebraic equations. The authors investigate the equivalent asynchronous machine input-resistance properties and adduce the dependence curvatures of the input-resistances on the slide. They present a symbolic model for analytical parameterization of the asynchronous machine equivalent-circuit that represents a system of nonlineal equations and requires one of the rotor-parameters arbitrary assignment. The article demonstrates that for the asynchronous machine equivalent-circuit experimental parameterization the measures are to be conducted of the stator-circuit voltage, current and active power with two different slides and arbitrary assignment of one of the rotor parameters. The paper substantiates the fact that additional measurement does not discard the rotor-parameter choice arbitrariness. The authors establish that in motoring mode there is a critical slide by which the

  6. Fast Simulation of Mechanical Heterogeneity in the Electrically Asynchronous Heart Using the MultiPatch Module.

    Directory of Open Access Journals (Sweden)

    John Walmsley

    2015-07-01

    Full Text Available Cardiac electrical asynchrony occurs as a result of cardiac pacing or conduction disorders such as left bundle-branch block (LBBB. Electrically asynchronous activation causes myocardial contraction heterogeneity that can be detrimental for cardiac function. Computational models provide a tool for understanding pathological consequences of dyssynchronous contraction. Simulations of mechanical dyssynchrony within the heart are typically performed using the finite element method, whose computational intensity may present an obstacle to clinical deployment of patient-specific models. We present an alternative based on the CircAdapt lumped-parameter model of the heart and circulatory system, called the MultiPatch module. Cardiac walls are subdivided into an arbitrary number of patches of homogeneous tissue. Tissue properties and activation time can differ between patches. All patches within a wall share a common wall tension and curvature. Consequently, spatial location within the wall is not required to calculate deformation in a patch. We test the hypothesis that activation time is more important than tissue location for determining mechanical deformation in asynchronous hearts. We perform simulations representing an experimental study of myocardial deformation induced by ventricular pacing, and a patient with LBBB and heart failure using endocardial recordings of electrical activation, wall volumes, and end-diastolic volumes. Direct comparison between simulated and experimental strain patterns shows both qualitative and quantitative agreement between model fibre strain and experimental circumferential strain in terms of shortening and rebound stretch during ejection. Local myofibre strain in the patient simulation shows qualitative agreement with circumferential strain patterns observed in the patient using tagged MRI. We conclude that the MultiPatch module produces realistic regional deformation patterns in the asynchronous heart and that

  7. DYNAMIC REGIMES OF ASYNCHRONOUS MOTORS WITH CONCATENATED CAPACITORS

    Directory of Open Access Journals (Sweden)

    V. S. Malyar

    2015-04-01

    Full Text Available Purpose. Development of mathematical model for calculation of starting modes of asynchronous motor connected in series with capacitors. Method. Mathematical modeling of dynamic modes of asynchronous motors with lateral capacitor compensation of reactive power. Results. The calculation algorithm and results of mathematic modeling of processes during starting modes of asynchronous motor feeding from the network through capacitors connected in series are presented. It is shown that for some values of capacitance the self-excitation processes and subharmonic oscillations can appear. Scientific novelty. Mathematic modeling and research of processes in asynchronous motor under its feeding through capacitors is carried out for the first time. The calculation algorithm is based on the mathematical model of asynchronous motor with high level of adequacy, which takes into account the magnetic core saturation and the current displacement in limbs of the rotor. Practical implication. Developed mathematical model makes it possible to investigate the possibility of self-excitation modes appearing in condition of their feeding from line with lateral compensation of reactance in order to avoid the negative effects typical for them.

  8. Asynchronous vascular consultation via electronic methods: A feasibility pilot.

    Science.gov (United States)

    Chittle, Melissa D; Rao, Sandhya K; Jaff, Michael R; Patel, Virendra I; Gallen, Kathleen M; Avadhani, Radhika; Ferris, Timothy G; Wasfy, Jason H

    2015-12-01

    Management of chronic disease often requires multidisciplinary clinical efforts and specialist care. With the emergence of Accountable Care Organizations (ACOs), health care systems are incentivized to evaluate methods of information exchange between generalists and specialists in order to provide value while preserving quality. Our objective was to evaluate patient and referring provider satisfaction and outcomes of asynchronous electronic consultations in vascular care in a large tertiary academic medical center. Referring providers were offered a vascular 'e-consult' option through an electronic referral management system. We conducted chart review to understand the downstream effects and surveyed patients and referring providers to assess satisfaction. From 24 March 2014 to 1 March 2015, 54 e-consults were completed. Additional testing and recommendations were made in 49/54 (90.7%) e-consults, including lower-extremity venous duplex ultrasonography with reflux testing, duplex ultrasonography of the carotid artery, computed tomography, magnetic resonance imaging, non-invasive physiology arterial studies, laboratory tests, medications, compression stockings, and sequential lymphedema compression therapy. Referring providers were compliant with recommendations in 40/49 (81.6%) of e-consults. A total of 17/54 (31.5%) patients were surveyed with a median patient satisfaction score of 13.7/15 (91.3%) (SD ± 6.4). The program was associated with high referring provider satisfaction, with 87.0% finding the e-consult very helpful and 80.0% stating it averted the need for a traditional visit. Our experience suggests that e-consults are an effective way to provide vascular care in some patients and are associated with high patient and provider satisfaction. E-consults may therefore be an efficient method of care delivery for vascular patients within an ACO.

  9. Current Trends in High-Level Synthesis of Asynchronous Circuits

    DEFF Research Database (Denmark)

    Sparsø, Jens

    2009-01-01

    .g. the Haste/TiDE tool from Handshake Solutions or the Balsa tool from the University of Manchester. The aims are to add highlevel synthesis capabilities to these tools and to extend the tools such that a wider range of (higher speed) micro-architectures can be generated. Another branch of research takes...... a conventional synchronous circuit as the starting point, and then adds some form of handshake-based flow-control. One approach keeps the global clock and implements discrete-time asynchronous operation. Another approach substitutes the clocked registers by asynchronous handshake-registers, thus creating truly...... continuous time asynchronous circuits that operate without a clock. The perspective here is that the substitution/conversion is done as the final step in an otherwise conventional synchronous design flow....

  10. On the theoretical gap between synchronous and asynchronous MPC protocols

    DEFF Research Database (Denmark)

    Beerliová-Trubíniová, Zuzana; Hirt, Martin; Nielsen, Jesper Buus

    2010-01-01

    that in the cryptographic setting (with setup), the sole reason for it is the distribution of inputs: given an oracle for input distribution, cryptographically-secure asynchronous MPC is possible with the very same condition as synchronous MPC, namely t ..., we show that such an input-distribution oracle can be reduced to an oracle that allows each party to synchronously broadcast one single message. This means that when one single round of synchronous broadcast is available, then asynchronous MPC is possible at the same condition as synchronous MPC...

  11. Design issues in the semantics and scheduling of asynchronous tasks.

    Energy Technology Data Exchange (ETDEWEB)

    Olivier, Stephen L.

    2013-07-01

    The asynchronous task model serves as a useful vehicle for shared memory parallel programming, particularly on multicore and manycore processors. As adoption of model among programmers has increased, support has emerged for the integration of task parallel language constructs into mainstream programming languages, e.g., C and C++. This paper examines some of the design decisions in Cilk and OpenMP concerning semantics and scheduling of asynchronous tasks with the aim of informing the efforts of committees considering language integration, as well as developers of new task parallel languages and libraries.

  12. Asynchronous Broadcast on the Intel SCC using Interrupts

    OpenAIRE

    Petrović, Darko; Shahmirzadi, Omid; Ropars, Thomas; Schiper, André

    2012-01-01

    International audience; This paper focuses on the design of an asynchronous broadcast primitive on the Intel SCC. Our solution is based on OC-Bcast, a state-of-the-art k-ary tree synchronous broadcast algorithm that leverages the parallelism provided by on-chip Remote Memory Accesses to Message Passing Buffers. In the paper, we study the use of parallel inter-core interrupts as a means to implement an efficient asynchronous group communication primitive, and present the userspace library we d...

  13. A Loosely Synchronizing Asynchronous Router for TDM-Scheduled NOCs

    DEFF Research Database (Denmark)

    Kotleas, Ioannis; Humphreys, Dean; Sørensen, Rasmus Bo

    2014-01-01

    This paper presents an asynchronous router design for use in time-division-multiplexed (TDM) networks-on-chip. Unlike existing synchronous, mesochronous and asynchronous router designs with similar functionality, the router is able to silently skip over cycles/TDM-slots where no traffic...... is scheduled and hence avoid all switching activity in the idle links and router ports. In this way switching activity is reduced to the minimum possible amount. The fact that this relaxed synchronization is sufficient to implement TDM scheduling represents a contribution at the conceptual level. The idea can...

  14. An asynchronous and parallel time-marching method: Application to three-dimensional MHD simulation of solar wind

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    An asynchronous and parallel time-marching method for three-dimensional (3D) time-dependent magnetohydrodynamic (MHD) simulation is used for large-scale solar wind simulation. It uses different local time steps in the corona and the heliosphere according to the local Courant-Friedrichs-Levy (CFL) conditions. The solar wind background with observed solar photospheric magnetic field as input is first presented. The simulation time for the background solar wind by using the asynchronous method is <1/6 of that by using the normal synchronous time-marching method with the same computation precision. Then, we choose the coronal mass ejection (CME) event of 13 November, 2003 as a test case. The time-dependent variations of the pressure and the velocity configured from a CME model at the inner boundary are applied to generate transient structures in order to study the dynamical interaction of a CME with the background solar wind flow between 1 and 230 Rs. This time-marching method is very effective in terms of computation time for large-scale 3D time-dependent numerical MHD problem. In this validation study, we find that this 3D MHD model, with the asynchronous and parallel time-marching method, provides a relatively satisfactory comparison with the ACE spacecraft obser- vations at L1 point.

  15. Breaking The Millisecond Barrier On SpiNNaker: Implementing Asynchronous Event-Based Plastic Models With Microsecond Resolution

    Directory of Open Access Journals (Sweden)

    Xavier eLagorce

    2015-06-01

    Full Text Available Spike-based neuromorphic sensors such as retinas and cochleas, change the way in which the world is sampled. Instead of producing data sampled at a constant rate, these sensors output spikes that are asynchronous and event driven. The event-based nature of neuromorphic sensors implies a complete paradigm shift in current perception algorithms towards those that emphasize the importance of precise timing. The spikes produced by these sensors usually have a time resolution in the order of microseconds. This high temporal resolution is a crucial factor in learning tasks. It is also widely used in the field of biological neural networks. Sound localization for instance relies on detecting time lags between the two ears which, in the barn owl, reaches a temporal resolution of 5 microseconds. Current available neuromorphic computation platforms such as SpiNNaker often limit their users to a time resolution in the order of milliseconds that is not compatible with the asynchronous outputs of neuromorphic sensors. To overcome these limitations and allow for the exploration of new types of neuromorphic computing architectures, we introduce a novel software framework on the SpiNNaker platform. This framework allows for simulations of spiking networks and plasticity mechanisms using a completely asynchronous and event-based scheme running with a microsecond time resolution. Results on two example networks using this new implementation are presented.

  16. Asynchronous communication in spectral-element and discontinuous Galerkin methods for atmospheric dynamics - a case study using the High-Order Methods Modeling Environment (HOMME-homme_dg_branch)

    Science.gov (United States)

    Jamroz, Benjamin F.; Klöfkorn, Robert

    2016-08-01

    The scalability of computational applications on current and next-generation supercomputers is increasingly limited by the cost of inter-process communication. We implement non-blocking asynchronous communication in the High-Order Methods Modeling Environment for the time integration of the hydrostatic fluid equations using both the spectral-element and discontinuous Galerkin methods. This allows the overlap of computation with communication, effectively hiding some of the costs of communication. A novel detail about our approach is that it provides some data movement to be performed during the asynchronous communication even in the absence of other computations. This method produces significant performance and scalability gains in large-scale simulations.

  17. Principles for Effective Asynchronous Online Instruction in Religious Studies

    Science.gov (United States)

    McGuire, Beverley

    2017-01-01

    Asynchronous online instruction has become increasingly popular in the field of religious studies. However, despite voluminous research on online learning in general and numerous articles on online theological instruction, there has been little discussion of how to effectively design and deliver online undergraduate courses in religious studies.…

  18. Abstracting Asynchronous Multi-Valued Networks: An Initial Investigation

    CERN Document Server

    Steggles, L Jason

    2011-01-01

    Multi-valued networks provide a simple yet expressive qualitative state based modelling approach for biological systems. In this paper we develop an abstraction theory for asynchronous multi-valued network models that allows the state space of a model to be reduced while preserving key properties of the model. The abstraction theory therefore provides a mechanism for coping with the state space explosion problem and supports the analysis and comparison of multi-valued networks. We take as our starting point the abstraction theory for synchronous multi-valued networks which is based on the finite set of traces that represent the behaviour of such a model. The problem with extending this approach to the asynchronous case is that we can now have an infinite set of traces associated with a model making a simple trace inclusion test infeasible. To address this we develop a decision procedure for checking asynchronous abstractions based on using the finite state graph of an asynchronous multi-valued network to reas...

  19. Chaos begets order: asynchronous cell contractions drive epithelial morphogenesis.

    Science.gov (United States)

    Paluch, Ewa; Heisenberg, Carl-Philipp

    2009-01-01

    Apical cell contraction triggers tissue folding and invagination in epithelia. During Drosophila gastrulation, ventral furrow formation was thought to be driven by smooth, purse-string-like constriction of an acto-myosin belt underlying adherens junctions. Now Martin et al. report in Nature that ventral furrow formation is triggered by asynchronous pulsed contractions of the apical acto-myosin cortex in individual cells.

  20. Online Graduate Education: Developing Scholars through Asynchronous Discussion

    Science.gov (United States)

    Bowden, Randall

    2012-01-01

    Considerable effort has been placed on understanding and enhancing online interaction to increase student learning, examine teaching strategies, and build learning communities. This research explored another aspect of interaction: the emergence of scholarship by graduate students through asynchronous discussion. Qualitative analysis of archived…

  1. Cyber Asynchronous versus Blended Cyber Approach in Distance English Learning

    Science.gov (United States)

    Ge, Zi-Gang

    2012-01-01

    This study aims to compare the single cyber asynchronous learning approach with the blended cyber learning approach in distance English education. Two classes of 70 students participated in this study, which lasted one semester of about four months, with one class using the blended approach for their English study and the other only using the…

  2. Asynchronous rotation scan for synthetic aperture interferometric radiometer

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    Synthetic aperture interferometric technique has wide applications in optics,radio astronomy and mi-crowave remote sensing areas.With the increasing demands of high resolution imaging observation,a new time-sharing sampling scheme of asynchronous rotation scan is proposed to meet the technical challenge of achieving a large equivalent aperture and overcome the operating barriers of space borne application.This configuration is basically composed by two asynchronously and concentrically ro-tating antenna groups,whose revolving radii and speeds are different.The synthetic aperture system with asynchronous rotation scanning scheme can effectively solve the trade-off problem of system complexity,and greatly simplify the system hardware at the cost of sacrificing a certain time resolution.The basic rules and design methods of asynchronous rotation scan are investigated The Gridding method is introduced to inverse the spiral sampling data for image reconstruction.The potential ap-plications of geostationary orbit(GEO)earth observation and solar polar orbit(SPO)plasma cloud observation are explored with numerical simulations to validate the significance and feasibility of this new imaging configuration.

  3. Asynchronous Assessment in a Large Lecture Marketing Course

    Science.gov (United States)

    Downey, W. Scott; Schetzsle, Stacey

    2012-01-01

    Asynchronous assessment, which includes quizzes or exams online or outside class, offers marketing educators an opportunity to make more efficient use of class time and to enhance students' learning experiences by giving them more flexibility and choice in their assessment environment. In this paper, we examine the performance difference between…

  4. Reconceptualising Moderation in Asynchronous Online Discussions Using Grounded Theory

    Science.gov (United States)

    Vlachopoulos, Panos; Cowan, John

    2010-01-01

    This article reports a grounded theory study of the moderation of asynchronous online discussions, to explore the processes by which tutors in higher education decide when and how to moderate. It aims to construct a theory of e-moderation based on some key factors which appear to influence e-moderation. It discusses previous research on the…

  5. Asynchronous rotation scan for synthetic aperture interferometric radiometer

    Institute of Scientific and Technical Information of China (English)

    WU Ji; ZHANG Cheng; LIU Hao; SUN WeiYing

    2009-01-01

    Synthetic aperture interferometric technique has wide applications in optics, radio astronomy and mi-crowave remote sensing areas. With the increasing demands of high resolution imaging observation, a new time-sharing sampling scheme of asynchronous rotation scan is proposed to meet the technical challenge of achieving a large equivalent aperture and overcome the operating barriers of space borne application. This configuration is basically composed by two asynchronously and concentrically ro-tating antenna groups, whose revolving radii and speeds are different. The synthetic aperture system with asynchronous rotation scanning scheme can effectively solve the trade-off problem of system complexity, and greatly simplify the system hardware at the cost of sacrificing a certain time resolution. The basic rules and design methods of asynchronous rotation scan are investigated The Gridding method is introduced to inverse the spiral sampling data for image reconstruction. The potential ap-plications of geostationary orbit (GEO) earth observation and solar polar orbit (SPO) plasma cloud observation are explored with numerical simulations to validate the significance and feasibility of this new imaging configuration.

  6. RELAXED ASYNCHRONOUS ITERATIONS FOR THE LINEAR COMPLEMENTARITY PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Zhong-zhi Bai; Yu-guang Huang

    2002-01-01

    We present a class of relaxed asynchronous parallel multisplitting iterative methods forsolving the linear complementarity problem on multiprocessor systems, and set up theirconvergence theories when the system matrix of the linear complementarity problem is anH-matrix with positive diagonal elements.

  7. Teachers of the Gifted: Experiences with Asynchronous Development

    Science.gov (United States)

    Rosenberg, Jennifer

    2012-01-01

    Gifted students' development is asynchronous in the social, emotional, physical and cognitive domains. Because of this, unique interventions must be used by teachers of the gifted in order to best serve their developmental and educational needs. This qualitative study used transcendental phenomenology to examine and describe the experiences…

  8. EEG-based asynchronous BCI control of a car in 3D virtual reality environments

    Institute of Scientific and Technical Information of China (English)

    ZHAO QiBin; ZHANG LiQing; CICHOCKI Andrzej

    2009-01-01

    Brain computer interface (BCl) aims at creating new communication channels without depending on brain's normal output channels of peripheral nerves and muscles.However,natural and sophisticated interactions manner between brain and computer still remain challenging.In this paper,we investigate how the duration of event-related desynchronization/synchronization (ERD/ERS) caused by motor im-agery (MI) can be modulated and used as an additional control parameter beyond simple binary deci-sions.Furthermore,using the non-time-locked properties of sustained (de)synchronization,we have developed an asynchronous BCl system for driving a car in 3D virtual reality environment (VRE) based on cumulative incremental control strategy.The extensive real time experiments confirmed that our new approach is able to drive smoothly a virtual car within challenging VRE only by the MI tasks with-out involving any muscular activities.

  9. An Asynchronous Electric Drive with the Indirect Control of the Output Variables

    Directory of Open Access Journals (Sweden)

    Glazachev Alexander V.

    2017-01-01

    Full Text Available The article gives a mathematical description of an asynchronous motor with a device of indirect control of the electromagnetic torque and the angular velocity of the asynchronous motor in the electric drive that allows to prove on its basis the method of monitoring the output variables of the asynchronous electric motor. The simulation model of an asynchronous motor with a device of indirect control of the output variables of the asynchronous motor and the main results of the study have been given.

  10. Data-Aware Retrodiction for Asynchronous Harmonic Measurement in a Cyber-Physical Energy System.

    Science.gov (United States)

    Liu, Youda; Wang, Xue; Liu, Yanchi; Cui, Sujin

    2016-08-18

    Cyber-physical energy systems provide a networked solution for safety, reliability and efficiency problems in smart grids. On the demand side, the secure and trustworthy energy supply requires real-time supervising and online power quality assessing. Harmonics measurement is necessary in power quality evaluation. However, under the large-scale distributed metering architecture, harmonic measurement faces the out-of-sequence measurement (OOSM) problem, which is the result of latencies in sensing or the communication process and brings deviations in data fusion. This paper depicts a distributed measurement network for large-scale asynchronous harmonic analysis and exploits a nonlinear autoregressive model with exogenous inputs (NARX) network to reorder the out-of-sequence measuring data. The NARX network gets the characteristics of the electrical harmonics from practical data rather than the kinematic equations. Thus, the data-aware network approximates the behavior of the practical electrical parameter with real-time data and improves the retrodiction accuracy. Theoretical analysis demonstrates that the data-aware method maintains a reasonable consumption of computing resources. Experiments on a practical testbed of a cyber-physical system are implemented, and harmonic measurement and analysis accuracy are adopted to evaluate the measuring mechanism under a distributed metering network. Results demonstrate an improvement of the harmonics analysis precision and validate the asynchronous measuring method in cyber-physical energy systems.

  11. Data-Aware Retrodiction for Asynchronous Harmonic Measurement in a Cyber-Physical Energy System

    Directory of Open Access Journals (Sweden)

    Youda Liu

    2016-08-01

    Full Text Available Cyber-physical energy systems provide a networked solution for safety, reliability and efficiency problems in smart grids. On the demand side, the secure and trustworthy energy supply requires real-time supervising and online power quality assessing. Harmonics measurement is necessary in power quality evaluation. However, under the large-scale distributed metering architecture, harmonic measurement faces the out-of-sequence measurement (OOSM problem, which is the result of latencies in sensing or the communication process and brings deviations in data fusion. This paper depicts a distributed measurement network for large-scale asynchronous harmonic analysis and exploits a nonlinear autoregressive model with exogenous inputs (NARX network to reorder the out-of-sequence measuring data. The NARX network gets the characteristics of the electrical harmonics from practical data rather than the kinematic equations. Thus, the data-aware network approximates the behavior of the practical electrical parameter with real-time data and improves the retrodiction accuracy. Theoretical analysis demonstrates that the data-aware method maintains a reasonable consumption of computing resources. Experiments on a practical testbed of a cyber-physical system are implemented, and harmonic measurement and analysis accuracy are adopted to evaluate the measuring mechanism under a distributed metering network. Results demonstrate an improvement of the harmonics analysis precision and validate the asynchronous measuring method in cyber-physical energy systems.

  12. THE RESEARCH OF GRADATION FUSION ALGORITHM BASED ON MULTISENSOR ASYNCHRONOUS SAMPLING SYSTEM

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    This letter explores the distributed multisensor dynamic system, which has uniform sampling velocity and asynchronous sampling data for different sensors, and puts forward a new gradation fusion algorithm of multisensor dynamic system. As the total forecasted increment value between the two adjacent moments is the forecasted estimate value of the corresponding state increment in the fusion center, the new algorithm models the state and the forecasted estimate value of every moment. Kalman filter and all measurements arriving sequentially in the fusion period are employed to update the evaluation of target state step by step, on the condition that the system has obtained the target state evaluation that is based on the overall information in the previous fusion period. Accordingly, in the present period, the fusion evaluation of the target state at each sampling point on the basis of the overall information can be obtained. This letter elaborates the form of this new algorithm. Computer simulation demonstrates that this new algorithm owns greater precision in estimating target state than the present asynchronous fusion algorithm calibrated in time does.

  13. An asynchronous solver for systems of ODEs linked by a directed tree structure

    Science.gov (United States)

    Small, Scott J.; Jay, Laurent O.; Mantilla, Ricardo; Curtu, Rodica; Cunha, Luciana K.; Fonley, Morgan; Krajewski, Witold F.

    2013-03-01

    This paper documents our development and evaluation of a numerical solver for systems of sparsely linked ordinary differential equations in which the connectivity between equations is determined by a directed tree. These types of systems arise in distributed hydrological models. The numerical solver is based on dense output Runge-Kutta methods that allow for asynchronous integration. A partition of the system is used to distribute the workload among different processes, enabling a parallel implementation that capitalizes on a distributed memory system. Communication between processes is performed asynchronously. We illustrate the solver capabilities by integrating flow transport equations for a ˜17,000 km2 river basin subdivided into 305,000 sub-watersheds that are interconnected by the river network. Numerical experiments for a few models are performed and the runtimes and scalability on our parallel computer are presented. Efficient numerical integrators such as the one demonstrated here bring closer to reality the goal of implementing fully distributed real-time flood forecasting systems supported by physics based hydrological models and high-quality/high-resolution rainfall products.

  14. Asynchronous detection of kinesthetic attention during mobilization of lower limbs using EEG measurements

    Science.gov (United States)

    Melinscak, Filip; Montesano, Luis; Minguez, Javier

    2016-02-01

    Objective. Attention is known to modulate the plasticity of the motor cortex, and plasticity is crucial for recovery in motor rehabilitation. This study addresses the possibility of using an EEG-based brain-computer interface (BCI) to detect kinesthetic attention to movement. Approach. A novel experiment emulating physical rehabilitation was designed to study kinesthetic attention. The protocol involved continuous mobilization of lower limbs during which participants reported levels of attention to movement—from focused kinesthetic attention to mind wandering. For this protocol an asynchronous BCI detector of kinesthetic attention and deliberate mind wandering was designed. Main results. EEG analysis showed significant differences in theta, alpha, and beta bands, related to the attentional state. These changes were further pinpointed to bands relative to the frequency of the individual alpha peak. The accuracy of the designed BCI ranged between 60.8% and 68.4% (significantly above chance level), depending on the used analysis window length, i.e. acceptable detection delay. Significance. This study shows it is possible to use self-reporting to study attention-related changes in EEG during continuous mobilization. Such a protocol is used to develop an asynchronous BCI detector of kinesthetic attention, with potential applications to motor rehabilitation.

  15. Data-Aware Retrodiction for Asynchronous Harmonic Measurement in a Cyber-Physical Energy System

    Science.gov (United States)

    Liu, Youda; Wang, Xue; Liu, Yanchi; Cui, Sujin

    2016-01-01

    Cyber-physical energy systems provide a networked solution for safety, reliability and efficiency problems in smart grids. On the demand side, the secure and trustworthy energy supply requires real-time supervising and online power quality assessing. Harmonics measurement is necessary in power quality evaluation. However, under the large-scale distributed metering architecture, harmonic measurement faces the out-of-sequence measurement (OOSM) problem, which is the result of latencies in sensing or the communication process and brings deviations in data fusion. This paper depicts a distributed measurement network for large-scale asynchronous harmonic analysis and exploits a nonlinear autoregressive model with exogenous inputs (NARX) network to reorder the out-of-sequence measuring data. The NARX network gets the characteristics of the electrical harmonics from practical data rather than the kinematic equations. Thus, the data-aware network approximates the behavior of the practical electrical parameter with real-time data and improves the retrodiction accuracy. Theoretical analysis demonstrates that the data-aware method maintains a reasonable consumption of computing resources. Experiments on a practical testbed of a cyber-physical system are implemented, and harmonic measurement and analysis accuracy are adopted to evaluate the measuring mechanism under a distributed metering network. Results demonstrate an improvement of the harmonics analysis precision and validate the asynchronous measuring method in cyber-physical energy systems. PMID:27548171

  16. Asynchronous, web-based course in astronomy

    Science.gov (United States)

    Spergel, M.

    The course described here is a general educational, non-prerequisite and non- mathematical college course in astronomy offered on the web. It consists of readings from the text plus other periodical sources both online and offline. The course also requires the student to utilize a virtual planetarium to perform exercises in viewing the sky. The students respond to conceptual, multiple-choice questions. This course gives the student a sense of the night sky through the use of computer simulations and night observation. The students learn to understand and express scientific ideas. In addition, since the course is enhanced in computer usage and writing, students also develop these important skills.

  17. INFLUENCE OF THE TIME OF DISINHIBITION TO TRANSIENTS AND WEAR OF THE FRICTION LININGS IN AN ASYNCHRONOUS MOTOR

    Directory of Open Access Journals (Sweden)

    V. V. Solencov

    2016-01-01

    Full Text Available Time and the stopping distance of the electric drive with frequent starting-and-braking modes that contain embedded asynchronous motor with a recessed combined braking device depend on the moment of an electromagnet disinhibition. At the same time other important criteria are taken into the account, i.e. wear resistance of the brake device and the smoothness of the deceleration of the electric drive. In general such an asynchronous motor contains asynchronous engine with squirrel-cage rotor, electromechanical normally-closed brake, electromagnetical slip clutch and control circuit. The mechanical characteristics of the deceleration of asynchronous motor with recessed combined brake device at different moments of an electromagnet disinhibition are presented. The mathematical model is featured and the transients in such a motor are presented. Formation models for computer research were carried out in the Fortran 2008 programming language. Calculation of the system of differential equations was fulfilled by the Runge – Kutta method. The deceleration of the electromechanical brake at various speeds caused different time values and stopping distances. The plots of stopping distance and the braking time at various moments of an electromagnet disinhibition are demonstrated. The optimum moment of switching on an electromechanical brake, providing small stopping distance and the braking time is the time when the speed wвкл = 0,6–0,8 of the nominal. In this case the acceptable number of brake applications for friction linings (compared with mechanical braking will increase by 1.6–2.8 times. The pilot study confirmed the validity of the obtained mathematical models and discovered patterns.

  18. A new asynchronous parallel algorithm for inferring large-scale gene regulatory networks.

    Directory of Open Access Journals (Sweden)

    Xiangyun Xiao

    Full Text Available The reconstruction of gene regulatory networks (GRNs from high-throughput experimental data has been considered one of the most important issues in systems biology research. With the development of high-throughput technology and the complexity of biological problems, we need to reconstruct GRNs that contain thousands of genes. However, when many existing algorithms are used to handle these large-scale problems, they will encounter two important issues: low accuracy and high computational cost. To overcome these difficulties, the main goal of this study is to design an effective parallel algorithm to infer large-scale GRNs based on high-performance parallel computing environments. In this study, we proposed a novel asynchronous parallel framework to improve the accuracy and lower the time complexity of large-scale GRN inference by combining splitting technology and ordinary differential equation (ODE-based optimization. The presented algorithm uses the sparsity and modularity of GRNs to split whole large-scale GRNs into many small-scale modular subnetworks. Through the ODE-based optimization of all subnetworks in parallel and their asynchronous communications, we can easily obtain the parameters of the whole network. To test the performance of the proposed approach, we used well-known benchmark datasets from Dialogue for Reverse Engineering Assessments and Methods challenge (DREAM, experimentally determined GRN of Escherichia coli and one published dataset that contains more than 10 thousand genes to compare the proposed approach with several popular algorithms on the same high-performance computing environments in terms of both accuracy and time complexity. The numerical results demonstrate that our parallel algorithm exhibits obvious superiority in inferring large-scale GRNs.

  19. Students and Taxes: a Privacy-Preserving Study Using Secure Computation

    Directory of Open Access Journals (Sweden)

    Bogdanov Dan

    2016-07-01

    Full Text Available We describe the use of secure multi-party computation for performing a large-scale privacy-preserving statistical study on real government data. In 2015, statisticians from the Estonian Center of Applied Research (CentAR conducted a big data study to look for correlations between working during university studies and failing to graduate in time. The study was conducted by linking the database of individual tax payments from the Estonian Tax and Customs Board and the database of higher education events from the Ministry of Education and Research. Data collection, preparation and analysis were conducted using the Share-mind secure multi-party computation system that provided end-to-end cryptographic protection to the analysis. Using ten million tax records and half a million education records in the analysis, this is the largest cryptographically private statistical study ever conducted on real data.

  20. Item Vetoes and Attempts to Override Them in Multiparty Legislatures Vetos parciales e intentos de insistencia en legislaturas multipartidistas

    Directory of Open Access Journals (Sweden)

    Valeria Palanza

    2013-01-01

    Full Text Available This paper analyzes the dynamics of vetoes and veto overrides in the context of a multiparty legislature using an original dataset from the period 1983–2007 in Argentina. We argue that the President can use an “item” or “partial” veto to selectively delete articles, while keeping enough distributive goods in the bill to break up the coalition responsible for its passage, thereby eliminating support for an override. Our research reveals that total vetoes – which affect all legislators equally – are more likely to be overridden than partial vetoes. Contradicting the received wisdom that in multiparty legislatures override attempts are more likely under a divided government, we find that override attempts are more likely in plurality governments. We use case analyses to illustrate the main arguments developed in this paper.El trabajo estudia las dinámicas desatadas por la práctica del veto presidencial e insistencias del congreso, en el contexto de legislaturas multipartidarias, a través del análisis de una base de datos original que abarca el período 1983-2007 en Argentina. El trabajo argumenta que el presidente puede usar el veto parcial para quitar del texto, en forma selectiva, artículos puntuales, dejando al mismo tiempo en el texto bienes distributivos suficientes como para romper la coalición responsable de la aprobación del proyecto, de manera tal de eliminar la posibilidad de una insistencia. La investigación revela que los vetos totales, que afectan por igual a todos los legisladores, son más factibles de ser insistidos que los vetos parciales. En contra de lo sostenido al momento acerca de que en legislaturas multipartidarias los intentos de insistencia son más factibles bajo gobierno dividido, este trabajo encuentra que son más factibles cuando el gobierno cuenta con al menos una pluralidad en una de las cámaras. Además del análisis cuantitativo, presentamos estudios de casos para ilustrar los argumentos

  1. Asynchronous interaction, online technologies self-efficacy and self-regulated learning as predictors of academic achievement in an online class

    Science.gov (United States)

    McGhee, Rosie M. Hector

    This research is a correlational study of the relationship among the independent variables: asynchronous interaction, online technologies self-efficacy, and self-regulated learning, and the dependent variable; academic achievement. This study involves an online computer literacy course at a local community college. Very little research exists on the relationship among asynchronous interaction, online technologies self-efficacy and self-regulated learning on predicting academic achievement in an online class. Liu (2008), in his study on student interaction in online courses, concluded that student interaction is a complex issue that needs more research to increase our understanding as it relates to distance education. The purpose of this study was to examine the relationships between asynchronous interaction, online technologies self-efficacy, self-regulated learning and academic achievement in an online computer literacy class at a community college. The researcher used quantitative methods to obtain and analyze data on the relationships among the variables during the summer 2010 semester. Forty-five community college students completed three web-based self-reporting instruments: (a) the GVU 10th WWW User Survey Questionnaire, (b) the Online Technologies Self-Efficacy Survey, and (c) selected items from the Motivated Strategies for Learning Questionnaire. Additional data was obtained from asynchronous discussions posted on Blackboard(TM) Learning Management System. The results of this study found that there were statistically significant relationships between asynchronous interaction and academic achievement (r = .55, p academic achievement (r = .50, p learning and academic achievement ( r = -.02, p learning experience. Driscoll (2005) said constructivist pedagogy sees the learner as an active participant in their learning experience rather than a passive vessel to be filled with information. This study is beneficial to theorists, administrators, leaders, online

  2. Channel Estimation And Multiuser Detection In Asynchronous Satellite Communications

    CERN Document Server

    Chaouech, Helmi; 10.5121/ijwmn.2010.2411

    2010-01-01

    In this paper, we propose a new method of channel estimation for asynchronous additive white Gaussian noise channels in satellite communications. This method is based on signals correlation and multiuser interference cancellation which adopts a successive structure. Propagation delays and signals amplitudes are jointly estimated in order to be used for data detection at the receiver. As, a multiuser detector, a single stage successive interference cancellation (SIC) architecture is analyzed and integrated to the channel estimation technique and the whole system is evaluated. The satellite access method adopted is the direct sequence code division multiple access (DS CDMA) one. To evaluate the channel estimation and the detection technique, we have simulated a satellite uplink with an asynchronous multiuser access.

  3. State assignment approach to asynchronous CMOS circuit design

    Science.gov (United States)

    Kantabutra, Vitit; Andreou, Andreas G.

    1994-04-01

    We present a new algorithm for state assignment in asynchronous circuits so that for each circuit state transition, only one (secondary) state variable switches. No intermediate unstable states are used. The resultant circuits operate at optimum speed in terms of the number of transitions made and use only static CMOS gates. By reducing the number of switching events per state transition, noise due to the switching events is reduced and dynamic power dissipation may also be reduced. Our approach is suitable for asynchronous sequential circuits that are designed from flow tables or state transition diagrams. The proposed approach may also be useful for designing synchronous circuits, but explorations into the subject of clock power would be necessary to determine its usefulness.

  4. Sequential incoherence in a multi-party synchronous computer mediated communication for an introductory Health Informatics course.

    Science.gov (United States)

    Herskovic, Jorge R; Goodwin, J Caleb; Bozzo Silva, Pamela A; Willcockson, Irmgard; Franklin, Amy

    2010-11-13

    Online courses will play a key role in the high-volume Informatics education required to train the personnel that will be necessary to fulfill the health IT needs of the country. Online courses can cause feelings of isolation in students. A common way to address these feelings is to hold synchronous online "chats" for students. Conventional chats, however, can be confusing and impose a high extrinsic cognitive load on their participants that hinders the learning process. In this paper we present a qualitative analysis that shows the causes of this high cognitive load and our solution through the use of a moderated chat system.

  5. Marine Forces Reserve: Accelerating Knowledge Flow through Asynchronous Learning Technologies

    Science.gov (United States)

    2014-12-19

    pedagogic techniques that are infeasible in the classroom , and they suggest that in some respects technologically intermediated learning can be even better...frameworks and technologies to examine I-I knowledge flows, and from the practitioner perspective, we bring to bear deep inside knowledge of the focal...ASYNCHRONOUS LEARNING TECHNOLOGIES by Mark Nissen, Robert McGuiness and Anthony Davis December 2014 Further distribution of all or part of this

  6. PersisDroid: Android Performance Diagnosis via Anatomizing Asynchronous Executions

    OpenAIRE

    Kang, Yu; Zhou, Yangfan; Xu, Hui; Lyu, Michael R.

    2015-01-01

    Android applications (apps) grow dramatically in recent years. Apps are user interface (UI) centric typically. Rapid UI responsiveness is key consideration to app developers. However, we still lack a handy tool for profiling app performance so as to diagnose performance problems. This paper presents PersisDroid, a tool specifically designed for this task. The key notion of PersisDroid is that the UI-triggered asynchronous executions also contribute to the UI performance, and hence its perform...

  7. Pipelined asynchronous time-division multiplexing optical bus

    Science.gov (United States)

    Zheng, S. Q.; Li, Yueming

    1997-12-01

    We propose a pipelined asynchronous time-division multiplexing optical bus. Such a bus can use one of two hardwared priority schemes: the linear priority scheme and the round-robin priority scheme. Our simulation results show that the performance of the proposed bus is significantly better than the performances of known pipelined synchronous time-division multiplexing optical buses. The possibilities of using our buses to construct multichannel switches and multidimensional processor arrays are also discussed.

  8. IDENTIFICATION AND CONTROL OF AN ASYNCHRONOUS MACHINE USING NEURAL NETWORKS

    Directory of Open Access Journals (Sweden)

    A ZERGAOUI

    2000-06-01

    Full Text Available In this work, we present the application of artificial neural networks to the identification and control of the asynchronous motor, which is a complex nonlinear system with variable internal dynamics.  We show that neural networks can be applied to control the stator currents of the induction motor.  The results of the different simulations are presented to evaluate the performance of the neural controller proposed.

  9. Asynchronous Transfer Mode (ATM) Switch Technology and Vendor Survey

    Science.gov (United States)

    Berry, Noemi

    1995-01-01

    Asynchronous Transfer Mode (ATM) switch and software features are described and compared in order to make switch comparisons meaningful. An ATM switch's performance cannot be measured solely based on its claimed switching capacity; traffic management and congestion control are emerging as the determining factors in an ATM network's ultimate throughput. Non-switch ATM products and experiences with actual installations of ATM networks are described. A compilation of select vendor offerings as of October 1994 is provided in chart form.

  10. Synthèse automatique de circuits asynchrones QDI

    OpenAIRE

    DINH DUC, Anh Vu

    2003-01-01

    ISBN 2-84813-010-5; Contrary to the synchronous circuits, the asynchronous circuits operate with a mechanism of local synchronization (without clock signal). Since many years, they showed their relevance with respect to the synchronous circuits thanks to their properties of robustness, low power, low noise and modularity. However, the current lack of design methods and associated tools prevents them from being widely spread. This dissertation deals with a new design methodology for quasi-dela...

  11. Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks

    CERN Document Server

    Krishnakumar, R N; Kumar, P Vijay

    2008-01-01

    The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for any number of relays.

  12. Asynchronous Checkpoint Migration with MRNet in the Scalable Checkpoint / Restart Library

    Energy Technology Data Exchange (ETDEWEB)

    Mohror, K; Moody, A; de Supinski, B R

    2012-03-20

    Applications running on today's supercomputers tolerate failures by periodically saving their state in checkpoint files on stable storage, such as a parallel file system. Although this approach is simple, the overhead of writing the checkpoints can be prohibitive, especially for large-scale jobs. In this paper, we present initial results of an enhancement to our Scalable Checkpoint/Restart Library (SCR). We employ MRNet, a tree-based overlay network library, to transfer checkpoints from the compute nodes to the parallel file system asynchronously. This enhancement increases application efficiency by removing the need for an application to block while checkpoints are transferred to the parallel file system. We show that the integration of SCR with MRNet can reduce the time spent in I/O operations by as much as 15x. However, our experiments exposed new scalability issues with our initial implementation. We discuss the sources of the scalability problems and our plans to address them.

  13. On the asynchronously continuous control of mobile robot movement by motor cortical spiking activity.

    Science.gov (United States)

    Xu, Zhiming; So, Rosa Q; Toe, Kyaw Kyar; Ang, Kai Keng; Guan, Cuntai

    2014-01-01

    This paper presents an asynchronously intracortical brain-computer interface (BCI) which allows the subject to continuously drive a mobile robot. This system has a great implication for disabled patients to move around. By carefully designing a multiclass support vector machine (SVM), the subject's self-paced instantaneous movement intents are continuously decoded to control the mobile robot. In particular, we studied the stability of the neural representation of the movement directions. Experimental results on the nonhuman primate showed that the overt movement directions were stably represented in ensemble of recorded units, and our SVM classifier could successfully decode such movements continuously along the desired movement path. However, the neural representation of the stop state for the self-paced control was not stably represented and could drift.

  14. An investigation of the dynamic electromechanical coupling effects in machine drive systems driven by asynchronous motors

    Science.gov (United States)

    Szolc, Tomasz; Konowrocki, Robert; Michajłow, Maciej; Pręgowska, Agnieszka

    2014-12-01

    In the paper dynamic electromechanical interaction between the rotating machine drive system and the electric driving motor is considered. The investigations are performed by means of the circuit model of the asynchronous motor as well as using an advanced structural hybrid model of the drive system. Using the analytical solutions applied for the electrical and the mechanical systems the electromagnetic stiffness and coefficient of damping, both generated by the electric motor rotationally interacting with the mechanical system of the given dynamic properties, were determined. By means of experimentally validated computational responses obtained for torsional harmonic excitation induced by the driven machine working tool, a modification of dynamic properties of the mechanical system by the electromagnetic flux between the stator and the rotor has been studied.

  15. Asynchronous Distance Education Forum - Brainstorming vs. Snowballing: A Case Study for Teaching in Programming Didactics

    Science.gov (United States)

    Patriarcheas, Kiriakos; Xenos, Michalis

    Asynchronous discussion fora all the more become part of the educational process of distance education. The goal of this research is the study of the educational techniques of Brainstorming and Snowballing to their utilisation in the frame of a distance education forum, both as far as participation and creation of learning environment and also educational effectiveness are concerned. This research refers to computer teachers’ training on didactics of programming within the framework of educational micro-worlds. As it is deduced from the data analysis and the study of the messages higher participation and improvement of critical thinking are noted when Brainstorming technique is used, while fairly less time is spent and less off-topic interventions are made when Snowballing technique is used. Meanwhile, Brainstorming is found to be more advantageous than Snowballing concerning the effectiveness both in primary level (trained teachers) and in secondary level of adaptation and knowledge impartment to the students (results of their students).

  16. Asynchronous Group Key Distribution on top of the CC2420 Security Mechanisms for Sensor Networks

    DEFF Research Database (Denmark)

    Hansen, Morten Tranberg

    2009-01-01

    scheme with no time synchronization requirements. The scheme decreases the number of key updates by providing them on an as needed basis according to the amount of network traffic. We evaluate the CC2420 radio security mechanism and show how to use it as a basis to implement secure group communication......A sensor network is a network consisting of small, inexpensive, low-powered sensor nodes that communicate to complete a common task. Sensor nodes are characterized by having limited communication and computation capabilities, energy, and storage. They often are deployed in hostile environments...... creating a demand for encryption and authentication of the messages sent between them. Due to severe resource constraints on the sensor nodes, efficient key distribution schemes and secure communication protocols with low overhead are desired. In this paper we present an asynchronous group key distribution...

  17. Asynchronous signal-dependent non-uniform sampler

    Science.gov (United States)

    Can-Cimino, Azime; Chaparro, Luis F.; Sejdić, Ervin

    2014-05-01

    Analog sparse signals resulting from biomedical and sensing network applications are typically non-stationary with frequency-varying spectra. By ignoring that the maximum frequency of their spectra is changing, uniform sampling of sparse signals collects unnecessary samples in quiescent segments of the signal. A more appropriate sampling approach would be signal-dependent. Moreover, in many of these applications power consumption and analog processing are issues of great importance that need to be considered. In this paper we present a signal dependent non-uniform sampler that uses a Modified Asynchronous Sigma Delta Modulator which consumes low-power and can be processed using analog procedures. Using Prolate Spheroidal Wave Functions (PSWF) interpolation of the original signal is performed, thus giving an asynchronous analog to digital and digital to analog conversion. Stable solutions are obtained by using modulated PSWFs functions. The advantage of the adapted asynchronous sampler is that range of frequencies of the sparse signal is taken into account avoiding aliasing. Moreover, it requires saving only the zero-crossing times of the non-uniform samples, or their differences, and the reconstruction can be done using their quantized values and a PSWF-based interpolation. The range of frequencies analyzed can be changed and the sampler can be implemented as a bank of filters for unknown range of frequencies. The performance of the proposed algorithm is illustrated with an electroencephalogram (EEG) signal.

  18. Data Collection for Mobile Group Consumption: An Asynchronous Distributed Approach.

    Science.gov (United States)

    Zhu, Weiping; Chen, Weiran; Hu, Zhejie; Li, Zuoyou; Liang, Yue; Chen, Jiaojiao

    2016-04-06

    Mobile group consumption refers to consumption by a group of people, such as a couple, a family, colleagues and friends, based on mobile communications. It differs from consumption only involving individuals, because of the complex relations among group members. Existing data collection systems for mobile group consumption are centralized, which has the disadvantages of being a performance bottleneck, having single-point failure and increasing business and security risks. Moreover, these data collection systems are based on a synchronized clock, which is often unrealistic because of hardware constraints, privacy concerns or synchronization cost. In this paper, we propose the first asynchronous distributed approach to collecting data generated by mobile group consumption. We formally built a system model thereof based on asynchronous distributed communication. We then designed a simulation system for the model for which we propose a three-layer solution framework. After that, we describe how to detect the causality relation of two/three gathering events that happened in the system based on the collected data. Various definitions of causality relations based on asynchronous distributed communication are supported. Extensive simulation results show that the proposed approach is effective for data collection relating to mobile group consumption.

  19. A novel asynchronous access method with binary interfaces

    Directory of Open Access Journals (Sweden)

    Torres-Solis Jorge

    2008-10-01

    Full Text Available Abstract Background Traditionally synchronous access strategies require users to comply with one or more time constraints in order to communicate intent with a binary human-machine interface (e.g., mechanical, gestural or neural switches. Asynchronous access methods are preferable, but have not been used with binary interfaces in the control of devices that require more than two commands to be successfully operated. Methods We present the mathematical development and evaluation of a novel asynchronous access method that may be used to translate sporadic activations of binary interfaces into distinct outcomes for the control of devices requiring an arbitrary number of commands to be controlled. With this method, users are required to activate their interfaces only when the device under control behaves erroneously. Then, a recursive algorithm, incorporating contextual assumptions relevant to all possible outcomes, is used to obtain an informed estimate of user intention. We evaluate this method by simulating a control task requiring a series of target commands to be tracked by a model user. Results When compared to a random selection, the proposed asynchronous access method offers a significant reduction in the number of interface activations required from the user. Conclusion This novel access method offers a variety of advantages over traditionally synchronous access strategies and may be adapted to a wide variety of contexts, with primary relevance to applications involving direct object manipulation.

  20. Asynchronous Stoichiometric Response in Lithium Iron Phosphate Batteries

    Energy Technology Data Exchange (ETDEWEB)

    Paxton, William A. [State Univ. of New Jersey, Piscataway, NJ (United States); Akdogan, E. Koray [State Univ. of New Jersey, Piscataway, NJ (United States); Savkliyidiz, Ilyas [State Univ. of New Jersey, Piscataway, NJ (United States); Choksi, Ankur U. [State Univ. of New Jersey, Piscataway, NJ (United States); Silver, Scott X. [State Univ. of New Jersey, Piscataway, NJ (United States); Tsakalokos, Thomas [State Univ. of New Jersey, Piscataway, NJ (United States); Zhong, Zhong [Brookhaven National Lab. (BNL), Upton, NY (United States)

    2014-11-11

    The operando energy-dispersive x-ray diffraction (EDXRD) was carried out on a newly formed 8 Ah lithium iron phosphate (LiFePO4) battery with the goal of elucidating the origin of asynchronous phase transformation commonly seen with in situ x-ray diffraction studies. The high-energy photons at the NSLS X17B1 beamline allow for penetration into a fully assembled battery and therefore negate any need for a specially designed in situ cell which often uses modified current collectors to minimize x-ray attenuation. Spatially-and-temporally resolved phase-mapping was conducted with a semiquantitative reference intensity ratio (RIR) analysis to estimate the relative abundance of the delithiated phase. The data show an asynchronous response in the stoichiometry versus the electrochemical profile and suggest limited diffusion in the electrode toward the end of discharge. These results confirm that the asynchronous electrode response is not just limited to specially designed cells but occurs in fully assembled cells alike. We attribute this behavior to be a consequence of performing a local measurement over a wide-area heterogeneous reaction.

  1. Pseudo Asynchronous Level Crossing adc for ecg Signal Acquisition.

    Science.gov (United States)

    Marisa, T; Niederhauser, T; Haeberlin, A; Wildhaber, R A; Vogel, R; Goette, J; Jacomet, M

    2017-02-07

    A new pseudo asynchronous level crossing analogue-to-digital converter (adc) architecture targeted for low-power, implantable, long-term biomedical sensing applications is presented. In contrast to most of the existing asynchronous level crossing adc designs, the proposed design has no digital-to-analogue converter (dac) and no continuous time comparators. Instead, the proposed architecture uses an analogue memory cell and dynamic comparators. The architecture retains the signal activity dependent sampling operation by generating events only when the input signal is changing. The architecture offers the advantages of smaller chip area, energy saving and fewer analogue system components. Beside lower energy consumption the use of dynamic comparators results in a more robust performance in noise conditions. Moreover, dynamic comparators make interfacing the asynchronous level crossing system to synchronous processing blocks simpler. The proposed adc was implemented in [Formula: see text] complementary metal-oxide-semiconductor (cmos) technology, the hardware occupies a chip area of 0.0372 mm(2) and operates from a supply voltage of [Formula: see text] to [Formula: see text]. The adc's power consumption is as low as 0.6 μW with signal bandwidth from [Formula: see text] to [Formula: see text] and achieves an equivalent number of bits (enob) of up to 8 bits.

  2. A Synchronous-Asynchronous Particle Swarm Optimisation Algorithm

    Directory of Open Access Journals (Sweden)

    Nor Azlina Ab Aziz

    2014-01-01

    Full Text Available In the original particle swarm optimisation (PSO algorithm, the particles’ velocities and positions are updated after the whole swarm performance is evaluated. This algorithm is also known as synchronous PSO (S-PSO. The strength of this update method is in the exploitation of the information. Asynchronous update PSO (A-PSO has been proposed as an alternative to S-PSO. A particle in A-PSO updates its velocity and position as soon as its own performance has been evaluated. Hence, particles are updated using partial information, leading to stronger exploration. In this paper, we attempt to improve PSO by merging both update methods to utilise the strengths of both methods. The proposed synchronous-asynchronous PSO (SA-PSO algorithm divides the particles into smaller groups. The best member of a group and the swarm’s best are chosen to lead the search. Members within a group are updated synchronously, while the groups themselves are asynchronously updated. Five well-known unimodal functions, four multimodal functions, and a real world optimisation problem are used to study the performance of SA-PSO, which is compared with the performances of S-PSO and A-PSO. The results are statistically analysed and show that the proposed SA-PSO has performed consistently well.

  3. Large-scale asynchronous and distributed multidimensional replica exchange molecular simulations and efficiency analysis.

    Science.gov (United States)

    Xia, Junchao; Flynn, William F; Gallicchio, Emilio; Zhang, Bin W; He, Peng; Tan, Zhiqiang; Levy, Ronald M

    2015-09-05

    We describe methods to perform replica exchange molecular dynamics (REMD) simulations asynchronously (ASyncRE). The methods are designed to facilitate large scale REMD simulations on grid computing networks consisting of heterogeneous and distributed computing environments as well as on homogeneous high-performance clusters. We have implemented these methods on NSF (National Science Foundation) XSEDE (Extreme Science and Engineering Discovery Environment) clusters and BOINC (Berkeley Open Infrastructure for Network Computing) distributed computing networks at Temple University and Brooklyn College at CUNY (the City University of New York). They are also being implemented on the IBM World Community Grid. To illustrate the methods, we have performed extensive (more than 60 ms in aggregate) simulations for the beta-cyclodextrin-heptanoate host-guest system in the context of one- and two-dimensional ASyncRE, and we used the results to estimate absolute binding free energies using the binding energy distribution analysis method. We propose ways to improve the efficiency of REMD simulations: these include increasing the number of exchanges attempted after a specified molecular dynamics (MD) period up to the fast exchange limit and/or adjusting the MD period to allow sufficient internal relaxation within each thermodynamic state. Although ASyncRE simulations generally require long MD periods (>picoseconds) per replica exchange cycle to minimize the overhead imposed by heterogeneous computing networks, we found that it is possible to reach an efficiency similar to conventional synchronous REMD, by optimizing the combination of the MD period and the number of exchanges attempted per cycle.

  4. Asynchronous Remote Medical Consultation for Ghana

    CERN Document Server

    Luk, Rowena; Aoki, Paul M

    2008-01-01

    Computer-mediated communication systems can be used to bridge the gap between doctors in underserved regions with local shortages of medical expertise and medical specialists worldwide. To this end, we describe the design of a prototype remote consultation system intended to provide the social, institutional and infrastructural context for sustained, self-organizing growth of a globally-distributed Ghanaian medical community. The design is grounded in an iterative design process that included two rounds of extended design fieldwork throughout Ghana and draws on three key design principles (social networks as a framework on which to build incentives within a self-organizing network; optional and incremental integration with existing referral mechanisms; and a weakly-connected, distributed architecture that allows for a highly interactive, responsive system despite failures in connectivity). We discuss initial experiences from an ongoing trial deployment in southern Ghana.

  5. Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed

    DEFF Research Database (Denmark)

    Cohen, Gil; Damgård, Ivan Bjerre; Ishai, Yuval;

    2013-01-01

    We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is 12n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being...... of secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...

  6. Synthesis and Layout of an Asynchronous Network-on-Chip using Standard EDA Tools

    DEFF Research Database (Denmark)

    Müller, Christoph; Kasapaki, Evangelia; Sørensen, Rasmus Bo;

    2014-01-01

    is the key role that clock signals play in specifying time-constraints for the synthesis. In this paper explain how we handled the synthesis and layout of an asynchronous network-on-chip for a multi-core platform. Focus is on the design process while the actual NOC-design and its performance are presented......Asynchronous circuit design is well understood but design tools supporting asynchronous design are largely lacking, and designers are limited to using conventional EDA-tools. These tools have a built-in synchronous mind-set and this complicates their use for asynchronous implementation. One example...

  7. An Asynchronous Recurrent Network of Cellular Automaton-Based Neurons and Its Reproduction of Spiking Neural Network Activities.

    Science.gov (United States)

    Matsubara, Takashi; Torikai, Hiroyuki

    2016-04-01

    Modeling and implementation approaches for the reproduction of input-output relationships in biological nervous tissues contribute to the development of engineering and clinical applications. However, because of high nonlinearity, the traditional modeling and implementation approaches encounter difficulties in terms of generalization ability (i.e., performance when reproducing an unknown data set) and computational resources (i.e., computation time and circuit elements). To overcome these difficulties, asynchronous cellular automaton-based neuron (ACAN) models, which are described as special kinds of cellular automata that can be implemented as small asynchronous sequential logic circuits have been proposed. This paper presents a novel type of such ACAN and a theoretical analysis of its excitability. This paper also presents a novel network of such neurons, which can mimic input-output relationships of biological and nonlinear ordinary differential equation model neural networks. Numerical analyses confirm that the presented network has a higher generalization ability than other major modeling and implementation approaches. In addition, Field-Programmable Gate Array-implementations confirm that the presented network requires lower computational resources.

  8. Parallel tempering simulation of the three-dimensional Edwards-Anderson model with compact asynchronous multispin coding on GPU

    Science.gov (United States)

    Fang, Ye; Feng, Sheng; Tam, Ka-Ming; Yun, Zhifeng; Moreno, Juana; Ramanujam, J.; Jarrell, Mark

    2014-10-01

    Monte Carlo simulations of the Ising model play an important role in the field of computational statistical physics, and they have revealed many properties of the model over the past few decades. However, the effect of frustration due to random disorder, in particular the possible spin glass phase, remains a crucial but poorly understood problem. One of the obstacles in the Monte Carlo simulation of random frustrated systems is their long relaxation time making an efficient parallel implementation on state-of-the-art computation platforms highly desirable. The Graphics Processing Unit (GPU) is such a platform that provides an opportunity to significantly enhance the computational performance and thus gain new insight into this problem. In this paper, we present optimization and tuning approaches for the CUDA implementation of the spin glass simulation on GPUs. We discuss the integration of various design alternatives, such as GPU kernel construction with minimal communication, memory tiling, and look-up tables. We present a binary data format, Compact Asynchronous Multispin Coding (CAMSC), which provides an additional 28.4% speedup compared with the traditionally used Asynchronous Multispin Coding (AMSC). Our overall design sustains a performance of 33.5 ps per spin flip attempt for simulating the three-dimensional Edwards-Anderson model with parallel tempering, which significantly improves the performance over existing GPU implementations.

  9. COMPUTING

    CERN Multimedia

    M. Kasemann

    Overview In autumn the main focus was to process and handle CRAFT data and to perform the Summer08 MC production. The operational aspects were well covered by regular Computing Shifts, experts on duty and Computing Run Coordination. At the Computing Resource Board (CRB) in October a model to account for service work at Tier 2s was approved. The computing resources for 2009 were reviewed for presentation at the C-RRB. The quarterly resource monitoring is continuing. Facilities/Infrastructure operations Operations during CRAFT data taking ran fine. This proved to be a very valuable experience for T0 workflows and operations. The transfers of custodial data to most T1s went smoothly. A first round of reprocessing started at the Tier-1 centers end of November; it will take about two weeks. The Computing Shifts procedure was tested full scale during this period and proved to be very efficient: 30 Computing Shifts Persons (CSP) and 10 Computing Resources Coordinators (CRC). The shift program for the shut down w...

  10. Scalable Symmetric Key Cryptography Using Asynchronous Data Exchange in Enterprise Grid

    Directory of Open Access Journals (Sweden)

    Medhat Awadallah

    2011-11-01

    Full Text Available Symmetric key cryptography is one of the most critical computing problems that need high performance computing power resources. The use of large key sizes and complex encryption/decryption algorithms to achieve unbreakable state has led to an increased time computational complexity. Traditionally, this problem is solved in the grid environment by partitioning data streams into several blocks of a predefined size. This is done while sequentially reading the data from the raw data file. The grid manager node then takes the responsibility of passing these blocks to the executer nodes where different blocks are processed separately and simultaneously. Although this technique allows parallel processing to speed up the encryption/decryption process, creating blocks by sequentially reading the data file and distributing these blocks on executers synchronously by the central manager node is a poor technique and a source of delay. In this paper, we present a novel approach that tackles this problem by allowing executers to access data file at random and asynchronously exchange the blocks among them, thereby, delay is significantly reduced and data size can be scaled up. In order to show the merit of our approach experiments have been conducted through a system-level middleware for grid computing called Alchemi. The results show a remarkable performance enhancement in our approach over traditional approaches in terms of speed.

  11. Identifying the pitfalls for social interaction in computer-supported collaborative learning environments: a review of the research

    NARCIS (Netherlands)

    Kreijns, K.; Kirschner, P.A.; Jochems, W.

    2003-01-01

    Computer-mediated world-wide networks have enabled a shift from contiguous learning groups to asynchronous distributed learning groups utilizing computer-supported collaborative learning environments. Although these environments can support communication and collaboration, both research and field ob

  12. COMPUTING

    CERN Multimedia

    M. Kasemann

    Overview During the past three months activities were focused on data operations, testing and re-enforcing shift and operational procedures for data production and transfer, MC production and on user support. Planning of the computing resources in view of the new LHC calendar in ongoing. Two new task forces were created for supporting the integration work: Site Commissioning, which develops tools helping distributed sites to monitor job and data workflows, and Analysis Support, collecting the user experience and feedback during analysis activities and developing tools to increase efficiency. The development plan for DMWM for 2009/2011 was developed at the beginning of the year, based on the requirements from the Physics, Computing and Offline groups (see Offline section). The Computing management meeting at FermiLab on February 19th and 20th was an excellent opportunity discussing the impact and for addressing issues and solutions to the main challenges facing CMS computing. The lack of manpower is particul...

  13. COMPUTING

    CERN Multimedia

    I. Fisk

    2011-01-01

    Introduction CMS distributed computing system performed well during the 2011 start-up. The events in 2011 have more pile-up and are more complex than last year; this results in longer reconstruction times and harder events to simulate. Significant increases in computing capacity were delivered in April for all computing tiers, and the utilisation and load is close to the planning predictions. All computing centre tiers performed their expected functionalities. Heavy-Ion Programme The CMS Heavy-Ion Programme had a very strong showing at the Quark Matter conference. A large number of analyses were shown. The dedicated heavy-ion reconstruction facility at the Vanderbilt Tier-2 is still involved in some commissioning activities, but is available for processing and analysis. Facilities and Infrastructure Operations Facility and Infrastructure operations have been active with operations and several important deployment tasks. Facilities participated in the testing and deployment of WMAgent and WorkQueue+Request...

  14. COMPUTING

    CERN Multimedia

    P. McBride

    The Computing Project is preparing for a busy year where the primary emphasis of the project moves towards steady operations. Following the very successful completion of Computing Software and Analysis challenge, CSA06, last fall, we have reorganized and established four groups in computing area: Commissioning, User Support, Facility/Infrastructure Operations and Data Operations. These groups work closely together with groups from the Offline Project in planning for data processing and operations. Monte Carlo production has continued since CSA06, with about 30M events produced each month to be used for HLT studies and physics validation. Monte Carlo production will continue throughout the year in the preparation of large samples for physics and detector studies ramping to 50 M events/month for CSA07. Commissioning of the full CMS computing system is a major goal for 2007. Site monitoring is an important commissioning component and work is ongoing to devise CMS specific tests to be included in Service Availa...

  15. Advances in unconventional computing

    CERN Document Server

    2017-01-01

    The unconventional computing is a niche for interdisciplinary science, cross-bred of computer science, physics, mathematics, chemistry, electronic engineering, biology, material science and nanotechnology. The aims of this book are to uncover and exploit principles and mechanisms of information processing in and functional properties of physical, chemical and living systems to develop efficient algorithms, design optimal architectures and manufacture working prototypes of future and emergent computing devices. This first volume presents theoretical foundations of the future and emergent computing paradigms and architectures. The topics covered are computability, (non-)universality and complexity of computation; physics of computation, analog and quantum computing; reversible and asynchronous devices; cellular automata and other mathematical machines; P-systems and cellular computing; infinity and spatial computation; chemical and reservoir computing. The book is the encyclopedia, the first ever complete autho...

  16. The design of the asynchronous abacus adder%异步算盘加法器设计

    Institute of Scientific and Technical Information of China (English)

    徐阳扬; 杨银堂; 周端; 弥晓华

    2011-01-01

    目的 开发一种新型的高速低功耗加法器设计方案.以满足SOC对高速低功耗运算的需要.方法 采用中国算盘算法,接口采用异步双轨握手协议,将算盘加法与异步自定时技术相结合,减少运算的进位产生,提高运算并行度.结果 提出了一种新的高速加法器电路.测试结果表明,在SMIC 0.18 μm工艺下,32位异步算盘加法器平均运算完成时间为0.957ns,其速度是同步串行加法器的6.747倍,是异步串行加法器的1.517倍和异步进位选择加法器的1.033倍.且电路平均功耗只有异步进位选择加法器的25%.结论 中国算盘算法与异步自定时电路相结合的加法器电路,有很好的速度和功耗特性,有很广阔的应用和研究前景.%Aim To develop a new high speed and low power adder design scheme for the demand of high speed and low power computing in SOC. Methods A new adder design is proposed in this paper. The adder adopts the Chinese abacus algorithm, combined with asynchronous self-timed techniques, and it also introduces the hybrid handshake protocol in the scheme. It can decrease the number of the carries and increase the parallel computing degrees. So it can achieve high speed while maintaining low power. Results The adder implemented the 0. 18μm technique of SMIC. The test result shows the 32-bit asynchronous parallel adder achieves the average computation duration is 0.957ns. Its speed is 7. 33 times faster than the synchronous ripple adder, 1.517 times faster than the a-synchronous ripple adder, and 1.033 times faster than the asynchronous carry-select adder. And its average power is only 25% of the asynchronous carry-select adder. Conclusion The adder design which combine with Chinese abacus algorithm and asynchronous self-timed techniques has good performance on high speed and low power. It has wide implement and develop prospective.

  17. Faculty development and mentorship using selected online asynchronous teaching strategies.

    Science.gov (United States)

    Vitale, Anne T

    2010-12-01

    The use of distance learning continues to improve accessibility to nursing education programs, yet online teaching remains an intimidating experience for novice educators. An emerging role in professional faculty development is the online educator, who serves as a mentor for novice faculty. This article presents the necessary elements to plan, organize, and manage asynchronous online courses, especially for novice educators and online faculty mentors. Course engagement and faculty-student online communication strategies are explored using examples. Threaded discussion strategies for engaging students in active, collaborative learning are discussed using specific examples. A threaded discussion grading rubric is included. Strategies to sustain interactive learning and evaluate student learning using examples are offered.

  18. Positive semidefinite integrated covariance estimation, factorizations and asynchronicity

    DEFF Research Database (Denmark)

    Sauri, Orimar; Lunde, Asger; Laurent, Sébastien;

    2017-01-01

    An estimator of the ex-post covariation of log-prices under asynchronicity and microstructure noise is proposed. It uses the Cholesky factorization of the covariance matrix in order to exploit the heterogeneity in trading intensities to estimate the different parameters sequentially with as many...... observations as possible. The estimator is positive semidefinite by construction. We derive asymptotic results and confirm their good finite sample properties by means of a Monte Carlo simulation. In the application we forecast portfolio Value-at-Risk and sector risk exposures for a portfolio of 52 stocks. We...

  19. Negative circuits and sustained oscillations in asynchronous automata networks

    CERN Document Server

    Richard, Adrien

    2009-01-01

    The biologist Ren\\'e Thomas conjectured, twenty years ago, that the presence of a negative feedback circuit in the interaction graph of a dynamical system is a necessary condition for this system to produce sustained oscillations. In this paper, we state and prove this conjecture for asynchronous automata networks, a class of discrete dynamical systems extensively used to model the behaviors of gene networks. As a corollary, we obtain the following fixed point theorem: given a product $X$ of $n$ finite intervals of integers, and a map $F$ from $X$ to itself, if the interaction graph associated with $F$ has no negative circuit, then $F$ has at least one fixed point.

  20. COMPUTING

    CERN Multimedia

    I. Fisk

    2013-01-01

    Computing activity had ramped down after the completion of the reprocessing of the 2012 data and parked data, but is increasing with new simulation samples for analysis and upgrade studies. Much of the Computing effort is currently involved in activities to improve the computing system in preparation for 2015. Operations Office Since the beginning of 2013, the Computing Operations team successfully re-processed the 2012 data in record time, not only by using opportunistic resources like the San Diego Supercomputer Center which was accessible, to re-process the primary datasets HTMHT and MultiJet in Run2012D much earlier than planned. The Heavy-Ion data-taking period was successfully concluded in February collecting almost 500 T. Figure 3: Number of events per month (data) In LS1, our emphasis is to increase efficiency and flexibility of the infrastructure and operation. Computing Operations is working on separating disk and tape at the Tier-1 sites and the full implementation of the xrootd federation ...

  1. Computer

    CERN Document Server

    Atkinson, Paul

    2011-01-01

    The pixelated rectangle we spend most of our day staring at in silence is not the television as many long feared, but the computer-the ubiquitous portal of work and personal lives. At this point, the computer is almost so common we don't notice it in our view. It's difficult to envision that not that long ago it was a gigantic, room-sized structure only to be accessed by a few inspiring as much awe and respect as fear and mystery. Now that the machine has decreased in size and increased in popular use, the computer has become a prosaic appliance, little-more noted than a toaster. These dramati

  2. Effects of Belongingness and Synchronicity on Face-to-Face and Computer-Mediated Online Cooperative Pedagogy

    Science.gov (United States)

    Saltarelli, Andrew John

    2012-01-01

    Previous research suggests asynchronous online computer-mediated communication (CMC) has deleterious effects on certain cooperative learning pedagogies (e.g., constructive controversy), but the processes underlying this effect and how it may be ameliorated remain unclear. This study tests whether asynchronous CMC thwarts belongingness needs…

  3. The design of an asynchronous Tiny RISC TM/TR4101 microprocessor core

    DEFF Research Database (Denmark)

    Christensen, Kåre Tais; Jensen, P.; Korger, P.

    1998-01-01

    This paper presents the design of an asynchronous version of the TR4101 embedded microprocessor core developed by LSI Logic Inc. The asynchronous processor, called ARISC, was designed using the same CAD tools and the same standard cell library that was used to implement the TR4101. The paper...

  4. The Key Implementation Technology of Client/Server's Asynchronous Communication Programs

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    This paper introduces the implementation method,key technology and flowchart of Client/Server's asynchronous communication programs on Linux or Unix,and further explains a few problems to which should pay attention for improving CPU's efficiency in implementing asynchronous communication programs.

  5. Using Television Sitcoms to Facilitate Asynchronous Discussions in the Online Communication Course

    Science.gov (United States)

    Tolman, Elizabeth; Asbury, Bryan

    2012-01-01

    Asynchronous discussions are a useful instructional resource in the online communication course. In discussion groups students have the opportunity to actively participate and interact with students and the instructor. Asynchronous communication allows for flexibility because "participants can interact with significant amounts of time between…

  6. A Scheduling Discipline for Latency and Bandwidth Guarantees in Asynchronous Network-on-Chip

    DEFF Research Database (Denmark)

    Bjerregaard, Tobias; Sparsø, Jens

    2005-01-01

    Guaranteed services (GS) are important in that they provide predictability in the complex dynamics of shared communication structures. This paper discusses the implementation of GS in asynchronous Network-on-Chip. We present a novel scheduling discipline called Asynchronous Latency Guarantee (ALG...

  7. Exploring the Effect of Scripted Roles on Cognitive Presence in Asynchronous Online Discussions

    Science.gov (United States)

    Olesova, Larisa; Slavin, Margaret; Lim, Jieun

    2016-01-01

    The purpose of this study was to identify the effect of scripted roles on students' level of cognitive presence in asynchronous online threaded discussions. A quantitative content analysis was used to investigate: (1) what level of cognitive presence is achieved by students' assigned roles in asynchronous online discussions; (2) differences…

  8. COMPUTING

    CERN Document Server

    I. Fisk

    2010-01-01

    Introduction It has been a very active quarter in Computing with interesting progress in all areas. The activity level at the computing facilities, driven by both organised processing from data operations and user analysis, has been steadily increasing. The large-scale production of simulated events that has been progressing throughout the fall is wrapping-up and reprocessing with pile-up will continue. A large reprocessing of all the proton-proton data has just been released and another will follow shortly. The number of analysis jobs by users each day, that was already hitting the computing model expectations at the time of ICHEP, is now 33% higher. We are expecting a busy holiday break to ensure samples are ready in time for the winter conferences. Heavy Ion An activity that is still in progress is computing for the heavy-ion program. The heavy-ion events are collected without zero suppression, so the event size is much large at roughly 11 MB per event of RAW. The central collisions are more complex and...

  9. COMPUTING

    CERN Multimedia

    M. Kasemann P. McBride Edited by M-C. Sawley with contributions from: P. Kreuzer D. Bonacorsi S. Belforte F. Wuerthwein L. Bauerdick K. Lassila-Perini M-C. Sawley

    Introduction More than seventy CMS collaborators attended the Computing and Offline Workshop in San Diego, California, April 20-24th to discuss the state of readiness of software and computing for collisions. Focus and priority were given to preparations for data taking and providing room for ample dialog between groups involved in Commissioning, Data Operations, Analysis and MC Production. Throughout the workshop, aspects of software, operating procedures and issues addressing all parts of the computing model were discussed. Plans for the CMS participation in STEP’09, the combined scale testing for all four experiments due in June 2009, were refined. The article in CMS Times by Frank Wuerthwein gave a good recap of the highly collaborative atmosphere of the workshop. Many thanks to UCSD and to the organizers for taking care of this workshop, which resulted in a long list of action items and was definitely a success. A considerable amount of effort and care is invested in the estimate of the comput...

  10. Behavioral Synthesis of Asynchronous Circuits Using Syntax Directed Translation as Backend

    DEFF Research Database (Denmark)

    Nielsen, Sune Fallgaard; Sparsø, Jens; Madsen, Jan

    2009-01-01

    The current state-of-the art in high-level synthesis of asynchronous circuits is syntax directed translation, which performs a one-to-one mapping of a HDL-description into a corresponding circuit. This paper presents a method for behavioral synthesis of asynchronous circuits which builds on top...... of syntax directed translation, and which allows the designer to perform automatic design space exploration guided by area or speed constraints. The paper presents an asynchronous implementation template consisting of a data-path and a control unit and its implementation using the asynchronous hardware...... description language Balsa [1]. This ”conventional” template architecture allows us to adapt traditional synchronous synthesis techniques for resource sharing, scheduling, binding etc, to the domain of asynchronous circuits. A prototype tool has been implemented on top of the Balsa framework, and the method...

  11. An Asynchronous IEEE Floating-Point Arithmetic Unit

    Directory of Open Access Journals (Sweden)

    Joel R. Noche

    2007-12-01

    Full Text Available An asynchronous floating-point arithmetic unit is designed and tested at the transistor level usingCadence software. It uses CMOS (complementary metal oxide semiconductor and DCVS (differentialcascode voltage switch logic in a 0.35 µm process using a 3.3 V supply voltage, with dual-rail data andsingle-rail control signals using four-phase handshaking.Using 17,085 transistors, the unit handles single-precision (32-bit addition/subtraction, multiplication,division, and remainder using the IEEE 754-1985 Standard for Binary Floating-Point Arithmetic, withrounding and other operations to be handled by separate hardware or software. Division and remainderare done using a restoring subtractive algorithm; multiplication uses an additive algorithm. Exceptionsare noted by flags (and not trap handlers and the output is in single-precision.Previous work on asynchronous floating-point arithmetic units have mostly focused on single operationssuch as division. This is the first work to the authors' knowledge that can perform floating-point addition,multiplication, division, and remainder using a common datapath.

  12. Formation of the wide asynchronous binary asteroid population

    Energy Technology Data Exchange (ETDEWEB)

    Jacobson, Seth A. [Department of Astrophysical and Planetary Science, UCB 391, University of Colorado, Boulder, CO 80309 (United States); Scheeres, Daniel J.; McMahon, Jay [Department of Aerospace Engineering Sciences, UCB 429, University of Colorado, Boulder, CO 80309 (United States)

    2014-01-01

    We propose and analyze a new mechanism for the formation of the wide asynchronous binary population. These binary asteroids have wide semimajor axes relative to most near-Earth and main belt asteroid systems. Confirmed members have rapidly rotating primaries and satellites that are not tidally locked. Previously suggested formation mechanisms from impact ejecta, from planetary flybys, and directly from rotational fission events cannot satisfy all of the observations. The newly hypothesized mechanism works as follows: (1) these systems are formed from rotational fission, (2) their satellites are tidally locked, (3) their orbits are expanded by the binary Yarkovsky-O'Keefe-Radzievskii-Paddack (BYORP) effect, (4) their satellites desynchronize as a result of the adiabatic invariance between the libration of the secondary and the mutual orbit, and (5) the secondary avoids resynchronization because of the YORP effect. This seemingly complex chain of events is a natural pathway for binaries with satellites that have particular shapes, which define the BYORP effect torque that acts on the system. After detailing the theory, we analyze each of the wide asynchronous binary members and candidates to assess their most likely formation mechanism. Finally, we suggest possible future observations to check and constrain our hypothesis.

  13. Designing Parallel Bus Using Universal Asynchronous Receiver Transmitter

    Directory of Open Access Journals (Sweden)

    Satyandra Sharad

    2013-04-01

    Full Text Available This paper entitled “DESIGNING PARALLEL BUSUSING UNIVERSAL ASYNCHRONOUS RECEIVER TRANSMITTER” is designed to the core of a UART interface module, which includes both receive and transmit modules, and the command parser. This paper will be a viable solution to design parallel buses with the help of UART. In the test bench , there is a RFM(register file model to which we write/read back data from just to check our design .The txt file issues serial inputs to the core and the core outputs parallel data and address in the form of bus. This bus is connected to our RFM (register file model instantiated in the test bench along with the design. This makes easy to retrieve parallel data from serial input. The base of the paper is to use microcontroller along with other components to interface with the physical world. In contrast, most serial communication must first be converted back into parallel form by a universal asynchronous receiver/transmitter (UART before they may be directly connected to a data bus. Both Transmissions (Parallel and Serial are used to connect peripheral devices and enable us to communicate with these devices. The UART core described here is designed using VHDL and implemented on Xilinx Vertex FPGA.

  14. Asynchronous glaciation at Nanga Parbat, northwestern Himalaya Mountains, Pakistan

    Science.gov (United States)

    Phillips, William M.; Sloan, Valerie F.; Shroder, John F., Jr.; Sharma, Pankaj; Clarke, Michèle L.; Rendell, Helen M.

    2000-05-01

    We present a new glacial chronology demonstrating asynchroneity between advances of Himalayan glaciers and Northern Hemisphere ice-sheet volumes. Glaciers at Nanga Parbat expanded during the early to middle Holocene ca. 9.0 5.5 ka. No major advances at Nanga Parbat during the last global glacial stage of marine oxygen isotope stage 2 (MIS-2) between 24 and 11 ka were identified. Preliminary evidence also indicates advances between ca. 60 and 30 ka. These periods of high ice volume coincide with warm, wet regional climates dominated by a strong southwest Asian summer monsoon. The general lack of deposits dating from MIS-2 suggests that Nanga Parbat was too arid to support expanded ice during this period of low monsoon intensity. Advances during warm, wet periods are possible for the high-altitude summer accumulation glaciers typical of the Himalayas, and explain asynchronous behavior. However, the Holocene advances at Nanga Parbat appear to have been forced by an abrupt drop in temperature ca. 8.4 8.0 ka and an increase in winter precipitation ca. 7 5.5 ka. These results highlight the overall sensitivity of Himalayan glaciation to orbital forcing of monsoon intensity, and on millennial or shorter time scales, to changes in North Atlantic circulation.

  15. Asynchronous Code-Division Random Access Using Convex Optimization

    CERN Document Server

    Applebaum, Lorne; Duarte, Marco F; Calderbank, Robert

    2011-01-01

    Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of multiuser detection (MUD) in random access channels for such applications. Traditional orthogonal signaling ignores the random nature of user activity in this problem and limits the total number of users to be on the order of the number of signal space dimensions. Contention-based schemes, on the other hand, suffer from delays caused by colliding transmissions and the hidden node problem. In contrast, this paper presents a novel asynchronous (non-orthogonal) code-division random access scheme along with a convex optimization-based MUD algorithm that overcomes the issues associated with orthogonal signaling and contention-based methods. Two key distinguishing features of the proposed algorithm are that it does not require knowledge of the delay or channel state information of every user and it has polynomial-time com...

  16. Asynchronously sampled blind source separation for coherent optical links

    Science.gov (United States)

    Detwiler, Thomas F.; Searcy, Steven M.; Stark, Andrew J.; Ralph, Stephen E.; Basch, Bert E.

    2011-01-01

    Polarization multiplexing is an integral technique for generating spectrally efficient 100 Gb/s and higher optical links. Post coherent detection DSP-based polarization demultiplexing of QPSK links is commonly performed after timing recovery. We propose and demonstrate a method of asynchronous blind source separation using the constant modulus algorithm (CMA) on the asynchronously sampled signal to initially separate energy from arbitrarily aligned polarization states. This method lends well to implementation as it allows for an open-loop sampling frequency for analog-to-digital conversion at less than twice the symbol rate. We show that the performance of subsequent receiver functions is enhanced by the initial pol demux operation. CMA singularity behavior is avoided through tap settling constraints. The method is applicable to QPSK transmissions and many other modulation formats as well, including general QAM signals, offset-QPSK, and CPM, or a combination thereof. We present the architecture and its performance under several different formats and link conditions. Comparisons of complexity and performance are drawn between the proposed architecture and conventional receivers.

  17. Continuous EEG signal analysis for asynchronous BCI application.

    Science.gov (United States)

    Hsu, Wei-Yen

    2011-08-01

    In this study, we propose a two-stage recognition system for continuous analysis of electroencephalogram (EEG) signals. An independent component analysis (ICA) and correlation coefficient are used to automatically eliminate the electrooculography (EOG) artifacts. Based on the continuous wavelet transform (CWT) and Student's two-sample t-statistics, active segment selection then detects the location of active segment in the time-frequency domain. Next, multiresolution fractal feature vectors (MFFVs) are extracted with the proposed modified fractal dimension from wavelet data. Finally, the support vector machine (SVM) is adopted for the robust classification of MFFVs. The EEG signals are continuously analyzed in 1-s segments, and every 0.5 second moves forward to simulate asynchronous BCI works in the two-stage recognition architecture. The segment is first recognized as lifted or not in the first stage, and then is classified as left or right finger lifting at stage two if the segment is recognized as lifting in the first stage. Several statistical analyses are used to evaluate the performance of the proposed system. The results indicate that it is a promising system in the applications of asynchronous BCI work.

  18. COMPUTING

    CERN Multimedia

    I. Fisk

    2011-01-01

    Introduction It has been a very active quarter in Computing with interesting progress in all areas. The activity level at the computing facilities, driven by both organised processing from data operations and user analysis, has been steadily increasing. The large-scale production of simulated events that has been progressing throughout the fall is wrapping-up and reprocessing with pile-up will continue. A large reprocessing of all the proton-proton data has just been released and another will follow shortly. The number of analysis jobs by users each day, that was already hitting the computing model expectations at the time of ICHEP, is now 33% higher. We are expecting a busy holiday break to ensure samples are ready in time for the winter conferences. Heavy Ion The Tier 0 infrastructure was able to repack and promptly reconstruct heavy-ion collision data. Two copies were made of the data at CERN using a large CASTOR disk pool, and the core physics sample was replicated ...

  19. COMPUTING

    CERN Multimedia

    M. Kasemann

    Introduction More than seventy CMS collaborators attended the Computing and Offline Workshop in San Diego, California, April 20-24th to discuss the state of readiness of software and computing for collisions. Focus and priority were given to preparations for data taking and providing room for ample dialog between groups involved in Commissioning, Data Operations, Analysis and MC Production. Throughout the workshop, aspects of software, operating procedures and issues addressing all parts of the computing model were discussed. Plans for the CMS participation in STEP’09, the combined scale testing for all four experiments due in June 2009, were refined. The article in CMS Times by Frank Wuerthwein gave a good recap of the highly collaborative atmosphere of the workshop. Many thanks to UCSD and to the organizers for taking care of this workshop, which resulted in a long list of action items and was definitely a success. A considerable amount of effort and care is invested in the estimate of the co...

  20. COMPUTING

    CERN Multimedia

    I. Fisk

    2012-01-01

    Introduction Computing continued with a high level of activity over the winter in preparation for conferences and the start of the 2012 run. 2012 brings new challenges with a new energy, more complex events, and the need to make the best use of the available time before the Long Shutdown. We expect to be resource constrained on all tiers of the computing system in 2012 and are working to ensure the high-priority goals of CMS are not impacted. Heavy ions After a successful 2011 heavy-ion run, the programme is moving to analysis. During the run, the CAF resources were well used for prompt analysis. Since then in 2012 on average 200 job slots have been used continuously at Vanderbilt for analysis workflows. Operations Office As of 2012, the Computing Project emphasis has moved from commissioning to operation of the various systems. This is reflected in the new organisation structure where the Facilities and Data Operations tasks have been merged into a common Operations Office, which now covers everything ...

  1. COMPUTING

    CERN Multimedia

    M. Kasemann

    Introduction During the past six months, Computing participated in the STEP09 exercise, had a major involvement in the October exercise and has been working with CMS sites on improving open issues relevant for data taking. At the same time operations for MC production, real data reconstruction and re-reconstructions and data transfers at large scales were performed. STEP09 was successfully conducted in June as a joint exercise with ATLAS and the other experiments. It gave good indication about the readiness of the WLCG infrastructure with the two major LHC experiments stressing the reading, writing and processing of physics data. The October Exercise, in contrast, was conducted as an all-CMS exercise, where Physics, Computing and Offline worked on a common plan to exercise all steps to efficiently access and analyze data. As one of the major results, the CMS Tier-2s demonstrated to be fully capable for performing data analysis. In recent weeks, efforts were devoted to CMS Computing readiness. All th...

  2. COMPUTING

    CERN Multimedia

    P. McBride

    It has been a very active year for the computing project with strong contributions from members of the global community. The project has focused on site preparation and Monte Carlo production. The operations group has begun processing data from P5 as part of the global data commissioning. Improvements in transfer rates and site availability have been seen as computing sites across the globe prepare for large scale production and analysis as part of CSA07. Preparations for the upcoming Computing Software and Analysis Challenge CSA07 are progressing. Ian Fisk and Neil Geddes have been appointed as coordinators for the challenge. CSA07 will include production tests of the Tier-0 production system, reprocessing at the Tier-1 sites and Monte Carlo production at the Tier-2 sites. At the same time there will be a large analysis exercise at the Tier-2 centres. Pre-production simulation of the Monte Carlo events for the challenge is beginning. Scale tests of the Tier-0 will begin in mid-July and the challenge it...

  3. COMPUTING

    CERN Multimedia

    I. Fisk

    2010-01-01

    Introduction The first data taking period of November produced a first scientific paper, and this is a very satisfactory step for Computing. It also gave the invaluable opportunity to learn and debrief from this first, intense period, and make the necessary adaptations. The alarm procedures between different groups (DAQ, Physics, T0 processing, Alignment/calibration, T1 and T2 communications) have been reinforced. A major effort has also been invested into remodeling and optimizing operator tasks in all activities in Computing, in parallel with the recruitment of new Cat A operators. The teams are being completed and by mid year the new tasks will have been assigned. CRB (Computing Resource Board) The Board met twice since last CMS week. In December it reviewed the experience of the November data-taking period and could measure the positive improvements made for the site readiness. It also reviewed the policy under which Tier-2 are associated with Physics Groups. Such associations are decided twice per ye...

  4. COMPUTING

    CERN Multimedia

    M. Kasemann

    CCRC’08 challenges and CSA08 During the February campaign of the Common Computing readiness challenges (CCRC’08), the CMS computing team had achieved very good results. The link between the detector site and the Tier0 was tested by gradually increasing the number of parallel transfer streams well beyond the target. Tests covered the global robustness at the Tier0, processing a massive number of very large files and with a high writing speed to tapes.  Other tests covered the links between the different Tiers of the distributed infrastructure and the pre-staging and reprocessing capacity of the Tier1’s: response time, data transfer rate and success rate for Tape to Buffer staging of files kept exclusively on Tape were measured. In all cases, coordination with the sites was efficient and no serious problem was found. These successful preparations prepared the ground for the second phase of the CCRC’08 campaign, in May. The Computing Software and Analysis challen...

  5. An Asynchronous Neuromorphic Event-Driven Visual Part-Based Shape Tracking.

    Science.gov (United States)

    Reverter Valeiras, David; Lagorce, Xavier; Clady, Xavier; Bartolozzi, Chiara; Ieng, Sio-Hoi; Benosman, Ryad

    2015-12-01

    Object tracking is an important step in many artificial vision tasks. The current state-of-the-art implementations remain too computationally demanding for the problem to be solved in real time with high dynamics. This paper presents a novel real-time method for visual part-based tracking of complex objects from the output of an asynchronous event-based camera. This paper extends the pictorial structures model introduced by Fischler and Elschlager 40 years ago and introduces a new formulation of the problem, allowing the dynamic processing of visual input in real time at high temporal resolution using a conventional PC. It relies on the concept of representing an object as a set of basic elements linked by springs. These basic elements consist of simple trackers capable of successfully tracking a target with an ellipse-like shape at several kilohertz on a conventional computer. For each incoming event, the method updates the elastic connections established between the trackers and guarantees a desired geometric structure corresponding to the tracked object in real time. This introduces a high temporal elasticity to adapt to projective deformations of the tracked object in the focal plane. The elastic energy of this virtual mechanical system provides a quality criterion for tracking and can be used to determine whether the measured deformations are caused by the perspective projection of the perceived object or by occlusions. Experiments on real-world data show the robustness of the method in the context of dynamic face tracking.

  6. An asynchronous, pipelined, electronic acquisition system for Active Matrix Flat-Panel Imagers (AMFPIs)

    Energy Technology Data Exchange (ETDEWEB)

    Huang, W.; Antonuk, L.E. E-mail: antonuk@umich.edu; Berry, J.; Maolinbay, M.; Martelli, C.; Mody, P.; Nassif, S.; Yeakey, M

    1999-07-11

    The development of a full-custom electronic acquisition system designed for readout of large-area active matrix flat-panel imaging arrays is reported. The arrays, which comprise two-dimensional matrices of pixels utilizing amorphous silicon thin-film transistors, are themselves under development for a wide variety of X-ray imaging applications. The acquisition system was specifically designed to facilitate detailed, quantitative investigations of the properties of these novel imaging arrays and contains significant enhancements compared to a previously developed acquisition system. These enhancements include pipelined preamplifier circuits to allow faster readout speed, expanded addressing capabilities allowing a maximum of 4096 array data lines, and on-board summing of image frames. The values of many acquisition system parameters, including timings and voltages, may be specified and downloaded from a host computer. Once acquisition is enabled, the system operates asynchronously of its host computer. The system allows image capture in both radiographic mode (corresponding to the capture of individual X-ray images), and fluoroscopic mode (corresponding to the capture of a continual series of X-ray images). A detailed description of the system architecture and the underlying motivations for the design is reported in this paper. (author)

  7. COMPUTING

    CERN Multimedia

    I. Fisk

    2013-01-01

    Computing operation has been lower as the Run 1 samples are completing and smaller samples for upgrades and preparations are ramping up. Much of the computing activity is focusing on preparations for Run 2 and improvements in data access and flexibility of using resources. Operations Office Data processing was slow in the second half of 2013 with only the legacy re-reconstruction pass of 2011 data being processed at the sites.   Figure 1: MC production and processing was more in demand with a peak of over 750 Million GEN-SIM events in a single month.   Figure 2: The transfer system worked reliably and efficiently and transferred on average close to 520 TB per week with peaks at close to 1.2 PB.   Figure 3: The volume of data moved between CMS sites in the last six months   The tape utilisation was a focus for the operation teams with frequent deletion campaigns from deprecated 7 TeV MC GEN-SIM samples to INVALID datasets, which could be cleaned up...

  8. COMPUTING

    CERN Document Server

    I. Fisk

    2012-01-01

      Introduction Computing activity has been running at a sustained, high rate as we collect data at high luminosity, process simulation, and begin to process the parked data. The system is functional, though a number of improvements are planned during LS1. Many of the changes will impact users, we hope only in positive ways. We are trying to improve the distributed analysis tools as well as the ability to access more data samples more transparently.  Operations Office Figure 2: Number of events per month, for 2012 Since the June CMS Week, Computing Operations teams successfully completed data re-reconstruction passes and finished the CMSSW_53X MC campaign with over three billion events available in AOD format. Recorded data was successfully processed in parallel, exceeding 1.2 billion raw physics events per month for the first time in October 2012 due to the increase in data-parking rate. In parallel, large efforts were dedicated to WMAgent development and integrati...

  9. COMPUTING

    CERN Multimedia

    Matthias Kasemann

    Overview The main focus during the summer was to handle data coming from the detector and to perform Monte Carlo production. The lessons learned during the CCRC and CSA08 challenges in May were addressed by dedicated PADA campaigns lead by the Integration team. Big improvements were achieved in the stability and reliability of the CMS Tier1 and Tier2 centres by regular and systematic follow-up of faults and errors with the help of the Savannah bug tracking system. In preparation for data taking the roles of a Computing Run Coordinator and regular computing shifts monitoring the services and infrastructure as well as interfacing to the data operations tasks are being defined. The shift plan until the end of 2008 is being put together. User support worked on documentation and organized several training sessions. The ECoM task force delivered the report on “Use Cases for Start-up of pp Data-Taking” with recommendations and a set of tests to be performed for trigger rates much higher than the ...

  10. COMPUTING

    CERN Multimedia

    M. Kasemann

    Introduction A large fraction of the effort was focused during the last period into the preparation and monitoring of the February tests of Common VO Computing Readiness Challenge 08. CCRC08 is being run by the WLCG collaboration in two phases, between the centres and all experiments. The February test is dedicated to functionality tests, while the May challenge will consist of running at all centres and with full workflows. For this first period, a number of functionality checks of the computing power, data repositories and archives as well as network links are planned. This will help assess the reliability of the systems under a variety of loads, and identifying possible bottlenecks. Many tests are scheduled together with other VOs, allowing the full scale stress test. The data rates (writing, accessing and transfer¬ring) are being checked under a variety of loads and operating conditions, as well as the reliability and transfer rates of the links between Tier-0 and Tier-1s. In addition, the capa...

  11. COMPUTING

    CERN Multimedia

    Contributions from I. Fisk

    2012-01-01

    Introduction The start of the 2012 run has been busy for Computing. We have reconstructed, archived, and served a larger sample of new data than in 2011, and we are in the process of producing an even larger new sample of simulations at 8 TeV. The running conditions and system performance are largely what was anticipated in the plan, thanks to the hard work and preparation of many people. Heavy ions Heavy Ions has been actively analysing data and preparing for conferences.  Operations Office Figure 6: Transfers from all sites in the last 90 days For ICHEP and the Upgrade efforts, we needed to produce and process record amounts of MC samples while supporting the very successful data-taking. This was a large burden, especially on the team members. Nevertheless the last three months were very successful and the total output was phenomenal, thanks to our dedicated site admins who keep the sites operational and the computing project members who spend countless hours nursing the...

  12. COMPUTING

    CERN Multimedia

    P. MacBride

    The Computing Software and Analysis Challenge CSA07 has been the main focus of the Computing Project for the past few months. Activities began over the summer with the preparation of the Monte Carlo data sets for the challenge and tests of the new production system at the Tier-0 at CERN. The pre-challenge Monte Carlo production was done in several steps: physics generation, detector simulation, digitization, conversion to RAW format and the samples were run through the High Level Trigger (HLT). The data was then merged into three "Soups": Chowder (ALPGEN), Stew (Filtered Pythia) and Gumbo (Pythia). The challenge officially started when the first Chowder events were reconstructed on the Tier-0 on October 3rd. The data operations teams were very busy during the the challenge period. The MC production teams continued with signal production and processing while the Tier-0 and Tier-1 teams worked on splitting the Soups into Primary Data Sets (PDS), reconstruction and skimming. The storage sys...

  13. COMPUTING

    CERN Multimedia

    2010-01-01

    Introduction Just two months after the “LHC First Physics” event of 30th March, the analysis of the O(200) million 7 TeV collision events in CMS accumulated during the first 60 days is well under way. The consistency of the CMS computing model has been confirmed during these first weeks of data taking. This model is based on a hierarchy of use-cases deployed between the different tiers and, in particular, the distribution of RECO data to T1s, who then serve data on request to T2s, along a topology known as “fat tree”. Indeed, during this period this model was further extended by almost full “mesh” commissioning, meaning that RECO data were shipped to T2s whenever possible, enabling additional physics analyses compared with the “fat tree” model. Computing activities at the CMS Analysis Facility (CAF) have been marked by a good time response for a load almost evenly shared between ALCA (Alignment and Calibration tasks - highest p...

  14. Asynchronous API Pattern and its Application%异步接口模式及其应用

    Institute of Scientific and Technical Information of China (English)

    何华海; 丁柯

    2002-01-01

    In distributed systems,high efficiency can be achieved using asynchronous API between client and server.This paper provides an architectural pattern that implements asynchronous API generally. Asynchronous methods donot execute operations directly,however,they delegate the sending and receiving process to individual threads via aqueue ,the client deals with results by means of callback ,wait or check. Synchronous API is implemented on the baseof asynchronous API. Presently the asynchronous API pattern has been employed in the implementation of messagequeue middleware ISMQ.

  15. A New Design Methodology of Low Power Asynchronous Comparator%一种新型低功耗异步比较器的设计方法

    Institute of Scientific and Technical Information of China (English)

    姜小波; 叶德盛

    2012-01-01

    Two types of low-power asynchronous comparators named asynchronous ripple comparator and pre-stop asynchronous comparator are proposed based on the statistical characteristic of input data in the paper. The asynchronous ripple comparator stops computing at the first unequal bit, but it has to deliver the result to the LSB. The pre-stop asynchronous comparator is proposed by revising the truth table based on the new 2-bit comparison unit and stop judgment circuit. It can stop comparing at the first unequal bit and obtain the result immediately. The proposed and contrasn've comparators (BCL comparator and clock-gating comparator) are implemented with SMIC 0.18μm process. Simulation results show that the proposed pre-stop asynchronous comparator features the lowest power.It saves 87.1% ,84.5% and 37.5% ,28.6% power respectively compared to the synchronous BCL comparator and clock-gating comparator with random data and data from LDPC decoder.%本文利用输入数据的统计特性,设计了两种低功耗异步比较器——异步行波比较器和提前终止异步比较器.异步行波比较器从第一个不相等的数位开始停止运算,但要把结果传到最低位,消耗部分功耗.提前终止异步比较器通过修改真值表,基于新的比较单元电路和终止判断电路,在第一个不相等的数位停止运算并立即输出比较结果,节省不必要的功耗.新设计的异步比较器和用于对比的同步比较器(BCL比较器和门控时钟比较器)均用SMIC0.18μm工艺实现.仿真结果表明,提前终止异步比较器功耗最低,与同步BCL比较器和门控时钟比较器相比,在随机数据和来自LDPC解码器的数据下,分别节省了87.1%、84.5%和37.5%、28.6%的功耗.

  16. OT-Combiners Via Secure Computation

    DEFF Research Database (Denmark)

    Harnik, Danny; Ishai, Yuval; Kushilevitz, Eyal

    2008-01-01

    An OT-combiner implements a secure oblivious transfer (OT) protocol using oracle access to n OT-candidates of which at most t may be faulty. We introduce a new general approach for combining OTs by making a simple and modular use of protocols for secure computation. Specifically, we obtain an OT......, in a network consisting of a single OT-channel. Our approach applies both to the “semi-honest” and the “malicious” models of secure computation, yielding the corresponding types of OT-combiners. Instantiating our general approach with secure computation protocols from the literature, we conceptually simplify......-combiner from any instantiation of the following two ingredients: (1) a t-secure n-party protocol for the OT functionality, in a network consisting of secure point-to-point channels and a broadcast primitive; and (2) a secure two-party protocol for a functionality determined by the former multiparty protocol...

  17. COMPUTING

    CERN Multimedia

    I. Fisk

    2011-01-01

    Introduction The Computing Team successfully completed the storage, initial processing, and distribution for analysis of proton-proton data in 2011. There are still a variety of activities ongoing to support winter conference activities and preparations for 2012. Heavy ions The heavy-ion run for 2011 started in early November and has already demonstrated good machine performance and success of some of the more advanced workflows planned for 2011. Data collection will continue until early December. Facilities and Infrastructure Operations Operational and deployment support for WMAgent and WorkQueue+Request Manager components, routinely used in production by Data Operations, are provided. The GlideInWMS and components installation are now deployed at CERN, which is added to the GlideInWMS factory placed in the US. There has been new operational collaboration between the CERN team and the UCSD GlideIn factory operators, covering each others time zones by monitoring/debugging pilot jobs sent from the facto...

  18. Achievemrnt of asynchronous programming based On .NET platform%基于.NET平台的异步编程实现

    Institute of Scientific and Technical Information of China (English)

    周薇

    2013-01-01

    Developers are willing to write synchronization code since it is simple. If the request of user interfase cannot be responded quickly by the computer, the mouse will stop turning in circles, and then if double-tap on the interface is executed, the interface is greyed, and the"not responding"appears on title bar. However, the asynchronous programming can make time-consuming operation thread to run in the background, and make the developers to perform other threads at the same time. A method .NET platform-based asynchronous programming is given in this paper.%  开发人员都愿意编写同步代码的原因是简单.但是,如果电脑不能快速响应用户界面的请求,鼠标就会不停地转圈,若在界面上点两下,界面变灰,标题栏上将出现“没有响应”,然后使人束手无策.而异步编程则可使运行耗时的操作线程在后台运行,从而使开发人员在无需等待的同时,去执行其他的线程.为此,文中给出了基于.NET平台的异步编程实现方法.

  19. Vector control structure of an asynchronous motor at maximum torque

    Science.gov (United States)

    Chioncel, C. P.; Tirian, G. O.; Gillich, N.; Raduca, E.

    2016-02-01

    Vector control methods offer the possibility to gain high performance, being widely used. Certain applications require an optimum control in limit operating conditions, as, at maximum torque, that is not always satisfied. The paper presents how the voltage and the frequency for an asynchronous machine (ASM) operating at variable speed are determinate, with an accent on the method that keeps the rotor flux constant. The simulation analyses consider three load types: variable torque and speed, variable torque and constant speed, constant torque and variable speed. The final values of frequency and voltage are obtained through the proposed control schemes with one controller using the simulation language based on the Maple module. The dynamic analysis of the system is done for the case with P and PI controller and allows conclusions on the proposed method, which can have different applications, as the ASM in wind turbines.

  20. Realization of station for testing asynchronous three-phase motors

    Science.gov (United States)

    Wróbel, A.; Surma, W.

    2016-08-01

    Nowadays, you cannot imagine the construction and operation of machines without the use of electric motors [13-15]. The proposed position is designed to allow testing of asynchronous three-phase motors. The position consists of a tested engine and the engine running as a load, both engines combined with a mechanical clutch [2]. The value of the load is recorded by measuring shaft created with Strain Gauge Bridge. This concept will allow to study the basic parameters of the engines, visualization motor parameters both vector and scalar controlled, during varying load drive system. In addition, registration during the variable physical parameters of the working electric motor, controlled by a frequency converter or controlled by a contactor will be possible. Position is designed as a teaching and research position to characterize the engines. It will be also possible selection of inverter parameters.

  1. Asynchronous Multilateral Control for Simplified Walking Haptic System

    Science.gov (United States)

    Okura, Takeshi; Katsura, Seiichiro

    Recently, there has been extensive development in remote communication technologies such as telephone, radio, and television. Haptic information is studied as the third type of multimedia information. Real-world haptics is getting attention not only for the feedback of real-world haptic information in teleoperation but also as the key technology for future human support. Most of the objects of study in haptics are stationary. Therefore, the moving range of such haptic systems is limited. This paper proposes a novel haptic device that receives force feedback of walking motion from a remote environment and manipulates remote system. Thus, its moving range is unrestricted. To drive this haptic system, the paper also proposes asynchronous multilateral control. By using this control, an operator can operate the remote system without changing his/her position. The proposed haptic system is expected to act as an effective interface for virtual reality applications and teleoperation.

  2. Research on the displacement control method of asynchronous modular contactor

    Science.gov (United States)

    He, Gong; Ming, Zong

    2017-01-01

    Ac contactor is a kind of low voltage electrical appliances with large usage and wide application. Because of the frequent operation, contactor life must be long enough to ensure the reliable operation of power system. The electrical life of the contactor, as the key to affect the service life of the contactor, is mainly affected by the arc developed in the breaking and closing course. This paper concentrates on a new type of asynchronous modular contactor. To get the contactor movement characteristics, the dynamic model of the electromagnetic system is established by MATLAB/SIMULINK. Then, according to the displacement curve of contactor, the breaking process and closing process is planned. The thought of closed loop control, by adjusting the parameters of PID controller, enables the contactor to operate as the planning displacement curve. In addition, to achieve no arc or micro arc breaking and no bounce or micro bounce closing , a displacement closed loop control system for contactor is designed.

  3. New Approach to the Power Selection for Asynchronous Motor

    Institute of Scientific and Technical Information of China (English)

    高建华; 胡洪国; 杨汝清

    2001-01-01

    The heating calculation of three-phase squirrel- cage asynchronous motor on the condition of starting for a prescribed rotary angle is firstly studied with time dissection method and its corresponding algorithm is provided. Then based upon the algorithm, a new method for motor power selection is established. Motor initial power determined by load power ischecked and modified in terms of time crit erion, heating criterion,and starting torque criterion.An appropriate motor power which meets three criterions is obtained at last, in the meantime, working displacement matrix andfrequency matrix used for control are acquired. Lifting motor of MDJ1800 low-level high- speed palletizer is taken as a reaI case in the paper.

  4. Numerical Simulation of Asynchronous Simulated Moving Bed Chromatography

    Institute of Scientific and Technical Information of China (English)

    卢建刚

    2004-01-01

    Asynchronous simulated moving bed chromatography (ASMBC), known also as the "VARICOL" process, is more efficient and flexible than the well-known and traditional simulated moving bed chromatography (SMBC). A detailed model of ASMBC, taking account of non-linear competitive isotherms, mass transfer parameters, and complex port switching schedule parameters, was developed to simulate the complex dynamics of ASMBC.The simulated performance is in close agreement with the experimental data of chiral separation reported in the literature. The simulation results show that ASMBC can achieve the performance similar to SMBC with fewer columns and can achieve better performance than SMBC with the same total column number. All design and operation parameters can be chosen correctly by numerical simulation. This detailed ASMBC model and the numerical technique are useful for design, operation, optimization and scale-up of ASMBC.

  5. Indoor Positioning for Smartphones Using Asynchronous Ultrasound Trilateration

    Directory of Open Access Journals (Sweden)

    James D. Carswell

    2013-06-01

    Full Text Available Modern smartphones are a great platform for Location Based Services (LBS. While outdoor LBS for smartphones has proven to be very successful, indoor LBS for smartphones has not yet fully developed due to the lack of an accurate positioning technology. In this paper we present an accurate indoor positioning approach for commercial off-the-shelf (COTS smartphones that uses the innate ability of mobile phones to produce ultrasound, combined with Time-Difference-of-Arrival (TDOA asynchronous trilateration. We evaluate our indoor positioning approach by describing its strengths and weaknesses, and determine its absolute accuracy. This is accomplished through a range of experiments that involve variables such as position of control point microphones, position of phone within the room, direction speaker is facing and presence of user in the signal path. Test results show that our Lok8 (locate mobile positioning system can achieve accuracies better than 10 cm in a real-world environment.

  6. Research on DSP-based Asynchronous Motor Control Technology

    Directory of Open Access Journals (Sweden)

    Jun Yao

    2013-05-01

    Full Text Available The Motor in a variety of electrical transmission and position servo system occupies an extremely important position. After the DSP technology being applied to the motor control, the unification of the hardware and the flexibility of the software can be combined. Take the brushless DC motor for example, studied the mathematical model and the structure of the motor control system, also obtained the design scheme of the DSP-based asynchronous motor control system. With TI's 32 bit fixed point DSPTMS320F2812 as the core design of the hardware system, we wrote the system software, debug the motor control system and the results show that the system achieves the expected effect. The results of the research can be applied to brushless DC motor and other motor control, it will have a wide application prospects.

  7. Label-acquired magnetorotation for biosensing: An asynchronous rotation assay

    Energy Technology Data Exchange (ETDEWEB)

    Hecht, Ariel, E-mail: hecht@umich.ed [University of Michigan, Department of Biomedical Engineering, 2200 Bonisteel, Ann Arbor, MI 48109-2099 (United States); University of Michigan, Department of Chemistry, 930 North University, Ann Arbor, MI 48109-1055 (United States); Kinnunen, Paivo, E-mail: pkkinn@umich.ed [University of Michigan, Department of Chemistry, 930 North University, Ann Arbor, MI 48109-1055 (United States); University of Michigan, Applied Physics Program, 2477 Randall Laboratory, Ann Arbor, MI 48109-1120 (United States); McNaughton, Brandon, E-mail: bmcnaugh@umich.ed [University of Michigan, Department of Biomedical Engineering, 2200 Bonisteel, Ann Arbor, MI 48109-2099 (United States); University of Michigan, Department of Chemistry, 930 North University, Ann Arbor, MI 48109-1055 (United States); University of Michigan, Applied Physics Program, 2477 Randall Laboratory, Ann Arbor, MI 48109-1120 (United States); Kopelman, Raoul, E-mail: kopelman@umich.ed [University of Michigan, Department of Biomedical Engineering, 2200 Bonisteel, Ann Arbor, MI 48109-2099 (United States); University of Michigan, Department of Chemistry, 930 North University, Ann Arbor, MI 48109-1055 (United States); University of Michigan, Applied Physics Program, 2477 Randall Laboratory, Ann Arbor, MI 48109-1120 (United States)

    2011-02-15

    This paper presents a novel application of magnetic particles for biosensing, called label-acquired magnetorotation (LAM). This method is based on a combination of the traditional sandwich assay format with the asynchronous magnetic bead rotation (AMBR) method. In label-acquired magnetorotation, an analyte facilitates the binding of a magnetic label bead to a nonmagnetic solid phase sphere, forming a sandwich complex. The sandwich complex is then placed in a rotating magnetic field, where the rotational frequency of the sandwich complex is a function of the amount of analyte attached to the surface of the sphere. Here, we use streptavidin-coated beads and biotin-coated particles as analyte mimics, to be replaced by proteins and other biological targets in future work. We show this sensing method to have a dynamic range of two orders of magnitude.

  8. H∞ Controller Design for Asynchronous Hybrid Systems with Multiple Delays

    Directory of Open Access Journals (Sweden)

    Xiaoqiang Sun

    2016-01-01

    Full Text Available Solutions for the H∞ synthesis problems of asynchronous hybrid systems with input-output delays are proposed. The continuous-time lifting approach of sampled-data systems is extended to a hybrid system with multiple delays, and some feasible formulas to calculate the operators of the equivalent discrete-time (DT system are given. Different from the existing methods derived from symplectic pair theory or by state augmentation, a Lyapunov-Krasovskii functional to solve the synthesis problem is explicitly constructed. The delay-dependent stability conditions we obtained can be described in terms of nonstrict linear matrix inequalities (LMIs, which are much more convenient to be solved by LMI tools.

  9. Profiling individual discussants’ behaviours in online asynchronous discussions

    Directory of Open Access Journals (Sweden)

    Elizabeth Murphy

    2006-06-01

    Full Text Available This paper provides an illustrative example of an approach to creating and reporting individual profiles of engagement in particular behaviours in an online asynchronous discussion (OAD. Individual results of analysis of transcripts of an OAD can provide insights different from those gained by focusing on aggregate measures of group behaviours. In this case, we focused on individual behaviours associated with Problem Formulation and Resolution (PFR in a one-month long OAD with seven graduate students. The transcripts of each participant were analysed for patterns of PFR behaviours using a previously designed instrument. Individual profiles of the seven participants were created. The paper provides examples of how the approach facilitated identification and comparison of individual weaknesses and strengths. Also provided are examples of how individual profiles might be useful in professional development and instructional contexts for formative or summative assessment purposes.

  10. The Efficacy of Deliberate Practice Delivered Using Asynchronous Training Technology

    Directory of Open Access Journals (Sweden)

    Colleen E. McEdwards

    2014-04-01

    Full Text Available Employee productivity is key to survival in business. Senior employees require access to advanced training that does not necessitate extended periods away from their work. Once performance begins to plateau, it can be difficult to reach experienced employees with cost-effective, timely, and relevant training opportunities. Organizations must find ways to enhance employee performance; however, research suggests workplace training is too expensive and is too often without lasting benefit. The purpose of this study is to further quantify deliberate practice as a potentially efficient, customizable mode of training using asynchronous e-learning. The study compared traditional seminars with online deliberate practice training. While additional research is needed in wider learning contexts and with larger sample sizes, improvements among the deliberate practice groups were significant. Using a mixed methods pretest/posttest research design, the deliberate practice training showed improved performance and increased satisfaction compared with the traditional seminar approach.

  11. Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks

    CERN Document Server

    Dereniowski, Dariusz

    2012-01-01

    We study the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph and share it with other agents to accomplish leader election. This can be done using meetings of agents, which is difficult because of their asynchronous nature: an adversary has total control over the speed of agents. When can a leader be elected in this adversarial scenario and how to do it? We give a complete answer to this question by characterizing all initial configurations for which leader election is possible and by constructing an algorithm that accomplishes leader election for all configurations for which this can be done.

  12. Asynchronous learning: student utilization out of sync with their preference

    Directory of Open Access Journals (Sweden)

    Edward K. Lew

    2016-06-01

    Full Text Available Background: Asynchronous learning is gaining popularity. Data are limited regarding this learning method in medical students rotating in emergency medicine (EM. In EM, faculty time is limited to give in-person lectures. The authors sought to create an online curriculum that students could utilize as an additional learning modality. Objective: The goal was to evaluate effectiveness, participation, and preference for this mode of learning. Methods: We developed five online, narrated PowerPoint presentations. After orientation, access to the online curriculum was provided to the students, which they could review at their leisure. Results: One hundred and seven fourth-year medical students participated. They reported the curriculum to be of high quality. Pretest scores were similar for those that viewed all lectures – compliant group (CG (9.5 [CI 4.8–14.1] and those that did not view any – non-compliant group (NCG (9.6 [CI 5.9–13.4]. There was no statistical significant difference in posttest scores between the groups although there was improvement overall: CG 14.6 (CI 6.9–22.1; NCG 11.4 (CI 5.7–17.1. A majority (69.2% favored inclusion of asynchronous learning, but less than a quarter (22.4% reported viewing all five modules and more than a third (36.4% viewed none. Conclusion: Despite student-expressed preference for an online curriculum, they used the online resource less than expected. This should give pause to educators looking to convert core EM topics to an online format. However, when high-quality online lectures are utilized as a learning tool, this study demonstrates that they had neither a positive nor a negative impact on test scores.

  13. UNIVERSAL REGULAR AUTONOMOUS ASYNCHRONOUS SYSTEMS: ω-LIMIT SETS, INVARIANCE AND BASINS OF ATTRACTION

    Directory of Open Access Journals (Sweden)

    Serban Vlad

    2011-07-01

    Full Text Available The asynchronous systems are the non-deterministic real timebinarymodels of the asynchronous circuits from electrical engineering.Autonomy means that the circuits and their models have no input.Regularity means analogies with the dynamical systems, thus such systems may be considered to be real time dynamical systems with a’vector field’, Universality refers to the case when the state space of the system is the greatest possible in the sense of theinclusion. The purpose of this paper is that of defining, by analogy with the dynamical systems theory, the omega-limit sets, the invariance and the basins of attraction of the universal regular autonomous asynchronous systems.

  14. Argo: A Time-Elastic Time-Division-Multiplexed NOC using Asynchronous Routers

    DEFF Research Database (Denmark)

    Kasapaki, Evangelia; Sparsø, Jens

    2014-01-01

    In this paper we explore the use of asynchronous routers in a time-division-multiplexed (TDM) network-on-chip (NOC), Argo, that is being developed for a multi-processor platform for hard real-time systems. TDM inherently requires a common time reference, and existing TDM-based NOC designs...... are either synchronous or mesochronous. We use asynchronous routers to achieve a simpler, smaller, and more robust, self-timed design. Our design exploits the fact that pipelined asynchronous circuits also behave as ripple FIFOs. Thus, it avoids the need for explicit synchronization FIFOs between the routers...

  15. Escogiendo ministros y formando políticos: los partidos en gabinetes multipartidistas Ministry selection and politics training: political parties in multiparty cabinets

    Directory of Open Access Journals (Sweden)

    Magna INÁCIO

    2013-07-01

    Full Text Available El artículo examina la elección de los ministros y estima las posibilidades de selección de los políticos profesionales vis-à-vis la selección de técnicos o políticos novatos en gabinetes multipartidistas. La selección ministerial es analizada como un cálculo partidario para convertir la designación ministerial en un recurso para la retención y/o proyección de sus cuadros partidarios. Se testearon dos hipótesis: a la lealtad, los vínculos partidarios y la pertenencia a partidos competitivos aumentan las chances de selección de políticos profesionales para el cargo de ministro; b las probabilidades de selección de políticos novatos o tecnócratas aumentan con la expertise o la pertenencia a partidos en fase de expansión organizacional. El análisis se concentra en los gobiernos multipartidistas formados en Brasil (1995-2010. Los resultados muestran que la trayectoria dentro del partido es decisiva para la selección de políticos profesionales, mientras que la pertenencia al partido del presidente favorece el ingreso de nuevos cuadros en el gobierno. El estudio presenta evidencias sobre la complejidad de la selección ministerial en gabinetes multipartidistas a la luz de los dilemas organizacionales enfrentados por los partidos.The article examines the ministerial selection and estimates the chances of selection of professional politicians vis-à-vis the selection of technocrats or political novice in multiparty cabinets. The ministerial selection is analyzed as a supporter calculation to convert the ministerial appointment a resource for retention and/or projection of their party cadres. Two hypotheses were tested: (a loyalty, the bonds belonging to supporters and parties increase the chances of competitive selection of professional politicians for the posts of ministers; (b the chances of selection of political novices or technocrats increase with expertise and membership of parties under organizational expansion. The

  16. COMPUTING

    CERN Multimedia

    M. Kasemann

    CMS relies on a well functioning, distributed computing infrastructure. The Site Availability Monitoring (SAM) and the Job Robot submission have been very instrumental for site commissioning in order to increase availability of more sites such that they are available to participate in CSA07 and are ready to be used for analysis. The commissioning process has been further developed, including "lessons learned" documentation via the CMS twiki. Recently the visualization, presentation and summarizing of SAM tests for sites has been redesigned, it is now developed by the central ARDA project of WLCG. Work to test the new gLite Workload Management System was performed; a 4 times increase in throughput with respect to LCG Resource Broker is observed. CMS has designed and launched a new-generation traffic load generator called "LoadTest" to commission and to keep exercised all data transfer routes in the CMS PhE-DEx topology. Since mid-February, a transfer volume of about 12 P...

  17. Purposeful use of a non-restrictive, asynchronous public Web-based forum for facilitating reflective discourse with preservice science teachers

    Science.gov (United States)

    Bodzin, Alec Michael

    The purpose of this research has been to investigate the purposeful use of asynchronous telecommunications in a science education methods/curriculum course involving the use of a non-restrictive, public Web based forum for facilitating reflective discourse with preservice science teachers. Thirty-two preservice secondary school science teachers participated in a public science teaching forum on the World Wide Web during their student teaching internship. The forum was designed with NetForum software to be a place where science teachers share ideas, reflections and conversations on teaching and implementation of technology in the classroom and other instructional pedagogy, while also providing support for each other as members of an electronic professional community. A combination of quantitative and qualitative research methods were used to explore interaction patterns that facilitated collaborative preservice teacher reflective discourse on the forum and participants' attitudes towards using asynchronous telecommunications during their student teaching internship. Data from forum discourse analysis, interviews, and survey instruments illustrate that the use of this asynchronous Web-based forum provided the participants the opportunity to discuss and examine science concepts and reflect on classroom issues that were directly relevant to their student teaching experiences. The findings revealed that most participants had positive attitudes with respect to interacting with the Web-based forum. Furthermore, there were no significant differences in attitude between participants who had access to a networked computer and those who did not have access. An analysis of the forum postings showed that saturation in the discourse can occur with large groups participating in online asynchronous conversations.

  18. Asynchronous Sensor fuSion for Improved Safety of air Traffic (ASSIST) Project

    Data.gov (United States)

    National Aeronautics and Space Administration — SSCI proposes to develop, implement and test a collision detection system for unmanned aerial vehicles (UAV), referred to as the Asynchronous Sensor fuSion for...

  19. Distributed Consensus of Stochastic Delayed Multi-agent Systems Under Asynchronous Switching.

    Science.gov (United States)

    Wu, Xiaotai; Tang, Yang; Cao, Jinde; Zhang, Wenbing

    2016-08-01

    In this paper, the distributed exponential consensus of stochastic delayed multi-agent systems with nonlinear dynamics is investigated under asynchronous switching. The asynchronous switching considered here is to account for the time of identifying the active modes of multi-agent systems. After receipt of confirmation of mode's switching, the matched controller can be applied, which means that the switching time of the matched controller in each node usually lags behind that of system switching. In order to handle the coexistence of switched signals and stochastic disturbances, a comparison principle of stochastic switched delayed systems is first proved. By means of this extended comparison principle, several easy to verified conditions for the existence of an asynchronously switched distributed controller are derived such that stochastic delayed multi-agent systems with asynchronous switching and nonlinear dynamics can achieve global exponential consensus. Two examples are given to illustrate the effectiveness of the proposed method.

  20. Asynchronous Free-Space Optical CDMA Communications System for Last-mile Access Network

    DEFF Research Database (Denmark)

    Jurado-Navas, Antonio; Raddo, Thiago R.; Sanches, Anderson L.

    2016-01-01

    We propose a new hybrid asynchronous OCDMA-FSO communications system for access network solutions. New ABER expressions are derived under gamma-gamma scintillation channels, where all users can surprisingly achieve error-free transmissions when FEC is employed....

  1. Low-power Implementation of an Encryption/Decryption System with Asynchronous Techniques

    Directory of Open Access Journals (Sweden)

    Nikos Sklavos

    2002-01-01

    Full Text Available An asynchronous VLSI implementation of the International Data Encryption Algorithm (IDEA is presented in this paper. In order to evaluate the asynchronous design a synchronous version of the algorithm was also designed. VHDL hardware description language was used in order to describe the algorithm. By using Synopsys commercial available tools the VHDL code was synthesized. After placing and routing both designs were fabricated with 0.6 μm CMOS technology. With a system clock of up to 8 MHz and a power supply of 5 V the two chips were tested and evaluated comparing with the software implementation of the IDEA algorithm. This new approach proves efficiently the lowest power consumption of the asynchronous implementation compared to the existing synchronous. Therefore, the asynchronous chip performs efficiently in Wireless Encryption Protocols and high speed networks.

  2. ZONES OF STEADY CAPACITOR EXCITATION IN A MODE OF GENERATION OF TYPICAL ASYNCHRONOUS MACHINES

    Directory of Open Access Journals (Sweden)

    Postoronca Sv.

    2009-12-01

    Full Text Available In work some features of a mode of capacitor excitation of industrial asynchronous electric motors, and also generators made on their base which can be used in wind installations of low power are considered. Borders of zones of steady capacitor excitation of asynchronous electric motors in rated power of 0,25-22,0 kW and generators made on their base, and also character of influence of own losses and active capacity of loading of the equivalent circuit of the asynchronous machine resulted in parameters have been determined. Some recommendations after maintenance of stability of capacitor excitation of asynchronous machines for work in a mode of generation of electric energy are given.

  3. A reverse mode of three-phase asynchronous motors with hexaphase windings

    Directory of Open Access Journals (Sweden)

    V.D. Lushchyk

    2014-04-01

    Full Text Available A reverse operation feasibility in three-phase asynchronous motors with the stator hexaphase windings is proved. In the reverse mode, the hexaphase windings are shown to keep all their declared advantages.

  4. Asynchronous abdomino-parasacral resection of a giant pelvic lipoma protruding to the left buttock

    Directory of Open Access Journals (Sweden)

    Masanori Sato

    2014-01-01

    CONCLUSION: The asynchronous abdomino-parasacral approach with several turnings of the patient's body and plastic bag packing of the tumor were advantageous to manage en bloc resection of the giant pelvic lipoma presented in this case study.

  5. Secure Electronic Voting Scheme Based on Multi-party Ranking%基于多方排序协议的安全电子投票方案

    Institute of Scientific and Technical Information of China (English)

    杨婷婷; 林昌露; 刘忆宁; 张胜元

    2015-01-01

    Compared with the traditional voting, electronic voting(e-voting) not only has many advantages, but also exists many security problems. The full privacy of electronic voting is an important index to evaluate the security of the voting scheme, it implies the privacy of the voters and candidates for privacy protection, especially the protection of total votes for the losers. This paper designs a secure multi-party ranking protocol via using the verifiable secret sharing. We propose a new secure electronic voting scheme based on the proposed multi-party ranking protocol. The e-voting scheme is full privacy.%与传统投票相比较, 电子投票拥有许多优势, 也存在重要的安全问题. 电子投票的全隐私性是评估投票方案安全的重要指标, 它是指对投票者的隐私保护和候选者的隐私保护, 特别是落选者的得票数的保护. 利用可验证秘密共享的思想提出了一个安全多方排序协议, 并将它运用到电子投票中, 设计了一个新的安全的电子投票协议, 本协议具有全隐私性.

  6. Blind Synchronization in Asynchronous UWB Networks Based on the Transmit-Reference Scheme

    Directory of Open Access Journals (Sweden)

    Leus Geert

    2006-01-01

    Full Text Available Ultra-wideband (UWB wireless communication systems are based on the transmission of extremely narrow pulses, with a duration inferior to a nanosecond. The application of transmit reference (TR to UWB systems allows to side-step channel estimation at the receiver, with a tradeoff of the effective transmission bandwidth, which is reduced by the usage of a reference pulse. Similar to CDMA systems, different users can share the same available bandwidth by means of different spreading codes. This allows the receiver to separate users, and to recover the timing information of the transmitted data packets. The nature of UWB transmissions—short, burst-like packets—requires a fast synchronization algorithm, that can accommodate several asynchronous users. Exploiting the fact that a shift in time corresponds to a phase rotation in the frequency domain, a blind and computationally effcient synchronization algorithm that takes advantage of the shift invariance structure in the frequency domain is proposed in this paper. Integer and fractional delay estimations are considered, along with a subsequent symbol estimation step. This results in a collision-avoiding multiuser algorithm, readily applicable to a fast acquisition procedure in a UWB ad hoc network.

  7. Conceptualising and measuring collaborative critical thinking on asynchronous discussion forums: Challenges and possible solutions

    Directory of Open Access Journals (Sweden)

    Nazanin Ghodrati

    2015-04-01

    Full Text Available The use of asynchronous discussion forums (ADFs is thought to assist in enhancing students’ collaborative learning and critical thinking throughout higher education. However, previous research has mainly focused on individual critical thinking while the investigation of critical thinking during group work has been generally overlooked. Furthermore, few studies have investigated critical thinking processes of the individual and of the group in a single study to present a comprehensive picture of collaborative critical thinking (CCT. To address these gaps, I examined the demonstration of CCT on ADFs in a graduate subject at an Australian university over two academic semesters as students discussed topics online. In this paper, I discuss the ontological and methodological challenges in conducting the above research and present possible solutions to these challenges. At the ontological level, I discuss challenges in conceptualising and defining CCT. At the methodological level, I present challenges in constructing a coding scheme to measure the demonstration of CCT on ADFs. I then discuss ways to tackle the above challenges, propose an operational definition of CCT and present a synthetic coding scheme for measuring CCT in computer-supported collaborative learning contexts such as on ADFs.

  8. SocialRAD: an infrastructure for a secure, cooperative, asynchronous teleradiology system.

    Science.gov (United States)

    Figueiredo, João Filho Matos; Motta, Gustavo Henrique Matos Bezerra

    2013-01-01

    The popularity of teleradiology services has enabled a major advance in the provision of health services to areas with difficult geographical access. However, this potential has also brought with it a number of challenges: the large volume of data, characteristic of imaging tests, and security requirements designed to ensure confidentiality and integrity. Moreover, there is also a number of ethical questions involving the dominant model on the market, whereby this service is outsourced to private companies, and is not directly undertaken by professional radiologists. Therefore, the present paper proposes a cooperative model of teleradiology, where health professionals interact directly with the hospitals providing patient care. This has involved the integration of a wide range of technologies, such as the interconnection models Peer-to-Peer, Cloud Computing, Dynamic DNS, RESTful Web Services, as well as security and interoperability standards, with the aim of promoting a secure, collaborative asynchronous environment. The developed model is currently being used on an experimental basis, providing teleradiology support to cities in the north-eastern hinterland of Brazil, and is fulfilling all expectations.

  9. Differentiating closed-loop cortical intention from rest: building an asynchronous electrocorticographic BCI

    Science.gov (United States)

    Williams, Jordan J.; Rouse, Adam G.; Thongpang, Sanitta; Williams, Justin C.; Moran, Daniel W.

    2013-08-01

    Objective. Recent experiments have shown that electrocorticography (ECoG) can provide robust control signals for a brain-computer interface (BCI). Strategies that attempt to adapt a BCI control algorithm by learning from past trials often assume that the subject is attending to each training trial. Likewise, automatic disabling of movement control would be desirable during resting periods when random brain fluctuations might cause unintended movements of a device. To this end, our goal was to identify ECoG differences that arise between periods of active BCI use and rest. Approach. We examined spectral differences in multi-channel, epidural micro-ECoG signals recorded from non-human primates when rest periods were interleaved between blocks of an active BCI control task. Main Results. Post-hoc analyses demonstrated that these states can be decoded accurately on both a trial-by-trial and real-time basis, and this discriminability remains robust over a period of weeks. In addition, high gamma frequencies showed greater modulation with desired movement direction, while lower frequency components demonstrated greater amplitude differences between task and rest periods, suggesting possible specialized BCI roles for these frequencies. Significance. The results presented here provide valuable insight into the neurophysiology of BCI control as well as important considerations toward the design of an asynchronous BCI system.

  10. An Asynchronous Many-Task Implementation of In-Situ Statistical Analysis using Legion.

    Energy Technology Data Exchange (ETDEWEB)

    Pebay, Philippe Pierre [Sandia National Lab. (SNL-CA), Livermore, CA (United States); Bennett, Janine Camille [Sandia National Lab. (SNL-CA), Livermore, CA (United States)

    2015-11-01

    In this report, we propose a framework for the design and implementation of in-situ analy- ses using an asynchronous many-task (AMT) model, using the Legion programming model together with the MiniAero mini-application as a surrogate for full-scale parallel scientific computing applications. The bulk of this work consists of converting the Learn/Derive/Assess model which we had initially developed for parallel statistical analysis using MPI [PTBM11], from a SPMD to an AMT model. In this goal, we propose an original use of the concept of Legion logical regions as a replacement for the parallel communication schemes used for the only operation of the statistics engines that require explicit communication. We then evaluate this proposed scheme in a shared memory environment, using the Legion port of MiniAero as a proxy for a full-scale scientific application, as a means to provide input data sets of variable size for the in-situ statistical analyses in an AMT context. We demonstrate in particular that the approach has merit, and warrants further investigation, in collaboration with ongoing efforts to improve the overall parallel performance of the Legion system.

  11. A new heterogeneous asynchronous explicit-implicit time integrator for nonsmooth dynamics

    Science.gov (United States)

    Fekak, Fatima-Ezzahra; Brun, Michael; Gravouil, Anthony; Depale, Bruno

    2017-03-01

    In computational structural dynamics, particularly in the presence of nonsmooth behavior, the choice of the time-step and the time integrator has a critical impact on the feasibility of the simulation. Furthermore, in some cases, as in the case of a bridge crane under seismic loading, multiple time-scales coexist in the same problem. In that case, the use of multi-time scale methods is suitable. Here, we propose a new explicit-implicit heterogeneous asynchronous time integrator (HATI) for nonsmooth transient dynamics with frictionless unilateral contacts and impacts. Furthermore, we present a new explicit time integrator for contact/impact problems where the contact constraints are enforced using a Lagrange multiplier method. In other words, the aim of this paper consists in using an explicit time integrator with a fine time scale in the contact area for reproducing high frequency phenomena, while an implicit time integrator is adopted in the other parts in order to reproduce much low frequency phenomena and to optimize the CPU time. In a first step, the explicit time integrator is tested on a one-dimensional example and compared to Moreau-Jean's event-capturing schemes. The explicit algorithm is found to be very accurate and the scheme has generally a higher order of convergence than Moreau-Jean's schemes and provides also an excellent energy behavior. Then, the two time scales explicit-implicit HATI is applied to the numerical example of a bridge crane under seismic loading. The results are validated in comparison to a fine scale full explicit computation. The energy dissipated in the implicit-explicit interface is well controlled and the computational time is lower than a full-explicit simulation.

  12. INVESTIGATION OF ASYNCHRONOUS OPTICAL COMMUNICATION CHANNEL THROUGHPUT CONTAINING A RECEIVER ON THE BASIS OF PHOTON COUNTER

    Directory of Open Access Journals (Sweden)

    I. R. Gulakov

    2013-01-01

    Full Text Available A mathematical model of asynchronous optical communication channel with a photon counter applied as a receiving module has been built. The expression for calculating of data throughput of this channel has been obtained. As a result of implemented experimental investigations it has been established that the data throughput of asynchronous optical communication channel containing a photon counter on the basis of avalanche photodetector as a receiving module depends on optical radiation and photodetector supply voltage.

  13. D-MG Tradeoff of DF and AF Relaying Protocols over Asynchronous PAM Cooperative Networks

    OpenAIRE

    Torbatian, Mehdi; Damen, Mohamed Oussama

    2009-01-01

    The diversity multiplexing tradeoff of a general two-hop asynchronous cooperative network is examined for various relaying protocols such as non-orthogonal selection decode-and-forward (NSDF), orthogonal selection decode-and-forward (OSDF), non-orthogonal amplify-and-forward (NAF), and orthogonal amplify-and-forward (OAF). The transmitter nodes are assumed to send pulse amplitude modulation (PAM) signals asynchronously, in which information symbols are linearly modulated by a shaping waveform...

  14. Universal asynchronous RSFQ gate for realization of Boolean functions of dual-rail binary variables

    Energy Technology Data Exchange (ETDEWEB)

    Dimov, B [University of Technology Ilmenau, Institute for Information Technology, PO Box 100565, D-98684 Ilmenau (Germany); Khabipov, M [Physikalisch-Technische Bundesanstalt, Division 2.42, Bundesallee 100, D-38116 Braunschweig (Germany); Balashov, D [Physikalisch-Technische Bundesanstalt, Division 2.42, Bundesallee 100, D-38116 Braunschweig (Germany); Brandt, C M [Physikalisch-Technische Bundesanstalt, Division 2.42, Bundesallee 100, D-38116 Braunschweig (Germany); Ortlepp, Th [University of Technology Ilmenau, Institute for Information Technology, PO Box 100565, D-98684 Ilmenau (Germany); Hagedorn, D [Physikalisch-Technische Bundesanstalt, Division 2.42, Bundesallee 100, D-38116 Braunschweig (Germany); Buchholz, F-Im [Physikalisch-Technische Bundesanstalt, Division 2.42, Bundesallee 100, D-38116 Braunschweig (Germany); Niemeyer, J [Physikalisch-Technische Bundesanstalt, Division 2.42, Bundesallee 100, D-38116 Braunschweig (Germany); Uhlmann, F H [University of Technology Ilmenau, Institute for Information Technology, PO Box 100565, D-98684 Ilmenau (Germany)

    2006-06-01

    We report on the design, optimization, fabrication, and successful testing of an universal asynchronous RSFQ logic gate based on the dual-rail data coding. Properly connecting its inputs and outputs, one can perform most of the basic Boolean functions over a pair of dual-rail input variables. Therefore, this gate is fundamental component for the development of high-speed complex asynchronous RSFQ digital devices.

  15. Violation of the equivalence principle for stressed bodies in asynchronous relativity

    Energy Technology Data Exchange (ETDEWEB)

    Andrade Martins, R. de (Centro de Logica, Epistemologia e Historia da Ciencia, Campinas (Brazil))

    1983-12-11

    In the recently developed asynchronous formulation of the relativistic theory of extended bodies, the inertial mass of a body does not explicitly depend on its pressure or stress. The detailed analysis of the weight of a box filled with a gas and placed in a weak gravitational field shows that this feature of asynchronous relativity implies a breakdown of the equivalence between inertial and passive gravitational mass for stressed systems.

  16. Privacy-Preserving Protocols for Eigenvector Computation

    CERN Document Server

    Pathak, Manas A

    2010-01-01

    In this paper, we present a protocol for computing the dominant eigenvector of a collection of private data distributed across multiple parties, with the individual parties unwilling to share their data. Our proposed protocol is based on secure multiparty computation with a trusted third-party arbitrator who deals with data encrypted by the other parties using an additive homomorphic cryptosystem. We also augment the protocol with randomization to make it difficult, with a high probability, for any party to estimate properties of the data belonging to other parties from the intermediate steps. The previous approaches towards this problem were based on expensive QR decomposition of correlation matrices, we present an efficient algorithm using the power iteration method. We present an analysis of the correctness, security, efficiency of protocol and experiments over a prototype implementation.

  17. Secure Two-Party Computational Geometry

    Institute of Scientific and Technical Information of China (English)

    Shun-Dong Li; Yi-Qi Dai

    2005-01-01

    Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle area, the relation between a private point and an ellipse area and the shortest distance between two point sets. The paper gives solutions to these specific geometric problems, and in doing so a building block is developed,the protocol for the distance between two private points, that is also useful in the solutions to other geometric problems and combinatorial problems.

  18. Simulating Quantitative Cellular Responses Using Asynchronous Threshold Boolean Network Ensembles

    Directory of Open Access Journals (Sweden)

    Shah Imran

    2011-07-01

    Full Text Available Abstract Background With increasing knowledge about the potential mechanisms underlying cellular functions, it is becoming feasible to predict the response of biological systems to genetic and environmental perturbations. Due to the lack of homogeneity in living tissues it is difficult to estimate the physiological effect of chemicals, including potential toxicity. Here we investigate a biologically motivated model for estimating tissue level responses by aggregating the behavior of a cell population. We assume that the molecular state of individual cells is independently governed by discrete non-deterministic signaling mechanisms. This results in noisy but highly reproducible aggregate level responses that are consistent with experimental data. Results We developed an asynchronous threshold Boolean network simulation algorithm to model signal transduction in a single cell, and then used an ensemble of these models to estimate the aggregate response across a cell population. Using published data, we derived a putative crosstalk network involving growth factors and cytokines - i.e., Epidermal Growth Factor, Insulin, Insulin like Growth Factor Type 1, and Tumor Necrosis Factor α - to describe early signaling events in cell proliferation signal transduction. Reproducibility of the modeling technique across ensembles of Boolean networks representing cell populations is investigated. Furthermore, we compare our simulation results to experimental observations of hepatocytes reported in the literature. Conclusion A systematic analysis of the results following differential stimulation of this model by growth factors and cytokines suggests that: (a using Boolean network ensembles with asynchronous updating provides biologically plausible noisy individual cellular responses with reproducible mean behavior for large cell populations, and (b with sufficient data our model can estimate the response to different concentrations of extracellular ligands. Our

  19. Collaborative learning through computer-mediated argumentation

    NARCIS (Netherlands)

    Kanselaar, G.; Veerman, A.L.; Andriessen, J.E.B.

    1999-01-01

    This article reports on three studies that involved undergraduate students collaboratively working on authentic discussion tasks in synchronous and asynchronous Computer Mediated Communication systems (Netmeeting, Belvédère, Allaire Forums). The purposes of the assignments were respectively to deve

  20. Facilitating Computer Conferencing: Recommendations from the Field.

    Science.gov (United States)

    Berge, Zane L.

    1995-01-01

    Based on a review of the literature, this article examines the roles of a computer conference moderator in distance education. Highlights include the role of technology in distance education; interactions in learning, including synchronous and asynchronous interaction; reliance on discussion; and pedagogical, social, managerial, and technical…

  1. Commande vectorielle d'un moteur asynchrone sans capteur

    Science.gov (United States)

    Ourth, T.

    1993-06-01

    A field-oriented control strategy for induction machines which does not use mechanical sensors is presented. The rotor flux is observed by a reduced-order Luenberger-type observer based on a model using a stator-fixed reference frame. An estimate of the rotation speed is derived from the flux vector, the measured stator currents and the field orientation angle. Simulations demonstrate that this control strategy performs well even in the presence of parameter variations up to ± 50% (resistances). Ce papier présente la commande par flux orienté d'une machine asynchrone sans capteur de vitesse ou de position. Le flux rotorique est évalué grâce à un observateur d'ordre réduit d'un type voisin de Luenberger travaillant dans un repère fixe statorique. L'estimation de la vitesse est obtenue à partir du module du flux rotorique, des courants statoriques mesurés et de l'angle d'orientation du flux rotorique. Cette étude basée sur des simulations démontre un comportement acceptable de la commande malgré la variation des paramètres comme les résistances de la machine.

  2. Photonic analog-to-digital converter via asynchronous oversampling

    Science.gov (United States)

    Carver, Spencer; Reeves, Erin; Siahmakoun, Azad; Granieri, Sergio

    2012-06-01

    This paper presents a hybrid opto-electronic asynchronous delta-sigma modulator, implemented in the form of a fiber-optic Analog-to-Digital converter (ADC). This architecture was chosen for its independence of an external clock and ease of demodulation through a single low-pass filter stage. The fiber-optic prototype consists of an input laser (wavelength λ1) which is modulated with an input RF signal, a high-speed comparator circuit working as bi-stable quantizer, and a fiber-optic loop that includes a SOA and a band-pass filter that act as a leaky integrator. The fiber-optic loop acts as a fiber-ring resonator (FRR), and defines the resonance wavelength λ2 of the system. The gain within this loop is modified through cross-gain modulation (XGM) by the input wavelength λ1, and thus achieves the desired modulation effect. The proposed architecture has been constructed and characterized at a sampling rate of 15.4 MS/s processing input analog signals in the range of dc-3 MHz with a signal-to-noise ratio of 36 dB and an effective number of bits of 5.7.

  3. ACK filling void first algorithm and performance for asynchronous OPS

    Science.gov (United States)

    Liu, Huanlin; Shi, Yonghe; Chen, Qianbin; Pan, Yingjun

    2007-11-01

    OPS with feedback shared FDL buffer produce large voids due to FDL buffers only supplying discrete step delay and causing FDL queue virtually occupation. By analyzing the TCP traffic and ACK packets feature, the ACK packet void filling first scheduling is presented to decrease packet loss rate and to reduce the FDL voids. When the FDL buffer void size is fit for the ACK packet, the ACK packet is scheduled to FDL immediately. An ACK and non-ACK packets difference and process flow is designed according the TCP packet frame structure. Compared with the conventional FIFO scheduling and smallest FDL void first scheduling, the algorithm reduces greatly the number of ACK occupying the FDL buffer and eliminates large numbers of ACK's bad influence on efficiency of IP data transmission under different FDL buffer depth and traffic load. The results of simulation show that the proposed scheduling makes use of ACK packets first void filling scheduling mechanism to reduce FDL excess load, increases output utilization and reduce packet loss ratio for asynchronous optical network. This approach is shown to minimize the FDL numbers with the feature of high stabilization and photonic integration and to improve real time TCP traffic performance for Internet network.

  4. Asynchronous Dual-Rail Transition Logic for Enhanced DPA Resistance

    Directory of Open Access Journals (Sweden)

    Rajath Srivathsav N

    2015-02-01

    Full Text Available An Asynchronous Dual–Rail Transition Logic (ADTL is proposed in this paper. The new logic style can be used in the encryption circuit of cryptography to counter the differential power analysis (DPA attacks. The resistance to the DPA attacks is achieved by randomizing the power dissipated in the circuit through Manchester input signal coding and unpredictable initial state of the toggle flip-flops (TFF. The proposed logic uses two wires to transmit the signal, in the form of a single transition on either one of the two wires to indicate the input logic value. T-FFs are employed to randomize the power dissipated by the circuit. The randomizing is made possible by making the initial states of the flip-flops un-deterministic. Furthermore, the clock is completely eliminated in the conceived design, thus realizing increased power randomization and resistance to the DPA attacks. The design is demonstrated through the systematic simulations on a typical encryption circuit. The validation of the ADTL is made through extensive comparisons with the existing Dual-rail Transition Logic (DTL for power, delay and the DPA resistance. Industry standard EDA tools with 90nm technology libraries provided by the UMC foundry have been employed in the designs.

  5. Maximum likelihood reconstruction for Ising models with asynchronous updates

    CERN Document Server

    Zeng, Hong-Li; Aurell, Erik; Hertz, John; Roudi, Yasser

    2012-01-01

    We describe how the couplings in a non-equilibrium Ising model can be inferred from observing the model history. Two cases of an asynchronous update scheme are considered: one in which we know both the spin history and the update times (times at which an attempt was made to flip a spin) and one in which we only know the spin history (i.e., the times at which spins were actually flipped). In both cases, maximizing the likelihood of the data leads to exact learning rules for the couplings in the model. For the first case, we show that one can average over all possible choices of update times to obtain a learning rule that depends only on spin correlations and not on the specific spin history. For the second case, the same rule can be derived within a further decoupling approximation. We study all methods numerically for fully asymmetric Sherrington-Kirkpatrick models, varying the data length, system size, temperature, and external field. Good convergence is observed in accordance with the theoretical expectatio...

  6. Network inference using asynchronously updated kinetic Ising Model

    CERN Document Server

    Zeng, Hong-Li; Alava, Mikko; Mahmoudi, Hamed

    2010-01-01

    Network structures are reconstructed from dynamical data by respectively naive mean field (nMF) and Thouless-Anderson-Palmer (TAP) approximations. For TAP approximation, we use two methods to reconstruct the network: a) iteration method; b) casting the inference formula to a set of cubic equations and solving it directly. We investigate inference of the asymmetric Sherrington- Kirkpatrick (S-K) model using asynchronous update. The solutions of the sets cubic equation depend of temperature T in the S-K model, and a critical temperature Tc is found around 2.1. For T Tc there are three real roots. The iteration method is convergent only if the cubic equations have three real solutions. The two methods give same results when the iteration method is convergent. Compared to nMF, TAP is somewhat better at low temperatures, but approaches the same performance as temperature increase. Both methods behave better for longer data length, but for improvement arises, TAP is well pronounced.

  7. A Faster-than Relation for Asynchronous Processes

    Science.gov (United States)

    2001-01-01

    Lecture Notes in Computer Science , Lisbon, Portugal, June 1998, Springer... Lecture Notes in Computer Science , Warsaw, Poland, July 1997, Springer-Verlag, pp. 166{180. [12] R. Cleaveland and S. Sims, The NCSU Concurrency...Workbench, in Computer Aided Veri cation (CAV 󈨤), R. Alur and T. Henzinger, eds., Vol. 1102 of Lecture Notes in Computer Science , New Brunswick, NJ,

  8. An Attempt at Pseudo-Democracy and Tactical Liberalization in Turkey: An Analysis of Ismet Inönü’s Decision to Transition to a Multi-Party Political System

    Directory of Open Access Journals (Sweden)

    Kemal Ozden

    2010-10-01

    Full Text Available Turkish experiment of transition to multi-party politics in 1946 has been seen by transition to democracy comparativists as an example of the cases in which the ruling elites deliberately decide that the society is diverse so this diversity needs to be translated into the political sphere by allowing multi-party politics. However, this study challanges this view and suggests that a close reading of the critical juncture of 1946 when the President and the leader of Republican People’s Party smet nönü decided to allow other parties to operate shows that it was not that the President nönü succumbed to the reality of diversity but domestic and international concerns forced him to act towards a multi-party political structure. In his mind, he had a pseudodemocratic system where he and his party would continue to rule the country in a hegemonic party system setting where a ruling party monopolizes the political arena, using coercion, patronage, media control, and other means to deny formally legal opposition parties any real chance of competing for power.

  9. Commande optimale à flux libre des machines asynchrones

    Science.gov (United States)

    Biedinger, J. M.; Poullain, S.; Yvon, J. P.

    1992-01-01

    The subject of this paper is the optimal control with unconstrained flux of an induction motor being considered as a distributed parameter system described by a nonlinear diffusion equation. This approach allows to describe the electrodynamic state of the motor by taking into account, in a natural way, the influence of saturation and eddy-currents, as well as the nonlinearities due to the variable flux operation. Equations are approximated via a finite element formulation which leads to a finite dimensional dynamical system to which the techniques of optimal control may be applied. The generality of the methodology allows to treat various criteria. The objective aimed in this paper is to force the motor torque to follow a given input, especially under initially demagnetized conditions and with, naturally, constraints on the currents. For this purpose the criterion will be chosen as a norm of the difference between the electromagnetic torque and a given reference torque. Numerical simulations are presented for the case of a squirrel-cage rotor and for a solid iron rotor. Results are compared with those deduced from strategies based on lumped-parameter models. Torque responses obtained with field-oriented control method adapted to the case of flux-variable operation are also presented. Finally a modification of the criterion is proposed for identifying the command which allows to obtain the larger torque during transient states. Dans cet article on traite le problème du contrôle optimal à flux libre d'un moteur asynchrone considéré comme un système à paramètres répartis gouverné par une équation de diffusion non linéaire. Cette approche permet de décrire l'état électrodynamique de la machine en prenant naturellement en compte les effets de la saturation et des courants induits, ainsi que les non-linéarités liées au fonctionnement à flux variable. La formulation éléments finis est utilisée pour traduire le problème continu sous la forme d

  10. The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems. Ph.D. Thesis

    Science.gov (United States)

    Schmuck, Frank Bernhard

    1988-01-01

    Reliable broadcast protocols are important tools in distributed and fault-tolerant programming. They are useful for sharing information and for maintaining replicated data in a distributed system. However, a wide range of such protocols has been proposed. These protocols differ in their fault tolerance and delivery ordering characteristics. There is a tradeoff between the cost of a broadcast protocol and how much ordering it provides. It is, therefore, desirable to employ protocols that support only a low degree of ordering whenever possible. This dissertation presents techniques for deciding how strongly ordered a protocol is necessary to solve a given application problem. It is shown that there are two distinct classes of application problems: problems that can be solved with efficient, asynchronous protocols, and problems that require global ordering. The concept of a linearization function that maps partially ordered sets of events to totally ordered histories is introduced. How to construct an asynchronous implementation that solves a given problem if a linearization function for it can be found is shown. It is proved that in general the question of whether a problem has an asynchronous solution is undecidable. Hence there exists no general algorithm that would automatically construct a suitable linearization function for a given problem. Therefore, an important subclass of problems that have certain commutativity properties are considered. Techniques for constructing asynchronous implementations for this class are presented. These techniques are useful for constructing efficient asynchronous implementations for a broad range of practical problems.

  11. Improving Learning of Programming Through E-Learning by Using Asynchronous Virtual Pair Programming

    Directory of Open Access Journals (Sweden)

    Sufian IDRIS

    2006-07-01

    Full Text Available The problem of learning programming subjects, especially through distance learning and E-Learning, has been widely reported in literatures. Many attempts have been made to solve these problems. This has led to many new approaches in the techniques of learning of programming. One of the approaches that have been proposed is the use of virtual pair programming (VPP. Most of the studies about VPP in distance learning or e-learning environment focus on the use of the synchronous mode of collaboration between learners. Not much research have been done about asynchronous VPP. This paper describes how we have implemented VPP and a research that has been carried out to study the effectiveness of asynchronous VPP for learning of programming. In particular, this research study the effectiveness of asynchronous VPP in the learning of object-oriented programming among students at Open University Malaysia (OUM. The result of the research has shown that most of the learners have given positive feedback, indicating that they are happy with the use of asynchronous VPP. At the same time, learners did recommend some extra features that could be added in making asynchronous VPP more enjoyable.

  12. Scalability of Asynchronous Networks Is Limited by One-to-One Mapping between Effective Connectivity and Correlations.

    Directory of Open Access Journals (Sweden)

    Sacha Jennifer van Albada

    2015-09-01

    Full Text Available Network models are routinely downscaled compared to nature in terms of numbers of nodes or edges because of a lack of computational resources, often without explicit mention of the limitations this entails. While reliable methods have long existed to adjust parameters such that the first-order statistics of network dynamics are conserved, here we show that limitations already arise if also second-order statistics are to be maintained. The temporal structure of pairwise averaged correlations in the activity of recurrent networks is determined by the effective population-level connectivity. We first show that in general the converse is also true and explicitly mention degenerate cases when this one-to-one relationship does not hold. The one-to-one correspondence between effective connectivity and the temporal structure of pairwise averaged correlations implies that network scalings should preserve the effective connectivity if pairwise averaged correlations are to be held constant. Changes in effective connectivity can even push a network from a linearly stable to an unstable, oscillatory regime and vice versa. On this basis, we derive conditions for the preservation of both mean population-averaged activities and pairwise averaged correlations under a change in numbers of neurons or synapses in the asynchronous regime typical of cortical networks. We find that mean activities and correlation structure can be maintained by an appropriate scaling of the synaptic weights, but only over a range of numbers of synapses that is limited by the variance of external inputs to the network. Our results therefore show that the reducibility of asynchronous networks is fundamentally limited.

  13. Simultaneous and independent optical impairments monitoring using singular spectrum analysis of asynchronously sampled signal amplitudes

    Science.gov (United States)

    Guesmi, Latifa; Menif, Mourad

    2015-09-01

    Optical performance monitoring (OPM) becomes an inviting topic in high speed optical communication networks. In this paper, a novel technique of OPM based on a new elaborated computation approach of singular spectrum analysis (SSA) for time series prediction is presented. Indeed, various optical impairments among chromatic dispersion (CD), polarization mode dispersion (PMD) and amplified spontaneous emission (ASE) noise are a major factors limiting quality of transmission data in the systems with data rates lager than 40 Gbit/s. This technique proposed an independent and simultaneous multi-impairments monitoring, where we used SSA of time series analysis and forecasting. It has proven their usefulness in the temporal analysis of short and noisy time series in several fields, that it is based on the singular value decomposition (SVD). Also, advanced optical modulation formats (100 Gbit/s non-return-to zero dual-polarization quadrature phase shift keying (NRZ-DP-QPSK) and 160 Gbit/s DP-16 quadrature amplitude modulation (DP-16QAM)) offering high spectral efficiencies have been successfully employed by analyzing their asynchronously sampled amplitude. The simulated results proved that our method is efficient on CD, first-order PMD, Q-factor and OSNR monitoring, which enabled large monitoring ranges, the CD in the range of 170-1700 ps/nm.Km and 170-1110 ps/nm.Km for 100 Gbit/s NRZ-DP-QPSK and 160 Gbit/s DP-16QAM respectively, and also the DGD up to 20 ps is monitored. We could accurately monitor the OSNR in the range of 10-40 dB with monitoring error remains less than 1 dB in the presence of large accumulated CD.

  14. Methodological Reflections on the Use of Asynchronous Online Focus Groups in Health Research

    Directory of Open Access Journals (Sweden)

    Sarah Williams PhD

    2012-09-01

    Full Text Available The Internet is increasingly used as a tool in qualitative research. In particular, asynchronous online focus groups are used when factors such as cost, time, or access to participants can make conducting face-to-face research difficult. In this article we consider key methodological issues involved in using asynchronous online focus groups to explore experiences of health and illness. The written nature of Internet communication, the lack of physical presence, and the asynchronous, longitudinal aspects enable participants who might not normally contribute to research studies to reflect on their personal stories before disclosing them to the researcher. Implications for study design, recruitment strategies, and ethics should be considered when deciding whether to use this method.

  15. Développement de lois de commandes avec observateurs pour machine asynchrone

    OpenAIRE

    Alvarez Salas, Ricardo

    2002-01-01

    Ce travail s'inscrit dans le cadre général de l'observation et de la commande non linéaire de machine asynchrone. Ce mémoire comporte cinq volets. La première partie donne les éléments de modélisation de la machine asynchrone ainsi que sa représentation dans différentes repères de coordonnées. La deuxième partie est dédiée aux observateurs de flux et de couple de charge pour machine asynchrone en vue de bonnes performances dans toute la gamme de vitesse. Nous présentons deux méthodes de synth...

  16. Simulating the operation action of an asynchronized turbogenerator under loss of excitation

    Institute of Scientific and Technical Information of China (English)

    SANGARE Adama Fanhiri; YANG Shunchang; LIU Ren

    2004-01-01

    The control strategy tor asynchronized turbogenerators (ASTGs) was studied by using two-axis equations. Simulation of the process of an asynchronized turbogenerator with faults of d or q axis or d and q axes in the excitation system was carried out with the simulating models including the model of the reverse thyristors in the excitation system established by Saber software. The simulation results show that at the loss of excitation at both windings or one winding of the rotor, the ASTGs can be automatically driven into an asynchronous or single axis excitation operation mode without a power unit tripping, and the characteristics for ASTGs with faults in the excitation system appear in good order.

  17. Router Designs for an Asynchronous Time-Division-Multiplexed Network-on-Chip

    DEFF Research Database (Denmark)

    Kasapaki, Evangelia; Sparsø, Jens; Sørensen, Rasmus Bo

    2013-01-01

    In this paper we explore the design of an asynchronous router for a time-division-multiplexed (TDM) network-on-chip (NOC) that is being developed for a multi-processor platform for hard real-time systems. TDM inherently requires a common time reference, and existing TDM-based NOC designs are either...... synchronous or mesochronous, but both approaches have their limitations: a globally synchronous NOC is no longer feasible in today's sub micron technologies and a mesochronous NOC requires special FIFO-based synchronizers in all input ports of all routers in order to accommodate for clock phase differences....... This adds hardware complexity and increases area and power consumption. We propose to use asynchronous routers in order to achieve a simpler, more robust and globally-asynchronous NOC, and this represents an unexplored point in the design space. The paper presents a range of alternative router designs. All...

  18. Universal regular autonomous asynchronous systems: omega-limit sets, invariance and basins of attraction

    CERN Document Server

    Vlad, Serban E

    2010-01-01

    The asynchronous systems are the non-deterministic real time-binary models of the asynchronous circuits from electrical engineering. Autonomy means that the circuits and their models have no input. Regularity means analogies with the dynamical systems, thus such systems may be considered to be the real time dynamical systems with a 'vector field' {\\Phi}:{0,1}^2 \\rightarrow {0,1}^2. Universality refers to the case when the state space of the system is the greatest possible in the sense of the inclusion. The purpose of the paper is that of defining, by analogy with the dynamical systems theory, the {\\omega}-limit sets, the invariance and the basins of attraction of the universal regular autonomous asynchronous systems.

  19. Gigabit Ethernet signal transmission using asynchronous optical code division multiple access.

    Science.gov (United States)

    Ma, Philip Y; Fok, Mable P; Shastri, Bhavin J; Wu, Ben; Prucnal, Paul R

    2015-12-15

    We propose and experimentally demonstrate a novel architecture for interfacing and transmitting a Gigabit Ethernet (GbE) signal using asynchronous incoherent optical code division multiple access (OCDMA). This is the first such asynchronous incoherent OCDMA system carrying GbE data being demonstrated to be working among multi-users where each user is operating with an independent clock/data rate and is granted random access to the network. Three major components, the GbE interface, the OCDMA transmitter, and the OCDMA receiver are discussed in detail. The performance of the system is studied and characterized through measuring eye diagrams, bit-error rate and packet loss rate in real-time file transfer. Our Letter also addresses the near-far problem and realizes asynchronous transmission and detection of signal.

  20. On the Outage Behavior of Asynchronous OFDM DF and AF Cooperative Networks

    CERN Document Server

    Torbatian, Mehdi

    2009-01-01

    The outage behavior of various relaying protocols over a general one hop asynchronous cooperative network is examined when orthogonal frequency division multiplexing (OFDM) is used to combat synchronization error among the relays. We consider non-orthogonal selection decode-and-forward (NSDF), orthogonal selection decode-and-forward (OSDF), non-orthogonal amplify-and-forward (NAF), and orthogonal amplify-and-forward (OAF) relaying protocols and analyze the diversity multiplexing gain tradeoff (DMT) in all scenarios. The transmitting nodes cooperatively construct an asynchronous OFDM space-time code by re-sending the source messages over a common time interval and a common frequency bandwidth. It is shown that in decode-and-forward (DF) type protocols, the asynchronous network provides a diversity gain greater than or equal to the one of the corresponding synchronous network in the limit of code word length and throughout the range of multiplexing gain. In amplify-and-forward (AF) type protocols, in which the ...

  1. An Achievable Rate Region for the Asynchronous Multiple Access Channel with Feedback

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    An achievable rate region for the asynchronous multiple access channel with feedback is established through the use of superposition coding, list decoding and time sharing. The calculation results demonstrate that lack of synchronization does not affect the achievable rate region when the code block length tends to infinity, and that if the length of the code word is finite, especially not sufficiently larger than a fixed maximal delay, the asynchronization will cause a loss of the rate region. The amount of such a loss with its explanation for the reason is given, and the difference between the losses for the asynchronous multiple access channel with and without feedback is also discussed in this paper.

  2. The Effects of Metacognitive Instruction Embedded within an Asynchronous Learning Network on Scientific Inquiry Skills. Research Report

    Science.gov (United States)

    Zion, Michal; Michalsky, Tova; Mevarech, Zemira R.

    2005-01-01

    The study is aimed at investigating the effects of four learning methods on students' scientific inquiry skills. The four learning methods are: (a) metacognitive-guided inquiry within asynchronous learning networked technology (MINT); (b) an asynchronous learning network (ALN) with no metacognitive guidance; (c) metacognitive-guided inquiry…

  3. An Examination of the Effectiveness of Embedded Audio Feedback for English as a Foreign Language Students in Asynchronous Online Discussions

    Science.gov (United States)

    Olesova, Larisa A.

    2011-01-01

    This study examined the effect of asynchronous embedded audio feedback on English as a Foreign Language (EFL) students' higher-order learning and perception of the audio feedback versus text-based feedback when the students participated in asynchronous online discussions. In addition, this study examined how the impact and perceptions differed…

  4. Synaptotagmin-7 Is an Asynchronous Calcium Sensor for Synaptic Transmission in Neurons Expressing SNAP-23

    DEFF Research Database (Denmark)

    Weber, Jens P; Toft-Bertelsen, Trine L; Mohrmann, Ralf;

    2014-01-01

    Synchronization of neurotransmitter release with the presynaptic action potential is essential for maintaining fidelity of information transfer in the central nervous system. However, synchronous release is frequently accompanied by an asynchronous release component that builds up during repetitive...... stimulation, and can even play a dominant role in some synapses. Here, we show that substitution of SNAP-23 for SNAP-25 in mouse autaptic glutamatergic hippocampal neurons results in asynchronous release and a higher frequency of spontaneous release events (mEPSCs). Use of neurons from double-knock-out (SNAP...

  5. A low-power asynchronous data-path for a FIR filter bank

    DEFF Research Database (Denmark)

    Nielsen, Lars Skovby; Sparsø, Jens

    1996-01-01

    This paper describes a number of design issues relating to the implementation of low-power asynchronous signal processing circuits. Specifically, the paper addresses the design of a dedicated processor structure that implements an audio FIR filter bank which is part of an industrial application. ...... the implications it has on the choice of architecture, handshake-protocol, data-encoding, and circuit design. This includes a tagging scheme that divides the data-path into slices, and an asynchronous ripple carry adder that avoids a completion tree....

  6. Asynchronous teaching of psychomotor skills through VR annotations: evaluation in digital rectal examination.

    Science.gov (United States)

    Rissanen, Mikko J; Kume, Naoto; Kuroda, Yoshihiro; Kuroda, Tomohiro; Yoshimura, Koji; Yoshihara, Hiroyuki

    2008-01-01

    Many VR technology based training systems use expert's motion data as the training aid, but would not provide any short-cut to teaching medical skills that do not depend on exact motions. Earlier we presented Annotated Simulation Records (ASRs), which can be used to encapsulate experts' insight on psychomotor skills. Annotations made to behavioural parameters in training simulators enable asynchronous teaching instead of just motion training in a proactive way to the learner. We evaluated ASRs for asynchronous teaching of Digital Rectal Examination (DRE) with 3 urologists and 8 medical students. The ASRs were found more effective than motion-based training with verbal feedback.

  7. Finite-time quantised feedback asynchronously switched control of sampled-data switched linear systems

    Science.gov (United States)

    Wang, Ronghao; Xing, Jianchun; Li, Juelong; Xiang, Zhengrong

    2016-10-01

    This paper studies the problem of stabilising a sampled-data switched linear system by quantised feedback asynchronously switched controllers. The idea of a quantised feedback asynchronously switched control strategy originates in earlier work reflecting actual system characteristic of switching and quantising, respectively. A quantised scheme is designed depending on switching time using dynamic quantiser. When sampling time, system switching time and controller switching time are all not uniform, the proposed switching controllers guarantee the system to be finite-time stable by a piecewise Lyapunov function and the average dwell-time method. Simulation examples are provided to show the effectiveness of the developed results.

  8. 三相异步电动机用作异步发电机的探讨%Discussion on Three Phases Asynchronous Motor for Asynchronous Generator

    Institute of Scientific and Technical Information of China (English)

    王胤升

    2015-01-01

    异步发电机具有体积小、质量轻、价格低廉、安装与维修十分便捷等特点.在实际应用过程中,异步发电机可以满足紧急发电的需求,为生活和生产的有序、高效开展提供可靠的电能.%Asynchronous generator has the characteristics of small size, light weight, low cost, easy installation and maintenance, etc.. In the practical application process, the asynchronous generator can meet the needs of emergency power generation, and provide a reliable electric energy for life and production.

  9. Efficiency of three-phase asynchronous motors. Energy loss reduction by means of overdimensioning; Efficientie van driefasen asynchrone motoren. SinuMEC beperkt energieverlies door overdimensionering

    Energy Technology Data Exchange (ETDEWEB)

    Peeters, J.; Van Dorst, C. [Hyteps, Gemert (Netherlands)

    2008-10-15

    The three phase asynchronous motor has been applied in various installations since time immemorial. Although the motor is more efficient at full mechanical load, this is not always applied efficiently. Can the efficiency of low load motors be improved or is this a utopia? The Sinusoidal Motor Controller (SinuMEC) improves efficiency, saves energy and lengthens the life span. [mk]. [Dutch] De driefasen asynchrone motor wordt sinds mensenheugenis in uiteenlopende installaties toegepast. Hoewel de motor met een volle mechanische belasting efficient is, wordt deze niet altijd efficient toegepast. Kan de efficiency van laag belaste motoren worden verbeterd of is dit een utopie? De Sinusoidal Motor efficiency controller (SinuMEC) verbetert de efficiency, bespaart energie en verlengt de levensduur.

  10. “多方当事人调解诊所课程”的调研报告%A Report on Multiparty Mediation Practicum

    Institute of Scientific and Technical Information of China (English)

    翁洁

    2012-01-01

    This report was targeted at the course of Multiparty Mediation Practicum. It discussed the authorg observation and investigation of the teaching contents and methods, class characteristics as well as the assess ment methods of this course. Then detailed analyses were made on the course orientation, class structure and teacher student function of it in the hope that they could contribute to the improvements in the research and practice of the teaching attitude toward, objective of, and means of the legal education in China.%文章将“多方当事人调解诊所课程”作为调查研究的对象,通过对该课程的授课内容与方式、课堂特点、考核方式等方面的观察与记录,从课程定位、课堂构成、师生功能三个方面对该课程进行了分析并得出了相关结论,以期能为我国法学教育教学态度、目标、方式、手段等方面的研究与切实改善提供有益的参考。

  11. Discrete analog computing with rotor-routers.

    Science.gov (United States)

    Propp, James

    2010-09-01

    Rotor-routing is a procedure for routing tokens through a network that can implement certain kinds of computation. These computations are inherently asynchronous (the order in which tokens are routed makes no difference) and distributed (information is spread throughout the system). It is also possible to efficiently check that a computation has been carried out correctly in less time than the computation itself required, provided one has a certificate that can itself be computed by the rotor-router network. Rotor-router networks can be viewed as both discrete analogs of continuous linear systems and deterministic analogs of stochastic processes.

  12. Developing Asynchronous Online Courses: Key Instructional Strategies in a Social Metacognitive Constructivist Learning Trajectory

    Science.gov (United States)

    Niess, Margaret; Gillow-Wiles, Henry

    2013-01-01

    This qualitative, design-based research study resulted in a proposal for a comprehensive set of best instructional practices immersed in a learning trajectory, outlining the tools, processes and the content development for online asynchronous, text-based learning in graduate level professional development courses. The outcome provides a rich…

  13. Synchronous and Asynchronous E-Language Learning: A Case Study of Virtual University of Pakistan

    Science.gov (United States)

    Perveen, Ayesha

    2016-01-01

    This case study evaluated the impact of synchronous and asynchronous E-Language Learning activities (ELL-ivities) in an E-Language Learning Environment (ELLE) at Virtual University of Pakistan. The purpose of the study was to assess e-language learning analytics based on the constructivist approach of collaborative construction of knowledge. The…

  14. Pedagogical dimensions of effective online asynchronous teacher communication in higher education

    NARCIS (Netherlands)

    Smits, A.; Voogt, J.; Rutledge, D.; Slykhuis, D.

    2015-01-01

    In this research teacher behaviour in online asynchronous discussions is studied. To this end teachers’ online messages were analyzed and correlated to measures of student satisfaction. Findings show a positive relation between student satisfaction and the presence of content knowledge, multiple ack

  15. Credit Hours with No Set Time: A Study of Credit Policies in Asynchronous Online Education

    Science.gov (United States)

    Prasuhn, Frederick Carl

    2014-01-01

    U.S. public university system policies were examined to learn how credit hours were determined for asynchronous online education. Findings indicated that (a) credit hour meaning and use are not consistent, (b) primary responsibility for credit hour decisions was at the local level, and (c) no policies exist to guide credit hour application for…

  16. Facing Off: Comparing an In-Person Library Orientation Lecture with an Asynchronous Online Library Orientation

    Science.gov (United States)

    Gall, Dan

    2014-01-01

    A study to compare the effectiveness of an in-person library orientation with an online asynchronous orientation was conducted with three sections of Social Work Research Methods, a required course in the University of Iowa's Master of Social Work program. Two sections of the course received an online orientation involving short videos, text and…

  17. Effects of Asynchronous Music on Students' Lesson Satisfaction and Motivation at the Situational Level

    Science.gov (United States)

    Digelidis, Nikolaos; Karageorghis, Costas I.; Papapavlou, Anastasia; Papaioannou, Athanasios G.

    2014-01-01

    The aim of this study was to examine the effects of asynchronous (background) music on senior students' motivation and lesson satisfaction at the situational level. A counterbalanced mixed-model design was employed with two factors comprising condition (three levels) and gender (two levels). Two hundred students (82 boys, 118 girls; M [subscript…

  18. Participation in Asynchronous Online Discussion Forums Does Improve Student Learning of Gross Anatomy

    Science.gov (United States)

    Green, Rodney A.; Farchione, Davide; Hughes, Diane L.; Chan, Siew-Pang

    2014-01-01

    Asynchronous online discussion forums are common in blended learning models and are popular with students. A previous report has suggested that participation in these forums may assist student learning in a gross anatomy subject but it was unclear as to whether more academically able students post more often or whether participation led to…

  19. Using Asynchronous Electronic Surveys to Help In-Class Revision: A Case Study

    Science.gov (United States)

    Tong, Vincent C. H.

    2012-01-01

    Synchronous e-voting systems (commonly known as "clickers") have become increasingly popular as they can be used to enhance interactivity in lectures. Asynchronous electronic surveys (AESs), unlike these voting system, usually serve as a method of gathering feedback before or after teaching sessions. This paper describes and evaluates a project…

  20. Asynchronous Pipeline Micro—Control—Unit (MCU) Chip Design

    Institute of Scientific and Technical Information of China (English)

    ZHOUQian; XUKe; MINHao

    2003-01-01

    The work of this paper includes a researchon asynch ronous design methodology, and a design and implementation of an asynchronous 8-Bit micro-control-unit (MCU). This paper introduces a new application of New-Instruction-Fetching method to detect new instruc-tion which makes this chip fit for demand changeable sys-tem. The instruction set of this asynchronous MCU is compatible with PIC16C6X (Sicrochip Technology Inc).This paper also introduces a new architecture of pipeline,which increases the average speed of chip operation. The asynchronous low power MCU has been fabricated with CSMC (central semiconductor manufacturing corporation)0.6μm CMOS process in Aug 2001. The chip size is about 1.60mm*2.00mm (without taking account of PAD size).Now the test work has been accomplished and the test-ing result of this chip is also presented. The testing result shows that the asynchronous architecture could fulfill all the expected functions, additionally with higher processs peed and lower power consumption than its synchronous counterpart under the same supply voltage.

  1. Defining the Symmetry of the Universal Semi-Regular Autonomous Asynchronous Systems

    Directory of Open Access Journals (Sweden)

    Serban E. Vlad

    2012-02-01

    Full Text Available The regular autonomous asynchronous systems are the non-deterministic Boolean dynamical systems and universality means the greatest in the sense of the inclusion. The paper gives four definitions of symmetry of these systems in a slightly more general framework, called semi-regularity, and also many examples.

  2. A model of asynchronous left ventricular relaxation predicting the bi-exponential pressure decay

    NARCIS (Netherlands)

    R.W. Brower (Ronald); S. Meij (Simon); P.W.J.C. Serruys (Patrick)

    1983-01-01

    textabstractA new model for the pressure relaxation of the left ventricle is proposed. The model presumes that the myocardium relaxes asynchronously, but that when regions begin to relax, after a delay, the local wall stress decays as a mono-exponential process. This formulation results in an appare

  3. Constructivist Pedagogy in Asynchronous Online Education: Examining Proactive Behavior and the Impact on Student Engagement Levels

    Science.gov (United States)

    Peters, Linda; Shmerling, Shirley; Karren, Ronald

    2011-01-01

    Asynchronous learning environments have gained popularity over the past decade and have rapidly gained acceptance in both the academic and business worlds. This study investigates the impact that student characteristics of proactive behavior and learning style preference have on student engagement levels when a collaborative learning process such…

  4. An Investigation of Assessment and Feedback Practices in Fully Asynchronous Online Undergraduate Mathematics Courses

    Science.gov (United States)

    Trenholm, Sven; Alcock, Lara; Robinson, Carol

    2015-01-01

    Research suggests it is difficult to learn mathematics in the fully asynchronous online (FAO) instructional modality, yet little is known about associated teaching and assessment practices. In this study, we investigate FAO mathematics assessment and feedback practices in particular consideration of both claims and findings that these practices…

  5. Flipping the Online Classroom with Web 2.0: The Asynchronous Workshop

    Science.gov (United States)

    Cummings, Lance

    2016-01-01

    This article examines how Web 2.0 technologies can be used to "flip" the online classroom by creating asynchronous workshops in social environments where immediacy and social presence can be maximized. Using experience teaching several communication and writing classes in Google Apps (Google+, Google Hangouts, Google Drive, etc.), I…

  6. Temperature, paternity and asynchronous hatching influence early developmental characteristics of larval Atlantic cod, Gadus morhua

    DEFF Research Database (Denmark)

    Politis, Sebastian Nikitas; Dahlke, Flemming T.; Butts, Ian A.E.;

    2014-01-01

    Offspring, especially during early development, are influenced by both intrinsic properties endowed to them by their parents, extrinsic environmental factors as well as the interplay between genes and the environment. We investigated the effects of paternity (P), temperature (T), and asynchronous...

  7. Introducing group-based asynchronous learning to business education : Reflections on effective course design and delivery

    NARCIS (Netherlands)

    Arnold, I.J.M.; Walker, R.

    2004-01-01

    This paper explores the contribution of virtual tools to student learning within full-time management programmes. More specifically, the paper focuses on asynchronous communication tools, considering the scope they offer for group-based collaborative learning outside the classroom. We report on the

  8. The Role of Beliefs and Motivation in Asynchronous Online Learning in College-Level Classes

    Science.gov (United States)

    Xie, Kui; Huang, Kun

    2014-01-01

    Epistemic and learning beliefs were found to affect college students' cognitive engagement and study strategies, as well as motivation in classroom settings. However, the relationships between epistemic and learning beliefs, motivation, learning perception, and students' actual learning participation in asynchronous online settings have been…

  9. A Study of Synchronous versus Asynchronous Collaboration in an Online Business Writing Class

    Science.gov (United States)

    Mabrito, Mark

    2006-01-01

    A case study examined the collaborative experiences of students in an online business writing classroom. The purpose was to examine the same groups of students working on collaborative writing assignments in both a synchronous (real-time) and an asynchronous (non-real-time) discussion forum. This study focused on examining the amount, pattern, and…

  10. Asynchronous Knowledge Sharing and Conversation Interaction Impact on Grade in an Online Business Course

    Science.gov (United States)

    Strang, Kenneth David

    2011-01-01

    Student knowledge sharing and conversation theory interactions were coded from asynchronous discussion forums to measure the effect of learning-oriented utterances on academic performance. The sample was 3 terms of an online business course (in an accredited MBA program) at a U.S.-based university. Correlation, stepwise regression, and multiple…

  11. Selected Issues in Persistent Asynchronous Adaptive Specialization for Generic Functional Array Programming

    NARCIS (Netherlands)

    C. Grelck; H. Wiesinger

    2014-01-01

    Asynchronous adaptive specialization of rank- and shape-generic code for processing immutable (purely functional) multi-dimensional arrays has proven to be an effective technique to reconcile the desire for abstract specifications with the need to achieve reasonably high performance in sequential as

  12. Tagging Thinking Types in Asynchronous Discussion Groups: Effects on Critical Thinking

    Science.gov (United States)

    Schellens, T.; Van Keer, H.; De Wever, B.; Valcke, M.

    2009-01-01

    The present study focuses on the use of thinking types as a possible way to structure university students' discourse in asynchronous discussion groups and consequently promote their learning. More specifically, the aim of the study is to determine how requiring students to label their contributions by means of De Bono's (1991) thinking hats…

  13. From Discrete-Time Models to Continuous-Time, Asynchronous Models of Financial Markets

    NARCIS (Netherlands)

    K. Boer-Sorban (Katalin); U. Kaymak (Uzay); J. Spiering (Jaap)

    2006-01-01

    textabstractMost agent-based simulation models of financial markets are discrete-time in nature. In this paper, we investigate to what degree such models are extensible to continuous-time, asynchronous modelling of financial markets. We study the behaviour of a learning market maker in a market with

  14. Embedded Vehicle Speed Estimation System Using an Asynchronous Temporal Contrast Vision Sensor

    Directory of Open Access Journals (Sweden)

    D. Bauer

    2007-01-01

    Full Text Available This article presents an embedded multilane traffic data acquisition system based on an asynchronous temporal contrast vision sensor, and algorithms for vehicle speed estimation developed to make efficient use of the asynchronous high-precision timing information delivered by this sensor. The vision sensor features high temporal resolution with a latency of less than 100 μs, wide dynamic range of 120 dB of illumination, and zero-redundancy, asynchronous data output. For data collection, processing and interfacing, a low-cost digital signal processor is used. The speed of the detected vehicles is calculated from the vision sensor's asynchronous temporal contrast event data. We present three different algorithms for velocity estimation and evaluate their accuracy by means of calibrated reference measurements. The error of the speed estimation of all algorithms is near zero mean and has a standard deviation better than 3% for both traffic flow directions. The results and the accuracy limitations as well as the combined use of the algorithms in the system are discussed.

  15. Theoretically Based Pedagogical Strategies Leading to Deep Learning in Asynchronous Online Gerontology Courses

    Science.gov (United States)

    Majeski, Robin; Stover, Merrily

    2007-01-01

    Online learning has enjoyed increasing popularity in gerontology. This paper presents instructional strategies grounded in Fink's (2003) theory of significant learning designed for the completely asynchronous online gerontology classroom. It links these components with the development of mastery learning goals and provides specific guidelines for…

  16. The Development of a Content Analysis Model for Assessing Students' Cognitive Learning in Asynchronous Online Discussions

    Science.gov (United States)

    Yang, Dazhi; Richardson, Jennifer C.; French, Brian F.; Lehman, James D.

    2011-01-01

    The purpose of this study was to develop and validate a content analysis model for assessing students' cognitive learning in asynchronous online discussions. It adopted a fully mixed methods design, in which qualitative and quantitative methods were employed sequentially for data analysis and interpretation. Specifically, the design was a…

  17. Trajectory exploration within asynchronous binary asteroid systems using refined Lagrangian coherent structures

    Science.gov (United States)

    Shang, Haibin; Wu, Xiaoyu; Cui, Pingyuan

    2017-02-01

    Ground observations have found that asynchronous systems constitute most of the population of the near-Earth binary asteroids. This paper concerns the trajectory of a particle in the asynchronous system which is systematically described using periodic ellipsoidal and spherical body models. Due to the non-autonomous characteristics of the asynchronous system, Lagrangian coherent structures (LCS) are employed to identify the various dynamical behaviors. To enhance the accuracy of LCS, a robust LCS finding algorithm is developed incorporating hierarchical grid refinement, one-dimensional search and variational theory verification. In this way, the intricate dynamical transport boundaries are detected efficiently. These boundaries indicate that a total of 15 types of trajectories exist near asynchronous binary asteroids. According to their Kepler energy variations, these trajectories can be grouped into four basic categories, i.e., transitory, escape, impact and flyby trajectories. Furthermore, the influence of the ellipsoid's spin period on the dynamical behavior is discussed in the context of the change of dynamical regions. We found that the transitory and impact motions occur easily in the synchronous-like binary systems, in which the rotation period of the ellipsoid is nearly equal to that of the mutual orbit. Meanwhile, the results confirm a positive correlation between the spinning rate of the ellipsoid and the probability of the escape and flyby trajectories. The LCS also reveal a marked increase in trajectory diversity after a larger initial energy is selected.

  18. Learning about the Literacy Development of English Language Learners in Asynchronous Online Discussions

    Science.gov (United States)

    De Oliveira, Luciana C.; Olesova, Larisa

    2013-01-01

    This study examined asynchronous online discussions in the online course "English Language Development" to identify themes related to participants' learning about the language and literacy development of English Language Learners when they facilitated online discussions to determine whether the participants developed sufficient…

  19. 3D asynchronous particle tracking in single and dual continuum matrix-fractures. Application to nuclear waste storage; Modelisation 3D du transport particulaire asynchrone en simple et double continuum matrice-fractures: application au stockage de dechets nucleaires

    Energy Technology Data Exchange (ETDEWEB)

    Lam, M.Ph

    2008-06-15

    This PhD research was conducted as a collaboration between Laboratoire National d'Hydraulique et Environnement (LNHE) from EDF R and D and the Institut de Mecanique des Fluides de Toulouse (IMFT) in the frame of a CIFRE contract. This PhD thesis aims at providing LNHE a reliable numerical model to study the feasibility of a nuclear waste storage in deep geological structures. The main focus of the thesis is put on developing and implementing a Random Walk Particle Method (RWPM) to model contaminant transport in 3D heterogeneous and fractured porous media. In its first part, the report presents the Lagrangian particle tracking method used to model transport in heterogeneous media with a direct high resolution approach. The solute plume is discretized into concentration packets: particles. The model tracks each particle based on a time-explicit displacement algorithm according to an advective component and a diffusive random component. The method is implemented on a hydraulic model discretized on a 3D unstructured tetrahedral finite element mesh. We focus on techniques to overcome problems due to the discontinuous transport parameters and the unstructured mesh. First, we introduce an asynchronous time-stepping approach to deal with the numerical and overshoot errors that occur with conventional RWPM. Then, a filtering method is applied to smooth discontinuous transport parameters (pre-processing). Finally, once the particle displacements are computed, we propose several filtering and sampling methods to obtain concentrations from particle positions (post-processing). Applications of these methods are presented with cases of tracer advection-dispersion in homogeneous and heterogeneous media. For dense fracture networks, direct high resolution methods are very time consuming and need a lot of computational resources. So, as an alternative to the discrete approach, a dual-continuum representation is used, in the second part of the report, to describe the porous

  20. Application-Controlled Parallel Asynchronous Input/Output Utility

    Science.gov (United States)

    Clune, Thomas; Zhou, Shujia

    2010-01-01

    A software utility tool has been designed to alleviate file system I/O performance bottlenecks to which many high-end computing (HEC) applications fall prey because of the relatively large volume of data generated for a given amount of computational work. In an effort to reduce computing resource waste, and to improve sustained performance of these HEC applications, a lightweight software utility has been designed to circumvent bandwidth limitations of typical HEC file systems by exploiting the faster inter-processor bandwidth to move output data from compute nodes to designated I/O nodes as quickly as possible, thereby minimizing the I/O wait time. This utility has successfully demonstrated a significant performance improvement within a major NASA weather application.

  1. Efficient Protocols for Principal Eigenvector Computation over Private Data

    Directory of Open Access Journals (Sweden)

    Manas A. Pathak

    2011-12-01

    Full Text Available In this paper we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy constraints. Our proposed protocol is based on secure multi-party computation with a semi-honest arbitrator who deals with data encrypted by the other parties using an additive homomorphic cryptosystem. We augment the protocol with randomization and oblivious transfer to make it difficult for any party to estimate properties of the data belonging to other parties from the intermediate steps. The previous approaches towards this problem were based on expensive QR decomposition of correlation matrices, we present an efficient algorithm using the power iteration method. We present an analysis of the correctness, security, and efficiency of protocol along with experimental results using a prototype implementation over simulated data and USPS handwritten digits dataset.

  2. On the Power of Correlated Randomness in Secure Computation

    DEFF Research Database (Denmark)

    Ishai, Yuval; Kushilevitz, Eyal; Meldgaard, Sigurd Torkel

    2013-01-01

    We investigate the extent to which correlated secret randomness can help in secure computation with no honest majority. It is known that correlated randomness can be used to evaluate any circuit of size s with perfect security against semi-honest parties or statistical security against malicious...... positive and negative results on unconditionally secure computation with correlated randomness. Concretely, we obtain the following results. Minimizing communication. Any multiparty functionality can be realized, with perfect security against semi-honest parties or statistical security against malicious...... parties, where the communication complexity grows linearly with s. This leaves open two natural questions: (1) Can the communication complexity be made independent of the circuit size? (2) Is it possible to obtain perfect security against malicious parties? We settle the above questions, obtaining both...

  3. A newly proposed disease condition produced by light exposure during night: asynchronization.

    Science.gov (United States)

    Kohyama, Jun

    2009-04-01

    The bedtime of preschoolers/pupils/students in Japan has become progressively later with the result sleep duration has become progressively shorter. With these changes, more than half of the preschoolers/pupils/students in Japan recently have complained of daytime sleepiness, while approximately one quarter of junior and senior high school students in Japan reportedly suffer from insomnia. These preschoolers/pupils/students may be suffering from behaviorally induced insufficient sleep syndrome due to inadequate sleep hygiene. If this diagnosis is correct, they should be free from these complaints after obtaining sufficient sleep by avoiding inadequate sleep hygiene. However, such a therapeutic approach often fails. Although social factors are often involved in these sleep disturbances, a novel clinical notion--asynchronization--can further a deeper understanding of the pathophysiology of these disturbances. The essence of asynchronization is a disturbance in various aspects (e.g., cycle, amplitude, phase and interrelationship) of the biological rhythms that normally exhibit circadian oscillation, presumably involving decreased activity of the serotonergic system. The major trigger of asynchronization is hypothesized to be a combination of light exposure during the night and a lack of light exposure in the morning. In addition to basic principles of morning light and an avoidance of nocturnal light exposure, presumable potential therapeutic approaches for asynchronization involve both conventional ones (light therapy, medications (hypnotics, antidepressants, melatonin, vitamin B12), physical activation, chronotherapy) and alternative ones (kampo, pulse therapy, direct contact, control of the autonomic nervous system, respiration (qigong, tanden breathing), chewing, crawling). A morning-type behavioral preference is described in several of the traditional textbooks for good health. The author recommends a morning-type behavioral lifestyle as a way to reduce

  4. BPEL based asynchronous interaction and composition of RESTful Web service%基于BPEL的RESTful Web服务异步交互及组合研究

    Institute of Scientific and Technical Information of China (English)

    铁威; 黄志球; 王进

    2013-01-01

    RESTful Web service has become a primary method to publish services in cloud computing, due to its lightweight and specific semantics. However, because RESTful Web service only support synchronous interaction, it is difficult of using synchronous composition to meet the requirement of the complex business process. Therefore, the paper proposed a callback based asynchronous interaction approach under REST style. The approach enables the composition of both synchronous and asynchronous RESTful Web services by extending the BPEL meta model. The architecture of the execution engine for the extended BPEL was designed and implemented as well.%RESTful Web服务由于其轻量级和明确语义等特性,已成为云计算环境下发布服务的首要方法.但是,由于RESTful Web服务仅支持同步的交互方式,面对复杂业务逻辑时,难以通过服务组合的方式来满足业务需求.针对这些问题,提出了一种基于回调的RESTful Web服务异步交互方式,通过扩展BPEL元模型,增加了BPEL对异步RESTful Web服务组合的支持,并设计实现了扩展后的BPEL执行引擎.

  5. Study on Asynchronous MES Teaching Approach for Discipline of College Japanese in Characteristic Campus of Agriculture-related Universities

    Institute of Scientific and Technical Information of China (English)

    Ming; XU

    2015-01-01

    This paper made scientific analysis on asynchronous MES for discipline of College Japanese in characteristic campus of agriculturerelated universities. It made modular design for discipline of College Japanese in emotional concept,language skill,language knowledge,learning strategy,and cultural quality combining students’ demands and education and teaching rules. Relying on Internet and Mobile Internet aided teaching platform,it came up with " Integration- Separation- Integration" asynchronous teaching approach. The practice indicates that teaching effect of such approach is remarkable. However,asynchronous MES for discipline of College Japanese raises higher requirement for interaction between teachers and students and voluntary effort of teachers.

  6. A Local Distributed Peer-to-Peer Algorithm Using Multi-Party Optimization Based Privacy Preservation for Data Mining Primitive Computation

    Data.gov (United States)

    National Aeronautics and Space Administration — This paper proposes a scalable, local privacy-preserving algorithm for distributed peer-to-peer (P2P) data aggregation useful for many advanced data mining/analysis...

  7. Contributions a l'etude et a l'application industrielle de la machine asynchrone

    Science.gov (United States)

    Ouhrouche, Mohand-Ameziane

    The work presented in this thesis, done in the Electrical Drives Laboratory of Electrical and Computer Engineering Department, deals with the industrial applications of a three-phase induction machine (electrical drives and electricity generation). This thesis, characterized by its multidisciplinary content, has two major parts. The first one deals with the on-line and off-line parametric identification of the induction machine model necessary to achieve accurate vector control strategy. The second part, which is a resume of a research work sponsored by Hydro-Quebec, deals with the application of an induction machine in Asynchronous Non Utility Generators units (ANUG). As it is shown in the following, major scientific contributions are made in both two parts. In the first part of our research work, we propose a new speed sensorless vector control strategy for an induction machine, which is adaptive to the rotor resistance variations. The proposed control strategy is based on the Extended Kalman Filter approach and a decoupling controller which takes into account the rotor resistance variations. The consideration of coupled electrical and mechanical modes leads to a fifth order nonlinear model of the induction machine. The load torque is taken as a function of the rotor angular speed. The Extended Kalman Filter, based on the process's nonlinear (bilinear) model, estimate simultaneously the rotor resistance, angular speed and the flux vector from the startup to the steady state equilibrium point. The machine-converter-control system is implemented in MATLAB/SIMULINK environment and the obtained results confirm the robustness of the proposed scheme. As in the electrical drives erea, the induction machine is now widely used by small to medium power Non Utility Generator units (NUG) to produce electricity. In Quebec, these NUGs units are integrated into the Hydro-Quebec 25 kV distribution system via transformer which exhibit nonlinear characteristics. We have shown by

  8. Practicing Nonverbal Awareness in the Asynchronous Online Classroom

    Science.gov (United States)

    Kelly, Stephanie; Claus, Christopher J.

    2015-01-01

    In this unit activity, students understand that social presence-one's ability to project a personality through computer-mediated communication-is critical for creating an effective online learning environment (Christen, Kelly, Fall, & Snyder, in press; Jorgensen, 2002; Kehrwald, 2010; O'Sullivan, Hunt, & Lippert, 2004). Without…

  9. The Use of Computer-Mediated Communication To Enhance Subsequent Face-to-Face Discussions.

    Science.gov (United States)

    Dietz-Uhler, Beth; Bishop-Clark, Cathy

    2001-01-01

    Describes a study of undergraduate students that assessed the effects of synchronous (Internet chat) and asynchronous (Internet discussion board) computer-mediated communication on subsequent face-to-face discussions. Results showed that face-to-face discussions preceded by computer-mediated communication were perceived to be more enjoyable.…

  10. Computer Literacy and Online Learning Attitude toward GSOE Students in Distance Education Programs

    Science.gov (United States)

    Li, Lung-Yu; Lee, Long-Yuan

    2016-01-01

    The purpose of this study was to explore graduate students' competencies in computer use and their attitudes toward online learning in asynchronous online courses of distance learning programs in a Graduate School of Education (GSOE) in Taiwan. The research examined the relationship between computer literacy and the online learning attitudes of…

  11. Adaptation of the EPEC-EM™ Curriculum in a Residency with Asynchronous Learning

    Directory of Open Access Journals (Sweden)

    Gisondi, Michael A

    2010-12-01

    Full Text Available Objective: The Education in Palliative and End-of-life Care for Emergency Medicine Project (EPEC™-EM is a comprehensive curriculum in palliative and end-of-life care for emergency providers. We assessed the adaptation of this course to an EM residency program using synchronous and asynchronous learning.Methods: Curriculum adaptation followed Kern’s standardized six-step curriculum design process. Post-graduate year (PGY 1-4 residents were taught all EPEC™-EM cognitive domains, divided as seven synchronous and seven asynchronous modules. All synchronous modules featured large group didactic lectures and review of EPEC™-EM course materials. Asynchronous modules use only EPEC™-EM electronic course media for resident self-study. Targeted evaluation for EPEC™-EM knowledge objectives was conducted by a prospective case-control crossover study, with synchronous learning serving as the quasi-control, using validated exam tools. We compared de-identified test scores for effectiveness of learning method, using aggregate group performance means for each learning strategy.Results: Of 45 eligible residents 55% participated in a pre-test for local needs analysis, and 78% completed a post-test to measure teaching method effect. Post-test scores improved across all EPEC™-EM domains, with a mean improvement for synchronous modules of +28% (SD=9 and a mean improvement for asynchronous modules of +30% (SD=18. The aggregate mean difference between learning methods was 1.9% (95% CI -15.3, +19.0. Mean test scores of the residents who completed the post-test were: synchronous modules 77% (SD=12; asynchronous modules 83% (SD=13; all modules 80% (SD=12.Conclusion: EPEC™-EM adapted materials can improve resident knowledge of palliative medicine domains, as assessed through validated testing of course objectives. Synchronous and asynchronous learning methods appear to result in similar knowledge transfer, feasibly allowing some course content to be

  12. On the Complexity of Computing Optimal Private Park-and-Ride Plans

    DEFF Research Database (Denmark)

    Olsen, Martin

    2013-01-01

    n the setting of secure multiparty computation, a set of parties wish to compute a joint function of their inputs, while preserving properties like privacy, correctness, and independence of inputs. One security property that has typically not been considered in the past relates to the length...... or size of the parties inputs. This is despite the fact that in many cases the size of a party’s input can be confidential. The reason for this omission seems to have been the folklore belief that, as with encryption, it is impossible to carry out non-trivial secure computation while hiding the size...... that the folklore belief may not be fully accurate. In this work, we initiate a theoretical study of input-size hiding secure computation, and focus on the two-party case. We present definitions for this task, and deal with the subtleties that arise in the setting where there is no a priori polynomial bound...

  13. SEU/SEL Resistant Ultra-Low Power Asynchronous Processor Design for Low-Temperature Applications Project

    Data.gov (United States)

    National Aeronautics and Space Administration — This Phase I SBIR proposal seeks funding to develop a radiation-hardened circuit architecture to achieve SEU and SEL immunity by using delay-insensitive asynchronous...

  14. Assessment of myocardial adrenergic innervation in patients with sick sinus syndrome: effect of asynchronous ventricular activation from ventricular apical stimulation

    OpenAIRE

    Marketou, M E; Simantirakis, E N; Prassopoulos, V K; Chrysostomakis, S I; Velidaki, A A; Karkavitsas, N S; Vardas, P.E.

    2002-01-01

    Objective: To investigate ventricular sympathetic innervation in patients with sick sinus syndrome and to detect regional deterioration of adrenergic innervation caused by asynchronous ventricular activation from right ventricular pacing.

  15. Magnetic Random Access Memory based non-volatile asynchronous Muller cell for ultra-low power autonomous applications

    Energy Technology Data Exchange (ETDEWEB)

    Di Pendina, G., E-mail: gregory.dipendina@cea.fr, E-mail: eldar.zianbetov@cea.fr, E-mail: edith.beigne@cea.fr; Zianbetov, E., E-mail: gregory.dipendina@cea.fr, E-mail: eldar.zianbetov@cea.fr, E-mail: edith.beigne@cea.fr [Univ. Grenoble Alpes, INAC-SPINTEC, F-38000 Grenoble (France); CNRS, SPINTEC, F-38000 Grenoble (France); CEA, INAC-SPINTEC, F-38000 Grenoble (France); Beigne, E., E-mail: gregory.dipendina@cea.fr, E-mail: eldar.zianbetov@cea.fr, E-mail: edith.beigne@cea.fr [Univ. Grenoble Alpes, CEA, LETI, F-38000 Grenoble (France)

    2015-05-07

    Micro and nano electronic integrated circuit domain is today mainly driven by the advent of the Internet of Things for which the constraints are strong, especially in terms of power consumption and autonomy, not only during the computing phases but also during the standby or idle phases. In such ultra-low power applications, the circuit has to meet new constraints mainly linked to its changing energetic environment: long idle phases, automatic wake up, data back-up when the circuit is sporadically turned off, and ultra-low voltage power supply operation. Such circuits have to be completely autonomous regarding their unstable environment, while remaining in an optimum energetic configuration. Therefore, we propose in this paper the first MRAM-based non-volatile asynchronous Muller cell. This cell has been simulated and characterized in a very advanced 28 nm CMOS fully depleted silicon-on-insulator technology, presenting good power performance results due to an extremely efficient body biasing control together with ultra-wide supply voltage range from 160 mV up to 920 mV. The leakage current can be reduced to 154 pA thanks to reverse body biasing. We also propose an efficient standard CMOS bulk version of this cell in order to be compatible with different fabrication processes.

  16. Synchronization, retiming and OTDM of an asynchronous 10 Gigabit Ethernet NRZ packet using a time lens for Terabit Ethernet

    DEFF Research Database (Denmark)

    Hu, Hao; Laguardia Areal, Janaina; Mulvad, Hans Christian Hansen;

    2011-01-01

    An asynchronous 10G Ethernet packet is synchronized and retimed to a master clock using a time lens. The NRZ packet is converted into an RZ packet and multiplexed with a serial 1.28 Tb/s signal.......An asynchronous 10G Ethernet packet is synchronized and retimed to a master clock using a time lens. The NRZ packet is converted into an RZ packet and multiplexed with a serial 1.28 Tb/s signal....

  17. Analysis of an FBMC/OQAM scheme for asynchronous access in wireless communications

    Science.gov (United States)

    Mattera, Davide; Tanda, Mario; Bellanger, Maurice

    2015-12-01

    The OFDM/OQAM transceiver belongs to the filter-bank-based multicarrier (FBMC) family and, unlike OFDM schemes, it is particularly able to meet the requirements of the physical layer of cognitive radio networks such as high level of adjacent channel leakage ratio and asynchronous communications. The paper proposes and analyzes a new implementation structure, named frequency spreading, for the OFDM/OQAM transceiver. On flat channels, it is equivalent to the standard one in terms of input-output relations, though more complex. On multipath channels, it offers a crucial advantage in terms of equalization, which is performed in the frequency domain, leading to high performance and no additional delay. With its flexibility and level of performance, the analyzed scheme has the potential to outperform OFDM in the asynchronous access context and in cognitive radio networks.

  18. Asynchronous Magnetic Bead Rotation (AMBR Microviscometer for Label-Free DNA Analysis

    Directory of Open Access Journals (Sweden)

    Yunzi Li

    2014-03-01

    Full Text Available We have developed a label-free viscosity-based DNA detection system, using paramagnetic beads as an asynchronous magnetic bead rotation (AMBR microviscometer. We have demonstrated experimentally that the bead rotation period is linearly proportional to the viscosity of a DNA solution surrounding the paramagnetic bead, as expected theoretically. Simple optical measurement of asynchronous microbead motion determines solution viscosity precisely in microscale volumes, thus allowing an estimate of DNA concentration or average fragment length. The response of the AMBR microviscometer yields reproducible measurement of DNA solutions, enzymatic digestion reactions, and PCR systems at template concentrations across a 5000-fold range. The results demonstrate the feasibility of viscosity-based DNA detection using AMBR in microscale aqueous volumes.

  19. Distributed embedded controller development with petri nets application to globally-asynchronous locally-synchronous systems

    CERN Document Server

    Moutinho, Filipe de Carvalho

    2016-01-01

    This book describes a model-based development approach for globally-asynchronous locally-synchronous distributed embedded controllers.  This approach uses Petri nets as modeling formalism to create platform and network independent models supporting the use of design automation tools.  To support this development approach, the Petri nets class in use is extended with time-domains and asynchronous-channels. The authors’ approach uses models not only providing a better understanding of the distributed controller and improving the communication among the stakeholders, but also to be ready to support the entire lifecycle, including the simulation, the verification (using model-checking tools), the implementation (relying on automatic code generators), and the deployment of the distributed controller into specific platforms. Uses a graphical and intuitive modeling formalism supported by design automation tools; Enables verification, ensuring that the distributed controller was correctly specified; Provides flex...

  20. An Asynchronous Time-Division-Multiplexed Network-on-Chip for Real-Time Systems

    DEFF Research Database (Denmark)

    Kasapaki, Evangelia

    . This thesis focuses on the design of Argo, a NOC targeted at hard real-time multi-processor platforms with a GALS timing organization. To support real-time communication, NOCs establish end-to-end connections and provide latency and throughput guarantees for these connections. Argo uses time division...... more flexible timing within its structure, to address signal distribution issues, using a network of synchronous routers. NOCs consist of a switching structure of routers connected by links, with network interfaces (NIs) that connect the processors to the switching structure. Argo uses a novel NI...... design that supports time-predictability, and asynchronous routers that form a time-elastic network. The NI design integrates the DMA functionality and the TDM schedule, and uses dual-ported local memories. The routers combine the router functionality and asynchronous elastic behavior. They also use...