全文获取类型
收费全文 | 488篇 |
免费 | 41篇 |
国内免费 | 1篇 |
专业分类
化学 | 396篇 |
力学 | 6篇 |
数学 | 61篇 |
物理学 | 67篇 |
出版年
2023年 | 13篇 |
2022年 | 9篇 |
2021年 | 20篇 |
2020年 | 16篇 |
2019年 | 9篇 |
2018年 | 17篇 |
2017年 | 6篇 |
2016年 | 24篇 |
2015年 | 28篇 |
2014年 | 33篇 |
2013年 | 39篇 |
2012年 | 38篇 |
2011年 | 52篇 |
2010年 | 31篇 |
2009年 | 17篇 |
2008年 | 35篇 |
2007年 | 20篇 |
2006年 | 34篇 |
2005年 | 18篇 |
2004年 | 18篇 |
2003年 | 21篇 |
2002年 | 8篇 |
2001年 | 1篇 |
2000年 | 7篇 |
1999年 | 2篇 |
1998年 | 1篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1968年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有530条查询结果,搜索用时 15 毫秒
61.
There are increasingly suggestions for computer simulations of quantum statistics which try to violate Bell type inequalities via classical, common cause correlations. The Clauser–Horne–Shimony–Holt (CHSH) inequality is very robust. However, we argue that with the Einstein–Podolsky–Rosen setup, the CHSH is inferior to the Bell inequality, although and because the latter must assume anti-correlation of entangled photon singlet states. We simulate how often quantum behavior violates both inequalities, depending on the number of photons. Violating Bell 99% of the time is argued to be an ideal benchmark. We present hidden variables that violate the Bell and CHSH inequalities with 50% probability, and ones which violate Bell 85% of the time when missing 13% anti-correlation. We discuss how to present the quantum correlations to a wide audience and conclude that, when defending against claims of hidden classicality, one should demand numerical simulations and insist on anti-correlation and the full amount of Bell violation. 相似文献
62.
63.
64.
65.
66.
MW Spectra of 3- and 4-fluoronitrobenzene in several torsional states and of 2- and 2,4,6-trifluoronitrobenzene in the ground state have been obtained. The inertial defects have been used to show that the 3- and 4-substituted molecules are planar and to find their twofold barriers (1428 cm?1 and 1213 cm?1 respectively). The 2- and 2,4,6-substituted molecules have very large negative inertial defects indicating non-planarity. The out-of-plane angles have been calculated (32° and 57° respectively). 相似文献
67.
In recent years interest in polyphenols as a nutrient in vegetables and fruits has increased because of polyphenols’ positive
effects on human health. The interest focuses on the sensory properties of polyphenols and their influence on the taste of
fruits and derived products. This article presents the development of a bioanalytical measurement technique enabling the determination
of the total polyphenol content (TPC) of fresh grapes within a few minutes. Furthermore this technique allows the control
of TPC during production processes, e. g. fermentation of wine. 相似文献
68.
Weiss ME Fischer DF Xin ZQ Jautze S Schweizer WB Peters R 《Angewandte Chemie (International ed. in English)》2006,45(34):5694-5698
69.
Sascha Bachmann Matthias Reitzner 《Stochastic Processes and their Applications》2018,128(10):3327-3352
Concentration bounds for the probabilities and are proved, where is a median or the expectation of a subgraph count associated with a random geometric graph built over a Poisson process. The lower tail bounds have a Gaussian decay and the upper tail inequalities satisfy an optimality condition. A remarkable feature is that the underlying Poisson process can have a.s. infinitely many points.The estimates for subgraph counts follow from tail inequalities for more general local Poisson U-statistics. These bounds are proved using recent general concentration results for Poisson U-statistics and techniques involving the convex distance for Poisson processes. 相似文献
70.
Andreas Darmann Edith Elkind Sascha Kurz Jérôme Lang Joachim Schauer Gerhard Woeginger 《International Journal of Game Theory》2018,47(3):767-796
We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on their preferences in a way that is socially optimal and/or stable. We put forward a general model for this setting, which is a natural generalization of anonymous hedonic games. We then focus on a special case of our model where agents’ preferences are binary, i.e., each agent classifies all pairs of the form ‘(activity, group size)’ into ones that are acceptable and ones that are not. We formulate several solution concepts for this scenario, and study them from the computational point of view, providing hardness results for the general case as well as efficient algorithms for settings where agents’ preferences satisfy certain natural constraints. 相似文献