全文获取类型
收费全文 | 10903篇 |
免费 | 786篇 |
国内免费 | 353篇 |
专业分类
化学 | 1734篇 |
晶体学 | 31篇 |
力学 | 1152篇 |
综合类 | 161篇 |
数学 | 7213篇 |
物理学 | 1751篇 |
出版年
2024年 | 22篇 |
2023年 | 116篇 |
2022年 | 369篇 |
2021年 | 351篇 |
2020年 | 239篇 |
2019年 | 257篇 |
2018年 | 273篇 |
2017年 | 362篇 |
2016年 | 334篇 |
2015年 | 245篇 |
2014年 | 480篇 |
2013年 | 615篇 |
2012年 | 668篇 |
2011年 | 527篇 |
2010年 | 494篇 |
2009年 | 610篇 |
2008年 | 620篇 |
2007年 | 678篇 |
2006年 | 537篇 |
2005年 | 477篇 |
2004年 | 382篇 |
2003年 | 360篇 |
2002年 | 328篇 |
2001年 | 296篇 |
2000年 | 288篇 |
1999年 | 225篇 |
1998年 | 238篇 |
1997年 | 221篇 |
1996年 | 155篇 |
1995年 | 176篇 |
1994年 | 142篇 |
1993年 | 122篇 |
1992年 | 111篇 |
1991年 | 92篇 |
1990年 | 83篇 |
1989年 | 67篇 |
1988年 | 53篇 |
1987年 | 47篇 |
1986年 | 47篇 |
1985年 | 56篇 |
1984年 | 52篇 |
1983年 | 17篇 |
1982年 | 30篇 |
1981年 | 25篇 |
1980年 | 19篇 |
1979年 | 32篇 |
1978年 | 21篇 |
1977年 | 30篇 |
1976年 | 20篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
11.
The system design must be started from the concept with low cost and high performance. In this point, the topological shape of the structure is very important in the view of the structural rigidities and light-weight design.In this paper, the optimization methodology is presented in the design stage of the large optical mirror. We obtain the optimal layout through the topology optimization and then design the details through the size or shape optimization for structural rigidity. 相似文献
12.
Andrea Grosso Marco Locatelli Fabio Schoen 《Computational Optimization and Applications》2007,38(3):351-370
In this paper we perform a computational analysis of a population based approach for global optimization, Population Basin
Hopping (PBH), which was proven to be very efficient on very challenging global optimization problems by the authors (see
). The experimental analysis aims at understanding more deeply how the approach works and why it is successful on challenging
problems. 相似文献
13.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
14.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
15.
Charles Blair 《Mathematical Programming》1995,71(2):127-136
We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients. 相似文献
16.
Q.J. Zhu 《Journal of Mathematical Analysis and Applications》2007,326(1):708-720
Investment systems are studied using a framework that emphasize their profiles (the cumulative probability distribution on all the possible percentage gains of trades) and their log return functions (the expected average return per trade in logarithmic scale as a function of the investment size in terms of the percentage of the available capital). The efficiency index for an investment system, defined as the maximum of the log return function, is proposed as a measure to compare investment systems for their intrinsic merit. This efficiency index can be viewed as a generalization of Shannon's information rate for a communication channel. Applications are illustrated. 相似文献
17.
首先将无线传感器网络的路由问题转化成求解最小Steiner树问题,然后给出了求解无线传感器网络路由的蚁群优化算法,并对算法的收敛性进行了证明.最后对找到最优解后信息素值的变化进行了分析.即在限制信息素取值的条件下,当迭代次数充分大时,该算法能以任意接近于1的概率找到最优解,并且当最优解找到后,最优树边上的信息素单调增加,而最优解以外边上的信息素在有限步达到最小值. 相似文献
18.
E. Hernández L. Rodríguez-Marín 《Journal of Optimization Theory and Applications》2007,134(1):119-134
In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps
and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T.
(eds.) Nonlinear analysis and convex analysis, pp. 221–228, 1999). We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type
under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given.
The authors thank the two referees for valuable comments and suggestions on early versions of the paper. The research of the
first author was partially supported by Ministerio de Educación y Ciencia (Spain) Project MTM2006-02629 and by Junta de Castilla
y León (Spain) Project VA027B06. 相似文献
19.
Madhu V. Nayakkankuppam 《Mathematical Programming》2007,109(2-3):477-504
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using
the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos
method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects
related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously
possible, and acceptable parallel scalability on sufficiently large problems.
This work was supported in part by NSF grants DMS-0215373 and DMS-0238008. 相似文献
20.
Peter Francis Guangming Zhang Karen Smilowitz 《European Journal of Operational Research》2007,180(3):1045-1059
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies. 相似文献