全文获取类型
收费全文 | 11168篇 |
免费 | 561篇 |
国内免费 | 1046篇 |
专业分类
化学 | 533篇 |
晶体学 | 8篇 |
力学 | 333篇 |
综合类 | 132篇 |
数学 | 5265篇 |
物理学 | 486篇 |
综合类 | 6018篇 |
出版年
2024年 | 19篇 |
2023年 | 91篇 |
2022年 | 135篇 |
2021年 | 144篇 |
2020年 | 162篇 |
2019年 | 188篇 |
2018年 | 197篇 |
2017年 | 210篇 |
2016年 | 238篇 |
2015年 | 252篇 |
2014年 | 477篇 |
2013年 | 594篇 |
2012年 | 534篇 |
2011年 | 658篇 |
2010年 | 577篇 |
2009年 | 730篇 |
2008年 | 747篇 |
2007年 | 825篇 |
2006年 | 768篇 |
2005年 | 591篇 |
2004年 | 552篇 |
2003年 | 534篇 |
2002年 | 483篇 |
2001年 | 423篇 |
2000年 | 362篇 |
1999年 | 328篇 |
1998年 | 297篇 |
1997年 | 291篇 |
1996年 | 226篇 |
1995年 | 158篇 |
1994年 | 174篇 |
1993年 | 137篇 |
1992年 | 106篇 |
1991年 | 109篇 |
1990年 | 94篇 |
1989年 | 70篇 |
1988年 | 65篇 |
1987年 | 35篇 |
1986年 | 29篇 |
1985年 | 30篇 |
1984年 | 24篇 |
1983年 | 13篇 |
1982年 | 26篇 |
1981年 | 18篇 |
1980年 | 19篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
关于矩阵条件数的一些结论 总被引:4,自引:1,他引:3
陈德辉 《华东师范大学学报(自然科学版)》1986,(3)
本文讨论了一些矩阵范数达到极小的充要条件,其主要结果如下:1.设?为m×n实矩阵,且具有n个线性无关的列,则求?广义逆谱条件数等于1的充要条件为?=cI,其中c为正常数.2.设?为n阶非异实矩阵,则矩阵A的求逆p-范数条件数等于1的充要条件为A=cpσ,其中c为正常数,σ是置换阵,其对角元都等于 1或-1.3.设?为n阶非异实矩阵,则矩阵4的求逆F-范数条件数等于1的充要条件为?=cU,其中c为正常数,U为正交阵. 相似文献
32.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem. 相似文献
33.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
34.
Nikolaos S. PAPAGEORGIOU Nikolaos YANNAKAKIS 《数学学报(英文版)》2005,21(5):977-996
This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x(t) and x(t). In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 (T, H). Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 (T, H) to the solutions of the original convex problem (strong relaxation). An example of a nonlinear hyperbolic optimal control problem is also discussed. 相似文献
35.
Athanossios Tzouvaras 《Mathematical Logic Quarterly》2003,49(3):284-292
The powerset operator, ??, is compared with other operators of similar type and logical complexity. Namely we examine positive operators whose defining formula has a canonical form containing at most a string of universal quantifiers. We call them ?‐operators. The question we address in this paper is: How is the class of ?‐operators generated ? It is shown that every positive ?‐operator Γ such that Γ(??) ≠ ??, is finitely generated from ??, the identity operator Id, constant operators and certain trivial ones by composition, ∪ and ∩. This extends results of [3] concerning bounded positive operators. 相似文献
36.
A. Truffert 《Annals of Operations Research》1991,30(1):115-156
The conditional expectation of integrands and random sets is the main tool of stochastic optimization. This work wishes to make up for the lack of real synthesis about this subject. We improve the existing hypothesis and simplify the corresponding proofs. In the convex case we especially study the problem of the exchange of conditional expectation and subdifferential operators. 相似文献
37.
Characteristics and structures of weak efficient surfaces of production possibility sets 总被引:1,自引:0,他引:1
Quanling Wei Hong Yan Gang Hao 《Journal of Mathematical Analysis and Applications》2007,327(2):1055-1074
This paper studies the characteristics and structure of the weak surface of the production possibility set. We apply techniques and methods of transferring a polyhedral cone from its intersection form to its sum form, identify an intersection representation of the production possibility set. We give the structure theorem of weak surface of the production possibility set, which includes three complementary slackness conditions. We define the input weak efficiency and output weak efficiency for different DEA models according to the representation of the intersection form. It investigates the characteristics of the weak surfaces, and proves the structure theorems of input weak DEA efficiency and output weak DEA efficiency. The structure theorems establish weighted combination of inputs and outputs that are weak DEA efficient. Numerical examples are provided for illustration. 相似文献
38.
戴滨林 《数学物理学报(A辑)》2007,27(5):935-940
该文对高维非初等Mò'bius变换群进行了研究,得到了一些重要性质,给出了几个关于离散准则和代数收敛性的定理. 相似文献
39.
本文给出递归集的Hausdorff维数的下界估计,并由此确定了一类递归集的维数,所获结果包含并推广了Bedford,Dekking及文志英、钟红柳等人的有关结果。 相似文献
40.
给出利用矩阵的初等变换求极大无关组的方法 ,并从理论上加以证明 .此法简单易行 ,且计算量小 . 相似文献