全文获取类型
收费全文 | 8463篇 |
免费 | 229篇 |
国内免费 | 186篇 |
专业分类
化学 | 282篇 |
晶体学 | 11篇 |
力学 | 644篇 |
综合类 | 83篇 |
数学 | 7431篇 |
物理学 | 427篇 |
出版年
2023年 | 28篇 |
2022年 | 65篇 |
2021年 | 90篇 |
2020年 | 88篇 |
2019年 | 103篇 |
2018年 | 107篇 |
2017年 | 147篇 |
2016年 | 158篇 |
2015年 | 136篇 |
2014年 | 354篇 |
2013年 | 395篇 |
2012年 | 427篇 |
2011年 | 387篇 |
2010年 | 376篇 |
2009年 | 546篇 |
2008年 | 570篇 |
2007年 | 591篇 |
2006年 | 393篇 |
2005年 | 345篇 |
2004年 | 288篇 |
2003年 | 268篇 |
2002年 | 264篇 |
2001年 | 214篇 |
2000年 | 239篇 |
1999年 | 197篇 |
1998年 | 164篇 |
1997年 | 151篇 |
1996年 | 183篇 |
1995年 | 173篇 |
1994年 | 126篇 |
1993年 | 131篇 |
1992年 | 136篇 |
1991年 | 121篇 |
1990年 | 99篇 |
1989年 | 69篇 |
1988年 | 88篇 |
1987年 | 56篇 |
1986年 | 83篇 |
1985年 | 112篇 |
1984年 | 76篇 |
1983年 | 22篇 |
1982年 | 49篇 |
1981年 | 40篇 |
1980年 | 35篇 |
1979年 | 26篇 |
1978年 | 51篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 13篇 |
排序方式: 共有8878条查询结果,搜索用时 109 毫秒
1.
Profiling engineered data with robust mining methods continues attracting attention in knowledge engineering systems. The purpose of this article is to propose a simple technique that deals with non-linear multi-factorial multi-characteristic screening suitable for knowledge discovery studies. The method is designed to proactively seek and quantify significant information content in engineered mini-datasets. This is achieved by deploying replicated fractional-factorial sampling schemes. Compiled multi-response data are converted to a single master-response effectuated by a series of distribution-free transformations and multi-compressed data fusions. The resulting amalgamated master response is deciphered by non-linear multi-factorial stealth stochastics intended for saturated schemes. The stealth properties of our method target processing datasets which might be overwhelmed by a lack of knowledge about the nature of reference distributions at play. Stealth features are triggered to overcome restrictions regarding the data normality conformance, the effect sparsity assumption and the inherent collapse of the ‘unexplainable error’ connotation in saturated arrays. The technique is showcased by profiling four ordinary controlling factors that influence webpage content performance by collecting data from a commercial browser monitoring service on a large scale web host. The examined effects are: (1) the number of Cascading Style Sheets files, (2) the number of JavaScript files, (3) the number of Image files, and (4) the Domain Name System Aliasing. The webpage performance level was screened against three popular characteristics: (1) the time to first visual, (2) the total loading time, and (3) the customer satisfaction. Our robust multi-response data mining technique is elucidated for a ten-replicate run study dictated by an L9(34) orthogonal array scheme where any uncontrolled noise embedded contribution has not been necessarily excluded. 相似文献
2.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
3.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
4.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
5.
Boban Marinković 《Mathematical Methods of Operations Research》2006,63(3):513-524
We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem. 相似文献
6.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
7.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
8.
Constraint Programming and Operations Research: Comments from an Operations Researcher 总被引:4,自引:0,他引:4
Michel Gendreau 《Journal of Heuristics》2002,8(1):19-24
This paper relates the author's personal experience with constraint programming and gives a personal assessment of the relationships between constraint programming and operations research. 相似文献
9.
最速下降规则不失为一可用规则 总被引:5,自引:4,他引:1
本从统计意义上平均迭代次数的观点出发,指出求解线性规划的最速下降规则是可取的,好用的。 相似文献
10.
线性分式规划最优解集的求法 总被引:5,自引:0,他引:5
薛声家 《应用数学与计算数学学报》2002,16(1):90-96
本文使用多面集的表示定理,导出了线性分式规划最优解集的结构,并给出确定全部最优解的计算步骤。 相似文献