Filters








330,013 Hits in 4.9 sec

Construction of a high-density genetic map and the X/Y sex-determining gene mapping in spinach based on large-scale markers developed by specific-locus amplified fragment sequencing (SLAF-seq)

Wei Qian, Guiyan Fan, Dandan Liu, Helong Zhang, Xiaowu Wang, Jian Wu, Zhaosheng Xu
2017 BMC Genomics  
At the same time, the sex-determining gene X/Y was mapped to LG4 with super-BSA.  ...  In this study, a high-density genetic map of spinach based on the Specific-locus Amplified Fragment Sequencing (SLAF-seq) technique was constructed; the sex-determining gene was also finely mapped.  ...  The strictly monoecious character was considered to be conditioned by the known allele X m [11] [12] [13] .  ... 
doi:10.1186/s12864-017-3659-9 pmid:28376721 pmcid:PMC5379770 fatcat:2k3la55yibhofjgjcicl7x2mbq

A Correction: On the Conditions of Success in the Construction and the Comparison of Standards of Length

1883 Proceedings of the American Society of Microscopists  
-Will you kindly allow me space for the correction of two or three errors which I have noticed in my paper on the "Conditions of Success in the Construction and the Comparison of Standards of Length,"  ...  The following are the more exact formulae for probable errors:n =-the number of values of a given function x. v = the difference between each value of x and the arithmetical mean of all the values.  ... 
doi:10.2307/3220372 fatcat:ijr42fnf5jg2pl7t7rzwywlnoa

Incremental construction of the saturated-GVG for multi-hypothesis topological SLAM

Tong Tao, Stephen Tully, George Kantor, Howie Choset
2011 2011 IEEE International Conference on Robotics and Automation  
The generalized Voronoi graph (GVG) is a topological representation of an environment that can be incrementally constructed with a mobile robot using sensor-based control.  ...  , we build upon previous work related to the S-GVG and provide two important contributions: 1) a rigorous discussion of the control laws and algorithm modifications that are necessary for incremental construction  ...  The control law performs sensor-based planning by controlling the heading of the robot in a way that merges the prediction and correction phases so as to avoid the jagged path generated by traditional  ... 
doi:10.1109/icra.2011.5980524 dblp:conf/icra/TaoTKC11 fatcat:amlayqngyfhdzo7jyfvj4eku74

STATISTICAL ASSESSMENT OF QUANTITATIVE QUALITY PERFORMANCE OF BUILDING PRODUCTS DURING CONFORMITY ASSESSMENT AND CERTIFICATION IN THE FIRE PROTECTION FIELD

Otto Dvořák
2015 Civil Engineering Journal  
This paper proposes statistical methods for evaluation of quantitative performance of building products determined by tests for objective decision during conformity assessment/certification in the fire  ...  value M0), then with a high probability (1 -α) will be MD < M < M0 < M < MH and the product can be approved (justified correct decision).  ...  STATISTICAL ASSESSMENT OF THE QUANTITATIVE RESULTS OF TEST DETERMINATIONS The quality of the material construction products may be characterized by the test of a quality feature e.g.  ... 
doi:10.14311/cej.2015.03.0016 fatcat:rxbqx624ingwrpi6fxvvwehix4

Approximate Sparse Recovery: Optimizing Time and Measurements [article]

Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2009 arXiv   pre-print
For each vector x, the system must succeed with probability at least 3/4.  ...  Given a vector, x, the system approximates x by x =D(Φ x), which must satisfy x - x_2< C x - x_k_2, where x_k denotes the optimal k-term approximation to x.  ...  xx 2 ≤ 2 ν 1 2 with probability 3/4.  ... 
arXiv:0912.0229v1 fatcat:m7axiuy36fe4lkcm5z7t6kkqlq

A constructive approach for developing probabilistic programs

Hassan Haghighi
2010 2010 18th Iranian Conference on Electrical Engineering  
Furthermore, having such a construct, we can derive functional, probabilistic programs from correctness proofs of their formal specifications written in the new type theoretical formalism.  ...  In this paper, we augment Martin-Löf's theory of types with a simple probabilistic construct enabling us to specify probabilistic programs formally.  ...  For instance, consider the following probabilistic specification by which we specify an operation that for each input value x, produces x + 1 with probability 0.5 and produces x − 1 with probability 0.5  ... 
doi:10.1109/iraniancee.2010.5507014 fatcat:smc2gf7fjzf2fpjicrjgbi42la

Use of Shor states for the [7,1,3] quantum error-correcting code

Yaakov S. Weinstein, Sidney D. Buchbinder
2012 Physical Review A. Atomic, Molecular, and Optical Physics  
We explore the effect of Shor state construction methods on logical state encoding and quantum error correction for the [[7,1,3]] Calderbank-Shor-Steane quantum error correction code in a nonequiprobable  ...  We demonstrate that the construction of logical zero states with no first order error terms may not require the complete edifice of quantum fault tolerance.  ...  y error with probability p y , and a σ j z error with probability p z , where σ j i , i = x, y, z are the Pauli spin operators on qubit j.  ... 
doi:10.1103/physreva.86.052336 fatcat:svkedc3fu5hczotaxusjidttim

Explicit Nonadaptive Combinatorial Group Testing Schemes

Ely Porat, Amir Rothschild
2011 IEEE Transactions on Information Theory  
In our construction we use a fact that may have a value by its own right: Linear error-correction codes with parameters [m, k, δm] q meeting the Gilbert-Varshamov bound may be constructed quite efficiently  ...  Group testing is a long studied problem in combinatorics: A small set of r ill people should be identified out of the whole (n people) by using only queries (tests) of the form "Does set X contain an ill  ...  More precisely, Definition 3.1 Given a subset A ⊂ U of a universe U , element x ∈ A is selected by subset B ⊂ U if A ∩ B = {x}.  ... 
doi:10.1109/tit.2011.2163296 fatcat:vcnrtzt7qneybiam6wawtwt32i

Explicit Non-adaptive Combinatorial Group Testing Schemes [chapter]

Ely Porat, Amir Rothschild
2008 Lecture Notes in Computer Science  
In our construction we use a fact that may have a value by its own right: Linear error-correction codes with parameters [m, k, δm] q meeting the Gilbert-Varshamov bound may be constructed quite efficiently  ...  Group testing is a long studied problem in combinatorics: A small set of r ill people should be identified out of the whole (n people) by using only queries (tests) of the form "Does set X contain an ill  ...  More precisely, Definition 3.1 Given a subset A ⊂ U of a universe U , element x ∈ A is selected by subset B ⊂ U if A ∩ B = {x}.  ... 
doi:10.1007/978-3-540-70575-8_61 fatcat:2clr4pgjr5cobm7yzashye4v6m

Page 716 of Mathematical Reviews Vol. 51, Issue 2 [page]

1976 Mathematical Reviews  
The first part deals with the construction of maximal codes. Maximal codes are codes which meet the Plotkin bound.  ...  Some of these can correct as long a burst as theoretically possible. The third construction produces codes that correct low-density type-B, bursts of length rn.  ... 

From Generalization of Bacon-Shor Codes to High Performance Quantum LDPC Codes [article]

Jihao Fan, Jun Li, Ya Wang, Yonghui Li, Min-Hsiu Hsieh, Jiangfeng Du
2021 arXiv   pre-print
We utilize a concatenation scheme to construct new families of quantum error correction codes that include the Bacon-Shor codes.  ...  To the best of our knowledge, they are the most powerful quantum codes for correcting so many adversarial errors in sublinear time by far.  ...  Denote by p x the probability of each X-error. It is shown that A can correct any adversarial X-error e X of weight less than half the X distance bound in Theorem 3.  ... 
arXiv:2107.05174v1 fatcat:m67k5kqgrveu3lf7nzcngl3i2m

Page 204 of American Anthropologist Vol. 66, Issue 3 [page]

1964 American Anthropologist  
When the mean stationarity curve is constructed by averaging over a fixed block of trials for all subjects, this individual difference is not accounted for.  ...  Subjects who meet criterion early may favorably weight the total proportion of correct responses in early trials and thus support the null hypothesis of stationarity.  ... 

Explicit Non-Adaptive Combinatorial Group Testing Schemes [article]

Ely Porat, Amir Rothschild
2008 arXiv   pre-print
In our construction we use a fact that may have a value by its own right: Linear error-correction codes with parameters [m,k,δ m]_q meeting the Gilbert-Varshamov bound may be constructed quite efficiently  ...  Group testing is a long studied problem in combinatorics: A small set of r ill people should be identified out of the whole (n people) by using only queries (tests) of the form "Does set X contain an ill  ...  More precisely, Definition 3.1 Given a subset A ⊂ U of a universe U , element x ∈ A is selected by subset B ⊂ U if A ∩ B = {x}.  ... 
arXiv:0712.3876v5 fatcat:cmsavxtbdzfhnf6knlqu7w2cue

Recovery-Key Attacks against TMN-family Framework for Mobile Wireless Networks

2021 KSII Transactions on Internet and Information Systems  
In this study, we demonstrate new probability results on the security of the two TMN construction versions -TMN64 and TMN128, by proposing efficient related-key recovery attacks.  ...  The high probability characteristics (DCs) are constructed under the related-key differential properties on a full number of function rounds of TMN64 and TMN128, as 10-rounds and 12rounds, respectively  ...  TMN block cipher [1] is kind of DDO-based construction proposed by Tuan P.M., Do Thi B., etc., in 2016.  ... 
doi:10.3837/tiis.2021.06.012 fatcat:4cdu2mcr3beebb736vvsuohl34

How Often Should You Beat Your Kids?

Don Zagier
1990 Mathematics Magazine  
+ 7 Y. e-r /n + feu /ndu + - e u du. 2r =O 2 Probability Probability distribution distribution of kid's of one's own number of number of correct guesses correct guesses O(r4m) n  ...  DON ZAGIER University of Maryland College Park, MD 20742 Since k/ xn is almost always very near to 'm/ x/W, the probability of winning when m(p) = m is very nearly equal to Multiplying this by  ... 
doi:10.2307/2691064 fatcat:z4fdwxawyza5jgg6e673bndzum
« Previous Showing results 1 — 15 out of 330,013 results