全文获取类型
收费全文 | 15105篇 |
免费 | 1788篇 |
国内免费 | 428篇 |
专业分类
化学 | 1371篇 |
晶体学 | 31篇 |
力学 | 1172篇 |
综合类 | 160篇 |
数学 | 7081篇 |
物理学 | 1766篇 |
无线电 | 5740篇 |
出版年
2024年 | 76篇 |
2023年 | 276篇 |
2022年 | 488篇 |
2021年 | 557篇 |
2020年 | 472篇 |
2019年 | 449篇 |
2018年 | 477篇 |
2017年 | 624篇 |
2016年 | 667篇 |
2015年 | 601篇 |
2014年 | 969篇 |
2013年 | 965篇 |
2012年 | 1089篇 |
2011年 | 906篇 |
2010年 | 710篇 |
2009年 | 818篇 |
2008年 | 870篇 |
2007年 | 874篇 |
2006年 | 704篇 |
2005年 | 624篇 |
2004年 | 464篇 |
2003年 | 435篇 |
2002年 | 394篇 |
2001年 | 352篇 |
2000年 | 328篇 |
1999年 | 242篇 |
1998年 | 264篇 |
1997年 | 220篇 |
1996年 | 165篇 |
1995年 | 177篇 |
1994年 | 152篇 |
1993年 | 130篇 |
1992年 | 113篇 |
1991年 | 92篇 |
1990年 | 77篇 |
1989年 | 66篇 |
1988年 | 51篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 58篇 |
1984年 | 53篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 13 毫秒
71.
When tracks are out of service for maintenance during a certain period, trains cannot be operated on those tracks. This leads to a modified timetable, and results in infeasible rolling stock and crew schedules. Therefore, these schedules need to be repaired. The topic of this paper is the re-scheduling of crew. 相似文献
72.
Bahram Alidaee Fred Glover Gary Kochenberger Haibo Wang 《European Journal of Operational Research》2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more traditional methods. In this paper we report on the application of UQP to the maximum edge-weighted clique problem. Computational experience is reported illustrating the attractiveness of the approach. 相似文献
73.
本文应用灰色系统理论和方法,把动态Leontief投入产出模型和线性规划结合起来,建立一种灰色动态投入产出优化模型,在山东省农业经济发展规划定量研究中,应用该模型取得比较满意的结果. 相似文献
74.
Two algorithms for finding a global minimum of the product of two affine fractional functions over a compact convex set and solving linear fractional programs with an additional constraint defined by the product of two affine fractional functions are proposed. The algorithms are based on branch and bound techniques using an adaptive branching operation which takes place in one-dimensional intervals. Results from numerical experiments show that large scale problems can be efficiently solved by the proposed methods. 相似文献
75.
Extended well-posedness of optimization problems 总被引:8,自引:0,他引:8
T. Zolezzi 《Journal of Optimization Theory and Applications》1996,91(1):257-266
The well-posedness concept introduced in Ref. 1 for global optimization problems with a unique solution is generalized here to problems with many minimizers, under the name of extended well-posedness. It is shown that this new property can be characterized by metric criteria, which parallel to some extent those known about generalized Tikhonov well-posedness.This work was partially supported by MURST, Fondi 40%, Rome, Italy. 相似文献
76.
Ling Wang 《Applied mathematics and computation》2005,170(2):760-1343
Simulation optimization aims at determining the best values of input parameters, while the analytical objective function and constraints are not explicitly known in terms of design variables and their values only can be estimated by complicated analysis or time-consuming simulation. In this paper, a hybrid genetic algorithm–neural network strategy (GA–NN) is proposed for such kind of optimization problems. The good approximation performance of neural network (NN) and the effective and robust evolutionary searching ability of genetic algorithm (GA) are applied in hybrid sense, where NNs are employed in predicting the objective value, and GA is adopted in searching optimal designs based on the predicted fitness values. Numerical simulation results and comparisons based on a well-known pressure vessel design problem demonstrate the feasibility and effectiveness of the framework, and much better results are achieved than some existed literature results. 相似文献
77.
Redundant constraints in linear inequality systems can be characterized as those inequalities that can be removed from an
arbitrary linear optimization problem posed on its solution set without modifying its value and its optimal set. A constraint
is saturated in a given linear optimization problem when it is binding at the optimal set. Saturation is a property related
with the preservation of the value and the optimal set under the elimination of the given constraint, phenomena which can
be seen as weaker forms of excess information in linear optimization problems. We say that an inequality of a given linear
inequality system is uniformly saturated when it is saturated for any solvable linear optimization problem posed on its solution
set. This paper characterizes the uniform saturated inequalities and other related classes of inequalities.
This work was supported by the MCYT of Spain and FEDER of UE, Grant BFM2002-04114-C02-01. 相似文献
78.
Cong Xu Paul Baines Jane-Ling Wang 《Journal of computational and graphical statistics》2013,22(3):771-791
In this article, we present a novel method to obtain both improved estimates and reliable stopping rules for stochastic optimization algorithms such as the Monte Carlo EM (MCEM) algorithm. By characterizing a stationary point, θ*, of the algorithm as the solution to a fixed point equation, we provide a parameter estimation procedure by solving for the fixed point of the update mapping. We investigate various ways to model the update mapping, including the use of a local linear (regression) smoother. This simple approach allows increased stability in estimating the value of θ* as well as providing a natural quantification of the estimation uncertainty. These uncertainty measures can then also be used to construct convergence criteria that reflect the inherent randomness in the algorithm. We establish convergence properties of our modified estimator. In contrast to existing literature, our convergence results do not require the Monte Carlo sample size to go to infinity. Simulation studies are provided to illustrate the improved stability and reliability of our estimator. 相似文献
79.
Damiana Lazzaro 《Numerical Linear Algebra with Applications》2016,23(5):801-824
This paper deals with the problem of recovering an unknown low‐rank matrix from a sampling of its entries. For its solution, we consider a nonconvex approach based on the minimization of a nonconvex functional that is the sum of a convex fidelity term and a nonconvex, nonsmooth relaxation of the rank function. We show that by a suitable choice of this nonconvex penalty, it is possible, under mild assumptions, to use also in this matrix setting the iterative forward–backward splitting method. Specifically, we propose the use of certain parameter dependent nonconvex penalties that with a good choice of the parameter value allow us to solve in the backward step a convex minimization problem, and we exploit this result to prove the convergence of the iterative forward–backward splitting algorithm. Based on the theoretical results, we develop for the solution of the matrix completion problem the efficient iterative improved matrix completion forward–backward algorithm, which exhibits lower computing times and improved recovery performance when compared with the best state‐of‐the‐art algorithms for matrix completion. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
80.