全文获取类型
收费全文 | 6974篇 |
免费 | 1027篇 |
国内免费 | 559篇 |
专业分类
电工技术 | 444篇 |
技术理论 | 1篇 |
综合类 | 182篇 |
化学工业 | 654篇 |
金属工艺 | 225篇 |
机械仪表 | 1385篇 |
建筑科学 | 255篇 |
矿业工程 | 28篇 |
能源动力 | 927篇 |
轻工业 | 440篇 |
水利工程 | 123篇 |
石油天然气 | 41篇 |
武器工业 | 9篇 |
无线电 | 1067篇 |
一般工业技术 | 1178篇 |
冶金工业 | 58篇 |
原子能技术 | 20篇 |
自动化技术 | 1523篇 |
出版年
2024年 | 52篇 |
2023年 | 264篇 |
2022年 | 475篇 |
2021年 | 495篇 |
2020年 | 471篇 |
2019年 | 406篇 |
2018年 | 277篇 |
2017年 | 358篇 |
2016年 | 462篇 |
2015年 | 364篇 |
2014年 | 482篇 |
2013年 | 575篇 |
2012年 | 876篇 |
2011年 | 730篇 |
2010年 | 463篇 |
2009年 | 491篇 |
2008年 | 204篇 |
2007年 | 341篇 |
2006年 | 335篇 |
2005年 | 129篇 |
2004年 | 36篇 |
2003年 | 28篇 |
2002年 | 26篇 |
2001年 | 37篇 |
2000年 | 26篇 |
1999年 | 26篇 |
1998年 | 11篇 |
1997年 | 7篇 |
1996年 | 8篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 17篇 |
1992年 | 16篇 |
1991年 | 5篇 |
1990年 | 4篇 |
1989年 | 5篇 |
1988年 | 10篇 |
1987年 | 22篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1979年 | 3篇 |
1951年 | 6篇 |
排序方式: 共有8560条查询结果,搜索用时 31 毫秒
81.
液体静压导轨支承油膜的有限元分析 总被引:9,自引:2,他引:9
介绍了液体静压导轨支承的设计,并对其油膜压力分布进行了研究.根据流体润滑理论及雷诺方程,构建了导轨油膜压力的数学物理模型,提出了运用有限元法进行油膜刚度及导轨承载能力的分析与计算方法.借助非线性有限元软件Marc对一个应用实例进行了分析与计算,得到油膜压力的分布云图和曲线,求解出了油膜刚度和导轨的承载能力.计算结果表明,该方法计算结果精确,可以满足设计要求. 相似文献
82.
83.
84.
85.
86.
This paper proposes a robust image hashing method in discrete Fourier domain that can be applied in such fields as image authentication and retrieval. In the pre-processing stage, image resizing and total variation based filtering are first used to regularize the input image. Then the secondary image is obtained by the rotation projection, and the robust frequency feature is extracted from the secondary image after discrete Fourier transform. More sampling points are chosen from the low- and middle-frequency component to represent the salient content of the image effectively, which is achieved by the non-uniform sampling. Finally, the intermediate sampling feature vectors are scrambled and quantized to produce the resulting binary hash securely. The security of the method depends entirely on the secret key. Experiments are conducted to show that the present method has satisfactory robustness against perceptual content-preserving manipulations and has also very low probability for collision of the hashes of distinct images. 相似文献
87.
Guanhua Yan 《Computer Networks》2013,57(2):540-555
In order to evade detection of ever-improving defense techniques, modern botnet masters are constantly looking for new communication platforms for delivering C&C (Command and Control) information. Attracting their attention is the emergence of online social networks such as Twitter, as the information dissemination mechanism provided by these networks can naturally be exploited for spreading botnet C&C information, and the enormous amount of normal communications co-existing in these networks makes it a daunting task to tease out botnet C&C messages.Against this backdrop, we explore graph-theoretic techniques that aid effective monitoring of potential botnet activities in large open online social networks. Our work is based on extensive analysis of a Twitter dataset that contains more than 40 million users and 1.4 billion following relationships, and mine patterns from the Twitter network structure that can be leveraged for improving efficiency of botnet monitoring. Our analysis reveals that the static Twitter topology contains a small-sized core sugraph, after removing which, the Twitter network breaks down into small connected components, each of which can be handily monitored for potential botnet activities. Based on this observation, we propose a method called Peri-Watchdog, which computes the core of a large online social network and derives the set of nodes that are likely to pass botnet C&C information in the periphery of online social network. We analyze the time complexity of Peri-Watchdog under its normal operations. We further apply Peri-Watchdog on the Twitter graph injected with synthetic botnet structures and investigate the effectiveness of Peri-Watchdog in detecting potential C&C information from these botnets.To verify whether patterns observed from the static Twitter graph are common to other online social networks, we analyze another online social network dataset, BrightKite, which contains evolution of social graphs formed by its users in half a year. We show not only that there exists a similarly relatively small core in the BrightKite network, but also this core remains stable over the course of BrightKite evolution. We also find that to accommodate the dynamic growth of BrightKite, the core has to be updated about every 18 days under a constrained monitoring capacity. 相似文献
88.
将紧致格式与低阶格式结合,构造紧致格式的修正项,并将修正项加入到源项中进行求解,得到了一种基于非均分网格求解泊松方程的紧致修正法,且将该方法应用于二维和三维泊松方程的数值求解中。数值计算结果表明:紧致修正方法的精度高于经典方法的精度,但四阶紧致修正方法比二阶经典方法对网格的依赖性强。 相似文献
89.
90.
Because subjective evaluation is not adequate for assessing work in an automatic system, using an objective image fusion performance metric is a common approach to evaluate the quality of different fusion schemes. In this paper, a multi-resolution image fusion metric using visual information fidelity (VIF) is presented to assess fusion performance objectively. This method has four stages: (1) Source and fused images are filtered and divided into blocks. (2) Visual information is evaluated with and without distortion information in each block. (3) The visual information fidelity for fusion (VIFF) of each sub-band is calculated. (4) The overall quality measure is determined by weighting the VIFF of each sub-band. In our experiment, the proposed fusion assessment method is compared with several existing fusion metrics using the subjective test dataset provided by Petrovic. We found that VIFF performs better in terms of both human perception matching and computational complexity. 相似文献