The distance of secret key distribution in the case of a strictly single-photon source has been analyzed for the BB84 protocol and phase time coding (the PTC protocol) protocols. It has been shown that the distance of...
详细信息
The distance of secret key distribution in the case of a strictly single-photon source has been analyzed for the BB84 protocol and phase time coding (the PTC protocol) protocols. It has been shown that the distance of secret key distribution ensured by the PTC protocol is almost 100 km longer than that by the BB84 protocol (the other parameters of the system being the same).
Unravelling the complete genetic predisposition to high blood pressure (BP) has proven to be challenging. This puzzle and the fact that coding regions of the genome account for less than 2% of the entire human DNA sup...
详细信息
Unravelling the complete genetic predisposition to high blood pressure (BP) has proven to be challenging. This puzzle and the fact that coding regions of the genome account for less than 2% of the entire human DNA support the hypothesis that genetic mechanism besides coding genes are likely to contribute to BP regulation. Non-coding RNAs (ncRNAs) are emerging as key players of transcription regulation in both health and disease states. They control basic functions in virtually all cell types relevant to the cardiovascular system and, thus, a direct involvement with BP regulation is highly probable. Here, we review the literature about ncRNAs associated with human BP and essential hypertension, highlighting investigations, methodology and difficulties arising in the field. The most investigated ncRNAs so far are microRNAs (miRNAs), small ncRNAs that modulate gene expression by posttranscriptional mechanisms. We discuss studies that have examined miRNAs associated with BP in biological fluids, such as blood and urine, and tissues, such as vascular smooth muscle cells and the kidney. Furthermore, we review the interaction between miRNA binding sites and single nucleotide polymorphisms in genes associated with BP. In conclusion, there is a clear need for more human and functional studies to help elucidate the multifaceted roles of ncRNAs, in particular mid-and long ncRNAs in BP regulation.
The aim of this paper is to investigate rotated versions of the densest known lattices in dimensions 2, 3, 4, 5, 6, 7, 8, 12 and 24 constructed via ideals and free Z-modules that are not ideals in subfields of cycloto...
详细信息
The aim of this paper is to investigate rotated versions of the densest known lattices in dimensions 2, 3, 4, 5, 6, 7, 8, 12 and 24 constructed via ideals and free Z-modules that are not ideals in subfields of cyclotomic fields. The focus is on totally real number fields and the associated full diversity lattices which may be suitable for signal transmission over both Gaussian and Rayleigh fading channels. We also discuss on the existence of a number field K such that it is possible to obtain the lattices A(2), E-6 and E-7 via a twisted embedding applied to a fractional ideal of O-K. (C) 2015 Elsevier Inc. All rights reserved.
In order to find a feasible solution for the multimode resource-constrained project scheduling problem (MRCPSP), a hybrid of particle swarm optimization (PSO) and differential evolution (DE) algorithm is proposed in t...
详细信息
In order to find a feasible solution for the multimode resource-constrained project scheduling problem (MRCPSP), a hybrid of particle swarm optimization (PSO) and differential evolution (DE) algorithm is proposed in this paper. The proposed algorithm uses a two-level coding structure. The upper-level structure is coded for scheduling sequence, which is optimized by PSO algorithm. The lower-level structure is coded for project execution mode, and DE algorithm is used to solve the optimal scheduling model. The effectiveness and advantages of the proposed algorithm are illustrated by using the test function of project scheduling problem library (PSPLIB) and comparing with other scheduling methods. The results show that the proposed algorithm can well solve MRCPSP.
Rudolph showed that the orbits of any measurable, measure preserving R-d action can be measurably tiled by 2(d) rectangles and asked if this number of tiles is optimal for d > 1. In this paper, using a tiling of R-...
详细信息
Rudolph showed that the orbits of any measurable, measure preserving R-d action can be measurably tiled by 2(d) rectangles and asked if this number of tiles is optimal for d > 1. In this paper, using a tiling of R-d by notched cubes, we show that d + 1 tiles suffice. Furthermore, using a detailed analysis of the set of invariant measures on tilings of R-2 by two rectangles, we show that while for R-2 actions with completely positive entropy this bound is optimal, there exist mixing R-2 actions whose orbits can be tiled by 2 tiles.
There are many generalizations of the Erdas-Ko-Rado theorem. Here the new results (and problem) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometr...
详细信息
There are many generalizations of the Erdas-Ko-Rado theorem. Here the new results (and problem) concern families of t-intersecting k-element multisets of an n-set. We point out connections to coding theory and geometry. We verify the conjecture that for n >= t (k - t) + 2 such a family can have at most ((n+k-t-1)(k-t)) members. (C) 2015 Elsevier Ltd. All rights reserved.
The codon-equivalent multiple alignment suite begins conservational analysis for polymerase chain reaction primer design at the protein level, allowing the user to design consensus primers capable of detecting homolog...
详细信息
The codon-equivalent multiple alignment suite begins conservational analysis for polymerase chain reaction primer design at the protein level, allowing the user to design consensus primers capable of detecting homologous coding sequences even when low-to-moderate sequence information is available. This package also condenses the wealth of information associated with multiple sequence alignments and presents them in an intuitive manner, allowing the user to quickly and effectively address degenerate primer design considerations.
In this work, we consider the problem of synchronizing two sets of data where the size of the symmetric difference between the sets is small and, in addition, the elements in the symmetric difference are related. In t...
详细信息
ISBN:
(纸本)9781467377041
In this work, we consider the problem of synchronizing two sets of data where the size of the symmetric difference between the sets is small and, in addition, the elements in the symmetric difference are related. In this introductory work, the elements within the symmetric difference are related through the Hamming distance metric. Upper and lower bounds are derived on the minimum amount of information exchange. Furthermore, explicit encoding and decoding algorithms are provided for special cases.
To transmit radio-astronomy and auxiliary data from a space radio telescope to a ground tracking station (and then to a correlator) via radio link it is necessary to use a special data format and coding and decoding p...
详细信息
To transmit radio-astronomy and auxiliary data from a space radio telescope to a ground tracking station (and then to a correlator) via radio link it is necessary to use a special data format and coding and decoding procedures. Here, the format developed and successfully implemented in the RadioAstron ground-space radio interferometer is considered in detail. The goal of the paper is to present the characteristics necessary for astronomers, observers, designers of tracking stations, and management and planning workgroups, as well as for testing for compatibility of the space radio telescope and tracking stations.
A (2, n) Visual Cryptography Scheme (VCS) is a kind of secret sharing scheme, where n participants share a secret image, and any two of them can recover the secret image visually without any cryptographic knowledge an...
详细信息
ISBN:
(数字)9783319193212
ISBN:
(纸本)9783319193212;9783319193205
A (2, n) Visual Cryptography Scheme (VCS) is a kind of secret sharing scheme, where n participants share a secret image, and any two of them can recover the secret image visually without any cryptographic knowledge and computation devices, but any one of them cannot get any information about the secret image other than the size of the secret image. This paper studies the (2, n) - V C S-XOR, and shows the smallest (optimal) pixel expansion of such scheme, and the largest possible contrast for the (2, n)-V C S-XOR given their optimal pixel expansion. It also shows the largest (optimal) contrast of the (2, n)-V C S-XOR, and the smallest possible pixel expansion of such schemes given their optimal contrast. The results of this paper show that the (2, n) -V C S-XOR can achieve smaller pixel expansion and larger contrast than that of (2, n) -V C S-OR. It also shows that the construction of the basis matrix of optimal contrast (2, n) -V C S-XOR is equivalent to the construction of binary codes when they reach the maximum capability, and the construction of a specific class of optimal contrast (2, n) - V C S-XOR for n = 2(k) - 1 is given.
暂无评论