全文获取类型
收费全文 | 6866篇 |
免费 | 425篇 |
国内免费 | 587篇 |
专业分类
化学 | 622篇 |
晶体学 | 8篇 |
力学 | 369篇 |
综合类 | 133篇 |
数学 | 6081篇 |
物理学 | 665篇 |
出版年
2024年 | 9篇 |
2023年 | 75篇 |
2022年 | 115篇 |
2021年 | 124篇 |
2020年 | 145篇 |
2019年 | 145篇 |
2018年 | 162篇 |
2017年 | 166篇 |
2016年 | 171篇 |
2015年 | 140篇 |
2014年 | 292篇 |
2013年 | 521篇 |
2012年 | 280篇 |
2011年 | 377篇 |
2010年 | 357篇 |
2009年 | 489篇 |
2008年 | 473篇 |
2007年 | 455篇 |
2006年 | 424篇 |
2005年 | 320篇 |
2004年 | 296篇 |
2003年 | 317篇 |
2002年 | 269篇 |
2001年 | 244篇 |
2000年 | 227篇 |
1999年 | 210篇 |
1998年 | 206篇 |
1997年 | 181篇 |
1996年 | 109篇 |
1995年 | 84篇 |
1994年 | 78篇 |
1993年 | 61篇 |
1992年 | 47篇 |
1991年 | 34篇 |
1990年 | 27篇 |
1989年 | 15篇 |
1988年 | 19篇 |
1987年 | 15篇 |
1986年 | 15篇 |
1985年 | 33篇 |
1984年 | 25篇 |
1983年 | 17篇 |
1982年 | 29篇 |
1981年 | 20篇 |
1980年 | 21篇 |
1979年 | 10篇 |
1978年 | 7篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1974年 | 3篇 |
排序方式: 共有7878条查询结果,搜索用时 312 毫秒
61.
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. 相似文献
62.
本文结合代数教学中的实际情况.针对代数教学过程中出现的问题。提出了在代数教学过程中改进教学方法的几条措施. 相似文献
63.
设{Xni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论. 相似文献
64.
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 相似文献
65.
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. 相似文献
66.
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. 相似文献
67.
Antonio Vitolo 《Journal of Differential Equations》2003,194(1):166-184
This paper is concerned with the maximum principle for second-order linear elliptic equations in a wide generality. By means of a geometric condition previously stressed by Berestycki-Nirenberg-Varadhan, Cabré was very able to improve the classical ABP estimate obtaining the maximum principle also in unbounded domains, such as infinite strips and open connected cones with closure different from the whole space. Now we introduce a new geometric condition that extends the result to a more general class of domains including the complements of hypersurfaces, as for instance the cut plane. The methods developed here allow us to deal with complete second-order equations, where the admissible first-order term, forced to be zero in a preceding result with Cafagna, depends on the geometry of the domain. 相似文献
69.
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. 相似文献
70.
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. 相似文献