全文获取类型
收费全文 | 22655篇 |
免费 | 3231篇 |
国内免费 | 2704篇 |
专业分类
电工技术 | 2011篇 |
技术理论 | 6篇 |
综合类 | 2024篇 |
化学工业 | 394篇 |
金属工艺 | 264篇 |
机械仪表 | 1844篇 |
建筑科学 | 456篇 |
矿业工程 | 277篇 |
能源动力 | 245篇 |
轻工业 | 122篇 |
水利工程 | 216篇 |
石油天然气 | 228篇 |
武器工业 | 154篇 |
无线电 | 3878篇 |
一般工业技术 | 1189篇 |
冶金工业 | 182篇 |
原子能技术 | 133篇 |
自动化技术 | 14967篇 |
出版年
2024年 | 173篇 |
2023年 | 481篇 |
2022年 | 671篇 |
2021年 | 834篇 |
2020年 | 914篇 |
2019年 | 702篇 |
2018年 | 724篇 |
2017年 | 943篇 |
2016年 | 1076篇 |
2015年 | 1292篇 |
2014年 | 1883篇 |
2013年 | 1709篇 |
2012年 | 1989篇 |
2011年 | 1889篇 |
2010年 | 1261篇 |
2009年 | 1275篇 |
2008年 | 1403篇 |
2007年 | 1563篇 |
2006年 | 1224篇 |
2005年 | 1155篇 |
2004年 | 976篇 |
2003年 | 834篇 |
2002年 | 634篇 |
2001年 | 540篇 |
2000年 | 437篇 |
1999年 | 350篇 |
1998年 | 259篇 |
1997年 | 250篇 |
1996年 | 204篇 |
1995年 | 178篇 |
1994年 | 163篇 |
1993年 | 114篇 |
1992年 | 122篇 |
1991年 | 60篇 |
1990年 | 50篇 |
1989年 | 50篇 |
1988年 | 45篇 |
1987年 | 30篇 |
1986年 | 22篇 |
1985年 | 24篇 |
1984年 | 19篇 |
1983年 | 14篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 9篇 |
1979年 | 8篇 |
1977年 | 8篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1972年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
对于某些容错计算系统,由于成功与故障之间没有明确的界限,用传统的可靠性指标难以准确地评价其容错性能,为此一些学者提出了若干与性能相关的可靠性指标。本文将这些指标概括成三类(即基于瞬时性能的指标、基于累积收益的指标和率模可靠性指标)加以介绍,并简要介绍了它们的求解方法。 相似文献
32.
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. 相似文献
33.
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. 相似文献
34.
Jean-Christophe Autrique 《Computers & Structures》2007,85(9):518-525
This work is devoted to a study of a conjugated infinite element method for Helmholtz problems in exterior domains. A formulation of this method with Lagrange multipliers defined on (semi-)infinite space is presented and analyzed in a domain decomposition context. The implementation aspects of this method in a parallel industrial acoustic software (SYSNOISE) are described in details. Numerical results show the computational efficiency of this method on acoustic scattering problems. 相似文献
35.
The concept of combinatorial objects is formalized. It allows strict definition of a combinatorial optimization problem (COP).
An efficient metaheuristic method to solve COPs (H-method) is considered. It includes stochastic local search algorithms as
a built-in procedure. A parallel implementation of the H-method is set forth and analyzed. The results from a numerical experiment
and solution of some well-known COPs on personal computers and on the SKIT cluster supercomputer are presented.
The study was supported by INTAS (Project 06-1000017-8909).
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 70–79, November–December 2007. 相似文献
36.
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. 相似文献
37.
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. 相似文献
38.
广义de Bruijn多计算机互连网络 总被引:1,自引:0,他引:1
(d,m)de Bruijn多计算机系统互连网络限制网络的规模必须为d^m。本文把(d,m)de Bruijn网络推广到了任意顶点情形,提出了广义de Bruijn网络,研究了广义de Bruijn网络的自路由性质,设计了路由算法,研究了广义de Bruijn网络顶点度的性质和容错特性。 相似文献
39.
Parallel parsing is currently receiving attention but there is little discussion about the adaptation of sequential error handling techniques to these parallel algorithms. We describe a noncorrecting error handler implemented with a parallel LR substring parser. The parser used is a parallel version of Cormack's LR substring parser. The applicability of noncorrecting error handling for parallel parsing is discussed. The error information provided for a standard set of 118 erroneous Pascal programs is analysed. The programs are run on the sequential LR substring parser. 相似文献
40.
对云计算技术实现医疗信息化的背景、研究基础、核心技术进行探讨,具体阐述了“健康云”在居民电子健康档案中的应用以及在医院信息管理系统中的应用,包括系统特点、整体架构等方面,并对其未来发展予以展望。 相似文献