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

Proceedings of the Biannual World Automation Congress

作者： Peichang Shi Yiying Li Bo Ding Longquan Jiang Hui Liu Jie Zhang National Key Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha Hunan CN National Key Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China National University of Defense Technology Changsha Hunan CN China Electr. Equip. & Syst. Eng. Co. Ltd. China

As The integration of Physical space and cyberspace, the large-scale data distributing to diversification terminal which is geographical distribution of mass has become a huge challenge. When the data size can't be processed by the technology for traditional scope, how to deal with the user quality of service and efficient use of system resources has become an important issue of concern, with the resources becoming limited. This paper presents a data-driven mechanism for large-scale data distribution which is consists of four core part of the data production, data collection and pre-processing, data analysis engine, data consumption, aims to excavate the valuable information to improve the efficiency of resource use and accurate fault location for the Large-scale data distribution system. At the same time, this paper studies the resource scheduling optimization with analyzing data driven for the system behavior and Fault location with analyzing data-driven environment, which proves the effectiveness for the operation of the Large-scale data distribution system optimization by the data-driven working.

关键词： Servers Monitoring distributed databases Big data Real-time systems Business

来源：评论

学校读者我要写书评

暂无评论

Efficiently indexing sparse wide tablesin cloud computing

引用

Information technology Journal 2013年第20期12卷 5415-5423页

作者： Huang, Bin Peng, Yuxing Department of Computer Huaihua University 418008 Huaihua China School of Computer Science Wuhan University 430072 Wuhan China National Laboratory of Parallel and Distributed Processing National University of Defense Technology 410073 Changsha China

For its perception of unlimited resources and infinite scalability, Cloud Computing has emerged as a pervasive paradigm for hosting? data-centric applications in large computing infrastructures. The data produced by these applications are essentially sparse and wide and may change schema frequently, traditional relational data model is inappropriate for their data management. A new data model, called Sparse Wide Table, was introduced for this task. Unfortunately, we have to face many challenges in building the secondary index for Sparse Wide Table in cloud, as the distributed and column-oriented storage which eliminates a number of NULLs. In this study, we present a three-level index scheme for efficient data processing in the Cloud. Our approach can be summarized as follows. First, we build an index for each column by which the records can be rebuilt easily. Second, we build a bitmap index for each storage node which only indexes the data residing on the node. Third, we organize the storage nodes as a structured overlay and each node maintains a portion of the global index for the all different data. The global index is a bitmap index to indicate the node each data resides in. Finally, based on the three-level index scheme, some query algorithms are implemented. We conduct extensive experiments on a LAN and the results demonstrate that our indexing scheme is dynamic, efficient and scalable. © 2013 Asian Network for Scientific Information.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Effective hierarchical routing algorithm for large-scale wireless mobile networks

引用

Journal of Networks 2014年第2期9卷 344-352页

作者： Yan, Guofeng Peng, Yuxing Hu, Ying Liu, Junyi School of Computer and Communication Hunan Institute of Engineering Hunan 411104 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China School of Computer National University of Defense Technology Changsha 410073 China

The growing interest in wireless mobile network techniques has resulted in many routing protocol proposals. The unpredictable motion and the unreliable behavior of mobile nodes is one of the key issues in wireless mobile network. Virtual mobile node (VMN) consists of robust virtual nodes that are both predictable and reliable. Based on VMN, in this paper, we present a hierarchical routing algorithm, i.e., EHRA-WAVE, for large-scale wireless mobile networks. By using mobile WAVE technology, a routing path can be found rapidly between VMNs without accurate topology information. We introduce the routing algorithm and the implementation issues of the proposed EHRA-WAVE routing algorithm. Finally, we evaluate the performance of EHRA-WAVE through experiments, and compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing methods. However, due to the large amounts WAVE flooding, EHRA-WAVE results in too large load which would impede the application of the EHRA-WAVE algorithm. Therefore, the further routing protocol focuses on minimizing the number of WAVE using hierarchical structures in large-scale wireless mobile networks. © 2014 Academy Publisher.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Translation Non-negative Matrix Factorization with Fast Optimization

Translation Non-negative Matrix Factorization with Fast Opti...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yuanyuan Wang Naiyang Guan Bin Mao Xuhui Huang Zhigang Luo Department of Basic Courses Army Officer Academy Science and Technology on Parallel and Distributed Processing Laboratory College of Computer Science National University of Defense Technology College of Science National University of Defense Technology College of Computer Science National University of Defense Technology

ISBN: (纸本)9781479938414

Non-negative matrix factorization (NMF) reconstructs the original samples in a lower dimensional space and has been widely used in pattern recognition and data mining because it usually yields sparse representation. Since NMF leads to unsatisfactory reconstruction for the datasets that contain translations of large magnitude, it is required to develop translation NMF (TNMF) to first remove the translation and then conduct a decomposition. However, existing multiplicative update rule based algorithm for TNMF is not efficient enough. In this paper, we reformulate TNMF and show that it can be efficiently solved by using the state-of-the-art solvers such as NeNMF. Experimental results on face image datasets confirm both efficiency and effectiveness of the reformulated TNMF.

关键词： Non-negative matrix factorization (NMF) Translation transformation NeNMF

来源：评论

学校读者我要写书评

暂无评论

Offline Imitation Learning Using Reward-free Exploratory Data 22

Offline Imitation Learning Using Reward-free Exploratory Dat...

引用

Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence

作者： Hao Wang Dawei Feng Bo Ding Wei Li College of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing National University of Defense Technology China Independent Researcher China

ISBN: (纸本)9781450398336

Offline imitative learning(OIL) is often used to solve complex continuous decision-making tasks. For these tasks such as robot control, automatic driving and etc., it is either difficult to design an effective reward for learning or very expensive and time-consuming for agents to collect data interactively with the environment. However, the data used in previous OIL methods are all gathered by reinforcement learning algorithms guided by task-specific rewards, which is not a true reward-free premise and still suffers from the problem of designing an effective reward function in real tasks. To this end, we propose the reward-free exploratory data driven offline imitation learning (ExDOIL) framework. ExDOIL first trains an unsupervised reinforcement learning agent by interacting with the environment, and collects enough unsupervised exploration data during training; Then, a task independent yet simple and efficient reward function is used to relabel the collected data; Finally, an agent is trained to imitate the expert to complete the task through a conventional RL algorithm such as TD3. Extensive experiments on continuous control tasks demonstrate that the proposed framework can achieve better imitation performance(28% higher episode returns on average) comparing with previous SOTA method(ORIL) without any task-specific rewards.

关键词： dataset

来源：评论

学校读者我要写书评

暂无评论

Tendency-based caching in Content-Centric Networking

Tendency-based caching in Content-Centric Networking

引用

International Conference on Ubiquitous and Future Networks, ICUFN

作者： YuSheng Xia YaPing Liu JinShu Su College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781467399920

In content-centric networking, the schemes of innetwork caching can affect the performance of the whole network. Existing schemes lack of the global view, which results in inefficient caches. In this paper, we aim to analyze the real-time distribution of contents among caches from multiple perspectives. This paper proposes TCBRP, a scheme that analyzes caching tendency of various contents in reverse path, based on centrality of nodes, popularity of contents and replacement rate of nodes, to cache in-network contents. This scheme also has decent scalability and can be expended conveniently. The experimental results reflect that TCBRP report savings in average hops and balance cache hit rate, compared with BetwRep and LCE.

关键词： Probability Internet Network architecture Mathematical model Statistical analysis Correlation Fading channels

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for SI transactions serializability in cloud computing

引用

Information technology Journal 2013年第24期12卷 8435-8445页

作者： Huang, Bin Peng, Yuxing Peng, Xiaoning School of Computer Science Wuhan University Wuhan 430072 China Department of Computer Huaihua University Huaihua 418008 China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

There are well known anomalies permitted by snapshot isolation that can lead to violations of data consistency by interleaving transactions that individually maintain consistency. Until now, there are some ways to prevent these anomalies only in single computer and there are not the corresponding solving methods in cloud computing. This paper describes our PDCC algorithm to detect cycles in a snapshot isolation dependency graph and abort transactions to break the cycle in cloud computing. The algorithm ensures serializable executions for SI transactions in cloud computing. Based on the transaction concurrency control of Percolator, we have implemented our algorithm in an open source cloud database system (HBase) and our performance study shows that PDCC throughput and scalability are good. © 2013 Asian Network for Scientific Information.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Deep Isolation Forest for Anomaly Detection

arXiv

引用

arXiv 2022年

作者： Xu, Hongzuo Pang, Guansong Wang, Yijie Wang, Yongjun The College of Computer National University of Defense Technology Changsha410073 China The Science and Technology on Parallel and Distributed Processing Laboratory China The School of Computing and Information Systems Singapore Management University 178902 Singapore

Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability. Nevertheless, its linear axis-parallel isolation method often leads to (i) failure in detecting hard anomalies that are difficult to isolate in high-dimensional/non-linear-separable data space, and (ii) notorious algorithmic bias that assigns unexpectedly lower anomaly scores to artefact regions. These issues contribute to high false negative errors. Several iForest extensions are introduced, but they essentially still employ shallow, linear data partition, restricting their power in isolating true anomalies. Therefore, this paper proposes deep isolation forest. We introduce a new representation scheme that utilises casually initialised neural networks to map original data into random representation ensembles, where random axis-parallel cuts are subsequently applied to perform the data partition. This representation scheme facilitates high freedom of the partition in the original data space (equivalent to non-linear partition on subspaces of varying sizes), encouraging a unique synergy between random representations and random partition-based isolation. Extensive experiments show that our model achieves significant improvement over state-of-the-art isolation-based methods and deep detectors on tabular, graph and time series datasets;our model also inherits desired scalability from iForest. © 2022, CC BY.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel implementation of morphological operation on GPU and FPGA

Efficient parallel implementation of morphological operation...

引用

International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)

作者： Teng Li Yong Dou Jingfei Jiang Jing Gao National Laboratory for Parallel & Distributed Processing National University of Defense and Technology Changsha China Information Management Department AIR CHINA LIMITED Beijing China

Morphological operation constitutes one of a powerful and versatile image and video applications applied to a wide range of domains, from object recognition, to feature extraction and to moving objects detection in computer vision where real-time and high-performance are required. However, the throughput of morphological operation is constrained by the convolutional characteristic. In this paper, we analysis the parallelism of morphological operation and parallel implementations on the graphics processing unit (GPU), and field programming gate array (FPGA) are presented. For GPU platform, we propose the optimized schemes based on global memory, texture memory and shared memory, achieving the throughput of 942.63 Mbps with 3×3 structuring element. For FPGA platform, we present an optimized method based on the traditional delay-line architecture. For 3×3 structuring element, it achieves a throughput of 462.64 Mbps.

关键词： Graphics processing units Morphological operations Field programmable gate arrays Throughput Optimization Instruction sets Random access memory

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Memory Service Mechanism in Server Consolidation Environment

A Hierarchical Memory Service Mechanism in Server Consolidat...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Liufeng Wang Huaimin Wang Lu Cai Rui Chu Pengfei Zhang Lanzheng Liu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China School of Economics and Management Xi'an University Xi'an China

Increasing Internet business and computing footprint motivate server consolidation in data centers. Through virtualization technology, server consolidation can reduce physical hosts and provide scalable services. However, the ineffective memory usage among multiple virtual machines (VMs) becomes the bottleneck in server consolidation environment. Because of inaccurate memory usage estimate and the lack of memory resource managements, there is much service performance degradation in data centers, even though they have occupied a large amount of memory. In order to improve this scenario, we first introduce VM's memory division view and VM's free memory division view. Based on them, we propose a hierarchal memory service mechanism. We have designed and implemented the corresponding memory scheduling algorithm to enhance memory efficiency and achieve service level agreement. The benchmark test results show that our implementation can save 30% physical memory with 1% to 5% performance degradation. Based on Xen virtualization platform and balloon driver technology, our works actually bring dramatic benefits to commercial cloud computing center which is providing more than 2,000 VMs' services to cloud computing users.

关键词： Memory management Resource management Servers Scheduling algorithm Benchmark testing Cloud computing System performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：