全文获取类型
收费全文 | 156篇 |
免费 | 9篇 |
国内免费 | 21篇 |
专业分类
电工技术 | 16篇 |
综合类 | 11篇 |
化学工业 | 19篇 |
金属工艺 | 13篇 |
机械仪表 | 16篇 |
建筑科学 | 5篇 |
矿业工程 | 1篇 |
能源动力 | 3篇 |
轻工业 | 17篇 |
石油天然气 | 13篇 |
无线电 | 40篇 |
一般工业技术 | 10篇 |
冶金工业 | 7篇 |
自动化技术 | 15篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 10篇 |
2021年 | 17篇 |
2020年 | 8篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 3篇 |
2016年 | 4篇 |
2015年 | 9篇 |
2014年 | 4篇 |
2013年 | 17篇 |
2012年 | 15篇 |
2011年 | 6篇 |
2010年 | 14篇 |
2009年 | 5篇 |
2008年 | 6篇 |
2007年 | 8篇 |
2006年 | 9篇 |
2005年 | 5篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2001年 | 1篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1987年 | 1篇 |
排序方式: 共有186条查询结果,搜索用时 15 毫秒
1.
Electronic Commerce Research - We consider a platform providing free content for users and earning profit from the sale of advertising. The platform can collect and analyze personal data to... 相似文献
2.
3.
4.
采用缓冲溶液法制备出NiO—GDC复合粉末,该粉末压制、烧结后再经氰气气氛还原得到Ni—GDC金属陶瓷阳极。使用XRD,TEM,SEM对NiO—GDC和Ni—GDC的物相、形貌进行了观察分析,测定了阳极还原前后的相对密度、总孔隙率及开孔隙率。实验结果表明,由于NiO转变为Ni,有O的火上,使得还原后试样的相对密度明显下降,而孔隙率由15.4%提高到29.6%,且开孔隙率达到23.1%,可满足阳极作为燃料扩散通道的作用。多孔结构的Ni—GDC金属陶瓷阳檄有望成为中混固体氧化物燃料电池的阳极材料。 相似文献
5.
6.
Bing Zheng Yuchen Yue Jianling Ni Xucong Zhou Yongrui He Xiaoman Gui Han Shen Yanan Jing Jince Zhao Jianqi Zhang Yuan Zhang Jingxia Wang Lei Jiang Lijun Huo 《Advanced functional materials》2023,33(28):2300981
With the development of organic solar cells (OSCs), the high-performance and stable batch variance are becoming a new challenge for designing polymer donors. To obtain high photovoltaic performance, adopting polymers with high molecular weight as donors is an ordinary strategy. However, the high molecular weight need to subtly control the reaction time and state, inevitably caused batch-to-batch variations. Herein, a strategy of steric effect is applied to benzodifuran (BDF)-based polymer by introducing different positions of Cl atom, producing two polymers PBDFCl-1 and PBDFCl-2. The more twisted side chains conformation not only achieve the control of moderate molecular weight for PBDFCl-2, but also easily form molecular stacking through adopting BDF unit and maintain sufficient polymeric crystallinity. Due to the optimized stacking mode and good blend miscibility, PBDFCl-2-based device exhibitsa more elegant power conversion efficiency (PCE) of 17.00% compared to PBDFCl-1-based device. This is the highest efficiency record for BDF-based binary OSCs. Meanwhile, the PCE device variation of the different molecular weights for PBDFCl-2 is little, indicating the reduction of the batch variation. Therefore, smartly using steric effect of Cl atom in strong crystalline BDF unit can form efficient molecular stacking regulations and realize the coordination of high-performance and stable batch variance. 相似文献
7.
Yongrui?QinEmail author Quan?Z.?Sheng Nickolas?J.?G.?Falkner Lina?Yao Simon?Parkinson 《World Wide Web》2017,20(5):915-937
Since today’s real-world graphs, such as social network graphs, are evolving all the time, it is of great importance to perform graph computations and analysis in these dynamic graphs. Due to the fact that many applications such as social network link analysis with the existence of inactive users need to handle failed links or nodes, decremental computation and maintenance for graphs is considered a challenging problem. Shortest path computation is one of the most fundamental operations for managing and analyzing large graphs. A number of indexing methods have been proposed to answer distance queries in static graphs. Unfortunately, there is little work on answering such queries for dynamic graphs. In this paper, we focus on the problem of computing the shortest path distance in dynamic graphs, particularly on decremental updates (i.e., edge deletions). We propose maintenance algorithms based on distance labeling, which can handle decremental updates efficiently. By exploiting properties of distance labeling in original graphs, we are able to efficiently maintain distance labeling for new graphs. We experimentally evaluate our algorithms using eleven real-world large graphs and confirm the effectiveness and efficiency of our approach. More specifically, our method can speed up index re-computation by up to an order of magnitude compared with the state-of-the-art method, Pruned Landmark Labeling (PLL). 相似文献
8.
9.
10.