全文获取类型
收费全文 | 87330篇 |
免费 | 14955篇 |
国内免费 | 10456篇 |
专业分类
电工技术 | 10817篇 |
技术理论 | 1篇 |
综合类 | 11394篇 |
化学工业 | 3691篇 |
金属工艺 | 2052篇 |
机械仪表 | 6762篇 |
建筑科学 | 2967篇 |
矿业工程 | 1577篇 |
能源动力 | 2088篇 |
轻工业 | 1556篇 |
水利工程 | 1569篇 |
石油天然气 | 2375篇 |
武器工业 | 1477篇 |
无线电 | 14113篇 |
一般工业技术 | 5994篇 |
冶金工业 | 1154篇 |
原子能技术 | 432篇 |
自动化技术 | 42722篇 |
出版年
2024年 | 638篇 |
2023年 | 1522篇 |
2022年 | 2902篇 |
2021年 | 3190篇 |
2020年 | 3491篇 |
2019年 | 2906篇 |
2018年 | 2869篇 |
2017年 | 3405篇 |
2016年 | 3867篇 |
2015年 | 4547篇 |
2014年 | 6181篇 |
2013年 | 5959篇 |
2012年 | 7374篇 |
2011年 | 7622篇 |
2010年 | 6092篇 |
2009年 | 6317篇 |
2008年 | 6472篇 |
2007年 | 7166篇 |
2006年 | 5747篇 |
2005年 | 4711篇 |
2004年 | 3863篇 |
2003年 | 3154篇 |
2002年 | 2462篇 |
2001年 | 1971篇 |
2000年 | 1685篇 |
1999年 | 1314篇 |
1998年 | 1053篇 |
1997年 | 868篇 |
1996年 | 691篇 |
1995年 | 519篇 |
1994年 | 463篇 |
1993年 | 350篇 |
1992年 | 318篇 |
1991年 | 175篇 |
1990年 | 205篇 |
1989年 | 158篇 |
1988年 | 110篇 |
1987年 | 50篇 |
1986年 | 56篇 |
1985年 | 49篇 |
1984年 | 42篇 |
1983年 | 42篇 |
1982年 | 34篇 |
1981年 | 18篇 |
1980年 | 25篇 |
1979年 | 14篇 |
1978年 | 11篇 |
1977年 | 10篇 |
1975年 | 12篇 |
1959年 | 10篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H∞ loop-shaping controller is compared with the traditional H∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H∞ loop shaping controller is suitable for real time implementation with good robust stability and performance. 相似文献
22.
Central force optimization (CFO) is an efficient and powerful population-based intelligence algorithm for optimization problems. CFO is deterministic in nature, unlike the most widely used metaheuristics. CFO, however, is not completely free from the problems of premature convergence. One way to overcome local optimality is to utilize the multi-start strategy. By combining the respective advantages of CFO and the multi-start strategy, a multi-start central force optimization (MCFO) algorithm is proposed in this paper. The performance of the MCFO approach is evaluated on a comprehensive set of benchmark functions. The experimental results demonstrate that MCFO not only saves the computational cost, but also performs better than some state-of-the-art CFO algorithms. MCFO is also compared with representative evolutionary algorithms. The results show that MCFO is highly competitive, achieving promising performance. 相似文献
23.
Fresh and frozen-thawed (F-T) pork meats were classified by Vis–NIR hyperspectral imaging. Eight optimal wavelengths (624, 673, 460, 588, 583, 448, 552 and 609 nm) were selected by successive projections algorithm (SPA). The first three principal components (PCs) obtained by principal component analysis (PCA) accounted for over 99.98% of variance. Gray-level-gradient co-occurrence matrix (GLGCM) was applied to extract 45 textural features from the PC images. The correct classification rate (CCR) was employed to evaluate the performance of the partial least squares-discriminate analysis (PLS-DA) models, by using (A) the reflected spectra at full wavelengths and (B) those at the optimal wavelengths, (C) the extracted textures based on the PC images, and (D) the fused variables combining spectra at the optimal wavelengths and textures. The results showed that the best CCR of 97.73% was achieved by applying (D), confirming the high potential of textures for fresh and F-T meat discrimination. 相似文献
24.
25.
马钢二烧结配料计算机控制系统 总被引:1,自引:0,他引:1
阐明了马钢二烧结配科计算机控制系统的目的、控制形式、控制原理;根据烧结配料控制对象的特点对信号采样和控制算法进行了探讨;提供了系统的主要硬件结构,软件功能和程序框图。 相似文献
26.
Namyong Kim 《ETRI Journal》2006,28(2):155-161
In this paper, we introduce an escalator (ESC) algorithm based on the least squares (LS) criterion. The proposed algorithm is relatively insensitive to the eigenvalue spread ratio (ESR) of an input signal and has a faster convergence speed than the conventional ESC algorithms. This algorithm exploits the fast adaptation ability of least squares methods and the orthogonalization property of the ESC structure. From the simulation results, the proposed algorithm shows superior convergence performance. 相似文献
27.
针对车用柴油酸度等性质测定过程繁琐,采用衰减全反射样品池测定车用柴油的红外光谱,用偏最小二乘法(PLS)建立红外光谱测定车用柴油酸度、密度、闪点和凝点的4个校正模型,验证标准误差分别为0.46 mg/(100 mL),0.77kg/m3,2.60 ℃,2.77 ℃,该方法符合标准方法再现性要求。与标准方法相比,该方法具有无需预处理、操作简单、测量快速、重复性好等优点。 相似文献
28.
基于进化算法的常减压装置模拟 总被引:1,自引:0,他引:1
提出了基于优选优生进化算法(Select—best and prepotency evolution algorithm,SPEA)的常减压装置模拟方法。以各塔的温度分布为目标,基于生产过程和分析数据,采用SPEA确定各塔板Murphree效率,从而精确描述各塔板平衡偏离程度。在实际应用中,获得具有良好精度的常减压装置模型。系统分析了SPEA算法的关键参数——优选领域大小与计算复杂性及寻优性能之间的关系,结果显示其取值为群体规模的10%最为合适。 相似文献
29.
在充分调研阵列声波测井分波提取方法的基础上,针对阿特拉斯公司的交叉多极子阵列声波测井(XMACⅡ)提供的单极波形信息,研究纵波时差提取及高分辨率处理方法。首先利用相关-互功谱法高精度地提取纵波时差,然后针对XMACⅡ仪器的接收阵列,研究组合子阵列的方法,形成共发射子阵列和共接收子阵列,最后利用子阵列对提取的纵波时差做高分辨率处理。处理现场实际测井资料,并将高分辨率处理成果与引进的eXpress软件处理成果、实测的国产高分辨率声波(纵波)测井曲线及岩心纵波时差对比分析,表明该方法提取的纵波时差曲线的纵向分辨率有很大提高,时差计算准确可靠,提取的单极纵波时差与国产高分辨率声波时差及岩心纵波时差的平均相对误差均小于7%。该方法具有较高的实用价值和广阔的应用前景。 相似文献
30.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献