全文获取类型
收费全文 | 9414篇 |
免费 | 574篇 |
国内免费 | 266篇 |
专业分类
化学 | 238篇 |
晶体学 | 7篇 |
力学 | 520篇 |
综合类 | 100篇 |
数学 | 8403篇 |
物理学 | 986篇 |
出版年
2023年 | 43篇 |
2022年 | 80篇 |
2021年 | 106篇 |
2020年 | 107篇 |
2019年 | 141篇 |
2018年 | 138篇 |
2017年 | 173篇 |
2016年 | 191篇 |
2015年 | 151篇 |
2014年 | 374篇 |
2013年 | 515篇 |
2012年 | 496篇 |
2011年 | 392篇 |
2010年 | 394篇 |
2009年 | 556篇 |
2008年 | 584篇 |
2007年 | 651篇 |
2006年 | 431篇 |
2005年 | 419篇 |
2004年 | 330篇 |
2003年 | 327篇 |
2002年 | 353篇 |
2001年 | 280篇 |
2000年 | 308篇 |
1999年 | 263篇 |
1998年 | 228篇 |
1997年 | 208篇 |
1996年 | 210篇 |
1995年 | 200篇 |
1994年 | 155篇 |
1993年 | 161篇 |
1992年 | 155篇 |
1991年 | 134篇 |
1990年 | 112篇 |
1989年 | 80篇 |
1988年 | 94篇 |
1987年 | 59篇 |
1986年 | 87篇 |
1985年 | 115篇 |
1984年 | 83篇 |
1983年 | 26篇 |
1982年 | 51篇 |
1981年 | 46篇 |
1980年 | 36篇 |
1979年 | 31篇 |
1978年 | 52篇 |
1977年 | 52篇 |
1976年 | 28篇 |
1975年 | 12篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
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. 相似文献
42.
带有给定凸切线多边形的保形五次样条逼近 总被引:3,自引:0,他引:3
本讨论带有给定切线多边形的保形逼近问题.给出了一条与给定切线多边形相切的保形五次参数祥条曲线。 相似文献
43.
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. 相似文献
44.
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. 相似文献
45.
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. 相似文献
46.
In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here). 相似文献
47.
UCINSKI DARIUSZ; JAI ABDELHAQ EL 《IMA Journal of Mathematical Control and Information》1997,14(2):153-174
In this paper, the concept of weak spreadability is introduced.It constitutes an extension of the idea developed by El Jai& Kassara. In the case of linear distributed systems weconsider quadratic control techniques with a conveniently penalizedcriterion which makes the system weakly spreadable. The approachis outlined for a convectiondiffusion system, and theresults of a numerical study are also included to illustratethe main features of the considered problem. 相似文献
48.
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. 相似文献
49.
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. 相似文献
50.
Many biological and medical studies have as a response of interest the time to occurrence of some event, such as the occurrence of a particular symptom or disease, remission, relapse, death due to some specific disease, or simply death. In this paper we study the problem of assessing the effect of potential risk factors on the outcome event of interest through a parametric or semi-parametric frailty model where the lifetimes have a reason to be considered dependent. This dependence may arise because of multiple endpoints within the same individual or because, when studying a single endpoint, there are natural groupings between study subjects. The objective of this paper is to extend both parametric and semi-parametric approaches to regression analysis in which the lifetimes of individuals in a group are effected by the same random frailty which follows a positive stable distribution. Some comparisons of the properties of this frailty distribution with other frailty distributions are made and an example which assesses the effect of a treatment in a litter-matched tumorigenesis study is presented. 相似文献