全文获取类型
收费全文 | 13502篇 |
免费 | 1515篇 |
国内免费 | 395篇 |
专业分类
化学 | 1288篇 |
晶体学 | 28篇 |
力学 | 1078篇 |
综合类 | 150篇 |
数学 | 6738篇 |
物理学 | 1498篇 |
无线电 | 4632篇 |
出版年
2024年 | 40篇 |
2023年 | 202篇 |
2022年 | 350篇 |
2021年 | 470篇 |
2020年 | 378篇 |
2019年 | 362篇 |
2018年 | 361篇 |
2017年 | 500篇 |
2016年 | 543篇 |
2015年 | 482篇 |
2014年 | 831篇 |
2013年 | 856篇 |
2012年 | 967篇 |
2011年 | 833篇 |
2010年 | 639篇 |
2009年 | 768篇 |
2008年 | 788篇 |
2007年 | 827篇 |
2006年 | 669篇 |
2005年 | 594篇 |
2004年 | 443篇 |
2003年 | 421篇 |
2002年 | 373篇 |
2001年 | 339篇 |
2000年 | 304篇 |
1999年 | 231篇 |
1998年 | 254篇 |
1997年 | 216篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 142篇 |
1993年 | 132篇 |
1992年 | 109篇 |
1991年 | 89篇 |
1990年 | 76篇 |
1989年 | 63篇 |
1988年 | 50篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 57篇 |
1984年 | 52篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 546 毫秒
101.
In this paper,the concept of the infinitesimal realization factor is extended to the parameter-dependent performance functions in closed queueing networks. Then the concepts of realization matrix (its elements are called realization factors) and performance potential are introduced,and the relations between infinitesimal realization factors and these two quantities are discussed. This provides a united framework for both IPA and non IPA approaches. Finally,another physical meaning of the service rate is given. 相似文献
102.
设计IIR数字滤波器的遗传优化算法 总被引:2,自引:0,他引:2
提出了IIR数字滤波器设计的遗传优化法。这是一种模拟自然遗传和达尔文进化理论的随机并行优化算法。首先,详细描述了遗传算法并给出了计算步骤,然后将遗传算法用于IIR数字滤波器的优化设计,最后给出了模拟计算结果。 相似文献
103.
聚醚醚酮链结构与反应的模型化合物的量子化学研究 总被引:1,自引:1,他引:0
利用AM1方法对聚醚醚酮模型化合物全优化,结果为:芳环平均相互扭转角为33.0度,桥键角117.0-118.0度,其分子结构拓扑图形表明:所有苯环(核)为平面构型,但其内角扭曲;其氢原子对苯环构型无实质性贡献,在更长链的计算中,冻结苯核与氢原子也得出满意结果,根据Mulliken键序与电荷讨论了醚交换与磺化反应。 相似文献
104.
105.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献
106.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献
107.
This paper presents two differential systems, involving first and second order derivatives of problem functions, respectively, for solving equality-constrained optimization problems. Local minimizers to the optimization problems are proved to be asymptotically stable equilibrium points of the two differential systems. First, the Euler discrete schemes with constant stepsizes for the two differential systems are presented and their convergence theorems are demonstrated. Second, we construct algorithms in which directions are computed by these two systems and the stepsizes are generated by Armijo line search to solve the original equality-constrained optimization problem. The constructed algorithms and the Runge–Kutta method are employed to solve the Euler discrete schemes and the differential equation systems, respectively. We prove that the discrete scheme based on the differential equation system with the second order information has the locally quadratic convergence rate under the local Lipschitz condition. The numerical results given here show that Runge–Kutta method has better stability and higher precision and the numerical method based on the differential equation system with the second information is faster than the other one. 相似文献
108.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献
109.
§ 1 IntroductionConsiderthefollowingnonlinearoptimizationproblem :minimizef(x)subjecttoC(x) =0 , a≤x≤b ,( 1 .1 )wheref(x) :Rn→R ,C(x) =(c1(x) ,c2 (x) ,...,cm(x) ) T:Rn→Rm aretwicecontinuouslydifferentiable,m≤n ,a ,b∈Rn.Trustregionalgorithmsareveryeffectiveforsolvingnonlinearoptimi… 相似文献
110.
Charles Blair 《Mathematical Programming》1995,71(2):127-136
We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients. 相似文献