全文获取类型
收费全文 | 12130篇 |
免费 | 378篇 |
国内免费 | 434篇 |
专业分类
化学 | 204篇 |
晶体学 | 1篇 |
力学 | 255篇 |
综合类 | 71篇 |
数学 | 7068篇 |
物理学 | 315篇 |
综合类 | 5028篇 |
出版年
2024年 | 19篇 |
2023年 | 50篇 |
2022年 | 98篇 |
2021年 | 105篇 |
2020年 | 131篇 |
2019年 | 126篇 |
2018年 | 130篇 |
2017年 | 186篇 |
2016年 | 185篇 |
2015年 | 184篇 |
2014年 | 489篇 |
2013年 | 466篇 |
2012年 | 621篇 |
2011年 | 529篇 |
2010年 | 489篇 |
2009年 | 677篇 |
2008年 | 675篇 |
2007年 | 811篇 |
2006年 | 584篇 |
2005年 | 611篇 |
2004年 | 507篇 |
2003年 | 451篇 |
2002年 | 432篇 |
2001年 | 387篇 |
2000年 | 400篇 |
1999年 | 301篇 |
1998年 | 308篇 |
1997年 | 272篇 |
1996年 | 308篇 |
1995年 | 288篇 |
1994年 | 241篇 |
1993年 | 225篇 |
1992年 | 248篇 |
1991年 | 216篇 |
1990年 | 169篇 |
1989年 | 135篇 |
1988年 | 156篇 |
1987年 | 98篇 |
1986年 | 103篇 |
1985年 | 117篇 |
1984年 | 77篇 |
1983年 | 21篇 |
1982年 | 47篇 |
1981年 | 38篇 |
1980年 | 34篇 |
1979年 | 27篇 |
1978年 | 47篇 |
1977年 | 47篇 |
1976年 | 26篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
22.
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. 相似文献
23.
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. 相似文献
24.
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. 相似文献
25.
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. 相似文献
26.
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. 相似文献
27.
This paper considers a problem of nonlinear programming in which the objective function is the ratio of two linear functions and the constraints define a bounded and connected feasible region. Using a coordinate transformation, this problem is transformed into a simpler one, whose geometric interpretation is of particular significance. The transformation leads to a characterization of some special vertices of the feasible region from both the theoretical and operational points of view. 相似文献
28.
L. Contesse-Becker 《Journal of Optimization Theory and Applications》1993,79(2):273-310
In this paper, we extend the classical convergence and rate of convergence results for the method of multipliers for equality constrained problems to general inequality constrained problems, without assuming the strict complementarity hypothesis at the local optimal solution. Instead, we consider an alternative second-order sufficient condition for a strict local minimum, which coincides with the standard one in the case of strict complementary slackness. As a consequence, new stopping rules are derived in order to guarantee a local linear rate of convergence for the method, even if the current Lagrangian is only asymptotically minimized in this more general setting. These extended results allow us to broaden the scope of applicability of the method of multipliers, in order to cover all those problems admitting loosely binding constraints at some optimal solution. This fact is not meaningless, since in practice this kind of problem seems to be more the rule rather than the exception.In proving the different results, we follow the classical primaldual approach to the method of multipliers, considering the approximate minimizers for the original augmented Lagrangian as the exact solutions for some adequate approximate augmented Lagrangian. In particular, we prove a general uniform continuity property concerning both their primal and their dual optimal solution set maps, a property that could be useful beyond the scope of this paper. This approach leads to very simple proofs of the preliminary results and to a straight-forward proof of the main results.The author gratefully acknowledges the referees for their helpful comments and remarks. This research was supported by FONDECYT (Fondo Nacional de Desarrollo Científico y Technológico de Chile). 相似文献
29.
廖业元 《北京交通大学学报(自然科学版)》1992,(1)
在用“奇偶点图上作业法”求解“中国邮路问题”时,需检查图中的每一个回路.当图中回路较多时,检查不便且易出错.针对此,本文建立了求解“中国邮路问题”的0-1规划模型,并给出了算例。 相似文献
30.
This paper presents an analysis of a portfolio model which can be used to assist a property-liability insurance company in determining the optimal composition of the insurance and investment portfolios. By introducing insurer's threshold risk and relaxing some non-realistic assumptions made in traditional chance constraint insurance and investment portfolio models, we propose a method for an insurer to maximize his return threshold for a given threshold risk level. This proposed model can be used to optimize the composition of underwriting and investment portfolios regarding the insurer's threshold risk level, as well as to generate the efficient frontier by adjusting insurer's threshold risk levels. A numerical example is given based on the industry's aggregated data for a sixteen year period. 相似文献