全文获取类型
收费全文 | 30858篇 |
免费 | 2156篇 |
国内免费 | 1576篇 |
专业分类
化学 | 8278篇 |
晶体学 | 66篇 |
力学 | 2521篇 |
综合类 | 534篇 |
数学 | 16224篇 |
物理学 | 6967篇 |
出版年
2024年 | 158篇 |
2023年 | 913篇 |
2022年 | 993篇 |
2021年 | 987篇 |
2020年 | 1936篇 |
2019年 | 1559篇 |
2018年 | 1426篇 |
2017年 | 1419篇 |
2016年 | 1511篇 |
2015年 | 1144篇 |
2014年 | 1737篇 |
2013年 | 4171篇 |
2012年 | 1438篇 |
2011年 | 1152篇 |
2010年 | 1006篇 |
2009年 | 1220篇 |
2008年 | 1261篇 |
2007年 | 1244篇 |
2006年 | 1109篇 |
2005年 | 1051篇 |
2004年 | 937篇 |
2003年 | 791篇 |
2002年 | 742篇 |
2001年 | 611篇 |
2000年 | 574篇 |
1999年 | 518篇 |
1998年 | 495篇 |
1997年 | 424篇 |
1996年 | 325篇 |
1995年 | 243篇 |
1994年 | 192篇 |
1993年 | 195篇 |
1992年 | 150篇 |
1991年 | 92篇 |
1990年 | 97篇 |
1989年 | 71篇 |
1988年 | 67篇 |
1987年 | 49篇 |
1986年 | 52篇 |
1985年 | 78篇 |
1984年 | 71篇 |
1983年 | 33篇 |
1982年 | 67篇 |
1981年 | 62篇 |
1980年 | 52篇 |
1979年 | 32篇 |
1978年 | 28篇 |
1977年 | 29篇 |
1976年 | 24篇 |
1975年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
51.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
52.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
53.
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 相似文献
55.
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. 相似文献
56.
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. 相似文献
57.
58.
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. 相似文献
59.
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. 相似文献
60.
本文给出递归集的Hausdorff维数的下界估计,并由此确定了一类递归集的维数,所获结果包含并推广了Bedford,Dekking及文志英、钟红柳等人的有关结果。 相似文献