全文获取类型
收费全文 | 498279篇 |
免费 | 6212篇 |
国内免费 | 2079篇 |
专业分类
电工技术 | 8700篇 |
综合类 | 3282篇 |
化学工业 | 73253篇 |
金属工艺 | 21917篇 |
机械仪表 | 17074篇 |
建筑科学 | 11015篇 |
矿业工程 | 2981篇 |
能源动力 | 12768篇 |
轻工业 | 32732篇 |
水利工程 | 5802篇 |
石油天然气 | 9318篇 |
武器工业 | 103篇 |
无线电 | 58832篇 |
一般工业技术 | 101229篇 |
冶金工业 | 78771篇 |
原子能技术 | 10000篇 |
自动化技术 | 58793篇 |
出版年
2022年 | 2765篇 |
2021年 | 4203篇 |
2020年 | 3212篇 |
2019年 | 4080篇 |
2018年 | 20543篇 |
2017年 | 19525篇 |
2016年 | 16811篇 |
2015年 | 5333篇 |
2014年 | 7830篇 |
2013年 | 20845篇 |
2012年 | 14934篇 |
2011年 | 24726篇 |
2010年 | 20458篇 |
2009年 | 19473篇 |
2008年 | 20935篇 |
2007年 | 21659篇 |
2006年 | 12931篇 |
2005年 | 12554篇 |
2004年 | 11873篇 |
2003年 | 11901篇 |
2002年 | 10910篇 |
2001年 | 10346篇 |
2000年 | 9574篇 |
1999年 | 9743篇 |
1998年 | 24478篇 |
1997年 | 16828篇 |
1996年 | 12938篇 |
1995年 | 9615篇 |
1994年 | 8463篇 |
1993年 | 8480篇 |
1992年 | 6174篇 |
1991年 | 5833篇 |
1990年 | 5825篇 |
1989年 | 5473篇 |
1988年 | 5205篇 |
1987年 | 4562篇 |
1986年 | 4465篇 |
1985年 | 4993篇 |
1984年 | 4609篇 |
1983年 | 4174篇 |
1982年 | 3834篇 |
1981年 | 3898篇 |
1980年 | 3598篇 |
1979年 | 3525篇 |
1978年 | 3586篇 |
1977年 | 3977篇 |
1976年 | 5079篇 |
1975年 | 3073篇 |
1974年 | 2945篇 |
1973年 | 3012篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
Analysis of low bit rate image transform coding 总被引:8,自引:0,他引:8
Calculations based on high-resolution quantizations prove that the distortion rate D(R¯) of an image transform coding is proportional to 2-2R when R¯ is large enough. In wavelet and block cosine bases, we show that if R¯<1 bit/pixel, then D(R¯) varies like R¯1-2γ, where γ remains of the order of 1 for most natural images. The improved performance of embedded codings in wavelet bases is analyzed. At low bit rates, we show that the compression performance of an orthonormal basis depends mostly on its ability to approximate images with a few nonzero vectors 相似文献
152.
Jan van Eijck 《Formal Aspects of Computing》1994,6(1):766-787
Presuppositions of utterances are the pieces of information you convey with an utterance no matter whether your utterance is true or not. We first study presupposition in a very simple framework of updating propositional information, with examples of how presuppositions of complex propositional updates can be calculated. Next we move on to presuppositions and quantification, in the context of a dynamic version of predicate logic, suitably modified to allow for presupposition failure. In both the propositional and the quantificational case, presupposition failure can be viewed as error abortion of procedures. Thus, a dynamic assertion logic which describes the preconditions for error abortion is the suitable tool for analysing presupposition. 相似文献
153.
154.
I. S. W. B. Prasetya 《Formal Aspects of Computing》1994,6(4):466-470
UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent. 相似文献
155.
Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex 相似文献
156.
Weight smoothing to improve network generalization 总被引:2,自引:0,他引:2
A weight smoothing algorithm is proposed in this paper to improve a neural network's generalization capability. The algorithm can be used when the data patterns to be classified are presented on an n-dimensional grid (n>/=1) and there exists some correlations among neighboring data points within a pattern. For a fully-interconnected feedforward net, no such correlation information is embedded into the architecture. Consequently, the correlations can only be extracted through sufficient amount of network training. With the proposed algorithm, a smoothing constraint is incorporated into the objective function of backpropagation to reflect the neighborhood correlations and to seek those solutions that have smooth connection weights. Experiments were performed on problems of waveform classification, multifont alphanumeric character recognition, and handwritten numeral recognition. The results indicate that (1) networks trained with the algorithm do have smooth connection weights, and (2) they generalize better. 相似文献
157.
Network information criterion-determining the number of hiddenunits for an artificial neural network model 总被引:6,自引:0,他引:6
The problem of model selection, or determination of the number of hidden units, can be approached statistically, by generalizing Akaike's information criterion (AIC) to be applicable to unfaithful (i.e., unrealizable) models with general loss criteria including regularization terms. The relation between the training error and the generalization error is studied in terms of the number of the training examples and the complexity of a network which reduces to the number of parameters in the ordinary statistical theory of AIC. This relation leads to a new network information criterion which is useful for selecting the optimal network model based on a given training set. 相似文献
158.
The paper presents an algebraic specification of net objects. By net objects we mean those that are defined in object-oriented paradigms and those defined with nested relations in complex database models. An algebraic specification is set up that involves structures of net objects, accesses of net objects, and some features of object-oriented programming, such as multiple inheritance and polymorphism. Objects and their relationships are then characterized formally in the modeling, which utilizes the hierarchical approach in the algebraic theory of abstract data types, and is further developed by adding mechanisms from existing object systems. Categories of net objects are presented with the properties of accesses among them 相似文献
159.
Shrivastava S.K. McCue D.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(4):421-432
The object-oriented approach to system structuring has found widespread acceptance among designers and developers of robust computing systems. The authors propose a system structure for distributed programming systems that support persistent objects and describe how properties such as persistence and recoverability can be implemented. The proposed structure is modular, permitting easy exploitation of any distributed computing facilities provided by the underlying system. An existing system constructed according to the principles espoused here is examined to illustrate the practical utility of the proposed approach to system structuring 相似文献
160.
A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, was studied by S. Even and S. Rajsbaum (1990) under the assumption that message transmission delays and processing times are constant. We study the behavior of the simple synchronizer when processing times and transmission delays are random. The main performance measure is the rate of a network, i.e., the average number of computational steps executed by a processor in the network per unit time. We analyze the effect of the topology and the probability distributions of the random variables on the behavior of the network. For random variables with exponential distribution, we provide tight (i.e., attainable) bounds and study the effect of a bottleneck processor on the rate 相似文献