Filters








34,715 Hits in 3.9 sec

Amplification by Read-Once Formulas

Moshe Dubiner, Uri Zwick
1997 SIAM journal on computing (Print)  
This result does not follow from Boppana's arguments, and it shows that the amount of amplification achieved by Valiant is the maximal achievable using read-once formulas.  ...  Boppana has shown that any monotone read-once formula that amplifies (p − 1 n ,p + 1 n )t o( 1 4 , 3 4 ) (where 0 <p<1 is constant) has size Ω(n α ) and that any monotone, not necessarily read-once, contact  ...  In section 8, we show that read-once formulas that include XOR gates can be simulated (as far as amplification is concerned) by probabilistic read-once formulas without XOR gates with no increase in size  ... 
doi:10.1137/s009753979223633x fatcat:lzyhv3iecjej3jyh6rrmxxuy44

Exact Identification of Circuits Using Fixed Points of Amplification Functions [chapter]

Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
1990 Colt Proceedings 1990  
In this paper we describe a new technique for ezactly identifying certain classes of read-once Boolean formulas.  ...  The method is based on sampling the input-output behavior of the target formula on a probability distribution which is determined by the fized point of the formula's amplification function (defined as  ...  See Figure 1 for a graph showing the amplification function for balanced read-once majority formulas of various depths.  ... 
doi:10.1016/b978-1-55860-146-8.50034-5 fatcat:lwaitljhffe47bw3jjenynp7ya

Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions

Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
1993 SIAM journal on computing (Print)  
In this paper we describe a new technique for exactly identifying certain classes of read-once Boolean formulas.  ...  probability that a 1 is output by the formula when each input bit is 1 independently with probability p).  ...  Exact Identification of Read-once Formulas Using Fixed Points of Amplification Functions Complete Abstract: In this paper we describe a new technique for exactly identifying certain classes of read-once  ... 
doi:10.1137/0222047 fatcat:pkhvbw6wd5c75ntv4idbxreovy

Page 4714 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
Circuits Systems 38 (1991), no. 11, 1377-1382].” 98g:94051 94C10 68Q05 Dubiner, Moshe (IL-TLAV; Tel Aviv); Zwick, Uri (IL-TLAV; Tel Aviv) Amplification by read-once formulas.  ...  Valiant used similar methods to construct mono- tone read-once formulas of size O(n%*?)  ... 

Page 6182 of Mathematical Reviews Vol. , Issue 91K [page]

1991 Mathematical Reviews  
A Boolean formula is said to be read once when each variable in the formula occurs at most once.  ...  of bounded depth monotone read-once Boolean formulae.  ... 

Design of Acoustic Emission Data Acquisition System of Wood Damage

Junmei Zhang, Yanyi Wang, Bowen Cheng, Shuai Wang
2015 International Journal of Control and Automation  
The preprocessing hardware system consists of preamplifier, filtering circuit, main amplification circuit and AD converting circuit.  ...  To sum up, the entire system can achieve the goal of distant detection of wood damage by gathering the acoustic emission signal whose frequency is from 100KHz to 300KHz and transmitting the processed data  ...  (Grant No:S1310022036) , which are greatly acknowledged by the authors.  ... 
doi:10.14257/ijca.2015.8.9.28 fatcat:st57fv6ttjf5rguxjufqxss4hm

Page 3502 of Mathematical Reviews Vol. , Issue 94f [page]

1994 Mathematical Reviews  
Louis, MO); Kearns, Michael J. (1-BELL; Murray Hill, NJ); Schapire, Robert E. (1-BELL; Murray Hill, NJ) Exact identification of read-once formulas using fixed points of amplification functions.  ...  Summary: “In this paper a new technique is described for ex- actly identifying certain classes of read-once Boolean formulas.  ... 

Page 329 of Journal of the American Oriental Society Vol. 38, Issue [page]

1918 Journal of the American Oriental Society  
There have been discovered about 20 new dates, amplifications of briefer formulae already known, and material for correcting conjectural readings of illegible published texts.  ...  Grice, of Yale University: Date formulae of the Larsa Dynasty.—Remarks by Professor Clay.  ... 

Page 329 of Journal of the American Oriental Society Vol. 38, Issue [page]

1918 Journal of the American Oriental Society  
There have been discovered about 20 new dates, amplifications of briefer formulae already known, and material for correcting conjectural readings of illegible published texts.  ...  Grick, of Yale University: Date formulae of the Larsa Dynasty.—Remarks by Professor Clay.  ... 

Page 176 of AT&T Technical Journal Vol. 6, Issue 1 [page]

1927 AT&T Technical Journal  
by Bowley.  ...  We who do not read the Scandinavian language owe much to him for his very able amplification and interpretation of many important contributions of the Scandinavian school of mathematical statisticians  ... 

Kvell+: Snapshot Isolation without Snapshots

Baptiste Lepers, Oana Balmau, Karan Gupta, Willy Zwaenepoel
2020 USENIX Symposium on Operating Systems Design and Implementation  
Versions are garbage collected when they can no longer be read by any OLAP query.  ...  We observe that analytic queries often consist in large part of commutative processing of data items resulting from range scans in which each item in the range is read exactly once.  ...  Second, OLAP queries read scanned items at most once.  ... 
dblp:conf/osdi/LepersBGZ20 fatcat:yabieoveaza5plpdlyehmcazry

Accommodative Haptics Study Based on Flexible Amplification Mechanism

Wenjing Wang, Qiuyue Du, Wenjing Chen, Bin Tian, Wenjing Wang
2020 Journal of Biology Engineering and Medicine  
The amplification ratio of formula calculation and FEA (Finite Element Analysis) are around 18.86 and 17.79, respectively, with the input displacement ranging from 0.115mm to 0.127mm.  ...  Based on the consideration of the offset of the rotation center of the flexible hinge, we have deduced the formula for calculating the amplification ratio of the proposed four-stage amplifier.  ...  Acknowledgements This study is financially supported by the National Natural Science Foundation of China (Grant No 51805009). Data Availability Statement  ... 
doi:10.31487/j.jbem.2020.01.03 fatcat:l42etrgzmjcvhpwwkax6fgcnoe

Design of Measuring Quartz Fiber Young's Modulus System

Yan-ru NI, Wei-bo ZHONG
2017 DEStech Transactions on Computer Science and Engineering  
Therefore, according to the principle of "stretch method" to measure Young's modulus, the amplification principle of the reading microscope, and making use of CCD video camera and monitors and other instruments  ...  By measuring the relevant data and computing, we give the measurement results of Young's modulus of quartz fiber. This conclusion is given in the case of small weight.  ...  Acknowledgement This research was supported by the Fujian Provincial Department of Education.  ... 
doi:10.12783/dtcse/smce2017/12397 fatcat:wtwldci33zg2ljax6m6akpkpji

A Composition Theorem for the Fourier Entropy-Influence Conjecture [chapter]

Ryan O'Donnell, Li-Yang Tan
2013 Lecture Notes in Computer Science  
As an application we show that the FEI conjecture holds for read-once formulas over arbitrary gates of bounded arity, extending a recent result [OWZ11] which proved it for read-once decision trees.  ...  We say that f is a read-once formula over B if every variable appears at most once in the formula for f . Proof. We proceed by structural induction on the formula computing f .  ...  read-once formulas with arbitrary gates of bounded arity.  ... 
doi:10.1007/978-3-642-39206-1_66 fatcat:yhbxrg4fr5d5dfjscfrvl4v34i

A composition theorem for the Fourier Entropy-Influence conjecture [article]

Ryan O'Donnell, Li-Yang Tan
2013 arXiv   pre-print
As an application we show that the FEI conjecture holds for read-once formulas over arbitrary gates of bounded arity, extending a recent result [OWZ11] which proved it for read-once decision trees.  ...  We say that f is a read-once formula over B if every variable appears at most once in the formula for f . Proof. We proceed by structural induction on the formula computing f .  ...  read-once formulas with arbitrary gates of bounded arity.  ... 
arXiv:1304.1347v1 fatcat:3rp3cwf5qzcqtclbu3dwmftp5u
« Previous Showing results 1 — 15 out of 34,715 results