全文获取类型
收费全文 | 1413篇 |
免费 | 142篇 |
国内免费 | 128篇 |
专业分类
电工技术 | 3篇 |
综合类 | 108篇 |
化学工业 | 1篇 |
金属工艺 | 4篇 |
机械仪表 | 50篇 |
建筑科学 | 10篇 |
能源动力 | 1篇 |
轻工业 | 9篇 |
水利工程 | 1篇 |
石油天然气 | 1篇 |
无线电 | 48篇 |
一般工业技术 | 85篇 |
冶金工业 | 61篇 |
自动化技术 | 1301篇 |
出版年
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年 | 105篇 |
2005年 | 90篇 |
2004年 | 59篇 |
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篇 |
排序方式: 共有1683条查询结果,搜索用时 9 毫秒
1.
现阶段的语义解析方法大部分都基于组合语义,这类方法的核心就是词典。词典是词汇的集合,词汇定义了自然语言句子中词语到知识库本体中谓词的映射。语义解析一直面临着词典中词汇覆盖度不够的问题。针对此问题,该文在现有工作的基础上,提出了基于桥连接的词典学习方法,该方法能够在训练中自动引入新的词汇并加以学习,为了进一步提高新学习到的词汇的准确度,该文设计了新的词语—二元谓词的特征模板,并使用基于投票机制的核心词典获取方法。该文在两个公开数据集(WebQuestions和Free917)上进行了对比实验,实验结果表明,该文方法能够学习到新的词汇,提高词汇的覆盖度,进而提升语义解析系统的性能,特别是召回率。 相似文献
2.
3.
J. Dingel 《Formal Aspects of Computing》2002,14(2):123-197
Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to
the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists.
Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these
problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus
allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The
calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction
of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are
independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated.
Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification
notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus
rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement
relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality.
The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing
program and vice versa.
Received July 2001 / Accepted in revised form May 2002 相似文献
4.
The parallel language FORK [1], based on a scalable shared memory model, is a PASCAL-like language with some additional parallel constructs. A PRAM (Parallel Random Access Machine) algorithm can be expressed on a high level of abstraction as a FORK program which is translated into efficient PRAM code guaranteeing theoretically predicted runtimes.
In this paper, we concentrate on those features of the language FORK related to parallelism, such as the group concept, a shared memory access and synchronous or asynchronous execution. We present a trace-based denotational interleaving semantics where processes describe synchronous computations. Processes are created or deleted dynamically and run asynchronously. Interleaving rules reflect the underlying CRCW (concurrent-read-concurrent-write) PRAM model. 相似文献
5.
Norihiro Kamide 《Journal of Logic, Language and Information》2002,11(4):453-470
We introduce Kripke semantics for modal substructural logics, and provethe completeness theorems with respect to the semantics. Thecompleteness theorems are proved using an extended Ishihara's method ofcanonical model construction (Ishihara, 2000). The framework presentedcan deal with a broad range of modal substructural logics, including afragment of modal intuitionistic linear logic, and modal versions ofCorsi's logics, Visser's logic, Méndez's logics and relevant logics. 相似文献
6.
本文给出从指称语义自动生成解释器后端的一种技术.解释器被表示成PASCAL_like形式. 相似文献
7.
Lucja Iwanska 《Computational Intelligence》1997,13(3):348-390
Intensional negative adjectives alleged , artificial , fake , false , former , and toy are unusual adjectives that depending on context may or may not be restricting functions. A formal theory of their semantics, pragmatics, and context that uniformly accounts for their complex mathematical and computational characteristics and captures some peculiarities of individual adjectives is presented.
Such adjectives are formalized as new concept builders, negation‐like functions that operate on the values of intensional properties of the concepts denoted by their arguments and yield new concepts whose intensional properties have values consistent with the negation of the old values. Understanding these new concepts involves semantics, pragmatics and context‐dependency of natural language. It is argued that intensional negative adjectives can be viewed as a special‐purpose, weaker, conntext‐dependent negationin natural language. The theory explains and predicts many inferences licensed by expressions involving such adjectives. Implementation of sample examples demonstrates its computational feasibility. Computation of context‐dependent interpretation is discussed.
The theory allows one to enhance a knowledge representation system with similar concept building, negation‐like, context‐dependent functions, the availability of which appears to be a distinct characteristic of natural languages. 相似文献
Such adjectives are formalized as new concept builders, negation‐like functions that operate on the values of intensional properties of the concepts denoted by their arguments and yield new concepts whose intensional properties have values consistent with the negation of the old values. Understanding these new concepts involves semantics, pragmatics and context‐dependency of natural language. It is argued that intensional negative adjectives can be viewed as a special‐purpose, weaker, conntext‐dependent negationin natural language. The theory explains and predicts many inferences licensed by expressions involving such adjectives. Implementation of sample examples demonstrates its computational feasibility. Computation of context‐dependent interpretation is discussed.
The theory allows one to enhance a knowledge representation system with similar concept building, negation‐like, context‐dependent functions, the availability of which appears to be a distinct characteristic of natural languages. 相似文献
8.
Cntextual logic provides a mechanism to reason about modules.In this paper,this theory of modules if modules is extended to a context theory of classes where class is in the true spirit of object-oriented databases.The logic,referred to as CLOG,is class-based.CLOG supports class,object identity,multiple role of object, monotonic and non-monotonic inheritance of data and method,method factoring,views,derived and query classes.Views and derived classes are queries in themselves.Objects are pure data terms representing the ground instances of facts in the class.Object identity is a first class term in the logic.Inheritance is handled through delegation. 相似文献
9.
We present a methodology for compiler synthesis based on Mosses-Watt's action semantics. Each action in action semantics notation is assigned specific “analysis functions”, such as a typing function and a binding-time function. When a language is given an action semantics, the typing and binding-time functions for the individual actions compose into typing and binding-time analyses for the language; these are implemented as the type checker and static semantics processor, respectively, in the synthesized compiler. Other analyses can be similarly formalized and implemented. We show a sample language semantics and its synthesized compiler, and we describe the compiler synthesizer that we have developed. 相似文献
10.
Hong ZHU 《Frontiers of Computer Science in China》2012,6(1):40-56
Meta-modelling plays an important role in model driven software development.In this paper,a graphic extension of BNF (GEBNF) is proposed to define the abstract syntax of graphic modelling languages.Fro... 相似文献