全文获取类型
收费全文 | 47395篇 |
免费 | 5170篇 |
国内免费 | 2477篇 |
专业分类
电工技术 | 3346篇 |
技术理论 | 2篇 |
综合类 | 3159篇 |
化学工业 | 7512篇 |
金属工艺 | 2883篇 |
机械仪表 | 3498篇 |
建筑科学 | 3428篇 |
矿业工程 | 1537篇 |
能源动力 | 1752篇 |
轻工业 | 3425篇 |
水利工程 | 965篇 |
石油天然气 | 1980篇 |
武器工业 | 373篇 |
无线电 | 6021篇 |
一般工业技术 | 6356篇 |
冶金工业 | 2067篇 |
原子能技术 | 446篇 |
自动化技术 | 6292篇 |
出版年
2024年 | 182篇 |
2023年 | 875篇 |
2022年 | 1761篇 |
2021年 | 2417篇 |
2020年 | 1785篇 |
2019年 | 1476篇 |
2018年 | 1675篇 |
2017年 | 1700篇 |
2016年 | 1603篇 |
2015年 | 2131篇 |
2014年 | 2532篇 |
2013年 | 3057篇 |
2012年 | 3444篇 |
2011年 | 3529篇 |
2010年 | 3122篇 |
2009年 | 2936篇 |
2008年 | 2836篇 |
2007年 | 2490篇 |
2006年 | 2310篇 |
2005年 | 1924篇 |
2004年 | 1513篇 |
2003年 | 1521篇 |
2002年 | 1628篇 |
2001年 | 1459篇 |
2000年 | 1015篇 |
1999年 | 855篇 |
1998年 | 638篇 |
1997年 | 510篇 |
1996年 | 479篇 |
1995年 | 355篇 |
1994年 | 284篇 |
1993年 | 222篇 |
1992年 | 166篇 |
1991年 | 115篇 |
1990年 | 103篇 |
1989年 | 82篇 |
1988年 | 62篇 |
1987年 | 41篇 |
1986年 | 46篇 |
1985年 | 30篇 |
1984年 | 20篇 |
1983年 | 15篇 |
1982年 | 11篇 |
1981年 | 21篇 |
1980年 | 15篇 |
1979年 | 11篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 10篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
991.
在极端天气情况下,风电功率会在短时间尺度内发生大幅度的变化,出现风电功率高风险爬坡事件,严重威胁电力系统的安全稳定运行。开展爬坡备用的需求评估,有助于减小风电出力波动和预测误差对电网运行带来的不利影响。为保障高比例风电系统的备用充裕度,提出一种基于门控循环单元和非参数核密度估计法的组合区间爬坡备用需求预测方法。首先,将风电功率实际数据和日前预测数据构建成多变量时间序列,基于门控循环单元(gate recurrent unit,GRU)模型提高预测结果的准确度。进而,采用非参数核密度估计方法对风电功率预测误差进行置信区间估计,得出给定置信区间下的风电功率预测区间。最后,根据区间预测结果,预测爬坡事件并提取爬坡特征量,建立爬坡备用需求评估模型,评估得出爬坡备用容量需求。基于西北某省级电网的数据开展了算例测试,验证了所提方法的有效性。 相似文献
992.
993.
994.
腹部CT图像肝脏肿瘤分割是进行肝脏疾病诊断、手术规划和放射治疗的重要前提。针对肝脏肿瘤灰度异质、纹理丰富、边界模糊等因素引起的分割困难,该文提出基于级联Dense-Unet和图割的自动精确鲁棒分割方法。首先运用级联的Dense-UNet获取肝脏肿瘤初始分割结果及感兴趣区域,然后利用图像像素级和区域级特征,分别构建可有效区分肿瘤与非肿瘤的灰度模型和概率模型,并将其融入图割能量函数,进一步精确分割感兴趣区域中的肿瘤组织。最后分别采用LiTS和3Dircadb公共数据库作为训练集与测试集进行实验,并与现有多种自动分割方法进行了比较。结果表明,提出方法可有效分割CT图像中灰度、形状、大小、位置各异的肝脏肿瘤,能提取更精确的肿瘤边界,尤其对于对比度低、边界模糊的肿瘤具有明显优势。 相似文献
995.
Ye Liang Yan Susu Zhen Jialing Han Tian Ferdinando Hany Seppänen Tapio Alasaarela Esko 《Mobile Networks and Applications》2022,27(4):1688-1699
Mobile Networks and Applications - In recent years, physical violence detection has become a research hotspot in the area of human activity recognition. With the improvement and full coverage of... 相似文献
996.
Hongkyu Eoh Youngdoo Jung Chanho Park Chang Eun Lee Tae Hyun Park Han Sol Kang Seungbae Jeon Du Yeol Ryu June Huh Cheolmin Park 《Advanced functional materials》2022,32(1):2103697
Structural color (SC) arising from a periodically ordered self-assembled block copolymer (BCP) photonic crystal (PC) is useful for reflective-mode sensing displays owing to its capability of stimuli-responsive structure alteration. However, a set of PC inks, each providing a precisely addressable SC in the full visible range, has rarely been demonstrated. Here, a strategy for developing BCP PC inks with tunable structures is presented. This involves solution-blending of two lamellar-forming BCPs with different molecular weights. By controlling the mixing ratio of the two BCPs, a thin 1D BCP PC film is developed with alternating in-plane lamellae whose periodicity varies linearly from ≈46 to ≈91 nm. Subsequent preferential swelling of one-type lamellae with either solvent or non-volatile ionic liquid causes the photonic band gap of the films to red-shift, giving rise to full-visible-range SC correlated with the pristine nanostructures of the blended films in both liquid and solid states. The BCP PC palette of solution-blended binary solutions is conveniently employed in various coating processes, allowing facile development of BCP SC on the targeted surface. Furthermore, full-color SC paintings are realized with their transparent PC inks, facilitating low-power pattern encryption. 相似文献
997.
The Journal of Supercomputing - We argue the agent’s low generalization problem for searching target object in challenging visual navigation could be solved by "how" and... 相似文献
998.
Wang Ziheng Chen Heng Dong Xiaoshe Cai Weilin Kang Yan Zhang Xingjun 《The Journal of supercomputing》2022,78(9):12046-12069
The Journal of Supercomputing - MPI communication optimization is essential for high-performance applications. The communication performance models have made some achievements in improving the... 相似文献
999.
Link prediction has attracted wide attention among interdisciplinary researchers as an important issue in complex network. It aims to predict the missing links in current networks and new links that will appear in future networks. Despite the presence of missing links in the target network of link prediction studies, the network it processes remains macroscopically as a large connected graph. However, the complexity of the real world makes the complex networks abstracted from real systems often contain many isolated nodes. This phenomenon leads to existing link prediction methods not to efficiently implement the prediction of missing edges on isolated nodes. Therefore, the cold-start link prediction is favored as one of the most valuable subproblems of traditional link prediction. However, due to the loss of many links in the observation network, the topological information available for completing the link prediction task is extremely scarce. This presents a severe challenge for the study of cold-start link prediction. Therefore, how to mine and fuse more available non-topological information from observed network becomes the key point to solve the problem of cold-start link prediction. In this paper, we propose a framework for solving the cold-start link prediction problem, a joint-weighted symmetric nonnegative matrix factorization model fusing graph regularization information, based on low-rank approximation algorithms in the field of machine learning. First, the nonlinear features in high-dimensional space of node attributes are captured by the designed graph regularization term. Second, using a weighted matrix, we associate the attribute similarity and first order structure information of nodes and constrain each other. Finally, a unified framework for implementing cold-start link prediction is constructed by using a symmetric nonnegative matrix factorization model to integrate the multiple information extracted together. Extensive experimental validation on five real networks with attributes shows that the proposed model has very good predictive performance when predicting missing edges of isolated nodes. 相似文献
1000.