全文获取类型
收费全文 | 3898篇 |
免费 | 501篇 |
国内免费 | 141篇 |
专业分类
化学 | 302篇 |
晶体学 | 3篇 |
力学 | 350篇 |
综合类 | 88篇 |
数学 | 1159篇 |
物理学 | 699篇 |
无线电 | 1939篇 |
出版年
2024年 | 7篇 |
2023年 | 34篇 |
2022年 | 50篇 |
2021年 | 56篇 |
2020年 | 90篇 |
2019年 | 69篇 |
2018年 | 62篇 |
2017年 | 110篇 |
2016年 | 138篇 |
2015年 | 144篇 |
2014年 | 193篇 |
2013年 | 229篇 |
2012年 | 270篇 |
2011年 | 269篇 |
2010年 | 174篇 |
2009年 | 179篇 |
2008年 | 247篇 |
2007年 | 256篇 |
2006年 | 227篇 |
2005年 | 228篇 |
2004年 | 231篇 |
2003年 | 204篇 |
2002年 | 162篇 |
2001年 | 136篇 |
2000年 | 116篇 |
1999年 | 97篇 |
1998年 | 92篇 |
1997年 | 94篇 |
1996年 | 59篇 |
1995年 | 65篇 |
1994年 | 52篇 |
1993年 | 50篇 |
1992年 | 42篇 |
1991年 | 19篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 16篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 9篇 |
1984年 | 16篇 |
1982年 | 3篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有4540条查询结果,搜索用时 393 毫秒
21.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
22.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
23.
24.
We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1. 相似文献
25.
In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case. 相似文献
26.
1 Introduction Moderndigitalcommunicationsystemsoftenrequireerror freetransmission .Errorcontrolcodingtechnologyhasbeenusedwidelyincommunicationsystem .Andithasbeenimprovingtheperformanceofcommunicationsystem greatly ,especiallyinwirelesscommunicationss… 相似文献
27.
28.
基于SUN5500小型计算机并行开发环境,给出了消息传递模型和蕴式行模型的实现方法,通过实例分析了SUNMPI实际编程,并对选取不同模型有不同参数的运算时间进行了比较,结果表明,在SUN5500计算机上MPI模型和蕴式并行模型均能较大地提高运算速度,而且MPI在灵活性和并行程度方面更优。 相似文献
29.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
30.
In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|rj|Lmax which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity. 相似文献