全文获取类型
收费全文 | 30955篇 |
免费 | 2107篇 |
国内免费 | 1269篇 |
专业分类
电工技术 | 2549篇 |
技术理论 | 14篇 |
综合类 | 3058篇 |
化学工业 | 398篇 |
金属工艺 | 475篇 |
机械仪表 | 1801篇 |
建筑科学 | 14445篇 |
矿业工程 | 930篇 |
能源动力 | 565篇 |
轻工业 | 159篇 |
水利工程 | 1372篇 |
石油天然气 | 165篇 |
武器工业 | 226篇 |
无线电 | 1196篇 |
一般工业技术 | 1315篇 |
冶金工业 | 385篇 |
原子能技术 | 60篇 |
自动化技术 | 5218篇 |
出版年
2024年 | 81篇 |
2023年 | 355篇 |
2022年 | 644篇 |
2021年 | 781篇 |
2020年 | 922篇 |
2019年 | 665篇 |
2018年 | 575篇 |
2017年 | 865篇 |
2016年 | 870篇 |
2015年 | 1049篇 |
2014年 | 2690篇 |
2013年 | 2440篇 |
2012年 | 1949篇 |
2011年 | 2179篇 |
2010年 | 1882篇 |
2009年 | 2015篇 |
2008年 | 1911篇 |
2007年 | 2162篇 |
2006年 | 1946篇 |
2005年 | 1627篇 |
2004年 | 1263篇 |
2003年 | 1045篇 |
2002年 | 915篇 |
2001年 | 754篇 |
2000年 | 602篇 |
1999年 | 438篇 |
1998年 | 323篇 |
1997年 | 267篇 |
1996年 | 183篇 |
1995年 | 179篇 |
1994年 | 160篇 |
1993年 | 116篇 |
1992年 | 90篇 |
1991年 | 81篇 |
1990年 | 58篇 |
1989年 | 43篇 |
1988年 | 35篇 |
1987年 | 31篇 |
1986年 | 9篇 |
1985年 | 39篇 |
1984年 | 25篇 |
1983年 | 26篇 |
1982年 | 15篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 8篇 |
1963年 | 1篇 |
1962年 | 1篇 |
1958年 | 1篇 |
1955年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
ComputerAidedProcesPlanningExpertSystemforDieForgingLIXiaolei(李晓蕾)WANGZhen(王真)LUYan(吕炎)WANGHao(王昊)(Dept.ofMaterialEngineering... 相似文献
992.
993.
针对路径规划所需数据的特点,采用“混合数据结构”组织地图道路网数据,通过路段提取、节点分离、目标点区域确定,快速生成了起始点至目标点的路径规划道路网拓扑模型。 相似文献
994.
流域水环境集成规划刍议 总被引:16,自引:0,他引:16
本文从从环境规划方法学的历史演变入手,系统阐述了流域水环境集成规划产生的背景,基本概念,目标体系与路线,初步建立了流域水环境集成规划的理论框架,为我国流域水环境规划与管理开拓了新的思路。 相似文献
995.
Multirobot motion coordination in space and time 总被引:5,自引:0,他引:5
Carlo Ferrari Enrico Pagello Jun Ota Tamio Arai 《Robotics and Autonomous Systems》1998,25(3-4):219-229
This paper describes a solution to the multirobot motion planning problem based on a decoupled analysis in the space domain and in the time domain. It investigates the practical use of the notion of motion plan quality and of the motion plan robustness measures for computing safe motions. The use of anytime algorithms allows one to evaluate the opportunity of looking for alternative solution paths by generating small variations of robot motions affecting both its geometrical path and its scheduled velocity. By using the concept of plan robustness, several alternative paths are generated and evaluated through various performance indices and impact factors, using heuristic rules. These indices allow one to know how much a variation affects a given plan. Finally, some recent experiments are outlined. 相似文献
996.
Computer Aided Process Planning (CAPP) constitutes one of the most essential elements in Computer Integrated Manufacturing (CIM). Although many CAPP systems have been reported in literature during the last two decades, few of them are compatible enough to integrate easily with other systems in the CIM environment. One major reason is the lack of an effective method to represent the information required by CAPP, and to unify such information with the information of other systems in the CIM environment. Indeed, this problem has received relatively inadequate attention in the recent research of CAPP systems. In this paper, an information model for CAPP is developed by using the object-oriented modeling and the Product Data Exchange Step/STandard of Exchange Product data (PDES/STEP) techniques. The model consists of the part information model, the process plan information model, and the production resource information model. The EXPRESS language or the EXPRESS-G diagram is used to represent these models. Indeed, the proposed information model will greatly improve the CAPP system's capability of effective integration with other systems in the CIM environment, and, ultimately, to facilitate the implementation of the whole CIM strategy in manufacturing enterprises. 相似文献
997.
On-line Planning for Collision Avoidance on the Nominal Path 总被引:4,自引:0,他引:4
In this paper a solution to the obstacle avoidance problem for a mobile robot moving in the two-dimensional Cartesian plane is presented. The robot is modelled as a linear time-invariant dynamic system of finite size enclosed by a circle and the obstacles are modelled as circles travelling along rectilinear trajectories. This work deals with the avoidance problem when the obstacles move in known trajectories. The robot starts its journey on a nominal straight line path with a nominal velocity. When an obstacle is detected to be on a collision course with the robot, the robot must devise a plan to avoid the obstacle whilst minimising a cost index defined as the total sum squared of the magnitudes of the deviations of its velocity from the nominal velocity. The planning strategy adopted here is adjustment of the robot's velocity on the nominal path based on the time of collision between the robot and a moving obstacle, and determination of a desired final state such that its Euclidean distance from the nominal final state is minimal. Obstacle avoidance by deviation from the nominal path in deterministic and random environments is based on the work presented here and is investigated in another paper. 相似文献
998.
Knowledge-based computing, in general, suffers from an inherent open-endedness that precludes its application in time-bounded domains where an answer must be computed within a stipulated time limit. We examine a two-way improvement of the shortcomings: a knowledge representation scheme that provides easy access to relevant knowledge and thereby reduces search time, and a reasoning scheme that is algorithmic in nature and thus makes computational requirements meaningfully estimable.In this work, we offer a cache-based architecture that is capable of both storing knowledge in different formats (e.g. rules, cases), and invoking an appropriate reasoning scheme to fit the available computing time. The cache helps in retrieving the most relevant pieces of knowledge (not only exact matches) required for solving a given problem. This cache relies on a reasoning tactic, knowledge interpolation, that can generate a solution from two near-matches in an algorithmic way, to generate time-bounded solutions. We illustrate the design of such a cache for solving resource allocation problems in the domain of shortwave radio transmission and evaluate its performance in observing imposed temporal bounds. 相似文献
999.
An Autonomous Spacecraft Agent Prototype 总被引:12,自引:0,他引:12
Barney Pell Douglas E. Bernard Steve A. Chien Erann Gat Nicola Muscettola P. Pandurang Nayak Michael D. Wagner Brian C. Williams 《Autonomous Robots》1998,5(1):29-52
This paper describes the New Millennium Remote Agent (NMRA) architecture for autonomous spacecraft control systems. The architecture supports challenging requirements of the autonomous spacecraft domain not usually addressed in mobile robot architectures, including highly reliable autonomous operations over extended time periods in the presence of tight resource constraints, hard deadlines, limited observability, and concurrent activity. A hybrid architecture, NMRA integrates traditional real-time monitoring and control with heterogeneous components for constraint-based planning and scheduling, robust multi-threaded execution, and model-based diagnosis and reconfiguration. Novel features of this integrated architecture include support for robust closed-loop generation and execution of concurrent temporal plans and a hybrid procedural/deductive executive.We implemented a prototype autonomous spacecraft agent within the architecture and successfully demonstrated the prototype in the context of a challenging autonomous mission scenario on a simulated spacecraft. As a result of this success, the integrated architecture has been selected to fly as an autonomy experiment on Deep Space One (DS-1), the first flight of NASA';s New Millennium Program (NMP), which will launch in 1998. It will be the first AI system to autonomously control an actual spacecraft. 相似文献
1000.