نتایج جستجو برای: softcore and hardcore

تعداد نتایج: 16827261  

1993
B. R. Barrett

Two “phase-shift equivalent” local NN potentials with different parametrizations, Reid93 and NijmII, which were found to give nearly identical results for the triton by Friar et al., are shown to yield remarkably similar results for Li and N in a (0 + 2)h̄Ω no-core space shell-model calculation. The results are compared with those for the widely used Hamada-Johnson hard-core and the original Rei...

2007
Abbas Bigdeli Colin Sim Morteza Biglari-Abhari Brian C. Lovell

Over recent years automated face detection and recognition (FDR) have gained significant attention from the commercial and research sectors. This paper presents an embedded face detection solution aimed at addressing the real-time image processing requirements within a wide range of applications. As face detection is a computationally intensive task, an embedded solution would give rise to oppo...

Journal: :Journal of public health policy 2008
Michael O Chaiton Joanna E Cohen John Frank

The "hardening hypothesis" suggests that as smoking prevalence decreases, lighter smokers will quit first, leaving more "hardcore" smokers in the population. At a population level, however, the weight of evidence suggests that no hardening is occurring. By understanding the lessons from Geoffrey Rose's model of population-level risk factor change, we argue that the hardening of the smoking popu...

Journal: :Computers in Human Behavior 2014
Joyce L. D. Neys Jeroen Jansz Eduard S.-H. Tan

The question of why players of video games persist gaming in the face of what seems to be insufficient reward has not yet been properly answered. This paper approaches the issue by combining two general psychological theories: Self-determination Theory (Deci & Ryan, 2000) and Social Identity Theory (Tajfel & Turner, 1986). A large scale survey (N = 7252) enabled a comparison of three groups whi...

Journal: :Journal of Statistical Mechanics: Theory and Experiment 2017

Journal: :IACR Cryptology ePrint Archive 2013
Mihir Bellare Igors Stepanovs Stefano Tessaro

We show how to extract an arbitrary polynomial number of simultaneously hardcore bits from any oneway function. In the case the one-way function is injective or has polynomially-bounded pre-image size, we assume the existence of indistinguishability obfuscation (iO). In the general case, we assume the existence of differing-input obfuscation (diO), but of a form weaker than full auxiliary-input...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید