全文获取类型
收费全文 | 10044篇 |
免费 | 763篇 |
国内免费 | 293篇 |
专业分类
化学 | 1394篇 |
晶体学 | 31篇 |
力学 | 1157篇 |
综合类 | 166篇 |
数学 | 6707篇 |
物理学 | 1645篇 |
出版年
2024年 | 24篇 |
2023年 | 106篇 |
2022年 | 363篇 |
2021年 | 358篇 |
2020年 | 216篇 |
2019年 | 226篇 |
2018年 | 246篇 |
2017年 | 343篇 |
2016年 | 326篇 |
2015年 | 256篇 |
2014年 | 470篇 |
2013年 | 563篇 |
2012年 | 620篇 |
2011年 | 478篇 |
2010年 | 448篇 |
2009年 | 558篇 |
2008年 | 558篇 |
2007年 | 608篇 |
2006年 | 494篇 |
2005年 | 430篇 |
2004年 | 336篇 |
2003年 | 322篇 |
2002年 | 295篇 |
2001年 | 268篇 |
2000年 | 270篇 |
1999年 | 206篇 |
1998年 | 218篇 |
1997年 | 198篇 |
1996年 | 141篇 |
1995年 | 161篇 |
1994年 | 135篇 |
1993年 | 112篇 |
1992年 | 102篇 |
1991年 | 85篇 |
1990年 | 76篇 |
1989年 | 61篇 |
1988年 | 48篇 |
1987年 | 41篇 |
1986年 | 39篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Victor A. Kovtunenko 《Mathematical Methods in the Applied Sciences》2003,26(5):359-374
The 3D‐elasticity model of a solid with a plane crack under the stress‐free boundary conditions at the crack is considered. We investigate variations of a solution and of energy functionals with respect to perturbations of the crack front in the plane. The corresponding expansions at least up to the second‐order terms are obtained. The strong derivatives of the solution are constructed as an iterative solution of the same elasticity problem with specified right‐hand sides. Using the expansion of the potential and surface energy, we consider an approximate quadratic form for local shape optimization of the crack front defined by the Griffith criterion. To specify its properties, a procedure of discrete optimization is proposed, which reduces to a matrix variational inequality. At least for a small load we prove its solvability and find a quasi‐static model of the crack growth depending on the loading parameter. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
92.
§ 1 IntroductionConsiderthefollowingnonlinearoptimizationproblem :minimizef(x)subjecttoC(x) =0 , a≤x≤b ,( 1 .1 )wheref(x) :Rn→R ,C(x) =(c1(x) ,c2 (x) ,...,cm(x) ) T:Rn→Rm aretwicecontinuouslydifferentiable,m≤n ,a ,b∈Rn.Trustregionalgorithmsareveryeffectiveforsolvingnonlinearoptimi… 相似文献
93.
TESTING DIFFERENT CONJUGATE GRADIENT METHODS FOR LARGE—SCALE UNCONSTRAINED OPTIMIZATION 总被引:6,自引:0,他引:6
Yu-hongDai QinNi 《计算数学(英文版)》2003,21(3):311-320
In this PaPer we test different conjugate gradient (CG) methods for solving large-scale unconstrained optimization problems.The methods are divided in two groups:the first group includes five basic CG methods and the second five hybrid CG methods.A collection of medium-scale and large-scale test problems are drawn from a standard code of test problems.CUTE.The conjugate gradient methods are ranked according to the numerical results.Some remarks are given. 相似文献
94.
A daunting challenge in the area of computational biology has been to develop a method to theoretically predict the correct three-dimensional structure of a protein given its linear amino acid sequence. The ability to surmount this challenge, which is known as the protein folding problem, has tremendous implications. We introduce a novel ab initio approach for the protein folding problem. The accurate prediction of the three-dimensional structure of a protein relies on both the mathematical model used to mimic the protein system and the technique used to identify the correct structure. The models employed are based solely on first principles, as opposed to the myriad of techniques relying on information from statistical databases. The framework integrates our recently proposed methods for the prediction of secondary structural features including helices and strands, as well as -sheet and disulfide bridge formation. The final stage of the approach, which culminates in the tertiary structure prediction of a protein, utilizes search techniques grounded on the foundations of deterministic global optimization, powerful methods which can potentially guarantee the correct identification of a protein's structure. The performance of the approach is illustrated with bovine pancreatic trypsin inhibitor protein and the immunoglobulin binding domain of protein G. 相似文献
95.
H. Tuy 《Journal of Optimization Theory and Applications》2003,118(1):201-216
We discuss global optimality conditions and cutting plane algorithms for DC optimization. The discussion is motivated by certain incorrect results that have appeared recently in the literature on these topics. Incidentally, we investigate the relation of the Tikhonov reciprocity theorem to the optimality conditions for general nonconvex global optimization problems and show how the outer-approximation scheme developed earlier for DC programming can be used to solve a wider class of problems. 相似文献
96.
97.
Raffaele Cerulli Paola Festa Giancarlo Raiconi 《Computational Optimization and Applications》2003,26(2):191-208
In this paper, the problem of finding a shortest path tree rooted at a given source node on a directed graph (SPT) is considered. A new efficient algorithm based on a primal-dual approach is presented, which improves both the convergence and the complexity of the best known auction-like algorithm. It uses the virtual source (VS) concept based on the following consideration: when a node i is visited for the first time by any algorithm which preserves verified the dual admissibility conditions, then the shortest path (SP) from the source node to i is found. Therefore, the SP from the source to the remaining nodes may be computed by considering i as a virtual source.We propose a very efficient implementation of an auction-like algorithm that uses this concept and enables us to obtain a computational cost of O(n
2), where n is the number of nodes.Numerical experimentsare reported showing that the new method outdoes previously proposed auction-like algorithms and is highly competitive with other state-of-art SP approaches. 相似文献
98.
Arnold Neumaier 《Journal of Global Optimization》2003,25(2):175-181
A family of multivariate rational functions is constructed. It has strong local minimizers with prescribed function values at prescribed positions. While there might be additional local minima, such minima cannot be global. A second family of multivariate rational functions is given, having prescribed global minimizers and prescribed interpolating data. 相似文献
99.
Paul Armand 《Computational Optimization and Applications》2003,26(1):5-34
We describe an infeasible interior point algorithm for convex minimization problems. The method uses quasi-Newton techniques for approximating the second derivatives and providing superlinear convergence. We propose a new feasibility control of the iterates by introducing shift variables and by penalizing them in the barrier problem. We prove global convergence under standard conditions on the problem data, without any assumption on the behavior of the algorithm. 相似文献
100.
The vector partition problem concerns the partitioning of a set A of n vectors in d-space into p parts so as to maximize an objective function c which is convex on the sum of vectors in each part. Here all parameters d, p, n are considered variables. In this paper, we study the adjacency of vertices in the associated partition polytopes. Using our adjacency characterization for these polytopes, we are able to develop an adaptive algorithm for the vector partition problem that runs in time O(q(L)v) and in space O(L), where q is a polynomial function, L is the input size and v is the number of vertices of the associated partition polytope. It is based on an output-sensitive algorithm for enumerating all vertices of the partition polytope. Our adjacency characterization also implies a polynomial upper bound on the combinatorial diameter of partition polytopes. We also establish a partition polytope analogue of the lower bound theorem, indicating that the output-sensitive enumeration algorithm can be far superior to previously known algorithms that run in time polynomial in the size of the worst-case output. 相似文献