全文获取类型
收费全文 | 7474篇 |
免费 | 363篇 |
国内免费 | 12篇 |
专业分类
电工技术 | 126篇 |
综合类 | 3篇 |
化学工业 | 1469篇 |
金属工艺 | 247篇 |
机械仪表 | 146篇 |
建筑科学 | 241篇 |
矿业工程 | 24篇 |
能源动力 | 200篇 |
轻工业 | 941篇 |
水利工程 | 35篇 |
石油天然气 | 17篇 |
无线电 | 357篇 |
一般工业技术 | 1310篇 |
冶金工业 | 1841篇 |
原子能技术 | 45篇 |
自动化技术 | 847篇 |
出版年
2023年 | 53篇 |
2022年 | 38篇 |
2021年 | 127篇 |
2020年 | 142篇 |
2019年 | 101篇 |
2018年 | 255篇 |
2017年 | 260篇 |
2016年 | 272篇 |
2015年 | 213篇 |
2014年 | 293篇 |
2013年 | 477篇 |
2012年 | 365篇 |
2011年 | 412篇 |
2010年 | 308篇 |
2009年 | 273篇 |
2008年 | 269篇 |
2007年 | 247篇 |
2006年 | 173篇 |
2005年 | 158篇 |
2004年 | 144篇 |
2003年 | 124篇 |
2002年 | 137篇 |
2001年 | 96篇 |
2000年 | 93篇 |
1999年 | 76篇 |
1998年 | 410篇 |
1997年 | 343篇 |
1996年 | 229篇 |
1995年 | 169篇 |
1994年 | 111篇 |
1993年 | 128篇 |
1992年 | 52篇 |
1991年 | 40篇 |
1990年 | 46篇 |
1989年 | 35篇 |
1988年 | 40篇 |
1987年 | 45篇 |
1986年 | 36篇 |
1985年 | 36篇 |
1984年 | 55篇 |
1983年 | 39篇 |
1982年 | 59篇 |
1981年 | 66篇 |
1980年 | 77篇 |
1979年 | 39篇 |
1978年 | 45篇 |
1977年 | 126篇 |
1976年 | 294篇 |
1975年 | 39篇 |
1973年 | 21篇 |
排序方式: 共有7849条查询结果,搜索用时 15 毫秒
71.
Tomasz Idziaszek Michał Skrzypczak Mikołaj Bojańczyk 《Theory of Computing Systems》2016,58(4):614-663
An infinite tree is called thin if it contains only countably many infinite branches. Thin trees can be seen as intermediate structures between infinite words and infinite trees. In this work we investigate properties of regular languages of thin trees. Our main tool is an algebra suitable for thin trees. Using this framework we characterize various classes of regular languages: commutative, open in the standard topology, and definable in weak MSO logic among all trees. We also show that in various meanings thin trees are not as rich as all infinite trees. In particular we observe a collapse of the parity index to the level (1, 3) and a collapse of the topological complexity to co-analytic sets. Moreover, a gap property is shown: a regular language of thin trees is either weak MSO-definable among all trees or co-analytic-complete. 相似文献
72.
73.
Paweł Jankowski Dominika Ogończyk Ladislav Derzsi Wojciech Lisowski Piotr Garstecki 《Microfluidics and nanofluidics》2013,14(5):767-774
Modification of the surfaces of polycarbonate (PC) with the use of a solution of tin (II) chloride renders them hydrophilic. The surface draping is stable against exposure to water and to alcohols. Exposure to alkanes reduces but does not diminish the effect. The method is compatible—in using the same solvent and temperature—with the hydrophobic modification of PC Jankowski et al. ( Lab Chip 11:748–752, 2011). The combination of these methods makes it possible to generate single and multiple monodisperse emulsions with the use of flow-focusing junctions in systems made in PC—material that is suitable for fabrication of multilayer, high throughput microfluidic devices. 相似文献
74.
Piotr Zieliński 《Distributed Computing》2008,20(6):435-450
The Atomic Broadcast algorithm described in this paper can deliver messages in two communication steps, even if multiple processes
broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in the order
of these timestamps. Both positive and negative statements are used: “m broadcast at time 51” vs. “no messages broadcast between times 31 and 51”. To prevent crashed processes from blocking the
system, the -elected leader broadcasts negative statements on behalf of the processes it suspects () to have crashed. A new cheap Generic Broadcast algorithm is used to ensure consistency between conflicting statements. It
requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps. The main algorithm satisfies several new
lower bounds, which are proved in this paper. 相似文献
75.
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. 相似文献
76.
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 . 相似文献
77.
78.
Patrice Le Boudec François Sanchez Pierre-Luc FranÇois Jean-François Bayon Guy Michel StÉphan 《电信纪事》1994,49(3-4):178-192
The dynamics of the erbium doped fiber laser is analysed both experimentally and theoretically. This laser operates spontaneously in self-pulsing, in sinusoidal or in CW regime. Experiments have allowed to determine the control parameters : the cavity losses, the pumping rate and the ion pairs concentration. An antiphase dynamics is observed when the laser operates simultaneously at 1.55 µn and 1.536 µm. The self-pulsing behavior is attributed to a fast energy transfer which occurs between two neighboring ions (pair induced quenching). A simple model considering the active medium as a mixture of isolated ions and ions pairs is developped and leads to a good qualitative agreement with the experimental results. 相似文献
79.
The noncatalytic beta-subunit is responsible for the latency of casein kinase 2 (CK2) activity toward calmodulin. Twenty-one mutants of the beta-subunit bearing either deletions or Ala substitutions for charged residues in the 5-6, 55-70, and 171-178 sequences have been assayed for their ability to substitute for wild-type beta-subunit as a suppressor of activity toward calmodulin. The only mutations that reduced the ability of the beta-subunit to suppress calmodulin phosphorylation activity, though being compatible with normal reconstitution of CK2 holoenzyme, were those affecting Asp55, Glu57 and the whole triplet Glu59-Asp-Glu61. The activity of CK2 holoenzyme, either native or reconstituted, toward calmodulin can be elicited by a variety of polybasic effectors, including polylysine, polyarginine, salmine, and histones H4, H3, and, to a lesser extent, H2a and H2b. Histone H1 and polyamines are conversely ineffective. The latent "calmodulin kinase" activity of CK2 can also be specifically unmasked by a peptide (alpha[66-86]) reproducing a basic insert of the catalytic subunit. This effect is reversed by equimolar addition of a peptide (beta[55-71]) including the 55-64 acidic stretch of the beta-subunit. Comparable polylysine stimulation was observed with the holoenzymes reconstituted with either beta wt or the beta mutants capable of assembling with the alpha-subunit, with the notable exception of those bearing Ala substitutions for acidic residues at positions 55, 57, and 59-61. These were nearly insensitive to 42 nM polylysine, which conversely promotes a more than 10-fold increase of calmodulin phosphorylation with wild-type beta.(ABSTRACT TRUNCATED AT 250 WORDS) 相似文献
80.
Supervisory control using variable lookahead policies 总被引:1,自引:1,他引:0
This paper deals with the efficient on-line calculation of supervisory controls for discrete event systems (DES's) in the framework of limited lookahead control policies (or LLPs) that we introduced in previous papers. In the LLP scheme, the control action after a given trace of events has been executed is calculated on-line on the basis of anN-step ahead projection of the behavior of the DES. To compute these controls, one must calculate after the execution of each event the supremal controllable sublanguage of a finite language with respect to another finite larger language. In our previous work, we showed how the required supremal controllable sublanguage calculation can be performed by using a backward dynamic programming algorithm over the nodes of the tree representation of these two languages. In this paper, we pursue the same approach for the calculation of LLP controls, but instead we adopt a forward calculation procedure over theN-level tree of interest. This forward procedure improves upon previous work by avoiding the explicit consideration of all the nodes of theN-level tree, while still permitting tree-to-tree recursiveness as enabled events are executed by the system. The forward search ends whenever a control decision can be made unambiguously or whenever the boundary of theN-level tree is reached, whichever comes first. This motivates the name Variable Lookahead Policy (or VLP) for this implementation of the LLP supervisory control scheme. This paper presents a general VLP algorithm and studies the properties of several special cases of it. The paper also discusses the implementation of the VLP algorithms and presents computational results regarding the application of these algorithms to a time-varying DES. 相似文献