收费全文 | 7140篇 |
免费 | 240篇 |
国内免费 | 28篇 |
电工技术 | 109篇 |
综合类 | 2篇 |
化学工业 | 1385篇 |
金属工艺 | 298篇 |
机械仪表 | 187篇 |
建筑科学 | 105篇 |
矿业工程 | 8篇 |
能源动力 | 340篇 |
轻工业 | 295篇 |
水利工程 | 61篇 |
石油天然气 | 15篇 |
无线电 | 1037篇 |
一般工业技术 | 1577篇 |
冶金工业 | 872篇 |
原子能技术 | 85篇 |
自动化技术 | 1032篇 |
2023年 | 72篇 |
2022年 | 135篇 |
2021年 | 188篇 |
2020年 | 172篇 |
2019年 | 165篇 |
2018年 | 258篇 |
2017年 | 215篇 |
2016年 | 210篇 |
2015年 | 120篇 |
2014年 | 223篇 |
2013年 | 429篇 |
2012年 | 258篇 |
2011年 | 351篇 |
2010年 | 251篇 |
2009年 | 298篇 |
2008年 | 265篇 |
2007年 | 220篇 |
2006年 | 217篇 |
2005年 | 169篇 |
2004年 | 134篇 |
2003年 | 135篇 |
2002年 | 136篇 |
2001年 | 124篇 |
2000年 | 110篇 |
1999年 | 102篇 |
1998年 | 235篇 |
1997年 | 171篇 |
1996年 | 120篇 |
1995年 | 137篇 |
1994年 | 110篇 |
1993年 | 133篇 |
1992年 | 109篇 |
1991年 | 97篇 |
1990年 | 83篇 |
1989年 | 76篇 |
1988年 | 72篇 |
1987年 | 74篇 |
1986年 | 87篇 |
1985年 | 105篇 |
1984年 | 96篇 |
1983年 | 96篇 |
1982年 | 78篇 |
1981年 | 60篇 |
1980年 | 49篇 |
1979年 | 45篇 |
1978年 | 48篇 |
1977年 | 62篇 |
1976年 | 82篇 |
1975年 | 43篇 |
1973年 | 37篇 |
In this paper, we propose to use Artificial Bee Colony (ABC) optimization to solve the joint mode selection, channel assignment, and power allocation (JMSCPA) problem to maximize system throughput and spectral efficiency. JMSCPA is a problem where the allocation of channel and power depends on the mode selection. Such problems require two step solution and are called bi-level optimization problems. As bi-level optimization increases the complexity and computational time, we propose a modified version of single-level ABC algorithm aided with the adaptive transmission mode selection algorithm to allocate the cellular, reuse, and dedicated modes to the DUs along with channel and power allocation based on the network traffic load scenarios. A single variable, represented by the users (CUs and DUs) is used to allocate mode selection, and channel allocation to solve the JMSCPA problem, leading to a simpler solution with faster convergence, and significant reduction in the computational complexity which scales linearly with the number of users. Further, the proposed solution avoids premature stagnation of conventional ABC into local minima by incorporating a modification in its update procedure. The efficacy of the ABC-aided approach, as compared to the results reported in the literature, is validated by extensive numerical investigations under different simulation scenarios.
相似文献Explosive growth of big data demands efficient and fast algorithms for nearest neighbor search. Deep learning-based hashing methods have proved their efficacy to learn advanced hash functions that suit the desired goal of nearest neighbor search in large image-based data-sets. In this work, we present a comprehensive review of different deep learning-based supervised hashing methods particularly for image data-sets suggested by various researchers till date to generate advanced hash functions. We categorize prior works into a five-tier taxonomy based on: (i) the design of network architecture, (ii) training strategy based on nature of data-set, (iii) the type of loss function, (iv) the similarity measure and, (v) the nature of quantization. Further, different data-sets used in prior works are reported and compared based on various challenges in the characteristics of images that are part of the data-sets. Lastly, different future directions such as incremental hashing, cross-modality hashing and guidelines to improve design of hash functions are discussed. Based on our comparative review, it has been observed that generative adversarial networks-based hashing models outperform other methods. This is due to the fact that they leverage more data in the form of both real world and synthetically generated data. Furthermore, it has been perceived that triplet-loss-based loss functions learn better discriminative representations by pushing similar patterns together and dis-similar patterns away from each other. This study and its observations shall be useful for the researchers and practitioners working in this emerging research field.
相似文献