全文获取类型
收费全文 | 14649篇 |
免费 | 2153篇 |
国内免费 | 1480篇 |
专业分类
电工技术 | 3010篇 |
技术理论 | 3篇 |
综合类 | 1589篇 |
化学工业 | 482篇 |
金属工艺 | 278篇 |
机械仪表 | 1761篇 |
建筑科学 | 503篇 |
矿业工程 | 250篇 |
能源动力 | 316篇 |
轻工业 | 176篇 |
水利工程 | 217篇 |
石油天然气 | 198篇 |
武器工业 | 112篇 |
无线电 | 1866篇 |
一般工业技术 | 1023篇 |
冶金工业 | 183篇 |
原子能技术 | 130篇 |
自动化技术 | 6185篇 |
出版年
2024年 | 71篇 |
2023年 | 163篇 |
2022年 | 314篇 |
2021年 | 412篇 |
2020年 | 398篇 |
2019年 | 355篇 |
2018年 | 392篇 |
2017年 | 517篇 |
2016年 | 604篇 |
2015年 | 725篇 |
2014年 | 971篇 |
2013年 | 1009篇 |
2012年 | 1218篇 |
2011年 | 1226篇 |
2010年 | 902篇 |
2009年 | 941篇 |
2008年 | 925篇 |
2007年 | 1076篇 |
2006年 | 876篇 |
2005年 | 826篇 |
2004年 | 734篇 |
2003年 | 581篇 |
2002年 | 470篇 |
2001年 | 401篇 |
2000年 | 374篇 |
1999年 | 291篇 |
1998年 | 226篇 |
1997年 | 224篇 |
1996年 | 166篇 |
1995年 | 168篇 |
1994年 | 147篇 |
1993年 | 116篇 |
1992年 | 115篇 |
1991年 | 57篇 |
1990年 | 50篇 |
1989年 | 50篇 |
1988年 | 42篇 |
1987年 | 28篇 |
1986年 | 16篇 |
1985年 | 22篇 |
1984年 | 23篇 |
1983年 | 15篇 |
1982年 | 7篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1975年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
通过对目前宽带线路数最多的10个国家和地区、2003年上半年新增线路最多的10个国家、全球宽带业务普及率最高的10个国家和地区、部分运营商住宅DSL业务的第一年费用以及2000~2002年全球入门级住宅DSL业务价格的发展趋势等图表的分析,阐明了全球宽带接入市场的发展状况,指出了其市场规模继续扩大、经济发达国家宽带线路增长速度较快、普及率的差距逐渐缩小以及业务价格趋于稳定等特点. 相似文献
2.
F. Pasquarelli 《Journal of scientific computing》1995,10(3):289-304
The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%). 相似文献
3.
With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix. 相似文献
4.
Andrzej Ciepielewski 《International journal of parallel programming》1991,20(6):421-451
Implementation of or-parallel Prolog systems offers a number of interesting scheduling problems. The main issues are the interaction between memory models and scheduling, ordering of multiple solutions, and scheduling of speculative work. The problems occur partly because of the design choices (e.g. the choice of a memory model), and partly because of the desire to maintain observational equivalence between parallel and sequential implementations of Prolog, while achieving high efficiency. In the first part of this paper a common framework for discussing scheduling in or-parallel systems is introduced, and also a collection of issues that must be addressed in such systems is presented. In the second part of the paper we survey a number of solutions to these problems comparing their efficiency whenever possible. We close the survey with a short discussion of open problems.Current association: Carlstedt Elektronik AB 相似文献
5.
L. O. Aizenberg E. A. Khvoles 《Power Technology and Engineering (formerly Hydrotechnical Construction)》2007,41(6):379-382
Problems with the construction of transmission lines above a forest are examined. Construction of lines above standing timber
makes it possible to shorten the length of the route, eliminate the clearing of a continuous swath along the line, and reduce
the volume of in-service work. To implement this solution, it is necessary to introduce changes and supplements to existing
regulatory technical documents.
__________
Translated from élektricheskie Stantsii, No. 10, October 2007, pp. 48–51. 相似文献
6.
A new evaluation model for SK combinator expressions is presented and used as a basis for the design of a novel processor. The resulting machine architecture resembles a dataflow ring, but executions are constrained to be fully lazy. An automatic dynamic load sharing mechanism for a distributed multiprocessor architecture is suggested, and initial simulation results are presented. 相似文献
7.
Precise timing and asynchronous I/O are appealing features for many applications. Unix kernels provide such features on a per‐process basis, using signals to communicate asynchronous events to applications. Per‐process signals and timers are grossly inadequate for complex multithreaded applications that require per‐thread signals and timers that operate at finer granularity. To respond to this need, we present a scheme that integrates asynchronous (Unix) signals with user‐level threads, using the ARIADNE system as a platform. This is done with a view towards support for portable, multithreaded, and multiprotocol distributed applications, namely the CLAM (connectionless, lightweight, and multiway) communications library. In the same context, we propose the use of continuations as an efficient mechanism for reducing thread context‐switching and busy‐wait overheads in multithreaded protocols. Our proposal for integrating timers and signal‐handling mechanisms not only solves problems related to race conditions, but also offers an efficient and flexible interface for timing and signalling threads. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
8.
Guang R. Gao 《Parallel Computing》1987,4(3):305-321
A new method of classification for numerical stability of parallel algorithms is proposed based on the theoretical foundation of forward error analysis. It partitions the algorithms according to their asymptotic stability—a measure introduced to relate the limiting behavior of the stability to the size of the problem. Using this method, the stability aspect of the pipelined solution technique for first-order and second-order linear recurrences—the core of a tridiagonal linear equation solver—is studied. In particular, it shows that the pipelined solution method of the first-order linear recurrences has the same degree of stability as the commonly used sequential evaluation algorithms. The stability problems of sequential and pipelined solution methods of the second-order linear recurrences are also studied. 相似文献
9.
A. Chin 《Algorithmica》1994,12(2-3):170-181
Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust. 相似文献
10.
广义de Bruijn多计算机互连网络 总被引:1,自引:0,他引:1
(d,m)de Bruijn多计算机系统互连网络限制网络的规模必须为d^m。本文把(d,m)de Bruijn网络推广到了任意顶点情形,提出了广义de Bruijn网络,研究了广义de Bruijn网络的自路由性质,设计了路由算法,研究了广义de Bruijn网络顶点度的性质和容错特性。 相似文献