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

作者： Feng, Hao Deng, Yuhui Yu, Liang Department of Computer Science Jinan University Guangzhou China Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China

With the explosive growth of data, hundreds of thousands of servers may be contained in a single data center. Hence, node failures are unavoidable and generally negatively effects the performance of the whole data center. Additionally, data centers with a large number of nodes will cause plenty of energy consumption. Many existing task scheduling techniques can effectively reduce the power consumption in data centers by considering heat recirculation. However, the traditional techniques do not take the situation of node failures into account. This paper proposes an airflow-based failure model for data centers by leveraging heat recirculation. In this model, the spatial distribution and time distribution of failures are considered. Furthermore, a genetic algorithm (GA) and a simulated annealing algorithm (SA) are implemented to evaluate the proposed failure model. Because the positions of node failures have a significant impact on the heat recirculation and the energy consumption of data centers, failures with different positions are analyzed and evaluated. The experimental results demonstrate that the energy consumption of data centers can be significantly reduced by using the GA and SA algorithms for task scheduling based on the proposed failure model. © 2019 John Wiley & Sons, Ltd.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Data Availability Optimization for Cyber-Physical Systems 15

Data Availability Optimization for Cyber-Physical Systems

引用

2022 IEEE Congress on Cybermatics: 15th IEEE International Conferences on Internet of Things, iThings 2022, 18th IEEE International Conferences on Green computing and Communications, GreenCom 2022, 2022 IEEE International Conference on Cyber, Physical and Social computing, CPSCom 2022 and 8th IEEE International Conference on Smart Data, SmartData 2022

作者： Li, Liying Cong, Peijin Zhou, Junlong Gu, Zonghua Li, Keqin School of Computer Science and Engineering Nanjing University of Science and Technology China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Department of Applied Physics and Electronics Ume˚a University Sweden Department of Computer Science State University of New York United States

ISBN: (数字)9781665454179

ISBN: (纸本)9781665454179

As the backbone of Industry 4.0, Cyber-Physical Systems (CPSs) have attracted extensive attention from industry, academia, and government. Missing data is a common problem in CPS data processing and may cause incorrect results and eventually serious malfunction. Existing data availability optimization methods either rely on a large amount of complete training data or suffer from poor performance. To solve these problems, this paper proposes an iterative data availability optimization method for CPSs. Specifically, the proposed method first pre-processes the raw dataset by using a Singular Value Decomposition-based feature selection approach to identify crucial features and reduce computation overheads. It then makes an initial guess for missing values via a designed K-Means-based imputation approach. The appropriate initial estimation decreases the probability of the proposed method falling into the local optimum. Finally, the proposed method iteratively estimates missing data based on the Orthogonal Matching Pursuit algorithm. The proposed method optimizes data availability by accurately imputing missing values. Simulation results on two datasets demonstrate that compared to multiple state-of-the-art approaches, the proposed data availability optimization method can reduce imputation error by up to 99.65%. © 2022 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Building Agile Workflow Microservice System for HPC Applications Based on Fast-start OSv 27

Building Agile Workflow Microservice System for HPC Applicat...

引用

27th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2021

作者： Hu, Qiang Ma, Lixian Shao, En Tan, Guangming Institute of Computing Technology CAS State Key Laboratory of Computer Architecture Beijing China University of Chinese Academy of Science Beijing China

ISBN: (纸本)9781665408783

The advances of containers have significantly promoted the development of microservice architecture. This architecture splits a monolithic application into multiple independent components and the container orchestrator manages these components by the container in the cloud environment. The feasibility of deploying high performance computing(HPC) applications as microservices has been proven, but the existing container orchestrator incurs a large performance overhead as there is interference between different containers on the same physical host. In this paper, we design an agile workflow microservice system for HPC applications with fast-start OSv. We consider improving HPC workflow performance from two aspects: single OSv startup time optimization and workflow orchestration optimization. For single OSv startup time optimization, we design a fast-start OSv by analyzing the process of OSv startup and finding an optimization by modifying OSv source code. In this way, we get nearly 50% improvement of startup time. For workflow orchestration optimization, we propose four optimization techniques to speed up the execution of workflow by jointly considering OSv and workflow features, namely: node fusion, node merge, image preload, boot delay. Furthermore, we utilize our fast startup OSv to design an orchestration system for efficiently building an agile HPC workflow microservice by Kubevirt. Our experimental results optimization microservice system reduces the execution time by 30% compared with the original deployment with docker. © 2021 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

LIAS: A Lightweight Incentive Authentication Scheme for Forensic Services in IoV

LIAS: A Lightweight Incentive Authentication Scheme for Fore...

引用

作者： Zhang, Mingyue Zhou, Junlong Cong, Peijin Zhang, Gongxuan Zhuo, Cheng Hu, Shiyan Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China Institute of Computing Technology Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100190 China Zhejiang University Department of Information Science and Electronic Engineering Hangzhou310027 China University of Southampton School of Electronics and Computer Science SouthamptonSO17 1BJ United Kingdom

Internet of Vehicles (IoV) has become an indispensable data sensing and processing platform in Internet of Things (IoT) for intelligent transportation. The mounted cameras on the vehicles along with the fixed roadside cameras are utilized to provide pictorial services for IoV users and law enforcement agencies. For such forensic services, ensuring the security and privacy of vehicles while guaranteeing the efficiency of data transmission among vehicles is important. In this paper, we propose a lightweight incentive authentication scheme (LIAS) for forensic services in IoV. LIAS is developed on a three-tier architecture containing cloud layer, fog layer, and user layer. LIAS uses pairing-free certificateless signcryption, pseudonym update mechanism, and incentive mechanism to realize a secure anonymous authentication efficiently. We conduct correctness and security analysis, as well as performance analysis and evaluation to validate the high security and efficiency of LIAS. Experimental results reveal that, the communication and computation overheads as well as the message delay and packet loss of LIAS are much lower than those of state-of-the-art techniques. Note to Practitioners - This paper is motivated by the security and privacy issues of forensic services in IoV for intelligent transportation. Our goal is to improve the security and privacy of vehicles while guaranteeing the lightweight and incentive of data transmission among the vehicles. Fog-assisted IoV is introduced to fully utilize the capacities of near-user edge devices as well as the connections between fog nodes and devices. However, it still faces the difficulties in ensuring vehicles' security and privacy. Moreover, vehicles' information dissemination could be easily monitored because of the unavoidable defect of wireless communication. Thereby, it is essential to guarantee the security and privacy of vehicles while enhancing the efficiency of vehicles' data transmission during the forensic service.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Efficient quantum process tomography for Clifford circuits

引用

Physical Review A 2023年第3期108卷 032419-032419页

作者： Shichuan Xue Guangyao Huang Yong Liu Dongyang Wang Weixu Shi Yingwen Liu Xiang Fu Anqi Huang Mingtang Deng Junjie Wu Institute for Quantum Information & State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha 410073 China

A Clifford circuit is a pivotal tool in quantum computing and has extensive applications in quantum error correction codes and topological quantum computing. Hence, it is essential to benchmark and verify the effect of Clifford circuits against noise and errors. Standard quantum process tomography is a fundamental technique for fully characterizing quantum dynamics, but at the cost of exponential time, space, and computation with an increasing number of qubits. Here, we propose an efficient quantum process tomography method for Clifford circuits. Combining with the stabilizer formalism, we prove theoretically that, for an n-qubit Clifford circuit, our method merely needs m ancillary qubits and ⌈n/m⌉ input stabilizer states to obtain the quantum process. Numerical simulation results show that our method could perfectly rebuild the unknown Clifford quantum circuit with fidelity over 99.99% to six qubit cases. Our work provides an efficient and practical approach to benchmark and verify Clifford circuits.

关键词： Quantum circuits Quantum information processing Quantum simulation Quantum tomography

来源：评论

学校读者我要写书评

暂无评论

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for Highly-Effective Drug-Protein Interaction Representation

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Qiu, Yanlong Wang, Siqi Yang, Xi Qiu, Xinyuan Wu, Chengkun Cui, Yingbo Yang, Canqun National University of Defense Technology Institute for Quantum Information State Key Laboratory of High-Performance Computing College of Computer Science Hunan Changsha410073 China National Supercomputer Center in Tianjin Tianjin300457 China National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science Hunan Changsha410073 China National University of Defense Technology Department of Biology and Chemistry College of Science Hunan Changsha410073 China

ISBN: (纸本)9798350337488

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词： Drug-Protein Interaction Knowledge Graph Embedding Triple Embedding Weakly Supervised Learning

来源：评论

学校读者我要写书评

暂无评论

Wrong-of-Thought: An Integrated Reasoning Framework with Multi-Perspective Verification and Wrong Information

Wrong-of-Thought: An Integrated Reasoning Framework with Mul...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Zhang, Yongheng Chen, Qiguang Zhou, Jingxuan Wang, Peng Si, Jiasheng Wang, Jin Lu, Wenpeng Qin, Libo School of Computer Science and Engineering Central South University China Research Center for SCIR Harbin Institute of Technology Harbin China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China Yunnan University Kunming China

ISBN: (纸本)9798891761681

Chain-of-Thought (CoT) has become a vital technique for enhancing the performance of Large Language Models (LLMs), attracting increasing attention from researchers. One stream of approaches focuses on the iterative enhancement of LLMs by continuously verifying and refining their reasoning outputs for desired quality. Despite its impressive results, this paradigm faces two critical issues: (1) Single verification method: The current paradigm relies solely on a single verification method. (2) Wrong Information Ignorance: The traditional paradigm directly ignores wrong information during reasoning and refines the logic paths from scratch each time. To address these challenges, we propose Wrong-of-Thought (WoT), which includes two core modules: (1) Multi-Perspective Verification: A multi-perspective verification method for accurately refining the reasoning process and result, and (2) Wrong Information Utilization: Utilizing wrong information to alert LLMs and reduce the probability of LLMs making same mistakes. Experiments on 8 popular datasets and 5 LLMs demonstrate that WoT surpasses all previous baselines. In addition, WoT exhibits powerful capabilities in difficult computation tasks. © 2024 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Agent for Failure-aware Job scheduling in High-Performance computing 27

Deep Reinforcement Agent for Failure-aware Job scheduling in...

引用

27th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2021

作者： Yang, Kang Cao, Rongyu Zhou, Yueyuan Zhang, Jiawei Shao, En Tan, Guangming Institute of Computing Technology CAS State Key Laboratory of Computer Architecture Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781665408783

Job scheduling is crucial in high-performance computing (HPC), which is dedicated to deciding when and which jobs are allocated to the system and placing the jobs on which resources, by considering multiple scheduling goals. Along with the incremental of various resources and dazzling deep learning training (DLT) workloads, job failure becomes a quite common issue in HPC, which will affect user satisfaction and cluster utilization. To alleviate the influence of hardware and software errors as much as possible, in this paper, we aim to tackle the problem of failure-aware job scheduling in HPC clusters. Inspired by the success of previous studies of deep reinforcement learning-driven job scheduling, we propose a novel HPC scheduling agent named FARS (Failure-aware RL-based scheduler) by considering the effects of job failures. On the one hand, a neural network is applied to map the information of raw cluster and job states to job placement decisions. On the other hand, to consider the influence of job failure for user satisfaction and cluster utilization, FARS leverages make-span of the entire workload as the training objective. Additionally, effective exploration and experience replay techniques are applied to obtain effectively converged agent. To evaluate the capability of FARS, we design extensive trace-based simulation experiments with the popular DLT workloads. The experimental results show that, compared with the best baseline model, FARS obtains 5.69% improvement of average make-span under different device error rates. Together, our FARS is an ideal candidate for failure-aware job scheduler in HPC clusters. © 2021 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

DSGA: Distractor-Suppressing Graph Attention for Multi-object Tracking 8

DSGA: Distractor-Suppressing Graph Attention for Multi-objec...

引用

8th International Conference on Robotics and Artificial Intelligence, ICRAI 2022

作者： Gao, Guangjie Gao, Yan Xu, Liyang Tan, Huibin Tang, Yuhua Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China Chinese Institute of Electronics Beijing China

ISBN: (纸本)9781450397544

Multiple object tracking (MOT) methods based on single object tracking are of great interest because of their ability to balance efficiency and performance on the strength of the localization capability of single-target tracking. However, most of the single object tracking methods only distinguish foreground and background. They are susceptible to the influence of similar interfering objects during localization, while in multiple object tracking scenarios, there are more interfering objects and the influence is more severe. Therefore, we propose a Distractor-Suppressing Graph Attention (DSGA) to learn more discriminative attention by reducing the influence of distractors on learning attention weight features. Furthermore, DSGA is embedded into the basic MOT framework "SiamMOT" formed as DSGA-SiamMOT and applied to multiple object tracking to verify its effectiveness. We conduct experiments on the MOT Challenge benchmark with "public detection", and obtain MOTA 66.65%, IDF1 62.2% accuracy on the MOT17 dataset with 14fps. © 2022 Association for computing Machinery.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：