全文获取类型
收费全文 | 25184篇 |
免费 | 1503篇 |
国内免费 | 1494篇 |
专业分类
化学 | 1531篇 |
晶体学 | 22篇 |
力学 | 885篇 |
综合类 | 216篇 |
数学 | 12299篇 |
物理学 | 2251篇 |
综合类 | 10977篇 |
出版年
2024年 | 47篇 |
2023年 | 114篇 |
2022年 | 246篇 |
2021年 | 298篇 |
2020年 | 324篇 |
2019年 | 364篇 |
2018年 | 352篇 |
2017年 | 510篇 |
2016年 | 557篇 |
2015年 | 498篇 |
2014年 | 1022篇 |
2013年 | 1302篇 |
2012年 | 1337篇 |
2011年 | 1228篇 |
2010年 | 1134篇 |
2009年 | 1382篇 |
2008年 | 1424篇 |
2007年 | 1715篇 |
2006年 | 1429篇 |
2005年 | 1321篇 |
2004年 | 1160篇 |
2003年 | 1040篇 |
2002年 | 990篇 |
2001年 | 908篇 |
2000年 | 855篇 |
1999年 | 750篇 |
1998年 | 664篇 |
1997年 | 595篇 |
1996年 | 627篇 |
1995年 | 538篇 |
1994年 | 456篇 |
1993年 | 411篇 |
1992年 | 422篇 |
1991年 | 347篇 |
1990年 | 293篇 |
1989年 | 242篇 |
1988年 | 232篇 |
1987年 | 165篇 |
1986年 | 157篇 |
1985年 | 148篇 |
1984年 | 111篇 |
1983年 | 34篇 |
1982年 | 69篇 |
1981年 | 54篇 |
1980年 | 50篇 |
1979年 | 47篇 |
1978年 | 58篇 |
1977年 | 60篇 |
1976年 | 34篇 |
1974年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
In this article we prove the existence of the solution to the mixed problem for Euler–Bernoulli beam equation with memory term. The existence is proved by means of the Faedo–Galerkin method and the exponential decay is obtained by making use of the multiplier technique combined with integral inequalities due to Komornik. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
72.
A model is developed for the flow of a slightly compressible fluid through a saturated inelastic porous medium. The initial‐boundary‐value problem is a system that consists of the diffusion equation for the fluid coupled to the momentum equation for the porous solid together with a constitutive law which includes a possibly hysteretic relation of elasto‐visco‐plastic type. The variational form of this problem in Hilbert space is a non‐linear evolution equation for which the existence and uniqueness of a global strong solution is proved by means of monotonicity methods. Various degenerate situations are permitted, such as incompressible fluid, negligible porosity, or a quasi‐static momentum equation. The essential sufficient conditions for the well‐posedness of the system consist of an ellipticity condition on the term for diffusion of fluid and either a viscous or a hardening assumption in the constitutive relation for the porous solid. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
73.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
74.
Let Cld
AW
(X) be the hyperspace of nonempty closed subsets of a normed linear space X with the Attouch–Wets topology. It is shown that the space Cld
AW
(X) and its various subspaces are AR's. Moreover, if X is an infinite-dimensional Banach space with weight w(X) then Cld
AW
(X) is homeomorphic to a Hilbert space with weight 2
w(X). 相似文献
75.
Máté Matolcsi 《Acta Mathematica Hungarica》2005,108(1-2):129-136
Summary He present work deals with estimations of the n-th linear polarization constant c(H)n of an n-dimensional real Hilbert space H. We provide some new lower bounds on the value of sup║y║=1 │1,y> ... n,y>│, where x1, ... ,xn are unit vectors in H. In particular, the results improve an earlier estimate of Marcus. However, the intriguing conjecture c(H) n= nn/2 remains open. 相似文献
76.
The projective method for solving linear matrix inequalities 总被引:2,自引:0,他引:2
Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving
an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest
in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs
with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical
arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is
provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed. 相似文献
77.
We develop a production policy that controls work-in-process (WIP) levels and satisfies demand in a multistage manufacturing system with significant uncertainty in yield, rework, and demand. The problem addressed in this paper is more general than those in the literature in three aspects: (i) multiple products are processed at multiple workstations, and the capacity of each workstation is limited and shared by multiple operations; (ii) the behavior of a production policy is investigated over an infinite-time horizon, and thus the system stability can be evaluated; (iii) the representation of yield and rework uncertainty is generalized. Generalizing both the system structure and the nature of uncertainty requires a new mathematical development in the theory of infinite-horizon stochastic dynamic programming. The theoretical contributions of this paper are the existence proofs of the optimal stationary control for a stochastic dynamic programming problem and the finite covariances of WIP and production levels under the general expression of uncertainty. We develop a simple and explicit sufficient condition that guarantees the existence of both the optimal stationary control and the system stability. We describe how a production policy can be constructed for the manufacturing system based on the propositions derived. 相似文献
78.
Efficient Sequential Quadratic Programming Implementations for Equality-Constrained Discrete-Time Optimal Control 总被引:1,自引:0,他引:1
Efficient sequential quadratic programming (SQP) implementations are presented for equality-constrained, discrete-time, optimal control problems. The algorithm developed calculates the search direction for the equality-based variant of SQP and is applicable to problems with either fixed or free final time. Problem solutions are obtained by solving iteratively a series of constrained quadratic programs. The number of mathematical operations required for each iteration is proportional to the number of discrete times N. This is contrasted by conventional methods in which this number is proportional to N
3. The algorithm results in quadratic convergence of the iterates under the same conditions as those for SQP and simplifies to an existing dynamic programming approach when there are no constraints and the final time is fixed. A simple test problem and two application problems are presented. The application examples include a satellite dynamics problem and a set of brachistochrone problems involving viscous friction. 相似文献
79.
Kurt M. Anstreicher 《Mathematical Programming》1997,76(1):245-263
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers.
We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively
standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain
an O(n
1/4
m
1/4
L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition,
we show that the same iteration complexity can be attained while holding the work per iteration to O(n
2
m), as opposed to O(nm
2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof
of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii.
This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University
of Iowa Center for Advanced Studies. 相似文献
80.
A Modified SQP Method and Its Global Convergence 总被引:6,自引:0,他引:6
Guanglu Zhou 《Journal of Global Optimization》1997,11(2):193-205
The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples. 相似文献