全文获取类型
收费全文 | 1412篇 |
免费 | 143篇 |
国内免费 | 128篇 |
专业分类
电工技术 | 3篇 |
综合类 | 107篇 |
化学工业 | 1篇 |
金属工艺 | 4篇 |
机械仪表 | 50篇 |
建筑科学 | 10篇 |
能源动力 | 1篇 |
轻工业 | 9篇 |
水利工程 | 1篇 |
石油天然气 | 1篇 |
无线电 | 47篇 |
一般工业技术 | 85篇 |
冶金工业 | 61篇 |
自动化技术 | 1303篇 |
出版年
2024年 | 9篇 |
2023年 | 17篇 |
2022年 | 19篇 |
2021年 | 22篇 |
2020年 | 17篇 |
2019年 | 27篇 |
2018年 | 12篇 |
2017年 | 20篇 |
2016年 | 25篇 |
2015年 | 30篇 |
2014年 | 56篇 |
2013年 | 56篇 |
2012年 | 66篇 |
2011年 | 78篇 |
2010年 | 74篇 |
2009年 | 100篇 |
2008年 | 118篇 |
2007年 | 103篇 |
2006年 | 106篇 |
2005年 | 90篇 |
2004年 | 59篇 |
2003年 | 58篇 |
2002年 | 58篇 |
2001年 | 46篇 |
2000年 | 44篇 |
1999年 | 45篇 |
1998年 | 41篇 |
1997年 | 28篇 |
1996年 | 31篇 |
1995年 | 43篇 |
1994年 | 33篇 |
1993年 | 27篇 |
1992年 | 26篇 |
1991年 | 13篇 |
1990年 | 9篇 |
1989年 | 11篇 |
1988年 | 6篇 |
1987年 | 4篇 |
1986年 | 6篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 2篇 |
1976年 | 6篇 |
1975年 | 2篇 |
1959年 | 2篇 |
排序方式: 共有1683条查询结果,搜索用时 15 毫秒
41.
网络计算系统中涉及的操作复杂,很难直接给出一种的语义描述框架.作为一种网络计算模型,Ambient演算主要刻画了计算的分布性和移动性.目前关于Ambient的语义研究很多,但均是基于规约规则的语义形式.这种描述方式尽管简洁,一方面却具有不确定性,不利于实际的网络计算系统的设计和直接实现;另一方面,这种语义描述方式均在一个层次上描述Ambient演算系统中的各种行为语义,使得Ambient演算中各种计算行为纠缠在一起,复杂而难以理解.根据Ambient演算的结构特点,给出了Ambient演算的一种分层语义描述形式,系统以ambient为单元,分成3层进行描述,分别给出不同层上行为的语法定义、语义定义、语义方程以及不同层间的转换函数的定义,从而给出Ambient演算系统的指称语义描述形式.这种描述方式从层次化的角度分析了Ambient演算的计算行为,有助于对Ambient演算中行为的理解和实际应用系统的实现. 相似文献
42.
43.
以大规模智能采集互联网中的服装图像为目的,研究如何利用互联网上服装图像的伴随文本与服装图像概念之间的关联,实现自动采集各语义对应的服装图像。在HITS(Hyperlink-Induced Topic Search)算法的基础上提出一个基于层次语义的图像采集算法SICR(Semantic-based Image Collection Robot)。该算法在层次语义库的支持下,扩充根集与去除链接工厂页面同步进行。在爬取链接网页前,进行锚文字的相似度计算和页面内容的概念分析,舍弃不符合语义的页面,只下载满足语义的服装图像。算法克服了基于文本分析或链接分析的图像自动提取算法的不足,具有较高的准确率和召回率,实验结果证明了SICR算法的有效性。 相似文献
44.
汉语复句层次关系分析是中文信息处理领域极具挑战性的课题之一。为解决关系词标识信息不充足所导致的复句层次关系识别准确率下降问题,挖掘了影响分句关联的形式化语义知识,在此基础上构建了小句关联体识别算法并将其应用于相应的复句层次判定规则之中,以辅助分析其层次关系;对于其余单、多重有标复句的层次识别,使用基于搭配规则的移进-归约算法;最后提出了一种语义与规则相结合的复句层次分析模型。实验结果表明,此方法在一定程度上提高了复句层次关系识别的准确率。 相似文献
45.
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. 相似文献
46.
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. 相似文献
47.
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. 相似文献
48.
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. 相似文献
49.
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. 相似文献
50.