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

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Li-juan Zhang Zhou-jun Li Huo-wang Chen Jian Wen National Laboratory for Parallel and Distributed Processing Changsha China School of Computer Science & Engineering Beihang University Beijing China

In this article we describe a method for selecting informative genes from microarray data. The method is based on clustering, namely, it first find similar genes, group them and then select informative genes from these groups to avoid redundancy. A new gene similarity measure based on grey relational analysis (GRA), called grey relational grade (GRG), is used in clustering. Experiments on three public data sets demonstrate the effectiveness of our method

关键词： Gene expression Data analysis Laboratories distributed processing computer science Data engineering Signal to noise ratio Mutual information Data mining Conferences

来源：评论

学校读者我要写书评

暂无评论

VisionEmbedder: Bit-Level-Compact key-Value Storage with Constant Lookup, Rapid Updates, and Rare Failure 40

VisionEmbedder: Bit-Level-Compact Key-Value Storage with Con...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Wu, Yuhan Wang, Feiyu Zhu, Yifan Fan, Zhuochen Xiong, Zhiting Yang, Tong Cui, Bin School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University Beijing China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9798350317152

In key-value storage scenarios where storage space is at a premium, our focus is on a class of solutions that only store the value, which is highly space-efficient. While these solutions have proven their worth in distributed storage, networking, and bioinformatics, they still face two significant issues: one is that their space cost could be further reduced;the other is their are vulnerable to update failures, which can necessitate a complete table reconstruction. To address these issues, we introduce VisionEmbedder, a compact key-value embedder with constant-time lookup, fast dynamic updates, and a near-zero risk of reconstruction. VisionEmbedder cuts down the storage requirement from 2.2L bits to just 1.6L bits per key-value pair with an L-bit value, and it significantly reduces the chance of update failures by a factor of n, where n is the number of keys (for instance, 1 million or more). The compromise with VisionEmbedder comes with a minor reduction in query throughput on certain data sizes. The enhancements offered by VisionEmbedder have been theoretically validated and are effective across any dataset. Additionally, we have implemented VisionEmbedder on both FPGA and CPU platforms, with all codes made available as open-source. © 2024 IEEE.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

Research on Online Failure Prediction Model and Status Pretreatment Method for Exascale System

Research on Online Failure Prediction Model and Status Pretr...

引用

International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC

作者： Hao Zhou Yanhuang Jiang National Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China

The reliability issue of Exascale system is extremely serious. Traditional passive fault-tolerant methods, such as rollback-recovery, can not fully guarantee system reliability any more because of their large executing overhead and long recovering duration. Active fault tolerance is expected to become another important fault-tolerant approach for Exascale system. Focusing on system failure prediction, which is one key step of active fault tolerance, we construct online failure prediction model and research on the effective method of system status pretreatment. In order to improve the accuracy and real-time feature of current methods, the proposed Improved Adaptive Semantic Filter (IASF) method processes the latest system logs regularly, filtering useless information out of them according to their semantics. Adopting the main idea of Vector Space Model (VSM), IASF method creates Event Vector corresponding to each log record. By calculating the cosine of vectorial angle, it evaluates the semantics correlation between different log records, and then executes temporal and spatial redundant filter considering the burst feature of log records. IASF method is insensitive to the type of system log and does not introduce any expert system or domain knowledge. The experiment result shows that system can eliminate about 99.6% of useless log records after executing IASF method.

关键词： Fault tolerance Fault tolerant systems Vectors Correlation Information filters Predictive models

来源：评论

学校读者我要写书评

暂无评论

Matrix Inversion on the Cell/B.E. Processor

Matrix Inversion on the Cell/B.E. Processor

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Shodai Yokoyama Kazuya Matsumoto Stanislav Sedukhin Distributed Parallel Processing Laboratory Graduate School of Computer Science and Engineering University of Aizu Japan

The problem of inverting matrices is one that occurs in some problems of practical importance. This paper introduces and evaluates the block algorithm for high performance matrix inversion on the Cell Broadband Engine (Cell/B.E.) processor. The Cell/B.E. is a heterogeneous multi-core processor on a single-chip jointly developed by Sony, Toshiba and IBM, which has a very high speed of the single precision floating-point arithmetic. The discussed matrix inversion algorithm is a combination of the block algebraic path problem algorithm and the well-known block matrix inversion algorithm based on the LU decomposition. For relatively big matrices, this combined block algorithm spends the most time in computing matrix-matrix multiplication of blocks and achieves 149.4 Gflop/s on Cell/B.E., when PPE and six SPEs of PlayStation3 are used, or 93.4% of the aggregated double (PPE) and single (SPEs) precision peak performance, which is 160.0 Gflop/s.

关键词： Matrix decomposition Partitioning algorithms Floating-point arithmetic Engines Multicore processing Microprocessors Reduced instruction set computing High performance computing parallel processing computer science

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of fast BLAS3-GEMM: A portable compiler approach 17

Automatic generation of fast BLAS3-GEMM: A portable compiler...

引用

International Symposium on Code Generation and Optimization (CGO)

作者： Xing Su Xiangke Liao Jingling Xue College of Computer National Laboratory for Parallel and Distributed Processing Changsha China UNSW School of Computer Science and Engineering Sydney NSW Australia

ISBN: (纸本)9781509049318

GEMM is the main computational kernel in BLAS3. Its micro-kernel is either hand-crafted in assembly code or generated from C code by general-purpose compilers (guided by architecture-specific directives or auto-tuning). Therefore, either performance or portability suffers. We present a POrtable Compiler Approach, Poca, implemented in LLVM, to automatically generate and optimize this micro-kernel in an architecture-independent manner, without involving domain experts. The key insight is to leverage a wide range of architecture-specific abstractions already available in LLVM, by first generating a vectorized micro-kernel in the architecture-independent LLVM IR and then improving its performance by applying a series of domain-specific yet architecture-independent optimizations. The optimized micro-kernel drops easily in existing GEMM frameworks such as BLIS and OpenBLAS. Validation focuses on optimizing GEMM in double precision on two architectures. On Intel Sandybridge and AArch64 Cortex-A57, Poca's micro-kernels outperform expert-crafted assembly code by 2.35% and 7.54%, respectively, and both BLIS and OpenBLAS achieve competitive or better performance once their micro-kernels are replaced by Poca's.

关键词： Kernel Optimization computer architecture Linear algebra Libraries Programming Program processors

来源：评论

学校读者我要写书评

暂无评论

A Simulated Annealing Technique for Optimizing Time Warp Simulation

A Simulated Annealing Technique for Optimizing Time Warp Sim...

引用

International Conference on computer Modeling and Simulation, ICCMS

作者： Wei Zhang Sina Meraji Jun Wang Carl Tropper National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology ChangSha China School of Computer Science McGill University Montreal Canada

According to Moore's law the complexity of VLSI circuits has doubled approximately every two years, resulting in simulation becoming the major bottleneck in the circuit design process. parallel and distributed simulations can be applied as fast, cost effective approaches to the simulation of large, complex circuits. In this paper, a simple yet effective simulated annealing-based approach is proposed to optimize the choice of a time window for optimistic parallel simulation. We chose gate level circuits simulations as our experimental vehicle. Our results show up to a 52% improvement in the simulation time using our simulated annealing algorithm. To the best of our knowledge, this is the first time that SA has been applied to optimize the performance of time warp simulations.

关键词： Time warp simulation Simulated annealing Circuit simulation Computational modeling Hardware design languages Discrete event simulation computer simulation Voltage control Concurrent computing computer science

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Direct method-green's theory: From PDE to BIE in the geometric transformation

Direct method-green's theory: From PDE to BIE in the geometr...

引用

2016 International Conference on Wavelet Analysis and Pattern Recognition, ICWAPR 2016

作者： Yang, Li-Na Li, Tao-Shen Tang, Yuan Yan Xu, Jia Pan, Jian-Jia Luo, Hui-Wu Zheng, Xian-Wei School of Computer Electronics and Information Guangxi University Nanning530004 China Department of Computer and Information Science Faculty of Science and Technology University of Macau China Guangxi Colleges Universities Key Laboratory of Parallel and Distributed Computing Nanning530004 China

ISBN: (纸本)9781509035885

In this research, we apply the Green's theory for converting the partial differential equation to the boundary integral equation for geometric transformation. Green's theory is designed specifically for integral equation. It is efficient in detecting the singularity point to the geometric transformation that has been verified. Experimental results show that the Green's theory has good performance. © 2016 IEEE.

关键词： Partial differential equations

来源：评论

学校读者我要写书评

暂无评论

Laser-driven inertial ion focusing

引用

Physical Review E 2009年第1期79卷 015401(R)-015401(R)页

作者： H. B. Zhuo Wei Yu M. Y. Yu H. Xu X. Wang B. F. Shen Z. M. Sheng J. Zhang National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China Shanghai Institute of Optics and Fine Mechanics Chinese Academy of Sciences Shanghai 201800 China Institute for Fusion Theory and Simulation Zhejiang University Hangzhou 310027 China Institute for Theoretical Physics I Ruhr University Bochum D-44780 Germany Department of Physics Jiaotong University Shanghai 200240 China

A Hohlraum-like configuration is proposed for realizing a simple compact source for neutrons. A laser pulse enters a tiny thin-shelled hollow-sphere target through a small opening and is self-consistently trapped in the cavity. The electrons in the inner shell-wall region are expelled by the light pressure. The resulting space-charge field compresses the local ions into a thin layer that becomes strongly heated. An inward expansion of ions into the shell cavity then occurs, resulting in the formation at the cavity center of a hot spot of ions at high density and temperature, similar to that in inertial electrostatic confinement.

关键词： laser fusion neutron sources particle beam focusing ELECTROSTATIC CONFINEMENT FUSION DEVICE

来源：评论

学校读者我要写书评

暂无评论

The prediction model based on RBF network in achieving elastic cloud

引用

Advances in Information sciences and Service sciences 2011年第11期3卷 67-78页

作者： Shi, Peichang Wang, Huaimin Ding, Bo Liu, Ran Wang, Tianzuo National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology China Department of Electronics and Information Engineering Huazhong University of Science Technology China

Cloud needs to have rapid and elastic resources supply capability, because of the fluctuant resources demand of end-users. Multi-scale resources elastic binding is an important method to provide cloud services with rapid and elastic service capability. The most challenging problem in multi-scale resources elastic binding is how to predict the dynamic resource demand of end-users, and then decide when and to what extent multi-scale resources need elastic binding based on the prediction. In this paper, we present the prediction model based on RBF (Radial Basis Function) Network, which is used to predict end-users resource demand in advance. Compared with current prediction methods, it has faster prediction speed and higher prediction accuracy. Then we use traces data (the bandwidth demand of Web type of cloud services) collected from a real-world cloud provider: ChinaCache, as the training and testing data set to validate the method. Finally, we evaluate the predicted results using general prediction accuracy metrics. The results prove that the prediction model based on RBF network is able to resolve the decision problem in multi-scale resources elastic binding.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：