全文获取类型
收费全文 | 516篇 |
免费 | 69篇 |
国内免费 | 98篇 |
专业分类
电工技术 | 14篇 |
综合类 | 64篇 |
化学工业 | 7篇 |
金属工艺 | 86篇 |
机械仪表 | 24篇 |
建筑科学 | 16篇 |
矿业工程 | 2篇 |
能源动力 | 2篇 |
轻工业 | 2篇 |
水利工程 | 3篇 |
石油天然气 | 2篇 |
武器工业 | 9篇 |
无线电 | 30篇 |
一般工业技术 | 40篇 |
冶金工业 | 12篇 |
原子能技术 | 2篇 |
自动化技术 | 368篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 15篇 |
2020年 | 10篇 |
2019年 | 10篇 |
2018年 | 13篇 |
2017年 | 18篇 |
2016年 | 21篇 |
2015年 | 19篇 |
2014年 | 24篇 |
2013年 | 32篇 |
2012年 | 32篇 |
2011年 | 50篇 |
2010年 | 35篇 |
2009年 | 45篇 |
2008年 | 64篇 |
2007年 | 37篇 |
2006年 | 49篇 |
2005年 | 34篇 |
2004年 | 28篇 |
2003年 | 17篇 |
2002年 | 18篇 |
2001年 | 16篇 |
2000年 | 13篇 |
1999年 | 12篇 |
1998年 | 6篇 |
1997年 | 9篇 |
1996年 | 6篇 |
1995年 | 4篇 |
1994年 | 8篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1985年 | 1篇 |
1984年 | 4篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 3篇 |
1975年 | 2篇 |
排序方式: 共有683条查询结果,搜索用时 31 毫秒
641.
Paulo A. S. Veloso 《International journal of parallel programming》1980,9(5):371-382
Intrinsic characterizations by means of analogues of regular expressions are given for six families of regular languages related to the prefix codes, namely their reversals and their closure under union, the right and left ideals, and their complements. First, a characterization for the regular prefix codes is obtained, which is then used to characterize the other families. Characterizations by finite automata are also presented.This research has been sponsored in part by FINEP, CNPq and Canadian NRC. 相似文献
642.
We prove that any recognizable set of infinite words is the infinite behaviour of some finite codeterministic automaton. 相似文献
643.
An enhanced generative formalism is proposed based on the combination of two features: contextual derivation (as in Marcus contextual grammars) and sorted dependency structures (as in dependency grammars). The model is related to a variant of restarting automaton with rewriting and deletion. Preliminary results on the generative power as well as closure and decidability properties of the new model are presented. 相似文献
644.
Most of the timed automata reachability analysis algorithms in the literature explore the state spaces by enumeration of symbolic states, which use time constraints to represent a set of concrete states. A time constraint is a conjunction of atomic formulas which bound the differences of clock values. In this paper, it is shown that some atomic formulas of symbolic states generated by the algorithms can be removed to improve the model checking time- and space-efficiency. Such atomic formulas are called as irrelevant atomic formulas. A method is also presented to detect irrelevant formulas based on the test-reset information about clock variables. An optimized model-checking algorithm is designed based on these techniques. The case studies show that the techniques presented in this paper significantly improve the space- and time-efficiency of reachability analysis. 相似文献
645.
Ping Li 《Information Sciences》2006,176(21):3232-3255
In this study, we introduce the concepts of L-valued regular substitution (LA-substitution), deterministic L-valued regular substitution (DLA-substitution), L-valued fuzzy homomorphism and its inverse images, homomorphism and its inverse images for a lattice-ordered monoid L. We also study the properties of LA-languages and DLA-languages under the above-mentioned algebraic operations. The algebraic characterization of the L-valued regular language is given. 相似文献
646.
Stphane Demri 《Theoretical computer science》2006,360(1-3):96-123
Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTLmod, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although the underlying constraint language is a fragment of Presburger arithmetic shown to admit a PSPACE-complete satisfiability problem, we establish that PLTLmod model-checking and satisfiability problems remain in PSPACE as plain LTL (full Presburger LTL is known to be highly undecidable). This is particularly interesting for dealing with periodicity constraints since the language of PLTLmod has a language more concise than existing languages and the temporalization of our first-order language of periodicity constraints has the same worst case complexity as the underlying constraint language. Finally, we show examples of introduction the quantification in the logical language that provide to PLTLmod, EXPSPACE-complete problems. As another application, we establish that the equivalence problem for extended single-string automata, known to express the equality of time granularities, is PSPACE-complete by designing a reduction from QBF and by using our results for PLTLmod. 相似文献
647.
基于电话网络的家用电器远程控制系统的实现 总被引:4,自引:3,他引:4
本文给出了基于电话网络的家用电器远程控制系统的总体框图。分析了振铃检测、DTMF解码和实时时钟DS12887的原理。对ISD2590的信息检索模式提出了M1和M6相结合的使用方法,并设计出了硬件电路。经过系统运行,验证了该系统的有效性和实用性。 相似文献
648.
本文提出了一种新的用于构造入侵检测模式匹配自动机的方法。该方法从构造判定单个模式的NFA自动机入手,通过集成单个的NFA而得到全集的NFA,并将全集NFA转换为与之等价的DFA并化简,从而可得到全集的确定型模式匹配有限自动机。由于该方法可以完全自动完成,从而可以方便地为入侵检测系统构造模式匹配自动机。 相似文献
649.
650.