首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   53128篇
  免费   5625篇
  国内免费   3926篇
电工技术   4406篇
技术理论   10篇
综合类   7273篇
化学工业   1006篇
金属工艺   1957篇
机械仪表   6679篇
建筑科学   2789篇
矿业工程   2123篇
能源动力   606篇
轻工业   792篇
水利工程   1204篇
石油天然气   865篇
武器工业   1166篇
无线电   6940篇
一般工业技术   2680篇
冶金工业   2219篇
原子能技术   256篇
自动化技术   19708篇
  2024年   84篇
  2023年   568篇
  2022年   1148篇
  2021年   1391篇
  2020年   1504篇
  2019年   1037篇
  2018年   945篇
  2017年   1267篇
  2016年   1523篇
  2015年   1852篇
  2014年   3531篇
  2013年   3244篇
  2012年   4191篇
  2011年   4339篇
  2010年   3268篇
  2009年   3481篇
  2008年   3588篇
  2007年   4191篇
  2006年   3811篇
  2005年   3327篇
  2004年   2858篇
  2003年   2610篇
  2002年   1911篇
  2001年   1530篇
  2000年   1245篇
  1999年   842篇
  1998年   634篇
  1997年   533篇
  1996年   445篇
  1995年   360篇
  1994年   319篇
  1993年   196篇
  1992年   163篇
  1991年   116篇
  1990年   94篇
  1989年   94篇
  1988年   77篇
  1987年   40篇
  1986年   30篇
  1985年   32篇
  1984年   38篇
  1983年   33篇
  1982年   23篇
  1981年   15篇
  1980年   17篇
  1979年   16篇
  1965年   13篇
  1964年   14篇
  1963年   9篇
  1959年   9篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
针对目标估计过程需要大量人工参与、自动化程度低的问题,提出了基于数据质量评价的目标估计方法。利用目标数据质量评价方法,对不同传感器得到的目标数据质量进行科学、有效的测度和评价,并根据质量得分动态调整各数据源在目标估计过程中所占的权重,从而减少人工干预,提高目标估计效能。仿真试验结果证明了该方法的有效性。  相似文献   
2.
Recent generative adversarial networks (GANs) have yielded remarkable performance in face image synthesis. GAN inversion embeds an image into the latent space of a pretrained generator, enabling it to be used for real face manipulation. However, current inversion approaches for real faces suffer the dilemma of initialization collapse and identity loss. In this paper, we propose a hierarchical GAN inversion for real faces with identity preservation based on mutual information maximization. We first use a facial domain guaranteed initialization to avoid the initialization collapse. Furthermore, we prove that maximizing the mutual information between inverted faces and their identities is equivalent to minimizing the distance between identity features from inverted and original faces. Optimization for real face inversion with identity preservation is implemented on this mutual information-maximizing constraint. Extensive experimental results show that our approach outperforms state-of-the-art solutions for inverting and editing real faces, particularly in terms of face identity preservation.  相似文献   
3.
《工程爆破》2022,(4):78-84
介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。  相似文献   
4.
以智能反射面(intelligent reflecting surface,IRS)辅助的无线携能通信(simultaneous wireless information and power transfer,SWIPT)系统为背景,研究了该系统中基于能效优先的多天线发送端有源波束成形与IRS无源波束成形联合设计与优化方法。以最大化接收端的最小能效为优化目标,构造在发送端功率、接收端能量阈值、IRS相移等多约束下的非线性优化问题,用交替方向乘子法(alternating direction method of multipliers,ADMM)求解。采用Dinkelbach算法转化目标函数,通过奇异值分解(singular value decomposition,SVD)和半定松弛(semi-definite relaxation,SDR)得到发送端有源波束成形向量。采用SDR得到IRS相移矩阵与反射波束成形向量。结果表明,该系统显著降低了系统能量收集(energy harvesting,EH)接收端的能量阈值。当系统总电路功耗为?15 dBm时,所提方案的用户能效为300 KB/J。当IRS反射阵源数与发送天线数均为最大值时,系统可达最大能效。  相似文献   
5.
Hydrogen generation from renewable energy resources is considered as a suitable solution to solve the problems related to the energy sector and the reduction of greenhouse gases. The aim of this study is to provide an integrated framework for identifying suitable areas for the construction of wind farms to produce hydrogen. For this purpose, a combined method of Geographic Information System (GIS) and multi-criteria decision making (MCDM) has been used to locate the power plant in Yazd province. The GIS method in the present study consisted of two parts: constraints and criteria. The constraint section included areas that were unsuitable for the construction of wind farms to produce power and hydrogen. In the present study, various aspects such as physical, economic and environmental had been considered as constraints. In the criteria section, eight different criteria from technical aspects (including average wind speed, hydrogen production potential, land slope) and economic aspects (including distance to electricity grid, distance to urban areas, distance to road, distance to railway and distance to centers of High hydrogen consumption) had been investigated. The MCDM tool had been used to weigh the criteria and identify suitable areas. Analytic Hierarchy Process (AHP) technique was used for weighting the criteria. The results of AHP weighting method showed that economic criteria had the highest importance with a value of 0.681. The most significant sub-criterion was the distance to urban areas and the least significant sub-criterion was the distance to power transmission lines. The results of GIS-MCDM analysis had shown that the most proper areas were in the southern and central sectors of Yazd province. In addition, the feasibility of hydrogen production from wind energy had shown that this province had the capacity to generate hydrogen at the rate of 53.6–128.6 tons per year.  相似文献   
6.
With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.  相似文献   
7.
支承或连接构件对梁结构的动力学性能有至关重要影响,必须保证其在振动过程中不发生破坏或者失效。通过合理设计和布局附加弹性支承可以实现对这些重要连接构件所承受约束反力的控制。应用微分变换法推导含附加支承的梁结构支承约束反力及其对于附加支承位置和刚度的灵敏度表达式,并通过优化设计附加支承位置和刚度实现具有弹性约束端的简支梁结构各支承约束反力的平衡,可提高结构的动力学性能。  相似文献   
8.
传统的图像识别方法需要大量有标签样本进行训练,且模型训练难以达到稳定。针对这些问题,结合条件生成网络和信息最大化生成网络的结构优势建立了条件信息卷积生成网络(C-Info-DCGAN)。模型增加图像的类别信息和潜在信息作为输入数据,然后利用Q网络去更好地发挥类别信息和潜在信息对训练的引导作用,并且利用深度卷积网络来加强对图像特征的提取能力。实验结果表明,该方法能够加快模型训练收敛速度,并有效提高图像识别的准确率。  相似文献   
9.
针对当前基于深度学习的显著性检测算法缺少利用先验特征和边缘信息,且在复杂场景中难以检测出鲁棒性强的显著性区域的问题,提出了一种结合边缘特征,利用先验信息引导的全卷积神经网络显著性检测算法。该算法利用三种被经常用到的先验知识结合边缘信息形成先验图,通过注意力机制将提取的先验特征与深度特征有效融合,最终通过提出的循环卷积反馈优化策略迭代地学习改进显著性区域,从而产生更可靠的最终显著图预测。经过实验定性定量分析,对比证明了算法的可靠性。  相似文献   
10.
The construction of specialty groups in higher vocational colleges is in full swing. However, due to the cognitive bias and the lack of construction paradigm for reference, the construction of specialty groups is still in the period of "crossing the river by feeling the stones" with different opinions. There are some problems in the construction of specialty groups, such as unclear under- standing of the concept of specialty groups, unreasonable logic of groups, unclear construction of groups, and nonstandard manage- ment of groups. This paper describes the specific content of the construction of modern information technology specialty group based on the Sydney Agreement, hoping to form a reference paradigm for the construction of specialty group of similar colleges and universities.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号