首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   624篇
  免费   63篇
  国内免费   48篇
电工技术   4篇
综合类   74篇
化学工业   142篇
金属工艺   62篇
机械仪表   4篇
建筑科学   1篇
矿业工程   4篇
能源动力   4篇
轻工业   55篇
水利工程   1篇
石油天然气   3篇
武器工业   2篇
无线电   55篇
一般工业技术   49篇
冶金工业   19篇
原子能技术   1篇
自动化技术   255篇
  2024年   1篇
  2023年   6篇
  2022年   6篇
  2021年   14篇
  2020年   15篇
  2019年   5篇
  2018年   12篇
  2017年   19篇
  2016年   20篇
  2015年   26篇
  2014年   31篇
  2013年   25篇
  2012年   46篇
  2011年   49篇
  2010年   49篇
  2009年   42篇
  2008年   49篇
  2007年   42篇
  2006年   43篇
  2005年   24篇
  2004年   37篇
  2003年   26篇
  2002年   31篇
  2001年   22篇
  2000年   22篇
  1999年   20篇
  1998年   6篇
  1997年   6篇
  1996年   8篇
  1995年   9篇
  1994年   5篇
  1993年   2篇
  1992年   1篇
  1991年   2篇
  1990年   5篇
  1989年   2篇
  1987年   1篇
  1984年   2篇
  1983年   1篇
  1981年   1篇
  1976年   1篇
  1973年   1篇
排序方式: 共有735条查询结果,搜索用时 15 毫秒
1.
张娜  秦品乐  曾建潮  李启 《计算机应用》2019,39(6):1816-1823
针对在灰度图像着色领域中,传统算法信息提取率不高、着色效果不理想的问题,提出了基于密集神经网络的灰度图像着色算法,以实现改善着色效果,让人眼更好地观察图片信息的目的。利用密集神经网络的信息提取高效性,构建并训练了一个端到端的深度学习模型,对图像中的各类信息及特征进行提取。训练网络时与原图像进行对比,以逐渐减小网络输出结果的信息、分类等各类型的损失。训练完成后,只需向网络输入一张灰度图片,即可生成一张颜色饱满、鲜明逼真的彩色图片。实验结果表明,引入密集网络后,可有效改善着色过程中的漏色、细节信息损失、对比度低等问题,所提算法着色效果较基于VGG网络及U-Net、双流网络结构、残差网络(ResNet)等性能优异的先进着色算法而言取得了显著的改进。  相似文献   
2.
通过实验研究ZF6铅玻璃在~(60)Co放射源相同剂量率不同累积剂量照射下透光率的变化规律。将辐照后的铅玻璃在室外阳光下、室内自然光下和不透光的抽屉中放置观察,发现阳光照射对铅玻璃辐照着色的恢复起着重要作用,在建立铅玻璃透光率随辐照时间变化的数学模型时,室内自然光对铅玻璃透光率的影响可忽略。实验数据验证了受辐照时铅玻璃透光率的变化与辐照时间符合指数函数关系。根据文献资料推导出铅玻璃透光率变化与光照时间为线性函数关系,但发现其与实验数据的符合程度较差,本文根据样条曲线插值法推导出铅玻璃透光率与光照时间为二次函数关系,与实验数据的符合效果较好。  相似文献   
3.
In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a new approach for solving graph coloring problem based on COA was presented. Since COA at first was presented for solving continuous optimization problems, in this paper we use the COA for the graph coloring problem, we need a discrete COA. Hence, to apply COA to discrete search space, the standard arithmetic operators such as addition, subtraction and multiplication existent in COA migration operator based on the distance's theory needs to be redefined in the discrete space. Redefinition of the concept of the difference between the two habitats as the list of differential movements, COA is equipped with a means of solving the discrete nature of the non-permutation. A set of graph coloring benchmark problems are solved and its performance is compared with some well-known heuristic search methods. The obtained results confirm the high performance of the proposed method.  相似文献   
4.
The effects of noncircular cross‐section (NCCS) poly ethylene terephthalate (PET) filaments and its shape factor on deep‐black‐coloring of dyed fabrics were investigated by comparing to that of the circular cross‐section PET ones. Indexes such as K/S, L* and Integ values were used for characterizing the deep‐black‐coloring effect on fabrics. The results indicated that fabrics made with NCCS PET filaments exhibited good deep‐black‐coloring effects. The calculated shape factor of the NCCS PET fiber had a significant correlation with the degree of deep‐black‐coloring exhibited by the fabric made from the fibers. A qualitative optical analysis of the NCCS PET fibers was carried out to explain the causes of the deep‐coloring of the NCCS fibers. This analysis implies that the contours of the NCCS fiber composed of surfaces with varied curvature increase the scattering of light by lowering specular reflection and increasing interior reflected and refracted light. This, in turn, strengthens the deep‐coloring effect. © 2013 Wiley Periodicals, Inc. Col Res Appl, 39, 511–518, 2014  相似文献   
5.
A 1-planar graph is a graph that can be drawn in the plane such that each edge is crossed by at most one other edge. In this paper we give an upper bound for the total chromatic number for 1-planar graphs with maximum degree at least 10.  相似文献   
6.
TA2纯钛材阳极氧化着色工艺   总被引:1,自引:0,他引:1  
对钛及钛合金进行阳极氧化处理可提高其作为生物医用材料的性能.将TA2纯钛片在磷酸、葡萄糖酸钠混合溶液中阳极氧化得到不同颜色的氧化膜,研究了电解液配方、阳极氧化工艺参数(电压、电流密度、氧化时间、电解液温度)、基材酸洗前处理以及氧化膜封孔后处理对氧化膜质量的影响.结果表明:磷酸浓度影响膜层的均匀性和颜色深浅,葡萄糖酸钠浓...  相似文献   
7.
在铝阳极氧化(AAO)膜表面,通过N,N'-二苯基丙二酰胺衍生物与取代苯基重氮盐的原位偶合反应,得到有色的取代苯偶氮N,N'-二苯基丙二酰胺衍生物,使AAO膜呈黄色.研究结果表明,氧化膜的制作工艺为:电流密度3~3.5A/dm2 (AC),温度25~35℃,时间为1h;偶合反应的条件为:DMF为溶剂,六氢吡啶为催化剂,...  相似文献   
8.
采用直流电解方法,在室温的0.2 mol/L NaOH作为基础电解液中,在LY12铝合金上制备了常用的伪装色橄榄绿膜,分析了着色电压和时间对着色膜性能的影响.结果表明,在槽压5 V和着色时间4 min时制备的橄榄绿膜层色泽均匀,具有良好的结合力、耐热性和耐蚀性,在盐酸中具有良好的时效耐蚀性能.  相似文献   
9.
The coloration of different polymer films (from commodity and packaging films to performance films) by contact with various food coloring substances was evaluated. For this purpose, both solubility parameters as a prediction tool, and immersion experiments for time range between 24 and 1000 h were established. The two predicting tools are the Hoy and Hoftyzer‐Van Krevelen (HVK) methods. For PE and PP, HVK's method is preferred for predicting coloration. Neither of the HVK's and Hoy's methods was able to establish a coloration prediction for PET while both methods could predict the staining of PEEK. The coloration of partially and fully fluorinated polymers is well predicted by the Hoy's method. The behavior of PP/PA and PP/PA/PP multilayer films was also studied. Crystallinity degree of polymers, temperature and concentration of coloring molecules are also important parameters, which are not taken into account in solubility theories. © 2013 Wiley Periodicals, Inc. J. Appl. Polym. Sci., 2013  相似文献   
10.
This paper proposes algorithms to coordinate a formation of mobile agents when the agents are not able to measure the relative positions of their neighbors, but only the distances to their respective neighbors. In this sense, less information is available to agents than is normally assumed in formation stabilization or station keeping problems. To control the shape of the formation, the solution advanced in the paper involves subsets of non-neighbor agents cyclically localizing the relative positions of their respective neighbor agents while these are held stationary, and then moving to reduce the value of a cost function which is nonnegative and assumes the zero value precisely when the formation has correct distances. The movement schedule is obtained by a novel vertex-coloring algorithm whose computation time is linear in the number of agents when implemented on the graphs of minimally rigid formations. Since in some formations, it may be that an agent is never allowed to be stationary (e.g. it is a fixed-wing aircraft), or because formations may be required to move as a whole in a certain direction, the results are extended to allow for cyclic localization of agents in this case. The tool used is the Cayley–Menger determinant.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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