全文获取类型
收费全文 | 63328篇 |
免费 | 6511篇 |
国内免费 | 4398篇 |
专业分类
电工技术 | 4005篇 |
技术理论 | 11篇 |
综合类 | 7432篇 |
化学工业 | 8328篇 |
金属工艺 | 2064篇 |
机械仪表 | 3300篇 |
建筑科学 | 5082篇 |
矿业工程 | 1975篇 |
能源动力 | 2259篇 |
轻工业 | 4844篇 |
水利工程 | 1661篇 |
石油天然气 | 2235篇 |
武器工业 | 882篇 |
无线电 | 5522篇 |
一般工业技术 | 8075篇 |
冶金工业 | 3164篇 |
原子能技术 | 911篇 |
自动化技术 | 12487篇 |
出版年
2024年 | 330篇 |
2023年 | 1211篇 |
2022年 | 1674篇 |
2021年 | 2071篇 |
2020年 | 2256篇 |
2019年 | 2005篇 |
2018年 | 2051篇 |
2017年 | 2278篇 |
2016年 | 2457篇 |
2015年 | 2415篇 |
2014年 | 3511篇 |
2013年 | 4321篇 |
2012年 | 3986篇 |
2011年 | 4605篇 |
2010年 | 3498篇 |
2009年 | 3579篇 |
2008年 | 3691篇 |
2007年 | 4105篇 |
2006年 | 3670篇 |
2005年 | 3200篇 |
2004年 | 2658篇 |
2003年 | 2245篇 |
2002年 | 1841篇 |
2001年 | 1546篇 |
2000年 | 1312篇 |
1999年 | 1178篇 |
1998年 | 897篇 |
1997年 | 806篇 |
1996年 | 713篇 |
1995年 | 645篇 |
1994年 | 548篇 |
1993年 | 443篇 |
1992年 | 391篇 |
1991年 | 305篇 |
1990年 | 261篇 |
1989年 | 262篇 |
1988年 | 200篇 |
1987年 | 107篇 |
1986年 | 134篇 |
1985年 | 106篇 |
1984年 | 101篇 |
1983年 | 76篇 |
1982年 | 74篇 |
1981年 | 48篇 |
1980年 | 44篇 |
1979年 | 43篇 |
1978年 | 34篇 |
1977年 | 30篇 |
1964年 | 28篇 |
1955年 | 35篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
针对传统的差压密度计和压力式液位计分别存在可靠性不高、不适用于介质密度经常变化的场合的问题,设计了一种基于Freescale MC9S08AW60微控制器的智能力敏传感器,详细介绍了该传感器主要电路的设计。该智能传感器实现了数据采集、信号处理、数据通信和电流环输出式数模转换功能。实际应用表明,在-20~+80℃的工作温度范围内,密度测量精度可达±5kg/m3,液位测量不受悬浮液回流和液位波动的影响,很好地满足了工业现场的应用。 相似文献
92.
煤矿监控图像增强算法的分析与实现 总被引:1,自引:0,他引:1
针对煤矿井下粉尘多、光照差的恶劣环境使得矿井监控图像偏暗、对比度低、视觉效果差的特点,提出了一种基于小波变换和模糊理论的图像增强算法。该算法选择小波变换为工具分解图像,应用新的模糊隶属度和增强算子对高频信息进行模糊处理,利用直方图均衡化对低频信息进行处理,最后对图像进行重构。处理结果较好地增强了图像细节信息,从整体上改善了图像效果。 相似文献
93.
Hongfei Li 《国际强度与非线性控制杂志
》2012,22(8):875-891
》2012,22(8):875-891
Time‐delay systems described by coupled differential‐functional equations include as special cases many types of time‐delay systems and coupled differential‐difference systems with time delays. This article discusses the discretized Lyapunov–Krasovskii functional (LKF) method for the stability problem of coupled differential‐difference equations with multiple discrete and distributed delays. Through independently dividing every delay region that the plane regions consists in two delays to discretize LKF, the exponential stability conditions for coupled systems with multiple discrete and distributed delays are established based on a linear matrix inequality (LMI). The numerical examples show that the analysis limit of delay bound in which the systems are stable may be approached by our result. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
94.
The output feedback stabilization is considered for a class of nonlinear time-delay systems with inverse dynamics in this paper.An appropriate state observer is constructed for the unmeasurable system states in order to realize the control objective.By adopting the backstepping and Lyapunov-Krasovskii functional methods,a systematic design procedure for a memoryless output feedback control law is presented.It is shown that the designed controller can make the closed-loop system globally asymptotically stable while keeping all signals bounded.An illustrative example is discussed to show the effectiveness of the proposed control strategy. 相似文献
95.
This paper is concerned with the neutral‐delay‐dependent and discrete‐delay‐dependent stability for uncertain neutral systems with mixed delays and norm‐bounded uncertainties. Through constructing a new augmented Lyapunov‐Krasovskii functional and proving its positive definiteness, introducing some slack matrices and using integral inequality, the improved delay‐dependent stability criteria are derived in terms of linear matrix inequalities. Numerical examples are given to illustrate the significant improvement on the conservatism of the delay bound over some existing results. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society 相似文献
96.
In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future. 相似文献
97.
本文讨论非嵌套信息结构的递阶队决策问题和控制均享信息结构的LQG分散控制问题,文中首先证明这两类问题的信息结构都是“部分控制嵌入”的,进而给出最优策略(或控制)存在的充要条件和当此条件成立时最优策略(或控制)的表达式。 相似文献
98.
Information theory offers a means for analyzing some constraints on the reading and copying process in Old English. Entropy for strings of various lengths offers a baseline measure of the uncertainty involved in transmission of Old English texts, while avoiding the pitfalls of applying models of modern reading to early medieval practice. Analysis of lengthy prose and verse texts in Old English revealed uniformly high values for entropy at all string lengths. High entropies may be the result of the language's irregular orthography, poetic koiné, and several dialects and imply that the language may have been easy to write but difficult to read. The low redundancy of the language which its high entropy values indicate suggests that the reader of Old English played an enhanced role in decoding a text and may provide an explanation for the high variability in the transmission of Old English verse.Katherine O'Brien O 'Keeffe is Professor of English at Texas A&M University and a co-director of its Interdisciplinary Group for Historical Literary Study.William Rundell is Professor of Mathematics at Texas A&M University. 相似文献
99.
D. L. Wakefield 《International Journal of Thermophysics》1988,9(3):365-381
This paper is the final in a series of three viscosity and density studies of pure n-alkanes and selected binary and quaternary mixtures. A standard U-tube viscometer was used for viscosity measurements, and a Pyrex flask-type pycnometer was used for density determinations. Results are given here for pure alkane and selected binary mixtures of n-tetradecane + n-octane, for selected quaternary mixtures of n-hexadecane + n-dodecane + n-decane + n-hexane, and for pure and selected quaternary mixtures of n-hexadecane + n-dodecane + n-nonane + n-heptane at 303.16 and 308.16 K. The principle of congruence was tested, as was the Grunberg and Nissan equation, as they have been shown to be useful as prediction techniques for other n-alkane binary mixtures. Comparisons were made between the two groups of quaternary alkane mixtures and the binary n-tetradecane + n-octane mixtures of the same pseudo composition to understand better the dependence of mixture viscosities on the composition parameter. 相似文献
100.
Sidney C. Bailin 《Journal of Automated Reasoning》1988,4(3):269-286
We present a semi-decision algorithm for the unifiability of two set-theoretic formulas modulo -reduction. The algorithm is based on the approach developed by G. Huet for type theory, but requires additional measures because formulas in set theory are not all normalizable. We present the algorithm in an Ada-like pseudocode, and then prove two theorems that show the completeness and correctness of the procedure. We conclude by showing that -unification is not a complete quantifier substitution method for set theory-unlile first-order unification and first-order logic. In this respect set theory is similar to type theory (higher-order logic).This material is based upon work supported by the National Science Foundation under award number ISI-8560438. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation. 相似文献