全文获取类型
收费全文 | 40393篇 |
免费 | 3867篇 |
国内免费 | 2773篇 |
学科分类
工业技术 | 47033篇 |
出版年
2024年 | 239篇 |
2023年 | 761篇 |
2022年 | 1353篇 |
2021年 | 1448篇 |
2020年 | 1426篇 |
2019年 | 1077篇 |
2018年 | 931篇 |
2017年 | 1152篇 |
2016年 | 1344篇 |
2015年 | 1535篇 |
2014年 | 2510篇 |
2013年 | 2051篇 |
2012年 | 2948篇 |
2011年 | 3048篇 |
2010年 | 2247篇 |
2009年 | 2299篇 |
2008年 | 2178篇 |
2007年 | 2780篇 |
2006年 | 2702篇 |
2005年 | 2308篇 |
2004年 | 1812篇 |
2003年 | 1600篇 |
2002年 | 1344篇 |
2001年 | 1169篇 |
2000年 | 947篇 |
1999年 | 733篇 |
1998年 | 575篇 |
1997年 | 471篇 |
1996年 | 381篇 |
1995年 | 347篇 |
1994年 | 301篇 |
1993年 | 227篇 |
1992年 | 162篇 |
1991年 | 135篇 |
1990年 | 105篇 |
1989年 | 111篇 |
1988年 | 86篇 |
1987年 | 35篇 |
1986年 | 32篇 |
1985年 | 15篇 |
1984年 | 7篇 |
1983年 | 17篇 |
1982年 | 13篇 |
1981年 | 7篇 |
1980年 | 5篇 |
1979年 | 9篇 |
1978年 | 5篇 |
1961年 | 5篇 |
1959年 | 5篇 |
1957年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
针对现有混合入侵检测模型仅定性选取特征而导致检测精度较低的问题,同时为了充分结合误用检测模型和异常检测模型的优势,提出一种采用信息增益率的混合入侵检测模型.首先,利用信息增益率定量地选择特征子集,最大程度地保留样本信息;其次,采用余弦时变粒子群算法确定支持向量机参数构建误用检测模型,使其更好地平衡粒子在全局和局部的搜索能力,然后,选取灰狼算法确定单类支持向量机参数构建异常检测模型,以此来提高对最优参数的搜索效率和精细程度,综合提高混合入侵检测模型对攻击的检测效果;最后,通过两种数据集进行仿真实验,验证了所提混合入侵检测模型具有较好的检测性能. 相似文献
2.
介绍一种基于变频调速控制的全自动定量包装机,结构简单,组态灵活,性价比高,可广泛应用于食品饲料等行业,现场运行实践证明其通用性好,准确度和可靠性高、速度快、稳定性好。并论述变频器控制系统的设计及使用中的注意问题。 相似文献
3.
H. D. Saltzstein and T. Kasachkoff (2004) (see record 2004-21519-004) critique the social intuitionist model (J. Haidt, 2001) (see record 2001-18918-008), but the model they critique is a stripped-down version that should be called the "possum" model. They make 3 charges about the possum model that are not true about the social intuitionist model: that it includes no role for reasoning, that it reduces social influence to compliance, and that it does not take a developmental perspective. After a defense of the honor of the social intuitionist model, this article raises 2 areas of legitimate dispute: the scope and nature of moral reasoning and the usefulness of appealing to innate ideas, rather than to learning and reasoning, as the origin of moral knowledge. This article presents 3 clusters of innate moral intuitions, related to sympathy, hierarchy, and reciprocity. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
4.
5.
6.
Inaki Arrazola Agn s Plainfoss Henri Prade Claudette Testemale 《Information Systems》1989,14(6):487-492
This paper presents different approaches which enable a data base management system to obtain a plausible fuzzy estimate for an attribute value of an item for which the information is not explicitly stored in the data base. This can be made either by a kind of analogical reasoning from information about particular items or by means of expert rules which specify the (fuzzy) sets of possible values of the attribute under consideration, for various classes of items. Another kind of expert rules enables the system to compute an estimate from the attribute value of another item provided that, in other respects, this latter item sufficiently resembles the item, the value of which we are interested in; then these expert rules are used either for controlling the analogical reasoning process or for enlarging the scope of application of the first kind of expert rules. The different approaches are discussed in the framework of possibility theory. 相似文献
7.
Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient. 相似文献
8.
Dragan Simić Svetlana Simić 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(12):1185-1192
A concept of business intelligent system for financial prediction is considered in this paper. It provides data needed for
fast, precise and good business decision support to all levels of management. The aim of the project is the development of
a new online analytical processing oriented on case-based reasoning (CBR) where a previous experience for every new problem
is taken into account. Methodological aspects have been tested in practice as a part of the management information system
development project of “Novi Sad Fair”. A case study of an improved application of CBR in prediction of future payments is
discussed in the paper.
This paper is originally presented at The International Conference on Hybrid Information Technology 2006, at the special session
on “Intelligent Information Systems for Financial Engineering”, November 2006 in Cheju Island, Korea. 相似文献
9.
10.
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 相似文献