全文获取类型
收费全文 | 1648篇 |
免费 | 200篇 |
国内免费 | 201篇 |
专业分类
电工技术 | 60篇 |
综合类 | 161篇 |
化学工业 | 30篇 |
金属工艺 | 47篇 |
机械仪表 | 53篇 |
建筑科学 | 39篇 |
矿业工程 | 12篇 |
能源动力 | 9篇 |
轻工业 | 4篇 |
水利工程 | 7篇 |
石油天然气 | 8篇 |
武器工业 | 10篇 |
无线电 | 186篇 |
一般工业技术 | 74篇 |
冶金工业 | 14篇 |
原子能技术 | 2篇 |
自动化技术 | 1333篇 |
出版年
2024年 | 5篇 |
2023年 | 16篇 |
2022年 | 19篇 |
2021年 | 28篇 |
2020年 | 44篇 |
2019年 | 41篇 |
2018年 | 36篇 |
2017年 | 47篇 |
2016年 | 54篇 |
2015年 | 67篇 |
2014年 | 84篇 |
2013年 | 111篇 |
2012年 | 143篇 |
2011年 | 141篇 |
2010年 | 108篇 |
2009年 | 131篇 |
2008年 | 141篇 |
2007年 | 131篇 |
2006年 | 134篇 |
2005年 | 101篇 |
2004年 | 67篇 |
2003年 | 65篇 |
2002年 | 52篇 |
2001年 | 36篇 |
2000年 | 35篇 |
1999年 | 16篇 |
1998年 | 19篇 |
1997年 | 22篇 |
1996年 | 17篇 |
1995年 | 21篇 |
1994年 | 13篇 |
1993年 | 15篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 4篇 |
1989年 | 4篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 10篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1974年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有2049条查询结果,搜索用时 8 毫秒
61.
The problems ofstate observation and diagnosis are solved for discrete–eventsystems, which are described by stochastic automata. As manysystems are not observable in the sense that it is possible toreconstruct the state unambiguously, the observation problemis set up as the problem of determining the smallest possibleset of states that are compatible with the measured input andoutput sequences. The diagnostic problem is shown to be, in principle,an observation problem. Conditions for the observability anddiagnosability of stochastic automata are presented. The resultsare illustrated by examples. 相似文献
62.
A Timed Verification of the IEEE 1394 Leader Election Protocol 总被引:1,自引:0,他引:1
Judi Romijn 《Formal Methods in System Design》2001,19(2):165-194
The IEEE 1394 architecture standard defines a high performance serial multimedia bus that allows several components in a network to communicate with each other at high speed. In the physical layer of the architecture, a leader election protocol is used to find a spanning tree with a unique root in the network topology. If there is a cycle in the network, the protocol treats this as an error situation. This paper presents a formal model of the leader election protocol in the language IOA and a correctness proof. Hereby, it is shown that under certain timing restrictions the protocol behaves correctly. The timing parameters in the IEEE 1394 standard documentation obey the restrictions found in this proof. 相似文献
63.
Marsha Chechik Arie Gurfinkel Benet Devereux Albert Lai Steve Easterbrook 《Formal Methods in System Design》2006,29(3):295-344
Multi-valued logics provide an interesting alternative to classical boolean logic for modeling and reasoning about systems. Such logics can be used for reasoning about partially-specified systems, effectively encode vacuity detection and query-checking problems, help in detecting inconsistencies, and many others.In our earlier work, we identified a useful family of multi-valued logics: those specified over finite distributive lattices where negation preserves involution, i.e., for every element a of the logic. Such structures are called quasi-boolean algebras, and model-checking over these not only extends the domain of applicability of automated reasoning to new problems, but can also speed up solutions to some classical verification problems.Symbolic model-checking over quasi-boolean algebras can be cast in terms of operations over multi-valued sets: sets whose membership functions are multi-valued. In this paper, we propose and empirically evaluate several choices for implementing multi-valued sets with decision diagrams. In particular, we describe two major approaches: (1) representing the multi-valued membership function canonically, using MDDs or ADDs; (2) representing multi-valued sets as a collection of classical sets, using a vector of either MBTDDs or BDDs. The naive implementation of (2) includes having a classical set for each value of the algebra. We exploit a result of lattice theory to reduce the number of such sets that need to be represented.The major contribution of this paper is the evaluation of the different implementations of multi-valued sets, done via a series of experiments and using several case studies.
相似文献
Steve EasterbrookEmail: |
64.
65.
Robert K. L. Gay 《The Visual computer》1991,7(4):173-186
The modelling of natural phenomena through the use of computer-generated graphics has attracted much interest recently. It is believed that such methods will lead to new breakthroughs in understanding nature. One of the most popular methods used is the cell automata method, where cells are made to propagate and form cellular patterns according to certain predefined rules. Although much of the work in this area is for recreational purposes, as in the Game of Life, there can be more serious aspects to it. One of these is in the use of such methods to predict and simulate the growth behaviour of cell clusters in real-life situations. In this study, an attempt is made to formalise certain rules for modelling the growth characteristics of unicell populations. The methodology proposed models three fundamental factors: first, the generic propagational characteristics of a cell; second, the effect of adverse factors to growth; and, third, the effect of spatial constraints. The first two factors, relating to the population of a cell colony, can be modelled mathematically; the third factor determines the visual appearance of the cell colony. Patterns resulting from some computational simulations are presented and discussed. 相似文献
66.
《国际计算机数学杂志》2012,89(1-4):3-30
Array automata acting on scenes (two dimensional tapes) are defined. The set of scenes accepted by array automata are proved to be equivalent to the set of arrays generated by array grammars. Certain operators like substitution, homomorphic replication and insertion are extended to sets of arrays. These operators yield interesting classes of pictures. 相似文献
67.
《国际通用系统杂志》2012,41(6):539-554
We survey results on decidability questions concerning cellular automata. Properties discussed include reversibility and surjectivity and their variants, time-symmetry and conservation laws, nilpotency and other properties of the limit set and the trace, properties chaoticity related such as sensitivity to initial conditions and mixing of the space, and dynamics from finite initial configurations. We also discuss briefly the tiling problem and its variants, and consider the influence of the dimension of the space on the decidability status of the questions. 相似文献
68.
《国际计算机数学杂志》2012,89(12):1584-1595
Rule 110 is a complex cellular automaton (CA) in Wolfram's system of identification, capable of supporting universal computation. It has been suggested that a universal CA should be on the ‘edge of chaos’, which means that the dynamical behaviour of such a system is neither simple nor chaotic. There is no doubt that the dynamical property of Rule 110 is extremely complex and still not well understood. This paper proves the existence of subsystems on which this rule is chaotic in the sense of Devaney. 相似文献
69.
在研究传统的发布/订阅消息中间件系统的基础之上,结合Gossip协议的特点来研究发布/订阅消息中间件,最后运用形式化方法,通过PRISM仿真工具,对仿真的模型进行形式化分析.实验结果表明,发布/订阅消息中间件系统的实时性受消息产生速度的影响,在各个订阅者订阅相同消息和不同消息两种情况之下网络特性展现不同的变化,但最终都是随着消息产生速度的增加而减小.可靠性随着消息产生速度的增加而减小,并且订阅者的接收缓存越大可靠性越高,但增幅率会越来越小.该实验模型和实验方法对于发布/订阅消息中间件系统的研究,以及在现实环境中配置系统的相关参数有一定的帮助. 相似文献
70.
自动机理论作为计算机科学的基础理论,其研究直接地推动计算机科学技术的发展.本文研究了有限布尔环上的自动机,首次定出了有限布尔环上的一类下向树和一类有向圈,并证明了布尔环上的一类可逆内动机的图型与其仿射内动机的图型相同. 相似文献