全文获取类型
收费全文 | 36456篇 |
免费 | 3645篇 |
国内免费 | 2068篇 |
专业分类
电工技术 | 2358篇 |
技术理论 | 7篇 |
综合类 | 4139篇 |
化学工业 | 1941篇 |
金属工艺 | 790篇 |
机械仪表 | 1756篇 |
建筑科学 | 10970篇 |
矿业工程 | 668篇 |
能源动力 | 692篇 |
轻工业 | 511篇 |
水利工程 | 497篇 |
石油天然气 | 660篇 |
武器工业 | 271篇 |
无线电 | 3730篇 |
一般工业技术 | 4649篇 |
冶金工业 | 1011篇 |
原子能技术 | 245篇 |
自动化技术 | 7274篇 |
出版年
2024年 | 153篇 |
2023年 | 685篇 |
2022年 | 770篇 |
2021年 | 927篇 |
2020年 | 1029篇 |
2019年 | 915篇 |
2018年 | 898篇 |
2017年 | 1027篇 |
2016年 | 1256篇 |
2015年 | 1411篇 |
2014年 | 2414篇 |
2013年 | 2155篇 |
2012年 | 2607篇 |
2011年 | 2906篇 |
2010年 | 2373篇 |
2009年 | 2427篇 |
2008年 | 2349篇 |
2007年 | 2543篇 |
2006年 | 2326篇 |
2005年 | 1819篇 |
2004年 | 1511篇 |
2003年 | 1263篇 |
2002年 | 1069篇 |
2001年 | 856篇 |
2000年 | 767篇 |
1999年 | 657篇 |
1998年 | 523篇 |
1997年 | 389篇 |
1996年 | 326篇 |
1995年 | 307篇 |
1994年 | 263篇 |
1993年 | 201篇 |
1992年 | 212篇 |
1991年 | 127篇 |
1990年 | 123篇 |
1989年 | 97篇 |
1988年 | 79篇 |
1987年 | 58篇 |
1986年 | 37篇 |
1985年 | 49篇 |
1984年 | 38篇 |
1983年 | 40篇 |
1982年 | 35篇 |
1981年 | 25篇 |
1980年 | 18篇 |
1979年 | 22篇 |
1978年 | 17篇 |
1977年 | 14篇 |
1975年 | 8篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 828 毫秒
61.
非线性地基上桩结构物空间分析 总被引:1,自引:0,他引:1
本文提出了桩结构物-非线性地基空间相互作用分析的迭代法和非线性有限元法。其中,桩基分析用p-y曲线法。结合实际结构物进行了大量的计算及比较分析,成果是令人满意的,可以付诸应用。 相似文献
62.
制备了大面积硅锂漂移探测器,其性能为:探测器的灵敏面积123.6 cm~2;灵敏层深度2 mm;在室温和300 V反向偏压的工作条件下漏电流小于20 μA;对~(241)Am 5.486 MeV α粒子的能量分辨(FWHM)为77.67 keV。 相似文献
63.
设计一电路,将彩色图象信息编码到黑白CRT的亮度之中,并将其写入液晶光阀,用白光读出,当编码合适时,读出的象颜色可与原图像一致。本文讨论了这一技术原理并进行了单液晶光阀彩色大屏幕投影的实验验证。 相似文献
64.
高层结构几何非线性分析的QR法 总被引:3,自引:1,他引:2
本文利用QR法分析高层建筑结构几何非线性问题,建立了新的计算格式。该法不仅未知量的数目少,精度高,而且输入简单,计算速度快,可以用微机分析复杂问题。 相似文献
65.
Yvon Maday Frédéric Magoulès 《Computer Methods in Applied Mechanics and Engineering》2007,196(8):1541-1553
In this paper an original variant of the Schwarz domain decomposition method is introduced for heterogeneous media. This method uses new optimized interface conditions specially designed to take into account the heterogeneity between the sub-domains on each sides of the interfaces. Numerical experiments illustrate the dependency of the proposed method with respect to several parameters, and confirm the robustness and efficiency of this method based on such optimized interface conditions. Several mesh partitions taking into account multiple cross points are considered in these experiments. 相似文献
66.
Markovian and semi-Markovian random processes are used to analyze the problem of optimal search for signals in a multichannel
communication system with arbitrarily distributed random outputs. The search efficiency factor is found in explicit form based
on state space merging, and a mathematical programming problem is set up to find a numerical suboptimal solution.
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 144–150, May–June 2007. 相似文献
67.
CIE TC8‐01 has adopted a new color appearance model: CIECAM021 replaces the CIECAM97s.2 The new model consists of a number of refinements and simplifications of the CIECAM97s color appearance model. This article describes further tests to the robustness of the forward and reverse modes. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 99–106, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20087 相似文献
68.
Jonas Sjberg Qinghua Zhang Lennart Ljung Albert Benveniste Bernard Delyon Pierre-Yves Glorennec Hkan Hjalmarsson Anatoli Juditsky 《Automatica》1995,31(12):1691-1724
A nonlinear black-box structure for a dynamical system is a model structure that is prepared to describe virtually any nonlinear dynamics. There has been considerable recent interest in this area, with structures based on neural networks, radial basis networks, wavelet networks and hinging hyperplanes, as well as wavelet-transform-based methods and models based on fuzzy sets and fuzzy rules. This paper describes all these approaches in a common framework, from a user's perspective. It focuses on what are the common features in the different approaches, the choices that have to be made and what considerations are relevant for a successful system-identification application of these techniques. It is pointed out that the nonlinear structures can be seen as a concatenation of a mapping form observed data to a regression vector and a nonlinear mapping from the regressor space to the output space. These mappings are discussed separately. The latter mapping is usually formed as a basis function expansion. The basis functions are typically formed from one simple scalar function, which is modified in terms of scale and location. The expansion from the scalar argument to the regressor space is achieved by a radial- or a ridge-type approach. Basic techniques for estimating the parameters in the structures are criterion minimization, as well as two-step procedures, where first the relevant basis functions are determined, using data, and then a linear least-squares step to determine the coordinates of the function approximation. A particular problem is to deal with the large number of potentially necessary parameters. This is handled by making the number of ‘used’ parameters considerably less than the number of ‘offered’ parameters, by regularization, shrinking, pruning or regressor selection. 相似文献
69.
Automated techniques for satellite imagery navigation and co-location are especially required for environmental monitoring activities intensively using satellite data. In this work are presented the results obtained after 2 years of operational use of the Subpixel Automatic Navigation of AVHRR (SANA) scheme. An automatic method for accuracy assessment of satellite navigation techniques, which permits a preliminary evaluation of their performances, dealing with a large collection of test images is also proposed. The navigation accuracy assessment, performed by using a selection of small islands as reference points, is discussed.Results achieved over more than 400 Advanced Very-High-Resolution Radiometer (AVHRR) scenes confirm that the SANA scheme is a very accurate one (computed mean navigation error is generally about one AVHRR pixel). Furthermore, because of its high processing speed, it can be considered a suitable tool for intensive satellite data processing in multitemporal analyses, especially required for environmental studies as well as for operational monitoring purposes. 相似文献
70.
Tree-based partitioning of date for association rule mining 总被引:1,自引:1,他引:0
The most computationally demanding aspect of Association Rule Mining is the identification and counting of support of the frequent sets of items that occur together sufficiently often to be the basis of potentially interesting rules. The task increases in difficulty with the scale of the data and also with its density. The greatest challenge is posed by data that is too large to be contained in primary memory, especially when high data density and/or low support thresholds give rise to very large numbers of candidates that must be counted. In this paper, we consider strategies for partitioning the data to deal effectively with such cases. We describe a partitioning approach which organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds.
Shakil Ahmed received a first class BSc (Hons) degree from Dhaka University, Bangladesh, in 1990; and an MSc (first class), also Dhaka University, in 1992. He received his PhD from The University of Liverpool, UK, in 2005. From 2000 onwards he is a member of the Data Mining Group at the Department of Computer Science of the University of Liverpool, UK. His research interests include data mining, Association Rule Mining and pattern recognition.
Frans Coenen has been working in the field of Data Mining for many years and has written widely on the subject. He received his PhD from Liverpool Polytechnic in 1989, after which he took up a post as a RA within the Department of Computer Science at the University of Liverpool. In 1997, he took up a lecturing post within the same department. His current Data Mining research interests include Association rule Mining, Classification algorithms and text mining. He is on the programme committee for ICDM'05 and was the chair for the UK KDD symposium (UKKDD'05).
Paul Leng is professor of e-Learning at the University of Liverpool and director of the e-Learning Unit, which is responsible for overseeing the University's online degree programmes, leading to degrees of MSc in IT and MBA. Along with e-Learning, his main research interests are in Data Mining, especially in methods of discovering Association Rules. In collaboration with Frans Coenen, he has developed efficient new algorithms for finding frequent sets and is exploring applications in text mining and classification. 相似文献