全文获取类型
收费全文 | 1406篇 |
免费 | 140篇 |
国内免费 | 128篇 |
专业分类
电工技术 | 3篇 |
综合类 | 108篇 |
化学工业 | 1篇 |
金属工艺 | 4篇 |
机械仪表 | 50篇 |
建筑科学 | 10篇 |
能源动力 | 1篇 |
轻工业 | 9篇 |
水利工程 | 1篇 |
石油天然气 | 1篇 |
无线电 | 48篇 |
一般工业技术 | 83篇 |
冶金工业 | 60篇 |
自动化技术 | 1295篇 |
出版年
2024年 | 7篇 |
2023年 | 16篇 |
2022年 | 19篇 |
2021年 | 22篇 |
2020年 | 17篇 |
2019年 | 26篇 |
2018年 | 11篇 |
2017年 | 20篇 |
2016年 | 25篇 |
2015年 | 30篇 |
2014年 | 55篇 |
2013年 | 56篇 |
2012年 | 64篇 |
2011年 | 78篇 |
2010年 | 74篇 |
2009年 | 100篇 |
2008年 | 118篇 |
2007年 | 103篇 |
2006年 | 105篇 |
2005年 | 90篇 |
2004年 | 58篇 |
2003年 | 58篇 |
2002年 | 58篇 |
2001年 | 47篇 |
2000年 | 44篇 |
1999年 | 46篇 |
1998年 | 41篇 |
1997年 | 28篇 |
1996年 | 31篇 |
1995年 | 43篇 |
1994年 | 32篇 |
1993年 | 29篇 |
1992年 | 26篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 6篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1975年 | 2篇 |
1959年 | 2篇 |
排序方式: 共有1674条查询结果,搜索用时 312 毫秒
81.
面向对象语言在软件工程实践中有着广泛的应用。为面向对象语言定义严格的语义有助于理解面向对象语言的本质特征,对验证软件、提高软件系统可靠性等也具有重要意义。给出了一种新的面向对象语言的语义框架,该框架基于命令式的风格,具有操作语义和类型规则;证明了该语义框架的类型安全定理。 相似文献
82.
Rob J. van Glabbeek Ursula Goltz Jens-Wolfhard Schicke 《Information Processing Letters》2011,111(13):626-633
A well-known problem in Petri net theory is to formalise an appropriate causality-based concept of process or run for place/transition systems. The so-called individual token interpretation, where tokens are distinguished according to their causal history, giving rise to the processes of Goltz and Reisig, is often considered too detailed. The problem of defining a fully satisfying more abstract concept of process for general place/transition systems has so-far not been solved. In this paper, we recall the proposal of defining an abstract notion of process, here called BD-process, in terms of equivalence classes of Goltz-Reisig processes, using an equivalence proposed by Best and Devillers. It yields a fully satisfying solution for at least all one-safe nets. However, for certain nets which intuitively have different conflicting behaviours, it yields only one maximal abstract process. Here we identify a class of place/transition systems, called structural conflict nets, where conflict and concurrency due to token multiplicity are clearly separated. We show that, in the case of structural conflict nets, the equivalence proposed by Best and Devillers yields a unique maximal abstract process only for conflict-free nets. Thereby BD-processes constitute a simple and fully satisfying solution in the class of structural conflict nets. 相似文献
83.
In this paper we give a formal definition of the requirements translation language Behavior Trees. This language has been used with success in industry to systematically translate large, complex, and often erroneous requirements documents into a structured model of the system. It contains a mixture of state-based manipulations, synchronisation, message passing, and parallel, conditional, and iterative control structures. The formal semantics of a Behavior Tree is given via a translation to a version of Hoare’s process algebra CSP, extended with state-based constructs such as guards and updates, and a message passing facility similar to that used in publish/subscribe protocols. We first provide the extension of CSP and its operational semantics, which preserves the meaning of the original CSP operators, and then the Behavior Tree notation and its translation into the extended version of CSP. 相似文献
84.
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithms and parsing algorithms. 相似文献
85.
This paper presents a formal symbolic trajectory evaluation (STE) theory based on a structural netlist circuit model, instead of an abstract next state function. We introduce an inductive definition for netlists, which gives an accurate and formal definition for netlist structures. A closure state function of netlists is formally introduced in terms of the formal netlist model. We refine the definition of the defining trajectory and the STE implementation to deal with the closure state function. The close correspondence between netlist structures and properties is discussed. We present a set of novel algebraic laws to characterize the relation between the structures and properties of netlists. Finally, the application of the new laws is demonstrated by parameterized verification of the properties of content-addressable memories. 相似文献
86.
随着电子学习系统应用的深入,资源库已经成为影响电子学习系统可用性的一个重要因素。针对现有资源库在资源检索查全率、查准率上存在的不足,将语义特征引入到电子学习资源库模型的构建之中,提出了一种基于本体描述的电子学习资源库模型LMOD。LMOD通过构建电子学习资源库本体并生成相应的语义元数据规范地描述资源,将资源以机器可以理解的方式组织起来;并利用语义学视图规范用户查询语句。在此基础上实现基于语义的资源查询,以有效地解决搜索中含糊解释与同义识别的问题。该模型能够有效克服现有资源库建设方案的缺点,提升资源库的使用效率与可用性。 相似文献
87.
Modeling Content for Semantic-Level Querying of Multimedia 总被引:2,自引:0,他引:2
Many semantic content-based models have been developed for modeling video and audio in order to enable information retrieval based on semantic content. The level of querying of the media depends upon the semantic aspects modeled. This paper proposes a semantic content-based model for semantic-level querying that makes full use of the explicit media structure, objects, spatial relationships between objects, events and actions involving objects, temporal relationships between events and actions, and integration between syntactic and semantic information. 相似文献
88.
Jerzy Karczmarczuk 《Higher-Order and Symbolic Computation》2001,14(1):35-57
We present a purely functional implementation of the computational differentiation tools—the well known numeric (i.e., not symbolic) techniques which permit one to compute point-wise derivatives of functions defined by computer programs economically and exactly (with machine precision). We show how the use of lazy evaluation permits a transparent and elegant construction of the entire infinite tower of derivatives of higher order for any expressions present in the program. The formalism may be useful in various problems of scientific computing which often demand a hard and ungracious human preprocessing before writing the final code. Some concrete examples are given. 相似文献
89.
90.
This paper introduces and motivates ADL, a new formal notation for the specification of the temporal and functional behaviour
of concurrent processes. ADL is tailored to be directly compatible with the DORIS design method. It combines a graphical Activity State-Machine (ASM) notation and a model-based Activity Functional Behaviour (AFB) notation. The abstract syntax, and static and dynamic semantics for the ASM notation are given, the dynamic semantics
being given proof-theoretically in many-sorted logic extended with the RTL ‘occurrence’ relation, Θ, and the ERTL ‘holding’ relation, Φ. ADL is used to specify a small network, and proofs are given of its timeliness and safety properties.
Received November 1998 / Accepted in revised form May 2000 相似文献