全文获取类型
收费全文 | 1778篇 |
免费 | 47篇 |
国内免费 | 8篇 |
专业分类
化学 | 1172篇 |
晶体学 | 5篇 |
力学 | 10篇 |
数学 | 369篇 |
物理学 | 277篇 |
出版年
2023年 | 11篇 |
2021年 | 32篇 |
2020年 | 25篇 |
2019年 | 21篇 |
2018年 | 27篇 |
2017年 | 21篇 |
2016年 | 46篇 |
2015年 | 56篇 |
2014年 | 67篇 |
2013年 | 97篇 |
2012年 | 81篇 |
2011年 | 87篇 |
2010年 | 73篇 |
2009年 | 64篇 |
2008年 | 90篇 |
2007年 | 76篇 |
2006年 | 80篇 |
2005年 | 80篇 |
2004年 | 62篇 |
2003年 | 52篇 |
2002年 | 53篇 |
2001年 | 31篇 |
2000年 | 41篇 |
1999年 | 27篇 |
1998年 | 20篇 |
1997年 | 10篇 |
1996年 | 19篇 |
1995年 | 18篇 |
1994年 | 23篇 |
1993年 | 11篇 |
1992年 | 26篇 |
1991年 | 26篇 |
1990年 | 29篇 |
1989年 | 13篇 |
1988年 | 14篇 |
1987年 | 17篇 |
1986年 | 15篇 |
1985年 | 19篇 |
1984年 | 18篇 |
1983年 | 18篇 |
1982年 | 17篇 |
1981年 | 14篇 |
1980年 | 19篇 |
1979年 | 13篇 |
1978年 | 17篇 |
1977年 | 16篇 |
1976年 | 17篇 |
1975年 | 8篇 |
1973年 | 9篇 |
1968年 | 7篇 |
排序方式: 共有1833条查询结果,搜索用时 18 毫秒
1.
The problem of the vector and axial-vector dominance of weak interactions within the framework of the quark model of superconductivity type is discussed. 相似文献
2.
In this paper, we show that in some cases, no proper covering of a locally compact group topologically generated by left translations
of a topological loop can occur as the group topologically generated by left translations of a topological loop.
__________
Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 22, Algebra
and Geometry, 2004. 相似文献
3.
The binding energy of excitonium negative ion for ground 1S-state in bulk conductors: Ge, Si, CdSe and for green and yellow lines of Cu2O in hyperspherical coordinate method are found. Angular and radial correlations between electrons are taken into account by the channel functions, which are the eigen-functions of operator on the surface of sphere in six-dimensional sphere. The calculation of energies have been done using the adiabatic and Born-Oppenheimer approximations. In Born-Oppenheimer approximation is enough to give a binding energy with only 1.2% error, in adiabatic approximation this error drops to 0.7 %. 相似文献
4.
Julien Ferrari Christian Terreaux Tibor Kurtn Attila Szikszai‐Kiss Sndor Antus JeromeD. Msonthi Kurt Hostettmann 《Helvetica chimica acta》2003,86(8):2768-2778
Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3. 相似文献
5.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
6.
We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour
hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check
the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization
problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and
the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located
by the new technique. 相似文献
7.
A two-dimensional framework (G,p) is
a graph G = (V,E) together with a map p: V → ℝ2. We view (G,p) as a straight line realization of G in ℝ2. Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length.
A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points
corresponding to u and v is the same
in all pairs of equivalent generic realizations of G. The graph G is globally rigid
if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the
first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs.
As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid
graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given
generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3]. 相似文献
8.
L. Villa P. D' Agati C. Mansueto C. Pellerito M. Scopelliti T. Fiore L. Nagy L. Pellerito 《应用有机金属化学》2003,17(2):106-112
Ascidia malaca gametes before fertilization incubated in 10?5 or 10?7 M solutions of tributyltin(IV) chloride, TBTCl, for 3 h appear highly damaged under transmission electron microscopy observation. Also, the fertilization process is affected by the compound: the damaged spermatozoa are present in the vitelline coat and the egg does not cleave. An increase of microbodies, structurally similar to peroxisomes, have been detected in the egg peripheral cytoplasm, probably in relation to their role in alleviating damage to some cellular components. The results have shown that the reproduction of ascidians under unfavourable environmental conditions is prevented. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
9.
The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date. 相似文献
10.
Deák L. Bottyán L. Major M. Nagy D. L. Spiering H. Szilágyi E. Tanczikó F. 《Hyperfine Interactions》2002,144(1-4):45-52
Hyperfine Interactions - Synchrotron Mössbauer Reflectometry (SMR), the grazing incidence nuclear resonant scattering of synchrotron radiation, can be applied to perform depth-selective phase... 相似文献