全文获取类型
收费全文 | 5808篇 |
免费 | 921篇 |
国内免费 | 754篇 |
专业分类
电工技术 | 798篇 |
综合类 | 661篇 |
化学工业 | 195篇 |
金属工艺 | 72篇 |
机械仪表 | 244篇 |
建筑科学 | 272篇 |
矿业工程 | 80篇 |
能源动力 | 141篇 |
轻工业 | 120篇 |
水利工程 | 110篇 |
石油天然气 | 69篇 |
武器工业 | 54篇 |
无线电 | 547篇 |
一般工业技术 | 590篇 |
冶金工业 | 241篇 |
原子能技术 | 103篇 |
自动化技术 | 3186篇 |
出版年
2024年 | 29篇 |
2023年 | 110篇 |
2022年 | 176篇 |
2021年 | 218篇 |
2020年 | 243篇 |
2019年 | 237篇 |
2018年 | 196篇 |
2017年 | 230篇 |
2016年 | 300篇 |
2015年 | 295篇 |
2014年 | 349篇 |
2013年 | 470篇 |
2012年 | 398篇 |
2011年 | 413篇 |
2010年 | 327篇 |
2009年 | 360篇 |
2008年 | 345篇 |
2007年 | 402篇 |
2006年 | 370篇 |
2005年 | 304篇 |
2004年 | 263篇 |
2003年 | 226篇 |
2002年 | 179篇 |
2001年 | 136篇 |
2000年 | 137篇 |
1999年 | 104篇 |
1998年 | 92篇 |
1997年 | 82篇 |
1996年 | 70篇 |
1995年 | 62篇 |
1994年 | 59篇 |
1993年 | 62篇 |
1992年 | 46篇 |
1991年 | 28篇 |
1990年 | 26篇 |
1989年 | 18篇 |
1988年 | 17篇 |
1987年 | 12篇 |
1986年 | 5篇 |
1985年 | 11篇 |
1984年 | 14篇 |
1983年 | 7篇 |
1982年 | 9篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1965年 | 3篇 |
1959年 | 3篇 |
排序方式: 共有7483条查询结果,搜索用时 15 毫秒
31.
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. 相似文献
32.
33.
34.
一种基于神经网络的模糊推理方法 总被引:4,自引:1,他引:3
对于Zadeh的模糊关系合成法则(简称CRI方法),选择一个适宜蕴涵关系矩阵是至关重要的。通常蕴涵关系矩阵的元素值是通过一个所构造的数学表达式计算的,或是由领域专家凭经验直接给出。然而,有时,特别是对于后一种情形,CRI法不能满足模糊推理最基本的一致性要求。文章构造了一个神经网络用于模糊推理,新方法不仅是CRI方法的推广,而且远比CRI方法易于满足推理的一致性要求。得益于神经网络的长处,新方法具有灵活性、可调性。文章给出了权值的具取值法。 相似文献
35.
Recent psychological research has investigated how people assess the probability of an indicative conditional. Most people give the conditional probability of q given p as the probability of if p then q. Asking about the probability of an indicative conditional, one is in effect asking about its acceptability. But on what basis are deontic conditionals judged to be acceptable or unacceptable? Using a decision theoretic analysis, we argue that a deontic conditional, of the form if p then must q or if p then may q, will be judged acceptable to the extent that the p & q possibility is preferred to the p & not-q possibility. Two experiments are reported in which this prediction was upheld. There was also evidence that the pragmatic suitability of permission rules is partly determined by evaluations of the not-p & q possibility. Implications of these results for theories of deontic reasoning are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
36.
Reports an error in "Temporal Encoding in Fear Conditioning Revealed Through Associative Reflex Facilitation" by Derick H. Lindquist and Thomas H. Brown (Behavioral Neuroscience, 2004[Apr], Vol 118[2], 395-402). The article contained several errors. On page 396, second paragraph, the sentence beginning on line 6 should read as follows: "Having a stable baseline is critical for studies of reflex facilitation because the experimental designs invariably entail repetitive CR testing, if only to achieve reasonable statistical power (see Choi et al., 2001b; Lindquist & Brown, 2004)." On page 400, the first heading should read as follows: "Comparison of New and Old Reflex Facilitation Procedures." On page 400, the first sentence under the abovementioned heading should read as follows: "We decided not to use the original measure of reflex facilitation, developed by J. S. Brown et al. (1951), because it suffers from severe interpretational limitations, elaborated in detail elsewhere (Choi et al., 2001b; Leaton & Cranney, 1990; Lindquist & Brown, 2004)." (The following abstract of the original article appeared in record 2004-12681-016.) Temporal encoding in Pavlovian fear conditioning was examined through conditional facilitation of the short-latency (Rl) component of the rat eyeblink reflex. Rats were fear-conditioned to a tone conditional stimulus (CS) with either a 3- or 9-s interstimulus interval (ISI) between CS onset and the onset of the grid-shock unconditional stimulus (US). Rl facilitation was tested over 2 days, in counterbalanced order, at a latency of 3 s and 9 s from CS onset. CS-produced Rl facilitation, the conditional response (CR), was 3-4 times larger when the test latency equaled the conditioning ISI. These results, coupled with the known neurophysiology of Rl facilitation, suggest that this CR could disclose differences in the time course of CS-generated output from the amygdala when driven by cortical versus subcortical CS-CR pathways. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
37.
Verbrugge Sara; Dieussaert Kristien; Schaeken Walter; Van Belle William 《Canadian Metallurgical Quarterly》2004,58(2):106
Evidence from reasoning tasks shows that promises and threats both tend to receive biconditional interpretations. They also both display high speaker control. On the face of it, the only difference seems to be the positive or negative signing of the consequent. In a promise, the speaker tries to persuade the hearer to do something by holding out the prospect of a particular reward; in a threat, the speaker tries to refrain the hearer from doing something by holding out the prospect of a particular punishment. This paper investigates the respects in which conditional promises and threats differ further by means of an inference task. The credibility of the consequent was manipulated in order to examine whether the acceptability ratings of inferences based on promises and on threats would be equally affected. The results of the inference task and an analysis of the reasons people give for their answers suggest that the credibility of promises is less affected by the use of excessive consequents than the credibility of threats. In other words, promise remains debt, whereas threat is another matter. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
38.
Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates
integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via
normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where
the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences
with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any
type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning
problem to fit integer programming takes a polynomial time.
H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute
of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. 相似文献
39.
40.
Liping Wang Ramana V. Grandhi Dale A. Hopkins 《International journal for numerical methods in engineering》1995,38(10):1721-1738
The objective of this paper is to conduct reliability-based structural optimization in a multidisciplinary environment. An efficient reliability analysis is developed by expanding the limit functions in terms of intermediate design variables. The design constraints are approximated using multivariate splines in searching for the optimum. The reduction in computational cost realized in safety index calculation and optimization are demonstrated through several structural problems. This paper presents safety index computation, analytical sensitivity analysis of reliability constraints and optimization using truss, frame and plate examples. 相似文献