全文获取类型
收费全文 | 43480篇 |
免费 | 5126篇 |
国内免费 | 3606篇 |
专业分类
电工技术 | 3035篇 |
技术理论 | 8篇 |
综合类 | 6541篇 |
化学工业 | 3264篇 |
金属工艺 | 984篇 |
机械仪表 | 2810篇 |
建筑科学 | 3871篇 |
矿业工程 | 1377篇 |
能源动力 | 1356篇 |
轻工业 | 744篇 |
水利工程 | 1259篇 |
石油天然气 | 1110篇 |
武器工业 | 753篇 |
无线电 | 4670篇 |
一般工业技术 | 5550篇 |
冶金工业 | 2307篇 |
原子能技术 | 402篇 |
自动化技术 | 12171篇 |
出版年
2024年 | 200篇 |
2023年 | 746篇 |
2022年 | 1074篇 |
2021年 | 1318篇 |
2020年 | 1539篇 |
2019年 | 1371篇 |
2018年 | 1442篇 |
2017年 | 1598篇 |
2016年 | 1727篇 |
2015年 | 1731篇 |
2014年 | 2558篇 |
2013年 | 3059篇 |
2012年 | 2840篇 |
2011年 | 3151篇 |
2010年 | 2485篇 |
2009年 | 2604篇 |
2008年 | 2688篇 |
2007年 | 2821篇 |
2006年 | 2632篇 |
2005年 | 2243篇 |
2004年 | 1832篇 |
2003年 | 1520篇 |
2002年 | 1318篇 |
2001年 | 1065篇 |
2000年 | 954篇 |
1999年 | 815篇 |
1998年 | 630篇 |
1997年 | 571篇 |
1996年 | 472篇 |
1995年 | 487篇 |
1994年 | 387篇 |
1993年 | 318篇 |
1992年 | 307篇 |
1991年 | 227篇 |
1990年 | 198篇 |
1989年 | 213篇 |
1988年 | 171篇 |
1987年 | 84篇 |
1986年 | 110篇 |
1985年 | 83篇 |
1984年 | 74篇 |
1983年 | 54篇 |
1982年 | 65篇 |
1981年 | 47篇 |
1980年 | 36篇 |
1979年 | 31篇 |
1978年 | 32篇 |
1977年 | 31篇 |
1964年 | 28篇 |
1955年 | 35篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
B. Vallée 《Algorithmica》2001,29(1-2):262-306
A quite general model of source that comes from dynamical systems theory is introduced. Within this model, some basic problems of algorithmic information theory contexts are analysed. The main tool is a new object, the generalized Ruelle operator, which can be viewed as a “generating” operator for fundamental intervals (associated to information sharing common prefixes). Its dominant spectral objects are linked with important parameters of the source, such as the entropy, and play a central rôle in all the results. 相似文献
992.
This paper is concerned with the nonparametric estimation of the higher order cumulant spectra of vector-valued stationary random fields onZ
d by smoothing the periodograms, whereZ is the space of integers and the dimensiond1. We derive the asymptotic cumulant properties of the spectral estimates, and consider an application to multidimensional nonlinear systems identification. Numerical examples with simulated data are provided. 相似文献
993.
P. A. J. Noel 《Journal of Automated Reasoning》1993,10(1):15-58
The theorem prover Isabelle has been used to axiomatise ZF set theory with natural deduction and to prove a number of theorems concerning functions. In particular, the well-founded recursion theorem has been derived, allowing the definition of functions over recursive types (such as the length and the append functions for lists). The theory of functions has been developed sufficiently within ZF to include PP, the theory of continuous functions forming the basis of LCF. Most of the theorems have been derived using backward proofs, with a small amount of automation.The work has been carried out at the Computer Laboratory of the University of Cambridge. 相似文献
994.
Donald Bruce 《Computers and the Humanities》1993,27(5-6):357-364
Humanities computing (HC) has failed to integrate into its practices many of the key theoretical elements of contemporary text and discourse theory. This has in turn contributed to the marginalization of HC in research and teaching. Outdated theoretical models must be abandoned in order to develop a critical discourse based on the insights of HC. HC projects remain far too attached to micro-analyses and have not developed the theoretical and methodological tools necessary to undertake systemic macro-analyses on the level of discourse. Given that texts are a mixture of determinate and dynamic systems, recent developments in chaos theory may be of help in modelling the interrelationship of these elements at discourse level.Donald Bruce is Associate Professor of Romance Languages at the University of Alberta. His research interests include literary theory, XIXth century French literature, science and literature, and translation. He recently edited an issue ofRecherches Sémiotiques/Semiotic Inquiry on Literature and Ideology and is presently working on a project entitled,The Socio-semiotic Nexus: Jules Vallès and the Discourse of the Commune. 相似文献
995.
In this paper, we report some comparative simulations between lattice BGK and lattice Bolzmann schemes for two-dimensional fluid flows. A quantitative assessment of the validity of the lattice BGK and lattice Bolzmann schemes is presented for the two-dimensional weakly compressibleKolmogorov flow. We use this flow to study the difference of the two schemes at small scales. A lowReynolds (R
e 300) number simulation shows the almost identical energy spectra for both schemes except for the small-scale dynamics of lattice Bolzmann which is more noisy. Because of the intrinsic difficulties of nonlinear stability analysis, we use numerical simulations to investigate which scheme is more stable. It turns out the lattice BGK is more stable. It turns out the lattice BGK is more robust than lattice Bolzmann by increasing theReynolds numbers. Detailed comparison with other methods (e.g., spectral method) remains to be done in the near future. 相似文献
996.
Systems for Knowledge and Belief 总被引:3,自引:0,他引:3
997.
998.
S. M. Krasnitskii 《Cybernetics and Systems Analysis》2000,36(5):691-698
Equivalence conditions of probability Gaussian measures corresponding to ordinary and generalized homogeneous random fields are compared and analyzed. 相似文献
999.
I. M. Titenko 《Cybernetics and Systems Analysis》2000,36(4):531-538
An approach to assessment of performance of hierarchical systems with simple subordination is developed with regard to moment
characteristics of sequences of random sums.
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 70–79, July–August, 2000. 相似文献
1000.
In this paper we explore and analyze the structure of Internet auctions from an analytical and an empirical perspective. Such
web‐based auctions are rapidly emerging as a mercantile process of choice in the electronic marketplace. We observe current
Internet auctions for one‐time products, such as rapidly aging hardware, and analyze them within the framework of the existing
auction theory. While traditional auction theory focuses on single‐item auctions, we observe that a majority of on‐line auctions
are multi‐item auctions. A significant contribution of this work is the theoretical derivation of the structure of the winning
bids in multi‐item progressive on‐line auctions. Additionally, for comparative purposes, we explore the structural characteristics
of alternative multi‐item auction mechanisms proposed in the auction theory. We derive hypotheses based on our analytical
results and compare two different types of auction mechanisms. We test the traditional auction theory assumption regarding
the homogeneity of bidders and present the first ever empirically derived classification and performance‐comparison of on‐line
bidders. We test our hypotheses using real‐world empirical data obtained by tracking a premier web‐based auction site. Statistical
analysis of the data indicates that firms may gain by choosing alternative auction mechanisms. We also provide directions
for further exploration of this emerging but important dimension of electronic commerce.
This revised version was published online in July 2006 with corrections to the Cover Date. 相似文献