全文获取类型
收费全文 | 10143篇 |
免费 | 1385篇 |
国内免费 | 824篇 |
专业分类
电工技术 | 1914篇 |
综合类 | 1310篇 |
化学工业 | 836篇 |
金属工艺 | 201篇 |
机械仪表 | 558篇 |
建筑科学 | 603篇 |
矿业工程 | 419篇 |
能源动力 | 324篇 |
轻工业 | 175篇 |
水利工程 | 321篇 |
石油天然气 | 358篇 |
武器工业 | 89篇 |
无线电 | 961篇 |
一般工业技术 | 807篇 |
冶金工业 | 281篇 |
原子能技术 | 58篇 |
自动化技术 | 3137篇 |
出版年
2024年 | 34篇 |
2023年 | 121篇 |
2022年 | 272篇 |
2021年 | 318篇 |
2020年 | 331篇 |
2019年 | 345篇 |
2018年 | 310篇 |
2017年 | 376篇 |
2016年 | 429篇 |
2015年 | 477篇 |
2014年 | 621篇 |
2013年 | 641篇 |
2012年 | 722篇 |
2011年 | 813篇 |
2010年 | 586篇 |
2009年 | 646篇 |
2008年 | 641篇 |
2007年 | 727篇 |
2006年 | 565篇 |
2005年 | 472篇 |
2004年 | 417篇 |
2003年 | 327篇 |
2002年 | 293篇 |
2001年 | 239篇 |
2000年 | 220篇 |
1999年 | 221篇 |
1998年 | 228篇 |
1997年 | 170篇 |
1996年 | 128篇 |
1995年 | 122篇 |
1994年 | 88篇 |
1993年 | 87篇 |
1992年 | 54篇 |
1991年 | 51篇 |
1990年 | 37篇 |
1989年 | 51篇 |
1988年 | 36篇 |
1987年 | 27篇 |
1986年 | 22篇 |
1985年 | 9篇 |
1984年 | 13篇 |
1983年 | 17篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 10篇 |
1979年 | 5篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1963年 | 3篇 |
1962年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
52.
毕庶梅 《自动化与仪器仪表》2010,(2):66-67,70
可控串联补偿技术(TCSC)能很好的提高电压质量和电力系统的稳定性。本文提出了一种以负载电压作为控制变量,根据其与目标电压的差值,计算晶闸管触发脉冲的触发角,从而控制无功串补容量的控制方法,并在Matlab/Simulink环境中设计了仿真系统。结果表明该控制方法能很好的提高负载电压,改善系统的暂态稳定性,对无功串补控制技术有一定的适用性。 相似文献
53.
网络拓扑研究的一项重要内容是分析网络拓扑的特征并生成满足这些特征的拓扑图。拓扑图特征的dK序列分析技术是一种系统化的拓扑分析技术,它能够以不同的精度描述拓扑图的特征,随着d的增加,其生成的拓扑图能够在各种重要的拓扑度量方面越来越接近原始拓扑图,因而对因特网拓扑研究具有重要意义。dK序列分析技术的问题在于状态数较多,生成算法复杂,当d>2时没有直接的生成算法。本文提出了一种新的基于邻接图分布的拓扑图特征的序列分析技术:dM序列分析技术。与dK序列分析技术相比,dM序列分析技术具有状态数少、生成算法简单的优势,因此更适合于大规模拓扑图如因特网AS拓扑的研究。 相似文献
54.
邓小楚 《计算机光盘软件与应用》2011,(16)
文章提出了基于高速DSP芯片TMS320C5402实现正弦信号发生器的设计原理与方法,介绍了所设计的正弦信号发生器的硬件结构电路图和软件程序结构图。结合DSP硬件特性,通过使用泰勒级数展开法得到设定参数的正弦波波形输出,从而达到设计目的。 相似文献
55.
M. Duran Toksar? 《Information Sciences》2008,178(4):1189-1204
This paper presents the use of a Taylor series for fuzzy multiobjective linear fractional programming problems (FMOLFP). The Taylor series is a series expansion that a representation of a function. In the proposed approach, membership functions associated with each objective of fuzzy multiobjective linear fractional programming problem transformed by using a Taylor series are unified. Thus, the problem is reduced to a single objective. Practical applications and numerical examples are used in order to show the efficiency and superiority of the proposed approach. 相似文献
56.
Oliver Bimber Daisuke Iwai Gordon Wetzstein Anselm Grundhöfer 《Computer Graphics Forum》2008,27(8):2219-2245
This article focuses on real‐time image correction techniques that enable projector‐camera systems to display images onto screens that are not optimized for projections, such as geometrically complex, coloured and textured surfaces. It reviews hardware‐accelerated methods like pixel‐precise geometric warping, radiometric compensation, multi‐focal projection and the correction of general light modulation effects. Online and offline calibration as well as invisible coding methods are explained. Novel attempts in super‐resolution, high‐dynamic range and high‐speed projection are discussed. These techniques open a variety of new applications for projection displays. Some of them will also be presented in this report. 相似文献
57.
The statistical properties of the autoregressive (AR) distance between ARIMA processes are investigated. In particular, the asymptotic distribution of the squared AR distance and an approximation which is computationally efficient are derived. Moreover, the problem of time series clustering and classification is discussed and the performance of the AR distance is illustrated by means of some empirical applications. 相似文献
58.
A new likelihood based AR approximation is given for ARMA models. The usual algorithms for the computation of the likelihood of an ARMA model require O(n) flops per function evaluation. Using our new approximation, an algorithm is developed which requires only O(1) flops in repeated likelihood evaluations. In most cases, the new algorithm gives results identical to or very close to the exact maximum likelihood estimate (MLE). This algorithm is easily implemented in high level quantitative programming environments (QPEs) such as Mathematica, MatLab and R. In order to obtain reasonable speed, previous ARMA maximum likelihood algorithms are usually implemented in C or some other machine efficient language. With our algorithm it is easy to do maximum likelihood estimation for long time series directly in the QPE of your choice. The new algorithm is extended to obtain the MLE for the mean parameter. Simulation experiments which illustrate the effectiveness of the new algorithm are discussed. Mathematica and R packages which implement the algorithm discussed in this paper are available [McLeod, A.I., Zhang, Y., 2007. Online supplements to “Faster ARMA Maximum Likelihood Estimation”, 〈http://www.stats.uwo.ca/faculty/aim/2007/faster/〉]. Based on these package implementations, it is expected that the interested researcher would be able to implement this algorithm in other QPEs. 相似文献
59.
Zhen He X. Sean Wang Byung Suk Lee Alan C. H. Ling 《Knowledge and Information Systems》2008,15(1):31-54
Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic
pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is
that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of
offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength.
In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations
can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces
an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically,
given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond
to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of
the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations)
that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based
algorithm is highly efficient and effective in finding the minimum PP correlations.
Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems
optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University,
he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in
Computer Science from the Australian National University.
X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean
Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases
and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards.
His research interests include database systems, information security, data mining, and sensor data processing.
Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data
modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research,
Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor
at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences
as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal
review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology,
and Ph.D from Stanford University.
Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial
design theory, coding theory, sequence designs, and applications of design theory. 相似文献
60.