全文获取类型
收费全文 | 132252篇 |
免费 | 13816篇 |
国内免费 | 8899篇 |
专业分类
电工技术 | 10566篇 |
技术理论 | 1篇 |
综合类 | 11717篇 |
化学工业 | 18374篇 |
金属工艺 | 8933篇 |
机械仪表 | 9485篇 |
建筑科学 | 10333篇 |
矿业工程 | 5122篇 |
能源动力 | 3667篇 |
轻工业 | 10854篇 |
水利工程 | 3397篇 |
石油天然气 | 6099篇 |
武器工业 | 1681篇 |
无线电 | 14968篇 |
一般工业技术 | 13139篇 |
冶金工业 | 5450篇 |
原子能技术 | 1765篇 |
自动化技术 | 19416篇 |
出版年
2024年 | 717篇 |
2023年 | 1988篇 |
2022年 | 4590篇 |
2021年 | 5941篇 |
2020年 | 4471篇 |
2019年 | 3386篇 |
2018年 | 3735篇 |
2017年 | 4217篇 |
2016年 | 3841篇 |
2015年 | 6004篇 |
2014年 | 7275篇 |
2013年 | 8560篇 |
2012年 | 10115篇 |
2011年 | 10741篇 |
2010年 | 9929篇 |
2009年 | 9688篇 |
2008年 | 9554篇 |
2007年 | 9295篇 |
2006年 | 8166篇 |
2005年 | 6898篇 |
2004年 | 4762篇 |
2003年 | 3685篇 |
2002年 | 3438篇 |
2001年 | 3039篇 |
2000年 | 2508篇 |
1999年 | 1940篇 |
1998年 | 1156篇 |
1997年 | 1024篇 |
1996年 | 892篇 |
1995年 | 728篇 |
1994年 | 595篇 |
1993年 | 445篇 |
1992年 | 345篇 |
1991年 | 272篇 |
1990年 | 226篇 |
1989年 | 200篇 |
1988年 | 149篇 |
1987年 | 92篇 |
1986年 | 87篇 |
1985年 | 39篇 |
1984年 | 40篇 |
1983年 | 17篇 |
1982年 | 25篇 |
1981年 | 23篇 |
1980年 | 32篇 |
1979年 | 21篇 |
1978年 | 9篇 |
1976年 | 7篇 |
1959年 | 15篇 |
1951年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
计算机基础课的教学,从内容、方法到手段不断改进,但缺乏灵活、有效的教学测评方法。参加计算机基础等级考试的师生,如何在考前能够快速、准确了解教学效果并及时发现存在的问题,有针对性地做好考前辅导工作。依据粗糙集理论中条件属性对决策属性重要性的不同,确定对考试结果有重要影响的教学内容。知识约简的信息论观点包含了知识约简的代数观点[1],利用信息熵计算属性重要性,通过对属性重要性分析,为今后的教学重点供了理论依据。 相似文献
952.
随着构件技术在软件开发中的广泛应用,人们对构件化软件系统质量的要求也在不断提高。该文运用模型检验技术进行接口变异测试的相关研究工作。该文首先详细介绍了基于模型检验技术的变异测试的基本原理,随后通过对构件集成时接口之间的交互关系进行分析后,提出了通过构造接口函数调用关系模型进行基于模型检验的接口变异测试方法。最后,通过实例进行了对JavaBean构件的接口测试用例的自动生成。 相似文献
953.
This paper focuses on the observer design for nonlinear discrete‐time systems by means of nonlinear observer canonical form. At first, sufficient and necessary conditions are obtained for a class of autonomous nonlinear discrete‐time systems to be immersible into higher dimensional observer canonical form. Then a method called dynamic observer error linearization is developed. By introducing a dynamic auxiliary system, the augmented system is shown to be locally equivalent to the generalized observer form, whose nonlinear terms contain auxiliary states and output of the system. A constructive algorithm is also provided to obtain the state coordinate transformation. These results are an extension of their counterparts of nonlinear continuous‐time systems to nonlinear discrete‐time systems (Syst. Control Lett. 1986; 7 :133–142; SIAM. J. Control Optim. 2003; 41 :1756–1778; Int. J. Control 2004; 77 :723–734; Automatica 2006; 42 :321–328; IEEE Trans. Automat. Control 2007; 52 :83–88; IEEE Trans. Automat. Control 2004; 49 :1746–1750; Automatica 2006; 42 :2195–2200; IEEE Trans. Automat. Control 1996; 41 :598–603; Syst. Control Lett. 1997; 31 :115–128). Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
954.
This paper revisits the problem of delay‐dependent robust ?∞ filtering design for a class of continuous‐time polytopic linear systems with a time‐varying state delay. Based on a newly developed parameter‐dependent Lyapunov–Krasovskii functional combined with Projection Lemma and an improved free‐weighting matrix technique for delay‐dependent criteria, a new sufficient condition for robust ?∞ performance analysis is first derived and then the filter synthesis is developed by using a simple matrix inequality linearization technique. It is shown that the desired filters can be constructed by solving a set of linear matrix inequalities. Finally, two simulation examples are given to show the effectiveness and less conservatism of the proposed method in comparison with the existing approaches. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
955.
This paper investigates the problem of the absolute stability of Lur'e systems with a time‐varying delay. By considering the relationships among the time‐varying delay, its upper bound, and the difference between them, less conservative delay‐dependent stability criteria are obtained and formulated in terms of linear matrix inequalities, without ignoring any useful terms in the derivative of a Lyapunov–Krasovskii functional. Numerical example shows that the results obtained in this paper are better than the previous results. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
956.
本文通过对ARP病毒欺骗的原理进行了分析,提出多种防御方法,可以有效的解决高校校园网的ARP欺骗问题。 相似文献
957.
Gradient based and least-squares based iterative identification algorithms are developed for output error (OE) and output error moving average (OEMA) systems. Compared with recursive approaches, the proposed iterative algorithms use all the measured input–output data at each iterative computation (at each iteration), and thus can produce highly accurate parameter estimation. The basic idea of the iterative methods is to adopt the interactive estimation theory: the parameter estimates relying on unknown variables are computed by using the estimates of these unknown variables which are obtained from the preceding parameter estimates. The simulation results confirm theoretical findings. 相似文献
958.
Sun Wen Lu Yan Wu Feng Li Shipeng Tardif John 《IEEE transactions on visualization and computer graphics》2010,16(1):57-69
In this paper, we propose a novel approach for high-dynamic-range (HDR) texture compression (TC) suitable for rendering systems of different capacities. Based on the previously proposed DHTC scheme, we first work out an improved joint-channel compression framework, which is robust and flexible enough to provide compressed HDR textures at different bit rates. Then, two compressed HDR texture formats based on the proposed framework are developed. The 8 bpp format is of near lossless visual quality, improving upon known state-of-the-art algorithms. And, to our knowledge, the 4 bpp format is the first workable 4 bpp solution with good quality. We also show that HDR textures in the proposed 4 bpp and 8 bpp formats can compose a layered architecture in the texture consumption pipeline, to significantly save the memory bandwidth and storage in real-time rendering. In addition, the 8 bpp format can also be used to handle traditional low dynamic range (LDR) RGBA textures. Our scheme exhibits a practical solution for compressing HDR textures at different rates and LDR textures with alpha maps. 相似文献
959.
Feng Feng Changxing Li B. Davvaz M. Irfan Ali 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2010,14(9):899-911
Theories of fuzzy sets and rough sets are powerful mathematical tools for modelling various types of uncertainty. Dubois and
Prade investigated the problem of combining fuzzy sets with rough sets. Soft set theory was proposed by Molodtsov as a general
framework for reasoning about vague concepts. The present paper is devoted to a possible fusion of these distinct but closely
related soft computing approaches. Based on a Pawlak approximation space, the approximation of a soft set is proposed to obtain
a hybrid model called rough soft sets. Alternatively, a soft set instead of an equivalence relation can be used to granulate
the universe. This leads to a deviation of Pawlak approximation space called a soft approximation space, in which soft rough
approximations and soft rough sets can be introduced accordingly. Furthermore, we also consider approximation of a fuzzy set
in a soft approximation space, and initiate a concept called soft–rough fuzzy sets, which extends Dubois and Prade’s rough
fuzzy sets. Further research will be needed to establish whether the notions put forth in this paper may lead to a fruitful
theory. 相似文献
960.