全文获取类型
收费全文 | 9107篇 |
免费 | 4篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 123篇 |
化学工业 | 228篇 |
金属工艺 | 280篇 |
机械仪表 | 44篇 |
建筑科学 | 27篇 |
能源动力 | 28篇 |
轻工业 | 14篇 |
水利工程 | 1篇 |
无线电 | 287篇 |
一般工业技术 | 90篇 |
冶金工业 | 49篇 |
原子能技术 | 84篇 |
自动化技术 | 7857篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 9篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 4篇 |
2017年 | 2篇 |
2016年 | 2篇 |
2015年 | 3篇 |
2014年 | 209篇 |
2013年 | 179篇 |
2012年 | 763篇 |
2011年 | 2270篇 |
2010年 | 1104篇 |
2009年 | 941篇 |
2008年 | 662篇 |
2007年 | 574篇 |
2006年 | 445篇 |
2005年 | 568篇 |
2004年 | 514篇 |
2003年 | 571篇 |
2002年 | 270篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1983年 | 1篇 |
1980年 | 2篇 |
1977年 | 1篇 |
1961年 | 1篇 |
排序方式: 共有9112条查询结果,搜索用时 9 毫秒
61.
This paper presents a gravity optimised particle filter (GOPF) where the magnitude of the gravitational force for every particle is proportional to its weight. GOPF attracts nearby particles and replicates new particles as if moving the particles towards the peak of the likelihood distribution, improving the sampling efficiency. GOPF is incorporated into a technique for hand features tracking. A fast approach to hand features detection and labelling using convexity defects is also presented. Experimental results show that GOPF outperforms the standard particle filter and its variants, as well as state-of-the-art CamShift guided particle filter using a significantly reduced number of particles. 相似文献
62.
Ran Zheng Qiongyao ZhangAuthor Vitae Hai JinZhiyuan ShaoAuthor Vitae Xiaowen FengAuthor Vitae 《Computers & Electrical Engineering》2014
Evolutionary trees are widely applied in various applications to show the inferred evolutionary relationships among species or entities. Neighbor-Joining is one solution for data-intensive and time-consuming evolutionary tree construction, with polynomial time complexity. However, its performance becomes poorer with the growth of massive datasets. Graphics Processing Units (GPUs) have brought about new opportunities for these time-consuming applications. Based on its high efficiency, a GPU-based parallel Neighbor-Joining method is proposed, and two efficient parallel mechanisms, data segmentation with asynchronous processing and the minimal chain model with bitonic sort, are put forward to speed up the processing. The experimental results show that an average speedup of 25.1 is achieved and even approximately 30 can be obtained with a sequence dataset ranging from 16,000 to 25,000. Moreover, the proposed parallel mechanisms can be effectively exploited in some other high performance applications. 相似文献
63.
Xin Xu Xiaolong ZhangAuthor VitaeHaidong FuAuthor Vitae Li ChenAuthor VitaeHong ZhangAuthor Vitae Xiaowei FuAuthor Vitae 《Computers & Electrical Engineering》2014
A robust autofocus system is a ubiquitous function in today’s mobile phone camera applications. However, due to the power consumption and size requirements, it is difficult for the autofocus function to be implemented into the design of mobile phone cameras. This paper presents a passive autofocus system with low computational complexity. This system uses a novel contrast measurement to determine degree of image sharpness, which can better reflect the information about image discontinuities. In order to gauge the performance of this measurement, a modified peak search strategy is used in the experiments. The experimental results from several typical image sequences validate the effectiveness of the proposed method. 相似文献
64.
Dayang SunAuthor Vitae Hongrun ZhangAuthor VitaeZhihong Qian 《Computers & Electrical Engineering》2014
Non-Line-of-Sight propagation of wireless signal has an impact on measured distances in range-based localization and will bias the final localization results. A new localization algorithm is proposed in this paper to mitigate Non-Line-of-Sight errors when there are more than enough anchor nodes deployed around the node to be located. This algorithm utilizes multi-round clustering analysis to filter the pre-located estimators which derive from all possible subsets of measured distances. In each round, the method density-based spatial clustering of applications with noise is adopted. Simulations show that the proposed algorithm can effectively improve localization accuracy not only when the measured distances with Non-Line-of-Sight error are minor but also under the condition that all of them suffer random Non-Line-of-Sight error. 相似文献
65.
In tiled Chip Multiprocessors (CMPs) last-level cache (LLC) banks are usually shared but distributed among the tiles. A static mapping of cache blocks to the LLC banks leads to poor efficiency since a block may be mapped away from the tiles actually accessing it. Dynamic policies either rely on the static mapping of blocks to a set of banks (D-NUCA) or rely on the OS to dynamically load pages to statically mapped addresses (first-touch). 相似文献
66.
The HUB-CI model is investigated in a telerobotic system in a client/server network to manage the lifecycle of engineering design and prototyping. The purpose of this platform is to support collaborative engineering design and proof of concept to enhance distributed team collaboration and resource utilization. The suggested platform is exemplified in two collaboration support tools and a physical prototyping platform. Structured Co-Insight Management is developed to support innovative idea exchanges and the consensus decision-making during the design process. Conflict/error detection management helps preventing conflicts and errors during the lifecycle of design and development. Physical collaboration over the network occurs when a team controls the telerobot operation during prototyping and testing in design cycles. A pilot system is implemented with a group project for the design of an electronic circuit (including both hardware and software designs). The functional assessment method is used to compare this platform to other collaborative design tools. The system presented offers unique qualitative advantages as an integrated collaboration support system. 相似文献
67.
68.
69.
An effective dual watermark scheme for image tamper detection and recovery is proposed in this paper. In our algorithm, each block in the image contains watermark of other two blocks. That is to say, there are two copies of watermark for each non-overlapping block in the image. Therefore, we maintain two copies of watermark of the whole image and provide second chance for block recovery in case one copy is destroyed. A secret key, which is transmitted along with the watermarked image, and a public chaotic mixing algorithm are used to extract the watermark for tamper recovery. By using our algorithm, a 90% tampered image can be recovered to a dim yet still recognizable condition (PSNR ). Experimental results demonstrate that our algorithm is superior to the compared techniques, especially when the tampered area is large. 相似文献
70.
Hugo Zanghi Author Vitae Christophe Ambroise Author Vitae 《Pattern recognition》2008,41(12):3592-3599
In the context of graph clustering, we consider the problem of simultaneously estimating both the partition of the graph nodes and the parameters of an underlying mixture of affiliation networks. In numerous applications the rapid increase of data size over time makes classical clustering algorithms too slow because of the high computational cost. In such situations online clustering algorithms are an efficient alternative to classical batch algorithms. We present an original online algorithm for graph clustering based on a Erd?s-Rényi graph mixture. The relevance of the algorithm is illustrated, using both simulated and real data sets. The real data set is a network extracted from the French political blogosphere and presents an interesting community organization. 相似文献