全文获取类型
收费全文 | 4911篇 |
免费 | 200篇 |
国内免费 | 303篇 |
专业分类
电工技术 | 132篇 |
综合类 | 55篇 |
化学工业 | 777篇 |
金属工艺 | 494篇 |
机械仪表 | 165篇 |
建筑科学 | 180篇 |
矿业工程 | 31篇 |
能源动力 | 82篇 |
轻工业 | 494篇 |
水利工程 | 44篇 |
石油天然气 | 92篇 |
武器工业 | 4篇 |
无线电 | 428篇 |
一般工业技术 | 783篇 |
冶金工业 | 799篇 |
原子能技术 | 51篇 |
自动化技术 | 803篇 |
出版年
2023年 | 29篇 |
2022年 | 20篇 |
2021年 | 53篇 |
2020年 | 61篇 |
2019年 | 28篇 |
2018年 | 87篇 |
2017年 | 98篇 |
2016年 | 96篇 |
2015年 | 94篇 |
2014年 | 126篇 |
2013年 | 226篇 |
2012年 | 225篇 |
2011年 | 455篇 |
2010年 | 291篇 |
2009年 | 211篇 |
2008年 | 214篇 |
2007年 | 167篇 |
2006年 | 152篇 |
2005年 | 167篇 |
2004年 | 233篇 |
2003年 | 206篇 |
2002年 | 181篇 |
2001年 | 132篇 |
2000年 | 137篇 |
1999年 | 136篇 |
1998年 | 274篇 |
1997年 | 192篇 |
1996年 | 109篇 |
1995年 | 86篇 |
1994年 | 74篇 |
1993年 | 123篇 |
1992年 | 71篇 |
1991年 | 71篇 |
1990年 | 53篇 |
1989年 | 35篇 |
1988年 | 28篇 |
1987年 | 37篇 |
1986年 | 32篇 |
1985年 | 22篇 |
1984年 | 26篇 |
1983年 | 21篇 |
1982年 | 22篇 |
1981年 | 22篇 |
1980年 | 23篇 |
1979年 | 14篇 |
1977年 | 21篇 |
1976年 | 60篇 |
1975年 | 26篇 |
1974年 | 16篇 |
1970年 | 12篇 |
排序方式: 共有5414条查询结果,搜索用时 15 毫秒
101.
102.
103.
Mickaël Duval Jean-Charles Passieux Michel Salaün Stéphane Guinard 《Archives of Computational Methods in Engineering》2016,23(1):17-38
This paper provides a detailed review of the global/local non-intrusive coupling algorithm. Such method allows to alter a global finite element model, without actually modifying its corresponding numerical operator. We also look into improvements of the initial algorithm (Quasi-Newton and dynamic relaxation), and provide comparisons based on several relevant test cases. Innovative examples and advanced applications of the non-intrusive coupling algorithm are provided, granting a handy framework for both researchers and engineers willing to make use of such process. Finally, a novel nonlinear domain decomposition method is derived from the global/local non-intrusive coupling strategy, without the need to use a parallel code or software. Such method being intended to large scale analysis, we show its scalability. Jointly, an efficient high level Message Passing Interface coupling framework is also proposed, granting an universal and flexible way for easy software coupling. A sample code is also given. 相似文献
104.
Abdoul Bitar Stéphane Dauzère-Pérès Claude Yugma Renaud Roussel 《Journal of Scheduling》2016,19(4):367-376
In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time. 相似文献
105.
为了提高军事配送系统的经济性,针对物资配送中后勤设施失效时进行支援保障和越级保障的情况,将军事物流配送中心的属性分为“首选”与“备选”两种,并把设施失效时的应急配送成本作为决策目标的一部分,建立了最小化设施固定成本、正常配送成本、应急配送成本之和的军事物流配送中心选址模型,采用贪婪取走的启发式算法进行了模型求解,比较了考虑设施失效情况的选址方案与未考虑设施失效情况的选址方案之间的差别。仿真算例结果表明,虽然由模型所得选址方案的设施固定成本与正常配送成本之和高于未考虑设施失效情况的选址方案,但平均期望成本增加值低于后者。 相似文献
106.
Behaviour based on decision matrices for a coordination between agents in a urban traffic simulation
René Mandiau Alexis Champion Jean-Michel Auberlet Stéphane Espié Christophe Kolski 《Applied Intelligence》2008,28(2):121-138
This paper describes a multi-agent coordination mechanism applied to intersection simulation situations. In a goal of urban
traffic simulation, we must consider the dynamic interactions between autonomous vehicles. The field of multi-agent systems
provides us some studies for such systems, in particular on the coordination mechanisms. Conflicts between vehicles (i.e.
agents) are very frequent in such applications, and they may cause deadlocks, particularly at intersections such as crossroads.
Our approach is based on the solving of two player games/decision matrices which characterize three basic situations. An aggregation
method generalizes to n-player games for complex crossroads. The objective of this approach consists in searching basic two-player
matrices for solving n-agent problems. To explain the principle, we describe our approach for a particular case of crossroad
with three agents. Finally, the obtained results have been examined via a tool of road traffic simulation, ARCHISIM. We assume
also that the global traffic replicates the behavior of agents in different situations. 相似文献
107.
This paper addresses the problem of fault detection and isolation for a particular class of discrete event dynamical systems
called hierarchical finite state machines (HFSMs). A new version of the property of diagnosability for discrete event systems
tailored to HFSMs is introduced. This notion, called L1-diagnosability, captures the possibility of detecting an unobservable fault event using only high level observations of the
behavior of an HFSM. Algorithms for testing L1-diagnosability are presented. In addition, new methodologies are presented for studying the diagnosability properties of
HFSMs that are not L1-diagnosable. These methodologies avoid the complete expansion of an HFSM into its corresponding flat automaton by focusing
the expansion on problematic indeterminate cycles only in the associated extended diagnoser.
Andrea Paoli received the master degree in Computer Science Engineering and the Ph.D. in Automatic Control and Operational Research from the University of Bologna in 2000 and 2003 respectively. He currently holds a Post Doc position at the Department of Electronics, Computer Science and Systems (DEIS) at the University of Bologna, Italy. He is a member of the Center for Research on Complex Automated Systems (CASY) Giuseppe Evangelisti. From August to January 2002, and in March 2005 he held visiting positions at the Department of Electrical Engineering and Computer Science at The University of Michigan, Ann Arbor. In July 2005 he won the prize IFAC Outstanding AUTOMATICA application paper award for years 2002-2005 for the article by Claudio Bonivento, Alberto Isidori, Lorenzo Marconi, Andrea Paoli titled Implicit fault-tolerant control: application to induction motors appeared on AUTOMATICA issue 30(4). Since 2006 he is a member of the IFAC Technical Committee on Fault Detection, Supervision and Safety of Technical Processes (IFAC SAFEPROCESS TC). His current research interests focus on Fault Tolerant Control and Fault Diagnosis in distributed systems and in discrete event systems and on industrial automation software architectures following an agent based approach. His theoretical background includes also nonlinear control and output regulation using geometric approach. Stéphane Lafortune received the B. Eng degree from Ecole Polytechnique de Montréal in 1980, the M. Eng. degree from McGill University in 1982, and the Ph.D. degree from the University of California at Berkeley in 1986, all in electrical engineering. Since September 1986, he has been with the University of Michigan, Ann Arbor, where he is a Professor of Electrical Engineering and Computer Science. Dr. Lafortune is a Fellow of the IEEE (1999). He received the Presidential Young Investigator Award from the National Science Foundation in 1990 and the George S. Axelby Outstanding Paper Award from the Control Systems Society of the IEEE in 1994 (for a paper co-authored with S. L. Chung and F. Lin) and in 2001 (for a paper co-authored with G. Barrett). At the University of Michigan, he received the EECS Department Research Excellence Award in 1994–1995, the EECS Department Teaching Excellence Award in 1997–1998, and the EECS Outstanding Achievement Award in 2003–2004. Dr. Lafortune is a member of the editorial boards of the Journal of Discrete Event Dynamic Systems: Theory and Applications and of the International Journal of Control. His research interests are in discrete event systems modeling, diagnosis, control, and optimization. He is co-developer of the software packages DESUMA and UMDES. He co-authored, with C. Cassandras, the textbook Introduction to Discrete Event Systems—Second Edition (Springer, 2007). Recent publications and software tools are available at the Web site . 相似文献
Stéphane LafortuneEmail: |
Andrea Paoli received the master degree in Computer Science Engineering and the Ph.D. in Automatic Control and Operational Research from the University of Bologna in 2000 and 2003 respectively. He currently holds a Post Doc position at the Department of Electronics, Computer Science and Systems (DEIS) at the University of Bologna, Italy. He is a member of the Center for Research on Complex Automated Systems (CASY) Giuseppe Evangelisti. From August to January 2002, and in March 2005 he held visiting positions at the Department of Electrical Engineering and Computer Science at The University of Michigan, Ann Arbor. In July 2005 he won the prize IFAC Outstanding AUTOMATICA application paper award for years 2002-2005 for the article by Claudio Bonivento, Alberto Isidori, Lorenzo Marconi, Andrea Paoli titled Implicit fault-tolerant control: application to induction motors appeared on AUTOMATICA issue 30(4). Since 2006 he is a member of the IFAC Technical Committee on Fault Detection, Supervision and Safety of Technical Processes (IFAC SAFEPROCESS TC). His current research interests focus on Fault Tolerant Control and Fault Diagnosis in distributed systems and in discrete event systems and on industrial automation software architectures following an agent based approach. His theoretical background includes also nonlinear control and output regulation using geometric approach. Stéphane Lafortune received the B. Eng degree from Ecole Polytechnique de Montréal in 1980, the M. Eng. degree from McGill University in 1982, and the Ph.D. degree from the University of California at Berkeley in 1986, all in electrical engineering. Since September 1986, he has been with the University of Michigan, Ann Arbor, where he is a Professor of Electrical Engineering and Computer Science. Dr. Lafortune is a Fellow of the IEEE (1999). He received the Presidential Young Investigator Award from the National Science Foundation in 1990 and the George S. Axelby Outstanding Paper Award from the Control Systems Society of the IEEE in 1994 (for a paper co-authored with S. L. Chung and F. Lin) and in 2001 (for a paper co-authored with G. Barrett). At the University of Michigan, he received the EECS Department Research Excellence Award in 1994–1995, the EECS Department Teaching Excellence Award in 1997–1998, and the EECS Outstanding Achievement Award in 2003–2004. Dr. Lafortune is a member of the editorial boards of the Journal of Discrete Event Dynamic Systems: Theory and Applications and of the International Journal of Control. His research interests are in discrete event systems modeling, diagnosis, control, and optimization. He is co-developer of the software packages DESUMA and UMDES. He co-authored, with C. Cassandras, the textbook Introduction to Discrete Event Systems—Second Edition (Springer, 2007). Recent publications and software tools are available at the Web site . 相似文献
108.
109.
陈烨 《计算机工程与应用》2009,45(24):63-66
讨论了一种可针对程序中的不同函数(routine)采用不同的循环优化序列的方法,该方法基于polyhedron模型,使用简化cache失效率方程分别对每一个函数作优化序列评估,以迭代编译方式为每个函数寻找一个独特的循环优化序列。该方法降低了变换实施的复杂度,降低了对编译器具体实现的依赖;考虑程序中不同函数的差异以获得更好的优化效果。对SPEC2006的实验数据表明,经过定制优化之后,较之Open64-O3,加速比为1.05~1.13。 相似文献
110.
组通信技术是未来互联网应用的关键支撑技术.目前,应用层组播是组通信技术研究中的热点,而代理型应用层组播体系结构已成为组播体系结构研究的重要方向之一.首先概述和比较了IP组播、主机型应用层组播和代理型应用层组播3种组播体系结构,接着重点研究和分析了代理型应用层组播体系结构的研究现状.以此为基础,进一步总结了代理型应用层组播体系结构设计中需要考虑的基本问题,并针对现有体系结构的不足,探讨了设计新的代理型应用层组播体系结构中值得关注的问题.最后对未来工作进行了展望. 相似文献