全文获取类型
收费全文 | 2029篇 |
免费 | 270篇 |
国内免费 | 136篇 |
专业分类
电工技术 | 83篇 |
综合类 | 193篇 |
化学工业 | 42篇 |
金属工艺 | 59篇 |
机械仪表 | 75篇 |
建筑科学 | 40篇 |
矿业工程 | 15篇 |
能源动力 | 12篇 |
轻工业 | 50篇 |
水利工程 | 9篇 |
石油天然气 | 8篇 |
武器工业 | 12篇 |
无线电 | 194篇 |
一般工业技术 | 93篇 |
冶金工业 | 20篇 |
原子能技术 | 2篇 |
自动化技术 | 1528篇 |
出版年
2025年 | 7篇 |
2024年 | 19篇 |
2023年 | 30篇 |
2022年 | 27篇 |
2021年 | 35篇 |
2020年 | 54篇 |
2019年 | 52篇 |
2018年 | 46篇 |
2017年 | 51篇 |
2016年 | 62篇 |
2015年 | 76篇 |
2014年 | 96篇 |
2013年 | 134篇 |
2012年 | 152篇 |
2011年 | 160篇 |
2010年 | 131篇 |
2009年 | 156篇 |
2008年 | 163篇 |
2007年 | 145篇 |
2006年 | 165篇 |
2005年 | 111篇 |
2004年 | 87篇 |
2003年 | 79篇 |
2002年 | 64篇 |
2001年 | 50篇 |
2000年 | 40篇 |
1999年 | 22篇 |
1998年 | 25篇 |
1997年 | 26篇 |
1996年 | 20篇 |
1995年 | 27篇 |
1994年 | 15篇 |
1993年 | 18篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 10篇 |
1983年 | 2篇 |
1982年 | 8篇 |
1981年 | 6篇 |
1980年 | 6篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1974年 | 4篇 |
1973年 | 2篇 |
排序方式: 共有2435条查询结果,搜索用时 0 毫秒
1.
为了研究股票价格在宏观上的变化趋势以及产生这些变化的主要因素.提出了一种新的基于元胞自动机的模型分析股票价格宏观变化,构建了新的股票价格变化规则以及新的股票交易量的变化模型,假设了两大类影响股票价格宏观变化趋势的肉素,同时也细化了股票交易量的函数.模拟了当影响因素都利好,影响因素都利空以及影响因素利好利空交替出现的情况下,股票价格在宏观上的变化情况.仿真结果在一定程度上模拟了股票价格的宏观变化情况和股票价格变化的波动壤集性,说明了假设的两大类因素的合理性以及演化模型的正确性. 相似文献
2.
Tony Tan 《Journal of Computer and System Sciences》2010,76(8):778-791
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we show that the emptiness problem for weak 2-pebble automata is decidable, while the same problem for weak 3-pebble automata is undecidable. We also introduce the so-called top view weak PA. Roughly speaking, top view weak PA are weak PA where the equality test is performed only between the data values seen by the two most recently placed pebbles. The emptiness problem for this model is still decidable. It is also robust: alternating, non-deterministic and deterministic top view weak PA have the same recognition power; and are strong enough to accept all data languages expressible in Linear Temporal Logic with the future-time operators, augmented with one register freeze quantifier. 相似文献
3.
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a standard timed automaton. In both cases, we show that simulation checking is Exptime-hard, and for the case of a non-flat implementation, the result holds even if there is no synchronization between the parallel components and their alphabets of actions are pairwise disjoint. Moreover, we show that the considered problems become Pspace-complete when the specification is assumed to be deterministic. Additionally, we establish that comparing a synchronous non-flat system with no hiding and a flat system is Pspace-hard for any relation between trace containment and bisimulation equivalence, even if the flat system is assumed to be fixed. 相似文献
4.
Changwook Kim 《Theoretical computer science》2011,412(48):6720-6735
A pushdown automaton (PDA) is quasi-rocking if it preserves the stack height for no more than a bounded number of consecutive moves. Every PDA can be transformed into an equivalent one that is quasi-rocking and real-time and every finite-turn (one-turn) PDA can be transformed into an equivalent one that is quasi-rocking or real-time. The quasi-rocking [quasi-rocking in the increasing mode, and quasi-rocking in the decreasing mode] real-time restriction in finite-turn (one-turn) PDAs coincides with the double Greibach [reverse Greibach, and Greibach] form in nonterminal-bounded (linear) context-free grammars. This provides complete grammatical characterizations of quasi-rocking and/or real-time (finite-turn and one-turn) PDAs and, together with known relations and other relations proved in the present paper, yields an extended hierarchy of PDA languages. Basic decision properties for PDAs can be stated in stronger forms by using the quasi-rocking and real-time restrictions and their undecidability/decidability status rests on the way PDAs quasi-rock. 相似文献
5.
There has been recent interest in exploring alternative computational models for structural analysis that are better suited
for a design environment requiring repetitive analysis. The need for such models is brought about by significant increases
in computer processing speeds, realized primarily through parallel processing. To take full advantage of such parallel machines,
however, the computational approach itself must be revisited from a totally different perspective; parallelization of inherently
serial paradigms is subject to limitations introduced by a requirement of information coordination. The cellular automata
(CA) model of decentralized computations provides one such approach which is ideally tailored for parallel computers. The
proposed paper examines the applicability of the cellular automata model in problems of 2-D elasticity. The focus of the paper
is in the use of a genetic algorithm based optimization process to derive the rules for local interaction required in evolving
the cellular automata.
Received August 28, 2000 相似文献
6.
Rachel Cardell-Oliver 《Formal Aspects of Computing》2000,12(5):350-371
A method is introduced for testing the conformance of implemented real-time systems to timed automata specifications. Uppaal
timed automata are transformed into testable timed transition systems (TTTSs) using a test view. Fault hypotheses and a test
generation algorithm for TTTSs are defined. Results of applying the method are presented.
Received October 1999 / Accepted in revised form November 2000 相似文献
7.
Ordered binary decision diagrams (OBDDs) are a very popular graph representation for Boolean functions. They can be viewed as finite automata recognizing sets of strings of a fixed length, where the letters of the input strings are read at most once in a predefined ordering. The string matching problem with string w as pattern, consists of determining, given an input string, whether or not it contains w as substring. We show that for a fraction of orderings tending to 1 when n increases arbitrarily, the minimal size of an OBDD solving the string matching problem for strings of length n has a growth which is an exponential in n. 相似文献
8.
针对维修工作分析法(MTA)确定维修资源繁琐复杂,不能体现占用型资源的占用与释放过程的问题,提出了采用Petri网理论来描述维修过程的方法。考虑维修工作特点,对Petri网进行改进,使用层次时间颜色Petri网(HTCPN)建立装备维修过程模型。运用基于JAVA环境下的PIPE软件对模型进行分析和仿真,直观展示出资源占用、释放和消耗的过程,并提取维修过程所需维修资源。以某自行发射装备液压系统故障维修为例,验证了该方法的合理性和有效性。 相似文献
9.
WAN Min MO Zhi-wen 《中国电子科技》2005,3(3):284-287
Grammar inference (GI) encompasses theory and methods for the inference of any structure that can recognize a language-be it a grammar, an automaton, or some other procedure-from training data. It has many applications[1,2]. And many methods are developed to carry out it[3~5]. However, relative fewer efforts have been made to infer a grammar using evolution strategies (ES). We believe that ES is suitable for the inference of a language due to their direct coding scheme and their simple way … 相似文献
10.
This letter is a supplement of the table of the minimal cost one-dimensional linear hybrid cellular automata with the maximum length cycle by Zhang, Miller, and Muzio [IEE Electronics Letters, 27(18):1625–1627, August 1991].This work was supported in part by Research Grants and Postgraduate Scholarships from the Natural Sciences and Engineering Research Council of Canada and by an equipment loan from the Canadian Microelectronics Corporation. 相似文献