全文获取类型
收费全文 | 644篇 |
免费 | 108篇 |
国内免费 | 81篇 |
专业分类
电工技术 | 8篇 |
综合类 | 74篇 |
化学工业 | 3篇 |
金属工艺 | 2篇 |
机械仪表 | 19篇 |
建筑科学 | 29篇 |
矿业工程 | 12篇 |
能源动力 | 3篇 |
轻工业 | 1篇 |
水利工程 | 20篇 |
石油天然气 | 2篇 |
武器工业 | 3篇 |
无线电 | 69篇 |
一般工业技术 | 13篇 |
冶金工业 | 2篇 |
原子能技术 | 1篇 |
自动化技术 | 572篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 7篇 |
2021年 | 12篇 |
2020年 | 10篇 |
2019年 | 8篇 |
2018年 | 13篇 |
2017年 | 14篇 |
2016年 | 13篇 |
2015年 | 25篇 |
2014年 | 43篇 |
2013年 | 38篇 |
2012年 | 64篇 |
2011年 | 55篇 |
2010年 | 62篇 |
2009年 | 55篇 |
2008年 | 75篇 |
2007年 | 86篇 |
2006年 | 53篇 |
2005年 | 71篇 |
2004年 | 51篇 |
2003年 | 25篇 |
2002年 | 19篇 |
2001年 | 15篇 |
2000年 | 3篇 |
1999年 | 4篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1995年 | 3篇 |
排序方式: 共有833条查询结果,搜索用时 15 毫秒
1.
针对MooseFS元数据节点的单点故障问题,对MooseFS源码进行改造,为其增加一个热备的备元数据节点,并通过主备之间同步元数据,备节点回放操作日志等技术使得备元数据节点内存中的元数据时刻跟主元数据节点保持一致。当主元数据节点发生故障切换到备元数据节点后,备元数据节点无需从本地加载元数据即可快速接替主元数据节点对外提供服务。测试结果表明,备元数据节点本地和内存中的元数据均与主元数据节点保持一致,且故障恢复时间小于1 s。 相似文献
2.
AbstractThe demand for resources from dimension and crushed stone deposits causes the intensification of mining activities which involve conflicts of an environmental and social nature. Therefore, it is essential to recognise potential conflict locations and assess the accessibility of deposits explored provisionally or in detail from an environmental and social perspective. This information can be obtained thanks to the method for deposit assessment proposed in this article which uses tools available in geographical information systems and the multicriteria analysis in a form of the weighted sum method. Here, the deposits of dimension and crushed stones located within the area of Lower Silesia in Poland have been analysed. 相似文献
3.
随着重复数据删除次数的增加,系统中用于存储指纹索引的清单文件等元数据信息会不断累积,导致不可忽视的存储资源开销。因此,如何在不影响重复数据删除率的基础上,对重复数据删除过程中产生的元数据信息进行压缩,从而减小查重索引,是进一步提高重复数据删除效率和存储资源利用率的重要因素。针对查重元数据中存在大量冗余数据,提出了一种基于压缩近邻的查重元数据去冗算法Dedup2。该算法先利用聚类算法将查重元数据分为若干类,然后利用压缩近邻算法消除查重元数据中相似度较高的数据以获得查重子集,并在该查重子集上利用文件相似性对数据对象进行重复数据删除操作。实验结果表明,Dedup2可以在保持近似的重复数据删除比的基础上,将查重索引大小压缩50%以上。 相似文献
4.
Patricia Jiménez Juan C. Roldán Fernando O. Gallego Rafael Corchuelo 《Software》2020,50(12):2169-2192
RDFa, JSON-LD, Microdata, and Microformats allow to endow the data in HTML files with metadata tags that help software agents understand them. Unluckily, there are many HTML files that do not have any metadata tags, which has motivated many authors to work on proposals to synthesize them. But they have some problems: the authors either provide an overall picture of their designs without too many details on the techniques behind the scenes or focus on the techniques but do not describe the design of the software systems that support them; many of them cannot deal with data that are encoded using semistructured formats like forms, listings, or tables; and the few proposals that can work on tables can deal with horizontal listings only. In this article, we describe the design of a system that overcomes the previous limitations using a novel embedding approach that has proven to outperform four state-of-the-art techniques on a repository with randomly selected HTML files from 40 different sites. According to our experimental analysis, our proposal can achieve an F1 score that outperforms the others by 10.14% ; this difference was confirmed to be statistically significant at the standard confidence level. 相似文献
5.
随着三网融合的大力推进以及双向互动业务的大力开展,运营商使用原有简单的EPG不足以支撑开展更多的增值业务,不能主动为用户推荐节目,不能为运营商带来新的收入机会。作为重要的创新能力支撑系统,介绍了江苏有线智能导航平台的设计与应用,为相关广电运营商提供一定的设计参考。 相似文献
6.
7.
8.
9.
10.
A GPU-Accelerated In-Memory Metadata Management Scheme for Large-Scale Parallel File Systems 下载免费PDF全文
Driven by the increasing requirements of high-performance computing applications,supercomputers are prone to containing more and more computing nodes.Applications running on such a large-scale computing system are likely to spawn millions of parallel processes,which usually generate a burst of I/O requests,introducing a great challenge into the metadata management of underlying parallel file systems.The traditional method used to overcome such a challenge is adopting multiple metadata servers in the scale-out manner,which will inevitably confront with serious network and consistence problems.This work instead pursues to enhance the metadata performance in the scale-up manner.Specifically,we propose to improve the performance of each individual metadata server by employing GPU to handle metadata requests in parallel.Our proposal designs a novel metadata server architecture,which employs CPU to interact with file system clients,while offloading the computing tasks about metadata into GPU.To take full advantages of the parallelism existing in GPU,we redesign the in-memory data structure for the name space of file systems.The new data structure can perfectly fit to the memory architecture of GPU,and thus helps to exploit the large number of parallel threads within GPU to serve the bursty metadata requests concurrently.We implement a prototype based on BeeGFS and conduct extensive experiments to evaluate our proposal,and the experimental results demonstrate that our GPU-based solution outperforms the CPU-based scheme by more than 50%under typical metadata operations.The superiority is strengthened further on high concurrent scenarios,e.g.,the high-performance computing systems supporting millions of parallel threads. 相似文献