全文获取类型
收费全文 | 4552篇 |
免费 | 143篇 |
国内免费 | 222篇 |
专业分类
化学 | 746篇 |
晶体学 | 2篇 |
力学 | 231篇 |
综合类 | 11篇 |
数学 | 3210篇 |
物理学 | 717篇 |
出版年
2023年 | 56篇 |
2022年 | 65篇 |
2021年 | 73篇 |
2020年 | 70篇 |
2019年 | 92篇 |
2018年 | 75篇 |
2017年 | 87篇 |
2016年 | 80篇 |
2015年 | 84篇 |
2014年 | 162篇 |
2013年 | 378篇 |
2012年 | 222篇 |
2011年 | 248篇 |
2010年 | 241篇 |
2009年 | 339篇 |
2008年 | 350篇 |
2007年 | 338篇 |
2006年 | 213篇 |
2005年 | 164篇 |
2004年 | 171篇 |
2003年 | 138篇 |
2002年 | 131篇 |
2001年 | 83篇 |
2000年 | 78篇 |
1999年 | 61篇 |
1998年 | 89篇 |
1997年 | 77篇 |
1996年 | 98篇 |
1995年 | 70篇 |
1994年 | 89篇 |
1993年 | 63篇 |
1992年 | 56篇 |
1991年 | 31篇 |
1990年 | 34篇 |
1989年 | 25篇 |
1988年 | 21篇 |
1987年 | 16篇 |
1986年 | 28篇 |
1985年 | 33篇 |
1984年 | 29篇 |
1983年 | 11篇 |
1982年 | 42篇 |
1981年 | 18篇 |
1980年 | 21篇 |
1979年 | 25篇 |
1978年 | 16篇 |
1977年 | 11篇 |
1976年 | 8篇 |
1973年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有4917条查询结果,搜索用时 9 毫秒
11.
The Euclidean distance matrix (EDM) completion problem and the positive semidefinite (PSD) matrix completion problem are considered in this paper. Approaches to determine the location of a point in a linear manifold are studied, which are based on a referential coordinate set and a distance vector whose components indicate the distances from the point to other points in the set. For a given referential coordinate set and a corresponding distance vector, sufficient and necessary conditions are presented for the existence of such a point that the distance vector can be realized. The location of the point (if it exists) given by the approaches in a linear manifold is independent of the coordinate system, and is only related to the referential coordinate set and the corresponding distance vector. An interesting phenomenon about the complexity of the EDM completion problem is described. Some properties about the uniqueness and the rigidity of the conformation for solutions to the EDM and PSD completion problems are presented. 相似文献
12.
We introduce the new notion of additive “multibox” for linear logic proof-nets. Thanks to this notion, we define a cut-elimination procedure which associates with every proof-net of multiplicative and additive linear logic a unique cut-free one. 相似文献
13.
An Application of Branch and Cut to Open Pit Mine Scheduling 总被引:5,自引:0,他引:5
The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed. 相似文献
14.
The classes ofL
1-matrices,L
2-matrices,L
3-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient
conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient
conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example.
Partially supported by NSFC.
This author is also with College of Business Administration of Human University as a Lotus chair professor. 相似文献
15.
SUN Qiyu 《数学年刊B辑(英文版)》2003,24(3):367-386
In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2). 相似文献
16.
17.
Recently, Zhang, Tapia, and Dennis (Ref. 1) produced a superlinear and quadratic convergence theory for the duality gap sequence in primal-dual interior-point methods for linear programming. In this theory, a basic assumption for superlinear convergence is the convergence of the iteration sequence; and a basic assumption for quadratic convergence is nondegeneracy. Several recent research projects have either used or built on this theory under one or both of the above-mentioned assumptions. In this paper, we remove both assumptions from the Zhang-Tapia-Dennis theory.Dedicated to the Memory of Magnus R. Hestenes, 1906–1991This research was supported in part by NSF Cooperative Agreement CCR-88-09615 and was initiated while the first author was at Rice University as a Visiting Member of the Center for Research in Parallel Computation.The authors thank Yinyu Ye for constructive comments and discussions concerning this material.This author was supported in part by NSF Grant DMS-91-02761 and DOE Grant DE-FG05-91-ER25100.This author was supported in part by AFOSR Grant 89-0363, DOE Grant DE-FG05-86-ER25017, and ARO Grant 9DAAL03-90-G-0093. 相似文献
18.
In this note we show that the characterization results for P-matrices due to K.G. Murty and A. Tamir which state that a given square matrixM of ordern is a P-matrix if and only if the linear complementarity problem (q, M) has a unique solution for allq in a specified finite subset of
n
depending onM are incorrect whenn > 3.Research supported by Dr. K.S. Krishnan (DAE) fellowship for research in Mathematics and Computer Science, Bombay, India. 相似文献
19.
The affine-scaling algorithm, first proposed by Dikin, is presently enjoying great popularity as a potentially effective means of solving linear programs. An outstanding question about this algorithm concerns its convergence in the presence of degeneracy. In this paper, we give new convergence results for this algorithm that do not require any non-degeneracy assumption on the problem. In particular, we show that if the stepsize choice of either Dikin or Barnes or Vanderbei, et al. is used, then the algorithm generates iterates that converge at least linearly with a convergence ratio of
, wheren is the number of variables and (0,1] is a certain stepsize ratio. For one particular stepsize choice which is an extension of that of Barnes, we show that the cost of the limit point is within O(/(1–)) of the optimal cost and, for sufficiently small (roughly, proportional to how close the cost of the nonoptimal vertices are to the optimal cost), is exactly optimal. We prove the latter result by using an unusual proof technique, that of analyzing the ergodic convergence of the corresponding dual vectors. For the special case of network flow problems with integer data, we show that it suffices to take = 1/(6mC), wherem is the number of constraints andC is the sum of the cost coefficients, to attain exact optimality.This research is partially supported by the U.S. Army Research Office, contract DAAL03-86-K-0171 (Center for Intelligent Control Systems), by the National Science Foundation, grant NSF-ECS-8519058, and by the Science and Engineering Research Board of McMaster University. 相似文献
20.
冯克勤 《高校应用数学学报(A辑)》1992,(3)
In this paper we present a series of binary sequences which is a generalization of GMW sequences constructed by Scholtz and Welch. Our sequences have optimal autocorrelation values as m -sequences, and nice pseudo-random property. The number of such sequences is counted and the linear span of such sequences is evaluated. 相似文献