全文获取类型
收费全文 | 1281篇 |
免费 | 140篇 |
国内免费 | 38篇 |
专业分类
化学 | 156篇 |
晶体学 | 4篇 |
力学 | 101篇 |
综合类 | 25篇 |
数学 | 713篇 |
物理学 | 460篇 |
出版年
2024年 | 3篇 |
2023年 | 8篇 |
2022年 | 29篇 |
2021年 | 29篇 |
2020年 | 32篇 |
2019年 | 17篇 |
2018年 | 22篇 |
2017年 | 38篇 |
2016年 | 46篇 |
2015年 | 37篇 |
2014年 | 104篇 |
2013年 | 91篇 |
2012年 | 70篇 |
2011年 | 80篇 |
2010年 | 81篇 |
2009年 | 98篇 |
2008年 | 76篇 |
2007年 | 105篇 |
2006年 | 65篇 |
2005年 | 59篇 |
2004年 | 38篇 |
2003年 | 56篇 |
2002年 | 42篇 |
2001年 | 29篇 |
2000年 | 21篇 |
1999年 | 20篇 |
1998年 | 25篇 |
1997年 | 19篇 |
1996年 | 17篇 |
1995年 | 8篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 7篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 9篇 |
1985年 | 13篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 8篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1459条查询结果,搜索用时 156 毫秒
971.
We consider maximumb-matching problems where the nodes of the graph represent points in a metric space, and the weight of an edge is the distance between the respective pair of points. We show that if the space is either the rectilinear plane, or the metric space induced by a tree network, then theb-matching problem is the dual of the (single) median location problem with respect to the given set of points. This result does not hold for the Euclidean plane. However, we show that in this case theb-matching problem is the dual of a median location problem with respect to the given set of points, in some extended metric space. We then extend this latter result to any geodesic metric in the plane. The above results imply that the respective fractionalb-matching problems have integer optimal solutions. We use these duality results to prove the nonemptiness of the core of a cooperative game defined on the roommate problem corresponding to the above matching model. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Corresponding author. 相似文献
972.
Changyu Wang Chengyun Gao Zhenjun Shi 《Computational Optimization and Applications》1997,7(2):239-253
In this paper, we extend the ordinary discrete type facility location problems to continuous type ones. Unlike the discrete type facility location problem in which the objective function isn't everywhere differentiable, the objective function in the continuous type facility location problem is strictly convex and continuously differentiable. An algorithm without line search for solving the continuous type facility location problems is proposed and its global convergence, linear convergence rate is proved. Numerical experiments illustrate that the algorithm suggested in this paper have smaller amount of computation, quicker convergence rate than the gradient method and conjugate direction method in some sense. 相似文献
973.
Jacqueline M. Bloemhof-Ruwaard Marc Salomon Luk N. Van Wassenhove 《European Journal of Operational Research》1996
We study the problem of the simultaneous design of a distribution network with plants and waste disposal units, and the coordination of product flows and waste flows within this network. The objective is to minimize the sum of fixed costs for opening plants and waste disposal units, and variable costs related to product and waste flows. The problem is complicated by (i) capacity constraints on plants and waste disposal units, (ii) service requirements (i.e. production must cover total demand) and (iii) waste, arising from production, to be disposed of at waste disposal units. We discuss alternative mathematical model formulations for the two-level distribution and waste disposal problem with capacity constraints. Lower bounding and upper bounding procedures are analyzed. The bounds are shown to be quite effective when embedded in a standard branch and bound algorithm. Finally, the results of a computational study are reported. 相似文献
974.
A number of optimization methods require as a first step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this paper, we address the problem of constructing dominating sets for problems whose objective is a componentwise nondecreasing function of (possibly an infinite number of) convex functions, and we show how to obtain a convex dominating set in terms of dominating sets of simpler problems. The applicability of the results obtained is illustrated with the statement of new localization results in the fields of linear regression and location. 相似文献
975.
Improving on the minimum risk equivariant estimator of a location parameter which is constrained to an interval or a half-interval 总被引:3,自引:0,他引:3
Éric Marchand William E. Strawderman 《Annals of the Institute of Statistical Mathematics》2005,57(1):129-143
For location families with densitiesf
0(x−θ), we study the problem of estimating θ for location invariant lossL(θ,d)=ρ(d−θ), and under a lower-bound constraint of the form θ≥a. We show, that for quite general (f
0, ρ), the Bayes estimator δ
U
with respect to a uniform prior on (a, ∞) is a minimax estimator which dominates the benchmark minimum risk equivariant (MRE) estimator. In extending some previous
dominance results due to Katz and Farrell, we make use of Kubokawa'sIERD (Integral Expression of Risk Difference) method, and actually obtain classes of dominating estimators which include, and
are characterized in terms of δ
U
. Implications are also given and, finally, the above dominance phenomenon is studied and extended to an interval constraint
of the form θ∈[a, b].
Research supported by NSERC of Canada. 相似文献
976.
Enhancements to two exact algorithms from the literature to solve the vertex P-center problem are proposed. In the first approach modifications of some steps are introduced to reduce the number of ILP iterations needed to find the optimal solution. In the second approach a simple enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search method are proposed to reduce the number of subproblems to be solved. These ideas are tested on two well known sets of problems from the literature (i.e., OR-Lib and TSP-Lib problems) with encouraging results.Mathematics Subject Classifications (2000) 90B10, 90B80, 90C09, 90C47. 相似文献
977.
本文讨论了如何设置红球和蓝球的数量和位置,发现圆柱区域内的黄球并进行定位的问题.我们考虑了一对红球蓝球发现黄球并定位的问题,在此基础上进行扩展,基本解决了黄球的发现并定位的问题.在静止黄球发现问题中,采用了正三角形扩展和正六边形扩展两种方法.在静止黄球的定位问题中,我们结合正三角形和正六边形运用了旋转法和添点法进行扩展.在运动黄球的定位问题中,讨论了体积概率模型和时间概率模型,给出了两种模型的概率求解公式.在系统协同定位模型中,我们给出了发现定位分步模型和周期系统跟踪模型,其中后者在仿真中实现了大于80%的定位性能,该系统可以简单扩展为多目标快速定位问题.此外,文章讨论了精确测量和颜色切换模型,快速定位问题,多目标定位等问题. 相似文献
978.
In this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle
(the facility) minimizing the average distance to a given set (the demand-set) which is not assumed to be finite. Some theoretical
properties of the average distance are studied, and an expression for its gradient, involving solely expected distances to
rectangles, is obtained. This enables the resolution of the problem by standard optimization techniques.
The research of the authors is partially supported by Spanish DGICYT grant PB93-0927. 相似文献
979.
Passive Q-switching of a laser-diode-pumped intracavity-frequency-doubling Nd:NYW/KTP laser with GaAs saturable absorber 总被引:1,自引:0,他引:1
Passive Q-switching of a laser-diode-pumped intracavity-frequency-doubling Nd:NYW/KTP laser has been realized with GaAs semiconductor saturable absorber. The dependence of pulse repetition rate, pulse energy, and pulse width on incident pump power are measured. The coupled rate equations are used to simulate the Q-switched process of laser, and the numerical solutions agree with the experimental results. 相似文献
980.