全文获取类型
收费全文 | 7697篇 |
免费 | 1252篇 |
国内免费 | 542篇 |
专业分类
化学 | 2403篇 |
晶体学 | 47篇 |
力学 | 740篇 |
综合类 | 261篇 |
数学 | 2877篇 |
物理学 | 3163篇 |
出版年
2024年 | 25篇 |
2023年 | 134篇 |
2022年 | 280篇 |
2021年 | 392篇 |
2020年 | 278篇 |
2019年 | 221篇 |
2018年 | 185篇 |
2017年 | 310篇 |
2016年 | 377篇 |
2015年 | 307篇 |
2014年 | 506篇 |
2013年 | 628篇 |
2012年 | 480篇 |
2011年 | 475篇 |
2010年 | 428篇 |
2009年 | 486篇 |
2008年 | 471篇 |
2007年 | 475篇 |
2006年 | 405篇 |
2005年 | 308篇 |
2004年 | 276篇 |
2003年 | 272篇 |
2002年 | 260篇 |
2001年 | 202篇 |
2000年 | 226篇 |
1999年 | 177篇 |
1998年 | 161篇 |
1997年 | 136篇 |
1996年 | 125篇 |
1995年 | 66篇 |
1994年 | 74篇 |
1993年 | 69篇 |
1992年 | 38篇 |
1991年 | 33篇 |
1990年 | 34篇 |
1989年 | 24篇 |
1988年 | 19篇 |
1987年 | 11篇 |
1986年 | 21篇 |
1985年 | 24篇 |
1984年 | 21篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 12篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1977年 | 6篇 |
1972年 | 2篇 |
1959年 | 4篇 |
1957年 | 2篇 |
排序方式: 共有9491条查询结果,搜索用时 31 毫秒
11.
12.
固体力学有限元体系的结构拓扑变化理论 总被引:2,自引:1,他引:1
本文是文[1]的继续.文[1]提出了杆件系统的结构拓扑变化理论和拓扑变化法本文将这一理论和方法推进到连续体有限元体系;且在此基础上揭示出有限元体系的一个新性质,称为基本位移之梯度的正交性定理,从而给出一套设计敏度的显式表达式,可直接用于计算. 相似文献
13.
A profit-maximizing supply chain network design model with demand choice flexibility 总被引:1,自引:0,他引:1
Zuo-Jun Max Shen 《Operations Research Letters》2006,34(6):673-682
We present a profit-maximizing supply chain design model in which a company has flexibility in determining which customers to serve. The company may lose a customer to competition if the price it charges is too high. We show the problem formulation and solution algorithm, and discuss computational results. 相似文献
14.
Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak
estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum,
minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity
networks is considered.
Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002 相似文献
15.
Shougo Higashi 《Surface science》2006,600(3):591-597
We have studied the individual adsorption of Mn and Bi, and their coadsorption on Cu(0 0 1) by low-energy electron diffraction (LEED). For Mn, we have determined the c(2 × 2) structure formed at 300 K, whose structure had been determined by several methods. We reconfirmed by a tensor LEED analysis that it is a substitutional structure and that a previously reported large corrugation (0.30 Å) between substitutional Mn and remaining surface Cu atoms coincides perfectly with the present value. In the individual adsorption of Bi, we have found a c(4 × 2) structure, which is formed by cooling below ∼250 K a surface prepared by Bi deposition of ∼0.25 ML coverage at 300 K where streaky half-order LEED spots appear. The c(4 × 2) structure has been determined by the tensor LEED analysis at 130 K and it is a substitutional structure. In the coadsorption, we found a c(6 × 4) structure, which has been determined by the tensor LEED analysis. It is very similar to the previously determined structure of the c(6 × 4) formed by coadsorption of Mg and Bi, and embedded MnBi4 clusters are arranged in the top Cu layer instead of MgBi4. Large lateral displacements of Bi atoms in the c(6 × 4)-(Mn + Bi) suggest that the Mn atoms undergo the size-enhancement caused by their large magnetic moment. 相似文献
16.
矩阵特征值及特征向量计算在实际问题中有广泛的应用.应用神经网络方法来计算广义特征值及对应的特征向量,给出了相应的算法,并对给出的算法在数学上进行了严格证明.并用实例验证了其正确性. 相似文献
17.
The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP. 相似文献
18.
网络环境下的物理实验教学模式 总被引:4,自引:2,他引:2
目前网络环境下的物理实验教学新模式主要有物理实验专题网站、实验教学网络管理、实验类网络课程及远程控制物理实验.本文简要介绍了各个模式的特点及实施方法. 相似文献
19.
Toward Fuzzy Optimization without Mathematical Ambiguity 总被引:15,自引:0,他引:15
Baoding Liu 《Fuzzy Optimization and Decision Making》2002,1(1):43-63
Fuzzy programming has been discussed widely in literature and applied in such various disciplines as operations research, economic management, business administration, and engineering. The main purpose of this paper is to present a brief review on fuzzy programming models, and classify them into three broad classes: expected value model, chance-constrained programming and dependent-chance programming. In order to solve general fuzzy programming models, a hybrid intelligent algorithm is also documented. Finally, some related topics are discussed. 相似文献
20.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献