全文获取类型
收费全文 | 6036篇 |
免费 | 748篇 |
国内免费 | 751篇 |
专业分类
电工技术 | 228篇 |
技术理论 | 1篇 |
综合类 | 649篇 |
化学工业 | 99篇 |
金属工艺 | 41篇 |
机械仪表 | 305篇 |
建筑科学 | 96篇 |
矿业工程 | 37篇 |
能源动力 | 21篇 |
轻工业 | 59篇 |
水利工程 | 34篇 |
石油天然气 | 30篇 |
武器工业 | 135篇 |
无线电 | 968篇 |
一般工业技术 | 374篇 |
冶金工业 | 832篇 |
原子能技术 | 19篇 |
自动化技术 | 3607篇 |
出版年
2024年 | 39篇 |
2023年 | 98篇 |
2022年 | 162篇 |
2021年 | 135篇 |
2020年 | 161篇 |
2019年 | 148篇 |
2018年 | 122篇 |
2017年 | 175篇 |
2016年 | 206篇 |
2015年 | 237篇 |
2014年 | 383篇 |
2013年 | 425篇 |
2012年 | 488篇 |
2011年 | 490篇 |
2010年 | 402篇 |
2009年 | 430篇 |
2008年 | 451篇 |
2007年 | 442篇 |
2006年 | 375篇 |
2005年 | 364篇 |
2004年 | 302篇 |
2003年 | 278篇 |
2002年 | 202篇 |
2001年 | 179篇 |
2000年 | 102篇 |
1999年 | 93篇 |
1998年 | 85篇 |
1997年 | 65篇 |
1996年 | 66篇 |
1995年 | 55篇 |
1994年 | 46篇 |
1993年 | 31篇 |
1992年 | 29篇 |
1991年 | 26篇 |
1990年 | 29篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1966年 | 10篇 |
1965年 | 8篇 |
1964年 | 17篇 |
1963年 | 17篇 |
1962年 | 9篇 |
1961年 | 8篇 |
1960年 | 6篇 |
1959年 | 14篇 |
1956年 | 12篇 |
1955年 | 6篇 |
排序方式: 共有7535条查询结果,搜索用时 109 毫秒
81.
In this paper, we consider the problem of determining a best compromise solution for the multi-objective assignment problem. Such a solution minimizes a scalarizing function, such as the weighted Tchebychev norm or reference point achievement functions. To solve this problem, we resort to a ranking (or k-best) algorithm which enumerates feasible solutions according to an appropriate weighted sum until a condition, ensuring that an optimal solution has been found, is met. The ranking algorithm is based on a branch and bound scheme. We study how to implement efficiently this procedure by considering different algorithmic variants within the procedure: choice of the weighted sum, branching and bounding schemes. We present an experimental analysis that enables us to point out the best variants, and we provide experimental results showing the remarkable efficiency of the procedure, even for large size instances. 相似文献
82.
The Hadoop Distributed File System (HDFS) is designed to run on commodity hardware and can be used as a stand-alone general purpose distributed file system (Hdfs user guide, 2008). It provides the ability to access bulk data with high I/O throughput. As a result, this system is suitable for applications that have large I/O data sets. However, the performance of HDFS decreases dramatically when handling the operations of interaction-intensive files, i.e., files that have relatively small size but are frequently accessed. The paper analyzes the cause of throughput degradation issue when accessing interaction-intensive files and presents an enhanced HDFS architecture along with an associated storage allocation algorithm that overcomes the performance degradation problem. Experiments have shown that with the proposed architecture together with the associated storage allocation algorithm, the HDFS throughput for interaction-intensive files increases 300% on average with only a negligible performance decrease for large data set tasks. 相似文献
83.
84.
《Robotics and Autonomous Systems》2014,62(9):1294-1304
Target enclosure by autonomous robots is useful for many practical applications, for example, surveillance of disaster sites. Scalability is important for autonomous robots because a larger group is more robust against breakdown, accidents, and failure. However, since the traditional models have discussed only the cases in which minimum number of robots enclose a single target, there has been no study on the utilization of the redundant number of robots. In this paper, to achieve a highly scalable target enclosure model about the number of target to enclose, we introduce swarm based task assignment capability to Takayama’s enclosure model. The original model discussed only single target environment but it is well suited for applying to the environments with multiple targets. We show the robots can enclose the targets without predefined position assignment by analytic discussion based on switched systems and a series of computer simulations. As a consequence of this property, the proposed robots can change their target according to the criterion about robot density while they enclose multiple targets. 相似文献
85.
86.
87.
88.
89.
对Hadoop平台下的MapReduce现有的调度器进行分析研究。针对LATE调度算法在分配节点执行落后任务的备份任务时的不足,结合Hadoop集群的异构性和工作负载的特殊性,在LATE调度算法的基础上提出了一种改进的LATE调度算法。对该算法进行实验和性能分析,表明该算法在完成时间和负载均衡方面有很大改进。 相似文献
90.
邓宾 《自动化与仪器仪表》2014,(3):29-30
并行处理在计算能力方面与单处理器的串行处理相比有着无可比拟的优势。个人计算机和网络成本的下降使得使用分布式系统进行并行处理的现象越来越普遍,而分布式网络系统中多采用MPI作为并行编程标准。为了减少程序运行时间,改善MPI计算的性能,负载均衡方法尤为重要,本文提出一种在MPI并行处理中负载均衡的方法,可以按照节点的计算能力和负载情况,在节点之间分配和迁移任务。实验表明,本文提出的方法可有效提高MPI并行处理的性能。 相似文献