全文获取类型
收费全文 | 15272篇 |
免费 | 1023篇 |
国内免费 | 845篇 |
专业分类
化学 | 250篇 |
晶体学 | 3篇 |
力学 | 1475篇 |
综合类 | 171篇 |
数学 | 13999篇 |
物理学 | 1242篇 |
出版年
2024年 | 30篇 |
2023年 | 149篇 |
2022年 | 179篇 |
2021年 | 214篇 |
2020年 | 334篇 |
2019年 | 345篇 |
2018年 | 395篇 |
2017年 | 398篇 |
2016年 | 385篇 |
2015年 | 288篇 |
2014年 | 642篇 |
2013年 | 1239篇 |
2012年 | 685篇 |
2011年 | 831篇 |
2010年 | 718篇 |
2009年 | 1027篇 |
2008年 | 1052篇 |
2007年 | 1073篇 |
2006年 | 939篇 |
2005年 | 732篇 |
2004年 | 626篇 |
2003年 | 705篇 |
2002年 | 603篇 |
2001年 | 446篇 |
2000年 | 457篇 |
1999年 | 405篇 |
1998年 | 377篇 |
1997年 | 328篇 |
1996年 | 261篇 |
1995年 | 216篇 |
1994年 | 145篇 |
1993年 | 127篇 |
1992年 | 124篇 |
1991年 | 112篇 |
1990年 | 79篇 |
1989年 | 42篇 |
1988年 | 43篇 |
1987年 | 40篇 |
1986年 | 46篇 |
1985年 | 56篇 |
1984年 | 59篇 |
1983年 | 31篇 |
1982年 | 31篇 |
1981年 | 27篇 |
1980年 | 19篇 |
1979年 | 24篇 |
1978年 | 16篇 |
1977年 | 18篇 |
1976年 | 10篇 |
1936年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
We identify a class of instances of the Koopmans–Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure in the distance data. Chr18b, one of the test problems in the QAPLIB, is in this class even though this feature of it has not been noticed until now. 相似文献
102.
Differential inequality method, bounding function method and topological degree are applied to obtain the existence criterions of at least one solution for the general fourth-order differential equations under nonlinear boundary conditions, and many existing results are complemented. 相似文献
103.
We consider a Bolza optimal control problem with state constraints. It is well known that under some technical assumptions every strong local minimizer of this problem satisfies first order necessary optimality conditions in the form of a constrained maximum principle. In general, the maximum principle may be abnormal or even degenerate and so does not provide a sufficient information about optimal controls. In the recent literature some sufficient conditions were proposed to guarantee that at least one maximum principle is nondegenerate, cf. [A.V. Arutyanov, S.M. Aseev, Investigation of the degeneracy phenomenon of the maximum principle for optimal control problems with state constraints, SIAM J. Control Optim. 35 (1997) 930–952; F. Rampazzo, R.B. Vinter, A theorem on existence of neighbouring trajectories satisfying a state constraint, with applications to optimal control, IMA 16 (4) (1999) 335–351; F. Rampazzo, R.B. Vinter, Degenerate optimal control problems with state constraints, SIAM J. Control Optim. 39 (4) (2000) 989–1007]. Our aim is to show that actually conditions of a similar nature guarantee normality of every nondegenerate maximum principle. In particular we allow the initial condition to be fixed and the state constraints to be nonsmooth. To prove normality we use J. Yorke type linearization of control systems and show the existence of a solution to a linearized control system satisfying new state constraints defined, in turn, by linearization of the original set of constraints along an extremal trajectory. 相似文献
104.
Mixed and hybrid finite element methods for the resolution of a wide range of linear and nonlinear boundary value problems (linear elasticity, Stokes problem, Navier–Stokes equations, Boussinesq equations, etc.) have known a great development in the last few years. These methods allow simultaneous computation of the original variable and its gradient, both of them being equally accurate. Moreover, they have local conservation properties (conservation of the mass and the momentum) as in the finite volume methods.The purpose of this paper is to give a review on some mixed finite elements developed recently for the resolution of Stokes and Navier–Stokes equations, and the linear elasticity problem. Further developments for a quasi-Newtonian flow obeying the power law are presented. 相似文献
105.
This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches. 相似文献
106.
全生寅 《数学的实践与认识》2006,36(1):253-256
证明了线性规划的K uhn-Tucker条件蕴含着它的对偶问题,解释了L agrange乘子的意义.进而显示了K-T条件中的互补松驰性与对偶线性规划的互补松紧定理之间的联系. 相似文献
107.
In this paper, the authors deal with bifunctions defined on complete metric spaces and with values in locally convex spaces ordered by closed convex cones. The aim is to provide a vector version of Ekeland’s theorem related to equilibrium problems. To prove this principle, a weak notion of continuity of a vector-valued function is considered, and some of its properties are presented. Via the vector Ekeland’s principle, existence results for vector equilibria are proved in both compact and noncompact domains. 相似文献
108.
We study the corrections to the Clausius-Mossotti formula for the dielectric constant of a disordered system of polarizable spherical particles. Previously we have derived an exact cluster expansion for the correction terms. Here we study the three-body correction in detail. We derive an explicit expression for the integrand of the three-body cluster integral for a system of polarizable point dipoles. 相似文献
109.
This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm. 相似文献
110.
George Lagogiannis Christos Makris Athanasios Tsakalidis 《Journal of Discrete Algorithms》2006,4(1):106-141
We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way. 相似文献