全文获取类型
收费全文 | 1385篇 |
免费 | 161篇 |
国内免费 | 64篇 |
专业分类
化学 | 222篇 |
晶体学 | 1篇 |
力学 | 34篇 |
综合类 | 159篇 |
数学 | 745篇 |
物理学 | 449篇 |
出版年
2024年 | 3篇 |
2023年 | 23篇 |
2022年 | 29篇 |
2021年 | 34篇 |
2020年 | 35篇 |
2019年 | 49篇 |
2018年 | 32篇 |
2017年 | 30篇 |
2016年 | 39篇 |
2015年 | 32篇 |
2014年 | 56篇 |
2013年 | 59篇 |
2012年 | 37篇 |
2011年 | 58篇 |
2010年 | 58篇 |
2009年 | 96篇 |
2008年 | 75篇 |
2007年 | 91篇 |
2006年 | 87篇 |
2005年 | 79篇 |
2004年 | 62篇 |
2003年 | 67篇 |
2002年 | 64篇 |
2001年 | 45篇 |
2000年 | 38篇 |
1999年 | 39篇 |
1998年 | 33篇 |
1997年 | 28篇 |
1996年 | 31篇 |
1995年 | 52篇 |
1994年 | 24篇 |
1993年 | 26篇 |
1992年 | 17篇 |
1991年 | 9篇 |
1990年 | 13篇 |
1989年 | 13篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1610条查询结果,搜索用时 140 毫秒
41.
《Annals of Pure and Applied Logic》2022,173(10):103088
We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of dependence and independence, which are based on team semantics. We show that common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae. Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria. We also discuss the ‘no-go’ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property. 相似文献
42.
43.
R. L. Schafir 《Foundations of Physics Letters》1996,9(1):91-101
It is shown that nonlocality gives rise to an undecidable proposition, meaning it cannot be proved true nor proved false from the usual assumptions, but is independent of them. A variation on the usual thought experiment is considered in which the observers are timelike separated, but the nonlocality fails to become a precognition effect because of this independence result. 相似文献
44.
Tidjani Ngadi 《International journal of quantum chemistry》2003,94(2):65-74
In this article, we make a connection between the Rumer transformation, used in the study of the genetic code‐doublets, and the negation of classic logic. A unified classification is given, relying on two Klein's 4‐groups describing the symmetries of the 16 doublets of nitrogenous bases and those of the 16 binary connectives of classic logic, both groups being subgroups of a larger noncommutative group with eight elements we identify as the dihedral group D4. Also, some connections with other works are briefly considered. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem, 2003 相似文献
45.
46.
A general approach to information correction and fusion for belief functions is proposed, where not only may the information items be irrelevant, but sources may lie as well. We introduce a new correction scheme, which takes into account uncertain metaknowledge on the source’s relevance and truthfulness and that generalizes Shafer’s discounting operation. We then show how to reinterpret all connectives of Boolean logic in terms of source behavior assumptions with respect to relevance and truthfulness. We are led to generalize the unnormalized Dempster’s rule to all Boolean connectives, while taking into account the uncertainties pertaining to assumptions concerning the behavior of sources. Eventually, we further extend this approach to an even more general setting, where source behavior assumptions do not have to be restricted to relevance and truthfulness. We also establish the commutativity property between correction and fusion processes, when the behaviors of the sources are independent. 相似文献
47.
This study has presented a performance investigation of an advanced tracked prime mover for the operation of agricultural goods and other operations on peat terrain. The maximum and continuous traction torque of the prime mover has been developed by designing an advanced controller for controlling the intelligent system. The prime mover’s mobility is studied with ultrasonic displacement sensor, torque transducer, National Instrument cRIO-9004 Compact-RIO Real-time Controller Unit (RCU), a National Instrument TPC 2106T Touch Panel Control (TPC), a Trimble AG132 GPS antenna and receiver unit, and a Dlink DIR-655 router. The fuzzy logic controller (FLC) has been equipped with the prime mover hydraulic system to increase the traction torque of the hydraulic motor when the prime mover’s sinkage is more than or equal to 70 mm. The prime mover’s design demonstrates good potential in traversing peat terrain as the measured tractive effort was found to be 48% of the vehicle’s gross weight while the recommended tractive effort is in the range of 30–36% of the vehicle’s gross weight. 相似文献
48.
Die Chen Dr. Shu Yang Huayi Han Lingbo Song Dr. Dan Huang Xiao Lin Dr. Xiaoping Xu Dr. Qianfan Yang 《Chemistry (Weinheim an der Bergstrasse, Germany)》2021,27(45):11627-11632
DNA computation is considered a fascinating alternative to silicon-based computers; it has evoked substantial attention and made rapid advances. Besides realizing versatile functions, implementing spatiotemporal control of logic operations, especially at the cellular level, is also of great significance to the development of DNA computation. However, developing simple and efficient methods to restrict DNA logic gates performing in live cells is still a challenge. In this work, a series of DNA logic gates was designed by taking full advantage of the diversity and programmability of the G-quadruplex (G4) structure. More importantly, by further using the high affinity and specific endocytosis of cells to aptamer G4, an INHIBIT logic gate has been realized whose operational site is precisely restricted to specific live cells. The design strategy might have great potential in the field of molecular computation and smart bio-applications. 相似文献
49.
Two-Photon-Induced CO-Releasing Molecules as Molecular Logic Systems in Solution,Polymers, and Cells
Dr. Vadde Ramu Dr. Gandra Upendar Reddy Dr. Jingjing Liu Patrick Hoffmann Dr. Rudrakant Sollapur Dr. Ralf Wyrwa Dr. Stephan Kupfer Prof. Dr. Christian Spielmann Dr. Sylvestre Bonnet Prof. Dr. Ute Neugebauer Dr. Alexander Schiller 《Chemistry (Weinheim an der Bergstrasse, Germany)》2019,25(36):8453-8458
Phototherapeutic applications of carbon monoxide (CO)-releasing molecules are limited because they require harmful UV and blue light for activation. We describe two-photon excitation with NIR light (800 nm)-induced CO-release from two MnI tricarbonyl complexes bearing 1,8-naphthalimide units ( 1 , 2 ). Complex 2 behaves as a logic OR gate in solution, nonwovens, and in HeLa cells. CO release, indicated by fluorescence enhancement, was detected in solution, nonwoven, and HeLa cells by single- (405 nm) and two-photon (800 nm) excitation. The photophysical properties of 1 and 2 have been measured and supported by DFT and TDDFT quantum chemical calculations. Both photoCORMs are stable in the dark in solution and noncytotoxic, leading to promising applications as phototherapeutics with NIR light. 相似文献
50.
《Annals of Pure and Applied Logic》2022,173(3):103071
In standard epistemic logic, the names and the existence of agents are usually assumed to be common knowledge implicitly. This is unreasonable for various applications in computer science and philosophy. Inspired by term-modal logic and assignment operators in dynamic logic, we introduce a lightweight modal predicate logic where names can be non-rigid, and the existence of agents can be uncertain. The language can handle various de dicto/de re distinctions in a natural way. We characterize the expressive power of our language, obtain complete axiomatisations of the logics over several classes of varying-domain/constant-domain epistemic models, and show their (un)decidability. 相似文献