全文获取类型
收费全文 | 3122篇 |
免费 | 112篇 |
国内免费 | 74篇 |
专业分类
化学 | 223篇 |
晶体学 | 5篇 |
力学 | 157篇 |
综合类 | 31篇 |
数学 | 2375篇 |
物理学 | 517篇 |
出版年
2023年 | 29篇 |
2022年 | 49篇 |
2021年 | 45篇 |
2020年 | 38篇 |
2019年 | 36篇 |
2018年 | 35篇 |
2017年 | 46篇 |
2016年 | 61篇 |
2015年 | 49篇 |
2014年 | 116篇 |
2013年 | 140篇 |
2012年 | 113篇 |
2011年 | 133篇 |
2010年 | 138篇 |
2009年 | 217篇 |
2008年 | 236篇 |
2007年 | 252篇 |
2006年 | 183篇 |
2005年 | 154篇 |
2004年 | 129篇 |
2003年 | 120篇 |
2002年 | 118篇 |
2001年 | 93篇 |
2000年 | 80篇 |
1999年 | 80篇 |
1998年 | 89篇 |
1997年 | 63篇 |
1996年 | 67篇 |
1995年 | 43篇 |
1994年 | 40篇 |
1993年 | 43篇 |
1992年 | 30篇 |
1991年 | 29篇 |
1990年 | 21篇 |
1989年 | 19篇 |
1988年 | 29篇 |
1987年 | 15篇 |
1986年 | 17篇 |
1985年 | 18篇 |
1984年 | 22篇 |
1983年 | 5篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 7篇 |
1976年 | 9篇 |
1975年 | 2篇 |
1974年 | 2篇 |
排序方式: 共有3308条查询结果,搜索用时 93 毫秒
41.
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations 总被引:5,自引:0,他引:5
A. A. Brown M. C. Bartholomew-Biggs 《Journal of Optimization Theory and Applications》1989,62(2):211-224
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement. 相似文献
42.
In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of
an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial
example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the
solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available.
Received: 1 July 2002 相似文献
43.
44.
We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.This work was supported by the National Science Foundation under Grants ECS-88-01912 and EID-92-12122 and by NASA under Contract NAG 2-595.The authors wish to thank an anonymous referee for pointing out Ref. 20, thus avoiding the need for an explicit proof of convexity of the cost function considered in the paper. 相似文献
45.
We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem. 相似文献
46.
The presented work offers new algorithms for phase evaluation in interferometric measurements. Several phase-shifting algorithms with an arbitrary but constant phase-shift between captured intensity frames are proposed. These phase calculation algorithms need to measure five frames of the intensity of the interference field. The algorithms are similarly derived as so called Carré algorithm. The phase evaluation process then does not depend on the linear phase shift errors. Furthermore, the detailed analysis of the algorithms with respect to most important factors, which affect interferometric measurements, is carried out. It is also studied the dependency of the evaluation algorithms on the phase shift values, and the proposed phase calculation algorithms are compared with respect to the resulting phase errors. The influence of most important factors in the measurement and evaluation process was simulated as systematic and random errors using a proposed mathematical model. 相似文献
47.
Convergent Algorithm Based on Progressive Regularization for Solving Pseudomonotone Variational Inequalities 总被引:2,自引:2,他引:0
In this paper, we extend the Moreau-Yosida regularization of monotone variational inequalities to the case of weakly monotone and pseudomonotone operators. With these properties, the regularized operator satisfies the pseudo-Dunn property with respect to any solution of the variational inequality problem. As a consequence, the regularized version of the auxiliary problem algorithm converges. In this case, when the operator involved in the variational inequality problem is Lipschitz continuous (a property stronger than weak monotonicity) and pseudomonotone, we prove the convergence of the progressive regularization introduced in Refs. 1, 2. 相似文献
48.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
49.
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width 总被引:2,自引:0,他引:2
Gruia C
linescu Cristina G. Fernandes Bruce Reed 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):333-359
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut. 相似文献
50.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献