全文获取类型
收费全文 | 1606篇 |
免费 | 110篇 |
国内免费 | 68篇 |
专业分类
化学 | 185篇 |
晶体学 | 1篇 |
力学 | 154篇 |
综合类 | 29篇 |
数学 | 1211篇 |
物理学 | 204篇 |
出版年
2023年 | 12篇 |
2022年 | 14篇 |
2021年 | 27篇 |
2020年 | 30篇 |
2019年 | 39篇 |
2018年 | 36篇 |
2017年 | 40篇 |
2016年 | 40篇 |
2015年 | 35篇 |
2014年 | 50篇 |
2013年 | 105篇 |
2012年 | 74篇 |
2011年 | 64篇 |
2010年 | 64篇 |
2009年 | 77篇 |
2008年 | 92篇 |
2007年 | 70篇 |
2006年 | 88篇 |
2005年 | 70篇 |
2004年 | 71篇 |
2003年 | 68篇 |
2002年 | 64篇 |
2001年 | 54篇 |
2000年 | 57篇 |
1999年 | 44篇 |
1998年 | 44篇 |
1997年 | 43篇 |
1996年 | 36篇 |
1995年 | 29篇 |
1994年 | 24篇 |
1993年 | 14篇 |
1992年 | 26篇 |
1991年 | 18篇 |
1990年 | 22篇 |
1989年 | 10篇 |
1988年 | 18篇 |
1987年 | 11篇 |
1986年 | 12篇 |
1985年 | 9篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 6篇 |
1978年 | 7篇 |
1977年 | 13篇 |
1976年 | 8篇 |
1975年 | 3篇 |
1974年 | 4篇 |
排序方式: 共有1784条查询结果,搜索用时 93 毫秒
31.
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. 相似文献
32.
N. D. Botkin 《Applied Mathematics and Optimization》1995,32(2):195-210
A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia. 相似文献
33.
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds 总被引:11,自引:0,他引:11
We consider a new algorithm, an interior-reflective Newton approach, for the problem of minimizing a smooth nonlinear function of many variables, subject to upper and/or lower bounds on some of the variables. This approach generatesstrictly feasible iterates by using a new affine scaling transformation and following piecewise linear paths (reflection paths). The interior-reflective approach does not require identification of an activity set. In this paper we establish that the interior-reflective Newton approach is globally and quadratically convergent. Moreover, we develop a specific example of interior-reflective Newton methods which can be used for large-scale and sparse problems.Research partially supported by the Applied Mathematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U.S. Department of Energy under grant DE-FG02-86ER25013.A000, and in part by NSF, AFOSR, and ONR through grant DMS-8920550, and by the Advanced Computing Research Institute, a unit of the Cornell Theory Center which receives major funding from the National Science Foundation and IBM Corporation, with additional support from New York State and members of its Corporate Research Institute.Corresponding author. 相似文献
34.
Zbigniew Michalewicz 《Journal of Heuristics》1996,1(2):177-206
Evolutionary computation techniques, which are based on a powerful principle of evolution—survival of the fittest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival.Any evolutionary algorithm applied to a particular problem must address the issue of genetic representation of solutions to the problem and genetic operators that would alter the genetic composition of offspring during the reproduction process. However, additional heuristics should be incorporated in the algorithm as well; some of these heuristic rules provide guidelines for evaluating (feasible and infeasible) individuals in the population. This paper surveys such heuristics and discusses their merits and drawbacks.An abridged version of this paper appears in the volume entitled META-HEURISTICS: Theory & Application, edited by Ibrahim H. Osman and James P. Kelly, to be published by Kluwer Academic Publishers in March 1996. 相似文献
35.
In this paper, we develop an interior point algorithm for quadratically constrained entropy problems. The algorithm uses a variation of Newton's method to follow a central path trajectory in the interior of the feasible set. The primal-dual gap is made less than a given in at most
steps, wheren is the dimension of the problem andm is the number of quadratic inequality constraints. 相似文献
36.
We adapted the genetic algorithm to minimize the AMBER potential energy function. We describe specific recombination and mutation operators for this task. Next we use our algorithm to locate low energy conformation of three polypeptides (AGAGAGAGA, A9, and [Met]-enkephalin) which are probably the global minimum conformations. Our potential energy minima are –94.71, –98.50, and –48.94 kcal/mol respectively. Next, we applied our algorithm to the 46 amino acid protein crambin and located a non-native conformation which had an AMBER potential energy 150 kcal/mol lower than the native conformation. This is not necessarily the global minimum conformation, but it does illustrate problems with the AMBER potential energy function. We believe this occurred because the AMBER potential energy function does not account for hydration. 相似文献
37.
高硅沸石骨架结构及其稳定性的模拟计算(I)* 总被引:2,自引:0,他引:2
The lattice energy of a series of high-silica zeolites was determined using the lattice energy minimization method. The results were compared to the lattice energy of dense polymorphs of SiO2. All high-silica zeolites frameworks are only 30~67kJ•mol-1 less stable than α-quartz This may imply that there is little energy barrier to the formation of high-silica zeolites frame-works and explain the structural diversity observed for high-silica zeolites. The relationships of calculated lattice energies and framework Structures was disscussed. The results revealed a good linear relationship between framework density of these molecular sieves and all-silica framework lattice energies. 相似文献
38.
An algebraic method that includes Gibbs minimization for performing phase equilibrium calculations for any number of components or phases 总被引:1,自引:0,他引:1
Gustavo A. Iglesias-Silva Adrin Bonilla-Petriciolet Philip T. Eubank James C. Holste Kenneth R. Hall 《Fluid Phase Equilibria》2003,210(2):229-245
The most widely used technique for performing phase equilibria calculations is the K-value method (equality of chemical potentials). This paper proposes a more efficient algorithm to achieve the results that includes Gibbs minimization when we know the number of phases. Using the orthogonal derivatives, the tangent plane equation and mass balances, it is possible to reduce the Gibbs minimization procedure to the task of finding the solution of a system of non-linear equations. Such an operation is easier and faster than finding tangents or areas, and appears to converge as fast as the K-value method. Examples illustrate application of the new technique to two and three phases in equilibrium for binary and ternary mixtures. 相似文献
39.
The problem of minimizing a nondifferential functionx f(x) (subject, possibly, to nondifferential constraints) is considered. Conventional algorithms are employed for minimizing a differential approximationf
off (subject to differentiable approximations ofg). The parameter is adaptively reduced in such a way as to ensure convergence to points satisfying necessary conditions of optimality for the original problem.This research was supported by the UK Science and Engineering Research Council, the National Science Foundation under Grant No. ECS-8121149, and the Joint Services Electronics Program, Contract No. F49620-79-C-0178. 相似文献
40.
We report a thermal analysis study of the effect of molecular weight on the amorphous phase structure of poly(phenylene sulfide), PPS, crystallized at temperatures just above the glass transition temperature. Thermal properties of Fortron PPS, having viscosity average molecular weights of 30000 to 91000, were characterized using temperature modulated differential scanning calorimetry (MDSC). We find that while crystallinity varies little with molecular weight, the heat capacity increment at the glass transition decreases as molecular weight decreases. This leads to a smaller liquid-like amorphous phase, and a larger rigid amorphous fraction, in the lower molecular weight PPS. For all molecular weights, constrained fraction decreases as the scan rate decreases.This research is supported by the U. S. Army Research Office through contract DAAH04-96-1-0009. The authors thank Hoechst Celanese for providing different molecular weight Fortron samples and Dr. George Collins for providing sample information. The authors acknowledge the assistance of Elizabeth Oyebode and Leonardo Grimaldi with sample preparation and MDSC work. 相似文献