全文获取类型
收费全文 | 1800篇 |
免费 | 142篇 |
国内免费 | 170篇 |
专业分类
电工技术 | 106篇 |
综合类 | 56篇 |
化学工业 | 15篇 |
金属工艺 | 10篇 |
机械仪表 | 74篇 |
建筑科学 | 18篇 |
矿业工程 | 8篇 |
能源动力 | 14篇 |
轻工业 | 3篇 |
水利工程 | 7篇 |
石油天然气 | 5篇 |
武器工业 | 4篇 |
无线电 | 147篇 |
一般工业技术 | 97篇 |
冶金工业 | 8篇 |
原子能技术 | 8篇 |
自动化技术 | 1532篇 |
出版年
2024年 | 5篇 |
2023年 | 11篇 |
2022年 | 27篇 |
2021年 | 35篇 |
2020年 | 40篇 |
2019年 | 38篇 |
2018年 | 36篇 |
2017年 | 51篇 |
2016年 | 60篇 |
2015年 | 84篇 |
2014年 | 115篇 |
2013年 | 153篇 |
2012年 | 144篇 |
2011年 | 142篇 |
2010年 | 69篇 |
2009年 | 107篇 |
2008年 | 157篇 |
2007年 | 141篇 |
2006年 | 118篇 |
2005年 | 109篇 |
2004年 | 84篇 |
2003年 | 87篇 |
2002年 | 69篇 |
2001年 | 54篇 |
2000年 | 36篇 |
1999年 | 24篇 |
1998年 | 29篇 |
1997年 | 22篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 8篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1984年 | 1篇 |
1982年 | 2篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1954年 | 1篇 |
排序方式: 共有2112条查询结果,搜索用时 15 毫秒
1.
Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm. 相似文献
2.
3.
从电子商务在我国迅速发展的角度出发,系统地介绍了我国电子商务网站的典范:阿里巴巴、淘宝。从电子商务的模式出发分析了其经营理念,成功因素及其不足,对中国的电子商务目前状况作了分析,并提出展望。 相似文献
4.
Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search. 相似文献
5.
运动估计块匹配两级搜索算法 总被引:2,自引:0,他引:2
根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度. 相似文献
6.
In this paper we develop and compare several heuristic methods for solving the general two-dimensional cutting stock problem.
We follow the Gilmore-Gomory column generation scheme in which at each iteration a new cutting pattern is obtained as the
solution of a subproblem on one stock sheet. For solving this subproblem, in addition to classical dynamic programming, we
have developed three heuristic procedures of increasing complexity, based on GRASP and Tabu Search techniques, producing solutions
differing in quality and in time requirements. In order to obtain integer solutions from the fractional solutions of the Gilmore-Gomory
process, we compare three rounding procedures, rounding up, truncated branch and bound and the solution of a residual problem.
We have coded and tested all the combinations of algorithms and rounding procedures. The computational results obtained on
a set of randomly generated test problems show their relative efficiency and allow the potential user to choose from among
them, according to the available computing time.
Rceived: January 9, 2001 / Accepted: December 10, 2001 相似文献
7.
Xianpeng Wang Lixin Tang 《The International Journal of Advanced Manufacturing Technology》2008,36(5-6):431-441
This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer
programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using
this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable
of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain
near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure
of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic
has been developed and tested on instances collected from practical production data. The experimental results show that the
proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional
serial method. 相似文献
8.
刘旭东 《计算机光盘软件与应用》2012,(2):206-207
本文基于数字水印技术提出了一种网络多媒体作品的注册和侵权收集机制,可以实现包括图像、视频和音频等网络作品的注册和非授权复制和传播行为的信息收集等功能。该机制对网络多媒体作品的版权保护具有一定的实用价值。 相似文献
9.
Guoqiang Gao Ruixuan Li Kunmei Wen Xiwu Gu 《Journal of Network and Computer Applications》2012,35(1):85-96
Unstructured peer-to-peer (P2P) networks have become a very popular architecture for content distribution in large-scale and dynamic environments. The search efficiency problem in unstructured P2P networks has not been adequately addressed so far, especially concerning search for rare objects. In this paper, we propose a proactive replication strategy to improve search efficiency for rare objects. It uses an object-probing technique for peers to decide whether or not to establish replications for their objects when they join the network. This strategy can effectively increase the popularity of rare objects in order to enhance search efficiency. We also present a rare object search algorithm to reduce the overhead caused by the replication strategy. When a peer forwards a search request, the forward probability is calculated according to its neighbors' degrees and the number of neighbors' objects. Therefore, the search request is forwarded to the peers more likely containing target objects. Simulations show that our proactive replication strategy greatly improves search efficiency for rare objects with moderate communication overhead. The rare object search algorithm not only improves search efficiency for rare objects, but also achieves load balance in search. 相似文献
10.
针对新时代环境下Newsvendor型产品销售期短、期末未出售产品价值递减的产品特点,生产链要求位于上游的供应商必须快速加工出所需的工件,否则将面临着线性递增的拖期惩罚。在面对基于Newsvendor型产品的柔性作业车间调度问题时,设计了一种加入禁忌搜索的混合遗传算法,扩大了解的搜索范围,避免了传统遗传算法容易陷于局部最优的缺陷。最后利用混合遗传算法对一个仿真案例进行求解。 相似文献