全文获取类型
收费全文 | 25956篇 |
免费 | 3463篇 |
国内免费 | 1124篇 |
专业分类
化学 | 5919篇 |
晶体学 | 164篇 |
力学 | 3194篇 |
综合类 | 234篇 |
数学 | 11655篇 |
物理学 | 9377篇 |
出版年
2024年 | 48篇 |
2023年 | 249篇 |
2022年 | 464篇 |
2021年 | 558篇 |
2020年 | 675篇 |
2019年 | 643篇 |
2018年 | 501篇 |
2017年 | 681篇 |
2016年 | 923篇 |
2015年 | 726篇 |
2014年 | 1167篇 |
2013年 | 1878篇 |
2012年 | 1228篇 |
2011年 | 1282篇 |
2010年 | 1185篇 |
2009年 | 1448篇 |
2008年 | 1674篇 |
2007年 | 1764篇 |
2006年 | 1511篇 |
2005年 | 1295篇 |
2004年 | 1109篇 |
2003年 | 1198篇 |
2002年 | 1087篇 |
2001年 | 896篇 |
2000年 | 871篇 |
1999年 | 782篇 |
1998年 | 669篇 |
1997年 | 554篇 |
1996年 | 419篇 |
1995年 | 356篇 |
1994年 | 321篇 |
1993年 | 299篇 |
1992年 | 254篇 |
1991年 | 192篇 |
1990年 | 174篇 |
1989年 | 137篇 |
1988年 | 164篇 |
1987年 | 125篇 |
1986年 | 112篇 |
1985年 | 158篇 |
1984年 | 136篇 |
1983年 | 53篇 |
1982年 | 88篇 |
1981年 | 89篇 |
1980年 | 76篇 |
1979年 | 72篇 |
1978年 | 73篇 |
1977年 | 64篇 |
1976年 | 48篇 |
1974年 | 14篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
J.E. Lorenzo H. Requardt 《The European Physical Journal B - Condensed Matter and Complex Systems》2002,28(2):185-186
Eur. Phys. J. B 24, 315 (2001) Here we comment on a recently published paper on the presence of a phason contribution in the low temperature heat capacity data of the charge-density-wave compounds K0.3MoO3 and (TaSe4)2I. We have shown that the anomaly in the C
P
/
T
3
data reported by Odin et al. is straightforwardly interpreted in terms of low energy phonon modes resulting from the peculiar topology of these compounds.
Received 21 February 2002 Published online 19 July 2002 相似文献
102.
Blundell Tom L. Bolanos-Garcia Victor Chirgadze Dimitri Y. Harmer Nicholas J. Lo Thomas Pellegrini Luca Sibanda B. Lynn 《Structural chemistry》2002,13(3-4):405-412
Signaling in living systems needs to achieve high specificity, to be reversible, and to achieve high signal to noise. Signaling mediated by multiprotein systems has evolved that avoids the requirement for high-affinity binary complexes that would be difficult to reverse and which, in the overcrowded cell, would lead to excessive noise in the system. Symmetrical structures are only occasionally formed. When they are, it is principally to colocate components, for example, the tyrosyl kinases of growth factors, where dimers form. Symmetry is, however, often broken, presumably to create more sensitivity and specificity in the signaling system by assembling other components, into higher-order multiprotein systems. The binding of a single heparin to two 1:1 FGF:FGFR complexes is an example, as is the binding of a single ligase to the Xrcc4 dimer, perhaps so creating a further DNA-binding site. 相似文献
103.
104.
A family of skew Hadamard difference sets 总被引:1,自引:0,他引:1
Cunsheng Ding 《Journal of Combinatorial Theory, Series A》2006,113(7):1526-1535
In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics. 相似文献
105.
We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a
rectangular model consisting of square modules that are allowed to slide along or rotate about one another. That is, we show
that any two connected configurations of the same number of modules can be transformed into each other by a sequence of moves
so that all intermediate configurations are connected. This settles a conjecture formulated in [6]. 相似文献
106.
Nash Equilibria,Variational Inequalities,and Dynamical Systems 总被引:2,自引:0,他引:2
Cavazzuti E. Pappalardo M. Passacantando M. 《Journal of Optimization Theory and Applications》2002,114(3):491-506
In this paper, we introduce some relationships between Nash equilibria, variational equilibria, and dynamical equilibria for noncooperative games. 相似文献
107.
本文我们给出一个修正的非线性扩散方程模型,与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分:卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题,因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性,同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型,并且给出几个具体图像在该模型下处理结果。 相似文献
108.
Jeannette Van Iseghem 《Numerical Algorithms》2002,29(1-3):267-279
A method for solving a linear system is defined. It is a Lanczos-type method, but it uses formal vector orthogonality instead of scalar orthogonality. Moreover, the dimension of vector orthogonality may vary which gives a large freedom in leading the algorithm, and controlling the numerical problems. The ideas of truncated and restarted methods are revisited. The obtained residuals are exactly orthogonal to a space of increasing dimension. Some experiments are done, the problem of finding automaticaly good directions of projection remains partly open. 相似文献
109.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献
110.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献