全文获取类型
收费全文 | 7228篇 |
免费 | 202篇 |
国内免费 | 126篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 214篇 |
综合类 | 66篇 |
数学 | 6921篇 |
物理学 | 185篇 |
出版年
2023年 | 25篇 |
2022年 | 64篇 |
2021年 | 72篇 |
2020年 | 72篇 |
2019年 | 84篇 |
2018年 | 90篇 |
2017年 | 122篇 |
2016年 | 113篇 |
2015年 | 95篇 |
2014年 | 298篇 |
2013年 | 321篇 |
2012年 | 394篇 |
2011年 | 284篇 |
2010年 | 298篇 |
2009年 | 442篇 |
2008年 | 458篇 |
2007年 | 495篇 |
2006年 | 317篇 |
2005年 | 292篇 |
2004年 | 221篇 |
2003年 | 216篇 |
2002年 | 223篇 |
2001年 | 196篇 |
2000年 | 215篇 |
1999年 | 173篇 |
1998年 | 147篇 |
1997年 | 139篇 |
1996年 | 173篇 |
1995年 | 163篇 |
1994年 | 114篇 |
1993年 | 125篇 |
1992年 | 124篇 |
1991年 | 115篇 |
1990年 | 93篇 |
1989年 | 64篇 |
1988年 | 84篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 107篇 |
1984年 | 75篇 |
1983年 | 21篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有7556条查询结果,搜索用时 15 毫秒
91.
J. P. Osleeb S. J. Ratick P. Buckley K. Lee M. Kuby 《Annals of Operations Research》1986,6(6):161-180
The formulation and use of a mixed integer mathematical programming location-allocation model, the Coal Logistics System (COLS), is presented in this study. COLS is used to evaluate the potential for reducing water-borne coal transportation costs, and concomitantly the costs of delivering coal to European markets. This cost reduction is accomplished through the use of supercolliers which would require the dredging of channels at selected ports or the use of offshore loading sites at East and Gulf Coast ports or both. The model developed and the analysis presented in this paper are intended to aid in the determination of the location and extent of these activities, and to indicate the size of the potential reduction in the costs of U.S. export coal. In order to be able to accommodate these deeper draft vessels at East and Gulf Coast ports, expensive improvements would need to be undertaken which may include the deepening of harbor channels to the depths required for 120 000 dead weight ton (dwt) or larger supercolliers. Since dredging requires large initial investments and has significant long-term maintenance costs, excess capacity could represent an inefficient use of both U.S. revenues and the ports' own funds. The use of offshore loading moorings to permit the topping off of supercolliers by self-unloading colliers at the deepwater sections of harbor channels has been proposed as a way of reducing trans-ocean transportation costs and avoiding the large investments and time delays associated with dredging activities. The Coal Logistics System was modified and extended to enable the evaluation of these two port improvement options to be undertaken in a consistent and realistic manner. 相似文献
92.
最小一乘稳健多元分析校正 总被引:1,自引:3,他引:1
本文论述最小一乘求解的多元分析校正算法,探讨了最小一乘较常规最小二乘法及其他隐健算法的优点。用计算机数值模拟及实际多组分光谱体系对方法进行了检验,展示了最小一乘法在分析化学计量学中实际应用的可行性。 相似文献
93.
《Operations Research Letters》2022,50(1):76-83
We derive formulas for constants of strong convexity (CSCs) of expectation functions encountered in two-stage stochastic programs with linear recourse. One of them yields a CSC as the optimal value of a certain quadratically constrained quadratic program, another one in terms of the thickness of the feasibility polytope of the dual problem associated to the recourse problem. CSCs appear in Hoelder-type estimates relating the distance of optimal solution sets of stochastic programs to a suitable distance of underlying probability distributions. 相似文献
94.
We consider three known bounds for the quadratic assignment problem (QAP): an eigenvalue, a convex quadratic programming (CQP), and a semidefinite programming (SDP) bound. Since the last two bounds were not compared directly before, we prove that the SDP bound is stronger than the CQP bound. We then apply these to improve known bounds on a discrete energy minimization problem, reformulated as a QAP, which aims to minimize the potential energy between repulsive particles on a toric grid. Thus we are able to prove optimality for several configurations of particles and grid sizes, complementing earlier results by Bouman et al. (2013). The semidefinite programs in question are too large to solve without pre-processing, and we use a symmetry reduction method by Permenter and Parrilo (2020) to make computation of the SDP bounds possible. 相似文献
95.
K. C. Kiwiel 《Applied Mathematics and Optimization》1995,32(3):235-254
Letf: n (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min
x
¦x¦2/2+t
f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)}
t
0, minimizingf over an ellipsoid, and choosing penalty parameters inL
1QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206. 相似文献
96.
Different classes of on-line algorithms are developed and analyzed for the solution of {0, 1} and relaxed stochastic knapsack problems, in which both profit and size coefficients are random variables. In particular, a linear time on-line algorithm is proposed for which the expected difference between the optimum and the approximate solution value isO(log3/2
n). An(1) lower bound on the expected difference between the optimum and the solution found by any on-line algorithm is also shown to hold.Corresponding author.Partially supported by the Basic Research Action of the European Communities under Contract 3075 (Alcom).Partially supported by research project Models and Algorithms for Optimization of the Italian Ministry of University and Scientific and Technological Research (MURST 40%). 相似文献
97.
In this paper, we introduce a potential reduction method for harmonically convex programming. We show that, if the objective function and them constraint functions are allk-harmonically convex in the feasible set, then the number of iterations needed to find an -optimal solution is bounded by a polynomial inm, k, and log(1/). The method requires either the optimal objective value of the problem or an upper bound of the harmonic constantk as a working parameter. Moreover, we discuss the relation between the harmonic convexity condition used in this paper and some other convexity and smoothness conditions used in the literature.The authors like to thank Dr. Hans Nieuwenhuis for carefully reading this paper and the anonymous referees for the worthy suggestions. 相似文献
98.
Kojima's strong stability of stationary solutions can be characterized by means of first and second order terms. We treat the problem whether there is a characterization of the stability concept allowing perturbations of the objective function only, keeping the feasible set unchanged. If the feasible set is a convex polyhedron, then there exists a characterization which is in fact weaker than that one of strong stability. However, in general it appears that data of first and second order do not characterize that kind of stability. As an interpretation we have that the strong stability is the only concept of stability which both admits a characterization and works for large problem classes.Supported by the Deutsche Forschungsgemeinschaft, Graduiertenkolleg Analyse und Konstruktion in der Mathematik.Partial support under Support Center for Advanced Telecommunications Technology Research. 相似文献
99.
On invexity-type nonlinear programming problems 总被引:3,自引:0,他引:3
Z. K. Xu 《Journal of Optimization Theory and Applications》1994,80(1):135-148
In this paper, we propose a new class of nonlinear programing, called SFJ-invex programming. The optimality characterization shows that a problem is SFJ-invex if and only if a Fritz John point together with its multiplier, is a Fritz John saddle point of the problem. Under any constraint qualification assumption, a problem is SFJ-invex if and only if a Kuhn-Tucker point together with its multiplier is a Kuhn-Tucker saddle point of the problem. Furthermore, a generalization of the SFJ-invex, class is developed; the applications to (h, )-convex programming, particularly geometric programming, and to generalized fractional programming provide a relaxation in constraint qualification for differentiable problems to get saddle-point type optimality criteria.The author wishes to thank the referee for helpful comments. 相似文献
100.
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana. 相似文献