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

33rd International Conference on Massive Storage Systems and Technology, MSST 2017

作者： Wu, Huijun Wang, Chen Fu, Yinjin Sakr, Sherif Zhu, Liming Lux, Kai Data CSIRO University of New South Wales Australia PLA University of Science and Technology China Science and Technology on Parallel and Distributed Laboratory State Key Laboratory of High Performance Computing State Key Lab. of High-end Server and Storage Technology Coll. of Computer Natl. Univ. of Def. Technol. China

Eliminating duplicate data in primary storage of clouds increases the cost-efficiency of cloud service providers as well as reduces the cost of users for using cloud services. Most existing primary deduplication techniques either use inline caching to exploit locality in primary workloads or use postprocessing deduplication running in system idle time to avoid the negative impact on I/O performance. However, neither of them works well in the cloud servers running multiple services or applications for the following two reasons: Firstly, the temporal locality of duplicate data writes may not exist in some primary storage workloads thus inline caching often fails to achieve good deduplication ratio. Secondly, the post-processing deduplication allows duplicate data to be written to disks, therefore does not provide the benefit of I/O deduplication and requires high peak storage capacity. This paper presents HPDedup, a Hybrid Prioritized data Deduplication mechanism to deal with the storage system shared by applications running in co-located virtual machines or containers by fusing an inline and a post-processing process for exact deduplication. In the inline deduplication phase, HPDedup gives a fingerprint caching mechanism that estimates the temporal locality of duplicates in data streams from different VMs or applications and prioritizes the cache allocation for these streams based on the estimation. HPDedup also allows different deduplication threshold for streams based on their spatial locality to reduce the disk fragmentation. The post-processing phase removes duplicates whose fingerprints are not able to be cached due to weak temporal locality from disks. The hybrid deduplication mechanism significantly reduces the amount of redundant data written to the storage system while maintaining inline data writing performance. Our experimental results show that HPDedup clearly outperforms the state-of-the-art primary storage deduplication techniques in terms of inline cac

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An in-depth Exploration of LAMOST Unknown Spectra Based on Density Clustering

引用

Research in Astronomy and Astrophysics 2023年第5期23卷 52-65页

作者： Hai-Feng Yang Xiao-Na Yin Jiang-Hui Cai Yu-Qing Yang A-Li Luo Zhong-Rui Bai Li-Chan Zhou Xu-Jun Zhao Ya-Ling Xun Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and TechnologyTaiyuan 030024China School of Computer Science and Technology Taiyuan University of Science and TechnologyTaiyuan 030024China School of Computer Science and Technology North University of ChinaTaiyuan 030051China National Astronomical Observatories Chinese Academy of SciencesBeijing 100101China

Large sky Area Multi-Object fiber Spectroscopic Telescope(LAMOST) has completed the observation of nearly 20 million celestial objects,including a class of spectra labeled “Unknown.” Besides low signal-to-noise ratio,these spectra often show some anomalous features that do not work well with current *** this paper,a total of 637,889 “Unknown” spectra from LAMOST DR5 are selected,and an unsupervised-based analytical framework of “Unknown” spectra named SA-Frame(Spectra Analysis-Frame) is provided to explore their origins from different *** SA-Frame is composed of three parts:NAPC-Spec clustering,characterization and origin ***,NAPC-Spec(Nonparametric density clustering algorithm for spectra) characterizes different features in the “unknown” spectrum by adjusting the influence space and divergence distance to minimize the effects of noise and high dimensionality,resulting in 13 ***,characteristic extraction and representation of clustering results are carried out based on spectral lines and continuum,where these 13 types are characterized as regular spectra with low S/Ns,splicing problems,suspected galactic emission signals,contamination from city light and un-gregarious type ***,a preliminary analysis of their origins is made from the characteristics of the observational targets,contamination from the sky,and the working status of the *** results would be valuable for improving the overall data quality of large-scale spectral surveys.

关键词： methods data analysis-surveys-techniques spectroscopic-site testing-methods analytical

来源：评论

学校读者我要写书评

暂无评论

Feature and Performance Comparison of FaaS Platforms 14

Feature and Performance Comparison of FaaS Platforms

引用

14th IEEE International Conference on Software Engineering and Service Science, ICSESS 2023

作者： Ma, Penghui Shi, Peichang Yi, Guodong College of Computer Science National University of Defense Technology National Key Laboratory of Parallel and Distributed Processing Changsha410073 China College of Computer Science National University of Defense Technology Key Laboratory of Software Engineering for Complex Systems Changsha410073 China Xiangjiang Lab Changsha410073 China School of Advanced Interdisciplinary Studies Hunan University of Technology and Business Changsha410073 China

ISBN: (纸本)9798350336269

With serverless computing offering more efficient and cost-effective application deployment, the diversity of serverless platforms presents challenges to users, including platform lock-in and costly migration. Moreover, due to the black box nature of function computing, traditional performance benchmarking methods are not applicable, necessitating new studies. This article presents a detailed comparison of six major public cloud function computing platforms and introduces a benchmarking framework for function computing performance. This framework aims to help users make comprehensive comparisons and select the most suitable platform for their specific needs. © 2023 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Reduced complexity tree-structured conditional random field for all-words word sense disambiguation

引用

Journal of Computational Information Systems 2012年第3期8卷 1177-1186页

作者： Zhou, Yun Wang, Ting Wang, Zhiyuan Xie, Songxian Computer School National University of Defense Technology Changsha 410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

In this paper, we apply tree-structured conditional random field (TCRF) to all-words word sense disambiguation (WSD), where the graphical structure of TCRF is the dependency syntax tree produced by Minipar. The extremely large label space and high time complexity of TCRF hinders its application in semantic parsing, especially in all-words WSD, and we focus on reducing the time complexity of TCRF in this paper. The running time of TCRF is reduced significantly by edge feature selection and parallelization in training phase and beam search strategy in decoding phase. We evaluate the TCRF method on the English all-words task of Senseval-3, and the F1 value of TCRF method is 0.668, which outperforms the best result 0.652 in Senseval-3. For convenience of comparison, our training set only includes a part of Semcor, which reserves the space for improvement. Furthermore, the practical problem in the fields of information retrieval and natural language processing, often has a large label space and tree-structured information, which can also be solved by the TCRF method proposed in this paper. 1553-9105/Copyright © 2012 Binary Information Press.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

App-Net: A Hybrid Neural Network for Encrypted Mobile Traffic Classification

App-Net: A Hybrid Neural Network for Encrypted Mobile Traffi...

引用

IEEE Conference on Computer Communications Workshops, INFOCOM Wksps

作者： Xin Wang Shuhui Chen Jinshu Su College of Computer Science and Technology National University of Defense Technology National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology

ISBN: (数字)9781728186955

ISBN: (纸本)9781728186962

With the exponential growth of mobile traffic data, mobile traffic classification is in a great need. It is an essential step to improve the performance of network services such as QoS and security monitoring. However, the widespread use of encrypted protocols, especially the TLS protocol, has posed great challenges to traditional traffic classification techniques. As the rule-based deep packet inspection approaches are ineffective for encrypted traffic classification, various machine learning methods have been studied and used. Recently, deep learning solutions which enable automatic feature extraction are also proposed to classify encrypted traffic. In this paper we propose App-Net, an end-to-end hybrid neural network, to learn effective features from raw TLS flows for mobile app identification. App-Net is designed by combining RNN and CNN in a parallel way. So that it can learn a joint flow-app embedding to characterize both flow sequence patterns and unique app signatures. We evaluate App-Net on a real-world dataset that covering 80 apps. The results show that our method can achieve an excellent performance and outperform the state-of-the-art methods.

关键词： Cryptography Feature extraction Payloads Recurrent neural networks Machine learning Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Learning-based Depth Estimation aided Visual SLAM Approach

arXiv

引用

arXiv 2019年

作者： Geng, Mingyang Shang, Suning Ding, Bo Wang, Huaimin Zhang, Pengfei Zhang, Lei National Key Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology China National Key Laboratory of Integrated Automation of Process Industry Northeastern University China

Existing visual-based SLAM systems mainly utilize the three-dimensional environmental depth information from RGB-D cameras to complete the robotic synchronization localization and map construction task. However, the RGB-D camera maintains a limited range for working and is hard to accurately measure the depth information in a far distance. Besides, the RGB-D camera will easily be influenced by strong lighting and other external factors, which will lead to a poor accuracy on the acquired environmental depth information. Recently, deep learning technologies have achieved great success in the visual SLAM area, which can directly learn high-level features from the visual inputs and improve the estimation accuracy of the depth information. Therefore, deep learning technologies maintain the potential to extend the source of the depth information and improve the performance of the SLAM system. However, the existing deep learning-based methods are mainly supervised and require a large amount of ground-truth depth data, which is hard to acquire because of the realistic constraints. In this paper, we first present an unsupervised learning framework, which not only uses image reconstruction for supervising but also exploits the pose estimation method to enhance the supervised signal and add training constraints for the task of monocular depth and camera motion estimation. Furthermore, we successfully exploit our unsupervised learning framework to assist the traditional ORB-SLAM system when the initialization module of ORB-SLAM method could not match enough features. Qualitative and quantitative experiments have shown that our unsupervised learning framework performs the depth estimation task comparably to the supervised methods and outperforms the previous state-of-the-art approach by 13.5% on KITTI dataset. Besides, our unsupervised learning framework could significantly accelerate the initialization process of ORB-SLAM system and effectively improve the accuracy on environme

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Virtual Layers

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Vir...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Zhaoning Zhang Kui Wu Huiba Li Jinghua Feng Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China Computer Science Department University of Victoria B.C. Canada National Super Computing Center Tianjin China

Virtualization is the foundation for cloud computing, and the virtualization can not be achieved without software defined, elastic, flexible and scalable virtual layers. Unfortunately, if multiple virtual storage devices are chained together, the system may be subject to severe performance degradation. While the read-ahead (RA) mechanism in storage devices plays a very important role to improve I/O performance, RA may not be effective as expected for multiple virtualization layers, since it is originally designed for one layer only. When I/O requests are passed through a long I/O path, they may trigger a chain reaction and lead to unnecessary data transmission and thus bandwidth waste. In this paper, we study the dynamic behavior of RA through multiple I/O layers and demonstrate that if controlled well, RA can greatly accelerate I/O speed. We present RAFlow, a RA control mechanism, to effectively improve I/O performance by strategically expanding RA window at each layer. Our real-world experiments show that it can achieve 20% to 50% performance improvement in I/O paths with up to 8 virtualized storage devices.

关键词： Radio access networks Acceleration distributed databases Performance evaluation Synchronization Benchmark testing Degradation

来源：评论

学校读者我要写书评

暂无评论

Constrained Projective Non-negative Matrix Factorization for Semi-supervised Multi-label Learning

Constrained Projective Non-negative Matrix Factorization for...

引用

International Conference on Machine Learning and Applications (ICMLA)

作者： Xiang Zhang Naiyang Guan Zhigang Luo Xuejun Yang College of Computer National University of Defense Technology Changsha China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China The State key Laboratory of High Performance Computing National University of Defense Technology Changsha China

This paper formulates multi-label learning as a constrained projective non-negative matrix factorization (CPNMF) problem which concentrates on a variant of the original projective NMF (PNMF) and explicitly introduces an auxiliary basis to learn the semantic subspace and boosts its discriminating ability by exploiting labeled and unlabeled examples together. Particularly, it propagates labels of the labeled examples to the unlabeled ones by enforcing coefficients of examples sharing identical semantic contents to be identical based on a hard constraint, i.e., embedding the class indicator of labeled examples into their coefficients. CPNMF preserves the geometrical structure of dataset via manifold regularization meanwhile captures the inherent structure of labels by using label correlations. We developed a multiplicative update rule (MUR) based algorithm to optimize CPNMF and proved its convergence. Experiments of image annotation on Corel dataset, text categorization on Rcv1v2 dataset, and text clustering on two popular text corpuses suggest the effectiveness of CPNMF.

关键词： Conferences

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

International Workshop on Quality of Service

作者： Fajun Chen Jiangchuan Liu Zongpeng Li Yijie Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense Technology China School of Computing Science Simon Fraser University Department of Computer Science University of Caglary

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP). Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15~73.02%) and improvement on packet delivery ratio (99.76%) are observed.

关键词： Uncertainty Wireless mesh networks Delay Routing protocols Physical layer Statistics Stochastic processes Relays Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

Succinct Representations in Collaborative Filtering: A Case Study using Wavelet Tree on 1,000 Cores

Succinct Representations in Collaborative Filtering: A Case ...

引用

IEEE International Conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Xiangjun Peng Qingfeng Wang Xu Sun Chunye Gong Yaohua Wang User-Centric Computing Group University of Nottingham Ningbo China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

User-Item (U-I) matrix has been used as the dominant data infrastructure of Collaborative Filtering (CF). To reduce space consumption in runtime and storage, caused by data sparsity and growing need to accommodate side information in CF design, one needs to go beyond the U-I Matrix. In this paper, we took a case study of Succinct Representations in Collaborative Filtering, rather than using a U-I Matrix. Our key insight is to introduce Succinct Data Structures as a new infrastructure of CF. Towards this, we implemented a User-based K-Nearest-Neighbor CF prototype via Wavelet Tree, by first designing a Accessible Compressed Documents (ACD) to compress U-I data in Wavelet Tree, which is efficient in both storage and runtime. Then, we showed that ACD can be applied to develop an efficient intersection algorithm without decompression, by taking advantage of ACD's characteristics. We evaluated our design on 1,000 cores of Tianhe-II supercomputer, with one of the largest public data set ml-20m. The results showed that our prototype could achieve 3.7 minutes on average to deliver the results.

关键词： Vegetation Collaboration Filtering Data structures Runtime Indexes Time complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：