全文获取类型
收费全文 | 5295篇 |
免费 | 168篇 |
国内免费 | 156篇 |
专业分类
电工技术 | 219篇 |
综合类 | 95篇 |
化学工业 | 93篇 |
金属工艺 | 266篇 |
机械仪表 | 758篇 |
建筑科学 | 78篇 |
矿业工程 | 21篇 |
能源动力 | 75篇 |
轻工业 | 11篇 |
水利工程 | 5篇 |
石油天然气 | 14篇 |
武器工业 | 24篇 |
无线电 | 517篇 |
一般工业技术 | 186篇 |
冶金工业 | 28篇 |
原子能技术 | 50篇 |
自动化技术 | 3179篇 |
出版年
2024年 | 5篇 |
2023年 | 26篇 |
2022年 | 41篇 |
2021年 | 57篇 |
2020年 | 57篇 |
2019年 | 41篇 |
2018年 | 70篇 |
2017年 | 120篇 |
2016年 | 100篇 |
2015年 | 153篇 |
2014年 | 262篇 |
2013年 | 218篇 |
2012年 | 295篇 |
2011年 | 390篇 |
2010年 | 183篇 |
2009年 | 284篇 |
2008年 | 268篇 |
2007年 | 316篇 |
2006年 | 324篇 |
2005年 | 317篇 |
2004年 | 290篇 |
2003年 | 216篇 |
2002年 | 183篇 |
2001年 | 145篇 |
2000年 | 135篇 |
1999年 | 147篇 |
1998年 | 146篇 |
1997年 | 122篇 |
1996年 | 116篇 |
1995年 | 105篇 |
1994年 | 87篇 |
1993年 | 63篇 |
1992年 | 62篇 |
1991年 | 43篇 |
1990年 | 54篇 |
1989年 | 32篇 |
1988年 | 44篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 21篇 |
1984年 | 14篇 |
1983年 | 10篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1976年 | 4篇 |
1974年 | 3篇 |
1973年 | 4篇 |
排序方式: 共有5619条查询结果,搜索用时 15 毫秒
1.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献
2.
Crashworthiness simulation system is one of the key computer-aided engineering (CAE) tools for the automobile industry and implies two potential conflicting requirements: accuracy and efficiency. A parallel crashworthiness simulation system based on graphics processing unit (GPU) architecture and the explicit finite element (FE) method is developed in this work. Implementation details with compute unified device architecture (CUDA) are considered. The entire parallel simulation system involves a parallel hierarchy-territory contact-searching algorithm (HITA) and a parallel penalty contact force calculation algorithm. Three basic GPU-based parallel strategies are suggested to meet the natural parallelism of the explicit FE algorithm. Two free GPU-based numerical calculation libraries, cuBLAS and Thrust, are introduced to decrease the difficulty of programming. Furthermore, a mixed array and a thread map to element strategy are proposed to improve the performance of the test pairs searching. The outer loop of the nested loop through the mixed array is unrolled to realize parallel searching. An efficient storage strategy based on data sorting is presented to realize data transfer between different hierarchies with coalesced access during the contact pairs searching. A thread map to element pattern is implemented to calculate the penetrations and the penetration forces; a double float atomic operation is used to scatter contact forces. The simulation results of the three different models based on the Intel Core i7-930 and the NVIDIA GeForce GTX 580 demonstrate the precision and efficiency of this developed parallel crashworthiness simulation system. 相似文献
3.
4.
5.
李宏伟 《数值计算与计算机应用》2003,24(1):44-52
1.引 言 古典加法Schwarz方法(ASM)对于一般问题收敛很慢,在大多数情况下, ASM只能作为预条件子.另一方面,ASM的并行性能非常好,尤其适合大规模粗粒度并行计算,近年来随着并行机系统及并行计算的兴起,ASM重新受到重视.许多学者研究了怎样提高ASM的收敛速度[1,2,4].他们发现加法Schwarz方法之所以收敛慢是由于在内边界上采用 相似文献
6.
高可用度的冗余UPS 总被引:1,自引:0,他引:1
简述通信行业标准《通信局(站)电源系统总技术要求》(YD/T1051)对UPS可用度的要求,介绍适用于电信系统的高可用度冗余UPS。 相似文献
7.
1.引言 在人工智能领域中,产生式系统是一种比较有效的知识表示方法,并得到了广泛应用。目前许多较为成功的专家系统都是用产生式系统实现的~[1]。随着应用领域的不断扩士其知识座的抓橄称渐增 相似文献
8.
J. Dingel 《Formal Aspects of Computing》2002,14(2):123-197
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to
the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists.
Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these
problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus
allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The
calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction
of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are
independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated.
Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification
notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus
rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement
relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality.
The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing
program and vice versa.
Received July 2001 / Accepted in revised form May 2002 相似文献
9.
The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.
In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model. 相似文献
10.