全文获取类型
收费全文 | 28101篇 |
免费 | 2868篇 |
国内免费 | 2192篇 |
专业分类
电工技术 | 2447篇 |
技术理论 | 4篇 |
综合类 | 3183篇 |
化学工业 | 601篇 |
金属工艺 | 787篇 |
机械仪表 | 2173篇 |
建筑科学 | 2153篇 |
矿业工程 | 614篇 |
能源动力 | 320篇 |
轻工业 | 316篇 |
水利工程 | 591篇 |
石油天然气 | 1293篇 |
武器工业 | 356篇 |
无线电 | 5279篇 |
一般工业技术 | 1574篇 |
冶金工业 | 740篇 |
原子能技术 | 55篇 |
自动化技术 | 10675篇 |
出版年
2024年 | 84篇 |
2023年 | 375篇 |
2022年 | 716篇 |
2021年 | 895篇 |
2020年 | 1010篇 |
2019年 | 623篇 |
2018年 | 728篇 |
2017年 | 835篇 |
2016年 | 965篇 |
2015年 | 1166篇 |
2014年 | 2260篇 |
2013年 | 1897篇 |
2012年 | 2480篇 |
2011年 | 2414篇 |
2010年 | 1799篇 |
2009年 | 1846篇 |
2008年 | 1918篇 |
2007年 | 2171篇 |
2006年 | 1840篇 |
2005年 | 1675篇 |
2004年 | 1343篇 |
2003年 | 1078篇 |
2002年 | 755篇 |
2001年 | 588篇 |
2000年 | 497篇 |
1999年 | 320篇 |
1998年 | 191篇 |
1997年 | 163篇 |
1996年 | 138篇 |
1995年 | 108篇 |
1994年 | 91篇 |
1993年 | 43篇 |
1992年 | 22篇 |
1991年 | 14篇 |
1990年 | 21篇 |
1989年 | 14篇 |
1988年 | 13篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 3篇 |
1973年 | 3篇 |
1958年 | 2篇 |
1957年 | 2篇 |
1956年 | 2篇 |
1955年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Load testing of applications is an important and costly activity for software provider companies. Classical solutions are very difficult to set up statically, and their cost is prohibitive in terms of both human and hardware resources. Virtualized cloud computing platforms provide new opportunities for stressing an application's scalability, by providing a large range of flexible and less expensive (pay‐per‐use model) computation units. On the basis of these advantages, load testing solutions could be provided on demand in the cloud. This paper describes a Benchmark‐as‐a‐Service solution that automatically scales the load injection platform and facilitates its setup according to load profiles. Our approach is based on: (i) virtualization of the benchmarking platform to create self‐scaling injectors; (ii) online calibration to characterize the injector's capacity and impact on the benched application; and (iii) a provisioning solution to appropriately scale the load injection platform ahead of time. We also report experiments on a benchmark illustrating the benefits of this system in terms of cost and resource reductions. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
12.
Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient. 相似文献
13.
为解决依赖装维上门鉴别光网络单元故障带来的不便,可以从机器视觉入手实现自动化故障识别。近年,ImageNet挑战赛的成功推动了物体识别技术的跨越式发展,特别是基于卷积的深度学习技术在视觉识别方面已经达到人类水平,为光网络单元故障的自动识别提供了技术基础。文章对识别光网络单元的工作状态进行了研究,将设备工作状态分为7个场景,提出了利用手机APP采集图片识别故障的解决方案并投入了实际生产;重点阐述了深度学习模块的设计与实现,提出一种通过算法整合的方式综合运用物体检测和图像分类算法,分3阶段逐步求精,解决了图片过滤,光网络单元型号和状态识别等问题,实现了基于计算机视觉自动识别光网络单元故障。从数据上看产品的端到端准确率超过84%,识别速度达到10 FPS,月均提供服务超过1万人次,在减少用户等待的同时节约了人力资源。 相似文献
14.
15.
摘 要:针对城市地理信息平台构建过程中存在的数据获取困难、研发成本较高等问题,
引入开源技术,对基于开源数据、开源开发平台与开源工具的城市地理信息平台构建技术进行
研究。所提出的城市地理信息平台由数据模块与可视化模块 2 部分组成。为构建数据模块,由
开源地理信息项目(OSM)获取了建筑与区划数据,并设计了建筑合并算法以提升数据质量。建
筑数据随之基于行政区划分级存储,通过由 ASP. NET 构建的数据接口提供给具体应用。可视
化模块则基于开源地理信息系统(GIS)项目 Cesium 实现,并设计了完善的用户界面。以北京市
为例,完成了原型系统的开发与测试,证实了该技术体系的可行性,通过开源技术降低平台研
发成本,推进城市地理信息平台的研究与应用。 相似文献
16.
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. 相似文献
17.
18.
范文跃 《信息安全与通信保密》2006,(8):66-68
在分析移动智能平台安全需求基础上,从逻辑原理、硬件组成、软件系统三个层面提出了移动智能平台的可信计算体系结构,之后提出了包含十种可信计算应用功能的全景图。 相似文献
19.
Service composition for generic service graphs 总被引:1,自引:0,他引:1
Service composition is a promising approach to multimedia service provisioning, due to its ability to dynamically produce new multimedia content, and to customize the content for individual client devices. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for multimedia services that can be modeled as directed acyclic graphs (DAGs). We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our simulation results show that the algorithm is effective at finding low-cost composition solutions, and can trade off computation overhead for better results. When compared with a hop-by-hop approach for service composition, our algorithm can find composition solutions that aress 10% smaller in cost, even when the hop-by-hop approach uses exhaustive searches. 相似文献
20.