Filters








37,028 Hits in 5.0 sec

Derivation of consistent hard rock (1000 < VS < 3000 m/s) GMPEs from surface and down-hole recordings: analysis of KiK-net data

A. Laurendeau, P.-Y. Bard, F. Hollender, V. Perron, L. Foundotos, O.-J. Ktenidou, B. Hernandez
2017 Bulletin of Earthquake Engineering  
A key component in seismic hazard assessment is the estimation of ground motion for hard rock sites, either for applications to installations built on this site category, or as an input motion for site  ...  As current GMPEs are poorly constrained for V S30 larger than 1000 m/s, the presently used approach for estimating hazard on hard rock sites consists of "host-to-target" adjustment techniques based on  ...  We are indebted to the National Research Institute for Earth Science and Disaster Prevention (NIED), Japan, for providing the KiKnet data and the F-NET information used for this analysis.  ... 
doi:10.1007/s10518-017-0142-6 fatcat:3whoykyq3bgf7ddvzufnbdunlu

A study of spectral and timing properties of Cyg X-1 based on a large sample of pointed RXTE observations

Marek Gierlinski, Andrzej A. Zdziarski, Chris Done
2010 arXiv   pre-print
We fit the obtained rms dependencies by physical models of varying accretion rate, a varying soft-photon input from an outer disc to a hot inner plasma, and a varying dissipation rate in a hot corona above  ...  We show the resulting correlations between the spectral colour (defining the hard, intermediate and soft spectral states), the Comptonization amplification factor, the fractional Compton reflection strength  ...  Figure 10 : 10 (a) The theoretical spectral variability pattern due to a changingṀ . (b) The fit of this pattern to the rms spectrum of Fig. 9(a) (hard state).  ... 
arXiv:1011.5840v1 fatcat:lkv2w5tnqzcbrlidzvyzqk7yqm

Using Nondeterminism to Amplify Hardness

Alexander Healy, Salil Vadhan, Emanuele Viola
2006 SIAM journal on computing (Print)  
We revisit the problem of hardness amplification in N P, as recently studied by O'Donnell (STOC '02).  ...  If s(n) = n ω(1) , we amplify to hardness 1/2 − 1/n ω(1) . 2. If s(n) = 2 n Ω(1) , we amplify to hardness 1/2−1/2 n Ω(1) . 3. If s(n) = 2 Ω(n) , we amplify to hardness 1/2−1/2 Ω( √ n) .  ...  An important tool for establishing this connection is the so-called hardcore set lemma of Impagliazzo [11] , which allows us to pass from computational hardness to information-theoretic hardness.  ... 
doi:10.1137/s0097539705447281 fatcat:ulfaf5cazzeppah3svqctlb3im

Using nondeterminism to amplify hardness

Alexander Healy, Salil Vadhan, Emanuele Viola
2004 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04  
We revisit the problem of hardness amplification in N P, as recently studied by O'Donnell (STOC '02).  ...  If s(n) = n ω(1) , we amplify to hardness 1/2 − 1/n ω(1) . 2. If s(n) = 2 n Ω(1) , we amplify to hardness 1/2−1/2 n Ω(1) . 3. If s(n) = 2 Ω(n) , we amplify to hardness 1/2−1/2 Ω( √ n) .  ...  An important tool for establishing this connection is the so-called hardcore set lemma of Impagliazzo [11] , which allows us to pass from computational hardness to information-theoretic hardness.  ... 
doi:10.1145/1007352.1007389 dblp:conf/stoc/HealyVV04 fatcat:qtcq6cji2ffozoxfag2heaumfm

Hardness Amplification of Optimization Problems

Elazar Goldenberg, Karthik C. S., Michael Wagner
2020 Innovations in Theoretical Computer Science  
Given a direct product feasible optimization problem Π, our hardness amplification theorem may be informally stated as follows: If there is a distribution D over instances of Π of size n such that every  ...  We say that an optimization problem Π is direct product feasible if it is possible to efficiently aggregate any k instances of Π and form one large instance of Π such that given an optimal feasible solution  ...  It would be interesting if this intuition/approach could be made to work.  ... 
doi:10.4230/lipics.itcs.2020.1 dblp:conf/innovations/GoldenbergS20 fatcat:nqnlm74n65f7tm22q4hetqiiv4

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification [chapter]

Sergei Artemenko, Ronen Shaltiel
2011 Lecture Notes in Computer Science  
This allows the proof of correctness of the reduction R to exploit specific properties of the function f , and was used to provide hardness amplification results beating the coding theoretic lower bounds  ...  We also consider a setting where the hardness amplification result is not required to work for every function f .  ...  Acknowledgements The second author is grateful to Oded Goldreich, Avi Wigderson and Emanuele Viola for many interesting discussions on hardness amplification.  ... 
doi:10.1007/978-3-642-22935-0_32 fatcat:t2dhkdu5vjerfabcsp7o6c4naa

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

Sergei Artemenko, Ronen Shaltiel
2013 Computational Complexity  
This allows the proof of correctness of the reduction R to exploit specific properties of the function f , and was used to provide hardness amplification results beating the coding theoretic lower bounds  ...  We also consider a setting where the hardness amplification result is not required to work for every function f .  ...  Acknowledgements The second author is grateful to Oded Goldreich, Avi Wigderson and Emanuele Viola for many interesting discussions on hardness amplification.  ... 
doi:10.1007/s00037-012-0056-2 fatcat:3e2x5jguajguvbx33o7j73wqtu

Effect of annealing ambient conditions on crack formation mechanisms of bulk Bi-2212 ceramic systems

U. Erdem, B. Akkurt, A.T. Ulgen, Y. Zalaoglu, T. Turgay, G. Yildirim
2021 Journal of Asian Ceramic Societies  
N) and some available theoretical approaches.  ...  The annealing ambient plays an important role on the operable slip systems and crystal quality.  ...  In the discussion part of theoretical approaches, the hardness behavior of Bi-2212 superconducting material is also determined with respect to the applied test loads [16] .  ... 
doi:10.1080/21870764.2021.1952746 fatcat:7u2wlwtnwjdirldr7rj7ifcmyu

On the Complexity of Hardness Amplification

Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
2008 IEEE Transactions on Information Theory  
To prove our results, we link the task of hardness amplifications and PRG constructions, respectively, to some type of error-reduction codes, and then we establish lower bounds for such codes, which we  ...  To guarantee the hardness of the resulting function f 0 , even against uniform machines, one has to start with a function f , which is hard against nonuniform algorithms with (k log(1=)) bits of advice  ...  ACKNOWLEDGMENT The authors would like to thank E. Viola for many helpful discussions and anonymous referees for their useful comments.  ... 
doi:10.1109/tit.2008.928988 fatcat:7niutgi45vdwhcuhg66cr2lgkq

Site amplification estimates in the Garigliano Valley, central Italy, based on dense array measurements of ambient noise

1994 International Journal of Rock Mechanics and Mining Sciences & Geomechanics Abstracts  
Layer thicknesses are constrained by the stratigraphic information provided by a deep hole drilled in the area, and shear velocities are estimated by means of a trial-and-error approach to achieve a satisfactory  ...  An overall agreement is found between the theoretical curve and the observed spectral ratios.  ...  The authors wish to thank personnel from ENEL, Direzione delle Costruzioni, for allowing access and measurements in reserved areas, Particular thanks are due to Raniero Berardi for discussions concerning  ... 
doi:10.1016/0148-9062(94)90512-6 fatcat:qdxdh77bdbh23ncgdnfq3krlqu

An overview of 11 proposals for building safe advanced AI [article]

Evan Hubinger
2020 arXiv   pre-print
This paper analyzes and compares 11 different proposals for building safe advanced AI under the current machine learning paradigm, including major contenders such as iterated amplification, AI safety via  ...  While prior literature has primarily focused on analyzing individual proposals, or primarily focused on outer alignment at the expense of inner alignment, this analysis seeks to take a comparative look  ...  Additionally, incorporating an RL loss enables directly training the model to solve long-term tasks involving difficult credit assignment problems that might be hard for imitative amplification alone to  ... 
arXiv:2012.07532v1 fatcat:mfcsnozm5rec7jksxvizhvz4pu

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

Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
1990 Colt Proceedings 1990  
By performing various statistical tests on easily sampled variants of the fixed-point distribution, we are able to efficiently infer all structural information about any logarithmic-depth target formula  ...  We also describe extensions of our algorithms to handle high rates of noise, and to learn formulas of unbounded depth in Valiant's model with respect to specific distributions.  ...  Acknowledgements We are grateful to Avrim Blum and Ron Rivest for helpful suggestions and discussions on this material.  ... 
doi:10.1016/b978-1-55860-146-8.50034-5 fatcat:lwaitljhffe47bw3jjenynp7ya

High speed and adaptable error correction for megabit/s rate quantum key distribution

A. R. Dixon, H. Sato
2014 Scientific Reports  
Quantum Key Distribution is moving from its theoretical foundation of unconditional security to rapidly approaching real world installations.  ...  As the redundant information can also be intercepted by an eavesdropper and so must be removed from the secure key it is important to minimise it, but in a complete QKD system it is necessary to also consider  ...  Acknowledgments The authors would like to thank Marco Lucamarini for his assistance with simulations. Author contributions A.D. performed all work described and prepared the manuscript.  ... 
doi:10.1038/srep07275 pmid:25450416 pmcid:PMC4250910 fatcat:e2zjb4xd3fc2dexymqijhuyd7a

A glasses-type wearable device for monitoring the patterns of food intake and facial activity

Jungman Chung, Jungmin Chung, Wonjun Oh, Yongkyu Yoo, Won Gu Lee, Hyunwoo Bang
2017 Scientific Reports  
However, such muscular signals are, in general, too weak to sense without amplification or an electromyographic analysis.  ...  We believe this approach will be helpful for designing a non-intrusive and un-obtrusive eyewear-based ingestive behavior monitoring system.  ...  (b) Comparison of the experimental amplification factor with the theoretical one.  ... 
doi:10.1038/srep41690 pmid:28134303 pmcid:PMC5278398 fatcat:7xzlg4cqpjaxjhe42t7lkit6ha

Theoretical and Practical Approaches for Hardness Amplification of PUFs [article]

Fatemeh Ganji, Shahin Tajik, Pascal Stauss, Jean-Pierre Seifert, Domenic Forte, Mark Mohammad Tehranipoor
2019 IACR Cryptology ePrint Archive  
The goal of studies on the hardness amplification is to build a strongly secure construction out of considerably weaker primitives.  ...  To this end, we first review an example of practical efforts made to construct more secure PUFs, namely the concept of rolling PUFs.  ...  Hence, we shift our focus to known approaches for hardness amplification acknowledged in the ML theory.  ... 
dblp:journals/iacr/GanjiTSSFT19 fatcat:yx6rbxabsraxdntxh67e4irjxm
« Previous Showing results 1 — 15 out of 37,028 results