WorldWideScience

Sample records for information-theoretically secret key

  1. Information Theoretic Secret Key Generation: Structured Codes and Tree Packing

    Science.gov (United States)

    Nitinawarat, Sirin

    2010-01-01

    This dissertation deals with a multiterminal source model for secret key generation by multiple network terminals with prior and privileged access to a set of correlated signals complemented by public discussion among themselves. Emphasis is placed on a characterization of secret key capacity, i.e., the largest rate of an achievable secret key,…

  2. Information-theoretically Secret Key Generation for Fading Wireless Channels

    CERN Document Server

    Ye, Chunxuan; Reznik, Alex; Shah, Yogendra; Trappe, Wade; Mandayam, Narayan

    2009-01-01

    The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, and uniquely shared by a given transmitter-receiver pair. The complexity associated with a richly scattering environment implies that the short-term fading process is inherently hard to predict and best modeled stochastically, with rapid decorrelation properties in space, time and frequency. In this paper, we demonstrate how the channel state between a wireless transmitter and receiver can be used as the basis for building practical secret key generation protocols between two entities. We begin by presenting a scheme based on level crossings of the fading process, which is well-suited for the Rayleigh and Rician fading models associated with a richly scattering environment. Our level crossing algorithm is simple, and incorporates a self-authenticating mechanism to prevent adversarial manipulation of message exchanges during the protoco...

  3. Information-Theoretic Secure Verifiable Secret Sharing over RSA Modulus

    Institute of Scientific and Technical Information of China (English)

    QIU Gang; WANG Hong; WEI Shimin; XIAO Guozhen

    2006-01-01

    The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA (Rivest,Shamir,Adleman) modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.

  4. Secret Key Generation From Mobility

    CERN Document Server

    Gungor, Onur; Koksal, C Emre

    2011-01-01

    We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our scheme consists of two phases: in the first phase, legitimate node pair exchanges beacon signals to establish localization information based on noisy observations of these beacons; in the second phase, nodes generate secret key bits via a public discussion. Our problem can be categorized under the source models of information theoretic secrecy, where the distance between the legitimate nodes acts as the observed common randomness. We characterize the achievable secret key bit rate in terms of the observation noise variance at the legitimate nodes and the eavesdropper. This work provides a framework that combines information theoretic secrecy and wireless localization, and proves that the localization information provides a significant additional resource for secret key generation in mobile wireless networks.

  5. Secret Key Crypto Implementations

    Science.gov (United States)

    Bertoni, Guido Marco; Melzani, Filippo

    This chapter presents the algorithm selected in 2001 as the Advanced Encryption Standard. This algorithm is the base for implementing security and privacy based on symmetric key solutions in almost all new applications. Secret key algorithms are used in combination with modes of operation to provide different security properties. The most used modes of operation are presented in this chapter. Finally an overview of the different techniques of software and hardware implementations is given.

  6. Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security

    CERN Document Server

    Moses, William K; 10.5121/ijnsa.2011.3601

    2011-01-01

    We consider the problem of rational secret sharing introduced by Halpern and Teague [1], where the players involved in secret sharing play only if it is to their advantage. This can be characterized in the form of preferences. Players would prefer to get the secret than to not get it and secondly with lesser preference, they would like as few other players to get the secret as possible. Several positive results have already been published to efficiently solve the problem of rational secret sharing but only a handful of papers have touched upon the use of an asynchronous broadcast channel. [2] used cryptographic primitives, [3] used an interactive dealer, and [4] used an honest minority of players in order to handle an asynchronous broadcast channel. In our paper, we propose an m-out-of-n rational secret sharing scheme which can function over an asynchronous broadcast channel without the use of cryptographic primitives and with a non-interactive dealer. This is possible because our scheme uses a small number, ...

  7. ARQ-Based Secret Key Sharing

    CERN Document Server

    Ghany, Mohamed Abdel; Gamal, Hesham El

    2008-01-01

    This paper develops a novel framework for sharing secret keys using existing Automatic Repeat reQuest (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The proposed framework does not assume the availability of any prior channel state information (CSI) and exploits only the one bit ACK/NACK feedback from the legitimate receiver. Compared with earlier approaches, the main innovation lies in the distribution of key bits among multiple ARQ frames. Interestingly, this idea allows for achieving a positive secrecy rate even when the eavesdropper experiences more favorable channel conditions, on average, than the legitimate receiver. In the sequel, we characterize the information theoretic limits of the proposed schemes, develop low complexity explicit implementations, and conclude with numerical results that validate our theoretical claims.

  8. Information theoretically secure, enhanced Johnson noise based key distribution over the smart grid with switched filters.

    Science.gov (United States)

    Gonzalez, Elias; Kish, Laszlo B; Balog, Robert S; Enjeti, Prasad

    2013-01-01

    We introduce a protocol with a reconfigurable filter system to create non-overlapping single loops in the smart power grid for the realization of the Kirchhoff-Law-Johnson-(like)-Noise secure key distribution system. The protocol is valid for one-dimensional radial networks (chain-like power line) which are typical of the electricity distribution network between the utility and the customer. The speed of the protocol (the number of steps needed) versus grid size is analyzed. When properly generalized, such a system has the potential to achieve unconditionally secure key distribution over the smart power grid of arbitrary geometrical dimensions.

  9. Secret key generation via a modified quantum secret sharing protocol

    Science.gov (United States)

    Smith, A. M.; Evans, P. G.; Lawrie, B.; Legré, M.; Lougovski, P.; Ray, W.; Williams, B. P.; Qi, B.; Grice, W. P.

    2015-05-01

    We present and experimentally show a novel protocol for distributing secret information between two and only two parties in a N-party single-qubit Quantum Secret Sharing (QSS) system. We demonstrate this new algorithm with N = 3 active parties over ~6km of telecom. fiber. Our experimental device is based on the Clavis2 Quantum Key Distribution (QKD) system built by ID Quantique but is generalizable to any implementation. We show that any two out of the N parties can build secret keys based on partial information from each other and with collaboration from the remaining N - 2 parties. This algorithm allows for the creation of two-party secret keys were standard QSS does not and significantly reduces the number of resources needed to implement QKD on a highly connected network such as the electrical grid.

  10. Secret Key Generation via a Modified Quantum Secret Sharing Protocol

    Energy Technology Data Exchange (ETDEWEB)

    Smith IV, Amos M [ORNL; Evans, Philip G [ORNL; Lawrie, Benjamin J [ORNL; Legre, Matthieu [ID Quantique, Inc.; Lougovski, Pavel [ORNL; Ray, William R [ORNL; Williams, Brian P [ORNL; Qi, Bing [ORNL; Grice, Warren P [ORNL

    2015-01-01

    We present and experimentally show a novel protocol for distributing secret information between two and only two parties in a N-party single-qubit Quantum Secret Sharing (QSS) system. We demonstrate this new algorithm with N = 3 active parties over 6km of telecom. ber. Our experimental device is based on the Clavis2 Quantum Key Distribution (QKD) system built by ID Quantique but is generalizable to any implementation. We show that any two out of the N parties can build secret keys based on partial information from each other and with collaboration from the remaining N > 2 parties. This algorithm allows for the creation of two-party secret keys were standard QSS does not and signicantly reduces the number of resources needed to implement QKD on a highly connected network such as the electrical grid.

  11. George's secret key to the universe

    CERN Document Server

    Hawking, Lucy; Galfard, Christophe; Parsons, Gary

    2007-01-01

    In their bestselling book for young readers, noted physicist Stephen Hawking and his daughter, Lucy, provide a grand and funny adventure that explains fascinating information about our universe, including Dr. Hawking's latest ideas about black holes. It's the story of George, who's taken through the vastness of space by a scientist, his daughter, and their super-computer named Cosmos. George's Secret Key to the Universe was a New York Times bestseller and a selection of Al's Book Club on the Today show.

  12. Secret Key Generation for a Pairwise Independent Network Model

    CERN Document Server

    Nitinawarat, Sirin; Barg, Alexander; Narayan, Prakash; Reznik, Alex

    2010-01-01

    We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate publicly with all such communication being observed by all the terminals. The objective is to generate a secret key shared by a given subset of terminals at the largest rate possible, with the cooperation of any remaining terminals. Secrecy is required from an eavesdropper that has access to the public interterminal communication. A (single-letter) formula for secret key capacity brings out a natural connection between the problem of secret key generation and a combinatorial problem of maximal packing of Steiner trees in an associated multigraph. An explicit algorithm is proposed for secret key generation based on a maximal packing of Steiner trees in a multigraph; the corresponding maximum rate of Steiner tree packing is thus a lower bound for the secret ...

  13. Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing.

    Science.gov (United States)

    Fujiwara, M; Waseda, A; Nojima, R; Moriai, S; Ogata, W; Sasaki, M

    2016-07-01

    Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir's (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km).

  14. Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing

    Science.gov (United States)

    Fujiwara, M.; Waseda, A.; Nojima, R.; Moriai, S.; Ogata, W.; Sasaki, M.

    2016-07-01

    Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir’s (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km).

  15. Unbreakable distributed storage with quantum key distribution network and password-authenticated secret sharing

    Science.gov (United States)

    Fujiwara, M.; Waseda, A.; Nojima, R.; Moriai, S.; Ogata, W.; Sasaki, M.

    2016-01-01

    Distributed storage plays an essential role in realizing robust and secure data storage in a network over long periods of time. A distributed storage system consists of a data owner machine, multiple storage servers and channels to link them. In such a system, secret sharing scheme is widely adopted, in which secret data are split into multiple pieces and stored in each server. To reconstruct them, the data owner should gather plural pieces. Shamir’s (k, n)-threshold scheme, in which the data are split into n pieces (shares) for storage and at least k pieces of them must be gathered for reconstruction, furnishes information theoretic security, that is, even if attackers could collect shares of less than the threshold k, they cannot get any information about the data, even with unlimited computing power. Behind this scenario, however, assumed is that data transmission and authentication must be perfectly secure, which is not trivial in practice. Here we propose a totally information theoretically secure distributed storage system based on a user-friendly single-password-authenticated secret sharing scheme and secure transmission using quantum key distribution, and demonstrate it in the Tokyo metropolitan area (≤90 km). PMID:27363566

  16. Verifiable Quantum ( k, n)-threshold Secret Key Sharing

    Science.gov (United States)

    Yang, Yu-Guang; Teng, Yi-Wei; Chai, Hai-Ping; Wen, Qiao-Yan

    2011-03-01

    Based on Lagrange interpolation formula and the post-verification mechanism, we show how to construct a verifiable quantum ( k, n) threshold secret key sharing scheme. Compared with the previous secret sharing protocols, ours has the merits: (i) it can resist the fraud of the dealer who generates and distributes fake shares among the participants during the secret distribution phase; Most importantly, (ii) It can check the cheating of the dishonest participant who provides a false share during the secret reconstruction phase such that the authorized group cannot recover the correct secret.

  17. Direct Use of Secret Key in Quantum Cryptography

    CERN Document Server

    Yuen, H P

    2006-01-01

    For single-photon quantum key generation between two users, it is shown that for collective attacks the use of a shared secret key extended via a pseudo-random number generator may simultaneously enhance the security and efficiency of the cryptosystem. This effect arises from the intrinsic performance difference between quantum detectors with versus without knowledge of the key, a purely quantum effect and a new principle for key generation. No intrusion level estimation is needed and the method is directly applicable to realistic systems involving multi-photon sources, losses, noises, and finite-sequence statistical fluctuations. It is suggested that such use of a secret key be routinely incorporated in a quantum key generation system. The use of a secret key in quantum direct encryption is also indicated.

  18. Secret-Key Generation using Correlated Sources and Channels

    CERN Document Server

    Khisti, Ashish; Wornell, Gregory

    2009-01-01

    We study the problem of generating a shared secret key between two terminals in a joint source-channel setup -- the sender communicates to the receiver over a discrete memoryless wiretap channel and additionally the terminals have access to correlated discrete memoryless source sequences. We establish lower and upper bounds on the secret-key capacity. These bounds coincide, establishing the capacity, when the underlying channel consists of independent, parallel and reversely degraded wiretap channels. In the lower bound, the equivocation terms of the source and channel components are functionally additive. The secret-key rate is maximized by optimally balancing the the source and channel contributions. This tradeoff is illustrated in detail for the Gaussian case where it is also shown that Gaussian codebooks achieve the capacity. When the eavesdropper also observes a source sequence, the secret-key capacity is established when the sources and channels of the eavesdropper are a degraded version of the legitima...

  19. MULTI-LEVEL KEY DISTRIBUTION ALGORITHM FOR SECRET KEY RECOVERY SYSTEM

    Directory of Open Access Journals (Sweden)

    TANAPAT MAHAVEERAWAT

    2015-02-01

    Full Text Available Most of Multi Agent Key Recovery Systems are proposed from the assumption that Key Recovery Agents in the system have same availability of security service levelagreement and trust. Which mean, secret key will be shared to each Key Recovery Agent in equal secret’s portion. Practically, each Key Recovery Agent may have their own limitation in terms of securityservice level agreement according to economic cost, complexity and risks. This paper proposedMulti Level Key Distribution Algorithm,which the secret key can be managed into portionsharing and assignto each Key Recovery Agent (KRA according to user’s trust. Withproposed algorithm, the experimental result had shown the advantage in secret sharing size and the system had improved initssecurity from the advantage of multilevel secret key distribution capability.

  20. Secret Key Distillation for Continuous Variable Quantum Key Distribution against Gaussian Classical Eve

    Institute of Scientific and Technical Information of China (English)

    ZHAO Yi-Bo; HAN Zheng-Fu; CHEN Jin-Jian; GU You-Zhen; GUO Guang-Can

    2008-01-01

    The continuous variable quantum key distribution is expected to provide high secret key rate without single photon source and detector, while the lack of the effective key distillation method makes it unpractical under the high loss condition. Here we present a single-bit-reverse-reconciliation protocol against Gaussian classical Eve,which can distill the secret key through practical imperfect error correction with high efficiency. The simulation results show that this protocol can distill secret keys even when the transmission fibre is longer than 150 km,which may make the continuous variable scheme to outvie the single photon one.

  1. Noncoherent capacity of secret-key agreement with public discussion

    KAUST Repository

    Agrawal, Anurag

    2011-09-01

    We study the noncoherent capacity of secret-key agreement with public discussion over independent identically distributed (i.i.d.) Rayleigh fading wireless channels, where neither the sender nor the receivers have access to instantaneous channel state information (CSI). We present two results. At high signal-to-noise ratio (SNR), the secret-key capacity is bounded in SNR, regardless of the number of antennas at each terminal. Second, for a system with a single antenna at both the legitimate and the eavesdropper terminals and an arbitrary number of transmit antennas, the secret-key capacity-achieving input distribution is discrete, with a finite number of mass points. Numerically we observe that at low SNR, the capacity achieving distribution has two mass points with one of them at the origin. © 2011 IEEE.

  2. Secret Key Agreement: Fundamental Limits and Practical Challenges

    KAUST Repository

    Rezki, Zouheir

    2017-02-15

    Despite the tremendous progress made toward establishing PLS as a new paradigm to guarantee security of communication systems at the physical layerthere is a common belief among researchers and industrials that there are many practical challenges that prevent PLS from flourishing at the industrial scale. Most secure message transmission constructions available to date are tied to strong assumptions on CSI, consider simple channel models and undermine eavesdropping capabilities; thus compromising their practical interest to a big extent. Perhaps arguably, the most likely reasonable way to leverage PLS potential in securing modern wireless communication systems is via secret-key agreement. In the latter setting, the legitimate parties try to agree on a key exploiting availability of a public channel with high capacity which is also accessible to the eavesdropper. Once a key is shared by the legitimate parties, they may use it in a one-time pad encryption, for instance. In this article, we investigate two performance limits of secret-key agreement communications; namely, the secret-key diversity-multiplexing trade-off and the effect of transmit correlation on the secretkey capacity. We show via examples how secretkey agreement offers more flexibility than secure message transmissions. Finally, we explore a few challenges of secret-key agreement concept and propose a few guidelines to overturn them.

  3. Secret key rates for an encoded quantum repeater

    Science.gov (United States)

    Bratzik, Sylvia; Kampermann, Hermann; Bruß, Dagmar

    2014-03-01

    We investigate secret key rates for the quantum repeater using encoding [L. Jiang et al., Phys. Rev. A 79, 032325 (2009), 10.1103/PhysRevA.79.032325] and compare them to the standard repeater scheme by Briegel, Dür, Cirac, and Zoller. The former scheme has the advantage of a minimal consumption of classical communication. We analyze the trade-off in the secret key rate between the communication time and the required resources. For this purpose we introduce an error model for the repeater using encoding which allows for input Bell states with a fidelity smaller than one, in contrast to the model given by L. Jiang et al. [Phys. Rev. A 79, 032325 (2009), 10.1103/PhysRevA.79.032325]. We show that one can correct additional errors in the encoded connection procedure of this repeater and develop a suitable decoding algorithm. Furthermore, we derive the rate of producing entangled pairs for the quantum repeater using encoding and give the minimal parameter values (gate quality and initial fidelity) for establishing a nonzero secret key. We find that the generic quantum repeater is optimal regarding the secret key rate per memory per second and show that the encoded quantum repeater using the simple three-qubit repetition code can even have an advantage with respect to the resources compared to other recent quantum repeater schemes with encoding.

  4. Physical layer secret key generation for fiber-optical networks.

    Science.gov (United States)

    Kravtsov, Konstantin; Wang, Zhenxing; Trappe, Wade; Prucnal, Paul R

    2013-10-07

    We propose and experimentally demonstrate a method for generating and sharing a secret key using phase fluctuations in fiber optical links. The obtained key can be readily used to support secure communication between the parties. The security of our approach is based on a fundamental asymmetry associated with the optical physical layer: the sophistication of tools needed by an eavesdropping adversary to subvert the key establishment is significantly greater and more costly than the complexity needed by the legitimate parties to implement the scheme. In this sense, the method is similar to the classical asymmetric algorithms (Diffie-Hellman, RSA, etc.).

  5. Interferometric key readable security holograms with secrete-codes

    Indian Academy of Sciences (India)

    Raj Kumar; D Mohan; A K Aggarwal

    2007-03-01

    A new method is described to create secrete-codes in the security holograms for enhancing their anti-counterfeiting characteristics. To imitate these codes is difficult as pure phase objects having complex phase distribution function are used to modulate the object beam that is recorded in conjunction with an encoded interferometric reference beam derived from a key hologram. Lloyd's folding mirror interferometer is used to convert phase variations of the reconstructed wave-front into an intensity pattern for hologram authenticity verification. Creating the secrete-codes through an interferometric reference beam from the key hologram facilitates a multi-stage authenticity verification as well as easy repositioning of the security hologram through a specific Moiré pattern generated during the verification process.

  6. Secret Key and Private Key Constructions for Simple Multiterminal Source Models

    CERN Document Server

    Ye, Chunxuan

    2010-01-01

    We propose an approach for constructing secret and private keys based on the long-known Slepian-Wolf code, due to Wyner, for correlated sources connected by a virtual additive noise channel. Our work is motivated by results of Csisz\\'ar and Narayan which highlight innate connections between secrecy generation by multiple terminals that observe correlated source signals and Slepian-Wolf near-lossless data compression. Explicit procedures for such constructions and their substantiation are provided. The performance of low density parity check channel codes in devising a new class of secret keys is examined.

  7. On the diversity-multiplexing tradeoff of secret-key agreement over multiple-antenna channels

    KAUST Repository

    Zorgui, Marwen

    2014-09-01

    We consider secret-key agreement with public discussion over Rayleigh fading quasi-static channels. First, the secret-key diversity gain and the secret-key multiplexing gain are defined. Then, the secret-key diversity multiplexing tradeoff (DMT) is established. The eavesdropper is shown to \\'steal\\' only transmit antennas. We show that likewise the DMT without secrecy constraint, the secret-key DMT is the same either with or without full channel state information (CSI) at the transmitter (CSI-T). This insensitivity of secret-key DMT toward CSI-T highlights a fundamental difference between secret-key agreement and the wiretap channel whose secret DMT depends crucially on CSI-T. Several secret-key DMT-achieving schemes are presented in case of full CSI-T.

  8. Floodlight quantum key distribution: A practical route to gigabit-per-second secret-key rates

    Science.gov (United States)

    Zhuang, Quntao; Zhang, Zheshen; Dove, Justin; Wong, Franco N. C.; Shapiro, Jeffrey H.

    2016-07-01

    The channel loss incurred in long-distance transmission places a significant burden on quantum key distribution (QKD) systems: they must defeat a passive eavesdropper who detects all the light lost in the quantum channel and does so without disturbing the light that reaches the intended destination. The current QKD implementation with the highest long-distance secret-key rate meets this challenge by transmitting no more than one photon per bit [M. Lucamarini et al., Opt. Express 21, 24550 (2013), 10.1364/OE.21.024550]. As a result, it cannot achieve the Gbps secret-key rate needed for one-time pad encryption of large data files unless an impractically large amount of multiplexing is employed. We introduce floodlight QKD (FL-QKD), which floods the quantum channel with a high number of photons per bit distributed over a much greater number of optical modes. FL-QKD offers security against the optimum frequency-domain collective attack by transmitting less than one photon per mode and using photon-coincidence channel monitoring, and it is completely immune to passive eavesdropping. More importantly, FL-QKD is capable of a 2-Gbps secret-key rate over a 50-km fiber link, without any multiplexing, using available equipment, i.e., no new technology need be developed. FL-QKD achieves this extraordinary secret-key rate by virtue of its unprecedented secret-key efficiency, in bits per channel use, which exceeds those of state-of-the-art systems by two orders of magnitude.

  9. Analysis of Secret Key Randomness Exploiting the Radio Channel Variability

    Directory of Open Access Journals (Sweden)

    Taghrid Mazloum

    2015-01-01

    Full Text Available A few years ago, physical layer based techniques have started to be considered as a way to improve security in wireless communications. A well known problem is the management of ciphering keys, both regarding the generation and distribution of these keys. A way to alleviate such difficulties is to use a common source of randomness for the legitimate terminals, not accessible to an eavesdropper. This is the case of the fading propagation channel, when exact or approximate reciprocity applies. Although this principle has been known for long, not so many works have evaluated the effect of radio channel properties in practical environments on the degree of randomness of the generated keys. To this end, we here investigate indoor radio channel measurements in different environments and settings at either 2.4625 GHz or 5.4 GHz band, of particular interest for WIFI related standards. Key bits are extracted by quantizing the complex channel coefficients and their randomness is evaluated using the NIST test suite. We then look at the impact of the carrier frequency, the channel variability in the space, time, and frequency degrees of freedom used to construct a long secret key, in relation to the nature of the radio environment such as the LOS/NLOS character.

  10. Architecture for the Secret-Key BC3 Cryptography Algorithm

    Directory of Open Access Journals (Sweden)

    Arif Sasongko

    2011-08-01

    Full Text Available Cryptography is a very important aspect in data security. The focus of research in this field is shifting from merely security aspect to consider as well the implementation aspect. This paper aims to introduce BC3 algorithm with focus on its hardware implementation. It proposes architecture for the hardware implementation for this algorithm. BC3 algorithm is a secret-key cryptography algorithm developed with two considerations: robustness and implementation efficiency. This algorithm has been implemented on software and has good performance compared to AES algorithm. BC3 is improvement of BC2 and AE cryptographic algorithm and it is expected to have the same level of robustness and to gain competitive advantages in the implementation aspect. The development of the architecture gives much attention on (1 resource sharing and (2 having single clock for each round. It exploits regularity of the algorithm. This architecture is then implemented on an FPGA. This implementation is three times smaller area than AES, but about five times faster. Furthermore, this BC3 hardware implementation has better performance compared to BC3 software both in key expansion stage and randomizing stage. For the future, the security of this implementation must be reviewed especially against side channel attack.

  11. One Time Secret Key Mechanism for Mobile Communication

    Directory of Open Access Journals (Sweden)

    Vasu.R

    2011-06-01

    Full Text Available Mobile communication is playing a vital role in the current technical world and becoming more popularand prevalent across the world everyday at one end and many security problems are arising at the otherend. To overcome these security problems many security mechanisms for mobile communications havebeen introduced in the literature. Among these mechanisms, authentication plays a quite important rolein the entire mobile network system and acts as the first defense against attackers since it ensures thecorrectness of the identities of distributed communication entities before they engage in any othercommunication activity. In this paper, we propose a novel authentication mechanism, called the nestedone-time secret mechanism, efficient for mobile communication environment which mainly focus on thesecurity issues of mobile communication and also overcome the problem of high computational andcommunication cost with good result in reducing the cost of computational and communication cost fromthe existing system, the cost reduction is possible by reducing the usage of the memory for key generationin the proposed scheme and the experimental result of the proposed scheme is also been showed in thispaper.

  12. Hash Functions and Information Theoretic Security

    Science.gov (United States)

    Bagheri, Nasour; Knudsen, Lars R.; Naderi, Majid; Thomsen, Søren S.

    Information theoretic security is an important security notion in cryptography as it provides a true lower bound for attack complexities. However, in practice attacks often have a higher cost than the information theoretic bound. In this paper we study the relationship between information theoretic attack costs and real costs. We show that in the information theoretic model, many well-known and commonly used hash functions such as MD5 and SHA-256 fail to be preimage resistant.

  13. Hash functions and information theoretic security

    DEFF Research Database (Denmark)

    Bagheri, Nasoor; Knudsen, Lars Ramkilde; Naderi, Majid;

    2009-01-01

    Information theoretic security is an important security notion in cryptography as it provides a true lower bound for attack complexities. However, in practice attacks often have a higher cost than the information theoretic bound. In this paper we study the relationship between information theoretic...... attack costs and real costs. We show that in the information theoretic model, many well-known and commonly used hash functions such as MD5 and SHA-256 fail to be preimage resistant....

  14. Restrictive blind issuing of secret-key certificates in parallel mode

    NARCIS (Netherlands)

    Brands, S.A.

    1995-01-01

    Recently a class of secret-key certificate issuing protocols has been proposed that is believed to be restrictive blind when run in sequential mode. In this report an immunization technique is proposed for modifying these secret-key certificate issuing protocols in order to make them restrictive bli

  15. Secret-Key Agreement with Public Discussion subject to an Amplitude Constraint

    KAUST Repository

    Zorgui, Marwen

    2016-04-06

    This paper considers the problem of secret-key agreement with public discussion subject to a peak power constraint A on the channel input. The optimal input distribution is proved to be discrete with finite support. To overcome the computationally heavy search for the optimal discrete distribution, several suboptimal schemes are proposed and shown numerically to perform close to the capacity. Moreover, lower and upper bounds for the secret-key capacity are provided and used to prove that the secret-key capacity converges for asymptotic high values of A, to the secret-key capacity with an average power constraint A2. Finally, when the amplitude constraint A is small (A ! 0), the secret-key capacity is proved to be asymptotically equal to the capacity of the legitimate user with an amplitude constraint A and no secrecy constraint.

  16. The Diversity-Multiplexing Tradeoff of Secret-Key Agreement over Multiple-Antenna Channels

    KAUST Repository

    Zorgui, Marwen

    2015-10-26

    We study the problem of secret-key agreement between two legitimate parties, Alice and Bob, in presence an of eavesdropper Eve. There is a public channel with unlimited capacity that is available to the legitimate parties and is also observed by Eve. Our focus is on Rayleigh fading quasi-static channels. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge of their channels. We study the system in the high-power regime. First, we define the secret-key diversity gain and the secret-key multiplexing gain. Second, we establish the secret-key diversity multiplexing tradeoff (DMT) under no channel state information (CSI) at the transmitter (CSI-T). The eavesdropper is shown to “steal” only transmit antennas. We show that, likewise the DMT without secrecy constraint, the secret-key DMT is the same either with or without full channel state information at the transmitter. This insensitivity of secret-key DMT toward CSI-T features a fundamental difference between secret-key agreement and the wiretap channel, in which secret DMT depends heavily on CSI-T. Finally, we present several secret-key DMT-achieving schemes in case of full CSI-T. We argue that secret DMT-achieving schemes are also key DMT-achieving. Moreover, we show formally that artificial noise (AN), likewise zero-forcing (ZF), is DMT-achieving. We also show that the public feedback channel improves the outage performance without having any effect on the DMT.

  17. A New Secret key Agreement Scheme in a Four-Terminal Network

    CERN Document Server

    Babaheidarian, Parisa; Aref, Mohammad Reza

    2011-01-01

    A new scenario for generating a secret key and two private keys among three Terminals in the presence of an external eavesdropper is considered. Terminals 1, 2 and 3 intend to share a common secret key concealed from the external eavesdropper (Terminal 4) and simultaneously, each of Terminals 1 and 2 intends to share a private key with Terminal 3 while keeping it concealed from each other and from Terminal 4. All four Terminals observe i.i.d. outputs of correlated sources and there is a public channel from Terminal 3 to Terminals 1 and 2. An inner bound of the "secret key-private keys capacity region" is derived and the single letter capacity regions are obtained for some special cases.

  18. Robust recognition via information theoretic learning

    CERN Document Server

    He, Ran; Yuan, Xiaotong; Wang, Liang

    2014-01-01

    This Springer Brief represents a comprehensive review of information theoretic methods for robust recognition. A variety of information theoretic methods have been proffered in the past decade, in a large variety of computer vision applications; this work brings them together, attempts to impart the theory, optimization and usage of information entropy.The?authors?resort to a new information theoretic concept, correntropy, as a robust measure and apply it to solve robust face recognition and object recognition problems. For computational efficiency,?the brief?introduces the additive and multip

  19. Securing AODV for MANETs using Message Digest with Secret Key

    Directory of Open Access Journals (Sweden)

    Mr. Kamaljit Lakhtaria

    2009-10-01

    Full Text Available Due to lack of the infrastructure, open peer-to-peerarchitecture, shared wireless medium, limited resourceconstraints and highly dynamic topology, MANETs (Mobile AdhocNetworks are frequently established in insecureenvironments, which make them more vulnerable to attacks.These attacks are initiated by sharing malicious nodes againstdifferent services of network. The binding force in thesenetworks is routing protocol, which is a common target ofmalicious nodes. MANETs routing protocols are being developedwithout having security in mind. Ad-hoc On-Demand DistanceVector (AODV is one such widely used routing protocol that isat present undergo extensive research and development. AODVis based on distance vector routing, but here the updates areshared not on a periodic basis but on an as per demand basis.The control packets contain a hop-count and sequence numberfield which recognizes the freshness of routing. These fields areeditable, so it creates a possible susceptibility that is frequentlyabused by malicious nodes to advertise false better routes. Aswell as, transmission of routing updates in form of clear text alsoreveals crucial information about the network topology, which isagain a probable security danger. In this paper we are presentinga novel and practical security mechanism for securing the AODVrouting protocol that protects against a number of attacks carriedout in MANETs. We will present message digest with secret keymechanism to secure AODV messages, which is very effective,and less power consuming security solution for MANETs.

  20. Secret-key Agreement with Channel State Information at the Transmitter

    CERN Document Server

    Khisti, Ashish; Wornell, Gregory

    2010-01-01

    We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state sequence. The transmitter and the legitimate receiver generate a shared secret key, that remains secret from the eavesdropper. No public discussion channel is available. The state sequence is known noncausally to the transmitter. We derive lower and upper bounds on the secret-key capacity. The lower bound involves constructing a common state reconstruction sequence at the legitimate terminals and binning the set of reconstruction sequences to obtain the secret-key. For the special case of Gaussian channels with additive interference (secret-keys from dirty paper channel) our bounds differ by 0.5 bit/symbol and coincide in the high signal-to-noise-ratio and high interference-to-noise-ratio regimes. For the case when the legitimate receiver is also revealed the state sequence, we...

  1. Information- Theoretic Analysis for the Difficulty of Extracting Hidden Information

    Institute of Scientific and Technical Information of China (English)

    ZHANG Wei-ming; LI Shi-qu; CAO Jia; LIU Jiu-fen

    2005-01-01

    The difficulty of extracting hidden information,which is essentially a kind of secrecy, is analyzed by information-theoretic method. The relations between key rate, message rate, hiding capacity and difficulty of extraction are studied in the terms of unicity distance of stego-key, and the theoretic conclusion is used to analyze the actual extracting attack on Least Significant Bit(LSB) steganographic algorithms.

  2. Rate Regions of Secret Key Sharing in a New Source Model

    CERN Document Server

    Salimi, Somayeh; Aref, Mohammad Reza

    2010-01-01

    A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via a public channel where three users can observe i.i.d. outputs of correlated sources. Each of users 1 and 2 intends to share a secret key with user 3 where user 1 acts as a wiretapper for user 2 and vice versa. In this model, two situations are considered: communication from users 1 and 2 to user 3 (the forward key strategy) and from user 3 to users 1 and 2 (the backward key strategy). In both situations, the goal is sharing a secret key between user 1 and user 3 while leaking no effective information about that key to user 2, and simultaneously, sharing another secret key between user 2 and user 3 while leaking no effective information about the latter key to user 1. This model is motivated by wireless communications when considering user 3 as a base station and users 1 and 2 as network users. In this paper, for both the forw...

  3. A note on parallel executions of restrictive blind issuing protocols for secret-key certificates

    NARCIS (Netherlands)

    Brands, S.A.

    1995-01-01

    The receiver in a restrictive blind certificate issuing protocol can blind the issued public key and the certificate but not a certain blinding-invariant predicate of the secret key. Recently a generally applicable technique was described for designing restrictive blind issuing protocols for a certa

  4. The Sender-Excited Secret Key Agreement Model: Capacity and Error Exponents

    CERN Document Server

    Chou, Tzu-Han; Draper, Stark C

    2011-01-01

    We consider fundamental limits of the secret key generation problem when the sources are randomly excited by the sender and there is a noiseless public discussion channel. In many practical communication settings, the sources or channels may be influenced by some parties involved. Similar to recent works on probing capacity and channels with action-dependent states, our system model captures such a scenario. We derive single-letter expressions for the secret key capacity. Our coding strategy involves wiretap channel coding and a key generation scheme. We show that the secret key capacity is composed of both source- and channel-type randomness. By assuming that the eavesdropper receives a degraded version of the legitimate receiver's observation, we also obtain a capacity result that does not involve any auxiliary random variables, and thus it is amenable to numerical evaluation. By evaluating the capacity for several degraded channels, we show that there is a fundamental interplay between the portion of the s...

  5. Information theoretic approach for accounting classification

    CERN Document Server

    Ribeiro, E M S

    2014-01-01

    In this paper we consider an information theoretic approach for the accounting classification process. We propose a matrix formalism and an algorithm for calculations of information theoretic measures associated to accounting classification. The formalism may be useful for further generalizations, and computer based implementation. Information theoretic measures, mutual information and symmetric uncertainty, were evaluated for daily transactions recorded in the chart of accounts of a small company during two years. Variation in the information measures due the aggregation of data in the process of accounting classification is observed. In particular, the symmetric uncertainty seems to be a useful parameter for comparing companies over time or in different sectors; or different accounting choices and standards.

  6. Non-coherent capacity of secret-key agreement with public discussion

    KAUST Repository

    Agrawal, Anurag

    2011-06-01

    We study the Rayleigh fading non-coherent capacity of secret-key agreement with public discussion, where neither the sender nor the receivers have access to instantaneous channel state information (CSI) of any channel. We present two results. At high Signal-to-Noise Ratio (SNR), the secret-key capacity is bounded in SNR, regardless of the number of antennas at each terminal. Second, for a system with a single antenna at both the legitimate and the eavesdropper terminals and an arbitrary number of transmit antennas, the secret-key capacity-achieving input distribution is discrete, with a finite number of mass points. Numerically we observe that at low-SNR, the capacity achieving distribution has two mass points with one of them at the origin. © 2011 IEEE.

  7. Local, nonlocal quantumness and information theoretic measures

    Science.gov (United States)

    Agrawal, Pankaj; Sazim, Sk; Chakrabarty, Indranil; Pati, Arun K.

    2016-08-01

    It has been suggested that there may exist quantum correlations that go beyond entanglement. The existence of such correlations can be revealed by information theoretic quantities such as quantum discord, but not by the conventional measures of entanglement. We argue that a state displays quantumness, that can be of local and nonlocal origin. Information theoretic measures not only characterize the nonlocal quantumness, but also the local quantumness, such as the “local superposition”. This can be a reason, why such measures are nonzero, when there is no entanglement. We consider a generalized version of the Werner state to demonstrate the interplay of local quantumness, nonlocal quantumness and classical mixedness of a state.

  8. Wireless Physical Layer Security: On the Performance Limit of Secret-Key Agreement

    KAUST Repository

    Zorgui, Marwen

    2015-05-01

    Physical layer security (PLS) is a new paradigm aiming at securing communications between legitimate parties at the physical layer. Conventionally, achieving confidentiality in communication networks relies on cryptographic techniques such as public-key cryptography, secret-key distribution and symmetric encryption. Such techniques are deemed secure based on the assumption of limited computational abilities of a wiretapper. Given the relentless progress in computational capacities and the dynamic topology and proliferation of modern wireless networks, the relevance of the previous techniques in securing communications is more and more questionable and less and less reliable. In contrast to this paradigm, PLS does not assume a specific computational power at any eavesdropper, its premise to guarantee provable security via employing channel coding techniques at the physical layer exploiting the inherent randomness in most communication systems. In this dissertation, we investigate a particular aspect of PLS, which is secret-key agreement, also known as secret-sharing. In this setup, two legitimate parties try to distill a secret-key via the observation of correlated signals through a noisy wireless channel, in the presence of an eavesdropper who must be kept ignorant of the secret-key. Additionally, a noiseless public channel is made available to the legitimate parties to exchange public messages that are also accessible to the eavesdropper. Recall that key agreement is an important aspect toward realizing secure communications in the sense that the key can be used in a one-time pad scheme to send the confidential message. In the first part, our focus is on secret-sharing over Rayleigh fading quasi-static channels. We study the fundamental relationship relating the probability of error and a given target secret-key rate in the high power regime. This is characterized through the diversity multiplexing tradeoff (DMT) concept, that we define for our model and then

  9. Distillation of secret-key from a class of compound memoryless quantum sources

    Science.gov (United States)

    Boche, H.; Janßen, G.

    2016-08-01

    We consider secret-key distillation from tripartite compound classical-quantum-quantum (cqq) sources with free forward public communication under strong security criterion. We design protocols which are universally reliable and secure in this scenario. These are shown to achieve asymptotically optimal rates as long as a certain regularity condition is fulfilled by the set of its generating density matrices. We derive a multi-letter formula which describes the optimal forward secret-key capacity for all compound cqq sources being regular in this sense. We also determine the forward secret-key distillation capacity for situations where the legitimate sending party has perfect knowledge of his/her marginal state deriving from the source statistics. In this case regularity conditions can be dropped. Our results show that the capacities with and without the mentioned kind of state knowledge are equal as long as the source is generated by a regular set of density matrices. We demonstrate that regularity of cqq sources is not only a technical but also an operational issue. For this reason, we give an example of a source which has zero secret-key distillation capacity without sender knowledge, while achieving positive rates is possible if sender marginal knowledge is provided.

  10. Quantum probabilities: an information-theoretic interpretation

    CERN Document Server

    Bub, Jeffrey

    2010-01-01

    This Chapter develops a realist information-theoretic interpretation of the nonclassical features of quantum probabilities. On this view, what is fundamental in the transition from classical to quantum physics is the recognition that \\emph{information in the physical sense has new structural features}, just as the transition from classical to relativistic physics rests on the recognition that space-time is structurally different than we thought. Hilbert space, the event space of quantum systems, is interpreted as a kinematic (i.e., pre-dynamic) framework for an indeterministic physics, in the sense that the geometric structure of Hilbert space imposes objective probabilistic or information-theoretic constraints on correlations between events, just as the geometric structure of Minkowski space in special relativity imposes spatio-temporal kinematic constraints on events. The interpretation of quantum probabilities is more subjectivist in spirit than other discussions in this book (e.g., the chapter by Timpson)...

  11. On image segmentation using information theoretic criteria

    CERN Document Server

    Aue, Alexander; 10.1214/11-AOS925

    2012-01-01

    Image segmentation is a long-studied and important problem in image processing. Different solutions have been proposed, many of which follow the information theoretic paradigm. While these information theoretic segmentation methods often produce excellent empirical results, their theoretical properties are still largely unknown. The main goal of this paper is to conduct a rigorous theoretical study into the statistical consistency properties of such methods. To be more specific, this paper investigates if these methods can accurately recover the true number of segments together with their true boundaries in the image as the number of pixels tends to infinity. Our theoretical results show that both the Bayesian information criterion (BIC) and the minimum description length (MDL) principle can be applied to derive statistically consistent segmentation methods, while the same is not true for the Akaike information criterion (AIC). Numerical experiments were conducted to illustrate and support our theoretical fin...

  12. Information Theoretic Authentication and Secrecy Codes in the Splitting Model

    CERN Document Server

    Huber, Michael

    2011-01-01

    In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should hold simultaneously. Ogata-Kurosawa-Stinson-Saido (2004) have constructed optimal splitting authentication codes achieving perfect secrecy for the special case when the number of keys equals the number of messages. In this paper, we establish a construction method for optimal splitting authentication codes with perfect secrecy in the more general case when the number of keys may differ from the number of messages. To the best knowledge, this is the first result of this type.

  13. Quantum Encoder and Decoder for Secret Key Distribution with Check Bits

    Directory of Open Access Journals (Sweden)

    T. Godhavari

    2013-12-01

    Full Text Available The focus of this study is to develop a novel method of encoding the qubits and use as secret key in public key cryptography. In BB 84 protocol, 50% of the random number (generated at source is used as secret key and the remaining bits are used as “check bits”. The check bits are used to detect the presence of eve as well as the nature of quantum channels. In this protocol, random qubits are encoded using different type of polarizations like horizontal, veritical and diagonal. In the proposed quantum encoder, basic quantum gates are used to encode the random secret key along with the check bits. Quantum key distribution, (a cryptographic mechanism relies on the inherent randomness of quantum mechanics and serves as an option to replace techniques made vulnerable by quantum computing. However, it is still subject to clever forms of eavesdropping and poses a significant challenge to implementation. To study the challenges, quantum circuits are first simulated using QCAD.

  14. Physical Layer Secret-Key Generation Scheme for Transportation Security Sensor Network.

    Science.gov (United States)

    Yang, Bin; Zhang, Jianfeng

    2017-06-28

    Wireless Sensor Networks (WSNs) are widely used in different disciplines, including transportation systems, agriculture field environment monitoring, healthcare systems, and industrial monitoring. The security challenge of the wireless communication link between sensor nodes is critical in WSNs. In this paper, we propose a new physical layer secret-key generation scheme for transportation security sensor network. The scheme is based on the cooperation of all the sensor nodes, thus avoiding the key distribution process, which increases the security of the system. Different passive and active attack models are analyzed in this paper. We also prove that when the cooperative node number is large enough, even when the eavesdropper is equipped with multiple antennas, the secret-key is still secure. Numerical results are performed to show the efficiency of the proposed scheme.

  15. SIMPL Systems, or: Can We Design Cryptographic Hardware without Secret Key Information?

    Science.gov (United States)

    Rührmair, Ulrich

    This paper discusses a new cryptographic primitive termed SIMPL system. Roughly speaking, a SIMPL system is a special type of Physical Unclonable Function (PUF) which possesses a binary description that allows its (slow) public simulation and prediction. Besides this public key like functionality, SIMPL systems have another advantage: No secret information is, or needs to be, contained in SIMPL systems in order to enable cryptographic protocols - neither in the form of a standard binary key, nor as secret information hidden in random, analog features, as it is the case for PUFs. The cryptographic security of SIMPLs instead rests on (i) a physical assumption on their unclonability, and (ii) a computational assumption regarding the complexity of simulating their output. This novel property makes SIMPL systems potentially immune against many known hardware and software attacks, including malware, side channel, invasive, or modeling attacks.

  16. Measuring observability by generalized information theoretic quantities

    Institute of Scientific and Technical Information of China (English)

    Badong CHEN; Jinchun HU; Hongbo LI; Zengqi SUN

    2008-01-01

    A normalized measure is established to provide the quantitative information about the degree of observabilty for the discrete-time,stochastically autonomous system.This measure is based on the generalized information theoretic quanties(generalized entropy,mutual information) of the system state and the observations.where the system state can be a discrete or a continuous random vector.Some important properties are presented.For the linear case,the explicit formula for the degree of observability is derived,and the equivalence between the proposed measure and the traditional ranK condition is proved The curves for the degree of observability are depicted in a simple example.

  17. Exosome secretion is a key pathway for clearance of pathological TDP-43.

    Science.gov (United States)

    Iguchi, Yohei; Eid, Lara; Parent, Martin; Soucy, Geneviève; Bareil, Christine; Riku, Yuichi; Kawai, Kaori; Takagi, Shinnosuke; Yoshida, Mari; Katsuno, Masahisa; Sobue, Gen; Julien, Jean-Pierre

    2016-12-01

    Cytoplasmic TDP-43 aggregation is a pathological hallmark of amyotrophic lateral sclerosis and frontotemporal lobar degeneration. Here we investigated the role of exosomes in the secretion and propagation of TDP-43 aggregates. TDP-43 was detected in secreted exosomes from Neuro2a cells and primary neurons but not from astrocytes or microglia. Evidence is presented that protein aggregation and autophagy inhibition are factors that promote exosomal secretion of TDP-43. We also report that levels of exosomal TDP-43 full length and C-terminal fragment species are upregulated in human amyotrophic lateral sclerosis brains. Exposure of Neuro2a cells to exosomes from amyotrophic lateral sclerosis brain, but not from control brain, caused cytoplasmic redistribution of TDP-43, suggesting that secreted exosomes might contribute to propagation of TDP-43 proteinopathy. Yet, inhibition of exosome secretion by inactivation of neutral sphingomyelinase 2 with GW4869 or by silencing RAB27A provoked formation of TDP-43 aggregates in Neuro2a cells. Moreover, administration of GW4869 exacerbated the disease phenotypes of transgenic mice expressing human TDP-43(A315T) mutant. Thus, even though results suggest that exosomes containing pathological TDP-43 may play a key role in the propagation of TDP-43 proteinopathy, a therapeutic strategy for amyotrophic lateral sclerosis based on inhibition of exosome production would seem inappropriate, as in vivo data suggest that exosome secretion plays an overall beneficial role in neuronal clearance of pathological TDP-43. © The Author (2016). Published by Oxford University Press on behalf of the Guarantors of Brain. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  18. Expression dynamics of secreted protease genes in Trichophyton rubrum induced by key host's proteinaceous components.

    Science.gov (United States)

    Leng, Wenchuan; Liu, Tao; Wang, Jin; Li, Ruoyu; Jin, Qi

    2009-11-01

    Trichophyton rubrum is the most common agent of dermatophytosis, a disease that affects millions of individuals worldwide. Its molecular pathogenicity mechanisms are still not completely elucidated. It has been widely recognized that proteases secreted by T. rubrum are the key virulence factors during host infection. However, our knowledge about the expression of its secreted proteases in host infection is still obscure. This investigation provides the expression patterns and dynamics of secreted protease genes belonging to the subtilisins (SUB) and metalloproteases (MEP) gene families in T. rubrum. The data was obtained under simulated host infection conditions through relative quantification of real time PCR. Keratin, collagen, and elastin induced the expression of similar protease genes, and the expression patterns and dynamics of these protease genes in media containing human skin sections were different from those in media containing individual protein substrates. According to the expression dynamics of these protease genes, we conclude that Sub3, Sub4, and Mep4 may be the dominant proteases secreted by T. rubrum during host infection, and that these proteases could be good targets for new antifungal chemotherapy and molecular diagnostic markers. This work presents useful molecular details to further our understanding of the pathogenesis of dermatophytosis.

  19. Information Theoretic cutting of a cake

    CERN Document Server

    Delgosha, Payam

    2012-01-01

    Cutting a cake is a metaphor for the problem of dividing a resource (cake) among several agents. The problem becomes non-trivial when the agents have different valuations for different parts of the cake (i.e. one agent may like chocolate while the other may like cream). A fair division of the cake is one that takes into account the individual valuations of agents and partitions the cake based on some fairness criterion. Fair division may be accomplished in a distributed or centralized way. Due to its natural and practical appeal, it has been a subject of study in economics under the topic of "Fair Division". To best of our knowledge the role of partial information in fair division has not been studied so far from an information theoretic perspective. In this paper we study two important algorithms in fair division, namely "divide and choose" and "adjusted winner" for the case of two agents. We quantify the benefit of negotiation in the divide and choose algorithm, and its use in tricking the adjusted winner a...

  20. Constructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing

    Directory of Open Access Journals (Sweden)

    Sangjae Moon

    2008-07-01

    Full Text Available Group key exchange (GKE is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group members. We present a method of constructing constant-round and identity-based protocol via secret sharing for GKE within universally composability (UC framework. The resultant protocol focuses on round efficiency and three rounds of communication are required. The protocol allows the batch verification of messages signed by all other group participants. Moreover, compared with other identity-based protocols, the key generation center (KGC in our protocol is not always online.

  1. Constructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing

    Directory of Open Access Journals (Sweden)

    Moon Sangjae

    2008-01-01

    Full Text Available Abstract Group key exchange (GKE is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of rounds linear with the number of group members. We present a method of constructing constant-round and identity-based protocol via secret sharing for GKE within universally composability (UC framework. The resultant protocol focuses on round efficiency and three rounds of communication are required. The protocol allows the batch verification of messages signed by all other group participants. Moreover, compared with other identity-based protocols, the key generation center (KGC in our protocol is not always online.

  2. A Dynamic Key Management Scheme Based on Secret Sharing for Hierarchical Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Enjian Bai

    2013-01-01

    Full Text Available Since wireless sensor networks (WSN for short are often deployed in hostile environments in many applications, security becomes one of the critical issues in WSN. Moreover, due to the limitation of the sensor nodes, traditional key management schemes are not suitable for it. Thereby,a feasible and efficient key management scheme is an important guarantee for WSN to communicate securely. For the moment, many protocols have been proposed and each has its own advantages. However, these protocols cannot provide sufficient security in many cases, such as node capture attack, which makes WSN more vulnerable than traditional wireless networks. Key protection and revocation issues must be considered with special attention in WSN. To address these two issues, we propose a dynamically clustering key management scheme based on secret sharing for WSN. The scheme combined the hierarchical structure of wireless sensor networks with dynamic key management scheme. The analysis results show that the scheme has strong security and resistance of captured attack, as well as low communicational overhead, and it well meets the requirement of scalability.

  3. Novel Authentication of Monitoring Data Through the use of Secret and Public Cryptographic Keys

    Energy Technology Data Exchange (ETDEWEB)

    Benz, Jacob M.; Tolk, Keith; Tanner, Jennifer E.

    2014-07-21

    The Office of Nuclear Verification (ONV) is supporting the development of a piece of equipment to provide data authentication and protection for a suite of monitoring sensors as part of a larger effort to create an arms control technology toolkit. This device, currently called the Red Box, leverages the strengths of both secret and public cryptographic keys to authenticate, digitally sign, and pass along monitoring data to allow for host review, and redaction if necessary, without the loss of confidence in the authenticity of the data by the monitoring party. The design of the Red Box will allow for the addition and removal of monitoring equipment and can also verify that the data was collected by authentic monitoring equipment prior to signing the data and sending it to the host and for review. The host will then forward the data to the monitor for review and inspection. This paper will highlight the progress to date of the Red Box development, and will explain the novel method of leveraging both symmetric and asymmetric (secret and public key) cryptography to authenticate data within a warhead monitoring regime.

  4. An information theoretic approach to pedigree reconstruction.

    Science.gov (United States)

    Almudevar, Anthony

    2016-02-01

    Network structure is a dominant feature of many biological systems, both at the cellular level and within natural populations. Advances in genotype and gene expression screening made over the last few decades have permitted the reconstruction of these networks. However, resolution to a single model estimate will generally not be possible, leaving open the question of the appropriate method of formal statistical inference. The nonstandard structure of the problem precludes most traditional statistical methodologies. Alternatively, a Bayesian approach provides a natural methodology for formal inference. Construction of a posterior density on the space of network structures allows formal inference regarding features of network structure using specific marginal posterior distributions. An information theoretic approach to this problem will be described, based on the Minimum Description Length principle. This leads to a Bayesian inference model based on the information content of data rather than on more commonly used probabilistic models. The approach is applied to the problem of pedigree reconstruction based on genotypic data. Using this application, it is shown how the MDL approach is able to provide a truly objective control for model complexity. A two-cohort model is used for a simulation study. The MDL approach is compared to COLONY-2, a well known pedigree reconstruction application. The study highlights the problem of genotyping error modeling. COLONY-2 requires prior error rate estimates, and its accuracy proves to be highly sensitive to these estimates. In contrast, the MDL approach does not require prior error rate estimates, and is able to accurately adjust for genotyping error across the range of models considered. Copyright © 2015 Elsevier Inc. All rights reserved.

  5. A Cryptographic SoC for Robust Protection of Secret Keys in IPTV DRM Systems

    Science.gov (United States)

    Lee, Sanghan; Yang, Hae-Yong; Yeom, Yongjin; Park, Jongsik

    The security level of an internet protocol television (IPTV) digital right management (DRM) system ultimately relies on protection of secret keys. Well known devices for the key protection include smartcards and battery backup SRAMs (BB-SRAMs); however, these devices could be vulnerable to various physical attacks. In this paper, we propose a secure and cost-effective design of a cryptographic system on chip (SoC) that integrates the BB-SRAM with a cell-based design technique. The proposed SoC provides robust safeguard against the physical attacks, and satisfies high-speed and low-price requirements of IPTV set-top boxes. Our implementation results show that the maximum encryption rate of the SoC is 633Mb/s. In order to verify the data retention capabilities, we made a prototype chip using 0.18µm standard cell technology. The experimental results show that the integrated BB-SRAM can reliably retain data with a 1.4µA leakage current.

  6. Information-Theoretic Perspectives on Geophysical Models

    Science.gov (United States)

    Nearing, Grey

    2016-04-01

    practice of science (except by Gong et al., 2013, whose fundamental insight is the basis for this talk), and here I offer two examples of practical methods that scientists might use to approximately measure ontological information. I place this practical discussion in the context of several recent and high-profile experiments that have found that simple out-of-sample statistical models typically (vastly) outperform our most sophisticated terrestrial hydrology models. I offer some perspective on several open questions about how to use these findings to improve our models and understanding of these systems. Cartwright, N. (1983) How the Laws of Physics Lie. New York, NY: Cambridge Univ Press. Clark, M. P., Kavetski, D. and Fenicia, F. (2011) 'Pursuing the method of multiple working hypotheses for hydrological modeling', Water Resources Research, 47(9). Cover, T. M. and Thomas, J. A. (1991) Elements of Information Theory. New York, NY: Wiley-Interscience. Cox, R. T. (1946) 'Probability, frequency and reasonable expectation', American Journal of Physics, 14, pp. 1-13. Csiszár, I. (1972) 'A Class of Measures of Informativity of Observation Channels', Periodica Mathematica Hungarica, 2(1), pp. 191-213. Davies, P. C. W. (1990) 'Why is the physical world so comprehensible', Complexity, entropy and the physics of information, pp. 61-70. Gong, W., Gupta, H. V., Yang, D., Sricharan, K. and Hero, A. O. (2013) 'Estimating Epistemic & Aleatory Uncertainties During Hydrologic Modeling: An Information Theoretic Approach', Water Resources Research, 49(4), pp. 2253-2273. Jaynes, E. T. (2003) Probability Theory: The Logic of Science. New York, NY: Cambridge University Press. Nearing, G. S. and Gupta, H. V. (2015) 'The quantity and quality of information in hydrologic models', Water Resources Research, 51(1), pp. 524-538. Popper, K. R. (2002) The Logic of Scientific Discovery. New York: Routledge. Van Horn, K. S. (2003) 'Constructing a logic of plausible inference: a guide to cox's theorem

  7. Towards general information theoretical representations of database problems

    Energy Technology Data Exchange (ETDEWEB)

    Joslyn, C.

    1997-06-01

    General database systems are described from the General Systems Theoretical (GST) framework. In this context traditional information theoretical (statistical) and general information theoretical (fuzzy measure and set theoretical, possibilistic, and random set theoretical) representations are derived. A preliminary formal framework is introduced.

  8. Information-Theoretic Active SOM for Improving Generalization Performance

    Directory of Open Access Journals (Sweden)

    Ryotaro Kamimura

    2016-10-01

    Full Text Available In this paper, we introduce a new type of information-theoretic method called “information-theoretic active SOM”, based on the self-organizing maps (SOM for training multi-layered neural networks. The SOM is one of the most important techniques in unsupervised learning. However, SOM knowledge is sometimes ambiguous and cannot be easily interpreted. Thus, we introduce the information-theoretic method to produce clearer and interpretable representations. The present method extends this information-theoretic approach into supervised learning. The main contribution can be summarized by three points. First, it is shown that clear representations by the information-theoretic method can be effective in training supervised learning. Second, the method is sufficiently simple where there are two separated components, namely, information maximization and error minimization component. Usually, two components are mixed in one framework, and it is difficult to compromise between them. In addition, the knowledge obtained by this information-theoretic SOM can be used to solve the shortage of unlabeled data, because the information maximization component is unsupervised and can process all input data with and without labels. The method was applied to the well-known image segmentation datasets. Experimental results showed that clear weights were produced and generalization performance was improved by using the information-theoretic SOM. In addition, the final results were stable, almost independent of the parameter values.

  9. On the Ergodic Secret-Key Agreement over Spatially Correlated Multiple-Antenna Channels with Public Discussion

    KAUST Repository

    Zorgui, Marwen

    2015-09-28

    We consider secret-key agreement with public discussion over multiple-input multiple-output (MIMO) Rayleigh fast-fading channels under correlated environment. We assume that transmit, legitimate receiver and eavesdropper antennas are correlated. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation matrices. First, we derive the expression of the secret-key capacity under the considered setup. We prove that the optimal transmit strategy achieving the secret-key capacity consists in transmitting independent Gaussian signals along the eingenvectors of the transmit correlation matrix. The powers allocated to each channel mode are determined as the solution to a numerical optimization problem. A necessary and sufficient condition for beamforming (i.e., transmitting along the strongest channel mode) to be capacity-achieving is derived. Moreover, we analyze the impact of correlation matrices on the system performance. Finally, we study the system’s performance in the two extreme power regimes. In the high-power regime, we provide closed-form expressions of the gain/loss due to correlation. In the low signal-to-noise ratio (SNR) regime, we investigate the energy efficiency of the system by determining the minimum energy required for sharing a secret-key bit and the wideband slope while highlighting the impact of correlation matrices.

  10. Secret-key agreement over spatially correlated multiple-antenna channels in the low-SNR regime

    KAUST Repository

    Zorgui, Marwen

    2015-09-28

    We consider secret-key agreement with public discussion over Rayleigh fast-fading channels with transmit, receive and eavesdropper correlation. The legitimate receiver along with the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation matrices. We analyze the secret-key capacity in the low signal-to-noise ratio (SNR) regime. We derive closed-form expressions for the first and the second derivatives of the secret-key capacity with respect to SNR at SNR= 0, for arbitrary correlation matrices and number of transmit, receive and eavesdropper antennas. Moreover, we identify optimal transmission strategies achieving these derivatives. For instance, we prove that achieving the first and the second derivatives requires a uniform power distribution between the eigenvectors spanning the maximal-eigenvalue eigenspace of the transmit correlation matrix. We also compare the optimal transmission scheme to a simple uniform power allocation. Finally, we express the minimum energy required for sharing a secret-key bit as well as the wideband slope in terms of the system parameters.

  11. An information-theoretic framework for flow visualization.

    Science.gov (United States)

    Xu, Lijie; Lee, Teng-Yok; Shen, Han-Wei

    2010-01-01

    The process of visualization can be seen as a visual communication channel where the input to the channel is the raw data, and the output is the result of a visualization algorithm. From this point of view, we can evaluate the effectiveness of visualization by measuring how much information in the original data is being communicated through the visual communication channel. In this paper, we present an information-theoretic framework for flow visualization with a special focus on streamline generation. In our framework, a vector field is modeled as a distribution of directions from which Shannon's entropy is used to measure the information content in the field. The effectiveness of the streamlines displayed in visualization can be measured by first constructing a new distribution of vectors derived from the existing streamlines, and then comparing this distribution with that of the original data set using the conditional entropy. The conditional entropy between these two distributions indicates how much information in the original data remains hidden after the selected streamlines are displayed. The quality of the visualization can be improved by progressively introducing new streamlines until the conditional entropy converges to a small value. We describe the key components of our framework with detailed analysis, and show that the framework can effectively visualize 2D and 3D flow data.

  12. Information-Theoretic Methods for Identifying Relationships amon

    Data.gov (United States)

    National Aeronautics and Space Administration — Information-theoretic quantities, such as entropy, are used to quantify the amount of information a given variable provides. Entropies can be used together to...

  13. Information theoretic learning Renyi's entropy and Kernel perspectives

    CERN Document Server

    Principe, Jose C

    2010-01-01

    This book presents the first cohesive treatment of Information Theoretic Learning (ITL) algorithms to adapt linear or nonlinear learning machines both in supervised or unsupervised paradigms. ITL is a framework where the conventional concepts of second order statistics (covariance, L2 distances, correlation functions) are substituted by scalars and functions with information theoretic underpinnings, respectively entropy, mutual information and correntropy. ITL quantifies the stochastic structure of the data beyond second order statistics for improved performance without using full-blown Bayesi

  14. Secret-key agreement over spatially correlated fast-fading multiple-antenna channels with public discussion

    KAUST Repository

    Zorgui, Marwen

    2015-06-14

    We consider secret-key agreement with public discussion over multiple-input multiple-output (MIMO) Rayleigh fast-fading channels under correlated environment. We assume that transmit, legitimate receiver and eavesdropper antennas are correlated. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation matrices. First, we derive the expression of the secret-key capacity under the considered setup. Then, we prove that the optimal transmit strategy achieving the secret-key capacity consists in transmitting independent Gaussian signals along the eingenvectors of the transmit correlation matrix. The powers allocated to each channel mode are determined as the solution to a numerical optimization problem that we derive. A necessary and sufficient condition for beamforming (i.e., transmitting along the strongest channel mode) to be capacity-achieving is derived. Finally, we analyze the impact of correlation matrices on the system performance and provide closed-form expressions of the gain/loss due to correlation in the high power regime.

  15. A Location-aware and Secret-share Based Dynamic Key Management Scheme for Heterogeneous Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chunguang Ma

    2010-04-01

    Full Text Available Recently, Numerous dynamic key management schemes have been proposed for WSN, and it has long-lived networks, more sustained security and survivability, such as SHELL and LCOK. But most of these schemes are greatly depend on some central nodes (gateways, if these nodes were compromised, there will be great threat to the whole networks security and survivability. In this paper, we proposed a Location-aware and secret share based dynamic key management scheme to effectively replace the compromised central node and enhance the security level of the network.

  16. A quantum information theoretic analysis of three flavor neutrino oscillations

    CERN Document Server

    Banerjee, Subhashish; Srikanth, R; Hiesmayr, Beatrix C

    2015-01-01

    Correlations exhibited by neutrino oscillations are studied via quantum information theoretic quantities. We show that the strongest type of entanglement, genuine multipartite entanglement, is persistent in the flavour changing states. We prove the existence of Bell-type nonlocal features, in both its absolute and genuine avatars. Finally, we show that a measure of nonclassicality, dissension, which is a generalization of quantum discord to the tripartite case, is nonzero for almost the entire range of time in the evolution of an initial electron-neutrino. Via these quantum information theoretic quantities capturing different aspects of quantum correlations, we elucidate the differences between the flavour types, shedding light on the quantum-information theoretic aspects of the weak force.

  17. Text-Independent Speaker Verification Based on Information Theoretic Learning

    Directory of Open Access Journals (Sweden)

    Sheeraz Memon

    2011-07-01

    Full Text Available In this paper VQ (Vector Quantization based on information theoretic learning is investigated for the task of text-independent speaker verification. A novel VQ method based on the IT (Information Theoretic principles is used for the task of speaker verification and compared with two classical VQ approaches: the K-means algorithm and the LBG (Linde Buzo Gray algorithm. The paper provides a theoretical background of the vector quantization techniques, which is followed by experimental results illustrating their performance. The results demonstrated that the ITVQ (Information Theoretic Vector Quantization provided the best performance in terms of classification rates, EER (Equal Error Rates and the MSE (Mean Squared Error compare to Kmeans and the LBG algorithms. The outstanding performance of the ITVQ algorithm can be attributed to the fact that the IT criteria used by this algorithm provide superior matching between distribution of the original data vectors and the codewords.

  18. Steganography and Hiding Data with Indicators-based LSB Using a Secret Key

    Directory of Open Access Journals (Sweden)

    W. Saqer

    2016-06-01

    Full Text Available Steganography is the field of science concerned with hiding secret data inside other innocent-looking data, called the container, carrier or cover, in a way that no one apart from the meant parties can suspect the existence of the secret data. There are many algorithms and techniques of concealing data. Each of which has its own way of hiding and its own advantages and limitations. In our research we introduce a new algorithm of hiding data. The algorithm uses the same technique used by the Least Significant Bit (LSB algorithm which is embedding secret data in the least significant bit(s of the bytes of the carrier. It differs from the LSB algorithm in that it does not embed the bytes of the cover data sequentially but it embeds into one bit or two bits at once. Actually it depends on indicators to determine where and how many bits to embed at a time. These indicators are two bits of each cover byte after the least two significant bits. The advantage of this algorithm over the LSB algorithm is the randomness used to confuse intruders as it does not use fixed sequential bytes and it does not always embed one bit at a time. This aims to increase the security of the technique. Also, the amount of cover data consumed is less because it sometimes embeds two bits at once.

  19. Model selection and inference a practical information-theoretic approach

    CERN Document Server

    Burnham, Kenneth P

    1998-01-01

    This book is unique in that it covers the philosophy of model-based data analysis and an omnibus strategy for the analysis of empirical data The book introduces information theoretic approaches and focuses critical attention on a priori modeling and the selection of a good approximating model that best represents the inference supported by the data Kullback-Leibler information represents a fundamental quantity in science and is Hirotugu Akaike's basis for model selection The maximized log-likelihood function can be bias-corrected to provide an estimate of expected, relative Kullback-Leibler information This leads to Akaike's Information Criterion (AIC) and various extensions and these are relatively simple and easy to use in practice, but little taught in statistics classes and far less understood in the applied sciences than should be the case The information theoretic approaches provide a unified and rigorous theory, an extension of likelihood theory, an important application of information theory, and are ...

  20. Role of information theoretic uncertainty relations in quantum theory

    Energy Technology Data Exchange (ETDEWEB)

    Jizba, Petr, E-mail: p.jizba@fjfi.cvut.cz [FNSPE, Czech Technical University in Prague, Břehová 7, 115 19 Praha 1 (Czech Republic); ITP, Freie Universität Berlin, Arnimallee 14, D-14195 Berlin (Germany); Dunningham, Jacob A., E-mail: J.Dunningham@sussex.ac.uk [Department of Physics and Astronomy, University of Sussex, Falmer, Brighton, BN1 9QH (United Kingdom); Joo, Jaewoo, E-mail: j.joo@surrey.ac.uk [Advanced Technology Institute and Department of Physics, University of Surrey, Guildford, GU2 7XH (United Kingdom)

    2015-04-15

    Uncertainty relations based on information theory for both discrete and continuous distribution functions are briefly reviewed. We extend these results to account for (differential) Rényi entropy and its related entropy power. This allows us to find a new class of information-theoretic uncertainty relations (ITURs). The potency of such uncertainty relations in quantum mechanics is illustrated with a simple two-energy-level model where they outperform both the usual Robertson–Schrödinger uncertainty relation and Shannon entropy based uncertainty relation. In the continuous case the ensuing entropy power uncertainty relations are discussed in the context of heavy tailed wave functions and Schrödinger cat states. Again, improvement over both the Robertson–Schrödinger uncertainty principle and Shannon ITUR is demonstrated in these cases. Further salient issues such as the proof of a generalized entropy power inequality and a geometric picture of information-theoretic uncertainty relations are also discussed.

  1. Information-theoretical noninvasive damage detection in bridge structures

    Science.gov (United States)

    Sudu Ambegedara, Amila; Sun, Jie; Janoyan, Kerop; Bollt, Erik

    2016-11-01

    Damage detection of mechanical structures such as bridges is an important research problem in civil engineering. Using spatially distributed sensor time series data collected from a recent experiment on a local bridge in Upper State New York, we study noninvasive damage detection using information-theoretical methods. Several findings are in order. First, the time series data, which represent accelerations measured at the sensors, more closely follow Laplace distribution than normal distribution, allowing us to develop parameter estimators for various information-theoretic measures such as entropy and mutual information. Second, as damage is introduced by the removal of bolts of the first diaphragm connection, the interaction between spatially nearby sensors as measured by mutual information becomes weaker, suggesting that the bridge is "loosened." Finally, using a proposed optimal mutual information interaction procedure to prune away indirect interactions, we found that the primary direction of interaction or influence aligns with the traffic direction on the bridge even after damaging the bridge.

  2. Identifying Cover Songs Using Information-Theoretic Measures of Similarity

    OpenAIRE

    Foster, Peter; Dixon, Simon; Klapuri, Anssi

    2014-01-01

    This paper investigates methods for quantifying similarity between audio signals, specifically for the task of of cover song detection. We consider an information-theoretic approach, where we compute pairwise measures of predictability between time series. We compare discrete-valued approaches operating on quantised audio features, to continuous-valued approaches. In the discrete case, we propose a method for computing the normalised compression distance, where we account for correlation betw...

  3. Information-Theoretical Complexity Analysis of Selected Elementary Chemical Reactions

    Science.gov (United States)

    Molina-Espíritu, M.; Esquivel, R. O.; Dehesa, J. S.

    We investigate the complexity of selected elementary chemical reactions (namely, the hydrogenic-abstraction reaction and the identity SN2 exchange reaction) by means of the following single and composite information-theoretic measures: disequilibrium (D), exponential entropy(L), Fisher information (I), power entropy (J), I-D, D-L and I-J planes and Fisher-Shannon (FS) and Lopez-Mancini-Calbet (LMC) shape complexities. These quantities, which are functionals of the one-particle density, are computed in both position (r) and momentum (p) spaces. The analysis revealed that the chemically significant regions of these reactions can be identified through most of the single information-theoretic measures and the two-component planes, not only the ones which are commonly revealed by the energy, such as the reactant/product (R/P) and the transition state (TS), but also those that are not present in the energy profile such as the bond cleavage energy region (BCER), the bond breaking/forming regions (B-B/F) and the charge transfer process (CT). The analysis of the complexities shows that the energy profile of the abstraction reaction bears the same information-theoretical features of the LMC and FS measures, however for the identity SN2 exchange reaction does not hold a simple behavior with respect to the LMC and FS measures. Most of the chemical features of interest (BCER, B-B/F and CT) are only revealed when particular information-theoretic aspects of localizability (L or J), uniformity (D) and disorder (I) are considered.

  4. Keys through ARQ

    CERN Document Server

    Latif, Mohamed Abdel; Gamal, Hesham El

    2009-01-01

    This paper develops a novel framework for sharing secret keys using the well-known Automatic Repeat reQuest (ARQ) protocol. The proposed key sharing protocol does not assume any prior knowledge about the channel state information (CSI), but, harnesses the available opportunistic secrecy gains using only the one bit feedback, in the form of ACK/NACK. The distribution of key bits among multiple ARQ epochs, in our approach, allows for mitigating the secrecy outage phenomenon observed in earlier works. We characterize the information theoretic limits of the proposed scheme, under different assumptions on the channel spatial and temporal correlation function, and develop low complexity explicit implementations. Our analysis reveals a novel role of "dumb antennas" in overcoming the negative impact of spatial correlation, between the legitimate and eavesdropper channels, on the achievable secrecy rates. We further develop an adaptive rate allocation policy which achieves higher secrecy rates by exploiting the channe...

  5. Information-Theoretic Benchmarking of Land Surface Models

    Science.gov (United States)

    Nearing, Grey; Mocko, David; Kumar, Sujay; Peters-Lidard, Christa; Xia, Youlong

    2016-04-01

    about 40%. There was relatively little difference between the different models. 1. G. Abramowitz, R. Leuning, M. Clark, A. Pitman, Evaluating the performance of land surface models. Journal of Climate 21, (2008). 2. W. Gong, H. V. Gupta, D. Yang, K. Sricharan, A. O. Hero, Estimating Epistemic & Aleatory Uncertainties During Hydrologic Modeling: An Information Theoretic Approach. Water Resources Research 49, 2253-2273 (2013). 3. G. S. Nearing, H. V. Gupta, The quantity and quality of information in hydrologic models. Water Resources Research 51, 524-538 (2015). 4. H. V. Gupta, G. S. Nearing, Using models and data to learn: A systems theoretic perspective on the future of hydrological science. Water Resources Research 50(6), 5351-5359 (2014). 5. H. V. Gupta et al., Large-sample hydrology: a need to balance depth with breadth. Hydrology and Earth System Sciences Discussions 10, 9147-9189 (2013).

  6. Quantum Flows for Secret Key Distribution in the Presence of the Photon Number Splitting Attack

    Directory of Open Access Journals (Sweden)

    Luis A. Lizama-Pérez

    2014-06-01

    Full Text Available Physical implementations of quantum key distribution (QKD protocols, like the Bennett-Brassard (BB84, are forced to use attenuated coherent quantum states, because the sources of single photon states are not functional yet for QKD applications. However, when using attenuated coherent states, the relatively high rate of multi-photonic pulses introduces vulnerabilities that can be exploited by the photon number splitting (PNS attack to brake the quantum key. Some QKD protocols have been developed to be resistant to the PNS attack, like the decoy method, but those define a single photonic gain in the quantum channel. To overcome this limitation, we have developed a new QKD protocol, called ack-QKD, which is resistant to the PNS attack. Even more, it uses attenuated quantum states, but defines two interleaved photonic quantum flows to detect the eavesdropper activity by means of the quantum photonic error gain (QPEG or the quantum bit error rate (QBER. The physical implementation of the ack-QKD is similar to the well-known BB84 protocol.

  7. Axiomatic Relation between Thermodynamic and Information-Theoretic Entropies

    Science.gov (United States)

    Weilenmann, Mirjam; Kraemer, Lea; Faist, Philippe; Renner, Renato

    2016-12-01

    Thermodynamic entropy, as defined by Clausius, characterizes macroscopic observations of a system based on phenomenological quantities such as temperature and heat. In contrast, information-theoretic entropy, introduced by Shannon, is a measure of uncertainty. In this Letter, we connect these two notions of entropy, using an axiomatic framework for thermodynamics [E. H. Lieb and J. Yngvason Proc. R. Soc. 469, 20130408 (2013)]. In particular, we obtain a direct relation between the Clausius entropy and the Shannon entropy, or its generalization to quantum systems, the von Neumann entropy. More generally, we find that entropy measures relevant in nonequilibrium thermodynamics correspond to entropies used in one-shot information theory.

  8. Information-theoretic evaluation for computational biomedical ontologies

    CERN Document Server

    Clark, Wyatt Travis

    2014-01-01

    The development of effective methods for the prediction of ontological annotations is an important goal in computational biology, yet evaluating their performance is difficult due to problems caused by the structure of biomedical ontologies and incomplete annotations of genes. This work proposes an information-theoretic framework to evaluate the performance of computational protein function prediction. A Bayesian network is used, structured according to the underlying ontology, to model the prior probability of a protein's function. The concepts of misinformation and remaining uncertainty are

  9. Characterizing quantum theory in terms of information-theoretic constraints

    CERN Document Server

    Clifton, R; Halvorson, H; Clifton, Rob; Bub, Jeffrey; Halvorson, Hans

    2003-01-01

    We show that three fundamental information-theoretic constraints--the impossibility of superluminal information transfer between two physical systems by performing measurements on one of them, the impossibility of broadcasting the information contained in an unknown physical state, and the impossibility of unconditionally secure bit commitment--suffice to entail that the observables and state space of a physical theory are quantum-mechanical. We demonstrate the converse derivation in part, and consider the implications of alternative answers to a remaining open question about nonlocality and bit commitment.

  10. Information-theoretic analysis of electronic and printed document authentication

    Science.gov (United States)

    Voloshynovskiy, Sviatoslav; Koval, Oleksiy; Villan, Renato; Topak, Emre; Vila Forcén, José Emilio; Deguillaume, Frederic; Rytsar, Yuriy; Pun, Thierry

    2006-02-01

    In this paper we consider the problem of document authentication in electronic and printed forms. We formulate this problem from the information-theoretic perspectives and present the joint source-channel coding theorems showing the performance limits in such protocols. We analyze the security of document authentication methods and present the optimal attacking strategies with corresponding complexity estimates that, contrarily to the existing studies, crucially rely on the information leaked by the authentication protocol. Finally, we present the results of experimental validation of the developed concept that justifies the practical efficiency of the elaborated framework.

  11. Information-theoretic security without an honest majority

    CERN Document Server

    Broadbent, Anne

    2007-01-01

    We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require a simultaneous broadcast channel). We give protocols for veto, vote, anonymous bit transmission, collision detection, notification and anonymous message transmission. Not assuming an honest majority, in most cases, a single corrupt participant can make the protocol abort. All protocols achieve functionality never obtained before without the use of either computational assumptions or of an honest majority.

  12. Information Theoretic Tools for Parameter Fitting in Coarse Grained Models

    KAUST Repository

    Kalligiannaki, Evangelia

    2015-01-07

    We study the application of information theoretic tools for model reduction in the case of systems driven by stochastic dynamics out of equilibrium. The model/dimension reduction is considered by proposing parametrized coarse grained dynamics and finding the optimal parameter set for which the relative entropy rate with respect to the atomistic dynamics is minimized. The minimization problem leads to a generalization of the force matching methods to non equilibrium systems. A multiplicative noise example reveals the importance of the diffusion coefficient in the optimization problem.

  13. Information-theoretic characterization of uncertainty in manual control

    OpenAIRE

    Trendafilovv, D.; Murray-Smith, R.

    2013-01-01

    We present a novel approach for quantifying the\\ud impact of uncertainty in manual control, based on information\\ud and control theories and utilizing the information-theoretic\\ud capacity of empowerment, a task-independent universal utility\\ud measure. Empowerment measures, for agent-environment systems\\ud with stochastic transitions, how much influence, which can be\\ud sensed by the agent sensors, an agent has on its environment.\\ud It enables combining different types of disturbances, aris...

  14. Content-based Image Retrieval by Information Theoretic Measure

    Directory of Open Access Journals (Sweden)

    Madasu Hanmandlu

    2011-09-01

    Full Text Available Content-based image retrieval focuses on intuitive and efficient methods for retrieving images from databases based on the content of the images. A new entropy function that serves as a measure of information content in an image termed as 'an information theoretic measure' is devised in this paper. Among the various query paradigms, 'query by example' (QBE is adopted to set a query image for retrieval from a large image database. In this paper, colour and texture features are extracted using the new entropy function and the dominant colour is considered as a visual feature for a particular set of images. Thus colour and texture features constitute the two-dimensional feature vector for indexing the images. The low dimensionality of the feature vector speeds up the atomic query. Indices in a large database system help retrieve the images relevant to the query image without looking at every image in the database. The entropy values of colour and texture and the dominant colour are considered for measuring the similarity. The utility of the proposed image retrieval system based on the information theoretic measures is demonstrated on a benchmark dataset.Defence Science Journal, 2011, 61(5, pp.415-430, DOI:http://dx.doi.org/10.14429/dsj.61.1177

  15. Information-Theoretic Bounded Rationality and ε-Optimality

    Directory of Open Access Journals (Sweden)

    Daniel A. Braun

    2014-08-01

    Full Text Available Bounded rationality concerns the study of decision makers with limited information processing resources. Previously, the free energy difference functional has been suggested to model bounded rational decision making, as it provides a natural trade-off between an energy or utility function that is to be optimized and information processing costs that are measured by entropic search costs. The main question of this article is how the information-theoretic free energy model relates to simple ε-optimality models of bounded rational decision making, where the decision maker is satisfied with any action in an ε-neighborhood of the optimal utility. We find that the stochastic policies that optimize the free energy trade-off comply with the notion of ε-optimality. Moreover, this optimality criterion even holds when the environment is adversarial. We conclude that the study of bounded rationality based on ε-optimality criteria that abstract away from the particulars of the information processing constraints is compatible with the information-theoretic free energy model of bounded rationality.

  16. Polar Coding for Secure Transmission and Key Agreement

    CERN Document Server

    Koyluoglu, O Ozan

    2010-01-01

    Wyner's work on wiretap channels and the recent works on information theoretic security are based on random codes. Achieving information theoretical security with practical coding schemes is of definite interest. In this note, the attempt is to overcome this elusive task by employing the polar coding technique of Ar{\\i}kan. It is shown that polar codes achieve non-trivial perfect secrecy rates for binary-input degraded wiretap channels while enjoying their low encoding-decoding complexity. In the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. Next, fading erasure wiretap channels are considered and a secret key agreement scheme is proposed, which requires only the statistical knowledge of the eavesdropper channel state information (CSI). The enabling factor is the creation of advantage over Eve, by blindly using the proposed scheme over each fading block, which is then exploited with privacy amplification techniques to generate secret keys.

  17. Reverse Engineering Cellular Networks with Information Theoretic Methods

    Directory of Open Access Journals (Sweden)

    Julio R. Banga

    2013-05-01

    Full Text Available Building mathematical models of cellular networks lies at the core of systems biology. It involves, among other tasks, the reconstruction of the structure of interactions between molecular components, which is known as network inference or reverse engineering. Information theory can help in the goal of extracting as much information as possible from the available data. A large number of methods founded on these concepts have been proposed in the literature, not only in biology journals, but in a wide range of areas. Their critical comparison is difficult due to the different focuses and the adoption of different terminologies. Here we attempt to review some of the existing information theoretic methodologies for network inference, and clarify their differences. While some of these methods have achieved notable success, many challenges remain, among which we can mention dealing with incomplete measurements, noisy data, counterintuitive behaviour emerging from nonlinear relations or feedback loops, and computational burden of dealing with large data sets.

  18. What is "system": the information-theoretic arguments

    CERN Document Server

    Dugic, M

    2006-01-01

    The problem of "what is 'system'?" is in the very foundations of modern quantum mechanics. Here, we point out the interest in this topic in the information-theoretic context. E.g., we point out the possibility to manipulate a pair of mutually non-interacting, non-entangled systems to employ entanglement of the newly defined '(sub)systems' consisting the one and the same composite system. Given the different divisions of a composite system into "subsystems", the Hamiltonian of the system may perform in general non-equivalent quantum computations. Redefinition of "subsystems" of a composite system may be regarded as a method for avoiding decoherence in the quantum hardware. In principle, all the notions refer to a composite system as simple as the hydrogen atom.

  19. Information-Theoretic Methods for Identifying Relationships among Climate Variables

    CERN Document Server

    Knuth, Kevin H; Rossow, William B

    2014-01-01

    Information-theoretic quantities, such as entropy, are used to quantify the amount of information a given variable provides. Entropies can be used together to compute the mutual information, which quantifies the amount of information two variables share. However, accurately estimating these quantities from data is extremely challenging. We have developed a set of computational techniques that allow one to accurately compute marginal and joint entropies. These algorithms are probabilistic in nature and thus provide information on the uncertainty in our estimates, which enable us to establish statistical significance of our findings. We demonstrate these methods by identifying relations between cloud data from the International Satellite Cloud Climatology Project (ISCCP) and data from other sources, such as equatorial pacific sea surface temperatures (SST).

  20. One-dimensional barcode reading: an information theoretic approach.

    Science.gov (United States)

    Houni, Karim; Sawaya, Wadih; Delignon, Yves

    2008-03-10

    In the convergence context of identification technology and information-data transmission, the barcode found its place as the simplest and the most pervasive solution for new uses, especially within mobile commerce, bringing youth to this long-lived technology. From a communication theory point of view, a barcode is a singular coding based on a graphical representation of the information to be transmitted. We present an information theoretic approach for 1D image-based barcode reading analysis. With a barcode facing the camera, distortions and acquisition are modeled as a communication channel. The performance of the system is evaluated by means of the average mutual information quantity. On the basis of this theoretical criterion for a reliable transmission, we introduce two new measures: the theoretical depth of field and the theoretical resolution. Simulations illustrate the gain of this approach.

  1. Information-Theoretically Secure Voting Without an Honest Majority

    CERN Document Server

    Broadbent, Anne

    2008-01-01

    We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. Privacy of the ballot is unconditional, but any voter can cause the protocol to fail, in which case information about the tally may nevertheless transpire. Our second protocol introduces voting authorities which allow the implementation of the first protocol, while reducing the interaction and limiting it to be only between voters and authorities and among the authorities themselves. The simultaneous broadcast is also limited to the authorities. As long as a single authority is honest, the privacy is unconditional, however, a single corrupt authority or a single corrupt voter can cause the protocol to fail. Our final pr...

  2. Deep and Structured Robust Information Theoretic Learning for Image Analysis.

    Science.gov (United States)

    Deng, Yue; Bao, Feng; Deng, Xuesong; Wang, Ruiping; Kong, Youyong; Dai, Qionghai

    2016-07-07

    This paper presents a robust information theoretic (RIT) model to reduce the uncertainties, i.e. missing and noisy labels, in general discriminative data representation tasks. The fundamental pursuit of our model is to simultaneously learn a transformation function and a discriminative classifier that maximize the mutual information of data and their labels in the latent space. In this general paradigm, we respectively discuss three types of the RIT implementations with linear subspace embedding, deep transformation and structured sparse learning. In practice, the RIT and deep RIT are exploited to solve the image categorization task whose performances will be verified on various benchmark datasets. The structured sparse RIT is further applied to a medical image analysis task for brain MRI segmentation that allows group-level feature selections on the brain tissues.

  3. Blind Spectrum Sensing by Information Theoretic Criteria for Cognitive Radios

    CERN Document Server

    Wang, Rui

    2010-01-01

    Spectrum sensing is a fundamental and critical issue for opportunistic spectrum access in cognitive radio networks. Among the many spectrum sensing methods, the information theoretic criteria (ITC) based method is a promising blind method which can reliably detect the primary users while requiring little prior information. In this paper, we provide an intensive treatment on the ITC sensing method. To this end, we first introduce a new over-determined channel model constructed by applying multiple antennas or over sampling at the secondary user in order to make the ITC applicable. Then, a simplified ITC sensing algorithm is introduced, which needs to compute and compare only two decision values. Compared with the original ITC sensing algorithm, the simplified algorithm significantly reduces the computational complexity without losing any performance. Applying the recent advances in random matrix theory, we then derive closed-form expressions to tightly approximate both the probability of false alarm and probab...

  4. Information-theoretic model selection applied to supernovae data

    CERN Document Server

    Biesiada, M

    2007-01-01

    There are several different theoretical ideas invoked to explain the dark energy with relatively little guidance of which one of them might be right. Therefore the emphasis of ongoing and forthcoming research in this field shifts from estimating specific parameters of cosmological model to the model selection. In this paper we apply information-theoretic model selection approach based on Akaike criterion as an estimator of Kullback-Leibler entropy. In particular, we present the proper way of ranking the competing models based on Akaike weights (in Bayesian language - posterior probabilities of the models). Out of many particular models of dark energy we focus on four: quintessence, quintessence with time varying equation of state, brane-world and generalized Chaplygin gas model and test them on Riess' Gold sample. As a result we obtain that the best model - in terms of Akaike Criterion - is the quintessence model. The odds suggest that although there exist differences in the support given to specific scenario...

  5. Information-theoretic thresholds from the cavity method

    CERN Document Server

    Coja-Oghlan, Amin; Perkins, Will; Zdeborova, Lenka

    2016-01-01

    Vindicating a sophisticated but non-rigorous physics approach called the cavity method, we establish a formula for the mutual information in statistical inference problems induced by random graphs. This general result implies the conjecture on the information-theoretic threshold in the disassortative stochastic block model [Decelle et al.: Phys. Rev. E (2011)] and allows us to pinpoint the exact condensation phase transition in random constraint satisfaction problems such as random graph coloring, thereby proving a conjecture from [Krzakala et al.: PNAS (2007)]. As a further application we establish the formula for the mutual information in Low-Density Generator Matrix codes as conjectured in [Montanari: IEEE Transactions on Information Theory (2005)]. The proofs provide a conceptual underpinning of the replica symmetric variant of the cavity method, and we expect that the approach will find many future applications.

  6. Exploring the joint measurability using an information-theoretic approach

    Science.gov (United States)

    Hsu, Li-Yi

    2016-10-01

    We explore the legal purity parameters for the joint measurements. Instead of direct unsharpening the measurements, we perform the quantum cloning before the sharp measurements. The necessary fuzziness in the unsharp measurements is equivalently introduced in the imperfect cloning process. Based on the information causality and the consequent noisy nonlocal computation, one can derive the information-theoretic quadratic inequalities that must be satisfied by any physical theory. On the other hand, to guarantee the classicality, the linear Bell-type inequalities deduced by these quadratic ones must be obeyed. As for the joint measurability, the purity parameters must be chosen to obey both types of inequalities. Finally, the quadratic inequalities for purity parameters in the joint measurability region are derived.

  7. An Information Theoretic Analysis of Decision in Computer Chess

    CERN Document Server

    Godescu, Alexandru

    2011-01-01

    The basis of the method proposed in this article is the idea that information is one of the most important factors in strategic decisions, including decisions in computer chess and other strategy games. The model proposed in this article and the algorithm described are based on the idea of a information theoretic basis of decision in strategy games . The model generalizes and provides a mathematical justification for one of the most popular search algorithms used in leading computer chess programs, the fractional ply scheme. However, despite its success in leading computer chess applications, until now few has been published about this method. The article creates a fundamental basis for this method in the axioms of information theory, then derives the principles used in programming the search and describes mathematically the form of the coefficients. One of the most important parameters of the fractional ply search is derived from fundamental principles. Until now this coefficient has been usually handcrafted...

  8. Network Complexity Measures. An Information-Theoretic Approach.

    Directory of Open Access Journals (Sweden)

    Matthias Dehmer

    2015-04-01

    Full Text Available Quantitative graph analysis by using structural indices has been intricate in a sense that it often remains unclear which structural graph measures is the most suitable one, see [1, 12, 13]. In general, quantitative graph analysis deals with quantifying structural information of networks by using a measurement approach [5]. As special problem thereof is to characterize a graph quantitatively, that means to determine a measure that captures structural features of a network meaningfully. Various classical structural graph measures have been used to tackle this problem [13]. A fruitful approach by using information-theoretic [21] and statistical methods is to quantify the structural information content of a graph [1, 8, 18]. In this note, we sketch some classical information measures. Also, we briefly address the problem what kind of measures capture structural information uniquely. This relates to determine the discrimination power (or also called uniqueness of a graph measure, that is, how is the ability of the measures to discriminate non-isomorphic graphs structurally. [1] D. Bonchev. Information Theoretic Indices for Characterization of Chemical Structures. Research Studies Press, Chichester, 1983. [5] M. Dehmer and F. Emmert-Streib. Quantitative Graph Theory. Theory and Applications. CRC Press, 2014. [8] M. Dehmer, M. Grabner, and K. Varmuza. Information indices with high discriminative power for graphs. PLoS ONE, 7:e31214, 2012. [12] F. Emmert-Streib and M. Dehmer. Exploring statistical and population aspects of network complexity. PLoS ONE, 7:e34523, 2012. [13] F. Harary. Graph Theory. Addison Wesley Publishing Company, 1969. Reading, MA, USA. [18] A. Mowshowitz. Entropy and the complexity of the graphs I: An index of the relative complexity of a graph. Bull. Math. Biophys., 30:175–204, 1968. [21] C. E. Shannon and W. Weaver. The Mathematical Theory of Communication. University of Illinois Press, 1949.

  9. PET Image Reconstruction Using Information Theoretic Anatomical Priors

    Science.gov (United States)

    Somayajula, Sangeetha; Panagiotou, Christos; Rangarajan, Anand; Li, Quanzheng; Arridge, Simon R.

    2011-01-01

    We describe a nonparametric framework for incorporating information from co-registered anatomical images into positron emission tomographic (PET) image reconstruction through priors based on information theoretic similarity measures. We compare and evaluate the use of mutual information (MI) and joint entropy (JE) between feature vectors extracted from the anatomical and PET images as priors in PET reconstruction. Scale-space theory provides a framework for the analysis of images at different levels of detail, and we use this approach to define feature vectors that emphasize prominent boundaries in the anatomical and functional images, and attach less importance to detail and noise that is less likely to be correlated in the two images. Through simulations that model the best case scenario of perfect agreement between the anatomical and functional images, and a more realistic situation with a real magnetic resonance image and a PET phantom that has partial volumes and a smooth variation of intensities, we evaluate the performance of MI and JE based priors in comparison to a Gaussian quadratic prior, which does not use any anatomical information. We also apply this method to clinical brain scan data using F18 Fallypride, a tracer that binds to dopamine receptors and therefore localizes mainly in the striatum. We present an efficient method of computing these priors and their derivatives based on fast Fourier transforms that reduce the complexity of their convolution-like expressions. Our results indicate that while sensitive to initialization and choice of hyperparameters, information theoretic priors can reconstruct images with higher contrast and superior quantitation than quadratic priors. PMID:20851790

  10. On a simple attack, limiting the range transmission of secret keys in a system of quantum cryptography based on coding in a sub-carrier frequency

    Science.gov (United States)

    Klimov, A. N.; Kulik, S. P.; Molotkov, S. N.; Potapova, T. A.

    2017-03-01

    In the paper by Gleim et al (2016 Opt. Express 24 2619), it was declared that the system of quantum cryptography, exploiting quantum key distribution (QKD) protocol BB84 with the additional reference state and encoding in a sub-carrier, is able to distribute secret keys at a distance of 210 km. The following shows that a simple attack realized with a beam splitter results in a loss of privacy of the keys over substantially smaller distances. It turns out that the actual length of the secret key transmission for the QKD system encoding in the sub-carrier frequency is ten times less than that declared in Gleim et al (2016 Opt. Express 24 2619). Therefore it is impossible to safely use the keys when distributed at a larger length of the communication channel than shown below. The maximum communication distance does not exceed 22 km, even in the most optimistic scenario.

  11. Image Information Mining System Evaluation Using Information-Theoretic Measures

    Directory of Open Access Journals (Sweden)

    Mihai Datcu

    2005-08-01

    Full Text Available During the last decade, the exponential increase of multimedia and remote sensing image archives, the fast expansion of the world wide web, and the high diversity of users have yielded concepts and systems for successful content-based image retrieval and image information mining. Image data information systems require both database and visual capabilities, but there is a gap between these systems. Database systems usually do not deal with multidimensional pictorial structures and vision systems do not provide database query functions. In terms of these points, the evaluation of content-based image retrieval systems became a focus of research interest. One can find several system evaluation approaches in literature, however, only few of them go beyond precision-recall graphs and do not allow a detailed evaluation of an interactive image retrieval system. Apart from the existing evaluation methodologies, we aim at the overall validation of our knowledge-driven content-based image information mining system. In this paper, an evaluation approach is demonstrated that is based on information-theoretic quantities to determine the information flow between system levels of different semantic abstraction and to analyze human-computer interactions.

  12. Image Information Mining System Evaluation Using Information-Theoretic Measures

    Science.gov (United States)

    Daschiel, Herbert; Datcu, Mihai

    2005-12-01

    During the last decade, the exponential increase of multimedia and remote sensing image archives, the fast expansion of the world wide web, and the high diversity of users have yielded concepts and systems for successful content-based image retrieval and image information mining. Image data information systems require both database and visual capabilities, but there is a gap between these systems. Database systems usually do not deal with multidimensional pictorial structures and vision systems do not provide database query functions. In terms of these points, the evaluation of content-based image retrieval systems became a focus of research interest. One can find several system evaluation approaches in literature, however, only few of them go beyond precision-recall graphs and do not allow a detailed evaluation of an interactive image retrieval system. Apart from the existing evaluation methodologies, we aim at the overall validation of our knowledge-driven content-based image information mining system. In this paper, an evaluation approach is demonstrated that is based on information-theoretic quantities to determine the information flow between system levels of different semantic abstraction and to analyze human-computer interactions.

  13. Information Theoretic Inequalities as Bounds in Superconformal Field Theory

    CERN Document Server

    Zhou, Yang

    2016-01-01

    An information theoretic approach to bounds in superconformal field theories is proposed. It is proved that the supersymmetric R\\'enyi entropy $\\bar S_\\alpha$ is a monotonically decreasing function of $\\alpha$ and $(\\alpha-1)\\bar S_\\alpha$ is a concave function of $\\alpha$. Under the assumption that the thermal entropy associated with the "replica trick" time circle is bounded from below by the charge in the supersymmetric system, it is further proved that both ${\\alpha-1\\over \\alpha}\\bar S_\\alpha$ and $(\\alpha-1)\\bar S_\\alpha$ monotonically increase as functions of $\\alpha$. Because $\\bar S_\\alpha$ enjoys universal relations with the Weyl anomaly coefficients in even-dimensional superconformal field theories, one therefore obtains a set of bounds on these coefficients by imposing the inequalities of $\\bar S_\\alpha$. Some of the bounds coincide with Hofman-Maldacena bounds and the others are new. We also check the inequalities for examples in odd-dimensions.

  14. Tight exponential evaluation for information theoretical secrecy based on L1 distance

    CERN Document Server

    Hayashi, Masahito

    2010-01-01

    We adopt L1 distance as Eve's distinguishability in secret key generation from a common random number without communication. Under this secrecy criterion, using the Renyi entropy of order 1 + s for s in [0, 1], we derive a new upper bound of Eve's distinguishability under the application of the universal2 hash function. It is also shown that this bound gives the tight exponential decreasing rate. The result is applied to wire-tap channel model and secret key distillation (agreement) by public discussion.

  15. Physics Without Physics. The Power of Information-theoretical Principles

    Science.gov (United States)

    D'Ariano, Giacomo Mauro

    2017-01-01

    David Finkelstein was very fond of the new information-theoretic paradigm of physics advocated by John Archibald Wheeler and Richard Feynman. Only recently, however, the paradigm has concretely shown its full power, with the derivation of quantum theory (Chiribella et al., Phys. Rev. A 84:012311, 2011; D'Ariano et al., 2017) and of free quantum field theory (D'Ariano and Perinotti, Phys. Rev. A 90:062106, 2014; Bisio et al., Phys. Rev. A 88:032301, 2013; Bisio et al., Ann. Phys. 354:244, 2015; Bisio et al., Ann. Phys. 368:177, 2016) from informational principles. The paradigm has opened for the first time the possibility of avoiding physical primitives in the axioms of the physical theory, allowing a re-foundation of the whole physics over logically solid grounds. In addition to such methodological value, the new information-theoretic derivation of quantum field theory is particularly interesting for establishing a theoretical framework for quantum gravity, with the idea of obtaining gravity itself as emergent from the quantum information processing, as also suggested by the role played by information in the holographic principle (Susskind, J. Math. Phys. 36:6377, 1995; Bousso, Rev. Mod. Phys. 74:825, 2002). In this paper I review how free quantum field theory is derived without using mechanical primitives, including space-time, special relativity, Hamiltonians, and quantization rules. The theory is simply provided by the simplest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the three following simple principles: homogeneity, locality, and isotropy. The inherent discrete nature of the informational derivation leads to an extension of quantum field theory in terms of a quantum cellular automata and quantum walks. A simple heuristic argument sets the scale to the Planck one, and the currently observed regime where discreteness is not visible is the so-called "relativistic regime" of small wavevectors, which

  16. Physics Without Physics - The Power of Information-theoretical Principles

    Science.gov (United States)

    D'Ariano, Giacomo Mauro

    2016-11-01

    David Finkelstein was very fond of the new information-theoretic paradigm of physics advocated by John Archibald Wheeler and Richard Feynman. Only recently, however, the paradigm has concretely shown its full power, with the derivation of quantum theory (Chiribella et al., Phys. Rev. A 84:012311, 2011; D'Ariano et al., 2017) and of free quantum field theory (D'Ariano and Perinotti, Phys. Rev. A 90:062106, 2014; Bisio et al., Phys. Rev. A 88:032301, 2013; Bisio et al., Ann. Phys. 354:244, 2015; Bisio et al., Ann. Phys. 368:177, 2016) from informational principles. The paradigm has opened for the first time the possibility of avoiding physical primitives in the axioms of the physical theory, allowing a re-foundation of the whole physics over logically solid grounds. In addition to such methodological value, the new information-theoretic derivation of quantum field theory is particularly interesting for establishing a theoretical framework for quantum gravity, with the idea of obtaining gravity itself as emergent from the quantum information processing, as also suggested by the role played by information in the holographic principle (Susskind, J. Math. Phys. 36:6377, 1995; Bousso, Rev. Mod. Phys. 74:825, 2002). In this paper I review how free quantum field theory is derived without using mechanical primitives, including space-time, special relativity, Hamiltonians, and quantization rules. The theory is simply provided by the simplest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the three following simple principles: homogeneity, locality, and isotropy. The inherent discrete nature of the informational derivation leads to an extension of quantum field theory in terms of a quantum cellular automata and quantum walks. A simple heuristic argument sets the scale to the Planck one, and the currently observed regime where discreteness is not visible is the so-called "relativistic regime" of small wavevectors, which

  17. An information theoretic approach for combining neural network process models.

    Science.gov (United States)

    Sridhar, D V.; Bartlett, E B.; Seagrave, R C.

    1999-07-01

    Typically neural network modelers in chemical engineering focus on identifying and using a single, hopefully optimal, neural network model. Using a single optimal model implicitly assumes that one neural network model can extract all the information available in a given data set and that the other candidate models are redundant. In general, there is no assurance that any individual model has extracted all relevant information from the data set. Recently, Wolpert (Neural Networks, 5(2), 241 (1992)) proposed the idea of stacked generalization to combine multiple models. Sridhar, Seagrave and Barlett (AIChE J., 42, 2529 (1996)) implemented the stacked generalization for neural network models by integrating multiple neural networks into an architecture known as stacked neural networks (SNNs). SNNs consist of a combination of the candidate neural networks and were shown to provide improved modeling of chemical processes. However, in Sridhar's work SNNs were limited to using a linear combination of artificial neural networks. While a linear combination is simple and easy to use, it can utilize only those model outputs that have a high linear correlation to the output. Models that are useful in a nonlinear sense are wasted if a linear combination is used. In this work we propose an information theoretic stacking (ITS) algorithm for combining neural network models. The ITS algorithm identifies and combines useful models regardless of the nature of their relationship to the actual output. The power of the ITS algorithm is demonstrated through three examples including application to a dynamic process modeling problem. The results obtained demonstrate that the SNNs developed using the ITS algorithm can achieve highly improved performance as compared to selecting and using a single hopefully optimal network or using SNNs based on a linear combination of neural networks.

  18. How many clusters? An information-theoretic perspective.

    Science.gov (United States)

    Still, Susanne; Bialek, William

    2004-12-01

    Clustering provides a common means of identifying structure in complex data, and there is renewed interest in clustering as a tool for the analysis of large data sets in many fields. A natural question is how many clusters are appropriate for the description of a given system. Traditional approaches to this problem are based on either a framework in which clusters of a particular shape are assumed as a model of the system or on a two-step procedure in which a clustering criterion determines the optimal assignments for a given number of clusters and a separate criterion measures the goodness of the classification to determine the number of clusters. In a statistical mechanics approach, clustering can be seen as a trade-off between energy- and entropy-like terms, with lower temperature driving the proliferation of clusters to provide a more detailed description of the data. For finite data sets, we expect that there is a limit to the meaningful structure that can be resolved and therefore a minimum temperature beyond which we will capture sampling noise. This suggests that correcting the clustering criterion for the bias that arises due to sampling errors will allow us to find a clustering solution at a temperature that is optimal in the sense that we capture maximal meaningful structure--without having to define an external criterion for the goodness or stability of the clustering. We show that in a general information-theoretic framework, the finite size of a data set determines an optimal temperature, and we introduce a method for finding the maximal number of clusters that can be resolved from the data in the hard clustering limit.

  19. Glutamate Acts as a Key Signal Linking Glucose Metabolism to Incretin/cAMP Action to Amplify Insulin Secretion

    Directory of Open Access Journals (Sweden)

    Ghupurjan Gheni

    2014-10-01

    Full Text Available Incretins, hormones released by the gut after meal ingestion, are essential for maintaining systemic glucose homeostasis by stimulating insulin secretion. The effect of incretins on insulin secretion occurs only at elevated glucose concentrations and is mediated by cAMP signaling, but the mechanism linking glucose metabolism and cAMP action in insulin secretion is unknown. We show here, using a metabolomics-based approach, that cytosolic glutamate derived from the malate-aspartate shuttle upon glucose stimulation underlies the stimulatory effect of incretins and that glutamate uptake into insulin granules mediated by cAMP/PKA signaling amplifies insulin release. Glutamate production is diminished in an incretin-unresponsive, insulin-secreting β cell line and pancreatic islets of animal models of human diabetes and obesity. Conversely, a membrane-permeable glutamate precursor restores amplification of insulin secretion in these models. Thus, cytosolic glutamate represents the elusive link between glucose metabolism and cAMP action in incretin-induced insulin secretion.

  20. Hydathode trichomes actively secreting water from leaves play a key role in the physiology and evolution of root-parasitic rhinanthoid Orobanchaceae

    Science.gov (United States)

    Světlíková, Petra; Hájek, Tomáš; Těšitel, Jakub

    2015-01-01

    Background and Aims Root hemiparasites from the rhinanthoid clade of Orobanchaceae possess metabolically active glandular trichomes that have been suggested to function as hydathode trichomes actively secreting water, a process that may facilitate resource acquisition from the host plant’s root xylem. However, no direct evidence relating the trichomes to water secretion exists, and carbon budgets associated with this energy-demanding process have not been determined. Methods Macro- and microscopic observations of the leaves of hemiparasitic Rhinanthus alectorolophus were conducted and night-time gas exchange was measured. Correlations were examined among the intensity of guttation, respiration and transpiration, and analysis of these correlations allowed the carbon budget of the trichome activity to be quantified. We examined the intensity of guttation, respiration and transpiration, correlations among which indicate active water secretion. Key Results Guttation was observed on the leaves of 50 % of the young, non-flowering plants that were examined, and microscopic observations revealed water secretion from the glandular trichomes present on the abaxial leaf side. Night-time rates of respiration and transpiration and the presence of guttation drops were positively correlated, which is a clear indicator of hydathode trichome activity. Subsequent physiological measurements on older, flowering plants indicated neither intense guttation nor the presence of correlations, which suggests that the peak activity of hydathodes is in the juvenile stage. Conclusions This study provides the first unequivocal evidence for the physiological role of the hydathode trichomes in active water secretion in the rhinanthoid Orobanchaceae. Depending on the concentration of organic elements calculated to be in the host xylem sap, the direct effect of water secretion on carbon balance ranges from close to neutral to positive. However, it is likely to be positive in the xylem-only feeding

  1. Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds

    CERN Document Server

    Reeves, Galen

    2010-01-01

    Recovery of the sparsity pattern (or support) of a sparse vector from a small number of noisy linear projections (or samples) is a common problem that arises in signal processing and statistics. In this paper, the high-dimensional setting is considered. It is shown that if the sampling rate and per-sample signal-to-noise ratio (SNR) are finite constants independent of the length of the vector, then the optimal sparsity pattern estimate will have a constant fraction of errors. Lower bounds on the sampling rate needed to attain a desired fraction of errors are given in terms of the SNR and various key parameters of the unknown vector. The tightness of the bounds in a scaling sense, as a function of the SNR and the fraction of errors, is established by comparison with existing achievable bounds. Near optimality is shown for a wide variety of practically motivated signal models.

  2. Studies of Chinese speakers with dysarthria: informing theoretical models.

    Science.gov (United States)

    Whitehill, Tara L

    2010-01-01

    Most theoretical models of dysarthria have been developed based on research using individuals speaking English or other Indo-European languages. Studies of individuals with dysarthria speaking other languages can allow investigation into the universality of such models, and the interplay between language-specific and language-universal aspects of dysarthria. In this article, studies of Cantonese- and Mandarin-Chinese speakers with dysarthria are reviewed. The studies focused on 2 groups of speakers: those with cerebral palsy and those with Parkinson's disease. Key findings are compared with similar studies of English speakers. Since Chinese is tonal in nature, the impact of dysarthria on lexical tone has received considerable attention in the literature. The relationship between tone [which involves fundamental frequency (F(0)) control at the syllable level] and intonation (involving F(0) control at the sentential level) has received more recent attention. Many findings for Chinese speakers with dysarthria support earlier findings for English speakers, thus affirming the language-universal aspect of dysarthria. However, certain differences, which can be attributed to the distinct phonologies of Cantonese and Mandarin, highlight the language-specific aspects of the condition.

  3. Leakproof secret sharing protocols with applications to group identification scheme

    Institute of Scientific and Technical Information of China (English)

    TANG ChunMing; GAO ShuHong

    2012-01-01

    In a traditional (t,n)-threshold secret sharing scheme,t or more honest participants can reconstruct the secret K.In the reconstruction process,the individual shares and the secret key K are revealed,hence K is shared once only. In this paper,we firstly give the definition of leakproof secret sharing scheme which is composed of a distribution protocol and a proof protocol,then propose two leakproof secret sharing protocols,a computationally secure protocol and an information-theoretically secure protocol.In our protocols,t or more participants can jointly prove that they hold the secret K by using a multi-prover zero-knowledge argument of knowledge.As a result,the secret K will be shared for as many times as desired.Furthermore,each participant can detect the dealer in the distribution protocol from cheating,and any verifier can prevent non-qualified set of participants in proof protocol from cheating.As an example of the practical impact of our work we use our techniques to construct group identification schemes with zero-knowledge.

  4. Understanding uncertainty in seagrass injury recovery: an information-theoretic approach.

    Science.gov (United States)

    Uhrin, Amy V; Kenworthy, W Judson; Fonseca, Mark S

    2011-06-01

    Vessel groundings cause severe, persistent gaps in seagrass beds. Varying degrees of natural recovery have been observed for grounding injuries, limiting recovery prediction capabilities, and therefore, management's ability to focus restoration efforts where natural recovery is unlikely. To improve our capacity for predicting seagrass injury recovery, we used an information-theoretic approach to evaluate the relative contribution of specific injury attributes to the natural recovery of 30 seagrass groundings in Florida Keys National Marine Sanctuary, Florida, USA. Injury recovery was defined by three response variables examined independently: (1) initiation of seagrass colonization, (2) areal contraction, and (3) sediment in-filling. We used a global model and all possible subsets for four predictor variables: (1) injury age, (2) original injury volume, (3) original injury perimeter-to-area ratio, and (4) wave energy. Successional processes were underway for many injuries with fast-growing, opportunistic seagrass species contributing most to colonization. The majority of groundings that exhibited natural seagrass colonization also exhibited areal contraction and sediment in-filling. Injuries demonstrating colonization, contraction, and in-filling were on average older and smaller, and they had larger initial perimeter-to-area ratios. Wave energy was highest for colonizing injuries. The information-theoretic approach was unable to select a single "best" model for any response variable. For colonization and contraction, injury age had the highest relative importance as a predictor variable; wave energy appeared to be associated with second-order effects, such as sediment in-filling, which in turn, facilitated seagrass colonization. For sediment in-filling, volume and perimeter-to-area ratio had similar relative importance as predictor variables with age playing a lesser role than seen for colonization and contraction. Our findings confirm that these injuries

  5. Gingiva equivalents secrete negligible amounts of key chemokines involved in Langerhans cell migration compared to skin equivalents

    NARCIS (Netherlands)

    Kosten, I.J.; Buskermolen, J.K.; Spiekstra, S.W.; de Gruijl, T.D.; Gibbs, S.

    2015-01-01

    Both oral mucosa and skin have the capacity to maintain immune homeostasis or regulate immune responses upon environmental assault. Whereas much is known about key innate immune events in skin, little is known about oral mucosa. Comparative studies are limited due to the scarce supply of oral mucosa

  6. Peripheral biomarkers in Autism: secreted amyloid precursor protein-alpha as a probable key player in early diagnosis.

    Science.gov (United States)

    Bailey, Antoinette R; Giunta, Brian N; Obregon, Demian; Nikolic, William V; Tian, Jun; Sanberg, Cyndy D; Sutton, Danielle T; Tan, Jun

    2008-01-01

    Autism is a pervasive developmental disorder characterized by impairments in socialization and communication. There is currently no single molecular marker or laboratory tool capable of diagnosing autism at an early age. The purpose of this study is to explore the plausible use of peripheral biomarkers in the early diagnosis of autism via a sensitive ELISA. Here, we measured plasma secreted amyloid precursor protein alpha (sAPP-alpha) levels in autistic and aged-matched control blood samples and found a significantly increased level of sAPP-alpha in 60% of the known autistic children. We then tested 150 human umbilical cord blood (HUCB) samples and found significantly elevated levels of plasma sAPP-alpha in 10 of 150 samples. As an additional confirmatory measure, we performed Western blot analysis on these samples which consistently showed increased sAPP-alpha levels in autistic children and 10 of 150 HUCB samples; suggesting a group of autistic patients which could be identified in early childhood by levels of sAPP-alpha. While there is need for further studies of this concept, the measurement of sAPP-alpha levels in serum and human umbilical cord blood by ELISA is a potential tool for early diagnosis of autism.

  7. Key steps in type III secretion system (T3SS) towards translocon assembly with potential sensor at plant plasma membrane.

    Science.gov (United States)

    Ji, Hongtao; Dong, Hansong

    2015-09-01

    Many plant- and animal-pathogenic Gram-negative bacteria employ the type III secretion system (T3SS) to translocate effector proteins from bacterial cells into the cytosol of eukaryotic host cells. The effector translocation occurs through an integral component of T3SS, the channel-like translocon, assembled by hydrophilic and hydrophobic proteinaceous translocators in a two-step process. In the first, hydrophilic translocators localize to the tip of a proteinaceous needle in animal pathogens, or a proteinaceous pilus in plant pathogens, and associate with hydrophobic translocators, which insert into host plasma membranes in the second step. However, the pilus needs to penetrate plant cell walls in advance. All hydrophilic translocators so far identified in plant pathogens are characteristic of harpins: T3SS accessory proteins containing a unitary hydrophilic domain or an additional enzymatic domain. Two-domain harpins carrying a pectate lyase domain potentially target plant cell walls and facilitate the penetration of the pectin-rich middle lamella by the bacterial pilus. One-domain harpins target plant plasma membranes and may play a crucial role in translocon assembly, which may also involve contrapuntal associations of hydrophobic translocators. In all cases, sensory components in the target plasma membrane are indispensable for the membrane recognition of translocators and the functionality of the translocon. The conjectural sensors point to membrane lipids and proteins, and a phosphatidic acid and an aquaporin are able to interact with selected harpin-type translocators. Interactions between translocators and their sensors at the target plasma membrane are assumed to be critical for translocon assembly.

  8. Integrated Modeling in Earth and Space Sciences: An Information Theoretic Framework

    Science.gov (United States)

    Sharma, A. S.; Kalnay, E.

    2011-12-01

    Most natural phenomena exhibit multiscale behavior, which is an underlying reason for the challenges in modeling them. The recognition that the key problems, such as extreme events, natural hazards and climate change, require multi-disciplinary approaches to develop models that integrate many natural and anthropogenic phenomena, demand new approaches in the modeling of such systems. Information theory, which emphasizes the inherent features in observational data independent of modeling assumptions, can be used to develop a framework for multi-disciplinary models by integrating the data of the leading processes in multiple systems. An important measure of the inter-relationship among the different phenomena is the lead time among them. The widely used quantities such as the cross-correlation function represent the linear dependence among the variables and are limited in their ability to describe complex driven systems which are essentially nonlinear. The mutual information function, which represents the expectation of the average degree of dependence incorporating all orders of nonlinearity, provides the characteristic times inherent in the data and can be used as the first step to the development of integrated models. This function is used in two systems with widely separated time scales. The first case is the solar wind - magnetosphere interaction and the correlated data yield ~ 5 hr as the inherent time scale for the magnetospheric processes. The second case is a study of the inter-relationship between natural and anthropogenic phenomena and the mutual information functions were computed from the data of the global gross product, temperature and population. These functions show a time delay of ~15 yrs between the changes in global temperature and population as well as gross product, thus providing a measure of the interdependency among the variables underlying climate change. The results from studies of extreme events and an information theoretic modeling

  9. JIDT: An information-theoretic toolkit for studying the dynamics of complex systems

    CERN Document Server

    Lizier, Joseph T

    2014-01-01

    Complex systems are increasingly being viewed as distributed information processing systems, particularly in the domains of computational neuroscience, bioinformatics and Artificial Life. This trend has resulted in a strong uptake in the use of (Shannon) information-theoretic measures to analyse the dynamics of complex systems in these fields. We introduce the Java Information Dynamics Toolkit (JIDT): a Google code project which provides a standalone, (GNU GPL v3 licensed) open-source code implementation for empirical estimation of information-theoretic measures from time-series data. While the toolkit provides classic information-theoretic measures (e.g. entropy, mutual information, conditional mutual information), it ultimately focusses on implementing higher-level measures for information dynamics. That is, JIDT focusses on quantifying information storage, transfer and modification, and the dynamics of these operations in space and time. For this purpose, it includes implementations of the transfer entropy...

  10. A quantum-information theoretic analysis of three-flavor neutrino oscillations

    Energy Technology Data Exchange (ETDEWEB)

    Banerjee, Subhashish, E-mail: subhashish@iitj.ac.in; Alok, Ashutosh Kumar, E-mail: akalok@iitj.ac.in [Indian Institute of Technology Jodhpur, 342011, Jodhpur (India); Srikanth, R., E-mail: srik@poornaprajna.org [Poornaprajna Institute of Scientific Research, Sadashivnagar, 560080, Banglore (India); Hiesmayr, Beatrix C., E-mail: Beatrix.Hiesmayr@univie.ac.at [University of Vienna, Boltzmanngasse 5, 1090, Vienna (Austria)

    2015-10-13

    Correlations exhibited by neutrino oscillations are studied via quantum-information theoretic quantities. We show that the strongest type of entanglement, genuine multipartite entanglement, is persistent in the flavor changing states. We prove the existence of Bell-type nonlocal features, in both its absolute and genuine avatars. Finally, we show that a measure of nonclassicality, dissension, which is a generalization of quantum discord to the tripartite case, is nonzero for almost the entire range of time in the evolution of an initial electron-neutrino. Via these quantum-information theoretic quantities, capturing different aspects of quantum correlations, we elucidate the differences between the flavor types, shedding light on the quantum-information theoretic aspects of the weak force.

  11. 一种基于密钥矩阵的动态秘密分享方案%A Dynamic Secret Sharing Scheme Based on Key Matrix

    Institute of Scientific and Technical Information of China (English)

    颜浩; 陈克非

    2003-01-01

    In this paper we introduce a dynamic secret sharing scheme. This scheme not only can be used unrestrictedtimes to share and resume different secret without regenerating the information in the users hands,satisfy the (k,n)threshold demand ,but also can realize the asymmetric user right secret sharing and dynamically add and delete the rel-evant users.

  12. Phenomenological description of selected elementary chemical reaction mechanisms: An information-theoretic study

    Energy Technology Data Exchange (ETDEWEB)

    Esquivel, R.O., E-mail: esquivel@xanum.uam.m [Departamento de Quimica, Universidad Autonoma Metropolitana, 09340 Mexico D.F. (Mexico); Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, 18071-Granada (Spain); Instituto Carlos I de Fisica Teorica y Computacional, Universidad de Granada, 18071-Granada (Spain); Flores-Gallegos, N.; Iuga, C.; Carrera, E.M. [Departamento de Quimica, Universidad Autonoma Metropolitana, 09340 Mexico D.F. (Mexico); Angulo, J.C. [Departamento de Fisica Atomica, Molecular y Nuclear, Universidad de Granada, 18071-Granada (Spain); Instituto Carlos I de Fisica Teorica y Computacional, Universidad de Granada, 18071-Granada (Spain); Antolin, J. [Departamento de Fisica Aplicada, EUITIZ, Universidad de Zaragoza, 50018-Zaragoza (Spain); Instituto Carlos I de Fisica Teorica y Computacional, Universidad de Granada, 18071-Granada (Spain)

    2010-02-01

    The information-theoretic description of the course of two elementary chemical reactions allows a phenomenological description of the chemical course of the hydrogenic abstraction and the S{sub N}2 identity reactions by use of Shannon entropic measures in position and momentum spaces. The analyses reveal their synchronous/asynchronous mechanistic behavior.

  13. Distinguishing spectral and temporal properties of speech using an information-theoretic approach

    DEFF Research Database (Denmark)

    Christiansen, Thomas Ulrich; Greenberg, Steven

    2007-01-01

    The spectro-temporal coding of Danish consonants was investigated using an information-theoretic analysis. Listeners identified eleven consonants spoken in CV[l] context. In each condition, only a portion of the original spectrum was played. Center frequencies of 750, 1500 and 3000 Hz, were prese...

  14. 一种基于密钥的硬件木马预防方法研究%Hardware Trojan prevention method based on secret key

    Institute of Scientific and Technical Information of China (English)

    石朝阳; 邹雪城; 明瑞华; 刘政林

    2016-01-01

    硬件木马因其巨大的潜在威胁而受到学术界和工业界越来越广泛的关注。当前主流的集成电路设计制作的各个环节都存在着植入硬件木马的可能性。基于硬件木马的插入设计考虑,提出一种基于密钥的硬件木马预防方法。通过在电路中增加初始序列(密钥)、迷惑电路和冗余电路,隐藏有正确功能的原始电路,以预防在设计及后续环节中可能被植入的硬件木马。基于大量测试矢量激励的实验表明,优化的预防电路在没有太多的额外的电路资源开销的情况下能有效保护电路不被硬件木马破坏,而且不影响正常的功能。%Hardware Trojans draw more and more attention of the academia and industrial community because of its huge potential threat in recent years. Trojans may be inserted in all the current main IC design process. Considering the Trojans insert⁃ing mechanism,a hardware Trojan prevention method based on secret keys is proposed,which is realized by adding initial se⁃quence (secret keys),confusing circuit and redundant circuit,and hiding the original circuit with correct function. The result based on a large number of test vectors shows that the optimized prevention circuit can effectively prevent the normal circuit to be attacked by the Trojans in the case of not spending more extra circuit resources.

  15. Towards integrating control and information theories from information-theoretic measures to control performance limitations

    CERN Document Server

    Fang, Song; Ishii, Hideaki

    2017-01-01

    This book investigates the performance limitation issues in networked feedback systems. The fact that networked feedback systems consist of control and communication devices and systems calls for the integration of control theory and information theory. The primary contributions of this book lie in two aspects: the newly-proposed information-theoretic measures and the newly-discovered control performance limitations. We first propose a number of information notions to facilitate the analysis. Using those notions, classes of performance limitations of networked feedback systems, as well as state estimation systems, are then investigated. In general, the book presents a unique, cohesive treatment of performance limitation issues of networked feedback systems via an information-theoretic approach. This book is believed to be the first to treat the aforementioned subjects systematically and in a unified manner, offering a unique perspective differing from existing books.

  16. An Information-Theoretic Privacy Criterion for Query Forgery in Information Retrieval

    CERN Document Server

    Rebollo-Monedero, David; Forné, Jordi

    2011-01-01

    In previous work, we presented a novel information-theoretic privacy criterion for query forgery in the domain of information retrieval. Our criterion measured privacy risk as a divergence between the user's and the population's query distribution, and contemplated the entropy of the user's distribution as a particular case. In this work, we make a twofold contribution. First, we thoroughly interpret and justify the privacy metric proposed in our previous work, elaborating on the intimate connection between the celebrated method of entropy maximization and the use of entropies and divergences as measures of privacy. Secondly, we attempt to bridge the gap between the privacy and the information-theoretic communities by substantially adapting some technicalities of our original work to reach a wider audience, not intimately familiar with information theory and the method of types.

  17. An Information-Theoretic Approach to PMU Placement in Electric Power Systems

    CERN Document Server

    Li, Qiao; Weng, Yang; Negi, Rohit; Franchetti, Franz; Ilic, Marija D

    2012-01-01

    This paper presents an information-theoretic approach to address the phasor measurement unit (PMU) placement problem in electric power systems. Different from the conventional 'topological observability' based approaches, this paper advocates a much more refined, information-theoretic criterion, namely the mutual information (MI) between the PMU measurements and the power system states. The proposed MI criterion can not only include the full system observability as a special case, but also can rigorously model the remaining uncertainties in the power system states with PMU measurements, so as to generate highly informative PMU configurations. Further, the MI criterion can facilitate robust PMU placement by explicitly modeling probabilistic PMU outages. We propose a greedy PMU placement algorithm, and show that it achieves an approximation ratio of (1-1/e) for any PMU placement budget. We further show that the performance is the best that one can achieve in practice, in the sense that it is NP-hard to achieve ...

  18. Spectral entropies as information-theoretic tools for complex network comparison

    CERN Document Server

    De Domenico, Manlio

    2016-01-01

    Any physical system can be viewed from the perspective that information is implicitly represented in its state. However, the quantification of this information when it comes to complex networks has remained largely elusive. In this work, we use techniques inspired by quantum statistical mechanics to define an entropy measure for complex networks and to develop a set of information-theoretic tools, based on network spectral properties, such as Renyi q-entropy, generalized Kullback-Leibler and Jensen-Shannon divergences, the latter allowing us to define a natural distance measure between complex networks. First we show that by minimizing the Kullback-Leibler divergence between an observed network and a parametric network model, inference of model parameter(s) by means of maximum-likelihood estimation can be achieved and model selection can be performed appropriate information criteria. Second, we show that the information-theoretic metric quantifies the distance between pairs of networks and we can use it, for ...

  19. Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing

    CERN Document Server

    Low, Kian Hsiang; Khosla, Pradeep

    2011-01-01

    Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing information-theoretic exploration strategies for learning GP-based environmental field maps adopt the non-Markovian problem structure and consequently scale poorly with the length of history of observations. Hence, it becomes computationally impractical to use these strategies for in situ, real-time active sampling. To ease this computational burden, this paper presents a Markov-based approach to efficient information-theoretic path planning for active sampling of GP-based fields. We analyze the time complexity of solving the Markov-based path planning problem, and demonstrate analytically that it scales better than that of deriving the non-Markovian strategies with increasing length of planning horizon. For a class of exploration tasks called the transect sampling task, we provide theoretical guarantees on the active sampling performance of...

  20. Wireless Information-Theoretic Security in an Outdoor Topology with Obstacles: Theoretical Analysis and Experimental Measurements

    Directory of Open Access Journals (Sweden)

    Dagiuklas Tasos

    2011-01-01

    Full Text Available This paper presents a Wireless Information-Theoretic Security (WITS scheme, which has been recently introduced as a robust physical layer-based security solution, especially for infrastructureless networks. An autonomic network of moving users was implemented via 802.11n nodes of an ad hoc network for an outdoor topology with obstacles. Obstructed-Line-of-Sight (OLOS and Non-Line-of-Sight (NLOS propagation scenarios were examined. Low-speed user movement was considered, so that Doppler spread could be discarded. A transmitter and a legitimate receiver exchanged information in the presence of a moving eavesdropper. Average Signal-to-Noise Ratio (SNR values were acquired for both the main and the wiretap channel, and the Probability of Nonzero Secrecy Capacity was calculated based on theoretical formula. Experimental results validate theoretical findings stressing the importance of user location and mobility schemes on the robustness of Wireless Information-Theoretic Security and call for further theoretical analysis.

  1. Information Theoretic Source Seeking Strategies for Multiagent Plume Tracking in Turbulent Fields

    Directory of Open Access Journals (Sweden)

    Hadi Hajieghrary

    2017-01-01

    Full Text Available We present information theoretic search strategies for single and multi-robot teams to localize the source of biochemical contaminants in turbulent flows. The robots synthesize the information provided by sporadic and intermittent sensor readings to optimize their exploration strategy. By leveraging the spatio-temporal sensing capabilities of a mobile sensing network, our strategies result in control actions that maximize the information gained by the team while minimizing the time spent localizing the biochemical source. By leveraging the team’s ability to obtain simultaneous measurements at different locations, we show how a multi-robot team is able to speed up the search process resulting in a collaborative information theoretic search strategy. We validate our proposed strategies in both simulations and experiments.

  2. An Information-Theoretic Alternative to the Cronbach's Alpha Coefficient of Item Reliability

    OpenAIRE

    Fokoue, Ernest; Gunduz, Necla

    2015-01-01

    We propose an information-theoretic alternative to the popular Cronbach alpha coefficient of reliability. Particularly suitable for contexts in which instruments are scored on a strictly nonnumeric scale, our proposed index is based on functions of the entropy of the distributions of defined on the sample space of responses. Our reliability index tracks the Cronbach alpha coefficient uniformly while offering several other advantages discussed in great details in this paper.

  3. Information-theoretic equilibration: the appearance of irreversibility under complex quantum dynamics

    OpenAIRE

    2012-01-01

    The question of how irreversibility can emerge as a generic phenomena when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the appearance of irreversibility that applies to coherent, isolated systems in a pure quantum state. This equilibration mechanism requires only an assumption of sufficiently complex internal dynamics and natural information-theoretic constraints arising from ...

  4. Information-Theoretic Conditions for Two-Party Secure Function Evaluation

    DEFF Research Database (Denmark)

    Schaffner, Christian; Crépeau, Claude; Savvides, George

    2006-01-01

    The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to work with in practice. On the other hand, simpler ad-hoc definitions tailored to special scenarios have often been...... flawed. Motivated by this unsatisfactory situation, we give an information-theoretic security definition of secure function evaluation which is very simple yet provably equivalent to the standard, simulation-based definitions....

  5. On the Role of Information Theoretic Uncertainty Relations in Quantum Theory

    OpenAIRE

    Jizba, Petr; Dunningham, Jacob A.; Joo, Jaewoo

    2014-01-01

    Uncertainty relations based on information theory for both discrete and continuous distribution functions are briefly reviewed. We extend these results to account for (differential) R\\'{e}nyi entropy and its related entropy power. This allows us to find a new class of information-theoretic uncertainty relations (ITURs). The potency of such uncertainty relations in quantum mechanics is illustrated with a simple two-energy-level model where they outperform both the usual Robertson-Schr\\"{o}ding...

  6. Information-Theoretic Conditions for Two-Party Secure Function Evaluation

    DEFF Research Database (Denmark)

    Schaffner, Christian; Crépeau, Claude; Savvides, George

    2006-01-01

    The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to work with in practice. On the other hand, simpler ad-hoc definitions tailored to special scenarios have often been...... flawed. Motivated by this unsatisfactory situation, we give an information-theoretic security definition of secure function evaluation which is very simple yet provably equivalent to the standard, simulation-based definitions....

  7. A Novel Information-Theoretic Approach for Variable Clustering and Predictive Modeling Using Dirichlet Process Mixtures

    OpenAIRE

    Yun Chen; Hui Yang

    2016-01-01

    In the era of big data, there are increasing interests on clustering variables for the minimization of data redundancy and the maximization of variable relevancy. Existing clustering methods, however, depend on nontrivial assumptions about the data structure. Note that nonlinear interdependence among variables poses significant challenges on the traditional framework of predictive modeling. In the present work, we reformulate the problem of variable clustering from an information theoretic pe...

  8. Keys through ARQ: Theory and Practice

    CERN Document Server

    Abdallah, Yara; Youssef, Moustafa; Sultan, Ahmed; Gamal, Hesham El

    2010-01-01

    This paper develops a novel framework for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and temporal correlation function. Our analysis reveals a novel role of "dumb antennas" in overcoming the negative impact of spatial correlation on the achievable secrecy rates. We further develop an adaptive rate allocation policy, which achieves higher secrecy rates in temporally correlated channels, and explicit constructions for ARQ secrecy coding that enjoy low implementation complexity. Building on this theoretical foundation, we propose a unified framework for ARQ-based secrecy in Wi-Fi networks. By exploiting the existing ARQ mechanism in the IEEE 802.11 standard, we develop security overlays that offer strong security guarantees at the expense of only minor modifications in the medium access layer. Our numerical results establish the achievability of non-zero secrecy rates ...

  9. Information-Theoretic Properties of Auditory Sequences Dynamically Influence Expectation and Memory.

    Science.gov (United States)

    Agres, Kat; Abdallah, Samer; Pearce, Marcus

    2017-01-25

    A basic function of cognition is to detect regularities in sensory input to facilitate the prediction and recognition of future events. It has been proposed that these implicit expectations arise from an internal predictive coding model, based on knowledge acquired through processes such as statistical learning, but it is unclear how different types of statistical information affect listeners' memory for auditory stimuli. We used a combination of behavioral and computational methods to investigate memory for non-linguistic auditory sequences. Participants repeatedly heard tone sequences varying systematically in their information-theoretic properties. Expectedness ratings of tones were collected during three listening sessions, and a recognition memory test was given after each session. Information-theoretic measures of sequential predictability significantly influenced listeners' expectedness ratings, and variations in these properties had a significant impact on memory performance. Predictable sequences yielded increasingly better memory performance with increasing exposure. Computational simulations using a probabilistic model of auditory expectation suggest that listeners dynamically formed a new, and increasingly accurate, implicit cognitive model of the information-theoretic structure of the sequences throughout the experimental session.

  10. JIDT: An information-theoretic toolkit for studying the dynamics of complex systems

    Directory of Open Access Journals (Sweden)

    Joseph Troy Lizier

    2014-12-01

    Full Text Available Complex systems are increasingly being viewed as distributed information processing systems, particularly in the domains of computational neuroscience, bioinformatics and Artificial Life. This trend has resulted in a strong uptake in the use of (Shannon information-theoretic measures to analyse the dynamics of complex systems in these fields. We introduce the Java Information Dynamics Toolkit (JIDT: a Google code project which provides a standalone, (GNU GPL v3 licensed open-source code implementation for empirical estimation of information-theoretic measures from time-series data. While the toolkit provides classic information-theoretic measures (e.g. entropy, mutual information, conditional mutual information, it ultimately focusses on implementing higher-level measures for information dynamics. That is, JIDT focusses on quantifying information storage, transfer and modification, and the dynamics of these operations in space and time. For this purpose, it includes implementations of the transfer entropy and active information storage, their multivariate extensions and local or pointwise variants. JIDT provides implementations for both discrete and continuous-valued data for each measure, including various types of estimator for continuous data (e.g. Gaussian, box-kernel and Kraskov-Stoegbauer-Grassberger which can be swapped at run-time due to Java's object-oriented polymorphism. Furthermore, while written in Java, the toolkit can be used directly in MATLAB, GNU Octave, Python and other environments. We present the principles behind the code design, and provide several examples to guide users.

  11. Authentication Without Secrets

    Energy Technology Data Exchange (ETDEWEB)

    Pierson, Lyndon G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Robertson, Perry J. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-11-01

    This work examines a new approach to authentication, which is the most fundamental security primitive that underpins all cyber security protections. Current Internet authentication techniques require the protection of one or more secret keys along with the integrity protection of the algorithms/computations designed to prove possession of the secret without actually revealing it. Protecting a secret requires physical barriers or encryption with yet another secret key. The reason to strive for "Authentication without Secret Keys" is that protecting secrets (even small ones only kept in a small corner of a component or device) is much harder than protecting the integrity of information that is not secret. Promising methods are examined for authentication of components, data, programs, network transactions, and/or individuals. The successful development of authentication without secret keys will enable far more tractable system security engineering for high exposure, high consequence systems by eliminating the need for brittle protection mechanisms to protect secret keys (such as are now protected in smart cards, etc.). This paper is a re-release of SAND2009-7032 with new figures numerous edits.

  12. Density functional reactivity theory study of SN2 reactions from the information-theoretic perspective.

    Science.gov (United States)

    Wu, Zemin; Rong, Chunying; Lu, Tian; Ayers, Paul W; Liu, Shubin

    2015-10-28

    As a continuation of our recent efforts to quantify chemical reactivity with quantities from the information-theoretic approach within the framework of density functional reactivity theory, the effectiveness of applying these quantities to quantify electrophilicity for the bimolecular nucleophilic substitution (SN2) reactions in both gas phase and aqueous solvent is presented in this work. We examined a total of 21 self-exchange SN2 reactions for the compound with the general chemical formula of R1R2R3C-F, where R1, R2, and R3 represent substituting alkyl groups such as -H, -CH3, -C2H5, -C3H7, and -C4H9 in both gas and solvent phases. Our findings confirm that scaling properties for information-theoretic quantities found elsewhere are still valid. It has also been verified that the barrier height has the strongest correlation with the electrostatic interaction, but the contributions from the exchange-correlation and steric effects, though less significant, are indispensable. We additionally unveiled that the barrier height of these SN2 reactions can reliably be predicted not only by the Hirshfeld charge and information gain at the regioselective carbon atom, as previously reported by us for other systems, but also by other information-theoretic descriptors such as Shannon entropy, Fisher information, and Ghosh-Berkowitz-Parr entropy on the same atom. These new findings provide further insights for the better understanding of the factors impacting the chemical reactivity of this vastly important category of chemical transformations.

  13. Information-theoretic approach to quantum error correction and reversible measurement

    CERN Document Server

    Nielsen, M A; Schumacher, B; Barnum, H N; Caves, Carlton M.; Schumacher, Benjamin; Barnum, Howard

    1997-01-01

    Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error-correcting codes, teleportation, and reversing quantum measurements. We derive information-theoretic conditions and equivalent algebraic conditions that are necessary and sufficient for a general quantum operation to be reversible. We analyze the thermodynamic cost of error correction and show that error correction can be regarded as a kind of ``Maxwell demon,'' for which there is an entropy cost associated with information obtained from measurements performed during error correction. A prescription for thermodynamically efficient error correction is given.

  14. Advances on BYY harmony learning: information theoretic perspective, generalized projection geometry, and independent factor autodetermination.

    Science.gov (United States)

    Xu, Lei

    2004-07-01

    The nature of Bayesian Ying-Yang harmony learning is reexamined from an information theoretic perspective. Not only its ability for model selection and regularization is explained with new insights, but also discussions are made on its relations and differences from the studies of minimum description length (MDL), Bayesian approach, the bit-back based MDL, Akaike information criterion (AIC), maximum likelihood, information geometry, Helmholtz machines, and variational approximation. Moreover, a generalized projection geometry is introduced for further understanding such a new mechanism. Furthermore, new algorithms are also developed for implementing Gaussian factor analysis (FA) and non-Gaussian factor analysis (NFA) such that selecting appropriate factors is automatically made during parameter learning.

  15. Information Theoretic Global Measures of Dirac Equation With Morse and Trigonometric Rosen-Morse Potentials

    Science.gov (United States)

    Najafizade, S. A.; Hassanabadi, H.; Zarrinkamar, S.

    2017-09-01

    In this study, the information-theoretic measures of (1+1)-dimensional Dirac equation in both position and momentum spaces are investigated for the trigonometric Rosen-Morse and the Morse potentials. The solutions of the corresponding Dirac equation are obtained in an exact analytical manner in the first step. Next, using the Fourier transformation, the position and momentum Shannon information entropies are obtained and some features of the probability densities are analyzed. The consistency with Bialynicki-Birula-Mycielski inequality and Heisenberg uncertainty is checked.

  16. Information Theoretic Exemplification of the Impact of Transmitter-Receiver Cognition on the Channel Capacity

    CERN Document Server

    Anzabi-Nezhad, Nima S; Kakhki, Mohammad Molavi

    2011-01-01

    In this paper, we study, information theoretically, the impact of transmitter and or receiver cognition on the channel capacity. The cognition can be described by state information, dependent on the channel noise and or input. Specifically, as a new idea, we consider the receiver cognition as a state information dependent on the noise and we derive a capacity theorem based on the Gaussian version of the Cover-Chiang capacity theorem for two-sided state information channel. As intuitively expected, the receiver cognition increases the channel capacity and our theorem shows this increase quantitatively. Also, our capacity theorem includes the famous Costa theorem as its special cases.

  17. EEG-fMRI based information theoretic characterization of the human perceptual decision system.

    Directory of Open Access Journals (Sweden)

    Dirk Ostwald

    Full Text Available The modern metaphor of the brain is that of a dynamic information processing device. In the current study we investigate how a core cognitive network of the human brain, the perceptual decision system, can be characterized regarding its spatiotemporal representation of task-relevant information. We capitalize on a recently developed information theoretic framework for the analysis of simultaneously acquired electroencephalography (EEG and functional magnetic resonance imaging data (fMRI (Ostwald et al. (2010, NeuroImage 49: 498-516. We show how this framework naturally extends from previous validations in the sensory to the cognitive domain and how it enables the economic description of neural spatiotemporal information encoding. Specifically, based on simultaneous EEG-fMRI data features from n = 13 observers performing a visual perceptual decision task, we demonstrate how the information theoretic framework is able to reproduce earlier findings on the neurobiological underpinnings of perceptual decisions from the response signal features' marginal distributions. Furthermore, using the joint EEG-fMRI feature distribution, we provide novel evidence for a highly distributed and dynamic encoding of task-relevant information in the human brain.

  18. Spike train analysis toolkit: enabling wider application of information-theoretic techniques to neurophysiology.

    Science.gov (United States)

    Goldberg, David H; Victor, Jonathan D; Gardner, Esther P; Gardner, Daniel

    2009-09-01

    Conventional methods widely available for the analysis of spike trains and related neural data include various time- and frequency-domain analyses, such as peri-event and interspike interval histograms, spectral measures, and probability distributions. Information theoretic methods are increasingly recognized as significant tools for the analysis of spike train data. However, developing robust implementations of these methods can be time-consuming, and determining applicability to neural recordings can require expertise. In order to facilitate more widespread adoption of these informative methods by the neuroscience community, we have developed the Spike Train Analysis Toolkit. STAToolkit is a software package which implements, documents, and guides application of several information-theoretic spike train analysis techniques, thus minimizing the effort needed to adopt and use them. This implementation behaves like a typical Matlab toolbox, but the underlying computations are coded in C for portability, optimized for efficiency, and interfaced with Matlab via the MEX framework. STAToolkit runs on any of three major platforms: Windows, Mac OS, and Linux. The toolkit reads input from files with an easy-to-generate text-based, platform-independent format. STAToolkit, including full documentation and test cases, is freely available open source via http://neuroanalysis.org , maintained as a resource for the computational neuroscience and neuroinformatics communities. Use cases drawn from somatosensory and gustatory neurophysiology, and community use of STAToolkit, demonstrate its utility and scope.

  19. An Information-Theoretic Measure for Face Recognition: Comparison with Structural Similarity

    Directory of Open Access Journals (Sweden)

    Asmhan Flieh Hassan

    2014-11-01

    Full Text Available Automatic recognition of people faces is a challenging problem that has received significant attention from signal processing researchers in recent years. This is due to its several applications in different fields, including security and forensic analysis. Despite this attention, face recognition is still one among the most challenging problems. Up to this moment, there is no technique that provides a reliable solution to all situations. In this paper a novel technique for face recognition is presented. This technique, which is called ISSIM, is derived from our recently published information - theoretic similarity measure HSSIM, which was based on joint histogram. Face recognition with ISSIM is still based on joint histogram of a test image and a database images. Performance evaluation was performed on MATLAB using part of the well-known AT&T image database that consists of 49 face images, from which seven subjects are chosen, and for each subject seven views (poses are chosen with different facial expressions. The goal of this paper is to present a simplified approach for face recognition that may work in real-time environments. Performance of our information - theoretic face recognition method (ISSIM has been demonstrated experimentally and is shown to outperform the well-known, statistical-based method (SSIM.

  20. Several foundational and information theoretic implications of Bell’s theorem

    Science.gov (United States)

    Kar, Guruprasad; Banik, Manik

    2016-08-01

    In 1935, Albert Einstein and two colleagues, Boris Podolsky and Nathan Rosen (EPR) developed a thought experiment to demonstrate what they felt was a lack of completeness in quantum mechanics (QM). EPR also postulated the existence of more fundamental theory where physical reality of any system would be completely described by the variables/states of that fundamental theory. This variable is commonly called hidden variable and the theory is called hidden variable theory (HVT). In 1964, John Bell proposed an empirically verifiable criterion to test for the existence of these HVTs. He derived an inequality, which must be satisfied by any theory that fulfill the conditions of locality and reality. He also showed that QM, as it violates this inequality, is incompatible with any local-realistic theory. Later it has been shown that Bell’s inequality (BI) can be derived from different set of assumptions and it also find applications in useful information theoretic protocols. In this review, we will discuss various foundational as well as information theoretic implications of BI. We will also discuss about some restricted nonlocal feature of quantum nonlocality and elaborate the role of Uncertainty principle and Complementarity principle in explaining this feature.

  1. The equivalence of information-theoretic and likelihood-based methods for neural dimensionality reduction.

    Directory of Open Access Journals (Sweden)

    Ross S Williamson

    2015-04-01

    Full Text Available Stimulus dimensionality-reduction methods in neuroscience seek to identify a low-dimensional space of stimulus features that affect a neuron's probability of spiking. One popular method, known as maximally informative dimensions (MID, uses an information-theoretic quantity known as "single-spike information" to identify this space. Here we examine MID from a model-based perspective. We show that MID is a maximum-likelihood estimator for the parameters of a linear-nonlinear-Poisson (LNP model, and that the empirical single-spike information corresponds to the normalized log-likelihood under a Poisson model. This equivalence implies that MID does not necessarily find maximally informative stimulus dimensions when spiking is not well described as Poisson. We provide several examples to illustrate this shortcoming, and derive a lower bound on the information lost when spiking is Bernoulli in discrete time bins. To overcome this limitation, we introduce model-based dimensionality reduction methods for neurons with non-Poisson firing statistics, and show that they can be framed equivalently in likelihood-based or information-theoretic terms. Finally, we show how to overcome practical limitations on the number of stimulus dimensions that MID can estimate by constraining the form of the non-parametric nonlinearity in an LNP model. We illustrate these methods with simulations and data from primate visual cortex.

  2. The equivalence of information-theoretic and likelihood-based methods for neural dimensionality reduction.

    Science.gov (United States)

    Williamson, Ross S; Sahani, Maneesh; Pillow, Jonathan W

    2015-04-01

    Stimulus dimensionality-reduction methods in neuroscience seek to identify a low-dimensional space of stimulus features that affect a neuron's probability of spiking. One popular method, known as maximally informative dimensions (MID), uses an information-theoretic quantity known as "single-spike information" to identify this space. Here we examine MID from a model-based perspective. We show that MID is a maximum-likelihood estimator for the parameters of a linear-nonlinear-Poisson (LNP) model, and that the empirical single-spike information corresponds to the normalized log-likelihood under a Poisson model. This equivalence implies that MID does not necessarily find maximally informative stimulus dimensions when spiking is not well described as Poisson. We provide several examples to illustrate this shortcoming, and derive a lower bound on the information lost when spiking is Bernoulli in discrete time bins. To overcome this limitation, we introduce model-based dimensionality reduction methods for neurons with non-Poisson firing statistics, and show that they can be framed equivalently in likelihood-based or information-theoretic terms. Finally, we show how to overcome practical limitations on the number of stimulus dimensions that MID can estimate by constraining the form of the non-parametric nonlinearity in an LNP model. We illustrate these methods with simulations and data from primate visual cortex.

  3. Phenomenological description of a three-center insertion reaction: an information-theoretic study.

    Science.gov (United States)

    Esquivel, Rodolfo O; Flores-Gallegos, Nelson; Dehesa, Jesús S; Angulo, Juan Carlos; Antolín, Juan; López-Rosa, Sheila; Sen, K D

    2010-02-04

    Information-theoretic measures are employed to describe the course of a three-center chemical reaction in terms of detecting the transition state and the stationary points unfolding the bond-forming and bond-breaking regions which are not revealed in the energy profile. The information entropy profiles for the selected reactions are generated by following the intrinsic-reaction-coordinate (IRC) path calculated at the MP2 level of theory from which Shannon entropies in position and momentum spaces at the QCISD(T)/6-311++G(3df,2p) level are determined. Several complementary reactivity descriptors are also determined, such as the dipole moment, the molecular electrostatic potential (MEP) obtained through a multipole expansion (DMA), the atomic charges and electric potentials fitted to the MEP, the hardness and softness DFT descriptors, and several geometrical parameters which support the information-theoretic analysis. New density-based structures related to the bond-forming and bond-breaking regions are proposed. Our results support the concept of a continuum of transient of Zewail and Polanyi for the transition state rather than a single state, which is also in agreement with reaction-force analyses.

  4. Improving Security of Audio Watermarking in Image using Selector Keys

    Directory of Open Access Journals (Sweden)

    Amir Reza Fazli

    2012-06-01

    Full Text Available This study presents a novel watermarking algorithm for improving the security and robustness of hiding audio data in an image. Multi resolution discrete wavelet transform is used for embedding the audio watermark in an image. In this context, security is quantified from an information theoretic point of view by means of the equivocation and information leakage of the secret parameters. The selector keys are used as a criterion to determine the location of appropriate wavelet blocks and wavelet coefficients for embedding the watermark. Also, simulations assess the security levels derived in the theoretical part of the paper. The experimental results demonstrate that using the selector keys enhance the security level of the watermark embedding for a variety of scenarios. The level of the algorithm robustness is shown by considering Normalized Correlation (NC between the original audio watermark and extracted watermark.

  5. TtsI, a key regulator of Rhizobium species NGR234 is required for type III-dependent protein secretion and synthesis of rhamnose-rich polysaccharides.

    Science.gov (United States)

    Marie, Corinne; Deakin, William J; Ojanen-Reuhs, Tuula; Diallo, Ericka; Reuhs, Brad; Broughton, William J; Perret, Xavier

    2004-09-01

    Formation of nitrogen-fixing nodules on legume roots by Rhizobium sp. NGR234 requires an array of bacterial factors, including nodulation outer proteins (Nops) secreted through a type III secretion system (TTSS). Secretion of Nops is abolished upon inactivation of ttsI (formerly y4xI), a protein with characteristics of two-component response regulators that was predicted to activate transcription of TTSS-related genes. During the symbiotic interaction, the phenotype of NGR omega ttsI differs from that of a mutant with a nonfunctional secretion machine, however. This indicated that TtsI regulates the synthesis of other symbiotic factors as well. Conserved sequences, called tts boxes, proposed to act as binding sites for TtsI, were identified not only within the TTSS cluster but also in the promoter regions of i) genes predicted to encode homologs of virulence factors secreted by pathogenic bacteria, ii) loci involved in the synthesis of a rhamnose-rich component (rhamnan) of the lipopolysaccharides (LPS), and iii) open reading frames that play roles in plasmid partitioning. Transcription studies showed that TtsI and tts boxes are required for the activation of TTSS-related genes and those involved in rhamnose synthesis. Furthermore, extraction of polysaccharides revealed that inactivation of ttsI abolishes the synthesis of the rhamnan component of the LPS. The phenotypes of mutants impaired in TTSS-dependent protein secretion, rhamnan synthesis, or in both functions were compared to assess the roles of some of the TtsI-controlled factors during symbiosis.

  6. Predictive coding and the slowness principle: an information-theoretic approach.

    Science.gov (United States)

    Creutzig, Felix; Sprekeler, Henning

    2008-04-01

    Understanding the guiding principles of sensory coding strategies is a main goal in computational neuroscience. Among others, the principles of predictive coding and slowness appear to capture aspects of sensory processing. Predictive coding postulates that sensory systems are adapted to the structure of their input signals such that information about future inputs is encoded. Slow feature analysis (SFA) is a method for extracting slowly varying components from quickly varying input signals, thereby learning temporally invariant features. Here, we use the information bottleneck method to state an information-theoretic objective function for temporally local predictive coding. We then show that the linear case of SFA can be interpreted as a variant of predictive coding that maximizes the mutual information between the current output of the system and the input signal in the next time step. This demonstrates that the slowness principle and predictive coding are intimately related.

  7. Parametric Sensitivity Analysis for Stochastic Molecular Systems using Information Theoretic Metrics

    CERN Document Server

    Tsourtis, Anastasios; Katsoulakis, Markos A; Harmandaris, Vagelis

    2014-01-01

    In this paper we extend the parametric sensitivity analysis (SA) methodology proposed in Ref. [Y. Pantazis and M. A. Katsoulakis, J. Chem. Phys. 138, 054115 (2013)] to continuous time and continuous space Markov processes represented by stochastic differential equations and, particularly, stochastic molecular dynamics as described by the Langevin equation. The utilized SA method is based on the computation of the information-theoretic (and thermodynamic) quantity of relative entropy rate (RER) and the associated Fisher information matrix (FIM) between path distributions. A major advantage of the pathwise SA method is that both RER and pathwise FIM depend only on averages of the force field therefore they are tractable and computable as ergodic averages from a single run of the molecular dynamics simulation both in equilibrium and in non-equilibrium steady state regimes. We validate the performance of the extended SA method to two different molecular stochastic systems, a standard Lennard-Jones fluid and an al...

  8. Information theoretical performance measure for associative memories and its application to neural networks.

    Science.gov (United States)

    Schlüter, M; Kerschhaggl, O; Wagner, F

    1999-08-01

    We present a general performance measure (information loss) for associative memories based on information theoretical concepts. This performance measure can be estimated, provided that mean values of observables have been determined for the associative memory. Then the estimation guarantees a minimal association quality. The formalism allows the application of the performance measure to complex systems where the relation between input and output of the associative memory is not explicitly known. Here we apply our formalism to the Hopfield model and estimate the storage capacity alpha(c) from the numerically determined information loss. In contrast to other numerical methods the whole overlap distribution is taken into account. Our numerical value alpha(c)=0.1379(4) for the storage capacity in the Hopfield model is below numerical values obtained previously. This indicates that the consideration of small remnant overlaps lowers the storage capacity of the Hopfield model.

  9. Information-theoretic equilibration: the appearance of irreversibility under complex quantum dynamics.

    Science.gov (United States)

    Ududec, Cozmin; Wiebe, Nathan; Emerson, Joseph

    2013-08-23

    The question of how irreversibility can emerge as a generic phenomenon when the underlying mechanical theory is reversible has been a long-standing fundamental problem for both classical and quantum mechanics. We describe a mechanism for the appearance of irreversibility that applies to coherent, isolated systems in a pure quantum state. This equilibration mechanism requires only an assumption of sufficiently complex internal dynamics and natural information-theoretic constraints arising from the infeasibility of collecting an astronomical amount of measurement data. Remarkably, we are able to prove that irreversibility can be understood as typical without assuming decoherence or restricting to coarse-grained observables, and hence occurs under distinct conditions and time scales from those implied by the usual decoherence point of view. We illustrate the effect numerically in several model systems and prove that the effect is typical under the standard random-matrix conjecture for complex quantum systems.

  10. How much a galaxy knows about its large-scale environment ? : An information theoretic perspective

    CERN Document Server

    Pandey, Biswajit

    2016-01-01

    The small-scale environment characterized by the local density is known to play a crucial role in deciding the galaxy properties but the role of large-scale environment on galaxy formation and evolution still remain a less clear issue. We propose an information theoretic framework to investigate the influence of large-scale environment on galaxy properties and apply it to the data from the Galaxy Zoo project which provides the visual morphological classifications of $\\sim 1$ million galaxies from the Sloan Digital Sky Survey. We find a non-zero mutual information between morphology and environment which decreases with increasing length scales but persists throughout the entire length scales probed. We estimate the conditional mutual information and the interaction information between morphology and environment by conditioning the environment on different length scales and find a synergic interaction between them which operates upto at least a length scales of $ \\sim 30 \\, h^{-1}\\, {\\rm Mpc}$. Our analysis ind...

  11. Information-theoretic bound on the energy cost of stochastic simulation

    CERN Document Server

    Wiesner, Karoline; Rieper, Elisabeth; Vedral, Vlatko

    2011-01-01

    Physical systems are often simulated using a stochastic computation where different final states result from identical initial states. Here, we derive the minimum energy cost of simulating a complex data set of a general physical system with a stochastic computation. We show that the cost is proportional to the difference between two information-theoretic measures of complexity of the data - the statistical complexity and the predictive information. We derive the difference as the amount of information erased during the computation. Finally, we illustrate the physics of information by implementing the stochastic computation as a Gedankenexperiment of a Szilard-type engine. The results create a new link between thermodynamics, information theory, and complexity.

  12. Open source tools for the information theoretic analysis of neural data.

    Science.gov (United States)

    Ince, Robin A A; Mazzoni, Alberto; Petersen, Rasmus S; Panzeri, Stefano

    2010-01-01

    The recent and rapid development of open source software tools for the analysis of neurophysiological datasets consisting of simultaneous multiple recordings of spikes, field potentials and other neural signals holds the promise for a significant advance in the standardization, transparency, quality, reproducibility and variety of techniques used to analyze neurophysiological data and for the integration of information obtained at different spatial and temporal scales. In this review we focus on recent advances in open source toolboxes for the information theoretic analysis of neural responses. We also present examples of their use to investigate the role of spike timing precision, correlations across neurons, and field potential fluctuations in the encoding of sensory information. These information toolboxes, available both in MATLAB and Python programming environments, hold the potential to enlarge the domain of application of information theory to neuroscience and to lead to new discoveries about how neurons encode and transmit information.

  13. Some Observations on the Concepts of Information-Theoretic Entropy and Randomness

    Directory of Open Access Journals (Sweden)

    Jonathan D.H. Smith

    2001-02-01

    Full Text Available Abstract: Certain aspects of the history, derivation, and physical application of the information-theoretic entropy concept are discussed. Pre-dating Shannon, the concept is traced back to Pauli. A derivation from first principles is given, without use of approximations. The concept depends on the underlying degree of randomness. In physical applications, this translates to dependence on the experimental apparatus available. An example illustrates how this dependence affects Prigogine's proposal for the use of the Second Law of Thermodynamics as a selection principle for the breaking of time symmetry. The dependence also serves to yield a resolution of the so-called ``Gibbs Paradox.'' Extension of the concept from the discrete to the continuous case is discussed. The usual extension is shown to be dimensionally incorrect. Correction introduces a reference density, leading to the concept of Kullback entropy. Practical relativistic considerations suggest a possible proper reference density.

  14. Understanding confounding effects in linguistic coordination: an information-theoretic approach

    CERN Document Server

    Gao, Shuyang; Galstyan, Aram

    2014-01-01

    We suggest an information-theoretic approach for measuring linguistic style coordination in dialogues. The proposed measure has a simple predictive interpretation and can account for various confounding factors through proper conditioning. We revisit some of the previous studies that reported strong sig- natures of stylistic accommodation, and find that a significant part of the observed coordination can be attributed to a simple confounding effect - length coordination. Specifically, longer utterances tend to be followed by longer responses, which gives rise to spurious correlations in the other stylistic features. We propose a test to distinguish correlations in length due to contextual factors (topic of conversation, user verbosity, etc.) and turn-by-turn coordination. We also suggest a test to identify whether stylistic coordination persists even after accounting for length coordination and contextual factors.

  15. An Information-Theoretic Link Between Spacetime Symmetries and Quantum Linearity

    CERN Document Server

    Parwani, R R

    2004-01-01

    A nonlinear generalisation of Schrodinger's equation is obtained using information-theoretic arguments. The nonlinearities are controlled by an intrinsic length scale and involve derivatives to all orders thus making the equation mildly nonlocal. The nonlinear equation is homogeneous, separable, conserves probability, but is not invariant under spacetime symmetries. Spacetime symmetries are recovered when a dimensionless parameter is tuned to vanish, whereby linearity is simultaneously established and the length scale becomes hidden. It is thus suggested that if, in the search for a more basic foundation for Nature's Laws, an inference principle is given precedence over symmetry requirements, then the symmetries of spacetime and the linearity of quantum theory might both be emergent properties that are intrinsically linked. Supporting arguments are provided for this point of view and some testable phenomenological consequences highlighted. The generalised Klien-Gordon and Dirac equations are also studied, lea...

  16. Bounded rationality, abstraction and hierarchical decision-making: an information-theoretic optimality principle

    Directory of Open Access Journals (Sweden)

    Tim eGenewein

    2015-11-01

    Full Text Available Abstraction and hierarchical information-processing are hallmarks of human and animal intelligence underlying the unrivaled flexibility of behavior in biological systems. Achieving such a flexibility in artificial systems is challenging, even with more and more computational power. Here we investigate the hypothesis that abstraction and hierarchical information-processing might in fact be the consequence of limitations in information-processing power. In particular, we study an information-theoretic framework of bounded rational decision-making that trades off utility maximization against information-processing costs. We apply the basic principle of this framework to perception-action systems with multiple information-processing nodes and derive bounded optimal solutions. We show how the formation of abstractions and decision-making hierarchies depends on information-processing costs. We illustrate the theoretical ideas with example simulations and conclude by formalizing a mathematically unifying optimization principle that could potentially be extended to more complex systems.

  17. Information-Theoretic Measures Predict the Human Judgment of Rhythm Complexity.

    Science.gov (United States)

    de Fleurian, Remi; Blackwell, Tim; Ben-Tal, Oded; Müllensiefen, Daniel

    2017-04-01

    To formalize the human judgment of rhythm complexity, we used five measures from information theory and algorithmic complexity to measure the complexity of 48 artificially generated rhythmic sequences. We compared these measurements to human prediction accuracy and easiness judgments obtained from a listening experiment, in which 32 participants guessed the last beat of each sequence. We also investigated the modulating effects of musical expertise and general pattern identification ability. Entropy rate and Kolmogorov complexity were correlated with prediction accuracy, and highly correlated with easiness judgments. A logistic regression showed main effects of musical training, entropy rate, and Kolmogorov complexity, and an interaction between musical training and both entropy rate and Kolmogorov complexity. These results indicate that information-theoretic concepts capture some salient features of the human judgment of rhythm complexity, and they confirm the influence of musical expertise on complexity judgments. Copyright © 2016 Cognitive Science Society, Inc.

  18. Non-Gaussian Information-Theoretical Analytics for Diagnostic and Inference of Hydroclimatic Extremes

    Science.gov (United States)

    Pires, Carlos A. L.; Perdigão, Rui A. P.

    2016-04-01

    Hydroclimatic spatiotemporal distributions exhibit significant non-Gaussianity with particular emphasis to overweight extremes, rendering their diagnostic and inference suboptimal with traditional statistical techniques. In order to overcome that limitation, we introduce and discuss a set of information-theoretic methodologies for statistical diagnostic and inference issued from exploratory variables of the general atmospheric and oceanic circulation in the cases of non-Gaussian joint probability distributions. Moreover, the nonlinear information among various large-scale ocean-atmospheric processes is explored, bringing out added predictability to elusive weather and hydrologic extremes relative to the current state of the art in nonlinear geophysics. The methodologies are illustrated with the analysis and prediction of resonant ocean-atmospheric thermodynamic anomaly spells underneath high-profile floods and droughts.

  19. Information-theoretic analysis of a stimulated-Brillouin-scattering-based slow-light system.

    Science.gov (United States)

    Lee, Myungjun; Zhu, Yunhui; Gauthier, Daniel J; Gehm, Michael E; Neifeld, Mark A

    2011-11-10

    We use an information-theoretic method developed by Neifeld and Lee [J. Opt. Soc. Am. A 25, C31 (2008)] to analyze the performance of a slow-light system. Slow-light is realized in this system via stimulated Brillouin scattering in a 2 km-long, room-temperature, highly nonlinear fiber pumped by a laser whose spectrum is tailored and broadened to 5 GHz. We compute the information throughput (IT), which quantifies the fraction of information transferred from the source to the receiver and the information delay (ID), which quantifies the delay of a data stream at which the information transfer is largest, for a range of experimental parameters. We also measure the eye-opening (EO) and signal-to-noise ratio (SNR) of the transmitted data stream and find that they scale in a similar fashion to the information-theoretic method. Our experimental findings are compared to a model of the slow-light system that accounts for all pertinent noise sources in the system as well as data-pulse distortion due to the filtering effect of the SBS process. The agreement between our observations and the predictions of our model is very good. Furthermore, we compare measurements of the IT for an optimal flattop gain profile and for a Gaussian-shaped gain profile. For a given pump-beam power, we find that the optimal profile gives a 36% larger ID and somewhat higher IT compared to the Gaussian profile. Specifically, the optimal (Gaussian) profile produces a fractional slow-light ID of 0.94 (0.69) and an IT of 0.86 (0.86) at a pump-beam power of 450 mW and a data rate of 2.5 Gbps. Thus, the optimal profile better utilizes the available pump-beam power, which is often a valuable resource in a system design.

  20. A gene transfer agent and a dynamic repertoire of secretion systems hold the keys to the explosive radiation of the emerging pathogen Bartonella.

    Directory of Open Access Journals (Sweden)

    Lionel Guy

    2013-03-01

    Full Text Available Gene transfer agents (GTAs randomly transfer short fragments of a bacterial genome. A novel putative GTA was recently discovered in the mouse-infecting bacterium Bartonella grahamii. Although GTAs are widespread in phylogenetically diverse bacteria, their role in evolution is largely unknown. Here, we present a comparative analysis of 16 Bartonella genomes ranging from 1.4 to 2.6 Mb in size, including six novel genomes from Bartonella isolated from a cow, two moose, two dogs, and a kangaroo. A phylogenetic tree inferred from 428 orthologous core genes indicates that the deadly human pathogen B. bacilliformis is related to the ruminant-adapted clade, rather than being the earliest diverging species in the genus as previously thought. A gene flux analysis identified 12 genes for a GTA and a phage-derived origin of replication as the most conserved innovations. These are located in a region of a few hundred kb that also contains 8 insertions of gene clusters for type III, IV, and V secretion systems, and genes for putatively secreted molecules such as cholera-like toxins. The phylogenies indicate a recent transfer of seven genes in the virB gene cluster for a type IV secretion system from a cat-adapted B. henselae to a dog-adapted B. vinsonii strain. We show that the B. henselae GTA is functional and can transfer genes in vitro. We suggest that the maintenance of the GTA is driven by selection to increase the likelihood of horizontal gene transfer and argue that this process is beneficial at the population level, by facilitating adaptive evolution of the host-adaptation systems and thereby expansion of the host range size. The process counters gene loss and forces all cells to contribute to the production of the GTA and the secreted molecules. The results advance our understanding of the role that GTAs play for the evolution of bacterial genomes.

  1. Information-Theoretic Approach May Shed a Light to a Better Understanding and Sustaining the Integrity of Ecological-Societal Systems under Changing Climate

    Science.gov (United States)

    Kim, J.

    2016-12-01

    Considering high levels of uncertainty, epistemological conflicts over facts and values, and a sense of urgency, normal paradigm-driven science will be insufficient to mobilize people and nation toward sustainability. The conceptual framework to bridge the societal system dynamics with that of natural ecosystems in which humanity operates remains deficient. The key to understanding their coevolution is to understand `self-organization.' Information-theoretic approach may shed a light to provide a potential framework which enables not only to bridge human and nature but also to generate useful knowledge for understanding and sustaining the integrity of ecological-societal systems. How can information theory help understand the interface between ecological systems and social systems? How to delineate self-organizing processes and ensure them to fulfil sustainability? How to evaluate the flow of information from data through models to decision-makers? These are the core questions posed by sustainability science in which visioneering (i.e., the engineering of vision) is an essential framework. Yet, visioneering has neither quantitative measure nor information theoretic framework to work with and teach. This presentation is an attempt to accommodate the framework of self-organizing hierarchical open systems with visioneering into a common information-theoretic framework. A case study is presented with the UN/FAO's communal vision of climate-smart agriculture (CSA) which pursues a trilemma of efficiency, mitigation, and resilience. Challenges of delineating and facilitating self-organizing systems are discussed using transdisciplinary toold such as complex systems thinking, dynamic process network analysis and multi-agent systems modeling. Acknowledgments: This study was supported by the Korea Meteorological Administration Research and Development Program under Grant KMA-2012-0001-A (WISE project).

  2. Dynamic secrets in communication security

    CERN Document Server

    Xiao, Sheng; Towsley, Donald

    2013-01-01

    Dynamic secrets are constantly generated and updated from messages exchanged between two communication users. When dynamic secrets are used as a complement to existing secure communication systems, a stolen key or password can be quickly and automatically reverted to its secret status without disrupting communication. 'Dynamic Secrets in Communication Security' presents unique security properties and application studies for this technology. Password theft and key theft no longer pose serious security threats when parties frequently use dynamic secrets. This book also illustrates that a dynamic

  3. A large scale analysis of information-theoretic network complexity measures using chemical structures.

    Directory of Open Access Journals (Sweden)

    Matthias Dehmer

    Full Text Available This paper aims to investigate information-theoretic network complexity measures which have already been intensely used in mathematical- and medicinal chemistry including drug design. Numerous such measures have been developed so far but many of them lack a meaningful interpretation, e.g., we want to examine which kind of structural information they detect. Therefore, our main contribution is to shed light on the relatedness between some selected information measures for graphs by performing a large scale analysis using chemical networks. Starting from several sets containing real and synthetic chemical structures represented by graphs, we study the relatedness between a classical (partition-based complexity measure called the topological information content of a graph and some others inferred by a different paradigm leading to partition-independent measures. Moreover, we evaluate the uniqueness of network complexity measures numerically. Generally, a high uniqueness is an important and desirable property when designing novel topological descriptors having the potential to be applied to large chemical databases.

  4. An information theoretic approach to select alternate subsets of predictors for data-driven hydrological models

    Science.gov (United States)

    Taormina, R.; Galelli, S.; Karakaya, G.; Ahipasaoglu, S. D.

    2016-11-01

    This work investigates the uncertainty associated to the presence of multiple subsets of predictors yielding data-driven models with the same, or similar, predictive accuracy. To handle this uncertainty effectively, we introduce a novel input variable selection algorithm, called Wrapper for Quasi Equally Informative Subset Selection (W-QEISS), specifically conceived to identify all alternate subsets of predictors in a given dataset. The search process is based on a four-objective optimization problem that minimizes the number of selected predictors, maximizes the predictive accuracy of a data-driven model and optimizes two information theoretic metrics of relevance and redundancy, which guarantee that the selected subsets are highly informative and with little intra-subset similarity. The algorithm is first tested on two synthetic test problems and then demonstrated on a real-world streamflow prediction problem in the Yampa River catchment (US). Results show that complex hydro-meteorological datasets are characterized by a large number of alternate subsets of predictors, which provides useful insights on the underlying physical processes. Furthermore, the presence of multiple subsets of predictors-and associated models-helps find a better trade-off between different measures of predictive accuracy commonly adopted for hydrological modelling problems.

  5. Information-Theoretic Limits on Broadband Multi-Antenna Systems in the Presence of Mutual Coupling

    Science.gov (United States)

    Taluja, Pawandeep Singh

    2011-12-01

    Multiple-input, multiple-output (MIMO) systems have received considerable attention over the last decade due to their ability to provide high throughputs and mitigate multipath fading effects. While most of these benefits are obtained for ideal arrays with large separation between the antennas, practical devices are often constrained in physical dimensions. With smaller inter-element spacings, signal correlation and mutual coupling between the antennas start to degrade the system performance, thereby limiting the deployment of a large number of antennas. Various studies have proposed transceiver designs based on optimal matching networks to compensate for this loss. However, such networks are considered impractical due to their multiport structure and sensitivity to the RF bandwidth of the system. In this dissertation, we investigate two aspects of compact transceiver design. First, we consider simpler architectures that exploit coupling between the antennas, and second, we establish information-theoretic limits of broadband communication systems with closely-spaced antennas. We begin with a receiver model of a diversity antenna selection system and propose novel strategies that make use of inactive elements by virtue of mutual coupling. We then examine the limits on the matching efficiency of a single antenna system using broadband matching theory. Next, we present an extension to this theory for coupled MIMO systems to elucidate the impact of coupling on the RF bandwidth of the system, and derive optimal transceiver designs. Lastly, we summarize the main findings of this dissertation and suggest open problems for future work.

  6. Diagnostic yield of targeted next generation sequencing in various cancer types: an information-theoretic approach.

    Science.gov (United States)

    Hagemann, Ian S; O'Neill, Patrick K; Erill, Ivan; Pfeifer, John D

    2015-09-01

    The information-theoretic concept of Shannon entropy can be used to quantify the information provided by a diagnostic test. We hypothesized that in tumor types with stereotyped mutational profiles, the results of NGS testing would yield lower average information than in tumors with more diverse mutations. To test this hypothesis, we estimated the entropy of NGS testing in various cancer types, using results obtained from clinical sequencing. A set of 238 tumors were subjected to clinical targeted NGS across all exons of 27 genes. There were 120 actionable variants in 109 cases, occurring in the genes KRAS, EGFR, PTEN, PIK3CA, KIT, BRAF, NRAS, IDH1, and JAK2. Sequencing results for each tumor were modeled as a dichotomized genotype (actionable mutation detected or not detected) for each of the 27 genes. Based upon the entropy of these genotypes, sequencing was most informative for colorectal cancer (3.235 bits of information/case) followed by high grade glioma (2.938 bits), lung cancer (2.197 bits), pancreatic cancer (1.339 bits), and sarcoma/STTs (1.289 bits). In the most informative cancer types, the information content of NGS was similar to surgical pathology examination (modeled at approximately 2-3 bits). Entropy provides a novel measure of utility for laboratory testing in general and for NGS in particular. This metric is, however, purely analytical and does not capture the relative clinical significance of the identified variants, which may also differ across tumor types.

  7. Dimensional Information-Theoretic Measurement of Facial Emotion Expressions in Schizophrenia

    Directory of Open Access Journals (Sweden)

    Jihun Hamm

    2014-01-01

    Full Text Available Altered facial expressions of emotions are characteristic impairments in schizophrenia. Ratings of affect have traditionally been limited to clinical rating scales and facial muscle movement analysis, which require extensive training and have limitations based on methodology and ecological validity. To improve reliable assessment of dynamic facial expression changes, we have developed automated measurements of facial emotion expressions based on information-theoretic measures of expressivity of ambiguity and distinctiveness of facial expressions. These measures were examined in matched groups of persons with schizophrenia (n=28 and healthy controls (n=26 who underwent video acquisition to assess expressivity of basic emotions (happiness, sadness, anger, fear, and disgust in evoked conditions. Persons with schizophrenia scored higher on ambiguity, the measure of conditional entropy within the expression of a single emotion, and they scored lower on distinctiveness, the measure of mutual information across expressions of different emotions. The automated measures compared favorably with observer-based ratings. This method can be applied for delineating dynamic emotional expressivity in healthy and clinical populations.

  8. Information theoretical approach to discovering solar wind drivers of the outer radiation belt

    Science.gov (United States)

    Wing, Simon; Johnson, Jay R.; Camporeale, Enrico; Reeves, Geoffrey D.

    2016-10-01

    The solar wind-magnetosphere system is nonlinear. The solar wind drivers of geosynchronous electrons with energy range of 1.8-3.5 MeV are investigated using mutual information, conditional mutual information (CMI), and transfer entropy (TE). These information theoretical tools can establish linear and nonlinear relationships as well as information transfer. The information transfer from solar wind velocity (Vsw) to geosynchronous MeV electron flux (Je) peaks with a lag time of 2 days. As previously reported, Je is anticorrelated with solar wind density (nsw) with a lag of 1 day. However, this lag time and anticorrelation can be attributed at least partly to the Je(t + 2 days) correlation with Vsw(t) and nsw(t + 1 day) anticorrelation with Vsw(t). Analyses of solar wind driving of the magnetosphere need to consider the large lag times, up to 3 days, in the (Vsw, nsw) anticorrelation. Using CMI to remove the effects of Vsw, the response of Je to nsw is 30% smaller and has a lag time Je. Nonstationarity in the system dynamics is investigated using windowed TE. When the data are ordered according to transfer entropy value, it is possible to understand details of the triangle distribution that has been identified between Je(t + 2 days) versus Vsw(t).

  9. Information theoretical approaches to chick-a-dee calls of Carolina chickadees (Poecile carolinensis).

    Science.gov (United States)

    Freeberg, Todd M; Lucas, Jeffrey R

    2012-02-01

    One aim of this study was to apply information theoretical analyses to understanding the structural complexity of chick-a-dee calls of Carolina chickadees, Poecile carolinensis. A second aim of this study was to compare this structural complexity to that of the calls of black-capped chickadees, P. atricapillus, described in an earlier published report (Hailman, Ficken, & Ficken, 1985). Chick-a-dee calls were recorded from Carolina chickadees in a naturalistic observation study in eastern Tennessee. Calls were analyzed using approaches from information theory, including transition probability matrices, Zipf's rules, entropies, and information coding capacities of calls and notes of calls. As described for black-capped chickadees, calls of Carolina chickadees exhibited considerable structural complexity. Most results suggested that the call of Carolina chickadees is more structurally complex than that of black-capped chickadees. These findings add support to the growing literature on the complexity of this call system in Paridae species. Furthermore, these results point to the feasibility of detailed cross-species comparative analyses that may allow strong testing of hypotheses regarding signal evolution.

  10. Information Theoretic Approaches to Rapid Discovery of Relationships in Large Climate Data Sets

    Science.gov (United States)

    Knuth, Kevin H.; Rossow, William B.; Clancy, Daniel (Technical Monitor)

    2002-01-01

    Mutual information as the asymptotic Bayesian measure of independence is an excellent starting point for investigating the existence of possible relationships among climate-relevant variables in large data sets, As mutual information is a nonlinear function of of its arguments, it is not beholden to the assumption of a linear relationship between the variables in question and can reveal features missed in linear correlation analyses. However, as mutual information is symmetric in its arguments, it only has the ability to reveal the probability that two variables are related. it provides no information as to how they are related; specifically, causal interactions or a relation based on a common cause cannot be detected. For this reason we also investigate the utility of a related quantity called the transfer entropy. The transfer entropy can be written as a difference between mutual informations and has the capability to reveal whether and how the variables are causally related. The application of these information theoretic measures is rested on some familiar examples using data from the International Satellite Cloud Climatology Project (ISCCP) to identify relation between global cloud cover and other variables, including equatorial pacific sea surface temperature (SST), over seasonal and El Nino Southern Oscillation (ENSO) cycles.

  11. Scaling properties of information-theoretic quantities in density functional reactivity theory.

    Science.gov (United States)

    Rong, Chunying; Lu, Tian; Ayers, Paul W; Chattaraj, Pratim K; Liu, Shubin

    2015-02-21

    Density functional reactivity theory (DFRT) employs the electron density and its related quantities to describe reactivity properties of a molecular system. Quantities from information theory such as Shannon entropy, Fisher information, and Ghosh-Berkowitz-Parr entropy are natural descriptors within the DFRT framework. They have been previously employed to quantify electrophilicity, nucleophilicity and the steric effect. In this work, we examine their scaling properties with respect to the total number of electrons. To that end, we considered their representations in terms of both the electron density and the shape function for isolated atoms and neutral molecules. We also investigated their atomic behaviors in different molecules with three distinct partitioning schemes: Bader's zero-flux, Becke's fuzzy atom, and Hirshfeld's stockholder partitioning. Strong linear relationships of these quantities as a function of the total electron population are reported for atoms, molecules, and atoms in molecules. These relationships reveal how these information-theoretic quantities depend on the molecular environment and the electron population. These trends also indicate how these quantities can be used to explore chemical reactivity for real chemical processes.

  12. Information theoretic approach using neural network for determining radiometer observations from radar and vice versa

    Science.gov (United States)

    Kannan, Srinivasa Ramanujam; Chandrasekar, V.

    2016-05-01

    Even though both the rain measuring instruments, radar and radiometer onboard the TRMM observe the same rain scenes, they both are fundamentally different instruments. Radar is an active instrument and measures backscatter component from vertical rain structure; whereas radiometer is a passive instrument that obtains integrated observation of full depth of the cloud and rain structure. Further, their spatial resolutions on ground are different. Nevertheless, both the instruments are observing the same rain scene and retrieve three dimensional rainfall products. Hence it is only natural to seek answer to the question, what type of information about radiometric observations can be directly retrieved from radar observations. While there are several ways to answer this question, an informational theoretic approach using neural networks has been described in the present work to find if radiometer observations can be predicted from radar observations. A database of TMI brightness temperature and collocated TRMM vertical attenuation corrected reflectivity factor from the year 2012 was considered. The entire database is further classified according to surface type. Separate neural networks were trained for land and ocean and the results are presented.

  13. Model-free information-theoretic approach to infer leadership in pairs of zebrafish

    Science.gov (United States)

    Butail, Sachit; Mwaffo, Violet; Porfiri, Maurizio

    2016-04-01

    Collective behavior affords several advantages to fish in avoiding predators, foraging, mating, and swimming. Although fish schools have been traditionally considered egalitarian superorganisms, a number of empirical observations suggest the emergence of leadership in gregarious groups. Detecting and classifying leader-follower relationships is central to elucidate the behavioral and physiological causes of leadership and understand its consequences. Here, we demonstrate an information-theoretic approach to infer leadership from positional data of fish swimming. In this framework, we measure social interactions between fish pairs through the mathematical construct of transfer entropy, which quantifies the predictive power of a time series to anticipate another, possibly coupled, time series. We focus on the zebrafish model organism, which is rapidly emerging as a species of choice in preclinical research for its genetic similarity to humans and reduced neurobiological complexity with respect to mammals. To overcome experimental confounds and generate test data sets on which we can thoroughly assess our approach, we adapt and calibrate a data-driven stochastic model of zebrafish motion for the simulation of a coupled dynamical system of zebrafish pairs. In this synthetic data set, the extent and direction of the coupling between the fish are systematically varied across a wide parameter range to demonstrate the accuracy and reliability of transfer entropy in inferring leadership. Our approach is expected to aid in the analysis of collective behavior, providing a data-driven perspective to understand social interactions.

  14. Mobile Sensors in a CDMA System For Environmental Monitoring: An Information-Theoretic Analysis

    CERN Document Server

    Mohammadi, Elaheh

    2011-01-01

    Use of sensors implanted on cell-phones to monitor environmental parameters such as air pollution, temperature, humidity, noise level, etc has been the subject of several studies. For instance, it has been demonstrated in \\cite{SteedMilton} that the use of cheap measurement devices installed on personal cell-phones allows for a fine reconstruction of geographic maps of environmental effects. In some applications one might be interested in certain statistics of the measurements, rather than the whole data. In fact, transmission of the whole data may compromise the privacy of cell-phone users. It is therefore desirable for the cell-phones to transmit just enough information about their measurements such that the desired statistics could be computed. Furthermore because the cell-phones have already the capability to transmit data to the base stations, it is desirable to use the \\emph{same} communication architecture to transmit the sensed data. To the best of our knowledge, information-theoretic limits of data t...

  15. An Information-Theoretic Perspective on Coarse-Graining, Including the Transition from Micro to Macro

    Directory of Open Access Journals (Sweden)

    Kristian Lindgren

    2015-05-01

    Full Text Available An information-theoretic perspective on coarse-graining is presented. It starts with an information characterization of configurations at the micro-level using a local information quantity that has a spatial average equal to a microscopic entropy. With a reversible micro dynamics, this entropy is conserved. In the micro-macro transition, it is shown how this local information quantity is transformed into a macroscopic entropy, as the local states are aggregated into macroscopic concentration variables. The information loss in this transition is identified, and the connection to the irreversibility of the macro dynamics and the second law of thermodynamics is discussed. This is then connected to a process of further coarse-graining towards higher characteristic length scales in the context of chemical reaction-diffusion dynamics capable of pattern formation. On these higher levels of coarse-graining, information flows across length scales and across space are defined. These flows obey a continuity equation for information, and they are connected to the thermodynamic constraints of the system, via an outflow of information from macroscopic to microscopic levels in the form of entropy production, as well as an inflow of information, from an external free energy source, if a spatial chemical pattern is to be maintained.

  16. Parametric sensitivity analysis for stochastic molecular systems using information theoretic metrics

    Energy Technology Data Exchange (ETDEWEB)

    Tsourtis, Anastasios, E-mail: tsourtis@uoc.gr [Department of Mathematics and Applied Mathematics, University of Crete, Crete (Greece); Pantazis, Yannis, E-mail: pantazis@math.umass.edu; Katsoulakis, Markos A., E-mail: markos@math.umass.edu [Department of Mathematics and Statistics, University of Massachusetts, Amherst, Massachusetts 01003 (United States); Harmandaris, Vagelis, E-mail: harman@uoc.gr [Department of Mathematics and Applied Mathematics, University of Crete, and Institute of Applied and Computational Mathematics (IACM), Foundation for Research and Technology Hellas (FORTH), GR-70013 Heraklion, Crete (Greece)

    2015-07-07

    In this paper, we present a parametric sensitivity analysis (SA) methodology for continuous time and continuous space Markov processes represented by stochastic differential equations. Particularly, we focus on stochastic molecular dynamics as described by the Langevin equation. The utilized SA method is based on the computation of the information-theoretic (and thermodynamic) quantity of relative entropy rate (RER) and the associated Fisher information matrix (FIM) between path distributions, and it is an extension of the work proposed by Y. Pantazis and M. A. Katsoulakis [J. Chem. Phys. 138, 054115 (2013)]. A major advantage of the pathwise SA method is that both RER and pathwise FIM depend only on averages of the force field; therefore, they are tractable and computable as ergodic averages from a single run of the molecular dynamics simulation both in equilibrium and in non-equilibrium steady state regimes. We validate the performance of the extended SA method to two different molecular stochastic systems, a standard Lennard-Jones fluid and an all-atom methane liquid, and compare the obtained parameter sensitivities with parameter sensitivities on three popular and well-studied observable functions, namely, the radial distribution function, the mean squared displacement, and the pressure. Results show that the RER-based sensitivities are highly correlated with the observable-based sensitivities.

  17. Underwriting information-theoretic accounts of quantum mechanics with a realist, psi-epistemic model

    Science.gov (United States)

    Stuckey, W. M.; Silberstein, Michael; McDevitt, Timothy

    2016-05-01

    We propose an adynamical interpretation of quantum theory called Relational Blockworld (RBW) where the fundamental ontological element is a 4D graphical amalgam of space, time and sources called a “spacetimesource element.” These are fundamental elements of space, time and sources, not source elements in space and time. The transition amplitude for a spacetimesource element is computed using a path integral with discrete graphical action. The action for a spacetimesource element is constructed from a difference matrix K and source vector J on the graph, as in lattice gauge theory. K is constructed from graphical field gradients so that it contains a non-trivial null space and J is then restricted to the row space of K, so that it is divergence-free and represents a conserved exchange of energy-momentum. This construct of K and J represents an adynamical global constraint between sources, the spacetime metric and the energy-momentum content of the spacetimesource element, rather than a dynamical law for time-evolved entities. To illustrate this interpretation, we explain the simple EPR-Bell and twin-slit experiments. This interpretation of quantum mechanics constitutes a realist, psi-epistemic model that might underwrite certain information-theoretic accounts of the quantum.

  18. Information-Theoretic Properties of the Half-Line Coulomb Potential

    CERN Document Server

    Omiste, J J; Dehesa, J S

    2009-01-01

    The half-line one-dimensional Coulomb potential is possibly the simplest D-dimensional model with physical solutions which has been proved to be successful to describe the behaviour of Rydberg atoms in external fields and the dynamics of surface-state electrons in liquid helium, with potential applications in constructing analog quantum computers and other fields. Here, we investigate the spreading and uncertaintylike properties for the ground and excited states of this system by means of the logarithmic measure and the information-theoretic lengths of Renyi, Shannon and Fisher types; so, far beyond the Heisenberg measure. In particular, the Fisher length (which is a local quantity of internal disorder) is shown to be the proper measure of uncertainty for our system in both position and momentum spaces. Moreover the position Fisher length of a given physical state turns out to be not only directly proportional to the number of nodes of its associated wavefunction, but also it follows a square-root energy law.

  19. A Novel Information-Theoretic Approach for Variable Clustering and Predictive Modeling Using Dirichlet Process Mixtures

    Science.gov (United States)

    Chen, Yun; Yang, Hui

    2016-12-01

    In the era of big data, there are increasing interests on clustering variables for the minimization of data redundancy and the maximization of variable relevancy. Existing clustering methods, however, depend on nontrivial assumptions about the data structure. Note that nonlinear interdependence among variables poses significant challenges on the traditional framework of predictive modeling. In the present work, we reformulate the problem of variable clustering from an information theoretic perspective that does not require the assumption of data structure for the identification of nonlinear interdependence among variables. Specifically, we propose the use of mutual information to characterize and measure nonlinear correlation structures among variables. Further, we develop Dirichlet process (DP) models to cluster variables based on the mutual-information measures among variables. Finally, orthonormalized variables in each cluster are integrated with group elastic-net model to improve the performance of predictive modeling. Both simulation and real-world case studies showed that the proposed methodology not only effectively reveals the nonlinear interdependence structures among variables but also outperforms traditional variable clustering algorithms such as hierarchical clustering.

  20. An information theoretic approach to use high-fidelity codes to calibrate low-fidelity codes

    Energy Technology Data Exchange (ETDEWEB)

    Lewis, Allison, E-mail: lewis.allison10@gmail.com [Department of Mathematics, North Carolina State University, Raleigh, NC 27695 (United States); Smith, Ralph [Department of Mathematics, North Carolina State University, Raleigh, NC 27695 (United States); Williams, Brian [Los Alamos National Laboratory, Los Alamos, NM 87545 (United States); Figueroa, Victor [Sandia National Laboratories, Albuquerque, NM 87185 (United States)

    2016-11-01

    For many simulation models, it can be prohibitively expensive or physically infeasible to obtain a complete set of experimental data to calibrate model parameters. In such cases, one can alternatively employ validated higher-fidelity codes to generate simulated data, which can be used to calibrate the lower-fidelity code. In this paper, we employ an information-theoretic framework to determine the reduction in parameter uncertainty that is obtained by evaluating the high-fidelity code at a specific set of design conditions. These conditions are chosen sequentially, based on the amount of information that they contribute to the low-fidelity model parameters. The goal is to employ Bayesian experimental design techniques to minimize the number of high-fidelity code evaluations required to accurately calibrate the low-fidelity model. We illustrate the performance of this framework using heat and diffusion examples, a 1-D kinetic neutron diffusion equation, and a particle transport model, and include initial results from the integration of the high-fidelity thermal-hydraulics code Hydra-TH with a low-fidelity exponential model for the friction correlation factor.

  1. A Novel Information-Theoretic Approach for Variable Clustering and Predictive Modeling Using Dirichlet Process Mixtures.

    Science.gov (United States)

    Chen, Yun; Yang, Hui

    2016-12-14

    In the era of big data, there are increasing interests on clustering variables for the minimization of data redundancy and the maximization of variable relevancy. Existing clustering methods, however, depend on nontrivial assumptions about the data structure. Note that nonlinear interdependence among variables poses significant challenges on the traditional framework of predictive modeling. In the present work, we reformulate the problem of variable clustering from an information theoretic perspective that does not require the assumption of data structure for the identification of nonlinear interdependence among variables. Specifically, we propose the use of mutual information to characterize and measure nonlinear correlation structures among variables. Further, we develop Dirichlet process (DP) models to cluster variables based on the mutual-information measures among variables. Finally, orthonormalized variables in each cluster are integrated with group elastic-net model to improve the performance of predictive modeling. Both simulation and real-world case studies showed that the proposed methodology not only effectively reveals the nonlinear interdependence structures among variables but also outperforms traditional variable clustering algorithms such as hierarchical clustering.

  2. A quantum-information theoretic analysis of three-flavor neutrino oscillations. Quantum entanglement, nonlocal and nonclassical features of neutrinos

    Science.gov (United States)

    Banerjee, Subhashish; Alok, Ashutosh Kumar; Srikanth, R.; Hiesmayr, Beatrix C.

    2015-10-01

    Correlations exhibited by neutrino oscillations are studied via quantum-information theoretic quantities. We show that the strongest type of entanglement, genuine multipartite entanglement, is persistent in the flavor changing states. We prove the existence of Bell-type nonlocal features, in both its absolute and genuine avatars. Finally, we show that a measure of nonclassicality, dissension, which is a generalization of quantum discord to the tripartite case, is nonzero for almost the entire range of time in the evolution of an initial electron-neutrino. Via these quantum-information theoretic quantities, capturing different aspects of quantum correlations, we elucidate the differences between the flavor types, shedding light on the quantum-information theoretic aspects of the weak force.

  3. A quantum-information theoretic analysis of three-flavor neutrino oscillations. Quantum entanglement, nonlocal and nonclassical features of neutrinos

    Energy Technology Data Exchange (ETDEWEB)

    Banerjee, Subhashish; Alok, Ashutosh Kumar [Indian Institute of Technology Jodhpur, Jodhpur (India); Srikanth, R. [Poornaprajna Institute of Scientific Research, Banglore (India); Hiesmayr, Beatrix C. [University of Vienna, Vienna (Austria)

    2015-10-15

    Correlations exhibited by neutrino oscillations are studied via quantum-information theoretic quantities. We show that the strongest type of entanglement, genuine multipartite entanglement, is persistent in the flavor changing states. We prove the existence of Bell-type nonlocal features, in both its absolute and genuine avatars. Finally, we show that a measure of nonclassicality, dissension, which is a generalization of quantum discord to the tripartite case, is nonzero for almost the entire range of time in the evolution of an initial electron-neutrino. Via these quantum-information theoretic quantities, capturing different aspects of quantum correlations, we elucidate the differences between the flavor types, shedding light on the quantum-information theoretic aspects of the weak force. (orig.)

  4. An information-theoretic approach to assess practical identifiability of parametric dynamical systems.

    Science.gov (United States)

    Pant, Sanjay; Lombardi, Damiano

    2015-10-01

    A new approach for assessing parameter identifiability of dynamical systems in a Bayesian setting is presented. The concept of Shannon entropy is employed to measure the inherent uncertainty in the parameters. The expected reduction in this uncertainty is seen as the amount of information one expects to gain about the parameters due to the availability of noisy measurements of the dynamical system. Such expected information gain is interpreted in terms of the variance of a hypothetical measurement device that can measure the parameters directly, and is related to practical identifiability of the parameters. If the individual parameters are unidentifiable, correlation between parameter combinations is assessed through conditional mutual information to determine which sets of parameters can be identified together. The information theoretic quantities of entropy and information are evaluated numerically through a combination of Monte Carlo and k-nearest neighbour methods in a non-parametric fashion. Unlike many methods to evaluate identifiability proposed in the literature, the proposed approach takes the measurement-noise into account and is not restricted to any particular noise-structure. Whilst computationally intensive for large dynamical systems, it is easily parallelisable and is non-intrusive as it does not necessitate re-writing of the numerical solvers of the dynamical system. The application of such an approach is presented for a variety of dynamical systems--ranging from systems governed by ordinary differential equations to partial differential equations--and, where possible, validated against results previously published in the literature. Copyright © 2015 Elsevier Inc. All rights reserved.

  5. An information theoretic approach for non-rigid image registration using voxel class probabilities.

    Science.gov (United States)

    D'Agostino, Emiliano; Maes, Frederik; Vandermeulen, Dirk; Suetens, Paul

    2006-06-01

    We propose two information theoretic similarity measures that allow to incorporate tissue class information in non-rigid image registration. The first measure assumes that tissue class probabilities have been assigned to each of the images to be registered by prior segmentation of both of them. One image is then non-rigidly deformed to match the other such that the fuzzy overlap of corresponding voxel object labels becomes similar to the ideal case whereby the tissue probability maps of both images are identical. Image similarity is assessed during registration by the divergence between the ideal and actual joint class probability distributions of both images. A second registration measure is proposed that applies in case a segmentation is available for only one of the images, for instance an atlas image that is to be matched to a study image to guide the segmentation thereof. Intensities in one image are matched to the fuzzy class labels in the other image by minimizing the conditional entropy of the intensities in the first image given the class labels in the second image. We derive analytic expressions for the gradient of each measure with respect to individual voxel displacements to derive a force field that drives the registration process, which is regularized by a viscous fluid model. The performance of the class-based measures is evaluated in the context of non-rigid inter-subject registration and atlas-based segmentation of MR brain images and compared with maximization of mutual information using only intensity information. Our results demonstrate that incorporation of class information in the registration measure significantly improves the overlap between corresponding tissue classes after non-rigid matching. The methods proposed here open new perspectives for integrating segmentation and registration in a single process, whereby the output of one is used to guide the other.

  6. Implement of Product Secret Key Two-Dimensional Code Based on Unity 3D%基于Unity 3D的产品秘钥二维码实现

    Institute of Scientific and Technical Information of China (English)

    倪莹莹; 王晓峰; 丁小未

    2016-01-01

    With the development of computer technology and the rapid rise of the mobile Internet, two-dimensional code, as an automatic identifica-tion technology, is widely applied in various fields. For many software products with their own activate the secret key to maintain the copyright, puts forward to use Unity 3D to perform the client implementation, explores a new method two-dimensional code to realize the activation of the secret key. The experimental results show that, compared with the traditional activation methods, two-dimensional code is more convenient and quick, to some extent, it is of certain practical value.%随着计算机技术的发展以及移动互联网的迅速崛起,二维码作为自动识别技术广泛应用于各个领域。针对不少软件产品通过激活秘钥维护版权的问题,提出利用Unity 3D作为客户端,探索用二维码作为激活秘钥激活产品的新方法。实验结果表明,与传统激活方式相比,二维码作为激活秘钥更方便快捷,具有一定的实用价值。

  7. Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks

    DEFF Research Database (Denmark)

    Fehr, Serge; Maurer, Ueli M.

    2002-01-01

    We present a general treatment of all non-cryptographic (i.e., information-theoretically secure) linear veriable-secret-sharing (VSS) and distributed-commitment (DC) schemes, based on an underlying secret sharing scheme, pairwise checks between players, complaints, and accusations of the dealer. ...

  8. Modification of the secretion pattern of proteases, inflammatory mediators, and extracellular matrix proteins by human aortic valve is key in severe aortic stenosis.

    Science.gov (United States)

    Alvarez-Llamas, Gloria; Martín-Rojas, Tatiana; de la Cuesta, Fernando; Calvo, Enrique; Gil-Dones, Felix; Dardé, Veronica M; Lopez-Almodovar, Luis F; Padial, Luis R; Lopez, Juan-Antonio; Vivanco, Fernando; Barderas, Maria G

    2013-09-01

    One of the major challenges in cardiovascular medicine is to identify candidate biomarker proteins. Secretome analysis is particularly relevant in this search as it focuses on a subset of proteins released by a cell or tissue under certain conditions. The sample can be considered as a plasma subproteome and it provides a more direct approximation to the in vivo situation. Degenerative aortic stenosis is the most common worldwide cause of valve replacement. Using a proteomic analysis of the secretome from aortic stenosis valves we could identify candidate markers related to this pathology, which may facilitate early diagnosis and treatment. For this purpose, we have designed a method to validate the origin of secreted proteins, demonstrating their synthesis and release by the tissue and ruling out blood origin. The nLC-MS/MS analysis showed the labeling of 61 proteins, 82% of which incorporated the label in only one group. Western blot and selective reaction monitoring differential analysis, revealed a notable role of the extracellular matrix. Variation in particular proteins such as PEDF, cystatin and clusterin emphasizes the link between aortic stenosis and atherosclerosis. In particular, certain proteins variation in secretome levels correlates well, not only with label incorporation trend (only labeled in aortic stenosis group) but, more importantly, with alterations found in plasma from an independent cohort of samples, pointing to specific candidate markers to follow up in diagnosis, prognosis, and therapeutic intervention.

  9. An algorithmic and information-theoretic approach to multimetric index construction

    Science.gov (United States)

    Schoolmaster, Donald R.; Grace, James B.; Schweiger, E. William; Guntenspergen, Glenn R.; Mitchell, Brian R.; Miller, Kathryn M.; Little, Amanda M.

    2013-01-01

    The use of multimetric indices (MMIs), such as the widely used index of biological integrity (IBI), to measure, track, summarize and infer the overall impact of human disturbance on biological communities has been steadily growing in recent years. Initially, MMIs were developed for aquatic communities using pre-selected biological metrics as indicators of system integrity. As interest in these bioassessment tools has grown, so have the types of biological systems to which they are applied. For many ecosystem types the appropriate biological metrics to use as measures of biological integrity are not known a priori. As a result, a variety of ad hoc protocols for selecting metrics empirically has developed. However, the assumptions made by proposed protocols have not be explicitly described or justified, causing many investigators to call for a clear, repeatable methodology for developing empirically derived metrics and indices that can be applied to any biological system. An issue of particular importance that has not been sufficiently addressed is the way that individual metrics combine to produce an MMI that is a sensitive composite indicator of human disturbance. In this paper, we present and demonstrate an algorithm for constructing MMIs given a set of candidate metrics and a measure of human disturbance. The algorithm uses each metric to inform a candidate MMI, and then uses information-theoretic principles to select MMIs that capture the information in the multidimensional system response from among possible MMIs. Such an approach can be used to create purely empirical (data-based) MMIs or can, optionally, be influenced by expert opinion or biological theory through the use of a weighting vector to create value-weighted MMIs. We demonstrate the algorithm with simulated data to demonstrate the predictive capacity of the final MMIs and with real data from wetlands from Acadia and Rocky Mountain National Parks. For the Acadia wetland data, the algorithm identified

  10. Circular threshold quantum secret sharing

    Institute of Scientific and Technical Information of China (English)

    Yang Yu-Guang; Wen Qiao-Yan

    2008-01-01

    This paper proposes a circular threshold quantum secret sharing (TQSS) scheme with polarized single photons.A polarized single photon sequence runs circularly among any t or more of n parties and any t or more of n parties can reconstruct the secret key when they collaborate.It shows that entanglement is not necessary for quantum secret sharing.Moreover,the theoretic efficiency is improved to approach 100% as the single photons carrying the secret key are deterministically forwarded among any t or more of n parties,and each photon can carry one bit of information without quantum storage.This protocol is feasible with current technology.

  11. Secrets Law

    Directory of Open Access Journals (Sweden)

    Luz Helena Guamanzara Torres

    2013-01-01

    Full Text Available This paper provides a review of the book The Law of Secrets, of the author Juan Carlos Martínez-Villalba Riofrío studying the secrets and how law does protect. To this end, the author has analyzed the general theory of secrecy, secrets and methodology, its overall rating, essential elements and their different legal dimensions, the secret as a subjective right. It also establishes that professional secrecy is protected by constitutional principles such as the right to privacy.

  12. Proof-of-principle field test of quantum key distribution immune to detector attacks

    CERN Document Server

    Rubenok, A; Chan, P; Lucio-Martinez, I; Tittel, W

    2012-01-01

    Quantum key distribution (QKD) promises the distribution of cryptographic keys whose secrecy is guaranteed by fundamental laws of quantum physics. After more than two decades devoted to the improvement of theoretical understanding and experimental realization, recent results in quantum hacking have reminded us that the information theoretic security of QKD protocols does not necessarily imply the same level of security for actual implementations. Of particular concern are attacks that exploit vulnerabilities of single photon detectors. Here we report the first proof-of-principle demonstration of a QKD protocol that removes the threat of any such attack. Our fiber-based implementation took advantage of three different locations within the city of Calgary. Its simplicity and robustness to environment-induced property variations of deployed optical fibers, along with the enhanced level of security offered by the protocol, confirms QKD as a viable technology for safeguarding secrets in transmission.

  13. Contrast properties of entropic criteria for blind source separation : a unifying framework based on information-theoretic inequalities/

    OpenAIRE

    Vrins, Frédéric

    2007-01-01

    In the recent years, Independent Component Analysis (ICA) has become a fundamental tool in adaptive signal and data processing, especially in the field of Blind Source Separation (BSS). Even though there exist some methods for which an algebraic solution to the ICA problem may be found, other iterative methods are very popular. Among them is the class of information-theoretic approaches, laying on entropies. The associated objective functions are maximized based on optimization schemes, and o...

  14. A criterion based on an information theoretic measure for goodness of fit between classifier and data base

    Science.gov (United States)

    Eigen, D. J.; Davida, G. I.; Northouse, R. A.

    1973-01-01

    A criterion for characterizing an iteratively trained classifier is presented. The criterion is based on an information theoretic measure that is developed from modeling classifier training iterations as a set of cascaded channels. The criterion is formulated as a figure of merit and as a performance index to check the appropriateness of application of the characterized classifier to an unknown data base and for implementing classifier updates and data selection respectively.

  15. A criterion based on an information theoretic measure for goodness of fit between classifier and data base. [in pattern recognition

    Science.gov (United States)

    Eigen, D. J.; Davida, G. I.; Northouse, R. A.

    1974-01-01

    A criterion for characterizing an iteratively trained classifier is presented. The criterion is based on an information theoretic measure that is developed from modeling classifier training iterations as a set of cascaded channels. The criterion is formulated as a figure of merit and as a performance index to check the appropriateness of application of the characterized classifier to an unknown data base and for implementing classifier updates and data selection, respectively.

  16. Quantum dense key distribution

    CERN Document Server

    Degiovanni, I P; Castelletto, S; Rastello, M L; Bovino, F A; Colla, A M; Castagnoli, G C

    2004-01-01

    This paper proposes a new protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than BB84 one. We hereinafter prove the security of this scheme against individual eavesdropping attacks, and we present preliminary experimental results, showing its feasibility.

  17. DYNAMIC AND VERIFIABLE SECRET SHARING AMONG WEIGHTED PARTICIPANTS

    Institute of Scientific and Technical Information of China (English)

    Yanshuo ZHANG; Zhuojun LIU

    2007-01-01

    A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret. Secret sharing is useful in management of cryptographic keys. Based on identity, we analyze the secret sharing scheme among weighted participants. Then we present a dynamic scheme about secret sharing among weighted participants. At last, we analyze the secret sharing scheme among weighted participants, which can make all weighted participants verifiable and dynamic.

  18. A fully covariant information-theoretic ultraviolet cutoff? for scalar ?fields in expanding FRW spacetimes

    CERN Document Server

    Kempf, Achim; Chatwin-Davies, Aidan

    2012-01-01

    While a natural ultraviolet cutoff, presumably at the Planck length, is widely assumed to exist in nature, it has proven difficult to implement a minimum length scale covariantly. A key reason is that the presence of a fixed minimum length would seem to contradict the ability of Lorentz transformations to contract lengths. In this paper, we implement a fully covariant Planck scale cutoff by cutting off the spectrum of the d'Alembertian. In this scenario, consistent with Lorentz contractions, wavelengths that are arbitrarily smaller than the Planck length continue to exist. However, the dynamics of modes of wavelengths that are significantly smaller than the Planck length possess a very small bandwidth. This has the effect of freezing the dynamics of such modes. While both, wavelengths and bandwidths, are frame dependent, Lorentz contraction and time dilation conspire to make the freezing of modes of transplanckian wavelengths covariant. In particular, we show that this ultraviolet cutoff can be implemented co...

  19. Aromaticity and antiaromaticity of substituted fulvene derivatives: perspectives from the information-theoretic approach in density functional reactivity theory.

    Science.gov (United States)

    Yu, Donghai; Rong, Chunying; Lu, Tian; Chattaraj, Pratim K; De Proft, Frank; Liu, Shubin

    2017-07-19

    Even though the concept of aromaticity and antiaromaticity is extremely important and widely used, there still exist lots of controversies in the literature, which are believed to be originated from the fact that there are so many aromatic types discovered and at the same time there are many aromaticity indexes proposed. In this work, using seven series of substituted fulvene derivatives as an example and with the information-theoretic approach in density functional reactivity theory, we examine these concepts from a different perspective. We investigate the changing patterns of Shannon entropy, Fisher information, Ghosh-Berkowitz-Parr entropy, information gain, Onicescu information energy, and relative Renyi entropy on the ring carbon atoms of these systems. Meanwhile, we also consider variation trends of four representative kinds of aromaticity indexes such as FLU, HOMA, ASE and NICS. Statistical analyses among these quantities show that with the same ring structure of the derivatives, both information-theoretic quantities and aromaticity indexes obey the same changing pattern, which are valid across all seven systems studied. However, cross correlations between these two sets of quantities yield two completely opposite patterns. These ring-structure dependent correlations are in good agreement with Hückel's 4n + 2 rule of aromaticity and 4n rule of antiaromaticity. Our results should provide a novel and complementary viewpoint on how aromaticity and antiaromaticity should be appreciated and categorized. More studies are in progress to further our understanding about the matter.

  20. The Approach Towards Equilibrium in a Reversible Ising Dynamics Model: An Information-Theoretic Analysis Based on an Exact Solution

    Science.gov (United States)

    Lindgren, Kristian; Olbrich, Eckehard

    2017-08-01

    We study the approach towards equilibrium in a dynamic Ising model, the Q2R cellular automaton, with microscopic reversibility and conserved energy for an infinite one-dimensional system. Starting from a low-entropy state with positive magnetisation, we investigate how the system approaches equilibrium characteristics given by statistical mechanics. We show that the magnetisation converges to zero exponentially. The reversibility of the dynamics implies that the entropy density of the microstates is conserved in the time evolution. Still, it appears as if equilibrium, with a higher entropy density is approached. In order to understand this process, we solve the dynamics by formally proving how the information-theoretic characteristics of the microstates develop over time. With this approach we can show that an estimate of the entropy density based on finite length statistics within microstates converges to the equilibrium entropy density. The process behind this apparent entropy increase is a dissipation of correlation information over increasing distances. It is shown that the average information-theoretic correlation length increases linearly in time, being equivalent to a corresponding increase in excess entropy.

  1. Information-theoretic indices and an approximate significance test for testing the molecular clock hypothesis with genetic distances.

    Science.gov (United States)

    Xia, Xuhua

    2009-09-01

    Distance-based phylogenetic methods are widely used in biomedical research. However, distance-based dating of speciation events and the test of the molecular clock hypothesis are relatively underdeveloped. Here I develop an approximate test of the molecular clock hypothesis for distance-based trees, as well as information-theoretic indices that have been used frequently in model selection, for use with distance matrices. The results are in good agreement with the conventional sequence-based likelihood ratio test. Among the information-theoretic indices, AICu is the most consistent with the sequence-based likelihood ratio test. The confidence in model selection by the indices can be evaluated by bootstrapping. I illustrate the usage of the indices and the approximate significance test with both empirical and simulated sequences. The tests show that distance matrices from protein gel electrophoresis and from genome rearrangement events do not violate the molecular clock hypothesis, and that the evolution of the third codon position conforms to the molecular clock hypothesis better than the second codon position in vertebrate mitochondrial genes. I outlined evolutionary distances that are appropriate for phylogenetic reconstruction and dating.

  2. A quantum symmetric key cipher(Y-00) and key generation (Quantum stream cipher-Part II)

    CERN Document Server

    Hirota, O; Sohma, M; Fuse, M; Hirota, Osamu; Kato, Kentaro; Sohma, Masaki; Fuse, Masaru

    2004-01-01

    What obstructs the realization of useful quantum cryptography is single photon scheme, or entanglement which is not applicable to the current infrastructure of optical communication network. We are concerned with the following question: Can we realize the information theoretically secure symmetric key cipher under "the finite secret key" based on quantum-optical communications? A role of quantum information theory is to give an answer for such a question. As an answer for the question, a new quantum cryptography was proposed by H.P.Yuen, which can realize a secure symmetric key cipher with high speeds(Gbps) and for long distance(1000 Km). Although some researchers claim that Yuen protocol(Y-00) is equivalent to the classical cryptography, they are all mistaken. Indeed it has no classical analogue, and also provides a generalization even in the conventional cryptography. At present, it is proved that a basic model of Y-00 has at least the security such as $H(X|Y_E)=H(K|Y_E)=H(K)$, $H(K|Y_E,X)\\sim 0$ under the ...

  3. Computational Study of Chemical Reactivity Using Information-Theoretic Quantities from Density Functional Reactivity Theory for Electrophilic Aromatic Substitution Reactions.

    Science.gov (United States)

    Wu, Wenjie; Wu, Zemin; Rong, Chunying; Lu, Tian; Huang, Ying; Liu, Shubin

    2015-07-23

    The electrophilic aromatic substitution for nitration, halogenation, sulfonation, and acylation is a vastly important category of chemical transformation. Its reactivity and regioselectivity is predominantly determined by nucleophilicity of carbon atoms on the aromatic ring, which in return is immensely influenced by the group that is attached to the aromatic ring a priori. In this work, taking advantage of recent developments in quantifying nucleophilicity (electrophilicity) with descriptors from the information-theoretic approach in density functional reactivity theory, we examine the reactivity properties of this reaction system from three perspectives. These include scaling patterns of information-theoretic quantities such as Shannon entropy, Fisher information, Ghosh-Berkowitz-Parr entropy and information gain at both molecular and atomic levels, quantitative predictions of the barrier height with both Hirshfeld charge and information gain, and energetic decomposition analyses of the barrier height for the reactions. To that end, we focused in this work on the identity reaction of the monosubstituted-benzene molecule reacting with hydrogen fluoride using boron trifluoride as the catalyst in the gas phase. We also considered 19 substituting groups, 9 of which are ortho/para directing and the other 9 meta directing, besides the case of R = -H. Similar scaling patterns for these information-theoretic quantities found for stable species elsewhere were disclosed for these reactions systems. We also unveiled novel scaling patterns for information gain at the atomic level. The barrier height of the reactions can reliably be predicted by using both the Hirshfeld charge and information gain at the regioselective carbon atom. The energy decomposition analysis ensued yields an unambiguous picture about the origin of the barrier height, where we showed that it is the electrostatic interaction that plays the dominant role, while the roles played by exchange-correlation and

  4. Locating Sensors for Detecting Source-to-Target Patterns of Special Nuclear Material Smuggling: A Spatial Information Theoretic Approach

    Directory of Open Access Journals (Sweden)

    Xuesong Zhou

    2010-08-01

    Full Text Available In this paper, a spatial information-theoretic model is proposed to locate sensors for detecting source-to-target patterns of special nuclear material (SNM smuggling. In order to ship the nuclear materials from a source location with SNM production to a target city, the smugglers must employ global and domestic logistics systems. This paper focuses on locating a limited set of fixed and mobile radiation sensors in a transportation network, with the intent to maximize the expected information gain and minimize the estimation error for the subsequent nuclear material detection stage. A Kalman filtering-based framework is adapted to assist the decision-maker in quantifying the network-wide information gain and SNM flow estimation accuracy.

  5. Locating sensors for detecting source-to-target patterns of special nuclear material smuggling: a spatial information theoretic approach.

    Science.gov (United States)

    Przybyla, Jay; Taylor, Jeffrey; Zhou, Xuesong

    2010-01-01

    In this paper, a spatial information-theoretic model is proposed to locate sensors for detecting source-to-target patterns of special nuclear material (SNM) smuggling. In order to ship the nuclear materials from a source location with SNM production to a target city, the smugglers must employ global and domestic logistics systems. This paper focuses on locating a limited set of fixed and mobile radiation sensors in a transportation network, with the intent to maximize the expected information gain and minimize the estimation error for the subsequent nuclear material detection stage. A Kalman filtering-based framework is adapted to assist the decision-maker in quantifying the network-wide information gain and SNM flow estimation accuracy.

  6. Study on the security of the authentication scheme with key recycling in QKD

    Science.gov (United States)

    Li, Qiong; Zhao, Qiang; Le, Dan; Niu, Xiamu

    2016-09-01

    In quantum key distribution (QKD), the information theoretically secure authentication is necessary to guarantee the integrity and authenticity of the exchanged information over the classical channel. In order to reduce the key consumption, the authentication scheme with key recycling (KR), in which a secret but fixed hash function is used for multiple messages while each tag is encrypted with a one-time pad (OTP), is preferred in QKD. Based on the assumption that the OTP key is perfect, the security of the authentication scheme has be proved. However, the OTP key of authentication in a practical QKD system is not perfect. How the imperfect OTP affects the security of authentication scheme with KR is analyzed thoroughly in this paper. In a practical QKD, the information of the OTP key resulting from QKD is partially leaked to the adversary. Although the information leakage is usually so little to be neglected, it will lead to the increasing degraded security of the authentication scheme as the system runs continuously. Both our theoretical analysis and simulation results demonstrate that the security level of authentication scheme with KR, mainly indicated by its substitution probability, degrades exponentially in the number of rounds and gradually diminishes to zero.

  7. Information theoretic preattentive saliency

    DEFF Research Database (Denmark)

    Loog, Marco

    2011-01-01

    -driven density estimation. Given the features descriptors or filter bank that one wants to use to describe the image content at every position we provide a closed-form expression for the associated saliency at that location. This indeed makes explicit that what is considered salient depends on how i.e. by means...... of which features, image information is described. We illustrate our result by determining a few specific saliency maps based on particular choices of features. One of them makes the link with the mapping underlying well-known Harris interest points, which is a result recently obtained in isolation...

  8. Quantum key management

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, Richard John; Thrasher, James Thomas; Nordholt, Jane Elizabeth

    2016-11-29

    Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.

  9. Quantum key management

    Science.gov (United States)

    Hughes, Richard John; Thrasher, James Thomas; Nordholt, Jane Elizabeth

    2016-11-29

    Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.

  10. Google Secrets

    CERN Document Server

    Davis, Yvette

    2011-01-01

    Become a Google guru with these effective tips, tricks, and techniques Sure, you use Google. But do you really use Google-and everything it has to offer-in the most effective way possible? Wish you could just sit down with a Google expert who would show you how to take your Google savviness to the next level? With Google Secrets, you can! Tech expert Jerri Ledford reveals the ins, outs, and little-known facts about Google to show you how to sharpen your skills so you can get more done, more efficiently. You may already be familiar with Google's most popular applications, but this indispensable

  11. GOSim – an R-package for computation of information theoretic GO similarities between terms and gene products

    Directory of Open Access Journals (Sweden)

    Poustka Annemarie

    2007-05-01

    Full Text Available Abstract Background With the increased availability of high throughput data, such as DNA microarray data, researchers are capable of producing large amounts of biological data. During the analysis of such data often there is the need to further explore the similarity of genes not only with respect to their expression, but also with respect to their functional annotation which can be obtained from Gene Ontology (GO. Results We present the freely available software package GOSim, which allows to calculate the functional similarity of genes based on various information theoretic similarity concepts for GO terms. GOSim extends existing tools by providing additional lately developed functional similarity measures for genes. These can e.g. be used to cluster genes according to their biological function. Vice versa, they can also be used to evaluate the homogeneity of a given grouping of genes with respect to their GO annotation. GOSim hence provides the researcher with a flexible and powerful tool to combine knowledge stored in GO with experimental data. It can be seen as complementary to other tools that, for instance, search for significantly overrepresented GO terms within a given group of genes. Conclusion GOSim is implemented as a package for the statistical computing environment R and is distributed under GPL within the CRAN project.

  12. A quantum-information-theoretic complement to a general-relativistic implementation of a beyond-Turing computer

    CERN Document Server

    Wuthrich, Christian

    2014-01-01

    There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable (even in principle) can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, Istv\\'an N\\'emeti and Gyula D\\'avid (2006) have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this essay, I will honour Istv\\'an's seventieth birthday, as well as his longstanding interest in, and his seminal contributions to, this field going back to as early as 1987 by modestly proposing how the concrete implementation in N\\'emeti and D\\'avid (2006) might be complemented by a quantum-information-theoretic communication protocol between the computing device and the logician who sets the beyond-Turing ...

  13. Automated segmentation of MS lesions in FLAIR, DIR and T2-w MR images via an information theoretic approach

    Science.gov (United States)

    Hill, Jason E.; Matlock, Kevin; Pal, Ranadip; Nutter, Brian; Mitra, Sunanda

    2016-03-01

    Magnetic Resonance Imaging (MRI) is a vital tool in the diagnosis and characterization of multiple sclerosis (MS). MS lesions can be imaged with relatively high contrast using either Fluid Attenuated Inversion Recovery (FLAIR) or Double Inversion Recovery (DIR). Automated segmentation and accurate tracking of MS lesions from MRI remains a challenging problem. Here, an information theoretic approach to cluster the voxels in pseudo-colorized multispectral MR data (FLAIR, DIR, T2-weighted) is utilized to automatically segment MS lesions of various sizes and noise levels. The Improved Jump Method (IJM) clustering, assisted by edge suppression, is applied to the segmentation of white matter (WM), gray matter (GM), cerebrospinal fluid (CSF) and MS lesions, if present, into a subset of slices determined to be the best MS lesion candidates via Otsu's method. From this preliminary clustering, the modal data values for the tissues can be determined. A Euclidean distance is then used to estimate the fuzzy memberships of each brain voxel for all tissue types and their 50/50 partial volumes. From these estimates, binary discrete and fuzzy MS lesion masks are constructed. Validation is provided by using three synthetic MS lesions brains (mild, moderate and severe) with labeled ground truths. The MS lesions of mild, moderate and severe designations were detected with a sensitivity of 83.2%, and 88.5%, and 94.5%, and with the corresponding Dice similarity coefficient (DSC) of 0.7098, 0.8739, and 0.8266, respectively. The effect of MRI noise is also examined by simulated noise and the application of a bilateral filter in preprocessing.

  14. Automated Segmentation of MS Lesions in MR Images Based on an Information Theoretic Clustering and Contrast Transformations

    Directory of Open Access Journals (Sweden)

    Jason Hill

    2015-06-01

    Full Text Available Magnetic Resonance Imaging (MRI plays a significant role in the current characterization and diagnosis of multiple sclerosis (MS in radiological imaging. However, early detection of MS lesions from MRI still remains a challenging problem. In the present work, an information theoretic approach to cluster the voxels in MS lesions for automatic segmentation of lesions of various sizes in multi-contrast (T1, T2, PD-weighted MR images, is applied. For accurate detection of MS lesions of various sizes, the skull-stripped brain data are rescaled and histogram manipulated prior to mapping the multi-contrast data to pseudo-color images. For automated segmentation of multiple sclerosis (MS lesions in multi-contrast MRI, the improved jump method (IJM clustering method has been enhanced via edge suppression for improved segmentation of white matter (WM, gray matter (GM, cerebrospinal fluid (CSF and MS lesions if present. From this preliminary clustering, a pseudo-color to grayscale conversion is designed to equalize the intensities of the normal brain tissues, leaving the MS lesions as outliers. Binary discrete and 8-bit fuzzy labels are then assigned to segment the MS lesions throughout the full brain. For validation of the proposed method, three brains, with mild, moderate and severe hyperintense MS lesions labeled as ground truth, were selected. The MS lesions of mild, moderate and severe categories were detected with a sensitivity of 80%, and 96%, and 94%, and with the corresponding Dice similarity coefficient (DSC of 0.5175, 0.8739, and 0.8266 respectively. The MS lesions can also be clearly visualized in a transparent pseudo-color computer rendered 3D brain.

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

  16. A threshold key escrow scheme based on public key cryptosystem

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In key escrow field it is important to solve the problem thatuser's secret key completely depends on the trusted escrow agency. In 1995, some methods of solving the problem were presented. But these methods are no better than that of directly using threshold cryptography. In this paper, we present a common pattern of threshold key escrow scheme based on public key cryptosystem, and a detailed design based on the improved RSA algorithm is given. The above problem is solved by this scheme.

  17. Secret sharing using biometric traits

    Science.gov (United States)

    Kholmatov, Alisher; Yanikoglu, Berrin; Savas, Erkay; Levi, Albert

    2006-04-01

    In biometric based authentication, biometric traits of a person are matched against his/her stored biometric profile and access is granted if there is sufficient match. However, there are other access scenarios, which require participation of multiple previously registered users for a successful authentication or to get an access grant for a certain entity. For instance, there are cryptographic constructs generally known as secret sharing schemes, where a secret is split into shares and distributed amongst participants in such a way that it is reconstructed/revealed only when the necessary number of share holders come together. The revealed secret can then be used for encryption or authentication (if the revealed key is verified against the previously registered value). In this work we propose a method for the biometric based secret sharing. Instead of splitting a secret amongst participants, as is done in cryptography, a single biometric construct is created using the biometric traits of the participants. During authentication, a valid cryptographic key is released out of the construct when the required number of genuine participants present their biometric traits.

  18. The Homomorphic Key Agreement

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    There are various challenges that are faced in group communication, so it is necessary to ensure session key. Key agreement is the fundamental cryptographic primitive for establishing a secure communication. It is a process of computing a shared secret contributed by two or more entities such that no single node can predetermine the resulting value. An authenticated key agreement is attained by combining the key agreement protocol with digital signatures. After a brief introduction to existing key agreement in group communication, Making use of the additive-multiplicative homomorphism in the integer ring defined by Sander and Tschudin: A new protocols, called the homomorphism key agreement, was designed, which can be self-contributory, robust, scalable and applicable in group communication.

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

  20. How to secretly share the treasure map of the captain?

    Science.gov (United States)

    Islam, N.; Puech, W.; Brouzet, R.

    2010-01-01

    In this paper we present a new approach for sharing a secret image between l users exploiting additive homomorphic property of Paillier algorithm. With a traditional approach, when a dealer wants to share an image between l players, the secret image must be sequentially encrypted l + 1 times using l + 1 keys (secret or public keys). When the dealer and the l players want to extract the secret image, they must decrypt sequentially, keeping the same order of the encryption step, by using l + 1 keys (secret or private). With the proposed approach, during the encryption step, each player encrypts his own secret image using the same public key given by the dealer, the dealer encrypts the secret image to be shared with the same key and then the l secret encrypted images plus the encrypted image to be shared are multiplied between them to get a scrambled image. After this step, the dealer can securely use the private key to decrypt this scrambled image to get a new scrambled image which corresponds to the addition of the l + 1 original images because of the additive homomorphic property of Paillier algorithm. When the l players want to extract the secret image, they do not need the dealer and to use keys. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own secret image from the scrambled image. In this paper we illustrate our approach with an example of a captain who wants to share a secret treasure map between l pirates. Experimental results and security analysis show the effectiveness of the proposed scheme.

  1. Decision-Making under Ambiguity Is Modulated by Visual Framing, but Not by Motor vs. Non-Motor Context. Experiments and an Information-Theoretic Ambiguity Model.

    Directory of Open Access Journals (Sweden)

    Jordi Grau-Moya

    Full Text Available A number of recent studies have investigated differences in human choice behavior depending on task framing, especially comparing economic decision-making to choice behavior in equivalent sensorimotor tasks. Here we test whether decision-making under ambiguity exhibits effects of task framing in motor vs. non-motor context. In a first experiment, we designed an experience-based urn task with varying degrees of ambiguity and an equivalent motor task where subjects chose between hitting partially occluded targets. In a second experiment, we controlled for the different stimulus design in the two tasks by introducing an urn task with bar stimuli matching those in the motor task. We found ambiguity attitudes to be mainly influenced by stimulus design. In particular, we found that the same subjects tended to be ambiguity-preferring when choosing between ambiguous bar stimuli, but ambiguity-avoiding when choosing between ambiguous urn sample stimuli. In contrast, subjects' choice pattern was not affected by changing from a target hitting task to a non-motor context when keeping the stimulus design unchanged. In both tasks subjects' choice behavior was continuously modulated by the degree of ambiguity. We show that this modulation of behavior can be explained by an information-theoretic model of ambiguity that generalizes Bayes-optimal decision-making by combining Bayesian inference with robust decision-making under model uncertainty. Our results demonstrate the benefits of information-theoretic models of decision-making under varying degrees of ambiguity for a given context, but also demonstrate the sensitivity of ambiguity attitudes across contexts that theoretical models struggle to explain.

  2. Immunoglobins in mammary secretions

    DEFF Research Database (Denmark)

    Hurley, W L; Theil, Peter Kappel

    2013-01-01

    Immunoglobulins secreted in colostrum and milk by the lactating mammal are major factors providing immune protection to the newborn. Immunoglobulins in mammary secretions represent the cumulative immune response of the lactating animal to exposure to antigenic stimulation that occurs through inte...

  3. The information-theoretic turn

    Directory of Open Access Journals (Sweden)

    Blevins James P.

    2013-01-01

    Full Text Available Over the past decade, information theory has been applied to the analysis of a successively broader range of morphological phenomena. Interestingly, this tradition has arisen independently of the linguistic applications of information theory dating from the 1950’s. Instead, the point of origin for current work lies in a series of studies of morphological processing in which Kostić and associates develop a statistical notion of ‘morphological information’ based on ‘uncertainty’ and ‘uncertainty reduction’. From these initial studies, analyses based on statistical notions of information have been applied to general problems of morphological description and typological classification, leading to a formal rehabilitation of the complex system perspective of traditional WP models.

  4. Incretin secretion: direct mechanisms

    DEFF Research Database (Denmark)

    Balk-Møller, Emilie; Holst, Jens Juul; Kuhre, Rune Ehrenreich

    2014-01-01

    The incretin hormones glucose-dependent insulinotropic polypeptide (GIP) and glucagon-like peptide 1 (GLP-1) are secreted from gastro-intestinal K- and L-cells, respectively, and play an important role in post-prandial blood glucose regulation. They do this by direct stimulation of the pancreatic β...... enzyme responsible for incretin degradation (dipeptidyl peptidase-4) is inhibited (drugs are already on the market) while the secretion of endogenous GLP-1 secretion is stimulated at the same time may prove particularly rewarding. In this section we review current knowledge on the mechanisms for direct...

  5. Type VI secretion system.

    Science.gov (United States)

    Salomon, Dor; Orth, Kim

    2015-03-30

    Bacteria employ a variety of tools to survive in a competitive environment. Salomon and Orth describe one such tool-the Type 6 Secretion Systems used by bacteria to deliver a variety of toxins into competing cells.

  6. Security of the AES with a Secret S-Box

    DEFF Research Database (Denmark)

    Tiessen, Tyge; Knudsen, Lars Ramkilde; Kölbl, Stefan

    2015-01-01

    How does the security of the AES change when the S-box is replaced by a secret S-box, about which the adversary has no knowledge? Would it be safe to reduce the number of encryption rounds? In this paper, we demonstrate attacks based on integral cryptanalysis which allow to recover both the secret...... key and the secret S-box for respectively four, five, and six rounds of the AES. Despite the significantly larger amount of secret information which an adversary needs to recover, the attacks are very efficient with time/data complexities of 217/216, 238/240 and 290/264, respectively. Another...

  7. Securing AODV for MANETs using Message Digest with Secret Key

    OpenAIRE

    Mr. Kamaljit Lakhtaria; Prof. Bhaskar N. Patel; Prajapati, Satish G.; Dr. N. N. Jani

    2009-01-01

    Due to lack of the infrastructure, open peer-to-peerarchitecture, shared wireless medium, limited resourceconstraints and highly dynamic topology, MANETs (Mobile AdhocNetworks) are frequently established in insecureenvironments, which make them more vulnerable to attacks.These attacks are initiated by sharing malicious nodes againstdifferent services of network. The binding force in thesenetworks is routing protocol, which is a common target ofmalicious nodes. MANETs routing protocols are bei...

  8. Securing AODV for MANETs using Message Digest with Secret Key

    CERN Document Server

    Lakhtaria, Mr Kamaljit; Prajapati, Mr Satish G; Jani, N N

    2010-01-01

    Due to lack of the infrastructure, open peer-to-peer architecture, shared wireless medium, limited resource constraints and highly dynamic topology, MANETs (Mobile Adhoc Networks) are frequently established in insecure environments, which make them more vulnerable to attacks. These attacks are initiated by sharing malicious nodes against different services of network. The binding force in these networks is routing protocol, which is a common target of malicious nodes. MANETs routing protocols are being developed without having security in mind. Ad-hoc On-Demand Distance Vector (AODV) is one such widely used routing protocol that is at present undergo extensive research and development. AODV is based on distance vector routing, but here the updates are shared not on a periodic basis but on an as per demand basis. The control packets contain a hop-count and sequence number field which recognizes the freshness of routing. These fields are editable, so it creates a possible susceptibility that is frequently abuse...

  9. Free-space quantum key distribution

    CERN Document Server

    Buttler, W T; Kwiat, P G; Luther, G G; Morgan, G L; Nordholt, J E; Peterson, C G; Simmons, C M

    1998-01-01

    A working free-space quantum key distribution (QKD) system has been developed and tested over a 205-m indoor optical path at Los Alamos National Laboratory under fluorescent lighting conditions. Results show that free-space QKD can provide secure real-time key distribution between parties who have a need to communicate secretly.

  10. Predicting the potential distribution of invasive exotic species using GIS and information-theoretic approaches: A case of ragweed (Ambrosia artemisiifolia L.)distribution in China

    Institute of Scientific and Technical Information of China (English)

    CHEN Hao; CHEN LiJun; Thomas P. ALBRIGHT

    2007-01-01

    Invasive exotic species pose a growing threat to the economy, public health, and ecological integrity of nations worldwide. Explaining and predicting the spatial distribution of invasive exotic species is of great importance to prevention and early warning efforts. We are investigating the potential distribution of invasive exotic species, the environmental factors that influence these distributions, and the ability to predict them using statistical and information-theoretic approaches. For some species, detailed presence/absence occurrence data are available, allowing the use of a variety of standard statistical techniques. However, for most species, absence data are not available. Presented with the challenge of developing a model based on presence-only information, we developed an improved logistic regression approach using Information Theory and Frequency Statistics to produce a relative suitability map.This paper generated a variety of distributions of ragweed (Ambrosia artemisiifolia L.) from logistic regression models applied to herbarium specimen location data and a suite of GIS layers including climatic, topographic, and land cover information. Our logistic regression model was based on Akaike's Information Criterion (AIC) from a suite of ecologically reasonable predictor variables. Based on the results we provided a new Frequency Statistical method to compartmentalize habitat-suitability in the native range. Finally, we used the model and the compartmentalized criterion developed in native ranges to "project" a potential distribution onto the exotic ranges to build habitat-suitability maps.

  11. MapReduce Algorithms for Inferring Gene Regulatory Networks from Time-Series Microarray Data Using an Information-Theoretic Approach

    Directory of Open Access Journals (Sweden)

    Yasser Abduallah

    2017-01-01

    Full Text Available Gene regulation is a series of processes that control gene expression and its extent. The connections among genes and their regulatory molecules, usually transcription factors, and a descriptive model of such connections are known as gene regulatory networks (GRNs. Elucidating GRNs is crucial to understand the inner workings of the cell and the complexity of gene interactions. To date, numerous algorithms have been developed to infer gene regulatory networks. However, as the number of identified genes increases and the complexity of their interactions is uncovered, networks and their regulatory mechanisms become cumbersome to test. Furthermore, prodding through experimental results requires an enormous amount of computation, resulting in slow data processing. Therefore, new approaches are needed to expeditiously analyze copious amounts of experimental data resulting from cellular GRNs. To meet this need, cloud computing is promising as reported in the literature. Here, we propose new MapReduce algorithms for inferring gene regulatory networks on a Hadoop cluster in a cloud environment. These algorithms employ an information-theoretic approach to infer GRNs using time-series microarray data. Experimental results show that our MapReduce program is much faster than an existing tool while achieving slightly better prediction accuracy than the existing tool.

  12. MapReduce Algorithms for Inferring Gene Regulatory Networks from Time-Series Microarray Data Using an Information-Theoretic Approach.

    Science.gov (United States)

    Abduallah, Yasser; Turki, Turki; Byron, Kevin; Du, Zongxuan; Cervantes-Cervantes, Miguel; Wang, Jason T L

    2017-01-01

    Gene regulation is a series of processes that control gene expression and its extent. The connections among genes and their regulatory molecules, usually transcription factors, and a descriptive model of such connections are known as gene regulatory networks (GRNs). Elucidating GRNs is crucial to understand the inner workings of the cell and the complexity of gene interactions. To date, numerous algorithms have been developed to infer gene regulatory networks. However, as the number of identified genes increases and the complexity of their interactions is uncovered, networks and their regulatory mechanisms become cumbersome to test. Furthermore, prodding through experimental results requires an enormous amount of computation, resulting in slow data processing. Therefore, new approaches are needed to expeditiously analyze copious amounts of experimental data resulting from cellular GRNs. To meet this need, cloud computing is promising as reported in the literature. Here, we propose new MapReduce algorithms for inferring gene regulatory networks on a Hadoop cluster in a cloud environment. These algorithms employ an information-theoretic approach to infer GRNs using time-series microarray data. Experimental results show that our MapReduce program is much faster than an existing tool while achieving slightly better prediction accuracy than the existing tool.

  13. A Two-Stage Information-Theoretic Approach to Modeling Landscape-Level Attributes and Maximum Recruitment of Chinook Salmon in the Columbia River Basin.

    Energy Technology Data Exchange (ETDEWEB)

    Thompson, William L.; Lee, Danny C.

    2000-11-01

    Many anadromous salmonid stocks in the Pacific Northwest are at their lowest recorded levels, which has raised questions regarding their long-term persistence under current conditions. There are a number of factors, such as freshwater spawning and rearing habitat, that could potentially influence their numbers. Therefore, we used the latest advances in information-theoretic methods in a two-stage modeling process to investigate relationships between landscape-level habitat attributes and maximum recruitment of 25 index stocks of chinook salmon (Oncorhynchus tshawytscha) in the Columbia River basin. Our first-stage model selection results indicated that the Ricker-type, stock recruitment model with a constant Ricker a (i.e., recruits-per-spawner at low numbers of fish) across stocks was the only plausible one given these data, which contrasted with previous unpublished findings. Our second-stage results revealed that maximum recruitment of chinook salmon had a strongly negative relationship with percentage of surrounding subwatersheds categorized as predominantly containing U.S. Forest Service and private moderate-high impact managed forest. That is, our model predicted that average maximum recruitment of chinook salmon would decrease by at least 247 fish for every increase of 33% in surrounding subwatersheds categorized as predominantly containing U.S. Forest Service and privately managed forest. Conversely, mean annual air temperature had a positive relationship with salmon maximum recruitment, with an average increase of at least 179 fish for every increase in 2 C mean annual air temperature.

  14. A secure quantum key distribution scheme based on variable quantum encoding algorithms

    Institute of Scientific and Technical Information of China (English)

    Zhiwen Zhao; Yi Luo; Zhangji Zhao; Haiming Long

    2011-01-01

    The security of the quantum secret key plays a critical role in quantum communications. Thus far, one problem that still exists in existing protocols is the leakage of the length of the secret key. In this letter, based on variable quantum encoding algorithms, we propose a secure quantum key distribution scheme, which can overcome the security problem involving the leakage of the secret key. Security analysis shows that the proposed scheme is both secure and effective.%@@ The security of the quantum secret key plays a critical role in quantum communications.Thus far, one problem that still exists in existing protocols is the leakage of the length of the secret key.In this letter,based on variable quantum encoding algorithms, we propose a secure quantum key distribution scheme,which can overcome the security problem involving the leakage of the secret key.Security analysis shows that the proposed scheme is both secure and effective.

  15. Finite-key security analysis for multilevel quantum key distribution

    Science.gov (United States)

    Brádler, Kamil; Mirhosseini, Mohammad; Fickler, Robert; Broadbent, Anne; Boyd, Robert

    2016-07-01

    We present a detailed security analysis of a d-dimensional quantum key distribution protocol based on two and three mutually unbiased bases (MUBs) both in an asymptotic and finite-key-length scenario. The finite secret key rates (in bits per detected photon) are calculated as a function of the length of the sifted key by (i) generalizing the uncertainly relation-based insight from BB84 to any d-level 2-MUB QKD protocol and (ii) by adopting recent advances in the second-order asymptotics for finite block length quantum coding (for both d-level 2- and 3-MUB QKD protocols). Since the finite and asymptotic secret key rates increase with d and the number of MUBs (together with the tolerable threshold) such QKD schemes could in principle offer an important advantage over BB84. We discuss the possibility of an experimental realization of the 3-MUB QKD protocol with the orbital angular momentum degrees of freedom of photons.

  16. Depth keying

    Science.gov (United States)

    Gvili, Ronen; Kaplan, Amir; Ofek, Eyal; Yahav, Giora

    2003-05-01

    We present a new solution to the known problem of video keying in a natural environment. We segment foreground objects from background objects using their relative distance from the camera, which makes it possible to do away with the use of color for keying. To do so, we developed and built a novel depth video camera, capable of producing RGB and D signals, where D stands for the distance to each pixel. The new RGBD camera enables the creation of a whole new gallery of effects and applications such as multi-layer background substitutions. This new modality makes the production of real time mixed reality video possible, as well as post-production manipulation of recorded video. We address the problem of color spill -- in which the color of the foreground object is mixed, along its boundary, with the background color. This problem prevents an accurate separation of the foreground object from its background, and it is most visible when compositing the foreground objects to a new background. Most existing techniques are limited to the use of a constant background color. We offer a novel general approach to the problem with enabling the use of the natural background, based upon the D channel generated by the camera.

  17. Gene and genon concept: coding versus regulation. A conceptual and information-theoretic analysis of genetic storage and expression in the light of modern molecular biology.

    Science.gov (United States)

    Scherrer, Klaus; Jost, Jürgen

    2007-10-01

    , as steered by the genon. It emerges finally as an uninterrupted nucleic acid sequence at mRNA level just prior to translation, in faithful correspondence with the amino acid sequence to be produced as a polypeptide. After translation, the genon has fulfilled its role and expires. The distinction between the protein coding information as materialised in the final polypeptide and the processing information represented by the genon allows us to set up a new information theoretic scheme. The standard sequence information determined by the genetic code expresses the relation between coding sequence and product. Backward analysis asks from which coding region in the DNA a given polypeptide originates. The (more interesting) forward analysis asks in how many polypeptides of how many different types a given DNA segment is expressed. This concerns the control of the expression process for which we have introduced the genon concept. Thus, the information theoretic analysis can capture the complementary aspects of coding and regulation, of gene and genon.

  18. Unconventional protein secretion.

    Science.gov (United States)

    Ding, Yu; Wang, Juan; Wang, Junqi; Stierhof, York-Dieter; Robinson, David G; Jiang, Liwen

    2012-10-01

    It is generally believed that protein secretion or exocytosis is achieved via a conventional ER (endoplasmic reticulum)-Golgi-TGN (trans-Golgi network)-PM (plasma membrane) pathway in the plant endomembrane system. However, such signal peptide (SP)-dependent protein secretion cannot explain the increasing number of SP-lacking proteins which are found outside of the PM in plant cells. The process by which such leaderless secretory proteins (LSPs) gain access to the cell exterior is termed unconventional protein secretion (UPS) and has been well-studied in animal and yeast cells, but largely ignored by the plant community. Here, we review the evidence for UPS in plants especially in regard to the recently discovered EXPO (exocyst-positive-organelle).

  19. Using Akaike's information theoretic criterion in mixed-effects modeling of pharmacokinetic data: a simulation study [version 3; referees: 2 approved, 1 approved with reservations

    Directory of Open Access Journals (Sweden)

    Erik Olofsen

    2015-07-01

    Full Text Available Akaike's information theoretic criterion for model discrimination (AIC is often stated to "overfit", i.e., it selects models with a higher dimension than the dimension of the model that generated the data. However, with experimental pharmacokinetic data it may not be possible to identify the correct model, because of the complexity of the processes governing drug disposition. Instead of trying to find the correct model, a more useful objective might be to minimize the prediction error of drug concentrations in subjects with unknown disposition characteristics. In that case, the AIC might be the selection criterion of choice. We performed Monte Carlo simulations using a model of pharmacokinetic data (a power function of time with the property that fits with common multi-exponential models can never be perfect - thus resembling the situation with real data. Prespecified models were fitted to simulated data sets, and AIC and AICc (the criterion with a correction for small sample sizes values were calculated and averaged. The average predictive performances of the models, quantified using simulated validation sets, were compared to the means of the AICs. The data for fits and validation consisted of 11 concentration measurements each obtained in 5 individuals, with three degrees of interindividual variability in the pharmacokinetic volume of distribution. Mean AICc corresponded very well, and better than mean AIC, with mean predictive performance. With increasing interindividual variability, there was a trend towards larger optimal models, but with respect to both lowest AICc and best predictive performance. Furthermore, it was observed that the mean square prediction error itself became less suitable as a validation criterion, and that a predictive performance measure should incorporate interindividual variability. This simulation study showed that, at least in a relatively simple mixed-effects modelling context with a set of prespecified models

  20. Computer-assisted diagnosis of mammographic masses using an information-theoretic image retrieval scheme with BIRADs-based relevance feedback

    Science.gov (United States)

    Tourassi, Georgia D.; Floyd, Carey E., Jr.

    2004-05-01

    The purpose of the study was to develop and evaluate a content-based image retrieval (CBIR) approach for computer-assisted diagnosis of masses detected in screening mammograms. The system follows an information theoretic retrieval scheme with a BIRADS-based relevance feedback (RF) algorithm. Initially, a knowledge databank of 365 mammographic regions of interest (ROIs) was created. They were all 512x512 pixel ROIs extracted from DDSM mammograms digitized using the Lumisys digitizer. The ROIs were extracted around the known locations of the annotated masses. Specifically, there were 177 ROIs depicting a biopsy-proven malignant mass and 188 ROIs with a benign mass. Subsequently, the CBIR algorithm was implemented using mutual information (MI) as the similarity metric for image retrieval. The CBIR algorithm formed the basis of a knowledge-based CAD system. Given a databank of mammographic masses with known pathology, a query mass was evaluated. Based on their information content, all similar masses in the databank were retrieved. A relevance feedback algorithm based on BIRADS findings was implemented to determine the relevance factor of the retrieved masses. Finally, a decision index was calculated using the query's k best matches. The decision index effectively combined the similarity metric of the retrieved cases and their relevance factor into a prediction regarding the malignancy status of the mass depicted in the query ROI. ROC analysis was to evaluate diagnostic performance. Performance improved dramatically with the incorporation of the relevance feedback algorithm. Overall, the CAD system achieved ROC area index AZ= 0.86+/-0.02 for the diagnosis of masses in screening mammograms.

  1. Quantum Key Distribution Protocol with User Authentication

    CERN Document Server

    Lee, H; Lee, D; Lim, J; Yang, H J; Lee, Hwayean; Lee, Sangjin; Lee, Donghoon; Lim, Jongin; Yang, HyungJin

    2005-01-01

    We propose a quantum key distribution protocol with quantum based user authentication. User authentication is executed by validating the correlation of GHZ states. Alice and Bob can distribute a secure key using the remaining GHZ states after authentication. This secret key does not leak even to the arbitrator by the properties of the entanglement. We will show that our protocol is secure against the cloning attack.

  2. Secrets of Successful Homeschooling

    Science.gov (United States)

    Rivero, Lisa

    2011-01-01

    Parents who homeschool gifted children often find the daily practice of home education very different from what they had imagined. Gifted children are complex in both personality and learning styles. Parents who say that homeschooling works well for their gifted children have learned from others or discovered on their own several secrets that make…

  3. Physiology of bile secretion

    Institute of Scientific and Technical Information of China (English)

    Alejandro Esteller

    2008-01-01

    The formation of bile depends on the structural and functional integrity of the bile-secretory apparatus and its impairment,in different situations,results in the syndrome of cholestasis.The structural bases that permit bile secretion as well as various aspects related with its composition and flow rate in physiological conditions will first be reviewed.Canalicular bile is produced by polarized hepatocytes that hold transporters in their basolateral (sinusoidal) and apical (canalicular) plasma membrane.This review summarizes recent data on the molecular determinants of this primary bile formation.The major function of the biliary tree is modification of canalicular bile by secretory and reabsorptive processes in bileduct epithelial cells (cholangiocytes) as bile passes through bile ducts.The mechanisms of fluid and solute transport in cholangiocytes will also be discussed.In contrast to hepatocytes where secretion is constant and poorly controlled,cholangiocyte secretion is regulated by hormones and nerves.A short section dedicated to these regulatory mechanisms of bile secretion has been included.The aim of this revision was to set the bases for other reviews in this series that will be devoted to specific issues related with biliary physiology and pathology.

  4. Salivary Gland Secretion.

    Science.gov (United States)

    Dorman, H. L.; And Others

    1981-01-01

    Describes materials and procedures for an experiment utilizing a live dog to demonstrate: (1) physiology of the salivary gland; (2) parasympathetic control of the salivary gland; (3) influence of varying salivary flow rates on sodium and potassium ions, osmolarity and pH; and (4) salivary secretion as an active process. (DS)

  5. Almost-perfect secret sharing

    CERN Document Server

    Kaced, Tarik

    2011-01-01

    Splitting a secret s between several participants, we generate (for each value of s) shares for all participants. The goal: authorized groups of participants should be able to reconstruct the secret but forbidden ones get no information about it. In this paper we introduce several notions of non- perfect secret sharing, where some small information leak is permitted. We study its relation to the Kolmogorov complexity version of secret sharing (establishing some connection in both directions) and the effects of changing the secret size (showing that we can decrease the size of the secret and the information leak at the same time).

  6. Are Secrets Immoral? The Construction of Secrets in Everyday Conversation.

    Science.gov (United States)

    Gunthner, Susanne; Luckmann, Thomas

    1998-01-01

    Investigates the communicative treatment of secrets, presenting examples from recorded communicative interactions in a wide range of social milieus and settings in which the participants revealed knowledge of secrets, tried to dig out old secrets without appearing to be doing so, and occasionally, appeared to be hiding some items of knowledge from…

  7. Finite-key analysis of a practical decoy-state high-dimensional quantum key distribution

    Science.gov (United States)

    Bao, Haize; Bao, Wansu; Wang, Yang; Zhou, Chun; Chen, Ruike

    2016-05-01

    Compared with two-level quantum key distribution (QKD), high-dimensional QKD enables two distant parties to share a secret key at a higher rate. We provide a finite-key security analysis for the recently proposed practical high-dimensional decoy-state QKD protocol based on time-energy entanglement. We employ two methods to estimate the statistical fluctuation of the postselection probability and give a tighter bound on the secure-key capacity. By numerical evaluation, we show the finite-key effect on the secure-key capacity in different conditions. Moreover, our approach could be used to optimize parameters in practical implementations of high-dimensional QKD.

  8. Extracellular secretion of recombinant proteins

    Science.gov (United States)

    Linger, Jeffrey G.; Darzins, Aldis

    2014-07-22

    Nucleic acids encoding secretion signals, expression vectors containing the nucleic acids, and host cells containing the expression vectors are disclosed. Also disclosed are polypeptides that contain the secretion signals and methods of producing polypeptides, including methods of directing the extracellular secretion of the polypeptides. Exemplary embodiments include cellulase proteins fused to secretion signals, methods to produce and isolate these polypeptides, and methods to degrade lignocellulosic biomass.

  9. Telling stories: keeping secrets.

    Science.gov (United States)

    Jensen, Joan M

    2009-01-01

    This article addresses the reticence of some farm women to share their experiences with historians and how that desire to keep secrets collides with the desire by scholars to tell the stories of these women. It argues that scholars must continue to struggle with the issue of which stories to tell publicly and which to keep private. The author discusses her own experience telling stories about rural women in the 1970s and the need to give voice to the heritage of rural women, especially of groups that have feared revealing their experiences. She offers examples of historians of rural women who have successfully worked with formerly silenced populations and urges historians to continue to tell stories about these lives, to reevaluate what has been already learned, to ask new questions, and to discuss which secrets need to be shared.

  10. Bucarest, Strictement Secret

    Directory of Open Access Journals (Sweden)

    Ionela Mihai

    2010-07-01

    Full Text Available L’émission Bucarest, strictement secret représente un documentaire organisésous la forme d’une série télé, qui dépeint le Bucarest à partir de deux perspectives: de l’histoire, de la conte et du lieu. La valeur d’une cité réside dans l’existence d’une mystique, d’un romantisme abscons, à part et des caractères empruntés de drames de Shakespeare, mystérieux, serrés d’angoisse et des secrets qui assombrissent leur existence. Par conséquence, le rôle du metteur en scène est de dévoiler leur vraie identité et de remettre en place, autant que possible, la vérité.

  11. Multi-group dynamic quantum secret sharing with single photons

    Energy Technology Data Exchange (ETDEWEB)

    Liu, Hongwei [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Ma, Haiqiang, E-mail: hqma@bupt.edu.cn [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Wei, Kejin [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China); Yang, Xiuqing [School of Science, Beijing Jiaotong University, Beijing 100044 (China); Qu, Wenxiu; Dou, Tianqi; Chen, Yitian; Li, Ruixue; Zhu, Wu [School of Science and State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing 100876 (China)

    2016-07-15

    In this letter, we propose a novel scheme for the realization of single-photon dynamic quantum secret sharing between a boss and three dynamic agent groups. In our system, the boss can not only choose one of these three groups to share the secret with, but also can share two sets of independent keys with two groups without redistribution. Furthermore, the security of communication is enhanced by using a control mode. Compared with previous schemes, our scheme is more flexible and will contribute to a practical application. - Highlights: • A multi-group dynamic quantum secret sharing with single photons scheme is proposed. • Any one of the groups can be chosen to share secret through controlling the polarization of photons. • Two sets of keys can be shared simultaneously without redistribution.

  12. Advanced Steganography Algorithm using Encrypted secret message

    Directory of Open Access Journals (Sweden)

    Joyshree Nath

    2011-03-01

    Full Text Available In the present work the authors have introduced a new method for hiding any encrypted secret message inside a cover file. For encrypting secret message the authors have used new algorithm proposed by Nath et al(1. For hiding secret message we have used a method proposed by Nath et al(2. In MSA(1 method we have modified the idea of Play fair method into a new platform where we can encrypt or decrypt any file. We have introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. We have also introduced a new algorithm for encrypting the plain text multiple times. Our method is totally dependent on the random text_key which is to be supplied by the user. The maximum length of the text_key can be of 16 characters long and it may contain any character(ASCII code 0 to 255. We have developed an algorithm to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and hence if someone applies the brute force method then he/she has to give trail for 256! times which is quite absurd. Moreover the multiple encryption method makes the system further secured. For hiding secret message in the cover file we have inserted the 8 bits of each character of encrypted message file in 8 consecutive bytes of the cover file. We have introduced password for hiding data in the cover file. We propose that our new method could be most appropriate for hiding any file in any standard cover file such as image, audio, video files. Because the hidden message is encrypted hence it will be almost impossible for the intruder to unhide the actual secret message from the embedded cover file. This method may be the most secured method in digital water marking.

  13. Dynamic Session-Key Generation for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chen Chin-Ling

    2008-01-01

    Full Text Available Abstract Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting keys from a key pool and forming a key chain. Then, the sensor nodes make use of the key chain to encrypt the data. However, while the secret key is being transmitted, it can easily be exposed during transmission. We propose a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods. Additionally, the dynamic update of the key can lower the probability of the key to being guessed correctly. In addition, with the new protocol, attacks on the wireless sensor network can be avoided.

  14. Metabolic priming by a secreted fungal effector.

    Science.gov (United States)

    Djamei, Armin; Schipper, Kerstin; Rabe, Franziska; Ghosh, Anupama; Vincon, Volker; Kahnt, Jörg; Osorio, Sonia; Tohge, Takayuki; Fernie, Alisdair R; Feussner, Ivo; Feussner, Kirstin; Meinicke, Peter; Stierhof, York-Dieter; Schwarz, Heinz; Macek, Boris; Mann, Matthias; Kahmann, Regine

    2011-10-05

    Maize smut caused by the fungus Ustilago maydis is a widespread disease characterized by the development of large plant tumours. U. maydis is a biotrophic pathogen that requires living plant tissue for its development and establishes an intimate interaction zone between fungal hyphae and the plant plasma membrane. U. maydis actively suppresses plant defence responses by secreted protein effectors. Its effector repertoire comprises at least 386 genes mostly encoding proteins of unknown function and expressed exclusively during the biotrophic stage. The U. maydis secretome also contains about 150 proteins with probable roles in fungal nutrition, fungal cell wall modification and host penetration as well as proteins unlikely to act in the fungal-host interface like a chorismate mutase. Chorismate mutases are key enzymes of the shikimate pathway and catalyse the conversion of chorismate to prephenate, the precursor for tyrosine and phenylalanine synthesis. Root-knot nematodes inject a secreted chorismate mutase into plant cells likely to affect development. Here we show that the chorismate mutase Cmu1 secreted by U. maydis is a virulence factor. The enzyme is taken up by plant cells, can spread to neighbouring cells and changes the metabolic status of these cells through metabolic priming. Secreted chorismate mutases are found in many plant-associated microbes and might serve as general tools for host manipulation.

  15. Security Proof for Quantum Key Distribution Using Qudit Systems

    CERN Document Server

    Sheridan, Lana

    2010-01-01

    We provide security bounds against coherent attacks for two families of quantum key distribution protocols that use $d$-dimensional quantum systems. In the asymptotic regime, both the secret key rate for fixed noise and the robustness to noise increase with $d$. The finite-key corrections are found to be almost insensitive to $d\\lesssim 20$.

  16. Lipid-independent secretion of a Drosophila Wnt protein.

    Science.gov (United States)

    Ching, Wendy; Hang, Howard C; Nusse, Roel

    2008-06-20

    Wnt proteins comprise a large class of secreted signaling molecules with key roles during embryonic development and throughout adult life. Recently, much effort has been focused on understanding the factors that regulate Wnt signal production. For example, Porcupine and Wntless/Evi/Sprinter have been identified as being required in Wnt-producing cells for the processing and secretion of many Wnt proteins. Interestingly, in this study we find that WntD, a recently characterized Drosophila Wnt family member, does not require Porcupine or Wntless/Evi/Sprinter for its secretion or signaling activity. Because Porcupine is involved in post-translational lipid modification of Wnt proteins, we used a novel labeling method and mass spectrometry to ask whether WntD undergoes lipid modification and found that it does not. Although lipid modification is also hypothesized to be required for Wnt secretion, we find that WntD is secreted very efficiently. WntD secretion does, however, maintain a requirement for the secretory pathway component Rab1. Our results show that not all Wnt family members require lipid modification, Porcupine, or Wntless/Evi/Sprinter for secretion and suggest that different modes of secretion may exist for different Wnt proteins.

  17. Design of an Efficient Neural Key Distribution Centre

    CERN Document Server

    Bisalapur, Sahana S

    2011-01-01

    The goal of any cryptographic system is the exchange of information among the intended users without any leakage of information to others who may have unauthorized access to it. A common secret key could be created over a public channel accessible to any opponent. Neural networks can be used to generate common secret key. In case of neural cryptography, both the communicating networks receive an identical input vector, generate an output bit and are trained based on the output bit. The two networks and their weight vectors exhibit a novel phenomenon, where the networks synchronize to a state with identical time-dependent weights. The generated secret key over a public channel is used for encrypting and decrypting the information being sent on the channel. This secret key is distributed to the other vendor efficiently by using an agent based approach.

  18. Failure of Kak quantum key distribution protocol

    Indian Academy of Sciences (India)

    Ching-Nung Yang; Su-Hsuan Chu; Bing-Ling Lu

    2005-01-01

    Kak's quantum key distribution (QKD) protocol provides not only the distribution but also the integrity of secret key simultaneously in quantum channel. Consequently the additional exchange of information, used to check whether an eavesdropper exists, is unnecessary. In this comment, we will point out the failure of Kak's protocol and show that Kak's protocol does not have the joint distribution and integration that the author declares in [1].

  19. Autotransporter protein secretion.

    Science.gov (United States)

    Tame, Jeremy R H

    2011-12-01

    Autotransporter proteins are a large family of virulence factors secreted from Gram-negative bacteria by a unique mechanism. First described in the 1980s, these proteins have a C-terminal region that folds into a β-barrel in the bacterial outer membrane. The so-called passenger domain attached to this barrel projects away from the cell surface and may be liberated from the cell by self-cleavage or surface proteases. Although the majority of passenger domains have a similar β-helical structure, they carry a variety of sub-domains, allowing them to carry out widely differing functions related to pathogenesis. Considerable biochemical and structural characterisation of the barrel domain has shown that 'autotransporters' in fact require a conserved and essential protein complex in the outer membrane for correct folding. Although the globular domains of this complex projecting into the periplasmic space have also been structurally characterised, the overall secretion pathway of the autotransporters remains highly puzzling. It was presumed for many years that the passenger domain passed through the centre of the barrel domain to reach the cell surface, driven at least in part by folding. This picture is complicated by conflicting data, and there is currently little hard information on the true nature of the secretion intermediates. As well as their medical importance therefore, autotransporters are proving to be an excellent system to study the folding and membrane insertion of outer membrane proteins in general. This review focuses on structural aspects of autotransporters; their many functions in pathogenesis are beyond its scope.

  20. Atmospheric Quantum Key Distribution in Daylight

    Science.gov (United States)

    Buttler, William; Hughes, Richard; Morgan, George; Nordholt, Jane; Peterson, Charles

    2001-05-01

    In quantum key distribution (QKD) single-photon transmissions generate the shared, secret random number sequences, known as cryptographic keys, that are used to encrypt and decrypt secret communications. Because the security of QKD is based on principles of quantum physics an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed an experimental QKD system that uses the four-state “BB84” protocol with non-orthogonal photon polarization states and lowest-order adaptive optics to generate shared key material over multi-kilometer atmospheric, line-of-sight paths. We will present results of a daylight demonstration of this system. Key material is built up using the transmission of a photon-pulse per bit of an initial secret random sequence. We will describe the design and operation of the system, present an analysis of the system's security, efficiency and error rate, and describe the prospects for longer-distance applications of free-space QKD.

  1. Windows 8 secrets

    CERN Document Server

    Thurrott, Paul

    2012-01-01

    Tips, tricks, treats, and secrets revealed on Windows 8 Microsoft is introducing a major new release of its Windows operating system, Windows 8, and what better way to learn all its ins and outs than from two internationally recognized Windows experts and Microsoft insiders, authors Paul Thurrott and Rafael Rivera? They cut through the hype to get at useful information you'll not find anywhere else, including what role this new OS plays in a mobile and tablet world. Regardless of your level of knowledge, you'll discover little-known facts about how things work, what's new and different, and h

  2. Ghrelin and gastric acid secretion

    Institute of Scientific and Technical Information of China (English)

    Koji Yakabi; Junichi Kawashima; Shingo Kato

    2008-01-01

    Ghrelin, a novel growth hormone-releasing peptide, was originally isolated from rat and human stomach. Ghrelin has been known to increase the secretion of growth hormone (GH), food intake, and body weight gain when administered peripherally or centrally. Ghrelin is also known to stimulate the gastric motility and the secretion of gastric acid. In the previous studies, the action of ghrelin on acid secretion was shown to be as strong as that of histamine and gastrin in-vivo experiment. In the studies, the mechanism for the action of ghrelin was also investigated. It was shown that vagotomy completely inhibited the action of ghrelin on the secretion of gastric acid suggesting that vagal nerve is involved in the mechanism for the action of ghrelin on acid secretion. As famotidine did not inhibit ghrelin-in-duced acid secretion in the study by Masuda et al, they concluded that histamine was not involved in the action of ghrelin on acid secretion. However, we have shown that famotidine completely inhibited ghrelin-induced acid secretion and histidine decarboxylase (HDC) mRNA was increased in gastric mucosa by ghrelin injection which is inhibited by vagotomy Our results indicate that histamine is involved in the action of ghrelin on acid secretion. Furthermore synergistic action of gastrin and ghrelin on gastric add secretion was shown. Although gastrin has important roles in postprandial secretion of gastric acid, ghrelin may be related to acid secretion during fasting period or at night. However, further studies are needed to elucidate the physiological role of ghrelin in acid secretion.

  3. Ghrelin and gastric acid secretion.

    Science.gov (United States)

    Yakabi, Koji; Kawashima, Junichi; Kato, Shingo

    2008-11-07

    Ghrelin, a novel growth hormone-releasing peptide, was originally isolated from rat and human stomach. Ghrelin has been known to increase the secretion of growth hormone (GH), food intake, and body weight gain when administered peripherally or centrally. Ghrelin is also known to stimulate the gastric motility and the secretion of gastric acid. In the previous studies, the action of ghrelin on acid secretion was shown to be as strong as that of histamine and gastrin in in-vivo experiment. In the studies, the mechanism for the action of ghrelin was also investigated. It was shown that vagotomy completely inhibited the action of ghrelin on the secretion of gastric acid suggesting that vagal nerve is involved in the mechanism for the action of ghrelin on acid secretion. As famotidine did not inhibit ghrelin-induced acid secretion in the study by Masuda et al, they concluded that histamine was not involved in the action of ghrelin on acid secretion. However, we have shown that famotidine completely inhibited ghrelin-induced acid secretion and histidine decarboxylase (HDC) mRNA was increased in gastric mucosa by ghrelin injection which is inhibited by vagotomy Our results indicate that histamine is involved in the action of ghrelin on acid secretion. Furthermore synergistic action of gastrin and ghrelin on gastric acid secretion was shown. Although gastrin has important roles in postprandial secretion of gastric acid, ghrelin may be related to acid secretion during fasting period or at night. However, further studies are needed to elucidate the physiological role of ghrelin in acid secretion.

  4. Coupling Effect of Double Lungs on a VCV Ventilator with Automatic Secretion Clearance Function.

    Science.gov (United States)

    Shi, Yan; Zhang, Bolun; Cai, Maolin; Xu, Weiqing

    2017-02-16

    For patients with mechanical ventilation, secretions in airway are harmful and sometimes even mortal, it's of great significance to clear secretion timely and efficiently. In this paper, a new secretion clearance method for VCV (volume-controlled ventilation) ventilator is put forward, and a secretion clearance system with a VCV ventilator and double lungs is designed. Furthermore, the mathematical model of the secretion clearance system is built and verified via experimental study. Finally, to illustrate the influence of key parameters of respiratory system and secretion clearance system on the secretion clearance characteristics, coupling effects of two lungs on VCV secretion clearance system are studied by an orthogonal experiment, it can be obtained that rise of tidal volume adds to efficiency of secretion clearance while effect of area, compliance and suction pressure on efficiency of secretion clearance needs further study. Rise of compliance improves bottom pressure of secretion clearance while rise of area, tidal volume and suction pressure decreases bottom pressure of secretion clearance. This paper can be referred to in researches of secretion clearance for VCV.

  5. Key-rate enhancement using qutrit states for quantum key distribution with askew aligned sources

    Science.gov (United States)

    Jo, Yonggi; Son, Wonmin

    2016-11-01

    It is known that measurement-device-independent quantum key distribution (MDI-QKD) provides ultimate security from all types of side-channel attack on detectors at the expense of low key rate. In the present study, we propose MDI-QKD using three-dimensional quantum states and show that the protocol improves the secret key rate under the analysis of mismatched-basis statistics. Specifically, we analyze security of the 3 d -MDI-QKD protocol with askew aligned sources, meaning that the original sources contain unwanted states instead of the expected one. We evaluate the secret key rate of the protocol and identify the regime in which the key rate is higher than the protocol with the qubit MDI-QKD.

  6. On Converting Secret Sharing Scheme to Visual Secret Sharing Scheme

    Directory of Open Access Journals (Sweden)

    Wang Daoshun

    2010-01-01

    Full Text Available Abstract Traditional Secret Sharing (SS schemes reconstruct secret exactly the same as the original one but involve complex computation. Visual Secret Sharing (VSS schemes decode the secret without computation, but each share is m times as big as the original and the quality of the reconstructed secret image is reduced. Probabilistic visual secret sharing (Prob.VSS schemes for a binary image use only one subpixel to share the secret image; however the probability of white pixels in a white area is higher than that in a black area in the reconstructed secret image. SS schemes, VSS schemes, and Prob. VSS schemes have various construction methods and advantages. This paper first presents an approach to convert (transform a -SS scheme to a -VSS scheme for greyscale images. The generation of the shadow images (shares is based on Boolean XOR operation. The secret image can be reconstructed directly by performing Boolean OR operation, as in most conventional VSS schemes. Its pixel expansion is significantly smaller than that of VSS schemes. The quality of the reconstructed images, measured by average contrast, is the same as VSS schemes. Then a novel matrix-concatenation approach is used to extend the greyscale -SS scheme to a more general case of greyscale -VSS scheme.

  7. RIC-7 promotes neuropeptide secretion.

    Directory of Open Access Journals (Sweden)

    Yingsong Hao

    2012-01-01

    Full Text Available Secretion of neurotransmitters and neuropeptides is mediated by exocytosis of distinct secretory organelles, synaptic vesicles (SVs and dense core vesicles (DCVs respectively. Relatively little is known about factors that differentially regulate SV and DCV secretion. Here we identify a novel protein RIC-7 that is required for neuropeptide secretion in Caenorhabditis elegans. The RIC-7 protein is expressed in all neurons and is localized to presynaptic terminals. Imaging, electrophysiology, and behavioral analysis of ric-7 mutants indicates that acetylcholine release occurs normally, while neuropeptide release is significantly decreased. These results suggest that RIC-7 promotes DCV-mediated secretion.

  8. Salmonella-secreted Virulence Factors

    Energy Technology Data Exchange (ETDEWEB)

    Heffron, Fred; Niemann, George; Yoon, Hyunjin; Kidwai, Afshan S.; Brown, Roslyn N.; McDermott, Jason E.; Smith, Richard D.; Adkins, Joshua N.

    2011-05-01

    In this short review we discuss secreted virulence factors of Salmonella, which directly affect Salmonella interaction with its host. Salmonella secretes protein to subvert host defenses but also, as discussed, to reduce virulence thereby permitting the bacteria to persist longer and more successfully disperse. The type III secretion system (TTSS) is the best known and well studied of the mechanisms that enable secretion from the bacterial cytoplasm to the host cell cytoplasm. Other secretion systems include outer membrane vesicles, which are present in all Gram-negative bacteria examined to date, two-partner secretion, and type VI secretion will also be addressed. Excellent reviews of Salmonella secreted effectors have focused on themes such as actin rearrangements, vesicular trafficking, ubiquitination, and the activities of the virulence factors themselves. This short review is based on S. Typhimurium infection of mice because it is a model of typhoid like disease in humans. We have organized effectors in terms of events that happen during the infection cycle and how secreted effectors may be involved.

  9. Multiple-Access Quantum Key Distribution Networks

    CERN Document Server

    Razavi, Mohsen

    2011-01-01

    This paper addresses multi-user quantum key distribution networks, in which any two users can mutually exchange a secret key without trusting any other nodes. The same network also supports conventional classical communications by assigning two different wavelength bands to quantum and classical signals. Time and code division multiple access (CDMA) techniques, within a passive star network, are considered. In the case of CDMA, it turns out that the optimal performance is achieved at a unity code weight. A listen-before-send protocol is then proposed to improve secret key generation rates in this case. Finally, a hybrid setup with wavelength routers and passive optical networks, which can support a large number of users, is considered and analyzed.

  10. A Public Secret

    DEFF Research Database (Denmark)

    Bregnbæk, Susanne

    2011-01-01

    This article is based on anthropological fieldwork undertaken at two elite universities in Beijing. It addresses the paradoxical situation of the many instances of suicide among Chinese elite university students in Beijing, which constitute a public secret. The pressure of education weighs heavily...... on the shoulders of China’s only child in each family, known as the generation of little emperors and little empresses. Since the 1980s, the suzhi jiaoyu reforms (education for quality) have involved various attempts to reduce the pressure of education. However, simultaneously the aim is to increase...... the competitiveness of individuals. Drawing on existential and phenomenological thought, I suggest that the discourse seems to objectify and quantify a concern for well-being, rather than recognising its intersubjective character. Finally, I argue that the suicides are controversial since they are seen as a form...

  11. ROCKing cytokine secretion balance in human T cells.

    Science.gov (United States)

    Zanin-Zhorov, Alexandra; Waksal, Samuel D

    2015-04-01

    Balanced regulation of cytokine secretion in T cells is critical for maintenance of immune homeostasis and prevention of autoimmunity. The Rho-associated kinase (ROCK) 2 signaling pathway was previously shown to be involved in controlling of cellular movement and shape. However, recent work from our group and others has demonstrated a new and important role of ROCK2 in regulating cytokine secretion in T cells. We found that ROCK2 promotes pro-inflammatory cytokines such as IL-17 and IL-21, whereas IL-2 and IL-10 secretion are negatively regulated by ROCK2 under Th17-skewing activation. Also, in disease, but not in steady state conditions, ROCK2 contributes to regulation of IFN-γ secretion in T cells from rheumatoid arthritis patients. Thus, ROCK2 signaling is a key pathway in modulation of T-cell mediated immune responses underscoring the therapeutic potential of targeted inhibition of ROCK2 in autoimmunity.

  12. Microfluidic Devices for the Measurement of Cellular Secretion

    Science.gov (United States)

    Schrell, Adrian M.; Mukhitov, Nikita; Yi, Lian; Wang, Xue; Roper, Michael G.

    2016-06-01

    The release of chemical information from cells and tissues holds the key to understanding cellular behavior and dysfunction. The development of methodologies that can measure cellular secretion in a time-dependent fashion is therefore essential. Often these measurements are made difficult by the high-salt conditions of the cellular environment, the presence of numerous other secreted factors, and the small mass samples that are produced when frequent sampling is used to resolve secretory dynamics. In this review, the methods that we have developed for measuring hormone release from islets of Langerhans are dissected to illustrate the practical difficulties of studying cellular secretions. Other methods from the literature are presented that provide alternative approaches to particularly challenging areas of monitoring cellular secretion. The examples presented in this review serve as case studies and should be adaptable to other cell types and systems for unique applications.

  13. Numerical approach for unstructured quantum key distribution

    Science.gov (United States)

    Coles, Patrick J.; Metodiev, Eric M.; Lütkenhaus, Norbert

    2016-05-01

    Quantum key distribution (QKD) allows for communication with security guaranteed by quantum theory. The main theoretical problem in QKD is to calculate the secret key rate for a given protocol. Analytical formulas are known for protocols with symmetries, since symmetry simplifies the analysis. However, experimental imperfections break symmetries, hence the effect of imperfections on key rates is difficult to estimate. Furthermore, it is an interesting question whether (intentionally) asymmetric protocols could outperform symmetric ones. Here we develop a robust numerical approach for calculating the key rate for arbitrary discrete-variable QKD protocols. Ultimately this will allow researchers to study `unstructured' protocols, that is, those that lack symmetry. Our approach relies on transforming the key rate calculation to the dual optimization problem, which markedly reduces the number of parameters and hence the calculation time. We illustrate our method by investigating some unstructured protocols for which the key rate was previously unknown.

  14. Yohimbine increases human salivary secretion.

    Science.gov (United States)

    Chatelut, E; Rispail, Y; Berlan, M; Montastruc, J L

    1989-01-01

    The effect of oral yohimbine (14 mg) on salivary secretion was evaluated in healthy volunteers. Yohimbine significantly increased salivary secretion when compared with placebo. This effect was significant from 60 min until 180 min after administration under our experimental conditions. Yohimbine (or alpha 2-adrenoceptor blocking agents) could have a potential interest in the treatment of dry mouths. PMID:2789932

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

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

  17. Time-cost analysis of a quantum key distribution system clocked at 100 MHz

    CERN Document Server

    Mo, Xiaofan; Chan, Philip; Healey, Chris; Hosier, Steve; Tittel, Wolfgang

    2011-01-01

    We describe the realization of a quantum key distribution (QKD) system clocked at 100 MHz. The system includes classical postprocessing implemented via software, and is operated over a 12 km standard telecommunication dark fiber in a real-world environment. A time-cost analysis of the sifted, error-corrected, and secret key rates relative to the raw key rate is presented, and the scalability of our implementation with respect to higher secret key rates is discussed.

  18. Three-party authenticated key agreements for optimal communication.

    Science.gov (United States)

    Lee, Tian-Fu; Hwang, Tzonelih

    2017-01-01

    Authenticated key agreements enable users to determine session keys, and to securely communicate with others over an insecure channel via the session keys. This study investigates the lower bounds on communications for three-party authenticated key agreements and considers whether or not the sub-keys for generating a session key can be revealed in the channel. Since two clients do not share any common secret key, they require the help of the server to authenticate their identities and exchange confidential and authenticated information over insecure networks. However, if the session key security is based on asymmetric cryptosystems, then revealing the sub-keys cannot compromise the session key. The clients can directly exchange the sub-keys and reduce the transmissions. In addition, authenticated key agreements were developed by using the derived results of the lower bounds on communications. Compared with related approaches, the proposed protocols had fewer transmissions and realized the lower bounds on communications.

  19. Pheochromocytomas and secreting paragangliomas

    Directory of Open Access Journals (Sweden)

    Gimenez-Roqueplo Anne-Paule

    2006-12-01

    Full Text Available Abstract Catecholamine-producing tumors may arise in the adrenal medulla (pheochromocytomas or in extraadrenal chromaffin cells (secreting paragangliomas. Their prevalence is about 0.1% in patients with hypertension and 4% in patients with a fortuitously discovered adrenal mass. An increase in the production of catecholamines causes symptoms (mainly headaches, palpitations and excess sweating and signs (mainly hypertension, weight loss and diabetes reflecting the effects of epinephrine and norepinephrine on α- and β-adrenergic receptors. Catecholamine-producing tumors mimic paroxysmal conditions with hypertension and/or cardiac rhythm disorders, including panic attacks, in which sympathetic activation linked to anxiety reproduces the same signs and symptoms. These tumors may be sporadic or part of any of several genetic diseases: familial pheochromocytoma-paraganglioma syndromes, multiple endocrine neoplasia type 2, neurofibromatosis 1 and von Hippel-Lindau disease. Familial cases are diagnosed earlier and are more frequently bilateral and recurring than sporadic cases. The most specific and sensitive diagnostic test for the tumor is the determination of plasma or urinary metanephrines. The tumor can be located by computed tomography, magnetic resonance imaging and metaiodobenzylguanidine scintigraphy. Treatment requires resection of the tumor, generally by laparoscopic surgery. About 10% of tumors are malignant either at first operation or during follow-up, malignancy being diagnosed by the presence of lymph node, visceral or bone metastases. Recurrences and malignancy are more frequent in cases with large or extraadrenal tumors. Patients, especially those with familial or extraadrenal tumors, should be followed-up indefinitely.

  20. Ergodic Secret Alignment

    CERN Document Server

    Bassily, Raef

    2010-01-01

    In this paper, we introduce two new achievable schemes for the fading multiple access wiretap channel (MAC-WT). In the model that we consider, we assume that perfect knowledge of the state of all channels is available at all the nodes in a causal fashion. Our schemes use this knowledge together with the time varying nature of the channel model to align the interference from different users at the eavesdropper perfectly in a one-dimensional space while creating a higher dimensionality space for the interfering signals at the legitimate receiver hence allowing for better chance of recovery. While we achieve this alignment through signal scaling at the transmitters in our first scheme (scaling based alignment (SBA)), we let nature provide this alignment through the ergodicity of the channel coefficients in the second scheme (ergodic secret alignment (ESA)). For each scheme, we obtain the resulting achievable secrecy rate region. We show that the secrecy rates achieved by both schemes scale with SNR as 1/2log(SNR...

  1. Practical free-space quantum key distribution over 1 km

    CERN Document Server

    Buttler, W T; Kwiat, P G; Lamoreaux, S K; Luther, G G; Morgan, G L; Nordholt, J E; Peterson, C G; Simmons, C M

    1998-01-01

    A working free-space quantum key distribution (QKD) system has been developed and tested over an outdoor optical path of ~1 km at Los Alamos National Laboratory under nighttime conditions. Results show that QKD can provide secure real-time key distribution between parties who have a need to communicate secretly. Finally, we examine the feasibility of surface to satellite QKD.

  2. Quantum Encryption Minimising Key Leakage under Known Plaintext Attacks

    DEFF Research Database (Denmark)

    Pedersen, Thomas Brochmann

    2006-01-01

    In this dissertation we show how, by using a quantum channel, we can get more unconditionally secret communication with a symmetric key under known plaintext attacks. In unconditionally secret encryption schemes the key is necessarily an expensive resource since it cannot safely be reused for more......, or interactive encryption schemes, where the interaction does not need to occur online. In our model we show that the amount of key leaked under a known plaintext attack can be made arbitrarily small even in non-interactive encryption schemes. We also give an encryption scheme where eavesdropping can be detected...

  3. Distributed public key schemes secure against continual leakage

    DEFF Research Database (Denmark)

    Akavia, Adi; Goldwasser, Shafi; Hazay, Carmit

    2012-01-01

    In this work we study distributed public key schemes secure against continual memory leakage. The secret key will be shared among two computing devices communicating over a public channel, and the decryption operation will be computed by a simple 2-party protocol between the devices. Similarly...... the value of the respective function on the internal state of the respective device (namely, on its secret share, internal randomness, and results of intermediate computations). We present distributed public key encryption (DPKE) and distributed identity based encryption (DIBE) schemes that are secure...

  4. Helicobacter pylori in lacrimal secretions.

    Science.gov (United States)

    Batioglu-Karaaltin, Aysegul; Saatci, Ozlem; Akpinar, Meltem; Celik, Melih Ozgür; Develioglu, Omer; Yigit, Ozgur; Külekçi, Mehmet; Akarsubaşı, Alper Tunga

    2016-03-01

    The aim of this study was to investigate the presence of Helicobacter pylori in human lacrimal and nasal secretions. Eighty patients with complaints of dyspepsia who had undergone endoscopies and gastric antrum biopsies were included in the study. A total of five specimens, including 2 lacrimal secretion samples, 2 nasal mucosal swab samples, and 1 gastric antrum biopsy, were collected from each patient and investigated with polymerase chain reaction (PCR) methods consisting of the urease enzyme coding gene GlmM (UreC) and the H pylori-specific 16S rRNA coding gene. The Reflux Symptom Index and ophthalmologic complaints of the patients were recorded. The detected positivity rates of the H pylori 16S rRNA coding gene in gastric biopsies and nasal mucous and lacrimal secretions were 55, 11.2, and 20%, respectively. The patients were grouped as gastric-antrum-biopsy-negative (Group I [n = 36]) and -positive (Group II [n = 44). In Group II, H pylori positivity in the lacrimal and nasal mucous secretions was 36.3 and 18%, respectively. A comparison between the groups in terms of H pylori presence in nasal mucous and lacrimal secretions yielded statistically significant differences (p = 0.0001, p = 0.003). The simultaneous presence of H pylori in nasal mucous and lacrimal secretions was 13.6% in Group II. H pylori positivity in nasal mucous and lacrimal secretions had a positive moderate correlation (r = 0.40; p = 0.0003). The present study is the first report on the presence of H pylori in lacrimal secretions through nested PCR, which suggested the presence of a number of mechanisms for H pylori transmission to lacrimal secretions.

  5. Characterization of a secreted Chlamydia protease

    DEFF Research Database (Denmark)

    Shaw, Allan C; Vandahl, Brian; Larsen, Martin Røssel

    2002-01-01

    Chlamydiae are obligate intracellular bacteria that are important human pathogens. The Chlamydia genomes contain orthologues to secretion apparatus proteins from other intracellular bacteria, but only a few secreted proteins have been identified. Most likely, effector proteins are secreted in ord...

  6. Ghrelin and gastric acid secretion

    OpenAIRE

    Yakabi, Koji; Kawashima, Junichi; Kato, Shingo

    2008-01-01

    Ghrelin, a novel growth hormone-releasing peptide, was originally isolated from rat and human stomach. Ghrelin has been known to increase the secretion of growth hormone (GH), food intake, and body weight gain when administered peripherally or centrally. Ghrelin is also known to stimulate the gastric motility and the secretion of gastric acid. In the previous studies, the action of ghrelin on acid secretion was shown to be as strong as that of histamine and gastrin in in-vivo experiment. In t...

  7. Role of calcium signaling in epithelial bicarbonate secretion.

    Science.gov (United States)

    Jung, Jinsei; Lee, Min Goo

    2014-06-01

    Transepithelial bicarbonate secretion plays a key role in the maintenance of fluid and protein secretion from epithelial cells and the protection of the epithelial cell surface from various pathogens. Epithelial bicarbonate secretion is mainly under the control of cAMP and calcium signaling. While the physiological roles and molecular mechanisms of cAMP-induced bicarbonate secretion are relatively well defined, those induced by calcium signaling remain poorly understood in most epithelia. The present review summarizes the current status of knowledge on the role of calcium signaling in epithelial bicarbonate secretion. Specifically, this review introduces how cytosolic calcium signaling can increase bicarbonate secretion by regulating membrane transport proteins and how it synergizes with cAMP-induced mechanisms in epithelial cells. In addition, tissue-specific variations in the pancreas, salivary glands, intestines, bile ducts, and airways are discussed. We hope that the present report will stimulate further research into this important topic. These studies will provide the basis for future medicines for a wide spectrum of epithelial disorders including cystic fibrosis, Sjögren's syndrome, and chronic pancreatitis.

  8. The New Enhanced Simple Authenticated Key Agreement Algorithm

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Simple authenticated key agreement algorithm is one of the Diffie-Hellman key agreement variations. It prevents man-inthe-middle attack with only two more packets required to agree on the secret session key, but it has some weaknesses. In this paper, a new enhanced simple authenticated key agreement algorithm is proposed to overcome these weaknesses on the basis of analyzing the weaknesses of the related protocols. The new enhanced simple authenticated key agreement algorithm can get over replay attack and password guessing attack, provide perfect forward secrecy, and hold the merits of the simple authenticated key agreement algorithm.

  9. An Image Secret Sharing Method

    Science.gov (United States)

    2006-07-01

    M. E. Hellman, “On secret sharing systems,” vol. IT-29, no. 1, pp. 35–41, Jan. 1983. [10] K. Kurosawa , K. Okada, K. Sakano, W. Ogata, and S. Tsujii...Ed., Berlin, Germany, 1994, pp. 1–12. [14] W. Ogata and K. Kurosawa , “Some ba- sic properties of general nonperfect secret sharing schemes,” J.UCS

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

  11. Multi-group dynamic quantum secret sharing with single photons

    Science.gov (United States)

    Liu, Hongwei; Ma, Haiqiang; Wei, Kejin; Yang, Xiuqing; Qu, Wenxiu; Dou, Tianqi; Chen, Yitian; Li, Ruixue; Zhu, Wu

    2016-07-01

    In this letter, we propose a novel scheme for the realization of single-photon dynamic quantum secret sharing between a boss and three dynamic agent groups. In our system, the boss can not only choose one of these three groups to share the secret with, but also can share two sets of independent keys with two groups without redistribution. Furthermore, the security of communication is enhanced by using a control mode. Compared with previous schemes, our scheme is more flexible and will contribute to a practical application.

  12. Unsymmetrical Quantum Key Distribution Using Tripartite Entanglement

    Institute of Scientific and Technical Information of China (English)

    XIONG Jin; ZHANG Zhe-Shen; ZHOU Nan-Run; PENG Jin-Ye; ZENG Gui-Hua

    2007-01-01

    An unsymmetrical quantum key distribution protocol is proposed,in which Greenberger-Horne-Zeilinger (GHZ) triplet states are used to obtain the secret key.Except the lost qubits due to the unperfectness of the physical devices,the unsymmetrical characteristic makes all transmitted qubits useful.This leads to an excellent efficiency,which reaches 100% in an ideal case.The security is studied from the aspect of information theory.By using the correlation of the GHZ tripartite entanglement state,eavesdropping can be easily checked out,which indicates that the presented protocol is more secure.

  13. Bacillus cereus cytotoxins Hbl, Nhe and CytK are secreted via the Sec translocation pathway

    Directory of Open Access Journals (Sweden)

    Lindbäck Toril

    2010-11-01

    Full Text Available Abstract Background Bacillus cereus and the closely related Bacillus thuringiensis are Gram positive opportunistic pathogens that may cause food poisoning, and the three secreted pore-forming cytotoxins Hbl, Nhe and CytK have been implicated as the causative agents of diarrhoeal disease. It has been proposed that the Hbl toxin is secreted using the flagellar export apparatus (FEA despite the presence of Sec-type signal peptides. As protein secretion is of key importance in virulence of a microorganism, the mechanisms by which these toxins are secreted were further investigated. Results Sec-type signal peptides were identified in all toxin components, and secretion of Hbl component B was shown to be dependent on an intact Sec-type signal peptide sequence. Further indication that secretion of Hbl, Nhe and CytK is dependent on the Sec translocation pathway, the main pathway on which bacterial secretion relies, was suggested by the observed intracellular accumulation and reduced secretion of the toxins in cultures supplemented with the SecA inhibitor sodium azide. Although a FEA deficient strain (a flhA mutant showed reduced toxin expression and reduced cytotoxicity, it readily secreted overexpressed Hbl B, showing that the FEA is not required for Hbl secretion. Thus, the concurrent lack of flagella and reduced toxin secretion in the FEA deficient strain may point towards the presence of a regulatory link between motility and virulence genes, rather than FEA-dependent toxin secretion. Conclusions The Hbl, Nhe and CytK toxins appear to be secreted using the Sec pathway, and the reduced Hbl expression of a FEA deficient strain was shown not to be due to a secretion defect.

  14. A System-Level Throughput Model for Quantum Key Distribution

    Science.gov (United States)

    2015-09-17

    quantum mechanics to generate and distribute shared secret keying material. QKD systems generate and distribute key by progressing through a number of...communicate a seed to prime random number generation to construct a very large matrix used in the calculation of Privacy Amplification. We assume that... generate a desired number of final key bits. RQ7: What are the implications of altering the amount of Alice’s memory allocated for Quantum Exchange

  15. Authenticated quantum secret sharing with quantum dialogue based on Bell states

    Science.gov (United States)

    Abulkasim, Hussein; Hamad, Safwat; El Bahnasy, Khalid; Rida, Saad Z.

    2016-08-01

    This work proposes a scheme that combines the advantages of a quantum secret sharing procedure and quantum dialogue. The proposed scheme enables the participants to simultaneously make mutual identity authentications, in a simulated scenario where the boss, Alice, shares a secret with her two agents Bob and Charlie. The secret is protected by checking photons to keep untrustworthy agents and outer attacks from getting useful information. Before the two agents cooperate to recover Alice’s secret, they must authenticate their identity using parts of a pre-shared key. In addition, the whole pre-shared key is reused as part of recovering the secret data to avoid any leaks of information. In comparison with previous schemes, the proposed method can efficiently detect eavesdropping and it is free from information leaks. Furthermore, the proposed scheme proved to be secure against man-in-the-middle attacks, impersonation attacks, entangled-and-measure attacks, participant attacks, modification attacks and Trojan-horse attacks.

  16. Architecture of the major component of the type III secretion system export apparatus.

    Science.gov (United States)

    Abrusci, Patrizia; Vergara-Irigaray, Marta; Johnson, Steven; Beeby, Morgan D; Hendrixson, David R; Roversi, Pietro; Friede, Miriam E; Deane, Janet E; Jensen, Grant J; Tang, Christoph M; Lea, Susan M

    2013-01-01

    Type III secretion systems (T3SSs) are bacterial membrane-embedded nanomachines designed to export specifically targeted proteins from the bacterial cytoplasm. Secretion through T3SS is governed by a subset of inner membrane proteins termed the 'export apparatus'. We show that a key member of the Shigella flexneri export apparatus, MxiA, assembles into a ring essential for secretion in vivo. The ring-forming interfaces are well-conserved in both nonflagellar and flagellar homologs, implying that the ring is an evolutionarily conserved feature in these systems. Electron cryo-tomography revealed a T3SS-associated cytoplasmic torus of size and shape corresponding to those of the MxiA ring aligned to the secretion channel located between the secretion pore and the ATPase complex. This defines the molecular architecture of the dominant component of the export apparatus and allows us to propose a model for the molecular mechanisms controlling secretion.

  17. Interactive simulations for quantum key distribution

    CERN Document Server

    Kohnle, Antje

    2016-01-01

    Secure communication protocols are becoming increasingly important, e.g. for internet-based communication. Quantum key distribution allows two parties, commonly called Alice and Bob, to generate a secret sequence of 0s and 1s called a key that is only known to themselves. Classically, Alice and Bob could never be certain that their communication was not compromised by a malicious eavesdropper. Quantum mechanics however makes secure communication possible. The fundamental principle of quantum mechanics that taking a measurement perturbs the system (unless the measurement is compatible with the quantum state) also applies to an eavesdropper. Using appropriate protocols to create the key, Alice and Bob can detect the presence of an eavesdropper by errors in their measurements. As part of the QuVis Quantum Mechanics Visualization Project, we have developed a suite of four interactive simulations that demonstrate the basic principles of three different quantum key distribution protocols. The simulations use either...

  18. A String-Based Public Key Cryptosystem

    CERN Document Server

    Andrecut, M

    2014-01-01

    Traditional public key cryptography is based on number theory, and suffers from problems such as dealing with very large numbers and large prime numbers, making key creation cumbersome. Here, we propose a new public key cryptosystem based on strings only, which avoids the difficulties of the traditional number theory approach. The security mechanism for generating public and secret keys is ensured by a recursive encoding mechanism embedded in a quasi-commutative-random function, resulted from the composition of a quasi-commutative function with a pseudo-random function. Due to the inherent construction algorithm of the the proposed cryptosystem, the resulted mathematical inversion problem is likely to be harder than the classical discrete logarithm or integer factorization problems. Furthermore, the proposed cryptosystem is immune against the known quantum algorithm attacks.

  19. Finite key analysis in quantum cryptography

    Energy Technology Data Exchange (ETDEWEB)

    Meyer, T.

    2007-10-31

    In view of experimental realization of quantum key distribution schemes, the study of their efficiency becomes as important as the proof of their security. The latter is the subject of most of the theoretical work about quantum key distribution, and many important results such as the proof of unconditional security have been obtained. The efficiency and also the robustness of quantum key distribution protocols against noise can be measured by figures of merit such as the secret key rate (the fraction of input signals that make it into the key) and the threshold quantum bit error rate (the maximal error rate such that one can still create a secret key). It is important to determine these quantities because they tell us whether a certain quantum key distribution scheme can be used at all in a given situation and if so, how many secret key bits it can generate in a given time. However, these figures of merit are usually derived under the ''infinite key limit'' assumption, that is, one assumes that an infinite number of quantum states are send and that all sub-protocols of the scheme (in particular privacy amplification) are carried out on these infinitely large blocks. Such an assumption usually eases the analysis, but also leads to (potentially) too optimistic values for the quantities in question. In this thesis, we are explicitly avoiding the infinite key limit for the analysis of the privacy amplification step, which plays the most important role in a quantum key distribution scheme. We still assume that an optimal error correction code is applied and we do not take into account any statistical errors that might occur in the parameter estimation step. Renner and coworkers derived an explicit formula for the obtainable key rate in terms of Renyi entropies of the quantum states describing Alice's, Bob's, and Eve's systems. This results serves as a starting point for our analysis, and we derive an algorithm that efficiently computes

  20. Key Management Using Certificate-Based Cryptosystem in Ad Hoc Networks

    Institute of Scientific and Technical Information of China (English)

    LI Fa-gen; GAO Jun-tao; LIU Shuang-gen; HU Yu-pu

    2006-01-01

    This paper proposed a distributed key management approach by using the recently developed concepts of certificate-based cryptosystem and threshold secret sharing schemes. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a self-organizing way to provide the key generation and key management services using threshold secret sharing schemes, which effectively solves the problem of single point of failure. The proposed approach combines the best aspects of identity-based key management approaches (implicit certification) and traditional public key infrastructure approaches (no key escrow).

  1. Hiding Secret Information in Movie Clip: A Steganographic Approach

    CERN Document Server

    Sahoo, G

    2011-01-01

    Establishing hidden communication is an important subject of discussion that has gained increasing importance nowadays with the development of the internet. One of the key methods for establishing hidden communication is steganography. Modern day steganography mainly deals with hiding information within files like image, text, html, binary files etc. These file contains small irrelevant information that can be substituted for small secret data. To store a high capacity secret data these carrier files are not very supportive. To overcome the problem of storing the high capacity secret data with the utmost security fence, we have proposed a novel methodology for concealing a voluminous data with high levels of security wall by using movie clip as a carrier file.

  2. Secret Sharing over Fast-Fading MIMO Wiretap Channels

    Directory of Open Access Journals (Sweden)

    Bloch Matthieu

    2009-01-01

    Full Text Available Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of an eavesdropper who also makes channel observations that are different from but correlated to those made by the destination. An interactive, authenticated public channel with unlimited capacity is available to the source and destination for the secret sharing process. This situation is a special case of the "channel model with wiretapper" considered by Ahlswede and Csiszár. An extension of their result to continuous channel alphabets is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and eavesdropper are then investigated.

  3. CSK BASED SECRET COMMUNICATION

    Directory of Open Access Journals (Sweden)

    N.R.Raajan

    2013-04-01

    Full Text Available The notion of non-linear dynamics has become an energetic and fashionable field of work that is having a thoughtful effect on a wide variety of topics in present day technology. One such evolution of non-linear dynamics is the chaos theory. It is not about disorder, rather is about very complicated systems of order. However, the point of interest lies in bridging the gap between random nature of chaoticsignals and the demanding needs of Information safety. Hence, Safety via ambiguity is employed to ensure correct and complete transaction of data. A good solution to bring ambiguity is to materialize themessage signal as unsystematic information. Consequently, Safety via ambiguity is resolved by a technique called Chaos shift keying. The technique is all about replacing one’s and zero’s of the messagesignal by the chaotic signals. The simulated results and future scope are discussed. It has been found that CSK modulated waveform looks exactly like a wideband noise. Hence even if a third party tries to hack the system, nobody can be able to judge any significant information is present or not.

  4. Thyroid hormones and renin secretion.

    Science.gov (United States)

    Ganong, W F

    Circulating angiotensin is produced by the action of renin from the kidneys on circulating angiotensinogen. There are other renin-angiotensin systems in various organs in the body, and recent observations raise the intriguing possibility that angiotensin II is produced by a totally intracellular pathway in the juxtaglomerular cells, the gonadotrops of the anterior pituitary, neurons, in the brain, salivary duct cells, and neuroblastoma cells. Circulating angiotensin II levels depend in large part on the plasma concentration of angiotensinogen, which is hormonally regulated, and on the rate of renin secretion. Renin secretion is regulated by an intrarenal baroreceptor mechanism, a macula densa mechanism, angiotensin II, vasopressin, and the sympathetic nervous system. The increase in renin secretion produced by sympathetic discharge is mediated for the most part by beta-adrenergic receptors, which are probably located on the juxtaglomerular cells. Hyperthyroidism would be expected to be associated with increased renin secretion in view of the increased beta-adrenergic activity in this condition, and hypothyroidism would be associated with decreased plasma renin activity due to decreased beta-adrenergic activity. Our recent research on serotonin-mediated increases in renin secretion that depend on the integrity of the dorsal raphe nucleus and the mediobasal hypothalamus has led us to investigate the effect of the pituitary on the renin response to p-chloroamphetamine. The response is potentiated immediately after hypophysectomy, but 22 days after the operation, it is abolished. This slowly developing decrease in responsiveness may be due to decreased thyroid function.

  5. On the new member's subsecret distribution protocol in dynamic group secret-sharing

    Institute of Scientific and Technical Information of China (English)

    LI Cheng; WANG Wei-nong

    2005-01-01

    Secret-sharing is a common method to protect important data, such as the private key of a public-key system. Dynamic Group Secret-sharing (DGS) is a system where all of the members in a group hold a subsecret of the key information and where the number of members in the group is variable. This kind of secret-sharing is broadly used in many special distribution systems, such as Self-secure Ad-hoc Network. Distributing this subsecret to a new member when he enters the group is the common method that ensures all the members participate in the same secret-sharing. However, no' atisfactory subsecret distribution scheme exists at present. This paper proposes a new protocol that tries to satisfy both security and efficiency.

  6. Chocolate Key Cryptography

    Science.gov (United States)

    Bachman, Dale J.; Brown, Ezra A.; Norton, Anderson H.

    2010-01-01

    Cryptography is the science of hidden or secret writing. More generally, cryptography refers to the science of safeguarding information. Cryptography allows people to use a public medium such as the Internet to transmit private information securely, thus enabling a whole range of conveniences, from online shopping to personally printed movie…

  7. Chocolate Key Cryptography

    Science.gov (United States)

    Bachman, Dale J.; Brown, Ezra A.; Norton, Anderson H.

    2010-01-01

    Cryptography is the science of hidden or secret writing. More generally, cryptography refers to the science of safeguarding information. Cryptography allows people to use a public medium such as the Internet to transmit private information securely, thus enabling a whole range of conveniences, from online shopping to personally printed movie…

  8. On family secrets and -K.

    Science.gov (United States)

    Orgad, Yariv

    2014-08-01

    In this paper I present a novel interpretation of family secrets. Leaning on Bion's concept of -K, the constitution of secrecy is interpreted in terms of family dynamics that actively prevent knowledge formation and mental growth. Family secrets are interpreted as a destructive process that attacks the family's truth-generating-space - the shared semiotic space within which meanings are constituted through family relationships. The paper explores the microstructure interpersonal process of -K through the analysis of Mike Leigh's movie, Secrets and Lies. Two scenes in the movie are used to demonstrate how -K is worked out in the form of a specific intersubjective semiotic endeavor that unconsciously blocks the process of meaning-making.

  9. An information theoretic approach for privacy metrics

    Directory of Open Access Journals (Sweden)

    Michele Bezzi

    2010-12-01

    Full Text Available Organizations often need to release microdata without revealing sensitive information. To this scope, data are anonymized and, to assess the quality of the process, various privacy metrics have been proposed, such as k-anonymity, l-diversity, and t-closeness. These metrics are able to capture different aspects of the disclosure risk, imposing minimal requirements on the association of an individual with the sensitive attributes. If we want to combine them in a optimization problem, we need a common framework able to express all these privacy conditions. Previous studies proposed the notion of mutual information to measure the different kinds of disclosure risks and the utility, but, since mutual information is an average quantity, it is not able to completely express these conditions on single records. We introduce here the notion of one-symbol information (i.e., the contribution to mutual information by a single record that allows to express and compare the disclosure risk metrics. In addition, we obtain a relation between the risk values t and l, which can be used for parameter setting. We also show, by numerical experiments, how l-diversity and t-closeness can be represented in terms of two different, but equally acceptable, conditions on the information gain..

  10. Landscape habitat diversity: An information theoretic measure

    Energy Technology Data Exchange (ETDEWEB)

    Loehle, C. [Argonne National Lab., IL (United States); Wein, G. [Memphis State Univ., TN (United States). Dept. of Biology

    1994-06-01

    Biotic diversity is a topic of increasing concern, but current tools for quantifying diversity at the landscape level are inadequate. A new index is proposed. Beginning with a classified raster image of a landscape, each habitat type is assigned a value based on an ordination axis distance. The change in value from one patch to the next depends on how similar the two patches are. An information measure d{sub I} is used to evaluate deviation from uniformity of the ordination values at different scales. Different areas can be compared if habitat values are based on the same ordination scale. This new method provides a powerful tool for both displaying and calculating landscape habitat diversity.

  11. Information theoretic regularization in diffuse optical tomography.

    Science.gov (United States)

    Panagiotou, Christos; Somayajula, Sangeetha; Gibson, Adam P; Schweiger, Martin; Leahy, Richard M; Arridge, Simon R

    2009-05-01

    Diffuse optical tomography (DOT) retrieves the spatially distributed optical characteristics of a medium from external measurements. Recovering the parameters of interest involves solving a nonlinear and highly ill-posed inverse problem. This paper examines the possibility of regularizing DOT via the introduction of a priori information from alternative high-resolution anatomical modalities, using the information theory concepts of mutual information (MI) and joint entropy (JE). Such functionals evaluate the similarity between the reconstructed optical image and the prior image while bypassing the multimodality barrier manifested as the incommensurate relation between the gray value representations of corresponding anatomical features in the two modalities. By introducing structural information, we aim to improve the spatial resolution and quantitative accuracy of the solution. We provide a thorough explanation of the theory from an imaging perspective, accompanied by preliminary results using numerical simulations. In addition we compare the performance of MI and JE. Finally, we have adopted a method for fast marginal entropy evaluation and optimization by modifying the objective function and extending it to the JE case. We demonstrate its use on an image reconstruction framework and show significant computational savings.

  12. Vector-Quantization using Information Theoretic Concepts

    DEFF Research Database (Denmark)

    Lehn-Schiøler, Tue; Hegde, Anant; Erdogmus, Deniz

    2005-01-01

    The process of representing a large data set with a smaller number of vectors in the best possible way, also known as vector quantization, has been intensively studied in the recent years. Very efficient algorithms like the Kohonen Self Organizing Map (SOM) and the Linde Buzo Gray (LBG) algorithm...

  13. Information-theoretic metamodel of organizational evolution

    Science.gov (United States)

    Sepulveda, Alfredo

    2011-12-01

    Social organizations are abstractly modeled by holarchies---self-similar connected networks---and intelligent complex adaptive multiagent systems---large networks of autonomous reasoning agents interacting via scaled processes. However, little is known of how information shapes evolution in such organizations, a gap that can lead to misleading analytics. The research problem addressed in this study was the ineffective manner in which classical model-predict-control methods used in business analytics attempt to define organization evolution. The purpose of the study was to construct an effective metamodel for organization evolution based on a proposed complex adaptive structure---the info-holarchy. Theoretical foundations of this study were holarchies, complex adaptive systems, evolutionary theory, and quantum mechanics, among other recently developed physical and information theories. Research questions addressed how information evolution patterns gleamed from the study's inductive metamodel more aptly explained volatility in organization. In this study, a hybrid grounded theory based on abstract inductive extensions of information theories was utilized as the research methodology. An overarching heuristic metamodel was framed from the theoretical analysis of the properties of these extension theories and applied to business, neural, and computational entities. This metamodel resulted in the synthesis of a metaphor for, and generalization of organization evolution, serving as the recommended and appropriate analytical tool to view business dynamics for future applications. This study may manifest positive social change through a fundamental understanding of complexity in business from general information theories, resulting in more effective management.

  14. An information theoretic characterisation of auditory encoding.

    Directory of Open Access Journals (Sweden)

    Tobias Overath

    2007-10-01

    Full Text Available The entropy metric derived from information theory provides a means to quantify the amount of information transmitted in acoustic streams like speech or music. By systematically varying the entropy of pitch sequences, we sought brain areas where neural activity and energetic demands increase as a function of entropy. Such a relationship is predicted to occur in an efficient encoding mechanism that uses less computational resource when less information is present in the signal: we specifically tested the hypothesis that such a relationship is present in the planum temporale (PT. In two convergent functional MRI studies, we demonstrated this relationship in PT for encoding, while furthermore showing that a distributed fronto-parietal network for retrieval of acoustic information is independent of entropy. The results establish PT as an efficient neural engine that demands less computational resource to encode redundant signals than those with high information content.

  15. Fatty acid metabolism and insulin secretion in pancreatic beta cells.

    Science.gov (United States)

    Yaney, G C; Corkey, B E

    2003-10-01

    Increases in glucose or fatty acids affect metabolism via changes in long-chain acyl-CoA formation and chronically elevated fatty acids increase total cellular CoA. Understanding the response of pancreatic beta cells to increased amounts of fuel and the role that altered insulin secretion plays in the development and maintenance of obesity and Type 2 diabetes is important. Data indicate that the activated form of fatty acids acts as an effector molecule in stimulus-secretion coupling. Glucose increases cytosolic long-chain acyl-CoA because it increases the "switch" compound malonyl-CoA that blocks mitochondrial beta-oxidation, thus implementing a shift from fatty acid to glucose oxidation. We present arguments in support of the following: (i) A source of fatty acid either exogenous or endogenous (derived by lipolysis of triglyceride) is necessary to support normal insulin secretion; (ii) a rapid increase of fatty acids potentiates glucose-stimulated secretion by increasing fatty acyl-CoA or complex lipid concentrations that act distally by modulating key enzymes such as protein kinase C or the exocytotic machinery; (iii) a chronic increase of fatty acids enhances basal secretion by the same mechanism, but promotes obesity and a diminished response to stimulatory glucose; (iv) agents which raise cAMP act as incretins, at least in part, by stimulating lipolysis via beta-cell hormone-sensitive lipase activation. Furthermore, increased triglyceride stores can give higher rates of lipolysis and thus influence both basal and stimulated insulin secretion. These points highlight the important roles of NEFA, LC-CoA, and their esterified derivatives in affecting insulin secretion in both normal and pathological states.

  16. Group key management

    Energy Technology Data Exchange (ETDEWEB)

    Dunigan, T.; Cao, C.

    1997-08-01

    This report describes an architecture and implementation for doing group key management over a data communications network. The architecture describes a protocol for establishing a shared encryption key among an authenticated and authorized collection of network entities. Group access requires one or more authorization certificates. The implementation includes a simple public key and certificate infrastructure. Multicast is used for some of the key management messages. An application programming interface multiplexes key management and user application messages. An implementation using the new IP security protocols is postulated. The architecture is compared with other group key management proposals, and the performance and the limitations of the implementation are described.

  17. Efficient quantum secure communication with a publicly known key

    Institute of Scientific and Technical Information of China (English)

    Li Chun-Yan; Li Xi-Han; Deng Fu-Guo; Zhou Hong-Yu

    2008-01-01

    This paper presents a simple way for an eavesdropper to eavesdrop freely the secret message in the experimental realization of quantum communication protocol proposed by Beige et al (2002 Acta Phys. Pol. A 101 357). Moreover, it introduces an efficient quantum secure communication protocol based on a publicly known key with decoy photons and two biased bases by modifying the original protocol. The total efficiency of this new protocol is double that of the original one. With a low noise quantum channel, this protocol can be used for transmitting a secret message. At present, this protocol is good for generating a private key efficiently.

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

  19. Of Plants, and Other Secrets

    Directory of Open Access Journals (Sweden)

    Michael Marder

    2012-12-01

    Full Text Available In this article, I inquire into the reasons for the all-too-frequent association of plants and secrets. Among various hypotheses explaining this connection from the standpoint of plant morphology and physiology, the one that stands out is the idea that plants are not only objects in the natural environment, but also subjects with a peculiar mode of accessing the world. The core of the “plant enigma” is, therefore, onto-phenomenological. Positively understood, the secret of their subjectivity leaves just enough space for the self-expression and the self-interpretation of vegetal life.

  20. Targeting bacterial secretion systems: benefits of disarmament in the microcosm.

    Science.gov (United States)

    Baron, Christian; Coombes, Brian

    2007-03-01

    Secretion systems are used by many bacterial pathogens for the delivery of virulence factors to the extracellular space or directly into host cells. They are attractive targets for the development of novel anti-virulence drugs as their inactivation would lead to pathogen attenuation or avirulence, followed by clearance of the bacteria by the immune system. This review will present the state of knowledge on the assembly and function of type II, type III and type IV secretion systems in Gram-negative bacteria focusing on insights provided by structural analyses of several key components. The suitability of transcription factors regulating the expression of secretion system components and of ATPases, lytic transglycosylases and protein assembly factors as drug targets will be discussed. Recent progress using innovative in vivo as well as in vitro screening strategies led to a first set of secretion system inhibitors with potential for further development as anti-infectives. The discovery of such inhibitors offers exciting and innovative opportunities to further develop these anti-virulence drugs into monotherapy or in combination with classical antibiotics. Bacterial growth per se would not be inhibited by such drugs so that the selection for mutations causing resistance could be reduced. Secretion system inhibitors may therefore avoid many of the problems associated with classical antibiotics and may constitute a valuable addition to our arsenal for the treatment of bacterial infections.

  1. One-way quantum identity authentication based on public key

    Institute of Scientific and Technical Information of China (English)

    ZHANG XingLan

    2009-01-01

    Based on public key, a quantum identity authenticated (QIA) system is proposed without quantum entanglement. The public key acts as the authentication key of a user. Following the idea of the classical public key infrastructure (PKI), a trusted center of authentication (CA) is involved. The user selects a public key randomly and CA generates a private key for the user according to his public key. When it is necessary to perform QIA, the user sends a sequence of single photons encoded with its private key and a message to CA. According to the corresponding secret key kept by CA, CA performs the unitary operations on the single photon sequence. At last, the receiver can judge whether the user is an impersonator.

  2. Completely device-independent quantum key distribution

    Science.gov (United States)

    Aguilar, Edgar A.; Ramanathan, Ravishankar; Kofler, Johannes; Pawłowski, Marcin

    2016-08-01

    Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary assumptions that the parties have to make about their devices, giving rise to device-independent QKD (DIQKD). However, in all existing protocols to date the parties need to have an initial (at least partially) random seed as a resource. In this work, we show that this requirement can be dropped. Using recent advances in the fields of randomness amplification and randomness expansion, we demonstrate that it is sufficient for the message the parties want to communicate to be (partially) unknown to the adversaries—an assumption without which any type of cryptography would be pointless to begin with. One party can use her secret message to locally generate a secret sequence of bits, which can then be openly used by herself and the other party in a DIQKD protocol. Hence our work reduces the requirements needed to perform secure DIQKD and establish safe communication.

  3. Quantum Key Distribution

    Science.gov (United States)

    Seshu, Ch.

    Quantum Key Distribution (QKD) uses Quantum Mechanics to guarantee secure communication. It enables two parties to produce a shared random bit string known only to them, which can be used as a key to encrypt and decrypt messages.

  4. Public Key Cryptography.

    Science.gov (United States)

    Tapson, Frank

    1996-01-01

    Describes public key cryptography, also known as RSA, which is a system using two keys, one used to put a message into cipher and another used to decipher the message. Presents examples using small prime numbers. (MKR)

  5. Key Management Laboratory

    Data.gov (United States)

    Federal Laboratory Consortium — FUNCTION: Provides a secure environment to research and develop advanced electronic key management and networked key distribution technologies for the Navy and DoD....

  6. Bit-oriented quantum public-key encryption based on quantum perfect encryption

    Science.gov (United States)

    Wu, Chenmiao; Yang, Li

    2016-08-01

    A bit-oriented quantum public-key encryption scheme is presented. We use Boolean functions as private-key and randomly changed pairs of quantum state and classical string as public-keys. Following the concept of quantum perfect encryption, we prepare the public-key with Hadamard transformation and Pauli transformation. The quantum part of public-keys is various with different classical strings. In contrast to the typical classical public-key scheme, one private-key in our scheme corresponds to an exponential number of public-keys. We investigate attack to the private-key and prove that the public-key is a totally mixed state. So the adversary cannot acquire any information about private-key from measurement of the public-key. Then, the attack to encryption is analyzed. Since the trace distance between two different ciphertexts is zero, the adversary cannot distinguish between the two ciphertext states and also obtains nothing about plaintext and private-key. Thus, we have the conclusion that the proposed scheme is information-theoretically secure under an attack of the private-key and encryption.

  7. Raspberry Pi for secret agents

    CERN Document Server

    Sjogelid, Stefan

    2015-01-01

    This book is an easy-to-follow guide with practical examples in each chapter. Suitable for the novice and expert alike, each topic provides a fast and easy way to get started with exciting applications and also guides you through setting up the Raspberry Pi as a secret agent toolbox.

  8. Histaminergic regulation of prolactin secretion

    DEFF Research Database (Denmark)

    Knigge, U P

    1990-01-01

    of DA synthesis and of DA or serotonin (5-HT) receptors inhibit or prevent the PRL stimulatory action of HA infused centrally or systemically. However, other factors regulating PRL secretion (e.g. beta-endorphin, vasoactive intestinal peptide, vasopressin or TRH) may be involved in the mediation...

  9. Wnt Secretion and Gradient Formation

    Directory of Open Access Journals (Sweden)

    Vladimir L. Katanaev

    2013-03-01

    Full Text Available Concentration gradients formed by the lipid-modified morphogens of the Wnt family are known for their pivotal roles during embryogenesis and adult tissue homeostasis. Wnt morphogens are also implicated in a variety of human diseases, especially cancer. Therefore, the signaling cascades triggered by Wnts have received considerable attention during recent decades. However, how Wnts are secreted and how concentration gradients are formed remains poorly understood. The use of model organisms such as Drosophila melanogaster has provided important advances in this area. For instance, we have previously shown that the lipid raft-associated reggie/flotillin proteins influence Wnt secretion and spreading in Drosophila. Our work supports the notion that producing cells secrete Wnt molecules in at least two pools: a poorly diffusible one and a reggie/flotillin-dependent highly diffusible pool which allows morphogen spreading over long distances away from its source of production. Here we revise the current views of Wnt secretion and spreading, and propose two models for the role of the reggie/flotillin proteins in these processes: (i reggies/flotillins regulate the basolateral endocytosis of the poorly diffusible, membrane-bound Wnt pool, which is then sorted and secreted to apical compartments for long-range diffusion, and (ii lipid rafts organized by reggies/flotillins serve as “dating points” where extracellular Wnt transiently interacts with lipoprotein receptors to allow its capture and further spreading via lipoprotein particles. We further discuss these processes in the context of human breast cancer. A better understanding of these phenomena may be relevant for identification of novel drug targets and therapeutic strategies.

  10. Reference frame independent quantum key distribution

    CERN Document Server

    Laing, Anthony; Rarity, John G; O'Brien, Jeremy L

    2010-01-01

    We describe a quantum key distribution protocol based on pairs of entangled qubits that generates a secure key between two partners in an environment of unknown and slowly varying reference frame. A direction of particle delivery is required, but the phases between the computational basis states need not be known or fixed. The protocol can simplify the operation of existing setups and has immediate applications to emerging scenarios such as earth-to-satellite links and the use of integrated photonic waveguides. We compute the asymptotic secret key rate for a two-qubit source, which coincides with the rate of the six-state protocol for white noise. We give the generalization of the protocol to higher-dimensional systems and detail a scheme for physical implementation in the three dimensional qutrit case.

  11. Secrets of the Soil (LBNL Science at the Theater)

    Energy Technology Data Exchange (ETDEWEB)

    Brodie, Eoin; Northen, Trent; Jansson, Janet; Torn, Margaret

    2011-11-07

    Four Berkeley Lab scientists unveil the "Secrets of the Soil"at this Nov. 7, 2011 Science at the Theater event. Eoin Brodie, Janet Jansson, Margaret Torn and Trent Northen talk about their research and how soil could hold the key to our climate and energy future.The discussion was moderated by John Harte, who holds a joint professorship in the Energy and Resources Group and the Ecosystem Sciences Division of UC Berkeley's College of Natural Resources

  12. LOCKS AND KEYS SERVICE

    CERN Multimedia

    Locks and Keys Service

    2002-01-01

    The Locks and Keys service (ST/FM) will move from building 55 to building 570 from the 2nd August to the 9th August 2002 included. During this period the service will be closed. Only in case of extreme urgency please call the 164550. Starting from Monday, 12th August, the Locks and Keys Service will continue to follow the activities related to office keys (keys and locks) and will provide the keys for furniture. The service is open from 8h30 to 12h00 and from 13h00 to 17h30. We remind you that your divisional correspondents can help you in the execution of the procedures. We thank you for your comprehension and we remain at your service to help you in solving all the matters related to keys for offices and furniture. Locks and Keys Service - ST Division - FM Group

  13. Aluminum-activated Oxalate Secretion does not Associate with Internal Content among Some Oxalate Accumulators

    Institute of Scientific and Technical Information of China (English)

    Jian Li Yang; Lei Zhang; Shao Jian Zheng

    2008-01-01

    Although aluminum (AI)-activated secretion of oxalate has been considered to be an Important AI-exclusion mechanism,whether it is a general response in oxalate accumulators and related to oxalate content in roots are still not clear.Here,we examined the oxalate secretion and oxalate content in some oxalate accumulators,and investigated the role of oxalate secretion in AI resistance.When oxalate content in amaranth roots was decreased by about 50% with the increased ratio of NH4+-N to NO3——N in nutrient solution,the amount of AI-activated oxalate secretion still remained constant.There was no relationship between the content of the water soluble oxalate in four species of oxalate accumulators and the amount of the AI-activated oxalate secretion in roots.Furthermore,oxalate secretion is poorly associated with AI resistance among these species.Based on the above results,we concluded that although all of the oxalate accumulators tested could secrete oxalate rapidly,the density of anion channels in plasma membrane may play a more important role in AI-activated oxalate secretion.Key words: aluminum toxicity; Amaranthus; anion channel; oxalate accumulator; oxalate secretion.

  14. Multiple hashes of single key with passcode for multiple accounts

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    A human's e-life needs multiple offline and online accounts. It is a balance between usability and security to set keys or passwords for these multiple accounts. Password reuse has to be avoided due to the domino effect of malicious administrators and crackers. However, human memorability constrains the number of keys. Single sign-on server, key hashing, key strengthening and petname system are used in the prior arts to use only one key for multiple online accounts. The unique site keys are derived from the common master secret and specific domain name. These methods cannot be applied to offline accounts such as file encryption. We invent a new method and system applicable to offline and online accounts. It does not depend on HTTP server and domain name, but numeric 4-digit passcode, key hashing, key strengthening and hash truncation. Domain name is only needed to resist spoofing and phishing attacks of online accounts.

  15. Dense Wavelength Division Multiplexed Quantum Key Distribution Using Entangled Photons

    CERN Document Server

    Mower, Jacob; Shapiro, Jeff H; Englund, Dirk

    2011-01-01

    Quantum key distribution (QKD) enables two parties to establish a secret key over a potentially hostile channel by exchanging photonic quantum states, relying on the fact that it is impossible for an eavesdropper to tap the quantum channel without disturbing these photons in a way that can be detected [1]. Here we introduce a large-alphabet QKD protocol that makes optimal use of temporal and spectral correlations of entangled photons, reaching the maximum number of inde- pendent basis states (the Schmidt number) and enabling extremely high information content per photon together with an optimal rate of secret key generation. This protocol, which we call 'Dense Wavelength Division Multiplexed Quantum Key Distribution' (DWDM-QKD), derives its security by the conjugate nature of the temporal and spectral entanglement of photon pairs generated by spontaneous parametric down conversion. By using a combination of spectral and temporal bases, we can adjust the protocol to be resource efficient. We show that DWDM-QKD...

  16. Long-distance practical quantum key distribution by entanglement swapping

    CERN Document Server

    Scherer, Artur; Tittel, Wolfgang

    2010-01-01

    We develop a model for practical, entanglement-based long-distance quantum key distribution employing entanglement swapping as a key building block. Relying only on existing off-the-shelf technology, we show how to optimize resources so as to maximize secret key distribution rates. The tools comprise lossy transmission links, such as telecom optical fibers or free space, parametric down-conversion sources of entangled photon pairs, and threshold detectors that are inefficient and have dark counts. Our analysis provides the optimal trade-off between detector efficiency and dark counts, which are usually competing, as well as the optimal source brightness that maximizes the secret key rate for specified distances (i.e. loss) between sender and receiver.

  17. Quantum Encryption Minimising Key Leakage under Known Plaintext Attacks

    DEFF Research Database (Denmark)

    Pedersen, Thomas Brochmann

    2006-01-01

    In this dissertation we show how, by using a quantum channel, we can get more unconditionally secret communication with a symmetric key under known plaintext attacks. In unconditionally secret encryption schemes the key is necessarily an expensive resource since it cannot safely be reused for more...... than one encryption. In classical cryptography an amount of key comparable to the amount of message is leaked at each encryption. Many assumptions and models have been proposed which allows to safely encrypt more message with the same amount of key. Most of the proposed models are, however, either...... unrealistic, or rely on unproven assumptions. In this dissertation we encrypt messages by using properties of quantum mechanics. This model is based on our current understanding of nature, and is therefore a realistic model for encryption. It has previously been shown that the quantum mechanical model allows...

  18. Long-distance quantum key distribution in optical fiber

    CERN Document Server

    Hiskett, P A; Lita, A E; Miller, A J; Nam, S; Nordholt, J E; Peterson, C G; Rosenberg, D

    2006-01-01

    Use of low-noise detectors can both increase the secret bit rate of long-distance quantum key distribution (QKD) and dramatically extend the length of a fibre optic link over which secure key can be distributed. Previous work has demonstrated use of ultra-low-noise transition-edge sensors (TESs) in a QKD system with transmission over 50 km. In this work, we demonstrate the potential of the TESs by successfully generating error-corrected, privacy-amplified key over 148.7 km of dark optical fibre at a mean photon number mu = 0.1, or 184.6 km of dark optical fibre at a mean photon number of 0.5. We have also exchanged secret key over 67.5 km that is secure against powerful photon-number-splitting attacks.

  19. Key Account Management

    OpenAIRE

    Dvořák, Dalibor

    2007-01-01

    This note tries to explain concept of key account management (KAM), factors leading to importance of this emerging concept, criteria to determine key accounts from customer base, benefits to both buyers and sellers agreeing to practice it, stages of KAM relationship, conditions under which power lies with buyer or seller, outlines risks faced by both the parties, key success factors, challenges faced in implementing this concept and relevance to infrastructure sector.

  20. Finite-key security against coherent attacks in quantum key distribution

    CERN Document Server

    Sheridan, Lana; Scarani, Valerio

    2010-01-01

    The work by Christandl, K\\"onig and Renner [Phys. Rev. Lett. 102, 020504 (2009)] provides in particular the possibility of studying unconditional security in the finite-key regime for all discrete-variable protocols. We spell out this bound from their general formalism. Then we apply it to the study of a recently proposed protocol [Laing et al., Phys. Rev. A 82, 012304 (2010)]. This protocol is meaningful when the alignment of Alice's and Bob's reference frames is not monitored and may vary with time. In this scenario, the notion of asymptotic key rate has hardly any operational meaning, because if one waits too long time, the average correlations are smeared out and no security can be inferred. Therefore, finite-key analysis is necessary to find the maximal achievable secret key rate and the corresponding optimal number of signals.

  1. 分类分析中基于信息论准则的特征选取%Feature Selection for Classificatory Analysis Based on Information-theoretic Criteria

    Institute of Scientific and Technical Information of China (English)

    黄金杰; 吕宁; 李双全; 蔡云泽

    2008-01-01

    Feature selection aims to reduce the dimensionality of patterns for classificatory analysis by selecting the most informative instead of irrelevant and/or redundant features. In this study, two novel information-theoretic measures for feature ranking are presented: one is an improved formula to estimate the conditional mutual information between the candidate feature fi and the target class C given the subset of selected features S, i. e., I(C; fi|S), under the assumption that information of features is distributed uniformly; the other is a mutual information (MI) based constructive criterion that is able to capture both irrelevant and redundant input features under arbitrary distributions of information of features. With these two measures, two new feature selection algorithms,called the quadratic MI-based feature selection (QMIFS) approach and the MI-based constructive criterion (MICC) approach,respectively, are proposed, in which no parameters like β in Battiti's MIFS and (Kwak and Choi)'s MIFS-U methods need to be preset. Thus, the intractable problem of how to choose an appropriate value for β to do the tradeoff between the relevance to the target classes and the redundancy with the already-selected features is avoided completely. Experimental results demonstrate the good performances of QMIFS and MICC on both synthetic and benchmark data sets.

  2. Incretin hormone secretion over the day

    DEFF Research Database (Denmark)

    Ahren, B; Carr, RD; Deacon, Carolyn F.

    2010-01-01

    . Regulation of incretin hormone secretion is less well characterized. The main stimulus for incretin hormone secretion is presence of nutrients in the intestinal lumen, and carbohydrate, fat as well as protein all have the capacity to stimulate GIP and GLP-1 secretion. More recently, it has been established...

  3. Pancreatic bicarbonate secretion involves two proton pumps

    DEFF Research Database (Denmark)

    Novak, Ivana; Wang, Jing; Henriksen, Katrine L.

    2011-01-01

    Pancreas secretes fluid rich in digestive enzymes and bicarbonate. The alkaline secretion is important in buffering of acid chyme entering duodenum and for activation of enzymes. This secretion is formed in pancreatic ducts, and studies to date show that plasma membranes of duct epithelium expres...

  4. Keeping Secrets : Quantity, Quality and Consequences

    NARCIS (Netherlands)

    Frijns, T.

    2005-01-01

    Keeping Secrets deals with the consequences of an elusive yet everyday phenomenon. It addresses both the quantity and quality of secret-keeping. With respect to quantity, it presents research on the intra- and interpersonal consequences of keeping secrets from parents in adolescence. With respect t

  5. Electronic enhancement of tear secretion

    Science.gov (United States)

    Brinton, Mark; Lim Chung, Jae; Kossler, Andrea; Kook, Koung Hoon; Loudin, Jim; Franke, Manfred; Palanker, Daniel

    2016-02-01

    Objective. To study electrical stimulation of the lacrimal gland and afferent nerves for enhanced tear secretion, as a potential treatment for dry eye disease. We investigate the response pathways and electrical parameters to safely maximize tear secretion. Approach. We evaluated the tear response to electrical stimulation of the lacrimal gland and afferent nerves in isofluorane-anesthetized rabbits. In acute studies, electrical stimulation was performed using bipolar platinum foil electrodes, implanted beneath the inferior lacrimal gland, and a monopolar electrode placed near the afferent ethmoid nerve. Wireless microstimulators with bipolar electrodes were implanted beneath the lacrimal gland for chronic studies. To identify the response pathways, we applied various pharmacological inhibitors. To optimize the stimulus, we measured tear secretion rate (Schirmer test) as a function of pulse amplitude (1.5-12 mA), duration (0.1-1 ms) and repetition rate (10-100 Hz). Main results. Stimulation of the lacrimal gland increased tear secretion by engaging efferent parasympathetic nerves. Tearing increased with stimulation amplitude, pulse duration and repetition rate, up to 70 Hz. Stimulation with 3 mA, 500 μs pulses at 70 Hz provided a 4.5 mm (125%) increase in Schirmer score. Modulating duty cycle further increased tearing up to 57%, compared to continuous stimulation in chronically implanted animals (36%). Ethmoid (afferent) nerve stimulation increased tearing similar to gland stimulation (3.6 mm) via a reflex pathway. In animals with chronically implanted stimulators, a nearly 6 mm increase (57%) was achieved with 12-fold less charge density per pulse (0.06-0.3 μC mm-2 with 170-680 μs pulses) than the damage threshold (3.5 μC mm-2 with 1 ms pulses). Significance. Electrical stimulation of the lacrimal gland or afferent nerves may be used as a treatment for dry eye disease. Clinical trials should validate this approach in patients with aqueous tear deficiency, and

  6. A dopamine-secreting pheochromocytoma.

    Science.gov (United States)

    Yasunari, K; Kohno, M; Minami, M; Kano, H; Ohhira, M; Nakamura, K; Yoshikawa, J

    2000-01-01

    We describe a patient with pheochromocytoma, which secretes dopamine. He was admitted to hospital because of chronic diarrhea. After surgical resection of the tumor, dramatic cessation of the diarrhea and blood pressure elevation were observed. Decreased expression of dopamine beta-hydroxylase in the tumor was considered a possible mechanism of producing a pathophysiological concentration of dopamine. This case shows that excessive excretion of dopamine, a vasodilative hormone, may affect blood pressure.

  7. Multiscale modelling of saliva secretion.

    Science.gov (United States)

    Sneyd, James; Crampin, Edmund; Yule, David

    2014-11-01

    We review a multiscale model of saliva secretion, describing in brief how the model is constructed and what we have so far learned from it. The model begins at the level of inositol trisphosphate receptors (IPR), and proceeds through the cellular level (with a model of acinar cell calcium dynamics) to the multicellular level (with a model of the acinus), finally to a model of a saliva production unit that includes an acinus and associated duct. The model at the level of the entire salivary gland is not yet completed. Particular results from the model so far include (i) the importance of modal behaviour of IPR, (ii) the relative unimportance of Ca(2+) oscillation frequency as a controller of saliva secretion, (iii) the need for the periodic Ca(2+) waves to be as fast as possible in order to maximise water transport, (iv) the presence of functional K(+) channels in the apical membrane increases saliva secretion, (v) the relative unimportance of acinar spatial structure for isotonic water transport, (vi) the prediction that duct cells are highly depolarised, (vii) the prediction that the secondary saliva takes at least 1mm (from the acinus) to reach ionic equilibrium. We end with a brief discussion of future directions for the model, both in construction and in the study of scientific questions.

  8. Transporter-mediated biofuel secretion.

    Science.gov (United States)

    Doshi, Rupak; Nguyen, Tuan; Chang, Geoffrey

    2013-05-07

    Engineering microorganisms to produce biofuels is currently among the most promising strategies in renewable energy. However, harvesting these organisms for extracting biofuels is energy- and cost-intensive, limiting the commercial feasibility of large-scale production. Here, we demonstrate the use of a class of transport proteins of pharmacological interest to circumvent the need to harvest biomass during biofuel production. We show that membrane-embedded transporters, better known to efflux lipids and drugs, can be used to mediate the secretion of intracellularly synthesized model isoprenoid biofuel compounds to the extracellular milieu. Transporter-mediated biofuel secretion sustainably maintained an approximate three- to fivefold boost in biofuel production in our Escherichia coli test system. Because the transporters used in this study belong to the ubiquitous ATP-binding cassette protein family, we propose their use as "plug-and-play" biofuel-secreting systems in a variety of bacteria, cyanobacteria, diatoms, yeast, and algae used for biofuel production. This investigation showcases the potential of expressing desired membrane transport proteins in cell factories to achieve the export or import of substances of economic, environmental, or therapeutic importance.

  9. An Effective Contributory Re-Keying Approach to Compute Conference Key

    Directory of Open Access Journals (Sweden)

    D. Thilagavathy

    2011-01-01

    Full Text Available Problem statement: With the explosive growth of and internet and web applications many emerging group-oriented distributed applications such as tele/video-conferencing, multiplayer games are based on group communication model that need security services such as privacy and data integrity Hence a secure distributed group key agreement is required to establish and authenticate a common group key for secure and private communication. There is a need for security services to provide group-oriented communication privacy and data integrity. It is important that members of the group can establish a common secret key for encrypting group communication. A key tree approach has been proposed by many authors to distribute group key in such a way that the re keying cost scales with the logarithm of the group size for a join or leave request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or leaves Approach: Instead of performing individual re-keying operations, an interval-based approach of re keying is adopted in the proposed scheme. Results: In the proposed scheme Queue-merge algorithm is used for re keying which substantially reduces the computation cost and communication cost. The comparison shows that queue merge algorithm performs better than Batch algorithm in terms of minimizing the key tree and presumes better node density thereby reducing the computation cost. Conclusion: Performance comparison also shows reduced number of renewed nodes for various re keying interval which reduces the communication cost.

  10. Pyrilamine inhibits nicotine-induced catecholamine secretion.

    Science.gov (United States)

    Kim, Dong-Chan; Yun, So Jeong; Park, Yong-Soo; Jun, Dong-Jae; Kim, Dongjin; Jiten Singh, N; Kim, Sanguk; Kim, Kyong-Tai

    2014-07-01

    Function of nicotine, which induces activation of all parts of the body including our brain, has been receiving much attention for a long period of time and also been actively studied by researchers for its pharmacological actions in the central nervous system. The modulation of nicotine concentration and the inhibition of nicotine binding on target receptors in the brain are the key factors for smoking addiction therapy. In previous studies showed that influx of nicotine at the blood-brain barrier was through the pyrilamine-sensitive organic cation transporters. But the direct interacting mechanism of pyrilamine on the nicotine binding target receptors has not yet been clarified. The aim of the present study is to investigate the direct binding mechanisms of a pyrilamine on the nicotinic acetylcholine receptors (nAChRs). We found that pyrilamine shares the same ligand binding pocket of nicotine (NCT) on nAChRs but interacts with more amino acid residues than NCT does. The extended part of pyrilamine interacts with additional residues in the ligand binding pocket of nAChRs which are located nearby the entrance of the binding pocket. The catecholamine (CA) secretion induced by nAChR agonist (NCT') was significantly inhibited by the pyrilamine pretreatment. Real time carbon-fiber amperometry confirmed the inhibition of the NCT'-induced exocytosis by pyrilamine in a single cell level. We also found that pyrilamine inhibited the NCT'-induced [Ca(2+)]i. In contrast, pyrilamine did not affect the increase in calcium induced by high K(+). Overall, these data suggest that pyrilamine directly docks into the ligand binding site of nAChRs and specifically inhibits the nAChR-mediated effects thereby causing inhibition of CA secretion. Therefore, pyrilamine may play an important role to explore new treatments to aid smoking cessation.

  11. High-dimensional quantum key distribution with the entangled single-photon-added coherent state

    Science.gov (United States)

    Wang, Yang; Bao, Wan-Su; Bao, Hai-Ze; Zhou, Chun; Jiang, Mu-Sheng; Li, Hong-Wei

    2017-04-01

    High-dimensional quantum key distribution (HD-QKD) can generate more secure bits for one detection event so that it can achieve long distance key distribution with a high secret key capacity. In this Letter, we present a decoy state HD-QKD scheme with the entangled single-photon-added coherent state (ESPACS) source. We present two tight formulas to estimate the single-photon fraction of postselected events and Eve's Holevo information and derive lower bounds on the secret key capacity and the secret key rate of our protocol. We also present finite-key analysis for our protocol by using the Chernoff bound. Our numerical results show that our protocol using one decoy state can perform better than that of previous HD-QKD protocol with the spontaneous parametric down conversion (SPDC) using two decoy states. Moreover, when considering finite resources, the advantage is more obvious.

  12. Cryptanalysis of a multiparty quantum key agreement protocol based on commutative encryption

    Science.gov (United States)

    Mohajer, Razieh; Eslami, Ziba

    2017-08-01

    Recently, Sun et al. (Quantum Inf Process 15(5):2101-2111, 2016) proposed an efficient multiparty quantum key agreement protocol based on commutative encryption. The aim of this protocol is to negotiate a secret shared key among multiple parties with high qubit efficiency as well as security against inside and outside attackers. The shared key is the exclusive-OR of all participants' secret keys. This is achieved by applying the rotation operation on encrypted photons. For retrieving the final secret key, only measurement on single states is needed. Sun et al. claimed that assuming no mutual trust between participants, the scheme is secure against participant's attack. In this paper, we show that this is not true. In particular, we demonstrate how a malicious participant in Sun et al.'s protocol can introduce "a" final fake key to target parties of his choice. We further propose an improvement to guard against this attack.

  13. Key Generation in Wireless Sensor Networks Based on Frequency-selective Channels - Design, Implementation, and Analysis

    CERN Document Server

    Wilhelm, Matthias; Schmitt, Jens B

    2010-01-01

    Key management in wireless sensor networks faces several new challenges. The scale, resource limitations, and new threats such as node capture necessitate the use of an on-line key generation by the nodes themselves. However, the cost of such schemes is high since their secrecy is based on computational complexity. Recently, several research contributions justified that the wireless channel itself can be used to generate information-theoretic secure keys. By exchanging sampling messages during movement, a bit string can be derived that is only known to the involved entities. Yet, movement is not the only possibility to generate randomness. The channel response is also strongly dependent on the frequency of the transmitted signal. In our work, we introduce a protocol for key generation based on the frequency-selectivity of channel fading. The practical advantage of this approach is that we do not require node movement. Thus, the frequent case of a sensor network with static motes is supported. Furthermore, the...

  14. Financial Key Ratios

    Directory of Open Access Journals (Sweden)

    Tănase Alin-Eliodor

    2014-08-01

    Full Text Available This article focuses on computing techniques starting from trial balance data regarding financial key ratios. There are presented activity, liquidity, solvency and profitability financial key ratios. It is presented a computing methodology in three steps based on a trial balance.

  15. The compact key

    NARCIS (Netherlands)

    NN,

    1966-01-01

    Here is given a sample of a new sort of identification key, recently developed by Dr. P. W. Leenhouts of the Rijksherbarium. Having to sort many specimens of Sapindaceae into genera, he became dissatisfied with the common dichotomous key, which too often does not work when the material is not comple

  16. (N, N Secret Color Image Sharing Scheme with Dynamic Group

    Directory of Open Access Journals (Sweden)

    Mohamed Fathimal. P

    2015-06-01

    Full Text Available In recent years, secure information sharing has become a top requirement for many applications such as banking and military. Secret Sharing is an effective method to improve security of data. Secret Sharing helps to avoid storing data at a single point through dividing and distributing "shares" of secrets and recovering it later with no loss of original quality. This paper proposes a new Secret Sharing scheme for secure transmission of color images. The key features of this scheme are better visual quality of the recovered image with no pixel expansion, eliminating half toning of color images, eliminating the need for code book to decrypt images since reconstruction is done through XOR ing of all images and non-requirement of regeneration of shares for addition or deletion of users leading to less computational complexity. Besides these advantages, this scheme also helps to renew shares periodically and is highly beneficial in applications where data has to be stored securely in a database.

  17. Unconventional Pathways of Secretion Contribute to Inflammation

    Science.gov (United States)

    Daniels, Michael J. D.; Brough, David

    2017-01-01

    In the conventional pathway of protein secretion, leader sequence-containing proteins leave the cell following processing through the endoplasmic reticulum (ER) and Golgi body. However, leaderless proteins also enter the extracellular space through mechanisms collectively known as unconventional secretion. Unconventionally secreted proteins often have vital roles in cell and organism function such as inflammation. Amongst the best-studied inflammatory unconventionally secreted proteins are interleukin (IL)-1β, IL-1α, IL-33 and high-mobility group box 1 (HMGB1). In this review we discuss the current understanding of the unconventional secretion of these proteins and highlight future areas of research such as the role of nuclear localisation. PMID:28067797

  18. Cheater identifiable visual secret sharing scheme

    Institute of Scientific and Technical Information of China (English)

    Gan Zhi; Chen Kefei

    2005-01-01

    The visual secret sharing scheme proposed by Naor and Shamir provides a way to encrypt a secret black-white image into shares. A qualified group of participants can recover the secret message without using any cryptographic computation. But the original scheme can easily be corrupted by malicious participant. We propose an extension of VSS(visual secret sharing) to identify cheaters before the secret is recovered. Without the need for any additional information and cryptographic computation, every participant can verify the validity of shares of other participants, thus the security of VSS is enhanced.

  19. Secret sharing scheme with inherited characteristic

    Institute of Scientific and Technical Information of China (English)

    Ye Zhenjun; Meng Fanzhen

    2006-01-01

    To assure the shareholders can look for their "legal" attorneys to renew the secret, once the secret sharing scheme is initialized, a secret sharing scheme with inherited characteristic is constructed. In this scheme, each shareholder can produce a new share by his algorithm, which is equivalent to the primary one. Together with other shares, the primary secret can be renewed. Since this scheme is constructed not by replacing the primary share with a new share produced by the dealer in his primitive secret sharing scheme, so no matter how much shares the shareholder produces, these shares can not be gathered together to renew the secret in this scheme. Compared with the existing secret sharing schemes, this scheme provides more agility for the shareholders by investing each of them a function but not affect its security.

  20. LcrG secretion is not required for blocking of Yops secretion in Yersinia pestis

    Directory of Open Access Journals (Sweden)

    Matson Jyl S

    2008-02-01

    Full Text Available Abstract Background LcrG, a negative regulator of the Yersinia type III secretion apparatus has been shown to be primarily a cytoplasmic protein, but is secreted at least in Y. pestis. LcrG secretion has not been functionally analyzed and the relevance of LcrG secretion on LcrG function is unknown. Results An LcrG-GAL4AD chimera, originally constructed for two-hybrid analyses to analyze LcrG protein interactions, appeared to be not secreted but the LcrG-GAL4AD chimera retained the ability to regulate Yops secretion. This result led to further investigation to determine the significance of LcrG secretion on LcrG function. Additional analyses including deletion and substitution mutations of amino acids 2–6 in the N-terminus of LcrG were constructed to analyze LcrG secretion and LcrG's ability to control secretion. Some changes to the N-terminus of LcrG were found to not affect LcrG's secretion or LcrG's secretion-controlling activity. However, substitution of poly-isoleucine in the N-terminus of LcrG did eliminate LcrG secretion but did not affect LcrG's secretion controlling activity. Conclusion These results indicate that secretion of LcrG, while observable and T3SS mediated, is not relevant for LcrG's ability to control secretion.

  1. Protection of multicast scalable video by secret sharing: simulation results

    Science.gov (United States)

    Eskicioglu, Ahmet M.; Dexter, Scott; Delp, Edward J., III

    2003-06-01

    Security is an increasingly important attribute for multimedia applications that require prevention of unauthorized access to copyrighted data. Two approaches have been used to protect scalable video content in distribution: Partial encryption and progressive encryption. Partial encryption provides protection for only selected portions of the video. Progressive encryption allows transcoding with simple packet truncation, and eliminates the need to decrypt the video packets at intermediate network nodes with low complexity. Centralized Key Management with Secret Sharing (CKMSS) is a recent approach in which the group manager assigns unique secret shares to the nodes in the hierarchical key distribution tree. It allows the reconstruction of different keys by communicating different activating shares for the same prepositioned information. Once the group key is established, it is used until a member joins/leaves the multicast group or periodic rekeying occurs. In this paper, we will present simulation results regarding the communication and processing requirements of the CKMSS scheme applied to scalable video. In particular, we have measured the rekey message size and the processing time needed by the server for each join/leave request and periodic rekey event.

  2. Detector-device-independent quantum key distribution

    Energy Technology Data Exchange (ETDEWEB)

    Lim, Charles Ci Wen; Korzh, Boris; Martin, Anthony; Bussières, Félix; Thew, Rob; Zbinden, Hugo [Group of Applied Physics, University of Geneva, Chemin de Pinchat 22, CH-1211 Geneva 4 (Switzerland)

    2014-12-01

    Recently, a quantum key distribution (QKD) scheme based on entanglement swapping, called measurement-device-independent QKD (mdiQKD), was proposed to bypass all measurement side-channel attacks. While mdiQKD is conceptually elegant and offers a supreme level of security, the experimental complexity is challenging for practical systems. For instance, it requires interference between two widely separated independent single-photon sources, and the secret key rates are dependent on detecting two photons—one from each source. Here, we demonstrate a proof-of-principle experiment of a QKD scheme that removes the need for a two-photon system and instead uses the idea of a two-qubit single-photon to significantly simplify the implementation and improve the efficiency of mdiQKD in several aspects.

  3. An Alternative to Keys

    Science.gov (United States)

    O'Hagan, James

    1977-01-01

    For the secondary school, the author discourages the use of dichotomous keys in favor of a punch-card system. The system is readily constructed by students for use in plant and animal classification. (CP)

  4. Weegee’s City Secrets

    Directory of Open Access Journals (Sweden)

    Alan TRACHTENBERG

    2010-03-01

    Full Text Available En tant que photographe indépendant de meurtres, d’accidents, d’incendies, mais aussi de moments de loisirs dans la ville — de scènes de violence et de plaisir — Weegee travaillait essentiellement la nuit et utilisait un flash puissant associé à son appareil-photo de presse. Ses « secrets pour réaliser des photographies avec un flash » consistent à donner des conseils pratiques et techniques pour débutants. Mais au cœur de la rhétorique de ses « secrets » se trouvent des réflexions subtiles et convaincantes révélant la relation entre la lumière et l’obscurité, et plus particulièrement la manière dont la lumière du flash permet de rendre visible l’obscurité. Dans le récit de Weegee, le flash confère à la photographie le pouvoir d’écrire — d’écrire avec la lumière, un mode de représentation singulièrement approprié pour enregistrer des instants de vie dans les rues nocturnes de la ville.As a freelance photographer of crime, accidents, fires, and also of the recreational life of the city—scenes of violence and of pleasure—Weegee worked mainly at night and employed a powerful photoflash attachment to his press camera. His "secrets of shooting with photoflash" consist of practical technical advice for beginners. But within the rhetoric of his "secrets" there lie cogent and subtle reflections on the relation of light to darkness, especially on the way the flash of light makes darkness visible. In Weegee’s account, the photoflash gives photography the power of writing—writing with light, a mode of picturing uniquely suited to recording instants of life on city streets at night.

  5. Keys to the City

    DEFF Research Database (Denmark)

    Monsson, Christian Kjær

    2014-01-01

    Review of: Keys to the City: How Economics, Institutions, Social Interaction, and Politics Shape Development / Michael Storper Princeton University Press, Princeton, NJ, 2013, 288 pp., $39.95/£27.95 (cloth), ISBN 9780691143118......Review of: Keys to the City: How Economics, Institutions, Social Interaction, and Politics Shape Development / Michael Storper Princeton University Press, Princeton, NJ, 2013, 288 pp., $39.95/£27.95 (cloth), ISBN 9780691143118...

  6. Key concepts in energy

    CERN Document Server

    Madureira, Nuno Luis

    2014-01-01

    Highlights how key energy concepts surfaced, tracing their evolution throughout history to encompasses four economic concepts and four technological-engineering concepts developed through their history to conclude with current economic and environmental sciences Considers the process of energy-substitutions through complementary usages, hybridization and technological mixes Combines a conceptual approach with key theoretical concepts from engineering, geological and economic sciences providing cross disciplinary overview of energy fundamentals in a short and focused reading

  7. Trellis-coded quantization for public-key steganography

    CERN Document Server

    Guelvouit, Gaëtan Le

    2008-01-01

    This paper deals with public-key steganography in the presence of a passive warden. The aim is to hide secret messages within cover-documents without making the warden suspicious, and without any preliminar secret key sharing. Whereas a practical attempt has been already done to provide a solution to this problem, it suffers of poor flexibility (since embedding and decoding steps highly depend on cover-signals statistics) and of little capacity compared to recent data hiding techniques. Using the same framework, this paper explores the use of trellis-coded quantization techniques (TCQ and turbo TCQ) to design a more efficient public-key scheme. Experiments on audio signals show great improvements considering Cachin's security criterion.

  8. Numerical analysis of decoy state quantum key distribution protocols

    Energy Technology Data Exchange (ETDEWEB)

    Harrington, Jim W [Los Alamos National Laboratory; Rice, Patrick R [Los Alamos National Laboratory

    2008-01-01

    Decoy state protocols are a useful tool for many quantum key distribution systems implemented with weak coherent pulses, allowing significantly better secret bit rates and longer maximum distances. In this paper we present a method to numerically find optimal three-level protocols, and we examine how the secret bit rate and the optimized parameters are dependent on various system properties, such as session length, transmission loss, and visibility. Additionally, we show how to modify the decoy state analysis to handle partially distinguishable decoy states as well as uncertainty in the prepared intensities.

  9. The evidence for secretion clearance techniques.

    Science.gov (United States)

    Hess, D R

    2001-11-01

    Many acute and chronic respiratory diseases are associated with increased respiratory secretions in the airways. Narrative reviews and a few systematic reviews of secretion clearance techniques have been published. These reviews raise concerns regarding the lack of evidence to support the various secretion clearance techniques. I conducted a comprehensive MEDLINE search of the following subjects: chest physical therapy, chest physiotherapy, postural drainage, forced expiratory technique, autogenic drainage, high-frequency chest wall compression, flutter device and secretions, positive expiratory pressure and secretions, intrapulmonary percussion, mechanical in-exsufflation and secretions. This was followed by a comprehensive search of cross-references to identify additional studies. The results of this review are reported herein. There are a number of methodological limitations of the literature reporting studies of the use of secretion clearance techniques. Most of the studies were small, most used crossover designs, and few used sham therapy. Many studies were limited to short-term outcomes such as sputum clearance with a single treatment session. Despite the clinical observation that retained secretions are detrimental to respiratory function and despite anecdotal associations between secretion clearance and improvements in respiratory function, there is a dearth of high-level evidence to support any secretion clearance technique.

  10. Modulation of the NMDA Receptor Through Secreted Soluble Factors.

    Science.gov (United States)

    Cerpa, Waldo; Ramos-Fernández, Eva; Inestrosa, Nibaldo C

    2016-01-01

    Synaptic activity is a critical determinant in the formation and development of excitatory synapses in the central nervous system (CNS). The excitatory current is produced and regulated by several ionotropic receptors, including those that respond to glutamate. These channels are in turn regulated through several secreted factors that function as synaptic organizers. Specifically, Wnt, brain-derived neurotrophic factor (BDNF), fibroblast growth factor (FGF), and transforming growth factor (TGF) particularly regulate the N-methyl-D-aspartate receptor (NMDAR) glutamatergic channel. These factors likely regulate early embryonic development and directly control key proteins in the function of important glutamatergic channels. Here, we review the secreted molecules that participate in synaptic organization and discuss the cell signaling behind of this fine regulation. Additionally, we discuss how these factors are dysregulated in some neuropathologies associated with glutamatergic synaptic transmission in the CNS.

  11. Accurate prediction of secreted substrates and identification of a conserved putative secretion signal for type III secretion systems.

    Directory of Open Access Journals (Sweden)

    Ram Samudrala

    2009-04-01

    Full Text Available The type III secretion system is an essential component for virulence in many Gram-negative bacteria. Though components of the secretion system apparatus are conserved, its substrates--effector proteins--are not. We have used a novel computational approach to confidently identify new secreted effectors by integrating protein sequence-based features, including evolutionary measures such as the pattern of homologs in a range of other organisms, G+C content, amino acid composition, and the N-terminal 30 residues of the protein sequence. The method was trained on known effectors from the plant pathogen Pseudomonas syringae and validated on a set of effectors from the animal pathogen Salmonella enterica serovar Typhimurium (S. Typhimurium after eliminating effectors with detectable sequence similarity. We show that this approach can predict known secreted effectors with high specificity and sensitivity. Furthermore, by considering a large set of effectors from multiple organisms, we computationally identify a common putative secretion signal in the N-terminal 20 residues of secreted effectors. This signal can be used to discriminate 46 out of 68 total known effectors from both organisms, suggesting that it is a real, shared signal applicable to many type III secreted effectors. We use the method to make novel predictions of secreted effectors in S. Typhimurium, some of which have been experimentally validated. We also apply the method to predict secreted effectors in the genetically intractable human pathogen Chlamydia trachomatis, identifying the majority of known secreted proteins in addition to providing a number of novel predictions. This approach provides a new way to identify secreted effectors in a broad range of pathogenic bacteria for further experimental characterization and provides insight into the nature of the type III secretion signal.

  12. Metabolic regulation of insulin secretion.

    Science.gov (United States)

    Keane, Kevin; Newsholme, Philip

    2014-01-01

    Regulation of metabolic fuel homeostasis is a critical function of β-cells, which are located in the islets of Langerhans of the animal pancreas. Impairment of this β-cell function is a hallmark of pancreatic β-cell failure and may lead to development of type 2 diabetes mellitus. β-Cells are essentially "fuel sensors" that monitor and react to elevated nutrient load by releasing insulin. This response involves metabolic activation and generation of metabolic coupling factors (MCFs) that relay the nutrient signal throughout the cell and induce insulin biosynthesis and secretion. Glucose is the most important insulin secretagogue as it is the primary fuel source in food. Glucose metabolism is central to generation of MCFs that lead to insulin release, most notably ATP. In addition, other classes of nutrients are able to augment insulin secretion and these include members of the lipid and amino acid family of nutrients. Therefore, it is important to investigate the interplay between glucose, lipid, and amino acid metabolism, as it is this mixed nutrient sensing that generate the MCFs required for insulin exocytosis. The mechanisms by which these nutrients are metabolized to generate MCFs, and how they impact on β-cell insulin release and function, are discussed in detail in this article.

  13. Choice of measurement as the secret

    Science.gov (United States)

    Liu, Bin; Gao, Fei; Qin, Su-Juan; Huang, Wei; Liu, Feng; Wen, Qiao-Yan

    2014-04-01

    Recently, Kalev et al. [A. Kalev, A. Mann, and M. Revzen, Phys. Rev. Lett. 110, 260502 (2013)., 10.1103/PhysRevLett.110.260502] proposed a quantum (public) communication protocol with an interesting encoding style, where the signal is encoded in the choice of the measurement basis of one of the communicating parties (Bob) and Bob's measurement results are irrelevant for the communication. As we know, one of the main advantages of quantum technique in communication over the classical one is the higher security. Therefore, as Kalev et al. have mentioned in their paper, an interesting open question is whether one could and how to utilize this new encoding style to design a secure communication protocol, i.e., translate the choice of measurement into the secret. Here we propose a quantum key distribution protocol, which is a secure communication protocol, with this encoding style, where Bob's measurement results are still irrelevant. Furthermore, the security of the proposed protocol in the zero-error case has been proved.

  14. Quantum secret sharing with minimized quantum communication

    Science.gov (United States)

    Fortescue, Ben; Gour, Gilad

    2013-03-01

    Standard techniques for sharing a quantum secret among multiple players (such that certain subsets of the players can recover the secret while others are denied all knowledge of the secret) require a large amount of quantum communication to distribute the secret, which is likely to be the most costly resource in any practical scheme. Two known methods for reducing this cost are the use of imperfect ``ramp'' secret sharing (in which security is sacrificed for efficiency) and classical encryption (in which certain elements of the players' shares consist of classical information only). We demonstrate how one may combine these methods to reduce the required quantum communication below what has been previously achieved, in some cases to a provable minimum, without any loss of security. The techniques involved are closely-related to the properties of stabilizer codes, and thus have strong potential for being adapted to a wide range of quantum secret sharing schemes.

  15. Determination an d Comparison of Milk Secretion Traits of Hu Sheep and Han Sheep in Lactation Key Period%湖羊、小尾寒羊泌乳关键期泌乳性状的测定与比较

    Institute of Scientific and Technical Information of China (English)

    李晓林; 牛志刚; 袁燕; 王姗; 李列刚; 周成全; 史洪才

    2016-01-01

    测定和比较了新疆舍饲湖羊、小尾寒羊在泌乳关键期的泌乳性状。结果表明:湖羊和小尾寒羊个体在产后56 d内的总泌乳量分别为(31.25±0.06)kg和(30.03±0.02)kg,日均泌乳量分别为(0.558±0.05)kg和(0.541±0.07)kg;在泌乳中期,湖羊和小尾寒羊间乳蛋白率差异极显著( P<0.01);在整个泌乳期,两个羊种间乳蛋白率差异显著( P<0.01);湖羊泌乳的乳脂率在中期达到最大值,而小尾寒羊在后期达到最大值;湖羊泌乳的乳糖率在整个泌乳期呈上升趋势,而小尾寒羊在中期达到最大值;两种羊乳的总固体含量在整个泌乳期都呈上升趋势。%The milk traits of lactation key period were determinated and compared in Xinjiang Hu sheep and Han sheep.The results showed that the total milk yield was (31.25 ±0.06) kg and (30.03 ±0.02) kg, average daily milk yield was (0.558 ± 0.05) kg and ( 0.541 ±0.07) kg after postpartum 56 days in Hu sheep and Han sheep.The milk protein rate of Hu sheep and Han sheep existed extremely significant difference (P<0.01) in mid-lactation period, the milk protein differences between the two breeds was significantly ( P<0.01 ) throughout lactation period.The butterfat rate of Hu sheep was peaked in the medium term, while the butterfat rate of Han sheep was peaked in the later term; The milk lactose rate of Hu sheep was on the rising throughout the lactation period, while the milk lactose rate of Han sheep was peaked in the medium term;The total solid content of Hu sheep and Han sheep was on the rising throughout the lactation period.

  16. Anonymous-key quantum cryptography and unconditionally secure quantum bit commitment

    CERN Document Server

    Yuen, H P

    2000-01-01

    A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocol that does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.

  17. Key World Energy Statistics

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2010-07-01

    The IEA produced its first handy, pocket-sized summary of key energy data in 1997. This new edition responds to the enormously positive reaction to the book since then. Key World Energy Statistics produced by the IEA contains timely, clearly-presented data on supply, transformation and consumption of all major energy sources. The interested businessman, journalist or student will have at his or her fingertips the annual Canadian production of coal, the electricity consumption in Thailand, the price of diesel oil in Spain and thousands of other useful energy facts. It exists in different formats to suit our readers' requirements.

  18. Secretion by numbers: protein traffic in prokaryotes

    Science.gov (United States)

    Economou, Anastasias; Christie, Peter J.; Fernandez, Rachel C.; Palmer, Tracy; Plano, Greg V.; Pugsley, Anthony P.

    2013-01-01

    Summary Almost all aspects of protein traffic in bacteria were covered at the ASM-FEMS meeting on the topic in Iraklio, Crete in May 2006. The studies presented ranged from mechanistic analysis of specific events leading proteins to their final destinations to the physiological roles of the targeted proteins. Among the highlights from the meeting that are reviewed here are the molecular dynamics of SecA protein, membrane protein insertion, type III secretion needles and chaperones, type IV secretion, the two partner and autosecretion systems, the ‘secretion competent state’, and the recently discovered type VI secretion system. PMID:17020575

  19. Random Secretion of Growth Hormone in Humans

    Science.gov (United States)

    Prank, Klaus; Kloppstech, Mirko; Nowlan, Steven J.; Sejnowski, Terrence J.; Brabant, Georg

    1996-08-01

    In normal humans, growth hormone (GH) is secreted from a gland located adjacent to the brain (pituitary) into the blood in distinct pulses, but in patients bearing a tumor within the pituitary (acromegaly) GH is excessively secreted in an irregular manner. It has been hypothesized that GH secretion in the diseased state becomes random. This hypothesis is supported by demonstrating that GH secretion in patients with acromegaly cannot be distinguished from a variety of linear stochastic processes based on the predictability of the fluctuations of GH concentration in the bloodstream.

  20. COMMENSURABLE ENCRYPTION USING USER- DEFINE KEY TECHNIQUE

    Directory of Open Access Journals (Sweden)

    ripal dilipbhai ranpara

    2012-11-01

    Full Text Available Cryptography is the gold standard for security. It is used to protect the transmission and storage of data between two parties by encrypting it into an unreadable format. Cryptography has enabled the first wave of secure transmissions, which has helped fuel the growth of transactions like shopping, banking, and finance over the world’s biggest public network, the Internet. Many Internet applications such as e-mail, databases, and browsers store a tremendous amount of personal and financial information, but frequently the data is left unprotected. Traditional network security is frequently less effective at preventing hackers from accessing this data. For instance, once-private databases are now completely exposed on the Internet. It turns out that getting to the database that holds millions of credit card numbers—the transmission—is secure through the use of cryptography, but the database itself isn’t, fueling the rise of credit card information theft. A paradigm shift is now under way for cryptography. The only way to make data secure in any application that runs over the Internet is to use secret (also known as private key cryptography. The current security methods focus on securing Internet applications using public keys techniques that are no longer effective.so according to my knowledge no one has addressed on COMMENSURABLE USER-DEFINE KEY TECHNIQUE that is used to encrypt the data as per the user-define key

  1. Noninvasive clearance of airway secretions.

    Science.gov (United States)

    Hardy, K A; Anderson, B D

    1996-06-01

    Airway clearance techniques are indicated for specific diseases that have known clearance abnormalities (Table 2). Murray and others have commented that such techniques are required only for patients with a daily sputum production of greater than 30 mL. The authors have observed that patients with diseases known to cause clearance abnormalities can have sputum clearance with some techniques, such as positive expiratory pressure, autogenic drainage, and active cycle of breathing techniques, when PDPV has not been effective. Hasani et al has shown that use of the forced exhalatory technique in patients with nonproductive cough still resulted in movement of secretions proximally from all regions of the lung in patients with airway obstruction. It is therefore reasonable to consider airway clearance techniques for any patient who has a disease known to alter mucous clearance, including CF, dyskinetic cilia syndromes, and bronchiectasis from any cause. Patients with atelectasis from mucous plugs and hypersecretory states, such as asthma and chronic bronchitis, patients with pain secondary to surgical procedures, and patients with neuromuscular disease, weak cough, and abnormal patency of the airway may also benefit from the application of airway clearance techniques. Infants and children up to 3 years of age with airway clearance problems need to be treated with PDPV. Manual percussion with hands alone or a flexible face mask or cup and small mechanical vibrator/percussors, such as the ultrasonic devices, can be used. The intrapulmonary percussive ventilator shows growing promise in this area. The high-frequency oscillator is not supplied with vests of appropriate sizes for tiny babies and has not been studied in this group. Young patients with neuromuscular disease may require assisted ventilation and airway oscillations can be applied. CPAP alone has been shown to improve achievable flow rates that will increase air-liquid interactions for patients with these diseases

  2. Metabolic control of renin secretion.

    Science.gov (United States)

    Peti-Peterdi, János; Gevorgyan, Haykanush; Lam, Lisa; Riquier-Brison, Anne

    2013-01-01

    One emerging topic in renin-angiotensin system (RAS) research is the direct local control of renin synthesis and release by endogenous metabolic intermediates. During the past few years, our laboratory has characterized the localization and signaling of the novel metabolic receptor GPR91 in the normal and diabetic kidney and established GPR91 as a new, direct link between high glucose and RAS activation in diabetes. GPR91 (also called SUCNR1) binds tricarboxylic acid (TCA) cycle intermediate succinate which can rapidly accumulate in the local tissue environment when energy supply and demand are out of balance. In a variety of physiological and pathological conditions associated with metabolic stress, succinate signaling via GPR91 appears to be an important mediator or modulator of renin secretion. This review summarizes our current knowledge on the control of renin release by molecules of endogenous metabolic pathways with the main focus on succinate/GPR91.

  3. [Functional morphology of stomach secretions].

    Science.gov (United States)

    Liebich, H G

    1985-01-01

    The stimulation of gastric secretion is regulated by neurovagal, endocrine and immunological reactions. During the gastric phase of digestion, especially acetylcholin, gastrin and histamin react as main transmitters, activated by mediators (prostaglandines, leucotrienes, lipoxygenases). The dominant role of nervus vagus has to be seen in the transactions of vago-vagal reflexes, the stimulation of gastrin liberation by an non-cholinergic mechanism and the regulation of the gastric microcirculation. The antrum pylori can be seen as an immunological area of reception, where immunological active cells (macrophages, NK-lymphocytes and T-lymphocytes) are recognizing antigens (e.g. food antigens). These immunocytes induce a cascade of endocrine and exocrine mechanisms of digestion. Mastcells, located intra-and extraepithelial, take a regulatory influence in producing histamins, leucotrienes and also prostaglandines.

  4. [Mucoprotein secretion in calculous gallbladder].

    Science.gov (United States)

    Fernández Lobato, R; Ortega, L; Balibrea, J L; Torres, A J; García-Calvo, M; Alvarez Sánchez, J A

    1994-05-01

    Secretion of mucoproteins or mucine (MP) have been studied as possible markers in several pathological conditions of the digestive tract, such us colonic polyposis or gastric dysplasia. In the gallbladder (VB) it has been established that form the core of crystalization for the calculi. A study in 100 gallbladders have been made based on the utility of the analysis of the qualitative and quantitative modifications of MP in lithogenesis. It was been determined by histochemical techniques the three main types of MP (neutral, low and high sulphated acid) to evaluate the alterations in the process of lithiasis. Results show a high production of the MP in VB with lithiasis, presenting in 97% a mixed composition of MP (48.9% of 2 types, and 3 types in 46%), without a predominating type in this pathology.

  5. Locks and Keys Service

    CERN Multimedia

    Claude Ducastel

    The GS-LS-SEM section is pleased to inform you that as from Monday 30 November 2009, the opening hours of the Locks and Keys service will be the following: 08h30 - 12h30 / 13h30 - 16:30, Mondays to Fridays. GS-SEM-LS 73333

  6. Keyed shear joints

    DEFF Research Database (Denmark)

    Hansen, Klaus

    This report gives a summary of the present information on the behaviour of vertical keyed shear joints in large panel structures. An attemp is made to outline the implications which this information might have on the analysis and design of a complete wall. The publications also gives a short...

  7. Cryptographic Key Management System

    Energy Technology Data Exchange (ETDEWEB)

    No, author

    2014-02-21

    This report summarizes the outcome of U.S. Department of Energy (DOE) contract DE-OE0000543, requesting the design of a Cryptographic Key Management System (CKMS) for the secure management of cryptographic keys for the energy sector infrastructure. Prime contractor Sypris Electronics, in collaboration with Oak Ridge National Laboratories (ORNL), Electric Power Research Institute (EPRI), Valicore Technologies, and Purdue University's Center for Education and Research in Information Assurance and Security (CERIAS) and Smart Meter Integration Laboratory (SMIL), has designed, developed and evaluated the CKMS solution. We provide an overview of the project in Section 3, review the core contributions of all contractors in Section 4, and discuss bene ts to the DOE in Section 5. In Section 6 we describe the technical construction of the CKMS solution, and review its key contributions in Section 6.9. Section 7 describes the evaluation and demonstration of the CKMS solution in different environments. We summarize the key project objectives in Section 8, list publications resulting from the project in Section 9, and conclude with a discussion on commercialization in Section 10 and future work in Section 11.

  8. Key performance indicators

    NARCIS (Netherlands)

    Zwetsloot, G.I.J.M.

    2014-01-01

    This paper addresses how organisations can use OSH performance indicators. This is an important way to mainstream OSH into business management. Key performance indicators (KPIs) should provide objective data on the OSH situation. It is often said that ‘what gets measured gets managed’. Without

  9. Key performance indicators

    NARCIS (Netherlands)

    Zwetsloot, G.I.J.M.

    2014-01-01

    This paper addresses how organisations can use OSH performance indicators. This is an important way to mainstream OSH into business management. Key performance indicators (KPIs) should provide objective data on the OSH situation. It is often said that ‘what gets measured gets managed’. Without infor

  10. Elastase secretion in Acanthamoeba polyphaga.

    Science.gov (United States)

    Ferreira, Gabriela A; Magliano, Ana C M; Pral, Elizabeth M F; Alfieri, Silvia C

    2009-11-01

    Acanthamoeba species are frequently isolated from soil and water collections. In the environment, the organisms multiply as phagotrophic trophozoites and encyst under adverse conditions. Several species are known to infect man, causing keratitis and opportunistic diseases. The mechanisms underlying tissue damage and invasion by the amoebae are being elucidated and the involvement of secreted peptidases, particularly serine peptidases, has been demonstrated. Here, elastase activity was examined in Acanthamoeba-conditioned medium (ACM), making use of elastin-Congo red (ECR) and synthetic peptide p-nitroanilide substrates. ACM hydrolysed ECR over a broad pH range and optimally at a pH of 7.5 and above. Indicating the activity of serine and metallopeptidases, Congo red release was potently inhibited by PMSF, antipain, chymostatin and 1,10-phenanthroline, partially reduced by elastatinal and EDTA, and unaffected by 1,7-phenanthroline and E-64. Screening with synthetic substrates mainly showed the activity of serine peptidases. ACM efficiently hydrolysed Suc-Ala(2)-Pro-Leu-pNA and Suc-Ala(2)-Pro-Phe-pNA over a broad pH range (7.0-9.5) and was weakly active against Suc-Ala(3)-pNA, a substrate found to be optimally hydrolysed at a pH around 7.0. Following ammonium sulfate precipitation of ACM proteins and FPLC analysis, the majority of the ECR-splitting activity, characterised as serine peptidases, bound to CM-sepharose and co-eluted with part of the Suc-Ala(2)-Pro-Phe-pNA-hydrolysing activity in a gradient of 0-0.6M NaCl. In the corresponding FPLC fractions, serine peptidases resolving in the region of 70-130kDa were detected in gelatin gels. Overall, the results demonstrate that trophozoites secrete elastases, and additionally suggest the high molecular weight serine peptidases as possible elastase candidates.

  11. Cystic fibrosis airway secretions exhibit mucin hyperconcentration and increased osmotic pressure

    Science.gov (United States)

    Henderson, Ashley G.; Ehre, Camille; Button, Brian; Abdullah, Lubna H.; Cai, Li-Heng; Leigh, Margaret W.; DeMaria, Genevieve C.; Matsui, Hiro; Donaldson, Scott H.; Davis, C. William; Sheehan, John K.; Boucher, Richard C.; Kesimer, Mehmet

    2014-01-01

    The pathogenesis of mucoinfective lung disease in cystic fibrosis (CF) patients likely involves poor mucus clearance. A recent model of mucus clearance predicts that mucus flow depends on the relative mucin concentration of the mucus layer compared with that of the periciliary layer; however, mucin concentrations have been difficult to measure in CF secretions. Here, we have shown that the concentration of mucin in CF sputum is low when measured by immunologically based techniques, and mass spectrometric analyses of CF mucins revealed mucin cleavage at antibody recognition sites. Using physical size exclusion chromatography/differential refractometry (SEC/dRI) techniques, we determined that mucin concentrations in CF secretions were higher than those in normal secretions. Measurements of partial osmotic pressures revealed that the partial osmotic pressure of CF sputum and the retained mucus in excised CF lungs were substantially greater than the partial osmotic pressure of normal secretions. Our data reveal that mucin concentration cannot be accurately measured immunologically in proteolytically active CF secretions; mucins are hyperconcentrated in CF secretions; and CF secretion osmotic pressures predict mucus layer–dependent osmotic compression of the periciliary liquid layer in CF lungs. Consequently, mucin hypersecretion likely produces mucus stasis, which contributes to key infectious and inflammatory components of CF lung disease. PMID:24892808

  12. Identification of organic acids in wine that stimulate mechanisms of gastric acid secretion.

    Science.gov (United States)

    Liszt, Kathrin Ingrid; Walker, Jessica; Somoza, Veronika

    2012-07-18

    Wine may cause stomach irritation due to its stimulatory effect on gastric acid secretion, although the mechanisms by which wine or components thereof activate pathways of gastric acid secretion are poorly understood. Gastric pH was measured with a noninvasive intragastric probe, demonstrating that administration of 125 mL of white or red wine to healthy volunteers stimulated gastric acid secretion more potently than the administration of equivalent amounts of ethanol. Between both beverages, red wine showed a clear trend for being more active in stimulating gastric acid secretion than white wine (p = 0.054). Quantification of the intracellular proton concentration in human gastric tumor cells (HGT-1), a well-established indicator of proton secretion and, in turn, stomach acid formation in vivo, confirmed the stronger effect of red wine as compared to white wine. RT-qPCR experiments on cells exposed to red wine also revealed a more pronounced effect than white wine on the fold change expression of genes associated with gastric acid secretion. Of the quantitatively abundant organic acids in wine, malic acid and succinic acid most actively stimulated proton secretion in vitro. However, addition of ethanol to individual organic acids attenuated the secretory effect of tartaric acid, but not that of the other organic acids. It was concluded that malic acid for white wine and succinic acid for red wine are key organic acids that contribute to gastric acid stimulation.

  13. Heparanase regulates secretion, composition, and function of tumor cell-derived exosomes.

    Science.gov (United States)

    Thompson, Camilla A; Purushothaman, Anurag; Ramani, Vishnu C; Vlodavsky, Israel; Sanderson, Ralph D

    2013-04-05

    Emerging evidence indicates that exosomes play a key role in tumor-host cross-talk and that exosome secretion, composition, and functional capacity are altered as tumors progress to an aggressive phenotype. However, little is known regarding the mechanisms that regulate these changes. Heparanase is an enzyme whose expression is up-regulated as tumors become more aggressive and is associated with enhanced tumor growth, angiogenesis, and metastasis. We have discovered that in human cancer cells (myeloma, lymphoblastoid, and breast cancer), when expression of heparanase is enhanced or when tumor cells are exposed to exogenous heparanase, exosome secretion is dramatically increased. Heparanase enzyme activity is required for robust enhancement of exosome secretion because enzymatically inactive forms of heparanase, even when present in high amounts, do not dramatically increase exosome secretion. Heparanase also impacts exosome protein cargo as reflected by higher levels of syndecan-1, VEGF, and hepatocyte growth factor in exosomes secreted by heparanase-high expressing cells as compared with heparanase-low expressing cells. In functional assays, exosomes from heparanase-high cells stimulated spreading of tumor cells on fibronectin and invasion of endothelial cells through extracellular matrix better than did exosomes secreted by heparanase-low cells. These studies reveal that heparanase helps drive exosome secretion, alters exosome composition, and facilitates production of exosomes that impact both tumor and host cell behavior, thereby promoting tumor progression.

  14. The type three secreted effector SipC regulates the trafficking of PERP during Salmonella infection.

    Science.gov (United States)

    Hallstrom, Kelly N; McCormick, Beth A

    2016-01-01

    Salmonella enterica Typhimurium employs type III secreted effectors to induce cellular invasion and pathogenesis. We previously reported the secreted effector SipA is in part responsible for inducing the apical accumulation of the host membrane protein PERP, a host factor we have shown is key to the inflammatory response induced by Salmonella. We now report that the S. Typhimurium type III secreted effector SipC significantly contributes to PERP redistribution to the apical membrane surface. To our knowledge, this is the first report demonstrating a role for SipC in directing the trafficking of a host membrane protein to the cell surface. In sum, facilitation of PERP trafficking appears to be a result of type III secreted effector-mediated recruitment of vesicles to the apical surface. Our study therefore reveals a new role for SipC, and builds upon previous reports suggesting recruitment of vesicles to the cell surface is important for Salmonella invasion.

  15. Practical quantum key distribution over a 48-km optical fiber network

    CERN Document Server

    Hughes, R J; Peterson, C G; Hughes, Richard J.; Morgan, George L.

    1999-01-01

    The secure distribution of the secret random bit sequences known as "key" material, is an essential precursor to their use for the encryption and decryption of confidential communications. Quantum cryptography is a new technique for secure key distribution with single-photon transmissions: Heisenberg's uncertainty principle ensures that an adversary can neither successfully tap the key transmissions, nor evade detection (eavesdropping raises the key error rate above a threshold value). We have developed experimental quantum cryptography systems based on the transmission of non-orthogonal photon states to generate shared key material over multi-kilometer optical fiber paths and over line-of-sight links. In both cases, key material is built up using the transmission of a single-photon per bit of an initial secret random sequence. A quantum-mechanically random subset of this sequence is identified, becoming the key material after a data reconciliation stage with the sender. Here we report the most recent results...

  16. On Secret Sharing with Nonlinear Product Reconstruction

    DEFF Research Database (Denmark)

    Cascudo Pueyo, Ignacio; Cramer, Ronald; Mirandola, Diego

    2015-01-01

    Multiplicative linear secret sharing is a fundamental notion in the area of secure multiparty computation and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that the product of two secrets is obtained as a linear function of the vector consis...

  17. Secret-involved Information System Security Audit

    Institute of Scientific and Technical Information of China (English)

    ZHANG; Ya-lan

    2015-01-01

    Secret-involved information system security audit is a network security technology developing rapidly in recent years.It uses various technical to detect the problem of secret-involved information system,and uses certain audit methods to analyze all kinds of suspicious behavior and irregularities.

  18. "The Secret Garden": A Literary Journey.

    Science.gov (United States)

    Jordan, Anne Devereaux

    1998-01-01

    Outlines the life of Frances Hodgson Burnett, author of "The Secret Garden." Argues that it not only tells an enthralling tale, but takes readers on a journey through the history of English literature. Discusses the gothic tradition and romanticism of "The Secret Garden." Lists classic elements in the book and offers five ideas…

  19. On Secret Sharing with Nonlinear Product Reconstruction

    DEFF Research Database (Denmark)

    Cascudo Pueyo, Ignacio; Cramer, Ronald; Mirandola, Diego

    2015-01-01

    Multiplicative linear secret sharing is a fundamental notion in the area of secure multiparty computation and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that the product of two secrets is obtained as a linear function of the vector consis...

  20. Family Secrets: The Bioethics of Genetic Testing

    Science.gov (United States)

    Markowitz, Dina G.; DuPre, Michael J.; Holt, Susan; Chen, Shaw-Ree; Wischnowski, Michael

    2006-01-01

    This article discusses "Family Secrets," a problem-based learning (PBL) curriculum module that focuses on the bioethical implications of genetic testing. In high school biology classrooms throughout New York State, students are using "Family Secrets" to learn about DNA testing; Huntington's disease (HD); and the ethical, legal,…

  1. Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation.

    Science.gov (United States)

    Leverrier, Anthony; Grangier, Philippe

    2009-05-08

    We present a continuous-variable quantum key distribution protocol combining a discrete modulation and reverse reconciliation. This protocol is proven unconditionally secure and allows the distribution of secret keys over long distances, thanks to a reverse reconciliation scheme efficient at very low signal-to-noise ratio.

  2. Continuous-variable Quantum Key Distribution protocols with a discrete modulation

    CERN Document Server

    Leverrier, Anthony

    2010-01-01

    In this paper, we consider continuous-variable quantum key distribution with a discrete modulation, either binary or quaternary. We establish the security of these protocols against collective attacks, which implies their security against arbitrary attacks in the asymptotic limit. We give lower bounds for the secret key rate using extremality properties of Gaussian states.

  3. Key Generation Using External Source Excitation: Capacity, Reliability, and Secrecy Exponent

    CERN Document Server

    Chou, Tzu-Han; Sayeed, Akbar M

    2011-01-01

    We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key capacity for such systems with one-way public messaging. We then characterize a tradeoff between the secret key rate and exponential bounds on the probability of key agreement failure and on the secrecy of the key generated. We find that there is a fundamental tradeoff between reliability and secrecy. We then explore this framework within the context of reciprocal wireless channels. In this setting, the users transmit pre-arranged excitation signals to each other. When the fading is Rayleigh, the observations of the users are jointly Gaussian sources. We show that an on-off excitation signal with an SNR-dependent duty cycle achieves the secret key capacity of this system. Furthermore, we characterize a fundamental metric -- minimum energy per key bit for reliable key generatio...

  4. Physician Appraisals: Key Challenges

    Directory of Open Access Journals (Sweden)

    Klich Jacek

    2017-06-01

    Full Text Available The main purpose of the article is to identify key criteria being used for physician appraisals and to find how communication skills of physicians are valued in those appraisals. ScienceDirect and EBSCOhost databases were used for this search. The results show that a physician appraisal is underestimated both theoretically and empirically. The particular gap exists with respect to the communication skills of physicians, which are rarely present in medical training syllabi and physician assessments. The article contributes to the theoretical discourse on physician appraisals and points out at the inconsistency between the high status of physicians as a key hospital resource on the one hand and, on the other hand, at inadequate and poorly researched assessment of their performance with a special emphasis on communication skills. The article may inspire health managers to develop and implement up-to-date assessment forms for physicians and good managerial practices in this respect in hospitals and other health care units.

  5. Efficient Quantum Key Distribution

    CERN Document Server

    Ardehali, M; Chau, H F; Lo, H K

    1998-01-01

    We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different polarization bases during both transmission and reception to reduce the fraction of discarded data. The actual probabilities used in the scheme are announced in public. As the number of transmitted signals increases, the efficiency of our scheme can be made to approach 100%. The security of our scheme (against single-photon eavesdropping strategies) is guaranteed by a refined analysis of accepted data which is employed to detect eavesdropping: Instead of lumping all the accepted data together to estimate a single error rate, we separate the accepted data into various subsets according to the basis employed and estimate an error rate for each subset individually. Our scheme is the first quantum key distribution with an efficiency greater than 50%. We remark that our idea is rath...

  6. Ancel Keys: a tribute

    Directory of Open Access Journals (Sweden)

    VanItallie Theodore B

    2005-02-01

    Full Text Available Abstract Ancel Keys, Ph.D., who died in November, 2004, at the age of 100, was among the first scientists to recognize that human atherosclerosis is not an inevitable consequence of aging, and that a high-fat diet can be a major risk factor for coronary heart disease. During World War II, he and a group of talented co-workers at the University of Minnesota conducted a large-scale study of experimentally-induced human starvation. The data generated by this study – which was immediately recognized to be a classic – continue to be of inestimable value to nutrition scientists. In his later years, Keys spent more time at his home in Naples, Italy, where he had the opportunity to continue his personal study of the beneficial effects on health and longevity of a Mediterranean diet.

  7. Ancel Keys: a tribute.

    Science.gov (United States)

    Vanitallie, Theodore B

    2005-02-14

    Ancel Keys, Ph.D., who died in November, 2004, at the age of 100, was among the first scientists to recognize that human atherosclerosis is not an inevitable consequence of aging, and that a high-fat diet can be a major risk factor for coronary heart disease. During World War II, he and a group of talented co-workers at the University of Minnesota conducted a large-scale study of experimentally-induced human starvation. The data generated by this study - which was immediately recognized to be a classic - continue to be of inestimable value to nutrition scientists. In his later years, Keys spent more time at his home in Naples, Italy, where he had the opportunity to continue his personal study of the beneficial effects on health and longevity of a Mediterranean diet.

  8. Suppression of dark-count effects in practical quantum key-distribution

    CERN Document Server

    Khalique, A; Alber, G; Khalique, Aeysha; Nikolopoulos, Georgios M.; Alber, Gernot

    2006-01-01

    The influence of imperfections on achievable secret-key generation rates of quantum key distribution protocols is investigated. As examples of relevant imperfections, we consider tagging of Alice's qubits and dark counts at Bob's detectors. It is demonstrated that error correction and privacy amplification based on a combination of a two-way classical communication protocol and asymmetric Calderbank-Shor-Steane codes may significantly suppress the disastrous influence of dark counts. As a result, the distances are increased considerably over which a secret key can be distributed in optical fibres reliably. Results are presented for the four-state, the six-state, and the decoy-state protocols.

  9. Quantum key distribution using gaussian-modulated coherent states

    CERN Document Server

    Grosshans, F; Wenger, J; Brouri, R; Cerf, N J; Grangier, P; Grangier, Ph.

    2003-01-01

    Quantum continuous variables are being explored as an alternative means to implement quantum key distribution, which is usually based on single photon counting. The former approach is potentially advantageous because it should enable higher key distribution rates. Here we propose and experimentally demonstrate a quantum key distribution protocol based on the transmission of gaussian-modulated coherent states (consisting of laser pulses containing a few hundred photons) and shot-noise-limited homodyne detection; squeezed or entangled beams are not required. Complete secret key extraction is achieved using a reverse reconciliation technique followed by privacy amplification. The reverse reconciliation technique is in principle secure for any value of the line transmission, against gaussian individual attacks based on entanglement and quantum memories. Our table-top experiment yields a net key transmission rate of about 1.7 megabits per second for a loss-free line, and 75 kilobits per second for a line with loss...

  10. Practical security of continuous-variable quantum key distribution with finite sampling bandwidth effects

    Science.gov (United States)

    Wang, Chao; Huang, Peng; Huang, Duan; Lin, Dakai; Zeng, Guihua

    2016-02-01

    Practical security of the continuous-variable quantum key distribution (CVQKD) system with finite sampling bandwidth of analog-to-digital converter (ADC) at the receiver's side is investigated. We find that the finite sampling bandwidth effects may decrease the lower bound of secret key rate without awareness of the legitimate communicators. This leaves security loopholes for Eve to attack the system. In addition, this effect may restrains the linear relationship of secret key bit rate with repetition rate of the system; subsequently, there is a saturation value for the secret key bit rate with the repetition rate. To resist such kind of effects, we propose a dual sampling detection approach in which two ADCs are employed so that the finite sampling bandwidth effects are removed.

  11. Toxins and Secretion Systems of Photorhabdus luminescens

    Directory of Open Access Journals (Sweden)

    Athina Rodou

    2010-06-01

    Full Text Available Photorhabdus luminescens is a nematode-symbiotic, gram negative, bioluminescent bacterium, belonging to the family of Enterobacteriaceae.Recent studies show the importance of this bacterium as an alternative source of insecticides, as well as an emerging human pathogen. Various toxins have been identified and characterized in this bacterium. These toxins are classified into four major groups: the toxin complexes (Tcs, the Photorhabdus insect related (Pir proteins, the “makes caterpillars floppy” (Mcf toxins and the Photorhabdus virulence cassettes (PVC; the mechanisms however of toxin secretion are not fully elucidated. Using bioinformatics analysis and comparison against the components of known secretion systems, multiple copies of components of all known secretion systems, except the ones composing a type IV secretion system, were identified throughout the entire genome of the bacterium. This indicates that Photorhabdus luminescens has all the necessary means for the secretion of virulence factors, thus it is capable of establishing a microbial infection.

  12. Toxins and secretion systems of Photorhabdus luminescens.

    Science.gov (United States)

    Rodou, Athina; Ankrah, Dennis O; Stathopoulos, Christos

    2010-06-01

    Photorhabdus luminescens is a nematode-symbiotic, gram negative, bioluminescent bacterium, belonging to the family of Enterobacteriaceae. Recent studies show the importance of this bacterium as an alternative source of insecticides, as well as an emerging human pathogen. Various toxins have been identified and characterized in this bacterium. These toxins are classified into four major groups: the toxin complexes (Tcs), the Photorhabdus insect related (Pir) proteins, the "makes caterpillars floppy" (Mcf) toxins and the Photorhabdus virulence cassettes (PVC); the mechanisms however of toxin secretion are not fully elucidated. Using bioinformatics analysis and comparison against the components of known secretion systems, multiple copies of components of all known secretion systems, except the ones composing a type IV secretion system, were identified throughout the entire genome of the bacterium. This indicates that Photorhabdus luminescens has all the necessary means for the secretion of virulence factors, thus it is capable of establishing a microbial infection.

  13. Regulation of glucagon secretion by incretins

    DEFF Research Database (Denmark)

    Holst, Jens Juul; Christensen, M; Lund, A;

    2011-01-01

    Glucagon secretion plays an essential role in the regulation of hepatic glucose production, and elevated fasting and postprandial plasma glucagon concentrations in patients with type 2 diabetes (T2DM) contribute to their hyperglycaemia. The reason for the hyperglucagonaemia is unclear, but recent...... that endogenous GLP-1 plays an important role in regulation of glucagon secretion during fasting as well as postprandially. The mechanisms whereby GLP-1 regulates glucagon secretion are debated, but studies in isolated perfused rat pancreas point to an important role for a paracrine regulation by somatostatin...... studies have shown lack of suppression after oral but preserved suppression after isoglycaemic intravenous glucose, pointing to factors from the gut. Gastrointestinal hormones that are secreted in response to oral glucose include glucagon-like peptide-1 (GLP-1) that strongly inhibits glucagon secretion...

  14. The Secrets of Long Life

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    Living to a ripe old age in China is on the increase - and a healthy lifestyle emerges as the key by Tang Yuankai SHE moves about with ease and sees and hears without any trouble.And on most days she climbs a mountain to work on

  15. Non-classical protein secretion in bacteria

    Directory of Open Access Journals (Sweden)

    Fausbøll Anders

    2005-10-01

    Full Text Available Abstract Background We present an overview of bacterial non-classical secretion and a prediction method for identification of proteins following signal peptide independent secretion pathways. We have compiled a list of proteins found extracellularly despite the absence of a signal peptide. Some of these proteins also have known roles in the cytoplasm, which means they could be so-called "moon-lightning" proteins having more than one function. Results A thorough literature search was conducted to compile a list of currently known bacterial non-classically secreted proteins. Pattern finding methods were applied to the sequences in order to identify putative signal sequences or motifs responsible for their secretion. We have found no signal or motif characteristic to any majority of the proteins in the compiled list of non-classically secreted proteins, and conclude that these proteins, indeed, seem to be secreted in a novel fashion. However, we also show that the apparently non-classically secreted proteins are still distinguished from cellular proteins by properties such as amino acid composition, secondary structure and disordered regions. Specifically, prediction of disorder reveals that bacterial secretory proteins are more structurally disordered than their cytoplasmic counterparts. Finally, artificial neural networks were used to construct protein feature based methods for identification of non-classically secreted proteins in both Gram-positive and Gram-negative bacteria. Conclusion We present a publicly available prediction method capable of discriminating between this group of proteins and other proteins, thus allowing for the identification of novel non-classically secreted proteins. We suggest candidates for non-classically secreted proteins in Escherichia coli and Bacillus subtilis. The prediction method is available online.

  16. Quantitative proteomic analysis of Burkholderia pseudomallei Bsa type III secretion system effectors using hypersecreting mutants.

    Science.gov (United States)

    Vander Broek, Charles W; Chalmers, Kevin J; Stevens, Mark P; Stevens, Joanne M

    2015-04-01

    Burkholderia pseudomallei is an intracellular pathogen and the causative agent of melioidosis, a severe disease of humans and animals. One of the virulence factors critical for early stages of infection is the Burkholderia secretion apparatus (Bsa) Type 3 Secretion System (T3SS), a molecular syringe that injects bacterial proteins, called effectors, into eukaryotic cells where they subvert cellular functions to the benefit of the bacteria. Although the Bsa T3SS itself is known to be important for invasion, intracellular replication, and virulence, only a few genuine effector proteins have been identified and the complete repertoire of proteins secreted by the system has not yet been fully characterized. We constructed a mutant lacking bsaP, a homolog of the T3SS "gatekeeper" family of proteins that exert control over the timing and magnitude of effector protein secretion. Mutants lacking BsaP, or the T3SS translocon protein BipD, were observed to hypersecrete the known Bsa effector protein BopE, providing evidence of their role in post-translational control of the Bsa T3SS and representing key reagents for the identification of its secreted substrates. Isobaric Tags for Relative and Absolute Quantification (iTRAQ), a gel-free quantitative proteomics technique, was used to compare the secreted protein profiles of the Bsa T3SS hypersecreting mutants of B. pseudomallei with the isogenic parent strain and a bsaZ mutant incapable of effector protein secretion. Our study provides one of the most comprehensive core secretomes of B. pseudomallei described to date and identified 26 putative Bsa-dependent secreted proteins that may be considered candidate effectors. Two of these proteins, BprD and BapA, were validated as novel effector proteins secreted by the Bsa T3SS of B. pseudomallei.

  17. Efficient and Robust Two-Party RSA Key Generation

    Institute of Scientific and Technical Information of China (English)

    YANG Muxiang; HONG Fan; ZHENG Minghui; LI Jun

    2006-01-01

    An efficient two party RSA secret key sharing generation scheme based on a homomorphic encryption, which is semantically secure under the prime residuosity assumption, is proposed in this paper. At the stage of computing RSA modulo N, an initial distributed primality test protocol is used to reduce the computation complexity and increase the probability of N being a two-prime product. On the other aspect, the homomorphic encryption based sharing conversion protocols is devised and adopted in multi-party computing modulus N and secret key d. Comparing to any sharing conversion protocols based on oblivious transfer protocol, the homomorphic encryption based sharing conversion protocols are of high performance. Our scheme resists the passive attack and since a method of verifying the sharing was introduced in, the scheme can resists any cheating behaviors too. Security proof, computation complexity and communication complexity analysis are given at last.

  18. Accurate prediction of secreted substrates and identification of a conserved putative secretion signal for type III secretion systems

    Energy Technology Data Exchange (ETDEWEB)

    Samudrala, Ram; Heffron, Fred; McDermott, Jason E.

    2009-04-24

    The type III secretion system is an essential component for virulence in many Gram-negative bacteria. Though components of the secretion system apparatus are conserved, its substrates, effector proteins, are not. We have used a machine learning approach to identify new secreted effectors. The method integrates evolutionary measures, such as the pattern of homologs in a range of other organisms, and sequence-based features, such as G+C content, amino acid composition and the N-terminal 30 residues of the protein sequence. The method was trained on known effectors from Salmonella typhimurium and validated on a corresponding set of effectors from Pseudomonas syringae, after eliminating effectors with detectable sequence similarity. The method was able to identify all of the known effectors in P. syringae with a specificity of 84% and sensitivity of 82%. The reciprocal validation, training on P. syringae and validating on S. typhimurium, gave similar results with a specificity of 86% when the sensitivity level was 87%. These results show that type III effectors in disparate organisms share common features. We found that maximal performance is attained by including an N-terminal sequence of only 30 residues, which agrees with previous studies indicating that this region contains the secretion signal. We then used the method to define the most important residues in this putative secretion signal. Finally, we present novel predictions of secreted effectors in S. typhimurium, some of which have been experimentally validated, and apply the method to predict secreted effectors in the genetically intractable human pathogen Chlamydia trachomatis. This approach is a novel and effective way to identify secreted effectors in a broad range of pathogenic bacteria for further experimental characterization and provides insight into the nature of the type III secretion signal.

  19. Fast and Memory-Efficient Key Recovery in Side-Channel Attacks

    DEFF Research Database (Denmark)

    Bogdanov, Andrey; Kizhvatov, Ilya; Manzoor, Kamran

    2016-01-01

    , they yield a ranked list of secret key chunks, e.g., the subkey bytes in AES. The problem of the key recovery is then to find the correct combined key. An optimal key enumeration algorithm (OKEA) was proposed by Charvillon et al. at SAC’12. Given the ranked key chunks together with their probabilities......, this algorithm outputs the full combined keys in the optimal order – from more likely to less likely ones. OKEA uses plenty of memory by its nature though, which limits its practical efficiency. Especially in the cases where the side-channel traces are noisy, the memory and running time requirements to find...

  20. Multiple Drug Transporters Are Involved in Renal Secretion of Entecavir.

    Science.gov (United States)

    Yang, Xi; Ma, Zhiyuan; Zhou, Sisi; Weng, Yayun; Lei, Hongmei; Zeng, Su; Li, Liping; Jiang, Huidi

    2016-10-01

    Entecavir (ETV) is a first-line antiviral agent for the treatment of chronic hepatitis B virus infection. Renal excretion is the major elimination path of ETV, in which tubular secretion plays the key role. However, the secretion mechanism has not been clarified. We speculated that renal transporters mediated the secretion of ETV. Therefore, the aim of our study was to elucidate which transporters contribute to the renal disposition of ETV. Our results revealed that ETV (50 μM) remarkably reduced the accumulation of probe substrates in MDCK cells stably expressing human multidrug and toxin efflux extrusion proteins (hMATE1/2-K), organic cation transporter 2 (hOCT2), and carnitine/organic cation transporters (hOCTNs) and increased the substrate accumulation in cells transfected with multidrug resistance-associated protein 2 (hMRP2) or multidrug resistance protein 1 (hMDR1). Moreover, ETV was proved to be a substrate of the above-described transporters. In transwell studies, the transport of ETV in MDCK-hOCT2-hMATE1 showed a distinct directionality from BL (hOCT2) to AP (hMATE1), and the cellular accumulation of ETV in cells expressing hMATE1 was dramatically lower than that of the mock-treated cells. The accumulation of ETV in mouse primary renal tubular cells was obviously affected by inhibitors of organic anion transporter 1/3 (Oat1/3), Oct2, Octn1/2, and Mrp2. Therefore, the renal uptake of ETV is likely mediated by OAT1/3 and OCT2 while the efflux is mediated by MATEs, MDR1, and MRP2, and OCTN1/2 may participate in both renal secretion and reabsorption. Copyright © 2016, American Society for Microbiology. All Rights Reserved.

  1. Neuroendocrine regulation of gonadotropin secretion in seasonally breeding birds

    Directory of Open Access Journals (Sweden)

    Takayoshi eUbuka

    2013-03-01

    Full Text Available Seasonally breeding birds detect environmental signals, such as light, temperature, food availability and presence of mates to time reproduction. Hypothalamic neurons integrate external and internal signals, and regulate reproduction by releasing neurohormones to the pituitary gland. The pituitary gland synthesizes and releases gonadotropins which in turn act on the gonads to stimulate gametogenesis and sex steroid secretion. Accordingly, how gonadotropin secretion is controlled by the hypothalamus is key to our understanding of the mechanisms of seasonal reproduction. A hypothalamic neuropeptide, gonadotropin-releasing hormone (GnRH, activates reproduction by stimulating gonadotropin synthesis and release. Another hypothalamic neuropeptide, gonadotropin-inhibitory hormone (GnIH, inhibits gonadotropin synthesis and release directly by acting on the pituitary gland or indirectly by decreasing the activity of GnRH neurons. Therefore, the next step to understand seasonal reproduction is to investigate how the activities of GnRH and GnIH neurons in the hypothalamus and their receptors in the pituitary gland are regulated by external and internal signals. It is possible that locally-produced triiodothyronine resulting from the action of type 2 iodothyronine deiodinase on thyroxine stimulates the release of gonadotropins, perhaps by action on GnRH neurons. The function of GnRH neurons is also regulated by transcription of the GnRH gene. Melatonin, a nocturnal hormone, stimulates the synthesis and release of GnIH and GnIH may therefore regulate a daily rhythm of gonadotropin secretion. GnIH may also temporally suppress gonadotropin secretion when environmental conditions are unfavorable. Environmental and social milieus fluctuate seasonally in the wild. Accordingly, complex interactions of various neuronal and hormonal systems need to be considered if we are to understand the mechanisms underlying seasonal reproduction.

  2. Mutual trust method for forwarding information in wireless sensor networks using random secret pre-distribution

    Directory of Open Access Journals (Sweden)

    Chih-Hsueh Lin

    2016-04-01

    Full Text Available In wireless sensor networks, sensing information must be transmitted from sensor nodes to the base station by multiple hopping. Every sensor node is a sender and a relay node that forwards the sensing information that is sent by other nodes. Under an attack, the sensing information may be intercepted, modified, interrupted, or fabricated during transmission. Accordingly, the development of mutual trust to enable a secure path to be established for forwarding information is an important issue. Random key pre-distribution has been proposed to establish mutual trust among sensor nodes. This article modifies the random key pre-distribution to a random secret pre-distribution and incorporates identity-based cryptography to establish an effective method of establishing mutual trust for a wireless sensor network. In the proposed method, base station assigns an identity and embeds n secrets into the private secret keys for every sensor node. Based on the identity and private secret keys, the mutual trust method is utilized to explore the types of trust among neighboring sensor nodes. The novel method can resist malicious attacks and satisfy the requirements of wireless sensor network, which are resistance to compromising attacks, masquerading attacks, forger attacks, replying attacks, authentication of forwarding messages, and security of sensing information.

  3. Proximal tubular secretion of creatinine by organic cation transporter OCT2 in cancer patients

    NARCIS (Netherlands)

    G. Ciarimboli (Giuliano); C.S. Lancaster (Cynthia); E. Schlatter (Eberhard); R.M. Franke (Ryan); J.A. Sprowl (Jason); H. Pavenstädt (Hermann); V. Massmann (Vivian); D. Guckel (Denise); A.H.J. Mathijssen (Ron); W. Yang (Wenjian); C.H. Pui (Ching-Hon); M.V. Relling (Mary); E. Herrmann (Eva); A. Sparreboom (Alex)

    2012-01-01

    textabstractPurpose: Knowledge of transporters responsible for the renal secretion of creatinine is key to a proper interpretation of serum creatinine and/or creatinine clearance as markers of renal function in cancer patients receiving chemotherapeutic agents. Experimental Design: Creatinine transp

  4. Finite-key analysis for time-energy high-dimensional quantum key distribution

    Science.gov (United States)

    Niu, Murphy Yuezhen; Xu, Feihu; Shapiro, Jeffrey H.; Furrer, Fabian

    2016-11-01

    Time-energy high-dimensional quantum key distribution (HD-QKD) leverages the high-dimensional nature of time-energy entangled biphotons and the loss tolerance of single-photon detection to achieve long-distance key distribution with high photon information efficiency. To date, the general-attack security of HD-QKD has only been proven in the asymptotic regime, while HD-QKD's finite-key security has only been established for a limited set of attacks. Here we fill this gap by providing a rigorous HD-QKD security proof for general attacks in the finite-key regime. Our proof relies on an entropic uncertainty relation that we derive for time and conjugate-time measurements that use dispersive optics, and our analysis includes an efficient decoy-state protocol in its parameter estimation. We present numerically evaluated secret-key rates illustrating the feasibility of secure and composable HD-QKD over metropolitan-area distances when the system is subjected to the most powerful eavesdropping attack.

  5. Security analysis of continuous-variable quantum key distribution scheme

    Institute of Scientific and Technical Information of China (English)

    Zhu Jun; He Guang-Qiang; Zeng Gui-Hua

    2007-01-01

    In this paper security of the quantum key distribution scheme using correlations of continuous variable Einstein- Podolsky- Rosen (EPR) pairs is investigated. A new approach for calculating the secret information rate △I is proposed by using the Shannon information theory. Employing an available parameter F which is associated with the entanglement of the EPR pairs, one can detect easily the eavesdropping. Results show that the proposed scheme is secure against individual beam splitter attack strategy with a proper squeeze parameter.

  6. Arbitrated quantum signature scheme based on reusable key

    Science.gov (United States)

    Yu, ChaoHua; Guo, GongDe; Lin, Song

    2014-11-01

    An arbitrated quantum signature scheme without using entangled states is proposed. In the scheme, by employing a classical hash function and random numbers, the secret keys of signer and receiver can be reused. It is shown that the proposed scheme is secure against several well-known attacks. Specifically, it can stand against the receiver's disavowal attack. Moreover, compared with previous relevant arbitrated quantum signature schemes, the scheme proposed has the advantage of less transmission complexity.

  7. Arbitrated quantum signature scheme based on reusable key

    Institute of Scientific and Technical Information of China (English)

    YU ChaoHua; GUO GongDe; LIN Song

    2014-01-01

    An arbitrated quantum signature scheme without using entangled states is proposed.In the scheme,by employing a classical hash function and random numbers,the secret keys of signer and receiver can be reused.It is shown that the proposed scheme is secure against several well-known attacks.Specifically,it can stand against the receiver's disavowal attack.Moreover,compared with previous relevant arbitrated quantum signature schemes,the scheme proposed has the advantage of less transmission complexity.

  8. Quantum key distribution: vulnerable if imperfectly implemented

    Science.gov (United States)

    Leuchs, G.

    2013-10-01

    We report several vulnerabilities found in Clavis2, the flagship quantum key distribution (QKD) system from ID Quantique. We show the hacking of a calibration sequence run by Clavis2 to synchronize the Alice and Bob devices before performing the secret key exchange. This hack induces a temporal detection efficiency mismatch in Bob that can allow Eve to break the security of the cryptosystem using faked states. We also experimentally investigate the superlinear behaviour in the single-photon detectors (SPDs) used by Bob. Due to this superlinearity, the SPDs feature an actual multi-photon detection probability which is generally higher than the theoretically-modelled value. We show how this increases the risk of detector control attacks on QKD systems (including Clavis2) employing such SPDs. Finally, we review the experimental feasibility of Trojan-horse attacks. In the case of Clavis2, the objective is to read Bob's phase modulator to acquire knowledge of his basis choice as this information suffices for constructing the raw key in the Scarani-Acin-Ribordy-Gisin 2004 (SARG04) protocol. We work in close collaboration with ID Quantique and for all these loopholes, we notified them in advance. Wherever possible, we or ID Quantique proposed countermeasures and they implemented suitable patches and upgrade their systems.

  9. Identification of protein secretion systems and novel secreted proteins in Rhizobium leguminosarum bv. viciae

    Directory of Open Access Journals (Sweden)

    Krehenbrink Martin

    2008-01-01

    Full Text Available Abstract Background Proteins secreted by bacteria play an important role in infection of eukaryotic hosts. Rhizobia infect the roots of leguminous plants and establish a mutually beneficial symbiosis. Proteins secreted during the infection process by some rhizobial strains can influence infection and modify the plant defence signalling pathways. The aim of this study was to systematically analyse protein secretion in the recently sequenced strain Rhizobium leguminosarum bv. viciae 3841. Results Similarity searches using defined protein secretion systems from other Gram-negative bacteria as query sequences revealed that R. l. bv. viciae 3841 has ten putative protein secretion systems. These are the general export pathway (GEP, a twin-arginine translocase (TAT secretion system, four separate Type I systems, one putative Type IV system and three Type V autotransporters. Mutations in genes encoding each of these (except the GEP were generated, but only mutations affecting the PrsDE (Type I and TAT systems were observed to affect the growth phenotype and the profile of proteins in the culture supernatant. Bioinformatic analysis and mass fingerprinting of tryptic fragments of culture supernatant proteins identified 14 putative Type I substrates, 12 of which are secreted via the PrsDE, secretion system. The TAT mutant was defective for the symbiosis, forming nodules incapable of nitrogen fixation. Conclusion None of the R. l. bv. viciae 3841 protein secretion systems putatively involved in the secretion of proteins to the extracellular space (Type I, Type IV, Type V is required for establishing the symbiosis with legumes. The PrsDE (Type I system was shown to be the major route of protein secretion in non-symbiotic cells and to secrete proteins of widely varied size and predicted function. This is in contrast to many Type I systems from other bacteria, which typically secrete specific substrates encoded by genes often localised in close proximity to

  10. ABSTRACTS AND KEY WORDS

    Institute of Scientific and Technical Information of China (English)

    2011-01-01

    Establishment of a Method for Content Determination of Polysaccharide in Membranous milkveteh root Applied in Fisheries Yu Xiao-qing et al. (1) Abstract Some chemical component in the traditional Chinese medicine Membranous milkvetch root can improve the ability of disease-prevention of animal and it can be applied in fisheries. In the paper, the method about content determination of polysaccharide in the root was established based on orthogonal experimental design Key words medicine; polysaccharide in Membranous milkvetch root; method of determination

  11. Ancel Keys: a tribute

    OpenAIRE

    VanItallie Theodore B

    2005-01-01

    Abstract Ancel Keys, Ph.D., who died in November, 2004, at the age of 100, was among the first scientists to recognize that human atherosclerosis is not an inevitable consequence of aging, and that a high-fat diet can be a major risk factor for coronary heart disease. During World War II, he and a group of talented co-workers at the University of Minnesota conducted a large-scale study of experimentally-induced human starvation. The data generated by this study – which was immediately recogni...

  12. Block Based Symmetry Key Visual Cryptography

    Directory of Open Access Journals (Sweden)

    Satyendra Nath Mandal

    2012-08-01

    Full Text Available Visual cryptography is a method for protecting image-based secrets that has a computation-free decoding process. In this technique, numbers of shares have been generated from one image. The shares are sent through any channel to the receiver and the receiver can again produce original image by stacking all the shares in proper order. But, this method wastes a lot of bandwidth of the network. The techniques of generating shares have been used in several existing methods which are not unique. The different methods have been used in different types of images like binary, gray and color images. In this paper, a block based symmetry key visual cryptography algorithm has been proposed to convert image in encrypted form and decrypt the encrypted image into original form. The symmetric key has been generated from a real number. The encryption and decryption algorithm have been designed based on symmetry key. The algorithm with key has been used to encrypt image into single share and decrypt the single share into original image. The real number has been used to form the key may be predefined or may be sent by secure channel to the receiver. The proposed algorithm can be applied to any type images i.e. binary, gray scale and color images. A comparison has been made of the proposed algorithm with different existing algorithms like Ceaser cipher, transpose of matrix, bit comp, and transposition cipher based on the performance. The pixels distributed in original and share images have also been tested. Finally, it has shown that breaking of security level of proposed algorithm i.e. to guess the real number is huge time consuming.

  13. Key distribution in PKC through Quantas

    CERN Document Server

    Goel, Aditya

    2010-01-01

    Cryptography literally means "The art & science of secret writing & sending a message between two parties in such a way that its contents cannot be understood by someone other than the intended recipient". and Quantum word is related with "Light". Thus, Quantum Cryptography is a way of descripting any information in the form of quantum particles. There are no classical cryptographic systems which are perfectly secure. In contrast to Classical cryptography which depends upon Mathematics, Quantum Cryptography utilizes the concepts of Quantum Physics which provides us the security against the cleverest marauders of the present age. In the view of increasing need of Network and Information Security, we do require methods to overcome the Molecular Computing technologies (A future technology) and other techniques of the various codebrakers. Both the parts i.e. Quantum Key distribution and Information transference from Sender to Receiver are much efficient and secure. It is based upon BB84 protocol. It can b...

  14. Identification key to Quivira milkweeds

    Data.gov (United States)

    US Fish and Wildlife Service, Department of the Interior — This document is a key to milkweed identification at Quivira National Wildlife Refuge. It contains a dichotomous key as well as a picture key. Milkweeds found on the...

  15. ALH84001: The Key to Unlocking Secrets About Mars-15 Years and Counting

    Science.gov (United States)

    Gibson, Everett K.

    2011-01-01

    From the December 27, 1984 discovery of ALH84001, and its subsequent identification as a sample of Mars in 1993, mystery and debate has surrounded the meteorite. With the realization that the ALH84001 sample was a orthopyroxenite and one of the oldest SNC meteorites (4.09 Ga) available to study, important and critical information about the Martian hydrosphere and atmosphere along with the early history and evolution of the planet could be obtained by studying the unique carbonate globules (3.9 Ga) in the sample. The initial work showed the carbonate globules were deposited within fractures and cracks in the host-orthopyroxene by low-temperature aqueous fluids. Ideas that the carbonates were formed at temperatures approaching 800oC were ruled out by later experiments. The 1996 announcement by McKay et al. that ALH84001 contained features which could be interpreted as having a biogenic origin generated considerable excitement and criticism. The NASA Administrator Dan Golden said the 1996 ALH84001 announcement saved NASA s Mars planetary exploration program and injected $6 billion dollars over five years into the scientific research and analysis efforts. All of the original four lines of evidence for possible biogenic features within ALH84001 offered by McKay et al. have withstood the test of time. Criticism has been directed at the interpretation of the 1996 analytical data. Research has expanded to other SNC meteorites. Despite the numerous attacks on the ideas, the debate continues after 15 years. The 2009 paper by Thomas-Keprta et al. on the origins of a suite of magnetites within the ALH84001 has offered strong arguments that some of the magnetites can only be formed by biogenic processes and not from thermal decomposition or shock events which happened to the meteorite. NASA s Astrobiology Institute was formed from the foundation laid by the ALH84001 hypothesis of finding life beyond the Earth. The strong astrobiology outreach programs have expanded because of the work done on the Martian meteorites. Despite the criticism on the biogenic-like features in ALH84001, the meteorite has opened a window into the early history of Mars. Clearly low-temperature fluids have left their signatures within the ALH84001 meteorite and subsequent cratering events on Mars have been recorded on observable features within the meteorite. The 15 years of detailed study on ALH84001 and its unique carbonate globules have clearly shown formational and secondary processes at work on Mars. The evidence for biogenic processes operating on early Mars along with ground water activity within the last 15% of the life of Mars offers clear evidence that another niche for life may be possible within our solar system. Now we need a well-documented Mars sample return mission.

  16. Lycaenid Caterpillar Secretions Manipulate Attendant Ant Behavior.

    Science.gov (United States)

    Hojo, Masaru K; Pierce, Naomi E; Tsuji, Kazuki

    2015-08-31

    Mutualistic interactions typically involve the exchange of different commodities between species. Nutritious secretions are produced by a number of insects and plants in exchange for services such as defense. These rewards are valuable metabolically and can be used to reinforce the behavior of symbiotic partners that can learn and remember them effectively. We show here novel effects of insect exocrine secretions produced by caterpillars in modulating the behavior of attendant ants in the food-for-defense interaction between lycaenid butterflies and ants. Reward secretions from the dorsal nectary organ (DNO) of Narathura japonica caterpillars function to reduce the locomotory activities of their attendant ants, Pristomyrmex punctatus workers. Moreover, workers that feed from caterpillar secretions are significantly more likely to show aggressive responses to eversion of the tentacle organs of the caterpillars. Analysis of the neurogenic amines in the brains of workers that consumed caterpillar secretions showed a significant decrease in levels of dopamine compared with controls. Experimental treatments in which reserpine, a known inhibitor of dopamine in Drosophila, was fed to workers similarly reduced their locomotory activity. We conclude that DNO secretions of lycaenid caterpillars can manipulate attendant ant behavior by altering dopaminergic regulation and increasing partner fidelity. Unless manipulated ants also receive a net nutritional benefit from DNO secretions, this suggests that similar reward-for-defense interactions that have been traditionally considered to be mutualisms may in fact be parasitic in nature. Copyright © 2015 Elsevier Ltd. All rights reserved.

  17. THE BUFFER CAPACITY OF AIRWAY EPITHELIAL SECRETIONS

    Directory of Open Access Journals (Sweden)

    Dusik eKim

    2014-06-01

    Full Text Available The pH of airway epithelial secretions influences bacterial killing and mucus properties and is reduced by acidic pollutants, gastric reflux, and respiratory diseases such as cystic fibrosis (CF. The effect of acute acid loads depends on buffer capacity, however the buffering of airway secretions has not been well characterized. In this work we develop a method for titrating micro-scale (30 µl volumes and use it to study fluid secreted by the human airway epithelial cell line Calu-3, a widely used model for submucosal gland serous cells. Microtitration curves revealed that HCO3- is the major buffer. Peak buffer capacity (β increased from 17 to 28 mM/pH during forskolin stimulation, and was reduced by >50% in fluid secreted by cystic fibrosis transmembrane conductance regulator (CFTR-deficient Calu-3 monolayers, confirming an important role of CFTR in HCO3- secretion. Back-titration with NaOH revealed non-volatile buffer capacity due to proteins synthesized and released by the epithelial cells. Lysozyme and mucin concentrations were too low to buffer Calu-3 fluid significantly, however model titrations of porcine gastric mucins at concentrations near the sol-gel transition suggest that mucins may contribute to the buffer capacity of ASL in vivo. We conclude that CFTR-dependent HCO3- secretion and epithelially-derived proteins are the predominant buffers in Calu-3 secretions.

  18. TRPM4 controls insulin secretion in pancreatic beta-cells.

    Science.gov (United States)

    Cheng, Henrique; Beck, Andreas; Launay, Pierre; Gross, Stefan A; Stokes, Alexander J; Kinet, Jean-Pierre; Fleig, Andrea; Penner, Reinhold

    2007-01-01

    TRPM4 is a calcium-activated non-selective cation channel that is widely expressed and proposed to be involved in cell depolarization. In excitable cells, TRPM4 may regulate calcium influx by causing the depolarization that drives the activation of voltage-dependent calcium channels. We here report that insulin-secreting cells of the rat pancreatic beta-cell line INS-1 natively express TRPM4 proteins and generate large depolarizing membrane currents in response to increased intracellular calcium. These currents exhibit the characteristics of TRPM4 and can be suppressed by expressing a dominant negative TRPM4 construct, resulting in significantly decreased insulin secretion in response to a glucose stimulus. Reduced insulin secretion was also observed with arginine vasopressin stimulation, a Gq-coupled receptor agonist in beta-cells. Moreover, the recruitment of TRPM4 currents was biphasic in both INS-1 cells as well as HEK-293 cells overexpressing TRPM4. The first phase is due to activation of TRPM4 channels localized within the plasma membrane followed by a slower secondary phase, which is caused by the recruitment of TRPM4-containing vesicles to the plasma membrane during exocytosis. The secondary phase can be observed during perfusion of cells with increasing [Ca(2+)](i), replicated with agonist stimulation, and coincides with an increase in cell capacitance, loss of FM1-43 dye, and vesicle fusion. Our data suggest that TRPM4 may play a key role in the control of membrane potential and electrical activity of electrically excitable secretory cells and the dynamic translocation of TRPM4 from a vesicular pool to the plasma membrane via Ca(2+)-dependent exocytosis may represent a key short- and midterm regulatory mechanism by which cells regulate electrical activity.

  19. Type IV Secretion System of Brucella spp. and its Effectors

    Directory of Open Access Journals (Sweden)

    Yuehua eKe

    2015-10-01

    Full Text Available Brucella spp. cause brucellosis in domestic and wild animals. They are intracellular bacterial pathogens and used as model organisms to study intracellular bacterial infections. Brucella VirB T4SS is a key virulence factor that plays important roles in mediating intracellular survival and manipulating host immune response to infection. In this review, we will discuss roles of Brucella VirB T4SS and in more detail of all 15 identified effectors, which may be crucial for Brucella pathogenesis. VirB T4SS regulates the inflammation response and manipulates vesicle trafficking inside host cells, suggesting that it plays crucial roles in the inhibition of the host immune response and intracellular survival during infection. So, we listed some key molecular events in the intracellular life cycle of Brucella potentially targeted by the VirB T4SS effectors. Elucidating functions of the effectors secreted will be crucial to clarifying mechanism of T4SS during infection. Studying the effectors secreted by Brucella spp. might provide insights into the mechanisms by which the bacteria hijack the host signaling pathways, which help us to develop better vaccines and therapies against brucellosis.

  20. Measurement-Device-Independent Quantum Key Distribution over Untrustful Metropolitan Network

    Directory of Open Access Journals (Sweden)

    Yan-Lin Tang

    2016-03-01

    Full Text Available Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds—security and practicality, constitutes an appealing solution to secure metropolitan communications.

  1. Security of public key encryption technique based on multiple chaotic systems

    Energy Technology Data Exchange (ETDEWEB)

    Wang Kai [Department of Radio Engineering, Southeast University, Nanjing 210096 (China)]. E-mail: kaiwang@seu.edu.cn; Pei Wenjiang [Department of Radio Engineering, Southeast University, Nanjing 210096 (China); Zou Liuhua [Department of Radio Engineering, Southeast University, Nanjing 210096 (China); Cheung Yiuming [Department of Computer Science, Hong Kong Baptist University, Hong Kong (China); He Zhenya [Department of Radio Engineering, Southeast University, Nanjing 210096 (China)

    2006-12-25

    Recently, a new public key encryption technique based on multiple chaotic systems has been proposed [B. Ranjan, Phys. Rev. Lett. 95 (2005) 098702]. This scheme employs m-chaotic systems and a set of linear functions for key exchange over an insecure channel. Security of the proposed algorithm grows as (NP){sup m}, where N, P are the size of the key and the computational complexity of the linear functions respectively. In this Letter, the fundamental weakness of the cryptosystem is pointed out and a successful attack is described. Given the public keys and the initial vector, one can calculate the secret key based on Parseval's theorem. Both theoretical and experimental results show that the attacker can access to the secret key without difficulty. The lack of security discourages the use of such algorithm for practical applications.

  2. Quantum Key Distribution Protocol with Private-Public Key

    OpenAIRE

    Serna, Eduin H.

    2009-01-01

    A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not make reconciliation mechanisms of information to derive the key. A three related system of key distribution are described.

  3. Digestive Secretion of Dionaea muscipula (Venus's Flytrap).

    Science.gov (United States)

    Scala, J; Iott, K; Schwab, D W; Semersky, F E

    1969-03-01

    The digestive fluid of Dionaea muscipula has been studied with respect to its protein content as a function of time after entrapment of protein material and some enzymes of the secretion. Maximum secretion of enzyme occurs within the first 3 days of the digestive cycle and protein reaches its maximum at 4 days. Phosphatase, proteinase, nuclease and amylase have been observed in the secretion. The enzymes have acid pH optima and the proteinase has a molecular weight of about 40,000.

  4. Digestive Secretion of Dionaea muscipula (Venus's Flytrap)

    Science.gov (United States)

    Scala, J.; Iott, K.; Schwab, D. W.; Semersky, F. E.

    1969-01-01

    The digestive fluid of Dionaea muscipula has been studied with respect to its protein content as a function of time after entrapment of protein material and some enzymes of the secretion. Maximum secretion of enzyme occurs within the first 3 days of the digestive cycle and protein reaches its maximum at 4 days. Phosphatase, proteinase, nuclease and amylase have been observed in the secretion. The enzymes have acid pH optima and the proteinase has a molecular weight of about 40,000. PMID:16657071

  5. Secreted HSP Vaccine for Malaria Prophylaxis

    Science.gov (United States)

    2016-10-26

    AWARD NUMBER: W81XWH-13-2-0098 TITLE: Secreted HSP Vaccine for Malaria Prophylaxis PRINCIPAL INVESTIGATOR: Dr. Natasa Strbo CONTRACTING ORGANIZATION...Secreted HSP Vaccine for Malaria Prophylaxis 4. TITLE AND SUBTITLE NATASA STRBO, M.D., D.SC NAME(S) AND E-M tzA UNIVERS]TY OF MTAMI 1600 NW 1OTH AVENUE ROOM...Here we developed malaria vaccine that relies on secreted gp96-lg chaperon-ing Plasmodium falciparum antigenic sporozoite proteins CSP and AMA1. The

  6. Hash function based secret sharing scheme designs

    CERN Document Server

    Chum, Chi Sing

    2011-01-01

    Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t+1, n) threshold scheme which is perfect and ideal, and then extend it to schemes for any general access structure. The schemes can be further set up as proactive or verifiable if necessary. The setup and recovery of the secret is efficient due to the fast calculation of the hash function. The proposed scheme is flexible because of the use of existing hash functions.

  7. Security of practical phase-coding quantum key distribution

    CERN Document Server

    Li, Hong-Wei; Han, Zheng-Fu; Bao, Wan-Su; Guo, Guang-Can

    2009-01-01

    Security proof of practical quantum key distribution (QKD) has attracted a lot of attentions in recent years. Most of real-life QKD implementations are based on phase-coding BB84 protocol, which usually uses Unbalanced Mach-Zehnder Interferometer (UMZI) as the information coder and decoder. However, the long arm and short arm of UMZI will introduce different loss in practical experimental realizations, the state emitted by Alice's side is nolonger standard BB84 states. In this paper, we will give a security analysis in this situation. Counterintuitively, active compensation for this different loss will only lower the secret key bit rate.

  8. Alternative schemes for measurement-device-independent quantum key distribution

    CERN Document Server

    Ma, Xiongfeng

    2012-01-01

    A practical scheme for measurement-device-independent quantum key distribution using phase and path/time encoding is presented. In addition to immunity to existing loopholes in detection systems, our setup employs simple encoding and decoding modules without relying on polarization maintenance or optical switches. Moreover, by handling, with a modified sifting technique, the dead time limitations in single-photon detectors, our scheme can be run with only two single-photon detectors. With a phase-post-selection technique, a decoy-state variant of our scheme is also proposed, whose secret key generation rate scales linearly with the channel transmittance.

  9. A Secure Authenticated Key Exchange Protocol for Credential Services

    Science.gov (United States)

    Shin, Seonghan; Kobara, Kazukuni; Imai, Hideki

    In this paper, we propose a leakage-resilient and proactive authenticated key exchange (called LRP-AKE) protocol for credential services which provides not only a higher level of security against leakage of stored secrets but also secrecy of private key with respect to the involving server. And we show that the LRP-AKE protocol is provably secure in the random oracle model with the reduction to the computational Difie-Hellman problem. In addition, we discuss about some possible applications of the LRP-AKE protocol.

  10. ID-based Key-insulated Authenticated Key Agreement Protocol

    Institute of Scientific and Technical Information of China (English)

    ZHOU Yuan; CHENG Xiao-ming; CHAI Zhen-chuan

    2007-01-01

    The basic idea behind an ID-based cryptosystem is that end user's public key can be determined by his identity information. Comparing with the traditional certificate-based cryptography, identity-based cryptography can eliminate much of the overhead associated with the deployment and management of certificate. However, exposure of private keys can be the most devastating attack on a public key based cryptosystem since such that all security guarantees are lost. In this paper, an ID-based authenticated key agreement protocol was presented. For solving the problem of key exposure of the basic scheme, the technique of key insulation was applied and a key insulated version is developed.

  11. Unconditional security of entanglement-based continuous-variable quantum secret sharing

    Science.gov (United States)

    Kogias, Ioannis; Xiang, Yu; He, Qiongyi; Adesso, Gerardo

    2017-01-01

    The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

  12. Paediatric pharmacokinetics: key considerations

    Science.gov (United States)

    Batchelor, Hannah Katharine; Marriott, John Francis

    2015-01-01

    A number of anatomical and physiological factors determine the pharmacokinetic profile of a drug. Differences in physiology in paediatric populations compared with adults can influence the concentration of drug within the plasma or tissue. Healthcare professionals need to be aware of anatomical and physiological changes that affect pharmacokinetic profiles of drugs to understand consequences of dose adjustments in infants and children. Pharmacokinetic clinical trials in children are complicated owing to the limitations on blood sample volumes and perception of pain in children resulting from blood sampling. There are alternative sampling techniques that can minimize the invasive nature of such trials. Population based models can also limit the sampling required from each individual by increasing the overall sample size to generate robust pharmacokinetic data. This review details key considerations in the design and development of paediatric pharmacokinetic clinical trials. PMID:25855821

  13. ABSTRACTS AND KEY WORDS

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    Determination of the Estrogen Alkylphenols and Bisphenol A in Marine Sediments by Gas Chromatography-Mass Spectrometry Deng Xu-xiu et al. (1) Abstract Octylphenol, nonylphenol and bisphenol A are recognized environmental endocrine disruptors. A quantitative method was established for the simultaneous determination of octylphenol, nonylphenol and bisphenol A in marine sediments by gas chromatography-mass spectrometry. The test sample was extracted by methanol with ultrasonic technique, purified with copper powder and carbon solid phase extraction column, and derived with heptafluorobutyric anhydride. Then the analytes were separated on HP-5ms column and determined by gas chromatography-mass. The recovery of the method was between 84.3% and 94.5%, and the LOQ of 4-N- octylphenol, nonylphenol and bisphenol A was 0.25 g/kg, 0.15 g/kg and 0.15 g/kg. Key words octylphenol; nonylphenol; bisphenol A; gas chromatography-mass spectrometry

  14. Key aspects congenital infection

    Directory of Open Access Journals (Sweden)

    Yu. V. Lobzin

    2014-01-01

    Full Text Available The key questions to solve the problem of congenital infection in the Russian Federation are: using in national practice over world accepted terminology adapted to the recommendations of the World Health Organization; representation of the modern concepts of an infectious process in the classification of congenital infections; scientific development and introducing in clinical practice the «standard case definitions», applied to different congenital infections; optimization of protocols and clinical guidelines for diagnosis, treatment and prevention of congenital infections; improvement a knowledge in the infectious disease for all  pecialists involved in the risk assessment of congenital infections, manage pregnancy and children. Based on our experience and analysis of publications, the authors suggest possible solutions.

  15. IGF-1 drives chromogranin A secretion via activation of Arf1 in human neuroendocrine tumour cells.

    Science.gov (United States)

    Münzberg, Christin; Höhn, Katharina; Krndija, Denis; Maaß, Ulrike; Bartsch, Detlef K; Slater, Emily P; Oswald, Franz; Walther, Paul; Seufferlein, Thomas; von Wichert, Götz

    2015-05-01

    Hypersecretion is the major symptom of functional neuroendocrine tumours. The mechanisms that contribute to this excessive secretion of hormones are still elusive. A key event in secretion is the exit of secretory products from the Golgi apparatus. ADP-ribosylation factor (Arf) GTPases are known to control vesicle budding and trafficking, and have a leading function in the regulation of formation of secretory granula at the Golgi. Here, we show that Arf1 is the predominant Arf protein family member expressed in the neuroendocrine pancreatic tumour cell lines BON and QGP-1. In BON cells Arf1 colocalizes with Golgi markers as well as chromogranin A, and shows significant basal activity. The inhibition of Arf1 activity or expression significantly impaired secretion of chromogranin A. Furthermore, we show that the insulin-like growth factor 1 (IGF-1), a major regulator of growth and secretion in BON cells, induces Arf1 activity. We found that activation of Arf1 upon IGF-1 receptor stimulation is mediated by MEK/ERK signalling pathway in BON and QGP-1 cells. Moreover, the activity of Arf1 in BON cells is mediated by autocrinely secreted IGF-1, and concomitantly, autocrine IGF1 secretion is maintained by Arf1 activity. In summary, our data indicate an important regulatory role for Arf1 at the Golgi in hypersecretion in neuroendocrine cancer cells.

  16. Sec16A is critical for both conventional and unconventional secretion of CFTR

    Science.gov (United States)

    Piao, He; Kim, Jiyoon; Noh, Shin Hye; Kweon, Hee-Seok; Kim, Joo Young; Lee, Min Goo

    2017-01-01

    CFTR is a transmembrane protein that reaches the cell surface via the conventional Golgi mediated secretion pathway. Interestingly, ER-to-Golgi blockade or ER stress induces alternative GRASP-mediated, Golgi-bypassing unconventional trafficking of wild-type CFTR and the disease-causing ΔF508-CFTR, which has folding and trafficking defects. Here, we show that Sec16A, the key regulator of conventional ER-to-Golgi transport, plays a critical role in the ER exit of protein cargos during unconventional secretion. In an initial gene silencing screen, Sec16A knockdown abolished the unconventional secretion of wild-type and ΔF508-CFTR induced by ER-to-Golgi blockade, whereas the knockdown of other COPII-related components did not. Notably, during unconventional secretion, Sec16A was redistributed to cell periphery and associated with GRASP55 in mammalian cells. Molecular and morphological analyses revealed that IRE1α-mediated signaling is an upstream regulator of Sec16A during ER-to-Golgi blockade or ER stress associated unconventional secretion. These findings highlight a novel function of Sec16A as an essential mediator of ER stress-associated unconventional secretion. PMID:28067262

  17. Identification of beer bitter acids regulating mechanisms of gastric acid secretion.

    Science.gov (United States)

    Walker, Jessica; Hell, Johannes; Liszt, Kathrin I; Dresel, Michael; Pignitter, Marc; Hofmann, Thomas; Somoza, Veronika

    2012-02-15

    Beer, one of the most consumed beverages worldwide, has been shown to stimulate gastric acid secretion. Although organic acids, formed by fermentation of glucose, are known to be stimulants of gastric acid secretion, very little is known about the effects of different types of beer or the active constituents thereof. In the present study, we compared the effects of different beers on mechanisms of gastric acid secretion. To investigate compound-specific effects on mechanisms of gastric acid secretion, organic acids and bitter compounds were quantified by HPLC-DAD and UPLC-MS/MS and tested in human gastric cancer cells (HGT-1) by means of a pH-sensitive fluorescent dye which determines the intracellular pH as an indicator of proton secretion. The expression of relevant genes, coding the H(+)/K(+)-ATPase, ATP4A, the histamine receptor, HRH2, the acetylcholine receptor, CHRM3, and the somatostatin receptor, SSTR2, was determined by qPCR. Ethanol and the organic acids succinic acid, malic acid, and citric acid were demonstrated to contribute to some extent to the effect of beer. The bitter acids comprising α-, β-, and iso-α-acids were identified as potential key components promoting gastric acid secretion and up-regulation of CHRM3 gene expression by a maximum factor of 2.01 compared to that of untreated control cells with a correlation to their respective bitterness.

  18. Feasibility of Double-Click Attack on a Passive Detection Quantum Key Distribution System

    Institute of Scientific and Technical Information of China (English)

    ZHANG Peng; LI Chao

    2011-01-01

    An eavesdropper (Eve) can exploit all the imperfections of a practical quantum key distribution (QKD) system to obtain some information about the secret key,no matter whether these imperfections are from the physical layer or from the post-processing layer.We propose a possible attack on a passive detection QKD system based on the imperfection from the software layer.The analysis shows that Eve can obtain all the information about the key without being discovered.

  19. Ca²⁺ signaling and regulation of fluid secretion in salivary gland acinar cells.

    Science.gov (United States)

    Ambudkar, Indu S

    2014-06-01

    Neurotransmitter stimulation of plasma membrane receptors stimulates salivary gland fluid secretion via a complex process that is determined by coordinated temporal and spatial regulation of several Ca(2+) signaling processes as well as ion flux systems. Studies over the past four decades have demonstrated that Ca(2+) is a critical factor in the control of salivary gland function. Importantly, critical components of this process have now been identified, including plasma membrane receptors, calcium channels, and regulatory proteins. The key event in activation of fluid secretion is an increase in intracellular [Ca(2+)] ([Ca(2+)]i) triggered by IP3-induced release of Ca(2+) from ER via the IP3R. This increase regulates the ion fluxes required to drive vectorial fluid secretion. IP3Rs determine the site of initiation and the pattern of [Ca(2+)]i signal in the cell. However, Ca(2+) entry into the cell is required to sustain the elevation of [Ca(2+)]i and fluid secretion. This Ca(2+) influx pathway, store-operated calcium influx pathway (SOCE), has been studied in great detail and the regulatory mechanisms as well as key molecular components have now been identified. Orai1, TRPC1, and STIM1 are critical components of SOCE and among these, Ca(2+) entry via TRPC1 is a major determinant of fluid secretion. The receptor-evoked Ca(2+) signal in salivary gland acinar cells is unique in that it starts at the apical pole and then rapidly increases across the cell. The basis for the polarized Ca(2+) signal can be ascribed to the polarized arrangement of the Ca(2+) channels, transporters, and signaling proteins. Distinct localization of these proteins in the cell suggests compartmentalization of Ca(2+) signals during regulation of fluid secretion. This chapter will discuss new concepts and findings regarding the polarization and control of Ca(2+) signals in the regulation of fluid secretion.

  20. Information Flow in Secret Sharing Protocols

    CERN Document Server

    Kashefi, Elham; Mhalla, Mehdi; Perdrix, Simon

    2009-01-01

    The entangled graph states have emerged as an elegant and powerful quantum resource, indeed almost all multiparty protocols can be written in terms of graph states including measurement based quantum computation (MBQC), error correction and secret sharing amongst others. In addition they are at the forefront in terms of implementations. As such they represent an excellent opportunity to move towards integrated protocols involving many of these elements. In this paper we look at expressing and extending graph state secret sharing and MBQC in a common framework and graphical language related to flow. We do so with two main contributions. First we express in entirely graphical terms which set of players can access which information in graph state secret sharing protocols. These succinct graphical descriptions of access allow us to take known results from graph theory to make statements on the generalisation of the previous schemes to present new secret sharing protocols. Second, we give a set of necessary condit...

  1. Secretion management in the mechanically ventilated patient

    Directory of Open Access Journals (Sweden)

    Mantellini E.

    2012-01-01

    Full Text Available Purpose: the aim of this work is to highlight the importance of a correct management of the secretions in the patient submitted to mechanical ventilation (MV. Methods: analysis of the current bibliography related to respiratory infections and secretion in patients with mechanically ventilation. We focus on the use of in-ex suflator achine (cough machine associated with High Frequency Chest Wall Oscillation (HFCWO.Results: we observe a reduction of pulmonary infection and a better management of bronchial secretion in patient undergone to the use of in-ex suflator machine (cough machine associated with High Frequency Chest Wall Oscillation (HFCWO.Conclusions: the correct approach to patients submitted to mechanical ventilation (MV expect the use of High Frequency Chest Wall Oscillation (HFCWO (VEST and in-ex suflator machine (cough machine to decrease pulmonary infection thank to a reduction of permanence of bronchial secretions in the lungs .

  2. Proton pump inhibitors inhibit pancreatic secretion

    DEFF Research Database (Denmark)

    Wang, Jing; Barbuskaite, Dagne; Tozzi, Marco

    2015-01-01

    +/K+-ATPases are expressed and functional in human pancreatic ducts and whether proton pump inhibitors (PPIs) have effect on those. Here we show that the gastric HKα1 and HKβ subunits (ATP4A; ATP4B) and non-gastric HKα2 subunits (ATP12A) of H+/K+-ATPases are expressed in human pancreatic cells. Pumps have similar...... of major ions in secretion follow similar excretory curves in control and PPI treated animals. In addition to HCO3-, pancreas also secretes K+. In conclusion, this study calls for a revision of the basic model for HCO3- secretion. We propose that proton transport is driving secretion, and that in addition...

  3. Acetylcholine regulates ghrelin secretion in humans

    NARCIS (Netherlands)

    F. Broglio (Fabio); E. Ghigo (Ezio); C. Gottero; F. Prodam (Flavia); S. Destefanis; A. Benso; C. Gauna (Carlotta); L.J. Hofland (Leo); E. Arvat; A-J. van der Lely (Aart-Jan); P.M. van Koetsveld (Peter)

    2004-01-01

    textabstractGhrelin secretion has been reportedly increased by fasting and energy restriction but decreased by food intake, glucose, insulin, and somatostatin. However, its regulation is still far from clarified. The cholinergic system mediates some ghrelin actions, e.g.

  4. Microbial cell surfaces and secretion systems

    NARCIS (Netherlands)

    Tommassen, J.P.M.; Wosten, H.A.B.

    2015-01-01

    Microbial cell surfaces, surface-exposed organelles, and secreted proteins are important for the interaction with the environment, including adhesion to hosts, protection against host defense mechanisms, nutrient acquisition, and intermicrobial competition. Here, we describe the structures of the ce

  5. Cell Secretion: Current Structural and Biochemical Insights

    Directory of Open Access Journals (Sweden)

    Saurabh Trikha

    2010-01-01

    Full Text Available Essential physiological functions in eukaryotic cells, such as release of hormones and digestive enzymes, neurotransmission, and intercellular signaling, are all achieved by cell secretion. In regulated (calcium-dependent secretion, membrane-bound secretory vesicles dock and transiently fuse with specialized, permanent, plasma membrane structures, called porosomes or fusion pores. Porosomes are supramolecular, cup-shaped lipoprotein structures at the cell plasma membrane that mediate and control the release of vesicle cargo to the outside of the cell. The sizes of porosomes range from 150nm in diameter in acinar cells of the exocrine pancreas to 12nm in neurons. In recent years, significant progress has been made in our understanding of the porosome and the cellular activities required for cell secretion, such as membrane fusion and swelling of secretory vesicles. The discovery of the porosome complex and the molecular mechanism of cell secretion are summarized in this article.

  6. Analysis of Information Leakage in Quantum Key Agreement

    Institute of Scientific and Technical Information of China (English)

    LIU Sheng-li; ZHENG Dong; CHENG Ke-fei

    2006-01-01

    Quantum key agreement is one of the approaches to unconditional security. Since 1980's, different protocols for quantum key agreement have been proposed and analyzed. A new quantum key agreement protocol was presented in 2004, and a detailed analysis to the protocol was given. The possible game played between legitimate users and the enemy was described:sitting in the middle, an adversary can play a "man-in-the-middle" attack to cheat the sender and receiver. The information leaked to the adversary is essential to the length of the final quantum secret key. It was shown how to determine the amount of information leaked to the enemy and the amount of uncertainty between the legitimate sender and receiver.

  7. SPEED AND SECURITY ENHANCEMENT THROUGH PUBLIC KEY CRYPTOGRAPHY

    Directory of Open Access Journals (Sweden)

    J.SAIGEETHA

    2010-08-01

    Full Text Available It is true that the transfer of data is essential in the fast developing world. It is equally true that the transfer of data tobe taken place with much security by not giving groom to the intruders. This paper presents the analysis of the security of information with enhanced the speed of encryption and decryption process. This process uses public key cryptography via RSA algorithm with some modification. There are two keys used in RSA algorithm foreffectiveness in the aspect of security one being the public key used for all and the other being the secret key. The implementation is done in the JAVA language and crypt analysis is performed to check the level of protection and speed .

  8. A New Three Dimensional Based Key Generation Technique in AVK

    Science.gov (United States)

    Banerjee, Subhasish; Dutta, Manash Pratim; Bhunia, Chandan Tilak

    2017-08-01

    In modern era, ensuring high order security becomes one and only objective of computer networks. From the last few decades, many researchers have given their contributions to achieve the secrecy over the communication channel. In achieving perfect security, Shannon had done the pioneer work on perfect secret theorem and illustrated that secrecy of the shared information can be maintained if the key becomes variable in nature instead of static one. In this regard, a key generation technique has been proposed where the key can be changed every time whenever a new block of data needs to be exchanged. In our scheme, the keys not only vary in bit sequences but also in size. The experimental study is also included in this article to prove the correctness and effectiveness of our proposed technique.

  9. Linear multi-secret sharing schemes

    Institute of Scientific and Technical Information of China (English)

    XIAO Liangliang; LIU Mulan

    2005-01-01

    In this paper the linear multi-secret sharing schemes are studied by using monotone span programs. A relation between computing monotone Boolean functions by using monotone span programs and realizing multi-access structures by using linear multisecret sharing schemes is shown. Furthermore, the concept of optimal linear multi-secret sharing scheme is presented and the several schemes are proved to be optimal.

  10. Secretion management in the mechanically ventilated patient

    OpenAIRE

    Mantellini E.; Perrero L.; Provenzano G.; Petrozzino S.

    2012-01-01

    Purpose: the aim of this work is to highlight the importance of a correct management of the secretions in the patient submitted to mechanical ventilation (MV). Methods: analysis of the current bibliography related to respiratory infections and secretion in patients with mechanically ventilation. We focus on the use of in-ex suflator achine (cough machine) associated with High Frequency Chest Wall Oscillation (HFCWO).Results: we observe a reduction of pulmonary infection and a better managemen...

  11. Secretion of invertase in mitotic yeast cells.

    OpenAIRE

    Makarow, M

    1988-01-01

    In mammalian cells intracellular transport is inhibited during mitosis. Here we show that in the yeast Saccharomyces cerevisiae secretion continues uninterrupted during mitosis. S. cerevisiae cells were arrested in mitosis by treating wild-type cells with the microtubule-inhibitor nocodazole, or by incubating a temperature-sensitive cell division cycle mutant (cdc16) at the restrictive temperature. Secretion of invertase into the periplasmic space was equally efficient in mitotic and in unsyn...

  12. Peptides and neurotransmitters that affect renin secretion

    Science.gov (United States)

    Ganong, W. F.; Porter, J. P.; Bahnson, T. D.; Said, S. I.

    1984-01-01

    Substance P inhibits renin secretion. This polypeptide is a transmitter in primary afferent neurons and is released from the peripheral as well as the central portions of these neurons. It is present in afferent nerves from the kidneys. Neuropeptide Y, which is a cotransmitter with norepinephrine and epinephrine, is found in sympathetic neurons that are closely associated with and presumably innervate the juxtagolmerular cells. Its effect on renin secretion is unknown, but it produces renal vasoconstriction and natriuresis. Vasoactive intestinal polypeptide (VIP) is a cotransmitter with acetylocholine in cholinergic neurons, and this polypeptide stimulates renin secretion. We cannot find any evidence for its occurence in neurons in the kidneys, but various stimuli increase plasma VIP to levels comparable to those produced by doses of exogenous VIP which stimulated renin secretion. Neostigmine increases plasma VIP and plasma renin activity, and the VIP appears to be responsible for the increase in renin secretion, since the increase is not blocked by renal denervation or propranolol. Stimulation of various areas in the brain produces sympathetically mediated increases in plasma renin activity associated with increases in blood pressure. However, there is pharmacological evidence that the renin response can be separated from the blood pressure response. In anaesthetized dogs, drugs that increase central serotonergic discharge increase renin secretion without increasing blood pressure. In rats, activation of sertonergic neurons in the dorsal raphe nucleus increases renin secretion by a pathway that projects from this nucleus to the ventral hypothalamus, and from there to the kidneys via the sympathetic nervous system. The serotonin releasing drug parachloramphetamine also increases plasma VIP, but VIP does not appear to be the primary mediator of the renin response. There is preliminary evidence that the serotonergic neurons in the dorsal raphe nucleus are part of the

  13. Percolation of secret in a network

    CERN Document Server

    Leverrier, Anthony

    2011-01-01

    In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks, more precisely the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

  14. Peptides and neurotransmitters that affect renin secretion

    Science.gov (United States)

    Ganong, W. F.; Porter, J. P.; Bahnson, T. D.; Said, S. I.

    1984-01-01

    Substance P inhibits renin secretion. This polypeptide is a transmitter in primary afferent neurons and is released from the peripheral as well as the central portions of these neurons. It is present in afferent nerves from the kidneys. Neuropeptide Y, which is a cotransmitter with norepinephrine and epinephrine, is found in sympathetic neurons that are closely associated with and presumably innervate the juxtagolmerular cells. Its effect on renin secretion is unknown, but it produces renal vasoconstriction and natriuresis. Vasoactive intestinal polypeptide (VIP) is a cotransmitter with acetylocholine in cholinergic neurons, and this polypeptide stimulates renin secretion. We cannot find any evidence for its occurence in neurons in the kidneys, but various stimuli increase plasma VIP to levels comparable to those produced by doses of exogenous VIP which stimulated renin secretion. Neostigmine increases plasma VIP and plasma renin activity, and the VIP appears to be responsible for the increase in renin secretion, since the increase is not blocked by renal denervation or propranolol. Stimulation of various areas in the brain produces sympathetically mediated increases in plasma renin activity associated with increases in blood pressure. However, there is pharmacological evidence that the renin response can be separated from the blood pressure response. In anaesthetized dogs, drugs that increase central serotonergic discharge increase renin secretion without increasing blood pressure. In rats, activation of sertonergic neurons in the dorsal raphe nucleus increases renin secretion by a pathway that projects from this nucleus to the ventral hypothalamus, and from there to the kidneys via the sympathetic nervous system. The serotonin releasing drug parachloramphetamine also increases plasma VIP, but VIP does not appear to be the primary mediator of the renin response. There is preliminary evidence that the serotonergic neurons in the dorsal raphe nucleus are part of the

  15. Characterization of Staphylococcus aureus EssB, an integral membrane component of the Type VII secretion system: atomic resolution crystal structure of the cytoplasmic segment

    OpenAIRE

    Zoltner, Martin; Fyfe, Paul K.; Palmer, Tracy; Hunter, William N.

    2012-01-01

    The Type VII protein translocation/secretion system, unique to Gram-positive bacteria, is a key virulence determinant in Staphylococcus aureus. We aim to characterize the architecture of this secretion machinery and now describe the present study of S. aureus EssB, a 52 kDa bitopic membrane protein essential for secretion of the ESAT-6 (early secretory antigenic target of 6 kDa) family of proteins, the prototypic substrate of Type VII secretion. Full-length EssB was heterologously expressed i...

  16. Quantum-Locked Key Distribution at Nearly the Classical Capacity Rate

    Science.gov (United States)

    Lupo, Cosmo; Lloyd, Seth

    2014-10-01

    Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This violation mirrors a large gap existing between two security criteria for quantum cryptography quantified by two entropic quantities: the Holevo information and the accessible information. We show that the latter becomes a sensible security criterion if an upper bound on the coherence time of the eavesdropper's quantum memory is known. Under this condition, we introduce a protocol for secret key generation through a memoryless qudit channel. For channels with enough symmetry, such as the d-dimensional erasure and depolarizing channels, this protocol allows secret key generation at an asymptotic rate as high as the classical capacity minus one bit.

  17. Spinal astrocytes produce and secrete dynorphin neuropeptides.

    Science.gov (United States)

    Wahlert, Andrew; Funkelstein, Lydiane; Fitzsimmons, Bethany; Yaksh, Tony; Hook, Vivian

    2013-04-01

    Dynorphin peptide neurotransmitters (neuropeptides) have been implicated in spinal pain processing based on the observations that intrathecal delivery of dynorphin results in proalgesic effects and disruption of extracellular dynorphin activity (by antisera) prevents injury evoked hyperalgesia. However, the cellular source of secreted spinal dynorphin has been unknown. For this reason, this study investigated the expression and secretion of dynorphin-related neuropeptides from spinal astrocytes (rat) in primary culture. Dynorphin A (1-17), dynorphin B, and α-neoendorphin were found to be present in the astrocytes, illustrated by immunofluorescence confocal microscopy, in a discrete punctate pattern of cellular localization. Measurement of astrocyte cellular levels of these dynorphins by radioimmunoassays confirmed the expression of these three dynorphin-related neuropeptides. Notably, BzATP (3'-O-(4-benzoyl)benzoyl adenosine 5'-triphosphate) and KLA (di[3-deoxy-D-manno-octulosonyl]-lipid A) activation of purinergic and toll-like receptors, respectively, resulted in stimulated secretion of dynorphins A and B. However, α-neoendorphin secretion was not affected by BzATP or KLA. These findings suggest that dynorphins A and B undergo regulated secretion from spinal astrocytes. These findings also suggest that spinal astrocytes may provide secreted dynorphins that participate in spinal pain processing.

  18. An unexpected knock on Corrigan's secret door.

    Science.gov (United States)

    Woywodt, Alexander

    2010-10-01

    Corrigan's secret door describes a metaphorical escape route for busy physicians. The term was derived from the successful and exceptionally busy professional life of Irish physician Dominic John Corrigan (1802-80). It is claimed that Corrigan's outpatient clinic was so busy that he required a secret door in his consulting rooms to escape from the ever-growing queue of eager patients. The origins of this charming story are unknown, and the door may have never existed. However, at present, Corrigan's secret door is often quoted when busy physicians have their own little ways in surviving a stressful professional life. Generations of British-trained doctors have grown up with Corrigan's secret door, as it was featured in the introduction of the Oxford Handbook of Clinical Medicine. Accordingly, trainees as well as more senior doctors are often reminded that having a 'secret door' is vital in surviving in the medical profession. My own escape is through classical music and the violoncello, in particular. As the name implies, my own secret door is normally invisible to colleagues and patients. This little article is about a patient who found me out, and a reflection on the role of classical music and the cello in my professional life.

  19. Nanofluids research: key issues.

    Science.gov (United States)

    Wang, Liqiu; Fan, Jing

    2010-05-22

    Nanofluids are a new class of fluids engineered by dispersing nanometer-size structures (particles, fibers, tubes, droplets) in base fluids. The very essence of nanofluids research and development is to enhance fluid macroscopic and megascale properties such as thermal conductivity through manipulating microscopic physics (structures, properties and activities). Therefore, the success of nanofluid technology depends very much on how well we can address issues like effective means of microscale manipulation, interplays among physics at different scales and optimization of microscale physics for the optimal megascale properties. In this work, we take heat-conduction nanofluids as examples to review methodologies available to effectively tackle these key but difficult problems and identify the future research needs as well. The reviewed techniques include nanofluids synthesis through liquid-phase chemical reactions in continuous-flow microfluidic microreactors, scaling-up by the volume averaging and constructal design with the constructal theory. The identified areas of future research contain microfluidic nanofluids, thermal waves and constructal nanofluids.

  20. Nanofluids Research: Key Issues

    Directory of Open Access Journals (Sweden)

    Wang Liqiu

    2010-01-01

    Full Text Available Abstract Nanofluids are a new class of fluids engineered by dispersing nanometer-size structures (particles, fibers, tubes, droplets in base fluids. The very essence of nanofluids research and development is to enhance fluid macroscopic and megascale properties such as thermal conductivity through manipulating microscopic physics (structures, properties and activities. Therefore, the success of nanofluid technology depends very much on how well we can address issues like effective means of microscale manipulation, interplays among physics at different scales and optimization of microscale physics for the optimal megascale properties. In this work, we take heat-conduction nanofluids as examples to review methodologies available to effectively tackle these key but difficult problems and identify the future research needs as well. The reviewed techniques include nanofluids synthesis through liquid-phase chemical reactions in continuous-flow microfluidic microreactors, scaling-up by the volume averaging and constructal design with the constructal theory. The identified areas of future research contain microfluidic nanofluids, thermal waves and constructal nanofluids.