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

2010 International Conference on Field-Programmable Technology, FPT'10

作者： Wu, Guiming Dou, Yong Wang, Miao National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Jiangnan Institute of Computing Technology Wuxi 214083 China

ISBN: (纸本)9781424489817

In this paper, we present an automatic synthesis framework to map loop nests to processor arrays with local memories on FPGAs. An affine transformation approach is firstly proposed to address space-time mapping problem. Then a data-driven architecture model is introduced to enable automatic generation of processor arrays by extracting this data-driven architecture model from transformed loop nests. Some techniques including memory allocation, communication generation and control generation are presented. Synthesizable RTL codes can be easily generated from the architecture model built by these techniques. A preliminary synthesis tool is implemented based on PLUTO, an automatic polyhedral source-to-source transformation and parallelization framework. © 2010 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

High performance and memory efficient implementation of matrix multiplication on FPGAs

High performance and memory efficient implementation of matr...

引用

2010 International Conference on Field-Programmable Technology, FPT'10

ISBN: (纸本)9781424489817

We present a high performance and memory efficient hardware implementation of matrix multiplication for dense matrices of any size on the FPGA devices. By applying a series of transformations and optimizations on the original serial algorithm, we can obtain an I/O and memory optimized block algorithm for matrix multiplication on FPGAs. A linear array of processing elements (PEs) is proposed to implement this block algorithm. We show significant reduction in hardware resources consuming compared to the related work while increasing clock frequency. Moreover, the memory requirement can be reduced to O(S) from O(S 2), where S is the block size. Therefore, more PEs can be integrated into the same FPGA devices. © 2010 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

An interface theory based approach to verification of web services

An interface theory based approach to verification of web se...

引用

30th Annual International Computer Software and Applications Conference, COMPSAC 2006

作者： Zhenbang, Chen Ji, Wang Wei, Dong Zhichang, Qi Yeung, W.L. National Laboratory for Parallel and Distributed Processing Changsha China Department of Computing and Decision Sciences Lingnan University Hong Kong Hong Kong

ISBN: (纸本)0769526551

The verification of web services becomes a challenge in software verification. This paper presents a framework for verification of web service interfaces at various abstraction levels. Its foundation is the interface theory for web services, in which transaction features are incorporated. Within the framework, one may check non mutual invocation, compatibility and refinement of web services at signature, conversation and protocol levels. At protocol level, we present a model checking approach to verifying the protocol properties in Action Set Computation Tree Logic(ASCTL). The paper also discusses the integration of our framework into the web service development. © 2006 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with Dynamic Substrate Network in Data Centre Networks

引用

China Communications 2013年第9期10卷 130-142页

作者：李小玲王怀民丁博李小勇刘惠 National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are *** this paper,we first propose the resource allocation with the dynamic SN,and denote it as ***,we propose an efficient mapping algorithm for *** performance of the proposed algorithm is evaluated by performing simulation *** results show that the proposed algorithm can effectively solve the GraphMap-DS.

关键词： resource allocation data centrenetwork workload substrate algorithm

来源：评论

学校读者我要写书评

暂无评论

BCE: A privacy-preserving common-friend estimation method for distributed online social networks without cryptography

BCE: A privacy-preserving common-friend estimation method fo...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed online social networks (DOSN) have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose BCE (Bloom Filter based Common-Friend Estimation), a scalable and privacy-preserving common-friend estimation scheme that estimates the set of common friends without the need of cryptography techniques. First, BCE denotes each user using the identifiers created by the Peer-to-Peer underlay that are robust against the dictionary attacks. Second, BCE uses a Bloom filter to represent a friend list for scalability. Third, BCE estimates common friends of two users using the intersection of Bloom filters computed by one of their common friends, which ensures the privacy of friend lists against unknown users. Our privacy analysis shows that BCE hides the privacy of each user with a high probability. Simulations over real-world social-network data sets confirms that BCE is both accurate and scalable. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

ESFMTO: A reliable task offloading strategy based on edge server failure model in IIoT

引用

Ad Hoc Networks 2025年 176卷

作者： Yubin Yang Yan Chen Ningjiang Chen Juan Chen School of Computer and Electronic Information Guangxi University Nanning 530004 China Key Laboratory of Parallel Distributed and Intelligent Computing (Guangxi University) Education Department of Guangxi Zhuang Autonomous Region Nanning 530004 China Guangxi Center of Technology Innovation for Intelligent Digital Services Nanning 530004 China

The extensive use of automation equipment and sensors in the Industrial Internet of Things (IIoT) has led to a significant increase in data volume, which has placed higher demands on the real-time processing capability. Edge computing enables real-time response and rapid decision-making by offloading data processing to the edge of the network. However, the complexity of the industrial production environment leads to edge server failures, which seriously affects the system stability and security. To address this issue, this paper develops an edge server failure model for IIoT, analyzing the interaction between the hardware failure and the container failure during the failure occurrence and recovery. Further, based on the edge server failure model, a task offloading strategy named ESFMTO is proposed, which employs the SAC-BNN (Soft Actor-Critic with Bayesian Neural Network) algorithm. The probability distribution of the task completion time is updated through the Bayesian Neural Network (BNN), accurately evaluating the Conditional Value at Risk (CVaR). During the training process of Deep Reinforcement Learning (DRL), a perturbation neural network is introduced to perturb the input state, which enhances the system robustness under uncertain failure conditions. Unlike existing approaches that often assume each edge server hosts a single container, the paper explicitly considers multi-container deployment in IIoT, bridging the gap between theoretical assumptions and real-world industrial requirements. Experimental results demonstrate that SAC-BNN outperforms existing methods in dealing with the edge server failure, reducing CVaR by at least around 0.9 and improving task completion rates by at least 13.86% compared to the baseline algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the feasibility of common-friend measurements for the distributed online social networks

On the feasibility of common-friend measurements for the dis...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed social networks have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose FDist, a distributed common-friend estimation scheme that estimates the number of common-friends between any pair of users without disclosing the friends' information. FDist uses privacy-preserving common-friend measurements to collect a small number of common-friend samples, and uses low-dimensional coordinates to estimate the number of common friends to other users. Simulation results on real-world social networks confirm that FDist is both scalable and accurate. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

parallelization of the training for face detection with transactional memory

Parallelization of the training for face detection with tran...

引用

2011 International Conference on Automation and Robotics, ICAR 2011

作者： Zeng, Kun Key Laboratory and Technology for National Defence of Parallel and Distributed Processing School of Computer National Univiersity of Defense Technology ChangSha Hunan China

ISBN: (纸本)9783642256455

The development of multi-core processor makes the parallelization of traditional sequential algorithms increasingly important. Meanwhile, transactional memory serves a good parallel programming model. This paper takes the advantage of software transactional memory to parallelize the Multi-Exit Asymmetric Adaboost algorithm for face detection. The parallel version is evaluated on three different implementations of software transactional memory. The experiment results show that the transactional memory based parallelization outperforms the traditional lock based approach. A speedup of nearly seven is achieved on a eight-core machine on an eight-core system. © 2011 Springer-Verlag.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

AUModel: A conceptual model for adaptive software 5

AUModel: A conceptual model for adaptive software

引用

2014 5th IEEE International Conference on Software Engineering and Service Science, ICSESS 2014

作者： Liu, Hui Ding, Bo Shi, Dianxi Wang, Huaimin National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781479932788

Pervasive software should be able to adapt itself to the changing environments and user requirements. Obviously, it will bring great challenges to the software engineering practice. This paper proposes AUModel, a conceptual model for adaptive software, which takes adaptability as an inherent feature and can act as the foundation of the engineering process. By introducing AUModel, the reuse of software adaptation infrastructure as well as the separation of adaptation concerns are enabled, which can facilitate both the development and maintenance of adaptive software. This paper also presents our initial attempts to realize this model, including a middleware prototype to support this model and an application to validate its effectiveness. © 2014 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Research on Fine-Grained Sentiment Classification 8th

Research on Fine-Grained Sentiment Classification

引用

8th CCF International Conference on Natural Language Processing and Chinese computing, NLPCC 2019

作者： Wang, Zhihui Wang, Xiaodong Chang, Tao Lv, Shaohe Guo, Xiaoting National Key Laboratory of Parallel and Distributed Processing College of Computer Science and Technology National University of Defence Technology Changsha410073 China

ISBN: (纸本)9783030322359

Aiming at the fine-grained sentiment classification that distinguishes the emotional intensity, the commonly used dataset SST-1 is analyzed in depth. Through the analysis, it is found that the dataset has serious problems such as data imbalance and small overall scale, which seriously restricts the classification effect. In order to solve the related problems, data augmentation method is adopted to realize the optimization of the dataset. The IMDB and other data which are relatively homologous to the original dataset are annotated, and the focus is to expand the categories with fewer numbers. By this way, the problem of data imbalance is effectively alleviated and the original data scale is expanded. Then, based on the Bidirectional Encoder Representations from Transformers (BERT) model, which has good overall performance on natural language processing, the benchmark classification model is built. Through multiple comparison experiments on the original dataset and the enhanced data, the influence of the deficiency of the original dataset on the classification effect is verified. And, it is fully demonstrated that the enhanced data can effectively improve the test results and solve the problem of large differences in performance between different categories well. © 2019, Springer Nature Switzerland AG.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：