全文获取类型
| 收费全文 | 112篇 |
| 免费 | 15篇 |
| 国内免费 | 4篇 |
专业分类
| 电工技术 | 1篇 |
| 综合类 | 6篇 |
| 化学工业 | 2篇 |
| 金属工艺 | 2篇 |
| 矿业工程 | 1篇 |
| 能源动力 | 2篇 |
| 无线电 | 43篇 |
| 一般工业技术 | 1篇 |
| 自动化技术 | 73篇 |
出版年
| 2025年 | 1篇 |
| 2024年 | 1篇 |
| 2023年 | 3篇 |
| 2022年 | 11篇 |
| 2021年 | 5篇 |
| 2020年 | 6篇 |
| 2019年 | 5篇 |
| 2018年 | 6篇 |
| 2017年 | 9篇 |
| 2016年 | 8篇 |
| 2014年 | 9篇 |
| 2013年 | 9篇 |
| 2012年 | 10篇 |
| 2011年 | 12篇 |
| 2010年 | 12篇 |
| 2009年 | 13篇 |
| 2008年 | 3篇 |
| 2006年 | 2篇 |
| 2004年 | 1篇 |
| 2003年 | 1篇 |
| 2001年 | 1篇 |
| 1997年 | 1篇 |
| 1989年 | 1篇 |
| 1981年 | 1篇 |
排序方式： 共有131条查询结果，搜索用时 15 毫秒
41.
《Journal of Parallel and Distributed Computing》2006,66(9):1165-1180
The honeypot has emerged as an effective tool to provide insights into new attacks and exploitation trends. However, a single honeypot or multiple independently operated honeypots only provide limited local views of network attacks. Coordinated deployment of honeypots in different network domains not only provides broader views, but also create opportunities of early network anomaly detection, attack correlation, and global network status inference. Unfortunately, coordinated honeypot operation require close collaboration and uniform security expertise across participating network domains. The conflict between distributed presence and uniform management poses a major challenge in honeypot deployment and operation.To address this challenge, we present Collapsar, a virtual machine-based architecture for network attack capture and detention. A Collapsar center hosts and manages a large number of high-interaction virtual honeypots in a local dedicated network. To attackers, these honeypots appear as real systems in their respective production networks. Decentralized logical presence of honeypots provides a wide diverse view of network attacks, while the centralized operation enables dedicated administration and convenient event correlation, eliminating the need for honeypot expertise in every production network domain. Collapsar realizes the traditional honeyfarm vision as well as our new reverse honeyfarm vision, where honeypots act as vulnerable clients exploited by real-world malicious servers. We present the design, implementation, and evaluation of a Collapsar prototype. Our experiments with a number of real-world attacks demonstrate the effectiveness and practicality of Collapsar. 相似文献
42.
文章提出了一种基于静态分析木马文件信息的方法,对比分析木马PE文件和正常PE文件静态信息的不同,提取木马特征。通过否定选择算法对未知PE文件静态特征与木马特征进行匹配,从而判断该文件是否是木马文件。实验证明,该方法对未知木马检测效果明显。 相似文献
43.
44.
Geometric image re-ranking is a widely adopted phrase to refine the large-scale image retrieval systems built based upon popular paradigms such as Bag-of-Words (BoW) model. Its main idea can be treated as a sort of geometric verification targeting at reordering the initial returning list by previous similarity ranking metrics, e.g. Cosine distance over the BoW vectors between query image and reference ones. In the literature, to guarantee the re-ranking accuracy, most existing schemes requires the initial retrieval to be conducted by using a large vocabulary (codebook), corresponding to a high-dimensional BoW vector. However, in many emerging applications such as mobile visual search and massive-scale retrieval, the retrieval has to be conducted by using a compact BoW vector to accomplish the memory or time requirement. In these scenarios, the traditional re-ranking paradigms are questionable and new algorithms are urgently demanded. In this paper, we propose an accurate yet efficient image re-ranking algorithm specific for small vocabulary in aforementioned scenarios. Our idea is inspired by Hough Voting in the transformation space, where votes come from local feature matches. Most notably, this geometry re-ranking can easily been aggregated to the cutting-edge image based retrieval systems yielding superior performance with a small vocabulary and being able to store in mobile end facilitating mobile visual search systems. We further prove that its time complexity is linear in terms of the re-ranking instance, which is a significant advantage over the existing scheme. In terms of mean Average Precision, we show that its performance is comparable or in some cases better than the state-of-the-art re-ranking schemes. 相似文献
45.
针对无线传感器网络数据聚集查询的需求,提出了一种针对无线传感器网络网内聚集的多路径路由算法EOD。EOD算法综合考虑了节点剩余能量、偏移角度、节点间距离三个因素对无线传感器网络数据传输过程的能耗、时延的影响,在多路径结构的基础上,对传感器节点的所有的邻居节点进行综合评估,选择转发成本最小的几个邻居节点作为转发节点,从而在确保可靠性和性能的前提下最小化WSN能量消耗。仿真实验表明,适当地调整各影响因素的权值,EOD算法可以有效地延长网络生存期,减少数据包在网络中的时延,使整个传感器网络的节点剩余能量趋于均衡。 相似文献
46.
Chengyi Xia Shiwen Sun Feng Rao Junqing Sun Jinsong Wang Zengqiang Chen 《Frontiers of Computer Science in China》2009,3(3):361-365
We present a new epidemic Susceptible-Infected-Susceptible (SIS) model to investigate the spreading behavior on networks with
dynamical topology and community structure. Individuals in themodel are mobile agentswho are allowed to perform the inter-community
(i.e., long-range) motion with the probability p. The mean-field theory is utilized to derive the critical threshold (λ
C
) of epidemic spreading inside separate communities and the influence of the long-range motion on the epidemic spreading.
The results indicate that λ
C
is only related with the population density within the community, and the long-range motion will make the original disease-free
community become the endemic state. Large-scale numerical simulations also demonstrate the theoretical approximations based
on our new epidemic model. The current model and analysis will help us to further understand the propagation behavior of real
epidemics taking place on social networks. 相似文献
47.
48.
Ying-Yuan Xiao 《计算机科学技术学报》2010,25(3):523-536
In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites (database servers) which are interconnected through a high-speed wired network, and queries are issued by mobile units (laptop, cell phone, etc.) which access the data objects of database servers by wireless channels. The inherent properties of mobile computing environment such as mobility, limited wireless bandwidth, frequent disconnection, make skyline queries more complicated. We show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach, called efficient distributed skyline based on mobile computing (EDS-MC). In EDS-MC, a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication, network delay and query response time. We conduct extensive experiments in a simulated mobile database system, and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing. 相似文献
49.
50.
分析与研究公有链交易数据及系统用户行为对于保证公有链应用安全至关重要。比特币作为公有链的代表性应用,是一种基于P2P网络的电子现金系统。比特币交易地址具有匿名特征,无法关联到用户真实信息,这使得比特币溯源非常困难。为识别比特币中交易地址间的关联关系,推断出用户真实信息,提出一种基于交易网络的用户识别方法。对比特币区块数据进行预处理,通过解析比特币区块数据中的脚本信息,将比特币原始交易数据处理为更加直观的数据格式。衡量交易输入与输出地址间的相似程度,根据交易地址关联信息识别出比特币匿名地址对应的所有用户。在实验中应用真实的比特币区块数据,利用可视化方式对用户识别结果进行分析,结果表明该方法不受交易规则的限制,能对比特币匿名地址进行有效识别,且随着比特币区块数量的增加,识别准确率基本稳定于80%。 相似文献