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

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Liao, Hao Liu, Qixin Vidmer, Alexandre Zhou, Mingyang Mao, Rui National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126166

In the past two decades, analyzing the information network has been intensively studied from various disciplines. Small world property and scale-free property prevail in network science research. The comparison and classification of different kinds of graphs are extremely important. However, how to design a robust and accurate classification with deep learning techniques for network property still lack enough attention, which is a vital task in various application scenarios. In this paper, we proposed the reliable network property classifier based on graph embedding(RNC) to classify the network property (scale free or small world property). In order to process non-euclidean data, we embedded each network into an image and use dimensional reduction, rasterization, and convolutional neural networks to complete the classification problem. The method can effectively accomplish classification tasks in not only artificial networks but also real networks. Besides, RNC wins greatly in terms of robustness on real networks, showing the robustness of RNC against the incomplete structure of the network. © 2019 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

The Library for Hadoop Deflate Compression Based on FPGA Accelerator with Load Balance 20

The Library for Hadoop Deflate Compression Based on FPGA Acc...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Du, Haixin Zhang, Jiankui Sha, Shihao Ye, Cai Luo, Qiuming College of Computer Science and Software Engineering Shenzhen University NHPCC/Guangdong Key Laboratory of Popular HPC Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

ISBN: (纸本)9781728126166

Hadoop application will produce lots of intermediate results in the map/reduce process that requires disk I/O and network transmission. By compressing the large-scale data of intermediate result, it will greatly improve disk access efficiently and reduce program run time. Hardware-accelerated solutions have become more desirable. This paper design a multi-FPGA compression accelerator on the Hadoop platform, and the system performance analysis compared with a software-only solution that mainly uses CPU to processing. The testing programs are zpipe, TestDFSIO and Terasort. In contrast with the software-only solution. The max speedup of zpipe is 6.55X (single FPGA) and 10.24X (dual FPGA), the max speedup of TestDFSIO is 6.28X (single FPGA) and 6.28X (dual FPGA), and the max speedup of Terasort application is up to 3.25X(single FPGA) and 3.35X(dual FPGA). © 2019 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Multiplex Symbolic Execution: Exploring Multiple Paths by Solving Once

Multiplex Symbolic Execution: Exploring Multiple Paths by So...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Yufeng Zhang Zhenbang Chen Ziqi Shuai Tianqi Zhang Kenli Li Ji Wang College of Computer Science and Electronic Engineering Hunan University Changsha China College of Computer National University of Defense Technology Changsha China College of Computer Science and Electronic Engineering National Supercomputing Center in Changsha Hunan University Changsha China College of Computer State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China

ISBN: (数字)9781450367684

ISBN: (纸本)9781728172811

Path explosion and constraint solving are two challenges to symbolic execution's scalability. Symbolic execution explores the program's path space with a searching strategy and invokes the underlying constraint solver in a black-box manner to check the feasibility of a path. Inside the constraint solver, another searching procedure is employed to prove or disprove the feasibility. Hence, there exists the problem of double searchings in symbolic execution. In this paper, we propose to unify the double searching procedures to improve the scalability of symbolic execution. We propose Multiplex Symbolic Execution (MuSE) that utilizes the intermediate assignments during the constraint solving procedure to generate new program inputs. MuSE maps the constraint solving procedure to the path exploration in symbolic execution and explores multiple paths in one time of solving. We have implemented MuSE on two symbolic execution tools (based on KLEE and JPF) and three commonly used constraint solving algorithms. The results of the extensive experiments on real-world benchmarks indicate that MuSE has orders of magnitude speedup to achieve the same coverage.

关键词： Multiplexing Scalability Tools Search problems Explosions Space exploration software engineering

来源：评论

学校读者我要写书评

暂无评论

A holistic stream partitioning algorithm for distributed stream processing systems 20

A holistic stream partitioning algorithm for distributed str...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Li, Kejian Liu, Gang Lu, Minhua Guangdong Province Key Laboratory of Popular High Performance Computers Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Biomedical Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9781728126166

The performances of modern distributed stream processing systems are critically affected by the distribution of the load across workers. Skewed data streams in real world are very common and pose a great challenge to these systems, especially for stateful applications. Key splitting, which allows a single key to be routed to multiple workers, is a great idea to achieve good balance of load in the cluster. However, it comes with the cost of increased memory consumption and computation overhead as well as network communication. In this paper, we present a new definition of metric to model the cost of key splitting for intra-operator parallelism in stream processing systems and provide a novel perspective to reduce replication factor while keeping both overall load imbalance and processing latency low. Similar to previous work, our approach treats the head and the tail of the distribution differently in order to reduce memory requirements. For the head, it uses our proposed notion of regional load imbalance to decide dynamically whether to make one more worker responsible for the heavy hitter or not. For the tail, it simply uses hash partitioning to keep the size of the routing table for the head as small as possible. Extensive experimental evaluation demonstrates that our approach provides superior performance compared to the state-of-the-art partitioning algorithms in terms of load imbalance, replication factor and latency over different levels of skewed stream distributions. © 2019 IEEE.

关键词： Distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Implementing the matrix multiplication with dfc on kunlun small scale computer 20

Implementing the matrix multiplication with dfc on kunlun sm...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Du, Zheng Zhang, Jing Sha, Shihao Luo, Qiuming Department of Computer Science and Technology Tsinghua University China NHPCC/Guangdong Key Laboratory of Popular HPC Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781728126166

In this paper, we demonstrate a new dataflow platform of DFC, which can handle the successive dataflow computing passes with tagged data. By implementing the matrix multiplication in DFC, we show that DFC can exploit the parallelism automatically with a much simple dataflow graph constructed by DF functions of DFC. Different from the other dataflow execution platform, DFC support multiple worker threads for one dataflow node of DF functions. By running the matrix multiplication program of DFC on Kunlun system, it was verified that DFC get a reasonable speedup for large scale computing for thread number up to 512. © 2019 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

MERITS: Medication Recommendation for Chronic Disease with Irregular Time-Series

MERITS: Medication Recommendation for Chronic Disease with I...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Shuai Zhang Jianxin Li Haoyi Zhou Qishan Zhu Shanghang Zhang Danding Wang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University China School of Computer Science and Engineering Beihang University China Shenyuan Honors College Beihang University China School of Software Beihang University China National University of Singapore >Singapore

ISBN: (纸本)9781665423991

Medication recommendation for chronic diseases based on the complex historical electronic medical records (EMR) is an important and challenging research problem in medical informatics because the medical records are often irregularly sampled and contain many missing data. However, most existing approaches fail to explore the irregular time-series dependencies and ignore the consecutive correlation in dynamic prescription history. To fill this gap, we propose the MEdication Recommendation network on Irregular Time-Series (MERITS), which captures the irregular time-series dependencies with the neural ordinary differential equations (Neural ODE). Meanwhile, it leverages a drug-drug interaction knowledge graph and two learned medication relation graphs to explore the co-occurrence and sequential correlations of the medications. We further propose an attention-based encoder-decoder framework to combine the historical information of patients and medications from EMR. Besides, we collect and annotate a diabetes inpatient medication dataset and demonstrate the effectiveness of MERITS by comparing it with several state-of-the-art methods of medication recommendations.

关键词： Correlation Data visualization Ordinary differential equations Data models Diabetes History Electronic medical records

来源：评论

学校读者我要写书评

暂无评论

Characterisation of state-preparation uncertainty in quantum key distribution

arXiv

引用

arXiv 2022年

作者： Huang, Anqi Mizutani, Akihiro Lo, Hoi-Kwong Makarov, Vadim Tamaki, Kiyoshi Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China Graduate School of Engineering Science Osaka University Toyonaka Osaka560-8531 Japan Department of Electrical & Computer Engineering Department of Physics University of Toronto TorontoONM5S 3G4 Canada Department of Physics University of Hong Kong Pokfulam Hong Kong Quantum Bridge Technologies Inc. 100 College Street TorontoONM5G 1L5 Canada Russian Quantum Center Skolkovo Moscow121205 Russia Shanghai Branch National Laboratory for Physical Sciences at Microscale and CAS Center for Excellence in Quantum Information University of Science and Technology of China Shanghai201315 China NTI Center for Quantum Communications National University of Science and Technology MISiS Moscow119049 Russia Faculty of Engineering University of Toyama Gofuku 3190 Toyama930-8555 Japan

To achieve secure quantum key distribution, all imperfections in the source unit must be incorporated in a security proof and measured in the lab. Here we perform a proof-of-principle demonstration of the experimental techniques for characterising the source phase and intensity fluctuation in commercial quantum key distribution systems. When we apply the measured phase fluctuation intervals to the security proof that takes into account fluctuations in the state preparation, it predicts a key distribution distance of over 100 km of fiber. The measured intensity fluctuation intervals are however so large that the proof predicts zero key, indicating a source improvement may be needed. Our characterisation methods pave the way for a future certification standard. Copyright © 2022, The Authors. All rights reserved.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-based Energy-Aware Offloading in Edge-Cloud Vehicular Networks

引用

Procedia computer science 2021年 191卷 328-336页

作者： Leila Ismail Huned Materwala Intelligent Distributed Computing and Systems Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al Ain Abu Dhabi 15551 United Arab Emirates National Water and Energy Center United Arab Emirates University Al Ain Abu Dhabi 15551 United Arab Emirates

A vehicular network underpinned by the 3-tier vehicle-edge-cloud infrastructure enables an efficient and safer travel experience. The compute-intensive vehicular applications are often offloaded to the edge and/or cloud servers to enhance the applications’ Quality of Services (QoS). The underlying edge-cloud servers consume a high among of energy. Consequently, it becomes crucial to optimizing energy consumption in the offloading process. Current energy-efficient offloading strategies in 2-tier vehicle-edge infrastructure, do not account for cloud computing energy consumption. In this paper, we address this void by proposing a machine learning-based energy-aware offloading algorithm, which optimizes the energy of the edge-cloud computing platform. The offloading strategy is enabled by the Support Vector Machine (SVM) regression model machine learning algorithm used for the edge-cloud power prediction. The experimental results show that the proposed algorithm is a promising approach in energy savings.

关键词： Cloud computing Computation offloading Edge computing Energy-efficiency Machine learning Queuing theory Support Vector Machine (SVM) Vehicular network

来源：评论

学校读者我要写书评

暂无评论

ON THE OPPORTUNITIES OF GREEN computing: A SURVEY

arXiv

引用

arXiv 2023年

作者： Zhou, You Lin, Xiujing Zhang, Xiang Wang, Maolin Jiang, Gangwei Lu, Huakang Wu, Yupeng Zhang, Kai Yang, Zhe Wang, Kehang Sui, Yongduo Jia, Fengwei Tang, Zuoli Zhao, Yao Zhang, Hongxuan Yang, Tiannuo Chen, Weibo Mao, Yunong Li, Yi Bao, De Li, Yu Liao, Hongrui Liu, Ting Liu, Jingwen Guo, Jinchi Zhao, Xiangyu Wei, Ying Qian, Hong Liu, Qi Wang, Xiang Chan, Wai Kin Li, Chenliang Li, Yusen Yang, Shiyu Yan, Jining Mou, Chao Han, Shuai Jin, Wuxia Zhang, Guannan Zeng, Xiaodong Tsinghua University China Shanghai Jiaotong University China University of Science and Technology of China China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University China Huazhong University of Science and Technology China Shanghai Institute of AI for Education School of Computer Science and Technology East China Normal University China Xi’an Jiaotong University China College of Computer Science Nankai University China School of Computer Science China University of Geosciences China School of Information Science and Technology Beijing Forestry University China Engineering Research Center for Forestry-Oriented Intelligent Information Processing National Forestry and Grassland Administration China Guangzhou University China Nanyang Technological University Singapore City University of Hong Kong Hong Kong Wuhan University China State Key Laboratory for Novel Software Technology Nanjing University China Ant Group China

Artificial Intelligence (AI) has achieved significant advancements in technology and research with the development over several decades, and is widely used in many areas including computing vision, natural language processing, time-series analysis, speech synthesis, etc. During the age of deep learning, especially with the arise of Large Language Models, a large majority of researchers’ attention is paid on pursuing new state-of-the-art (SOTA) results, resulting in ever increasing of model size and computational complexity. The needs for high computing power brings higher carbon emission and undermines research fairness by preventing small or medium-sized research institutions and companies with limited funding in participating in research. To tackle the challenges of computing resources and environmental impact of AI, Green computing has become a hot research topic. In this survey, we give a systematic overview of the technologies used in Green computing. We propose the framework of Green computing and devide it into four key components: (1) Measures of Greenness, (2) Energy-Efficient AI, (3) Energy-Efficient computing Systems and (4) AI Use Cases for Sustainability. For each components, we discuss the research progress made and the commonly used techniques to optimize the AI efficiency. We conclude that this new research direction has the potential to address the conflicts between resource constraints and AI development. We encourage more researchers to put attention on this direction and make AI more environmental friendly. Copyright © 2023, The Authors. All rights reserved.

关键词： Carbon footprint

来源：评论

学校读者我要写书评

暂无评论

Efficient Multiplex Symbolic Execution with Adaptive Search Strategy

Efficient Multiplex Symbolic Execution with Adaptive Search ...

引用

IEEE International Conference on Automated software engineering (ASE)

作者： Tianqi Zhang Yufeng Zhang Zhenbang Chen Ziqi Shuai Ji Wang College of Computer National University of Defense Technology Changsha China College of Computer Science and Electronic Engineering Hunan University Changsha China State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China

ISBN: (数字)9781450367684

ISBN: (纸本)9781728172811

Symbolic execution is still facing the scalability problem caused by path explosion and constraint solving overhead. The recently proposed MuSE framework supports exploring multiple paths by generating partial solutions in one time of solving. In this work, we improve MuSE from two aspects. Firstly, we use a light-weight check to reduce redundant partial solutions for avoiding the redundant executions having the same results. Secondly, we introduce online learning to devise an adaptive search strategy for the target programs. The preliminary experimental results indicate the promising of the proposed methods.

关键词： Multiplexing Scalability Search problems Explosions software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：