全文获取类型
收费全文 | 26937篇 |
免费 | 2110篇 |
国内免费 | 1659篇 |
专业分类
化学 | 2040篇 |
晶体学 | 35篇 |
力学 | 510篇 |
综合类 | 235篇 |
数学 | 2131篇 |
物理学 | 3365篇 |
综合类 | 22390篇 |
出版年
2024年 | 149篇 |
2023年 | 393篇 |
2022年 | 841篇 |
2021年 | 807篇 |
2020年 | 611篇 |
2019年 | 518篇 |
2018年 | 427篇 |
2017年 | 583篇 |
2016年 | 637篇 |
2015年 | 751篇 |
2014年 | 1279篇 |
2013年 | 1272篇 |
2012年 | 1519篇 |
2011年 | 1669篇 |
2010年 | 1338篇 |
2009年 | 1474篇 |
2008年 | 1673篇 |
2007年 | 2282篇 |
2006年 | 1999篇 |
2005年 | 1784篇 |
2004年 | 1455篇 |
2003年 | 1321篇 |
2002年 | 1133篇 |
2001年 | 914篇 |
2000年 | 704篇 |
1999年 | 618篇 |
1998年 | 497篇 |
1997年 | 445篇 |
1996年 | 339篇 |
1995年 | 248篇 |
1994年 | 221篇 |
1993年 | 188篇 |
1992年 | 128篇 |
1991年 | 99篇 |
1990年 | 92篇 |
1989年 | 76篇 |
1988年 | 72篇 |
1987年 | 48篇 |
1986年 | 31篇 |
1985年 | 17篇 |
1984年 | 14篇 |
1982年 | 6篇 |
1981年 | 7篇 |
1979年 | 4篇 |
1977年 | 5篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
1955年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
分析了广义正定矩阵,导出了矩阵广义正定的若干新判定准则,并以应用实例研究了其在神经网络中的应用. 相似文献
22.
刘伊生 《北京交通大学学报(自然科学版)》1993,(1)
根据网络计划的特点,在求解其最低费用日程时,引入最小割的概念,从而改进了该问题的求解方法。文中给出了解决问题的算法流程,并附有算例.此法运用较简便,且易于计算机计算,自动化水平高,因而便于有关人员采用. 相似文献
23.
为构建基于ASP+SQL体系结构的铁路电务管理信息系统,结合网络安全模型和基于角色的访问控制(RBAC)模型分别设计了实际的网络系统和应用系统,并对其安全特性进行了分析. 相似文献
24.
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. 相似文献
25.
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 相似文献
26.
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. 相似文献
27.
网络环境下的物理实验教学模式 总被引:4,自引:2,他引:2
目前网络环境下的物理实验教学新模式主要有物理实验专题网站、实验教学网络管理、实验类网络课程及远程控制物理实验.本文简要介绍了各个模式的特点及实施方法. 相似文献
28.
就工业企业施工平面控制网的设计、外业观测和数据处理等各主要环节进行较细致的分析、总结和研究,综合阐述各环节应遵循的基本原则和工作重点,强调在设计与实际工作中应注意的主要问题及采取的主要措施,指出测量成果中应重点关注的几项主要技术指标,对于工程施工布网和建网具有一定的指导意义。 相似文献
29.
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. 相似文献
30.
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. 相似文献