全文获取类型
收费全文 | 5778篇 |
免费 | 305篇 |
国内免费 | 11篇 |
专业分类
电工技术 | 111篇 |
综合类 | 9篇 |
化学工业 | 1251篇 |
金属工艺 | 176篇 |
机械仪表 | 139篇 |
建筑科学 | 296篇 |
矿业工程 | 14篇 |
能源动力 | 112篇 |
轻工业 | 561篇 |
水利工程 | 30篇 |
石油天然气 | 10篇 |
无线电 | 452篇 |
一般工业技术 | 1129篇 |
冶金工业 | 934篇 |
原子能技术 | 33篇 |
自动化技术 | 837篇 |
出版年
2023年 | 38篇 |
2022年 | 28篇 |
2021年 | 98篇 |
2020年 | 85篇 |
2019年 | 72篇 |
2018年 | 135篇 |
2017年 | 162篇 |
2016年 | 156篇 |
2015年 | 157篇 |
2014年 | 206篇 |
2013年 | 324篇 |
2012年 | 279篇 |
2011年 | 347篇 |
2010年 | 260篇 |
2009年 | 247篇 |
2008年 | 269篇 |
2007年 | 232篇 |
2006年 | 205篇 |
2005年 | 187篇 |
2004年 | 150篇 |
2003年 | 142篇 |
2002年 | 135篇 |
2001年 | 108篇 |
2000年 | 114篇 |
1999年 | 97篇 |
1998年 | 283篇 |
1997年 | 188篇 |
1996年 | 136篇 |
1995年 | 112篇 |
1994年 | 84篇 |
1993年 | 92篇 |
1992年 | 58篇 |
1991年 | 52篇 |
1990年 | 46篇 |
1989年 | 46篇 |
1988年 | 44篇 |
1987年 | 46篇 |
1986年 | 51篇 |
1985年 | 42篇 |
1984年 | 45篇 |
1983年 | 35篇 |
1982年 | 33篇 |
1981年 | 38篇 |
1980年 | 34篇 |
1979年 | 31篇 |
1978年 | 24篇 |
1977年 | 34篇 |
1976年 | 70篇 |
1975年 | 34篇 |
1974年 | 28篇 |
排序方式: 共有6094条查询结果,搜索用时 187 毫秒
101.
102.
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. 相似文献
103.
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. 相似文献
104.
105.
106.
Joachim Meyer Yuval Bitan David Shinar 《International journal of human-computer interaction》2013,29(3):273-290
Two experiments assessed the effect of displaying a boundary on duration estimates and preference ratings for dynamic displays that were shown while users waited for the system's response. Displays were either symbolic (changing numbers) or graphic (increasing rectangles) and could contain a boundary that indicated when the interval was expected to be over. Duration estimates were similar for symbolic and graphic displays and for displays with and without a boundary. However, when the displays were encountered successively, participants assessed the graphic displays as having shorter durations than the symbolic displays. Faster rates of change in both types of displays led to increased duration estimates. Although displaying a boundary did not affect duration estimates, participants preferred displays in which a boundary was shown and preferred the graphic displays over the symbolic displays. Hence, bounded graphic displays are recommended as “wait” displays for computerized applications. 相似文献
107.
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain operations of different jobs are not allowed to be processed at the same time and after processing an operation of a certain job a machine might be unavailable for a given time for operations of other jobs. As main results we will show that for three jobs and four machines the special case where only one machine is used by more than one job is already $\mathcal NP $ -hard. This also implies that the single machine scheduling problem that asks for a makespan minimal schedule of three chains of operations with delays between the operations of a chain is $\mathcal NP $ -hard. On the positive side, we present a polynomial algorithm for the two job case and a pseudo-polynomial algorithm together with an FPTAS for an arbitrary but constant number of jobs. Hence for a constant number of jobs we fully settle the complexity status of the problem. 相似文献
108.
Nonparametric Bayesian Image Segmentation 总被引:1,自引:0,他引:1
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous
groups. We propose a nonparametric Bayesian model for histogram clustering which automatically determines the number of segments
when spatial smoothness constraints on the class assignments are enforced by a Markov Random Field. A Dirichlet process prior
controls the level of resolution which corresponds to the number of clusters in data with a unique cluster structure. The resulting posterior is efficiently
sampled by a variant of a conjugate-case sampling algorithm for Dirichlet process mixture models. Experimental results are
provided for real-world gray value images, synthetic aperture radar images and magnetic resonance imaging data. 相似文献
109.
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. 相似文献
110.
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 . 相似文献