检索结果-内蒙古大学图书馆

Dynamic Resource Allocation Based on User experience in Virtualized Servers

Procedia Engineering 2011年 15卷 3780-3784页

作者： Wei Zhang Jiajun Liu Ying Song Mingfa Zhu Limin Xiao Yuzhong Sun Li Ruan State Key Laboratory of Software Development Environment Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China Key Laboratory of Computer System and Architecture Chinese Academy of SciencesBeijing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Web workloads are known to vary dynamically with time which poses a challenge to resource allocation among the applications. In this paper, we argue that the existing dynamic resource allocation based on resource utilization has some drawbacks in virtualized servers. Dynamic resource allocation directly based on real-time user experience is more reasonable and also has practical significance. To address the problem, we propose a system architecture that combines real time measurements and analysis of user experience for resource allocation. We evaluate our proposal using Webbench. The experiment results show that these techniques can judiciously allocate system resources.

关键词： resource allocation virtualized servers user experience

来源：评论

学校读者我要写书评

暂无评论

Efficiently Inferring Top-k Elephant Flows based on Discrete Tensor Completion

Efficiently Inferring Top-k Elephant Flows based on Discrete...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Kun Xie Jiazheng Tian Xin Wang Gaogang Xie Jigang Wen Dafang Zhang College of Computer Science and Electronics Engineering Hunan University Changsha China Department of Electrical and Computer Engineering State University of New York at Stony Brook USA State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences

Finding top- k elephant flows is a critical task in network measurement, with applications such as congestion control, anomaly detection, and traffic engineering. Traditional top- k flow detection problem focuses on using a small amount of memory to measure the total number of packets or bytes of each flow. Instead, we study a challenging problem of inferring the top- k elephant flows in a practical system with incomplete measurement data as a result of sub-sampling for scalability or data missing. The recent study shows it is promising to more accurately interpolate the missing data with a 3-D tensor compared to that based on a 2-D matrix. Taking full advantage of the multilinear structures, we apply tensor completion to first recover the missing data and then find the top- k elephant flows. To reduce the computational overhead, we propose a novel discrete tensor completion model which uses binary codes to represent the factor matrices. Based on the model, we further propose three novel techniques to speed up the whole top- k flow inference process: a discrete optimization algorithm to train the binary factor matrices, bit operations to facilitate quick missing data inference, and simplifying the finding of top- k elephant flows with binary code partition. In our discrete tensor completion model, only one bit is needed to represent the entry in the factor matrices instead of a real value (32 bits) needed in traditional tensor completion model, thus the storage cost is reduced significantly. Extensive experiments using two real traces demonstrate that compared with the state of art tensor completion algorithms, our discrete tensor completion algorithm can achieve similar data inference accuracy using significantly smaller time and storage space.

关键词： Inference algorithms Binary codes Data models Partitioning algorithms Indexes Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A novel approach for mining important nodes in directed-weighted complex software network

引用

Journal of Computational Information Systems 2015年第8期11卷 3059-3071页

作者： Ren, Jiadong Wu, Hongfei Yin, Tengteng Bai, Lan Zhang, Bing College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China Hebei Institute of Foreign Languages Qinhuangdao China

If the software system is abstracted as a software network, its quality largely depends on the topology structure. A tiny fraction key function nodes play a critical role in improving the stability, reliability and robustness of complex software network. How to identify the top-k key nodes accurately and effectively becomes more and more significant both in theoretical and practical. In this paper, a novel approach based on semi-global information of mining top-k key nodes in directed-weighted complex software network is proposed. Firstly, we map the function and relationship of function calling or dependency to a directed function dependency network (DFDN). Secondly, an algorithm DFS-WEIGHT based on Depth-First-Search strategy is used to transform a DFDN into a directed-weighted function dependency network (DWFDN). Thirdly, we treat function nodes of DWFDN as two different roles - the caller or callee. Callers with high ability of accumulating vulnerabilities and callees with high ability of propagating vulnerabilities are considered as key nodes. Then, two metrics SABAC and SABPR are defined to measure the importance of callers and callees respectively. Finally, a Software Network Key Node miNing (SN-KNN) algorithm is proposed to mine most important callers and callees. Experimental results indicate that the algorithm SN-KNN is effective in mining key nodes. ©, 2015, Binary Information Press. All right reserved.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

Online Internet Anomaly Detection With High Accuracy: A Fast Tensor Factorization Solution

Online Internet Anomaly Detection With High Accuracy: A Fast...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Xiaocan Li Kun Xie Xin Wang Gaogang Xie Jigang Wen Guangxing Zhang Zheng Qin Department of Electrical and Computer Engineering State University of New York at Stony Brook USA College of Computer Science and Electronics Engineering Hunan University Changsha China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences

Traffic anomaly detection is critical for advanced Internet management. Existing detection algorithms usually work off-line and cannot timely detect anomalies. They also suffer from high cost for storage and computation. Although online and accurate traffic anomaly detection is very important, it very difficult to achieve. We propose to utilize tensor model to well exploit the multi-dimensional information hidden in the traffic data for more accurate online Internet anomaly detection. We decouple the tensor recovery problem to iteratively solve two sub problems, a tensor factorization sub-problem and an anomaly detection sub-problem. To reduce the high cost for computation and storage involved in tensor factorization, we propose two lightweight techniques to effectively derive factor matrices of tensor in the current window and iteration, taking advantage of tensor decomposition results of the previous window and iteration. We have done extensive experiments using two real traffic traces to compare with three tensor based algorithms and three matrix based algorithms. The experiment results demonstrate that our online anomaly detection algorithm can achieve the same anomaly detection accuracy as that of the best offline tensor based algorithm, but at 6100 times faster speed and with very low storage cost.

关键词： Anomaly detection Monitoring Matrix decomposition Microsoft Windows Principal component analysis Data models

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Mobile Model for DTN

引用

Chinese Journal of Electronics 2023年第4期18卷 635-638页

作者： Zhiting Lin Yugui Qu Yusheng Ji Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China Province Key Laboratory of Software in Computing and Communication Hefei China Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

Delay tolerant networks may become unexpectedly partitioned due to node mobility or variation in signal strength. However, most widely used models in some relative works are generally very simplistic. In order to exploit intelligent forwarding algorithms, a novel nodal mobile model of delay tolerant networks is presented to map reality with more accuracy. And several approaches are introduced to analyze the network structure, such as n-cliques, n-clans, degree, closeness and betweenness. Our research results showed that the centralizations became smaller when the wireless connections were concerned. It meant that quite a number of nodes became potential relays because of the new structure of networks.

关键词： Wireless communication Analytical models Wireless sensor networks Protocols Social networking (online) Sensitivity analysis Social network theory

来源：评论

学校读者我要写书评

暂无评论

FACET: PC-parallel architecture for cost-efficient telemetry processing

FACET: PC-parallel architecture for cost-efficient telemetry...

引用

IEEE Conference on Aerospace

作者： T. El-Ghazawi P. Chalermwat P. Piamsa-nga A. Ozkaya N. Speciale D. Wilson Computer Engineering and Computer Science Florida Institute of Technology Melbourne FL USA Parallel Architecture Laboratory Department of Electrical Engineering and Computer Science George Washington University Washington D.C. DC USA NASA Goddard Space Flight Center Greenbelt MD USA

NASA's Mission to Planet Earth (MTPE) is planning to launch the Earth Observing System (EOS) starting in 1998. The large number of planned remote sensing satellites will bring 500 Gigabytes of information per day. The EOS Data and Information System (EOSDIS) is responsible for ingesting and archiving this data. One important component of the EOSDIS system is the data operation, which involves extracting the packets and reconstructing and archiving the original remotely sensed data products. Due to transmission errors, the way data is sampled from the different sensors encoded, packets typically arrive out of order and perhaps with some of them missing or repeated. Many special hardware solutions have been proposed to solve this real-time problem. In this paper, we demonstrate a commercial off the shelf (COTS) solution. The hardware capitalizes on the progress made in the area of network of workstations (NOW), particularly PC-clusters. The software and algorithm exploit the data characteristics and parallelism in the telemetry stream to make use of load balancing and efficient parallel processing. It is shown that this solution can provide high-performance to cost and programmability.

关键词： Telemetry Earth Observing System Hardware Planets Remote sensing Satellites Information systems Data mining Out of order Workstations

来源：评论

学校读者我要写书评

暂无评论

Localized random access scan: Towards low area and routing overhead

Localized random access scan: Towards low area and routing o...

引用

Asia and South Pacific Design Automation Conference

作者： Yu Hu Xiang Fu Xiaoxin Fan Hideo Fujiwara Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences Beijing China Graduate School of Information Science Nara Institute of Science and Technology Ikoma Nara Japan

ISBN: (纸本)9781424419210

Conventional random access scan (RAS) designs, although economic in test power dissipation, test application time and test data volume, are expensive in area and routing overhead. In this paper, we present a localized RAS architecture (LRAS) to address this issue. A novel scan cell structure, which has fewer transistors than the multiplexer-type scan cell, is proposed to eliminate the global test enable signal and to localize the row enable and the column enable signals. Experimental results on ISCAS'89 and ITC'99 benchmark circuits demonstrate that LRAS has 54% less area overhead than multiplexer-type scan chain based designs, while significantly outperforms the state-of-the-art RAS scheme in routing overhead.

关键词： Routing Flip-flops Circuit testing Power dissipation Read-write memory Wires Random access memory Circuit synthesis Signal synthesis Design for testability

来源：评论

学校读者我要写书评

暂无评论

First mapping of China surface movement using supercomputing interferometric SAR technique

引用

science Bulletin 2021年第16期66卷 1608-1610页

作者： Chao Wang Yixian Tang Hong Zhang Haihang You Weikang Zhang Wei Duan Jing Wang Longkai Dong Bo Zhang Key Laboratory of Digital Earth Science Aerospace Information Research InstituteChinese Academy of SciencesBeijing 100094China College of Resources and Environment University of Chinese Academy of SciencesBeijing 100049China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China

The Earth surface is constantly moving and changing under the influence of internal and external dynamic geological processes and human *** a time scale,such changes may occur within a few seconds,such as earthquakes and landslides,or last for several years or even longer,such as fault creep and frozen soil *** a spatial scale,such changes may manifest as local surface collapses or regional surface subsidence.

关键词： subsidence fault Earth

来源：评论

学校读者我要写书评

暂无评论

An efficient approach to mine maximal continuous frequent patterns from software function call sequence

引用

Journal of Computational Information Systems 2015年第8期11卷 3073-3085页

作者： He, Haitao Yin, Tengteng Wu, Hongfei Bai, Lan Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China Hebei Institute of Foreign Languages Qinhuangdao China

Certain characteristics of software are often hidden in its structure and can only be discovered when the software is executed dynamically. So mining important patterns from dynamic call graph of software plays an important role in analyzing software security. However the general sequential pattern mining algorithms may lead to poor performance due to the lack of consideration on the continuous property of software function call sequence. In this paper, combining with the characteristics of software itself, function call sequence is modeled firstly. The sequence represents the call relationship among functions of software. Then a novel structure called Nitem-List is put forward. The structure stores both the next item and the support information which is heuristic information for pruning the search space about a pattern. On the basis of that, an efficient algorithm called Maximal Continuous Frequent Pattern Miner (MCFP-Miner) and an update algorithm UMCFP-Miner are proposed. After constructing the initial Nitem-Lists from a mined database, MCFP-Miner can mine continuous frequent patterns from these Nitem-Lists. In UMCFP-Miner, a tighter bound for pruning is proposed. Finally, extensive experiments on various databases show that algorithm MCFP-Miner and UMCFP-Miner have better efficiency. ©, 2015, Binary Information Press. All right reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Secure localization algorithms in wireless sensor networks: A review 2nd

Secure localization algorithms in wireless sensor networks: ...

引用

2nd International Conference on computer, Communication and Computational sciences, IC4S 2017

作者： Wang, Hua Wen, Yingyou Lu, Yao Zhao, Dazhe Ji, Chunlin School of Computer Science & Engineering Northeastern University Shenyang110819 China State Key Laboratory of Software Architecture Neusoft Corporation Shenyang110179 China Beijing Jiaotong University Beijing100044 China Key Laboratory of Medical Image Computing Ministry of Education Northeastern University Shenyang110819 China Kuang-Chi Institute of Advanced Technology Shenzhen518000 China

ISBN: (纸本)9789811303432

Localization plays a vital role in understanding the application context for wireless sensor networks (WSNs). However, it is vulnerable to various threats due to the open arrangement area, the nature of radio broadcasting, and resource constraint. Two kinds of attacks on localization process need to be investigated. On the one hand, adversaries may capture, impersonate, replicate, or fabricate nodes to mislead the target to an incorrect position. On the other hand, adversaries may tamper, interfere, replay, or modify jointly localization information to disturb the localization. This paper describes two kinds of localization attacks and gives a systematic survey of existing secure localization solutions, including the design ideas, application scopes, and limitations. Next, several novel secure localization schemes for special WSNs applications, including Underwater Wireless Sensor Networks (UWSNs), Wireless Body Area Network (WBAN) and three-dimensional (3D), are analyzed. Finally, many open problems for secure localization are presented. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：