全文获取类型
收费全文 | 13634篇 |
免费 | 1689篇 |
国内免费 | 394篇 |
专业分类
化学 | 1472篇 |
晶体学 | 30篇 |
力学 | 1646篇 |
综合类 | 191篇 |
数学 | 8972篇 |
物理学 | 3406篇 |
出版年
2024年 | 20篇 |
2023年 | 126篇 |
2022年 | 297篇 |
2021年 | 413篇 |
2020年 | 263篇 |
2019年 | 263篇 |
2018年 | 284篇 |
2017年 | 390篇 |
2016年 | 396篇 |
2015年 | 297篇 |
2014年 | 602篇 |
2013年 | 770篇 |
2012年 | 817篇 |
2011年 | 683篇 |
2010年 | 685篇 |
2009年 | 832篇 |
2008年 | 892篇 |
2007年 | 952篇 |
2006年 | 804篇 |
2005年 | 680篇 |
2004年 | 512篇 |
2003年 | 528篇 |
2002年 | 479篇 |
2001年 | 454篇 |
2000年 | 403篇 |
1999年 | 322篇 |
1998年 | 345篇 |
1997年 | 309篇 |
1996年 | 221篇 |
1995年 | 232篇 |
1994年 | 196篇 |
1993年 | 172篇 |
1992年 | 156篇 |
1991年 | 127篇 |
1990年 | 106篇 |
1989年 | 85篇 |
1988年 | 74篇 |
1987年 | 63篇 |
1986年 | 62篇 |
1985年 | 78篇 |
1984年 | 64篇 |
1983年 | 22篇 |
1982年 | 36篇 |
1981年 | 32篇 |
1980年 | 26篇 |
1979年 | 37篇 |
1978年 | 28篇 |
1977年 | 34篇 |
1976年 | 22篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 281 毫秒
131.
B R Sitaram 《Pramana》1995,44(4):295-302
The invariants of chaotic bounded Hamiltonian systems and their relation to the solutions of the first variational equations
of the equations of motion are studied. We show that these invariants are characterized by the fact that they either lose
the property of differentiability as functions on phase space or that a certain formal power series defined in terms of the
derivatives of the invariants has zero radius of convergence. For a specific example, we show that the former possibility
appears to apply. 相似文献
132.
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. 相似文献
133.
Marco Marletta 《Advances in Computational Mathematics》1994,2(2):155-184
This paper discusses the numerical solution of eigenvalue problems for Hamiltonian systems of ordinary differential equations.
Two new codes are presented which incorporate the algorithms described here; to the best of the author’s knowledge, these
are the first codes capable of solving numerically such general eigenvalue problems. One of these implements a new new method
of solving a differential equation whose solution is a unitary matrix. Both codes are fully documented and are written inPfort-verifiedFortran 77, and will be available in netlib/aicm/sl11f and netlib/aicm/sl12f. 相似文献
134.
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. 相似文献
135.
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. 相似文献
136.
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). 相似文献
137.
§ 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… 相似文献
138.
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. 相似文献
139.
Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison 总被引:2,自引:0,他引:2
J. BalakrishnanP. D. Jog 《Mathematical and Computer Modelling》1995,21(12):61-73
Many algorithms have been proposed to form manufacturing cells from component routings. However, many of these do not have the capability of solving large problems. We propose a procedure using similarity coefficients and a parallel genetic implementation of a TSP algorithm that is capable of solving large problems of up to 1000 parts and 1000 machines. In addition, we also compare our procedure with many existing procedures using nine well-known problems from the literature.
The results show that the proposed procedure compares well with the existing procedures and should be useful to practitioners and researchers. 相似文献
140.
Genetic algorithms are stochastic search algorithms that have been applied to optimization problems. In this paper we analyze the run-time complexity of a genetic algorithm when we are interested in one of a set of distinguished solutions. One such case occurs when multiple optima exist. We define the worst case scenario and derive a probabilistic worst case bound on the number of iterations required to find one of these multiple solutions of interest. 相似文献