全文获取类型
收费全文 | 15600篇 |
免费 | 1473篇 |
国内免费 | 860篇 |
专业分类
化学 | 4846篇 |
晶体学 | 70篇 |
力学 | 1234篇 |
综合类 | 225篇 |
数学 | 9191篇 |
物理学 | 2367篇 |
出版年
2024年 | 25篇 |
2023年 | 126篇 |
2022年 | 395篇 |
2021年 | 491篇 |
2020年 | 358篇 |
2019年 | 403篇 |
2018年 | 368篇 |
2017年 | 555篇 |
2016年 | 582篇 |
2015年 | 444篇 |
2014年 | 800篇 |
2013年 | 1117篇 |
2012年 | 994篇 |
2011年 | 873篇 |
2010年 | 797篇 |
2009年 | 940篇 |
2008年 | 975篇 |
2007年 | 1047篇 |
2006年 | 790篇 |
2005年 | 715篇 |
2004年 | 539篇 |
2003年 | 516篇 |
2002年 | 461篇 |
2001年 | 454篇 |
2000年 | 405篇 |
1999年 | 330篇 |
1998年 | 304篇 |
1997年 | 284篇 |
1996年 | 220篇 |
1995年 | 242篇 |
1994年 | 199篇 |
1993年 | 176篇 |
1992年 | 162篇 |
1991年 | 132篇 |
1990年 | 90篇 |
1989年 | 84篇 |
1988年 | 68篇 |
1987年 | 52篇 |
1986年 | 52篇 |
1985年 | 68篇 |
1984年 | 57篇 |
1983年 | 21篇 |
1982年 | 40篇 |
1981年 | 23篇 |
1980年 | 19篇 |
1979年 | 37篇 |
1978年 | 24篇 |
1977年 | 30篇 |
1976年 | 18篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
91.
Xuyuan GuScott Cowell Jinfa YingXuejun Tang Victor J. Hruby 《Tetrahedron letters》2003,44(31):5863-5866
(2S,3S)- and (2R,3R)-2-amino-3-phenyl-5-hexenoic acids have been synthesized in large scale by using Ni(II)-complexes as a template. The amino acids were used in the synthesis of [4,3,0]-bicyclic β-turn mimetics by a convergent methodology. The unique advantage of this strategy is the convenience of introducing side chain groups with predetermined chiralities on both the five- and six-membered heterocyclic rings. 相似文献
92.
Arnold Neumaier 《Journal of Global Optimization》2003,25(2):175-181
A family of multivariate rational functions is constructed. It has strong local minimizers with prescribed function values at prescribed positions. While there might be additional local minima, such minima cannot be global. A second family of multivariate rational functions is given, having prescribed global minimizers and prescribed interpolating data. 相似文献
93.
Capacity Constrained Transit Assignment with Common Lines 总被引:1,自引:0,他引:1
Fumitaka Kurauchi Michael G. H. Bell Jan-Dirk Schmöcker 《Journal of Mathematical Modelling and Algorithms》2003,2(4):309-327
This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking
common lines into account. The approach handles congested transit networks, where some passengers will not be able to board
because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends
on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献
94.
95.
In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The
probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution
of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration
scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number
of trials and derive the probability generating functions. The present work extends several properties of distributions of
orderk and leads us a new type of geneses of the discrete distributions. 相似文献
96.
97.
The system design must be started from the concept with low cost and high performance. In this point, the topological shape of the structure is very important in the view of the structural rigidities and light-weight design.In this paper, the optimization methodology is presented in the design stage of the large optical mirror. We obtain the optimal layout through the topology optimization and then design the details through the size or shape optimization for structural rigidity. 相似文献
98.
Andrea Grosso Marco Locatelli Fabio Schoen 《Computational Optimization and Applications》2007,38(3):351-370
In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin
Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see
). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging
problems. 相似文献
99.
The onset of liquid entrainment during discharge from large reservoirs containing a stratified mixture of two immiscible fluids through a side slot of a finite width is considered theoretically. A previously reported analysis in which the slot was approximated as a two-dimensional line sink has been extended to account for the finite width of the slot. The model resulting from the present analysis is expressed in terms of two simple algebraic equations suitable for hand calculations. According to the present results, the ratio of the critical height to the slot width is dependent only on the Froude number. Numerical results show that the present model approaches the correct physical limits at low Froude numbers and it converges to the predictions of the previously reported simple model at high Froude numbers. 相似文献
100.
Discrete global descent method for discrete global optimization and nonlinear integer programming 总被引:2,自引:0,他引:2
A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization
problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function
f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function.
The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers
of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer
variables and up to 1.38 × 10104 feasible points have demonstrated the applicability and efficiency of the proposed method. 相似文献