全文获取类型
收费全文 | 13918篇 |
免费 | 1149篇 |
国内免费 | 553篇 |
专业分类
电工技术 | 716篇 |
技术理论 | 1篇 |
综合类 | 897篇 |
化学工业 | 2660篇 |
金属工艺 | 694篇 |
机械仪表 | 863篇 |
建筑科学 | 911篇 |
矿业工程 | 369篇 |
能源动力 | 418篇 |
轻工业 | 993篇 |
水利工程 | 249篇 |
石油天然气 | 676篇 |
武器工业 | 87篇 |
无线电 | 1548篇 |
一般工业技术 | 1957篇 |
冶金工业 | 624篇 |
原子能技术 | 159篇 |
自动化技术 | 1798篇 |
出版年
2024年 | 48篇 |
2023年 | 248篇 |
2022年 | 361篇 |
2021年 | 552篇 |
2020年 | 461篇 |
2019年 | 377篇 |
2018年 | 433篇 |
2017年 | 465篇 |
2016年 | 383篇 |
2015年 | 521篇 |
2014年 | 663篇 |
2013年 | 863篇 |
2012年 | 814篇 |
2011年 | 825篇 |
2010年 | 794篇 |
2009年 | 702篇 |
2008年 | 662篇 |
2007年 | 713篇 |
2006年 | 702篇 |
2005年 | 579篇 |
2004年 | 413篇 |
2003年 | 459篇 |
2002年 | 542篇 |
2001年 | 436篇 |
2000年 | 357篇 |
1999年 | 367篇 |
1998年 | 326篇 |
1997年 | 287篇 |
1996年 | 252篇 |
1995年 | 195篇 |
1994年 | 165篇 |
1993年 | 117篇 |
1992年 | 102篇 |
1991年 | 82篇 |
1990年 | 63篇 |
1989年 | 49篇 |
1988年 | 44篇 |
1987年 | 28篇 |
1986年 | 32篇 |
1985年 | 11篇 |
1984年 | 25篇 |
1983年 | 11篇 |
1982年 | 10篇 |
1981年 | 15篇 |
1980年 | 18篇 |
1979年 | 7篇 |
1978年 | 5篇 |
1977年 | 7篇 |
1976年 | 12篇 |
1975年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
Metamerism phenomenon can be used in illuminant detection to ensure the accuracy of light source. A method based on Long‐, Middle‐, Short‐ wavelength cones(LMS) weighting algorithm to evaluate metamerism degree is proposed. The chromatic relationship between the degree of metamerism mismatch and the light source is studied. Herein, the consistency between the metameric indices (MIs) and CIE1976 L*a*b* color difference ranking is analyzed by SRCC, KRCC, PLCC and RMSE. A statistically sampling method to obtain practical LMS cone fundamentals to evaluate metamerism degree is employed. The analysis results obtained show that the method based on LMS weighting algorithm has good evaluation ability and stability in simulation experiments and statistically sampling experiments, which are in line with visual characteristics of human. Proposed method meets the requirements of selecting metameric pairs used in light source detection. The analysis results have certain guiding significance. 相似文献
22.
Wan Huan Wang Hui Scotney Bryan Liu Jun Ng Wing W. Y. 《Multimedia Tools and Applications》2020,79(39-40):29327-29352
Multimedia Tools and Applications - In many real-world classification problems there exist multiple subclasses (or clusters) within a class; in other words, the underlying data distribution is... 相似文献
23.
Haliza Abdul Aziz Noor Azeerah Abas Bonnie Tay Yen Ping Zainab Idris 《Journal of surfactants and detergents》2020,23(2):251-262
The technology for transesterification reactions between methyl esters and alcohols is well established by using classical homogeneous alkaline catalysts, which provide high conversion of methyl esters to specialty or nonindigenous esters. However, in certain products where the purity of the esters is of concern, the removal of homogeneous catalysts after the completion of the reaction is a challenge in terms of production cost and water footprint. Therefore, a study to investigate the potential of heterogeneous catalysts was conducted on reactions between methyl palmitate and triethanolamine. The degree of basicity and active surface area of calcium oxide (CaO), zinc oxide (ZnO), and magnesium oxide (MgO) were first characterized by using temperature-programmed desorption (TPD-CO2) and Brunauere–Emmett–Teller (BET), respectively. Among the metal oxides investigated, the CaO catalyst showed the best catalytic activity toward the transesterification process as it gave the highest conversion of methyl palmitate and yielded fatty esteramine compositions similar to the conventional homogeneous catalyst. The optimum transesterification condition by using the CaO catalyst utilized a lower vacuum system of approximately 200 mbar, which could minimize a considerable amount of energy consumption. Furthermore, low CaO dosage of 0.1% was able to give a conversion of 94.5% methyl ester and formed esteramine at 170 °C for 2 h. Therefore, the production of esterquats from esteramine may become more economically feasible through the methyl ester route by using the CaO catalyst, which can be recycled three times. 相似文献
24.
25.
Video transmission over IEEE 802.11e wireless networks still shows poor performance for large bandwidth demand and frequently changed environments. Thus, several enhancements of IEEE 802.11e were proposed. On the other hand, big frames and simultaneous sending of adjacent frames always cause packet dropping for buffer overflow. In the past, we proposed an IEEE 802.11e enhancement named DFAA and a content aware mechanism to solve the above problems. The motivation of this paper is to find a proper way to integrate these two mechanisms. A DFAA enhancement (DFAA-E) is proposed to make up the insufficiency of content aware mechanism. Experiments results show that the combination of DFAA-E and content aware mechanism improves the video decoded quality greatly. And its performance can be further enhanced by selecting the suitable settings of certain parameters. 相似文献
27.
Ye Wan Jun Tan Guangling Song Chuanwei Yan 《Metallurgical and Materials Transactions A》2006,37(7):2313-2316
The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that
the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting
finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before. 相似文献
28.
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. 相似文献
29.
30.