全文获取类型
收费全文 | 2436篇 |
免费 | 243篇 |
国内免费 | 248篇 |
专业分类
化学 | 954篇 |
晶体学 | 16篇 |
力学 | 85篇 |
综合类 | 37篇 |
数学 | 1370篇 |
物理学 | 465篇 |
出版年
2024年 | 4篇 |
2023年 | 21篇 |
2022年 | 65篇 |
2021年 | 83篇 |
2020年 | 64篇 |
2019年 | 82篇 |
2018年 | 67篇 |
2017年 | 86篇 |
2016年 | 102篇 |
2015年 | 107篇 |
2014年 | 125篇 |
2013年 | 244篇 |
2012年 | 115篇 |
2011年 | 162篇 |
2010年 | 105篇 |
2009年 | 150篇 |
2008年 | 170篇 |
2007年 | 148篇 |
2006年 | 125篇 |
2005年 | 100篇 |
2004年 | 79篇 |
2003年 | 99篇 |
2002年 | 98篇 |
2001年 | 67篇 |
2000年 | 92篇 |
1999年 | 70篇 |
1998年 | 49篇 |
1997年 | 58篇 |
1996年 | 33篇 |
1995年 | 15篇 |
1994年 | 23篇 |
1993年 | 18篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 11篇 |
1989年 | 2篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 9篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有2927条查询结果,搜索用时 15 毫秒
1.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献
2.
ABSTRACTQM(UB3LYP)/MM(AMBER) calculations were performed for the locations of the transition structure (TS) of the oxygen–oxygen (O–O) bond formation in the S4 state of the oxygen-evolving complex (OEC) of photosystem II (PSII). The natural orbital (NO) analysis of the broken-symmetry (BS) solutions was also performed to elucidate the nature of the chemical bonds at TS on the basis of several chemical indices defined by the occupation numbers of NO. The computational results revealed a concerted bond switching (CBS) mechanism for the oxygen–oxygen bond formation coupled with the one-electron transfer (OET) for water oxidation in OEC of PSII. The orbital interaction between the σ-HOMO of the Mn(IV)4–O(5) bond and the π*-LUMO of the Mn(V)1=O(6) bond plays an important role for the concerted O–O bond formation for water oxidation in the CaMn4O6 cluster of OEC of PSII. One electron transfer (OET) from the π-HOMO of the Mn(V)1=O(6) bond to the σ*-LUMO of the Mn(IV)4–O(5) bond occurs for the formation of electron transfer diradical, where the generated anion radical [Mn(IV)4–O(5)]-? part is relaxed to the ?Mn(III)4?…?O(5)- structure and the cation radical [O(6)=Mn(V)1]+ ? part is relaxed to the +O(6)–Mn(IV)1? structure because of the charge-spin separation for the electron-and hole-doped Mn–oxo bonds. Therefore, the local spins are responsible for the one-electron reductions of Mn(IV)4->Mn(III)4 and Mn(V)1->Mn(IV)1. On the other hand, the O(5)- and O(6)+ sites generated undergo the O–O bond formation in the CaMn4O6 cluster. The Ca(II) ion in the cubane- skeleton of the CaMn4O6 cluster assists the above orbital interactions by the lowering of the orbital energy levels of π*-LUMO of Mn(V)1=O(6) and σ*-LUMO of Mn(IV)4–O(5), indicating an important role of its Lewis acidity. Present CBS mechanism for the O–O bond formation coupled with one electron reductions of the high-valent Mn ions is different from the conventional radical coupling (RC) and acid-base (AB) mechanisms for water oxidation in artificial and native photosynthesis systems. The proton-coupled electron transfer (PC-OET) mechanism for the O–O bond formation is also touched in relation to the CBS-OET mechanism. 相似文献
3.
束晕-混沌的复杂性理论与控制方法及其应用前景 总被引:18,自引:0,他引:18
本文系统论述涉及强流加速器等强流离子束装置中产生的束晕-混沌的复杂性理论与控制方法及其应用前景。强流离子束在核材料生产与增殖、洁净核能、放射性废物嬗变、放射性药物生产、重离子聚变、高能物理、核科学与工程、国防与民用工业和医疗等许多方面都有极其重要的应用潜力和诱人的发展前景。尤其是,近年来强流加速器驱动的放射性洁净核能系统是国内外关注的热门课题,因为它比常规核电更安全、更干净、更便宜。但是,强流离子束形成的束晕-混沌的复杂性现象已引起了国内外广泛关注,需要加以抑制、控制和消除这类现象,解决这一难题已经成为强流离子束应用中的关键问题之一。目前不仅必须深入研究这类束晕-混沌的复杂特性及其产生的物理机制,而且需要研究如何实现对束晕-混沌的有效控制,并寻求和发展其新理论、新方法和新技术。这就向强流离子束物理和非线性-复杂性科学及其技术提出了一系列极富挑战性的新课题。本文结合国内外的研究概况,根据我们多年来的研究成果,特别是我们首创性地提出了一些束晕-混沌的有效控制方法,它们包括:非线性反馈控制法,小波反馈控制法,变结构控制法,延迟反馈控制法,参数自适应控制法等,进行重点的介绍。对上述课题当前的主要进展及相关问题进行系统的总结和比较全面综述的评论。最后,指出该领域今后的研究方向,以推动这个崭新领域的深入研究和应用发展。 相似文献
4.
In mononuclear HgI2[(C5H4N)3N], mercury is tetrahedrally coordinated by two nitrogen atoms of a tris(2‐pyridyl)amine ligand and two iodides. The coordination moieties are connected by weak intermolecular Hg(II)···I interactions to give a one‐dimensional structure. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
5.
本文通过研究匹配问题的实例空间,匈牙利算法和解空间三者之间的关系,指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的,而如何对问题的解空间进行合理的分解才能是问题的关键。 相似文献
6.
Csilla Bujtás 《Discrete Applied Mathematics》2007,155(11):1395-1407
For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’ such that every C∈C meets some class in more than one vertex, and every D∈D has a nonempty intersection with at least two classes. A vertex-orderx1,x2,…,xn on X (n=|X|) is uniquely colorable if the subhypergraph induced by {xj:1?j?i} has precisely one coloring, for each i (1?i?n). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique. 相似文献
7.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献
8.
Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems. 相似文献
9.
Eduardo Mizraji 《Complexity》2004,9(6):33-42
This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004 相似文献
10.