全文获取类型
收费全文 | 32726篇 |
免费 | 4628篇 |
国内免费 | 3022篇 |
专业分类
电工技术 | 3840篇 |
技术理论 | 2篇 |
综合类 | 3751篇 |
化学工业 | 1325篇 |
金属工艺 | 493篇 |
机械仪表 | 2455篇 |
建筑科学 | 1710篇 |
矿业工程 | 654篇 |
能源动力 | 714篇 |
轻工业 | 3288篇 |
水利工程 | 723篇 |
石油天然气 | 1366篇 |
武器工业 | 394篇 |
无线电 | 2991篇 |
一般工业技术 | 2408篇 |
冶金工业 | 769篇 |
原子能技术 | 175篇 |
自动化技术 | 13318篇 |
出版年
2024年 | 186篇 |
2023年 | 543篇 |
2022年 | 986篇 |
2021年 | 1151篇 |
2020年 | 1298篇 |
2019年 | 1139篇 |
2018年 | 1062篇 |
2017年 | 1305篇 |
2016年 | 1368篇 |
2015年 | 1518篇 |
2014年 | 2121篇 |
2013年 | 2076篇 |
2012年 | 2525篇 |
2011年 | 2757篇 |
2010年 | 2124篇 |
2009年 | 2123篇 |
2008年 | 2147篇 |
2007年 | 2383篇 |
2006年 | 2025篇 |
2005年 | 1662篇 |
2004年 | 1326篇 |
2003年 | 1147篇 |
2002年 | 938篇 |
2001年 | 713篇 |
2000年 | 631篇 |
1999年 | 470篇 |
1998年 | 403篇 |
1997年 | 357篇 |
1996年 | 294篇 |
1995年 | 281篇 |
1994年 | 212篇 |
1993年 | 152篇 |
1992年 | 142篇 |
1991年 | 124篇 |
1990年 | 107篇 |
1989年 | 94篇 |
1988年 | 69篇 |
1987年 | 45篇 |
1986年 | 36篇 |
1985年 | 25篇 |
1984年 | 37篇 |
1983年 | 27篇 |
1982年 | 28篇 |
1981年 | 27篇 |
1980年 | 32篇 |
1979年 | 21篇 |
1978年 | 15篇 |
1963年 | 11篇 |
1961年 | 15篇 |
1959年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
R.P. Aguilera B.I. Godoy J.C. Agüero G.C. Goodwin J.I. Yuz 《International journal of control》2014,87(7):1339-1351
In this paper we present an identification algorithm for a class of continuous-time hybrid systems. In such systems, both continuous-time and discrete-time dynamics are involved. We apply the expectation-maximisation algorithm to obtain the maximum likelihood estimate of the parameters of a discrete-time model expressed in incremental form. The main advantage of this approach is that the continuous-time parameters can directly be recovered. The technique is particularly well suited to fast-sampling rates. As an application, we focus on a standard identification problem in power electronics. In this field, our proposed algorithm is of importance since accurate modelling of power converters is required in high- performance applications and for fault diagnosis. As an illustrative example, and to verify the performance of our proposed algorithm, we apply our results to a flying capacitor multicell converter. 相似文献
102.
Vertex-disjoint triangle sets (triangle sets for short) have been studied extensively. Many theoretical and computational results have been obtained. While the maximum triangle set problem can be viewed as the generalization of the maximum matching problem, there seems to be no parallel result to Berge's augmenting path characterization on maximum matching (C. Berge, 1957 [1]). In this paper, we describe a class of structures called triangle string, which turns out to be equivalent to the class of union of two triangle sets in a graph. Based on the concept of triangle string, a sufficient and necessary condition that a triangle set can be augmented is given. Furthermore, we provide an algorithm to determine whether a graph G with maximum degree 4 is a triangle string, and if G is a triangle string, we compute a maximum triangle set of it. Finally, we give a sufficient and necessary condition for a triangle string to have a triangle factor. 相似文献
103.
《Pattern recognition》2014,47(2):588-602
Fingerprint matching has emerged as an effective tool for human recognition due to the uniqueness, universality and invariability of fingerprints. Many different approaches have been proposed in the literature to determine faithfully if two fingerprint images belong to the same person. Among them, minutiae-based matchers highlight as the most relevant techniques because of their discriminative capabilities, providing precise results. However, performing a fingerprint identification over a large database can be an inefficient task due to the lack of scalability and high computing times of fingerprint matching algorithms.In this paper, we propose a distributed framework for fingerprint matching to tackle large databases in a reasonable time. It provides a general scheme for any kind of matcher, so that its precision is preserved and its time of response can be reduced.To test the proposed system, we conduct an extensive study that involves both synthetic and captured fingerprint databases, which have different characteristics, analyzing the performance of three well-known minutiae-based matchers within the designed framework. With the available hardware resources, our distributed model is able to address up to 400 000 fingerprints in approximately half a second. Additional details are provided at http://sci2s.ugr.es/ParallelMatching. 相似文献
104.
This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the affine sub-models and the hyper planes defining the partitions of the state-input regression. The existing identification methods present three main drawbacks which limit its effectiveness. First, most of them may converge to local minima in the case of poor initializations because they are based on the optimization using nonlinear criteria. Second, they use simple and ineffective techniques to remove outliers. Third, most of them assume that the number of sub-models is known a priori. To overcome these drawbacks, we suggest the use of the density-based spatial clustering of applications with noise(DBSCAN) algorithm. The results presented in this paper illustrate the performance of our methods in comparison with the existing approach. An application of the developed approach to an olive oil esterification reactor is also proposed in order to validate the simulation results. 相似文献
105.
Klaus Trangbaek 《Asian journal of control》2014,16(1):40-49
This paper deals with system identification for control of linear parameter varying systems. In practical applications, it is often important to be able to identify small plant changes in an incremental manner without shutting down the system and/or disconnecting the controller; unfortunately, closed‐loop system identification is more difficult than open‐loop identification. In this paper we prove that the so‐called Hansen scheme, a technique known from linear time‐invariant systems theory for transforming closed‐loop system identification problems into open‐loop‐like problems, can be extended to accommodate linear parameter varying systems as well. We investigate the identified subsystem's parameter dependency and observe that, under mild assumptions, the identified subsystem is affine in the parameter vector. Various identification methods are compared in direct and Hansen Scheme setups in simulation studies, and the application of the Hansen Scheme is seen to improve the identification performance. 相似文献
106.
针对目前字符编码方式众多的现状,应用软件如何更好的判断文件编码属于何种字符集,并将其正确的解码成为不容忽视的问题。针对Windows记事本不能正常显示"联通"二字的Bug进行分析,利用Winhex软件解析文件获得16进制编码,根据得到的编码分析误判原因,通过注释记事本IsTextUTF8函数对分析得到的误判原因进行证实,进一步找到了更多Windows记事本无法正常显示的汉字。 相似文献
107.
鲁兵 《电脑编程技巧与维护》2014,(14):127-127
阐述了中职学校美工设计课程在教学设置中存在的问题,提出了相应的观点,论述了在中职学校美工设计课程的定位,培养具有一定综合素质和一技之长的中职学生。同时指出了传统的的教学课程结构已经不适应当今社会对人才培养目标的需要,必须进行课程改革,以适应社会发展的需求。 相似文献
108.
109.
110.
为了从大规模语料中快速提取高频重复模式,以递增n-gram模型为基础,使用散列数据结构提取重复串,并提出了一种基于低频字符和层次剪枝的逐层剪枝算法,用于过滤低频垃圾字串,减少I/O读写次数。在此基础上,应用改进的字串排序算法,使字符串排序可在O(n)时间内完成,从而有效提高重复模式的提取效率。实验表明,该算法是一种有效的重复模式提取算法,其I/O读写次数同语料规模呈线性关系,远小于使用首字符进行语料划分的方法,能快速有效地从规模远大于内存容量的文本语料中提取重复模式,特别适合于大规模语料的高频重复模式提取,对以重复模式为基础的新词识别、术语抽取等具有重要的支撑作用。 相似文献