全文获取类型
收费全文 | 10968篇 |
免费 | 711篇 |
国内免费 | 325篇 |
专业分类
化学 | 1197篇 |
晶体学 | 13篇 |
力学 | 850篇 |
综合类 | 124篇 |
数学 | 8471篇 |
物理学 | 1349篇 |
出版年
2023年 | 69篇 |
2022年 | 150篇 |
2021年 | 189篇 |
2020年 | 184篇 |
2019年 | 166篇 |
2018年 | 177篇 |
2017年 | 277篇 |
2016年 | 278篇 |
2015年 | 222篇 |
2014年 | 485篇 |
2013年 | 641篇 |
2012年 | 558篇 |
2011年 | 478篇 |
2010年 | 480篇 |
2009年 | 613篇 |
2008年 | 645篇 |
2007年 | 701篇 |
2006年 | 536篇 |
2005年 | 475篇 |
2004年 | 366篇 |
2003年 | 385篇 |
2002年 | 377篇 |
2001年 | 320篇 |
2000年 | 332篇 |
1999年 | 269篇 |
1998年 | 240篇 |
1997年 | 226篇 |
1996年 | 251篇 |
1995年 | 234篇 |
1994年 | 167篇 |
1993年 | 164篇 |
1992年 | 169篇 |
1991年 | 144篇 |
1990年 | 116篇 |
1989年 | 70篇 |
1988年 | 104篇 |
1987年 | 64篇 |
1986年 | 94篇 |
1985年 | 124篇 |
1984年 | 80篇 |
1983年 | 31篇 |
1982年 | 54篇 |
1981年 | 44篇 |
1980年 | 39篇 |
1979年 | 30篇 |
1978年 | 52篇 |
1977年 | 54篇 |
1976年 | 32篇 |
1975年 | 12篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
41.
The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls. 相似文献
42.
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. 相似文献
43.
本文报道了在Zn0.76Cd0.24Se/ZnSe多量子阱(MQWs)中,用不同的Ar+激光线激发,观察到了共振增强的喇曼散射。首次在室温和77K的条件下,用Ar+的457.9nm谱线激发,观察到分别来自ZnSe垒层和Zn0.76Cd0.24Se阱层的限制纵光学声子模(LO)的喇曼散射,并对上述不同的光学模的起因进行了分析。 相似文献
44.
Two thousand images of resolution 512×512 pixels as a regular matrix pattern of 10×10 elements are stored, where each element is angularly multiplexed 20 times in a 25 μm thickness of dichromated gelatin emulsion without cross-talk effect. The surface area of the matrix is 1 cm2. We show good concordance of the angular selectivity between the experimental result and theory. The diffraction efficiency of each 20 multiplexed images is measured and has nearly the same value. Examples of reconstructed images for multiple applications are given, for example, storage of 160,000 images on a 3′1/2 floppy disc format, which is about 100 min of black and white film. Application can be made to automobile cartography and storage of X-ray images as well as weather forecast images. Colored diffractive images are also possible and are illustrated. 相似文献
45.
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. 相似文献
46.
映象方程多解问题的某些研究 总被引:1,自引:0,他引:1
本文用fp-同伦方法,在一定的技巧和变换的配合下,在紧性条件支持下,研究了赋范线性空间中一类集值映象方程的多解问题。还给出所得理论结果的一个应用。 相似文献
47.
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. 相似文献
48.
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. 相似文献
49.
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. 相似文献
50.
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. 相似文献