全文获取类型
收费全文 | 5307篇 |
免费 | 166篇 |
国内免费 | 156篇 |
专业分类
电工技术 | 217篇 |
综合类 | 96篇 |
化学工业 | 93篇 |
金属工艺 | 266篇 |
机械仪表 | 757篇 |
建筑科学 | 78篇 |
矿业工程 | 22篇 |
能源动力 | 75篇 |
轻工业 | 11篇 |
水利工程 | 5篇 |
石油天然气 | 14篇 |
武器工业 | 24篇 |
无线电 | 518篇 |
一般工业技术 | 186篇 |
冶金工业 | 28篇 |
原子能技术 | 50篇 |
自动化技术 | 3189篇 |
出版年
2024年 | 5篇 |
2023年 | 26篇 |
2022年 | 42篇 |
2021年 | 55篇 |
2020年 | 57篇 |
2019年 | 41篇 |
2018年 | 70篇 |
2017年 | 120篇 |
2016年 | 100篇 |
2015年 | 153篇 |
2014年 | 263篇 |
2013年 | 218篇 |
2012年 | 296篇 |
2011年 | 392篇 |
2010年 | 183篇 |
2009年 | 285篇 |
2008年 | 270篇 |
2007年 | 317篇 |
2006年 | 324篇 |
2005年 | 317篇 |
2004年 | 291篇 |
2003年 | 216篇 |
2002年 | 184篇 |
2001年 | 146篇 |
2000年 | 135篇 |
1999年 | 146篇 |
1998年 | 147篇 |
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篇 |
排序方式: 共有5629条查询结果,搜索用时 15 毫秒
101.
102.
智能公交排班问题是公交车辆智能调度的一个典型问题之一。它可以描述为:利用某种智能化算法,在有限的步骤内,找出所有满足约束条件的最优或者接近最优的排班方案。由于排班问题搜索规模巨大,传统算法在短时间内难以获得高质量可行解。文章引入并行遗传算法,对三种主流并行模型进行评价分析,并设计了求解车辆排班问题的粗粒度并行遗传算法,编制了算法实现程序。 相似文献
103.
伴随着GPGPU计算技术的不断发展,HPC高性能计算系统体系结构正在悄然发生着一场变革,这场变革为高性能计算发展提供了一个新的方向、CUDA是NIVIDIA公司提供的利用GPGPU进行并行运算应用开发的一套C语言编程平台,通过它可以利用特定显卡的高性能运算能力进行一些大规模高性能计算,有效提升计算机系统的使用效率,本文主要介绍GPU发展现状以及如何利用CUDA编程技术进行并行运算软件开发. 相似文献
104.
在本文中,我们探讨一种基于并行处理技术并且能够改进数据仓库查询方法。而且,我们设计运算法则对于任务和数据进行分割来实现并行星型联结。 相似文献
105.
GridFTP is a secure and reliable high-performance parallel data transfer protocol used for transferring massive amounts of widely distributed data. Currently it allows users to configure the number of parallel streams and socket buffer size. However, its tuning procedure for optimal combination is a time consuming task. The socket handlers and buffers are important system resources and must therefore be carefully managed. In this paper, we propose a scheme to achieve high throughput even with a smaller buffer size, and also derive a regression equation to predict the optimal combination of resources for a connection. To improve the performance, the TCP based on our scheme obtains higher throughput and spends less memory for the same throughput than the original TCP scheme. In addition, the regression equation is verified by comparing measured and predicted values, and we apply the equation to an actual experiment on the KOrea advanced REsearch Network (KOREN). The result demonstrates that the equation provides excellent predictions with only an 8% error boundary. 相似文献
106.
Integrating job parallelism in real-time scheduling theory 总被引:1,自引:0,他引:1
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem of these systems is linear relatively to the number of (sporadic) tasks for a fixed number of processors. We propose a scheduling algorithm theoretically optimal (i.e., preemptions and migrations neglected). Moreover, we provide an exact feasibility utilization bound. Lastly, we propose a technique to limit the number of migrations and preemptions. 相似文献
107.
We present a randomized EREW PRAM algorithm to find a minimum spanning forest in a weighted undirected graph. On an n -vertex graph the algorithm runs in o(( log n)
1+
ɛ
) expected time for any ɛ >0 and performs linear expected work. This is the first linear-work, polylog-time algorithm on the EREW PRAM for this problem.
This also gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation—the
QSM and the BSP. 相似文献
108.
Abstract. In this paper two problems on the class of k -trees, a subclass of the class of chordal graphs, are considered: the fast reordering problem and the isomorphism problem. An O(log
2
n) time parallel algorithm for the fast reordering problem is described that uses O(nk(n-k)/\kern -1ptlog n) processors on a CRCW PRAM proving membership in the class NC for fixed k . An O(nk(k+1)!) time sequential algorithm for the isomorphism problem is obtained representing an improvement over the O(n
2
k(k+1)!) algorithm of Sekharan (the second author) [10]. A parallel version of this sequential algorithm is presented that runs in
O(log
2
n) time using O((nk((k+1)!+n-k))/log n) processors improving on a parallel algorithm of Sekharan for the isomorphism problem [10]. Both the sequential and parallel
algorithms use a concept introduced in this paper called the kernel of a k -tree. 相似文献
109.
Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the three-dimensional structure of complex biological specimens at molecular resolution. Weighted back-projection (WBP) has long been the method of choice since the reconstructions are very fast. It is well known that iterative methods produce better images, but at a very costly time penalty. In this work, it is shown that efficient parallel implementations of iterative methods, based primarily on data decomposition, can speed up such methods to an extent that they become viable alternatives to WBP. Precomputation of the coefficient matrix has also turned out to be important to substantially improve the performance regardless of the number of processors used. Matrix precomputation has made it possible to speed up the block-iterative component averaging (BICAV) algorithm, which has been studied before in the context of computerized tomography (CT) and ET, by a factor of more than 3.7. Component-averaged row projections (CARP) is a recently introduced block-parallel algorithm, which was shown to be a robust method for solving sparse systems arising from partial differential equations. It is shown that this algorithm is also suitable for single-axis ET, and is advantageous over BICAV both in terms of runtime and image quality. The experiments were carried out on several datasets of ET of various sizes, using the blob model for representing the reconstructed object. 相似文献
110.
A high performance algorithm for static task scheduling in heterogeneous distributed computing systems 总被引:2,自引:0,他引:2
Effective task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems (HeDCSs). However, finding an effective task schedule in HeDCSs requires the consideration of both the heterogeneity of processors and high interprocessor communication overhead, which results from non-trivial data movement between tasks scheduled on different processors. In this paper, we present a new high-performance scheduling algorithm, called the longest dynamic critical path (LDCP) algorithm, for HeDCSs with a bounded number of processors. The LDCP algorithm is a list-based scheduling algorithm that uses a new attribute to efficiently select tasks for scheduling in HeDCSs. The efficient selection of tasks enables the LDCP algorithm to generate high-quality task schedules in a heterogeneous computing environment. The performance of the LDCP algorithm is compared to two of the best existing scheduling algorithms for HeDCSs: the HEFT and DLS algorithms. The comparison study shows that the LDCP algorithm outperforms the HEFT and DLS algorithms in terms of schedule length and speedup. Moreover, the improvement in performance obtained by the LDCP algorithm over the HEFT and DLS algorithms increases as the inter-task communication cost increases. Therefore, the LDCP algorithm provides a practical solution for scheduling parallel applications with high communication costs in HeDCSs. 相似文献