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

Software Defect Prediction via Deep Belief Network

Chinese Journal of Electronics 2019年第5期28卷 925-932页

作者： WEI Hua SHAN Chun HU Changzhen ZHANG Yu YU Xiao School of Computer Science and Technology Beijing Institute of Technology China Information Technology Security Evaluation Center Beijing Key Laboratory of Software Security Engineering Technology Beijing Institute of Technology School of Electrical and Information Engineering and Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing University of Civil Engineering and Architecture State Key Laboratory in China for Geomechanics and Deep Underground Engineering (Beijing) China University of Mining and Technology School of Computer Science and Technology Shandong University of Technology

Defect distribution prediction is a meaningful topic because software defects are the fundamental cause of many attacks and data loss. Building accurate prediction models can help developers find bugs and prioritize their testing efforts. Previous researches focus on exploring different machine learning algorithms based on the features that encode the characteristics of *** problem of data redundancy exists in software defect data set, which has great influence on prediction *** propose a defect distribution prediction model(Deep belief network prediction model, DBNPM), a system for detecting whether a program module contains defects. The key insight of DBNPM is Deep belief network(DBN)technology, which is an effective deep learning technique in image processing and natural language processing,whose features are similar to defects in source *** results show that DBNPM can efficiently extract and process the data characteristics of source program and the performance is better than Support vector machine(SVM), Locally linear embedding SVM(LLE-SVM), and Neighborhood preserving embedding SVM(NPE-SVM).

关键词： Defect prediction Software security Deep belief network(DBN)

来源：评论

学校读者我要写书评

暂无评论

An enhanced QoS decomposition approach for efficient service composition

An enhanced QoS decomposition approach for efficient service...

引用

International Conference on computer science and Education

作者： Jin, Jun Zhang, Yu Cao, Yuanda Zhou, Ruitao Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing China School of Computer Science Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (纸本)9781424460052

For each service class, there exist many alternative web services that provide the same functionality and different quality parameters, to find an optimal composition, most service selection approach in decentralized environment enumerate all possible combinations of service candidates. However, with the growing number of alternative services, those approaches will achieve a poor performance. To improve the performance, in this paper we proposed a QoS decomposition approach, that divide the global constraints into separate ones for each involved service class. With the separate constraints, each service class engages in service selection independently and simultaneously. Moreover, besides sequential pattern our approach also supports parallel pattern. Experimental results indicate that our approach performs efficiently and can achieve near-optimal solutions. ©2010 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Improving latency tolerance of network processors through simultaneous multithreading

引用

6th International Workshop on Advanced Parallel Processing Technologies, APPT 2005

作者： Liang, Bo An, Hong Lu, Fang Guo, Rui Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Computer Architecture Laboratory Institute of Computing Technology Chinese Academy of Sciences Beijing 100086 China

ISBN: (纸本)3540296395

Existing multithreaded network processors architecture with multiple processing engines (PEs), aims at taking advantage of blocked multithreading technique which executes instructions of different user-defined threads in the same PE pipeline, in explicit and interleave way. Multiple PEs, each of which is a multithreaded processor core, process several packets in parallel to hide long memory access latency. Most of them are optimized for throughputs mostly in data-plane. In future network workloads, the boundaries between data-plane and control-plane become blurred, so that PEs are demanded not only wire speed packet forwarding on data-plane, but also highly intelligent and increased complex packet processing function on control-plane. In this paper, we analyze SMT's short latency tolerance potential when used in out-of-order and dynamic scheduling PE cores. We show in this paper that 2-4 issue SMT provides an excellent short memory and branch latency tolerance, which gain higher instructions throughout as well as much simpler structures. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

History and grouping based probabilistic routing in DTNs

History and grouping based probabilistic routing in DTNs

引用

International Conference on computer science and Education

作者： Zhou, Ruitao Zhang, Yu Cao, Yuanda Jin, Jun Beijing Laboratory of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing China School of Computer Science Beijing University of Civil Engineering and Architecture Beijing China

ISBN: (纸本)9781424460052

Delay and Tolerant Networks (DTNs) have been proposed to address data communication challenges in network scenarios, where no instantaneous end-to-end path is guaranteed because of frequent and long duration network partitions. Typical protocols forward a message to multiple nodes to improve message delivery rate. However, a large number of replications of original messages consume a large amount of system resources that are quite limited in such scenarios. History and Grouping based Probabilistic Routing (HGPR) is proposed in this paper to reduce the number of replications by limiting the range of message "infection" of Epidemic. Nodes are divided into different groups, and the "epidemic" only happens within certain groups. History contacts information is used for group selecting in HGPR. Simulation results show that HGPR performs better than both Epidemic and PROPHET in the community scenario, and it outperforms G-Epidemic in some metrics. ©2010 IEEE.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

H-DB: Yet another big data hybrid system of Hadoop and DBMS

H-DB: Yet another big data hybrid system of Hadoop and DBMS

引用

13th International Conference on Algorithms and architectures for Parallel Processing, ICA3PP 2013

作者： Luo, Tao Chen, Guoliang Zhang, Yunquan School of Computer Science and Technology University of Science and Technology of China 230027 Hefei China State Key Laboratory of Computer Architecture Institute of Computing Technology CAS 100190 Beijing China

ISBN: (纸本)9783319038582

With the explosion of the amount of data, analytics applications require much higher performance and scalability. However, traditional DBMS encounters the tough obstacle of scalability, and could not handle big data easily. In the meantime, due to the complex relational data model, the large amount of historical data and the independent demand of subsystems, it is not suitable to use either shared-nothing MPP architecture (e.g. Hadoop) or existing hybrid architecture (e.g. HadoopDB) to replace completely. In this paper, considering the feasibility and versatility of building a hybrid system, we propose a novel prototype H-DB which takes DBMSs as the underlying storage and execution units, and Hadoop as an index layer and a cache. H-DB not only retains the analytical DBMS, but also could handle the demands of rapidly exploding data applications. The experiments show that H-DB meets the demand, outperforms original system and would be appropriate for analogous big data applications. © Springer International Publishing Switzerland 2013.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

TSCMR:Two-Stage Cross-Modal Retrieval 9th

TSCMR:Two-Stage Cross-Modal Retrieval

引用

19th International Conference on Advanced Data Mining and Applications, ADMA 2023

作者： Chen, Zhihao Wang, Hongya School of Computer Science and Technology Donghua University Shanghai China State Key Laboratory of Computer Architecture Institute of Computing Technology CAS Beijing China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China

ISBN: (纸本)9783031466731

Currently, large-scale vision and language models has significantly improved the performances of cross-modal retrieval tasks. However, large-scale models require a substantial amount of computing resources, so the execution of these models on devices with limited resources is challenging. Thus, it is paramount to reduce the model size and minimize computing costs of a model without sacrificing its performance. In this paper, we improved TERAN by dividing cross-modal retrieval into two stages: image-text coarse-grained matching and image-text fine-grained matching. Specifically, we present a novel approach called Two-Stage Cross-Modal Retrieval network(TSCMR). To reduce model size after model training, our approach utilized a new knowledge distillation method for Transformer-based models. Experiments have shown that our approach maintains a performance comparable to TERAN on the MS-COCO 1K test set, while being 2x smaller and 3.1x faster on inference. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

A Pipelining Loop Optimization Method for Dataflow architecture

引用

Journal of computer science & Technology 2018年第1期33卷 116-130页

作者： Xu Tan Xiao-Chun Ye Xiao-Wei Shen Yuan-Chao Xu Da Wang Lunkai Zhang Wen-Ming Li Dong-Rui Fan Zhi-Min Tang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 1000J9 China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125 China College of Information Engineering Capital Normal University Beijing 100048 China Department of Computer Science The University of Chicago Chicago IL 60637 U.S.A.

With the coming of exascale supercomputing era, power efficiency has become the most important obstacle to build an exascale system. Dataflow architecture has native advantage in achieving high power efficiency for scientific applications. However, the state-of-the-art dataflow architectures fail to exploit high parallelism for loop processing. To address this issue, we propose a pipelining loop optimization method （PLO）, which makes iterations in loops flow in the processing element （PE） array of dataflow accelerator. This method consists of two techniques, architecture-assisted hardware iteration and instruction-assisted software iteration. In hardware iteration execution model, an on-chip loop controller is designed to generate loop indexes, reducing the complexity of computing kernel and laying a good f（mndation for pipelining execution. In software iteration execution model, additional loop instructions are presented to solve the iteration dependency problem. Via these two techniques, the average number of instructions ready to execute per cycle is increased to keep floating-point unit busy. Simulation results show that our proposed method outperforms static and dynamic loop execution model in floating-point efficiency by 2.45x and 1.1x on average, respectively, while the hardware cost of these two techniques is acceptable.

关键词： dataflow model control-flow model loop optimization exascale computing scientific application

来源：评论

学校读者我要写书评

暂无评论

Using Mobile Sinks in WSN: Computational Complexity and a Theoretical Bound

引用

电子学报(英文版) 2011年第1期20卷 147-150页

作者： GU Yu JI Yusheng CHEN Hongyang ZHAO Baohua Department of Computer Science University of Science and Technology of China Hefei China State Key Laboratory of Networking and Switching Technology Beijing China Information Systems Architecture Science Research Division NII Tokyo Japan Institute of Industrial Science University of Tokyo Tokyo Japan

In this paper, we study the lifetime op- timization problem in wireless sensor networks using mo- bile sink nodes. This problem is inherently difficult since we need to consider both sink scheduling and data rout- ing. Through a simple case study we develop a novel no- tation named the Placement pattern (PP) to bound traffic patterns with candidate locations. This significantly de- creases the number of elements needed to be scheduled. Based on the PP, we mathematically formulate this opti- mization problem as a Mixed-integer non-linear program- ming (MINLP), which is very tough and time consuming to solve. By proving that the problem is NP-complete, we point out that instead of seeking an optimal algorithm, heuristic algorithms, especially those with performance guarantee, would be much more desirable to develop. Fur- thermore, in order to help identify performance gains of heuristic algorithms proposed in the future, we develop a Linear programming (LP) formulation which serves as an upper bound by adopting a reformulation and relaxation technique.

关键词：无线传感器网络移动接收计算复杂性混合整数非线性规划启发式算法 NP完全问题优化问题 MINLP

来源：评论

学校读者我要写书评

暂无评论

Persistent B+-Trees in non-volatile main memory 41st

Persistent B+-Trees in non-volatile main memory

引用

41st International Conference on Very Large Data Bases, VLDB 2015

作者： Chen, Shimin Jin, Qin State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Computer Science Department School of Information Renmin University of China China

computer systems in the near future are expected to have Non- Volatile Main Memory (NVMM), enabled by a new generation of Non-Volatile Memory (NVM) technologies, such as Phase Change Memory (PCM), STT-MRAM, and Memristor. The non-volatility property has the promise to persist in-memory data structures for instantaneous failure recovery. However, realizing such promise requires a careful design to ensure that in-memory data structures are in known consistent states after failures. This paper studies persistent in-memory B+-Trees as B+-Trees are widely used in database and data-intensive systems. While traditional techniques, such as undo-redo logging and shadowing, support persistent B+-Trees, we find that they incur drastic performance overhead because of extensive NVM writes and CPU cache flush operations. PCM-friendly B+-Trees with unsorted leaf nodes help mediate this issue, but the remaining overhead is still large. In this paper, we propose write atomic B+-Trees (wB+-Trees), a new type of main-memory B+-Trees, that aim to reduce such overhead as much as possible. wB+-Tree nodes employ a small indirect slot array and/or a bitmap so that most insertions and deletions do not require the movement of index entries. In this way, wB+- Trees can achieve node consistency either through atomic writes in the nodes or by redo-only logging. We model fast NVM using DRAM on a real machine and model PCM using a cycle-accurate simulator. Experimental results show that compared with previous persistent B+-Tree solutions, wB+-Trees achieve up to 8.8x speedups on DRAM-like fast NVM and up to 27.1x speedups on PCM for insertions and deletions while maintaining good search performance. Moreover, we replaced Memcached's internal hash index with tree indices. Our real machine Memcached experiments show that wB+-Trees achieve up to 3.8X improvements over previous persistent tree structures with undo-redo logging or shadowing. © 2015 VLDB Endowment 21508097/15/03.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

An energy-aware file relocation strategy based on file-access frequency and correlations 15th

An energy-aware file relocation strategy based on file-acces...

引用

15th International Conference on Algorithms and architectures for Parallel Processing, ICA3PP 2015

作者： Hu, Cheng Deng, Yuhui Department of Computer Science Jinan University Guangzhou510632 China State Key Laboratory of Computer Architecture Institute of Computing Chinese Academy of Sciences Beijing100190 China

ISBN: (纸本)9783319271392

Energy consumption has become a big challenge of the traditional storage systems due to the explosive growth of data. A lot of research efforts have been invested in reducing the energy consumption of those systems. Traditionally, the frequently accessed data are concentrated into a small part of hot storage nodes, and other cold storage nodes are switched to a low-power state, thus saving energy. However, due to the energy penalty and time penalty, it takes extra energy and generates additional delay to switch a cold storage node from a low-power state to an active state. In contrast to the existing work, this paper proposes a Skew File Relocate (SFR) strategy which aggregates the correlated cold files to the same cold storage node in addition to concentrating the frequently accessed files to the hot nodes. Because the correlated files are normally accessed together, SFR can significantly reduce the number of power state transitions and lengthen the idle periods that the cold storage nodes are experienced, thus saving more energy and improving the system response time. Furthermore, other three relocation strategies are designed to explore the performance behavior of SFR. Experimental results demonstrate that SFR can significantly reduce the energy consumption while maintaining the system performance at an acceptable level. © 2015 Springer International Publishing Switzerland.

关键词： Cold storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：