全文获取类型
收费全文 | 2404篇 |
免费 | 282篇 |
国内免费 | 258篇 |
专业分类
电工技术 | 84篇 |
综合类 | 281篇 |
化学工业 | 39篇 |
金属工艺 | 6篇 |
机械仪表 | 74篇 |
建筑科学 | 20篇 |
能源动力 | 15篇 |
轻工业 | 15篇 |
水利工程 | 15篇 |
石油天然气 | 6篇 |
武器工业 | 1篇 |
无线电 | 150篇 |
一般工业技术 | 196篇 |
冶金工业 | 75篇 |
原子能技术 | 7篇 |
自动化技术 | 1960篇 |
出版年
2024年 | 12篇 |
2023年 | 23篇 |
2022年 | 27篇 |
2021年 | 36篇 |
2020年 | 32篇 |
2019年 | 46篇 |
2018年 | 33篇 |
2017年 | 50篇 |
2016年 | 69篇 |
2015年 | 70篇 |
2014年 | 102篇 |
2013年 | 138篇 |
2012年 | 149篇 |
2011年 | 149篇 |
2010年 | 130篇 |
2009年 | 154篇 |
2008年 | 181篇 |
2007年 | 166篇 |
2006年 | 168篇 |
2005年 | 149篇 |
2004年 | 106篇 |
2003年 | 103篇 |
2002年 | 113篇 |
2001年 | 77篇 |
2000年 | 75篇 |
1999年 | 84篇 |
1998年 | 58篇 |
1997年 | 50篇 |
1996年 | 55篇 |
1995年 | 63篇 |
1994年 | 51篇 |
1993年 | 40篇 |
1992年 | 39篇 |
1991年 | 23篇 |
1990年 | 21篇 |
1989年 | 15篇 |
1988年 | 11篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1982年 | 6篇 |
1981年 | 3篇 |
1980年 | 6篇 |
1979年 | 9篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1955年 | 2篇 |
排序方式: 共有2944条查询结果,搜索用时 15 毫秒
1.
现阶段的语义解析方法大部分都基于组合语义,这类方法的核心就是词典。词典是词汇的集合,词汇定义了自然语言句子中词语到知识库本体中谓词的映射。语义解析一直面临着词典中词汇覆盖度不够的问题。针对此问题,该文在现有工作的基础上,提出了基于桥连接的词典学习方法,该方法能够在训练中自动引入新的词汇并加以学习,为了进一步提高新学习到的词汇的准确度,该文设计了新的词语—二元谓词的特征模板,并使用基于投票机制的核心词典获取方法。该文在两个公开数据集(WebQuestions和Free917)上进行了对比实验,实验结果表明,该文方法能够学习到新的词汇,提高词汇的覆盖度,进而提升语义解析系统的性能,特别是召回率。 相似文献
2.
3.
本文在文[1~3]的基础上,提出了受控离散事件过程(CDEP)的一种代数分析方法,弥补了Ramadge和Wonham[1~3]的理论对具体系统的应用缺乏可操作性的缺陷,使得对CDEP动态过程的分析变得更为直观,同时也使控制器的设计过程更具可操作性. 相似文献
4.
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 相似文献
5.
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. 相似文献
6.
Mulligan Neil W.; Lozito Jeffrey P.; Rosner Zachary A. 《Canadian Metallurgical Quarterly》2006,32(4):836
Generation enhances memory for occurrence but may not enhance other aspects of memory. The present study further delineates the negative generation effect in context memory reported in N. W. Mulligan (2004). First, the negative generation effect occurred for perceptual attributes of the target item (its color and font) but not for extratarget aspects of context (location and background color). Second, nonvisual generation tasks with either semantic or nonsemantic generation rules (antonym and rhyme generation, respectively) produced the same pattern of results. In contrast, a visual (or data-driven) generation task (letter transposition) did not disrupt context memory for color. Third, generating nonwords produced no effect on item memory but persisted in producing a negative effect on context memory for target attributes, implying that (a) the negative generation effect in context memory is not mediated by semantic encoding, and (b) the negative effect on context memory can be dissociated from the positive effect on item memory. The results are interpreted in terms of the processing account of generation. The original, perceptual-conceptual version of this account is too narrow, but a modified processing account, based on a more generic visual versus nonvisual processing distinction, accommodates the results. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
7.
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. 相似文献
8.
本文对代数曲面的几何连续拼接作了研究,给出了多个代数曲面的几何连续过渡方法,同时给出了一种基于分片的曲面过渡方法。 相似文献
9.
本文给出从指称语义自动生成解释器后端的一种技术.解释器被表示成PASCAL_like形式. 相似文献
10.
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. 相似文献