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

Research on performance optimization of virtual data space across WAN

Frontiers of computer science 2024年第6期18卷 167-187页

作者： Jiantong HUO Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China

For the high-performance computing in a WAN environment,the geographical locations of national supercomputing centers are scattered and the network topology is complex,so it is difficult to form a unified view of *** aggregate the widely dispersed storage resources of national supercomputing centers in China,we have previously proposed a global virtual data space named GVDS in the project of“high performance computing Virtual Data Space”,a part of the national Key Research and Development Program of *** GVDS enables large-scale applications of the high-performance computing to run efficiently across ***,the applications running on the GVDS are often data-intensive,requiring large amounts of data from multiple supercomputing centers across *** this regard,the GVDS suffers from performance bottlenecks in data migration and access across *** solve the above-mentioned problem,this paper proposes a performance optimization framework of GVDS including the multitask-oriented data migration method and the request access-aware IO proxy resource allocation *** a WAN environment,the framework proposed in this paper can make an efficient migration decision based on the amount of migrated data and the number of multiple data sources,guaranteeing lower average migration latency when multiple data migration tasks are running in *** addition,it can ensure that the thread resource of the IO proxy node is fairly allocated among different types of requests(the IO proxy is a module of GVDS),so as to improve the application’s performance across *** experimental results show that the framework can effectively reduce the average data access delay of GVDS while improving the performance of the application greatly.

关键词： storage aggregation across WANs large-scale applications GVDS data migration allocation of IO proxy resource

来源：评论

学校读者我要写书评

暂无评论

Research on key technologies of edge cache in virtual data space across WAN

引用

Frontiers of computer science 2023年第1期17卷 15-34页

作者： Jiantong HUO Yaowen XU Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China College of Software Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China College of Computer Science and Technology Zhejiang UniversityHangZhou 310013China

The authors of this paper have previously proposed the global virtual data space system (GVDS) to aggregate the scattered and autonomous storage resources in China’s national supercomputer grid (national Supercomputing center in Guangzhou, national Supercomputing center in Jinan, national Supercomputing center in Changsha, Shanghai Supercomputing center, and computer Network Information center in Chinese Academy of sciences) into a storage system that spans the wide area network (WAN), which realizes the unified management of global storage resources in China. At present, the GVDS has been successfully deployed in the China national Grid environment. However, when accessing and sharing remote data in the WAN, the GVDS will cause redundant transmission of data and waste a lot of network bandwidth resources. In this paper, we propose an edge cache system as a supplementary system of the GVDS to improve the performance of upper-level applications accessing and sharing remote data. Specifically, we first designs the architecture of the edge cache system, and then study the key technologies of this architecture: the edge cache index mechanism based on double-layer hashing, the edge cache replacement strategy based on the GDSF algorithm, the request routing based on consistent hashing method, and the cluster member maintenance method based on the SWIM protocol. The experimental results show that the edge cache system has successfully implemented the relevant operation functions (read, write, deletion, modification, etc.) and is compatible with the POSIX interface in terms of function. Further, it can greatly reduce the amount of data transmission and increase the data access bandwidth when the accessed file is located at the edge cache system in terms of performance, i.e., its performance is close to the performance of the network file system in the local area network (LAN).

关键词： virtual data space system wide area network edge cache redundant data transmission

来源：评论

学校读者我要写书评

暂无评论

M-DFCPP: A runtime library for multi-machine dataflow computing

M-DFCPP: A runtime library for multi-machine dataflow comput...

引用

作者： Luo, Qiuming Liu, Senhong Huang, Jinke Li, Jinrong College of Computer Science and Software Engineering Shenzhen University Shenzhen China SKT Group Guangdong Province Key Laboratory of Popular High-Performance Computers Shenzhen China SKT Group Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

This article designs and implements a runtime library for general dataflow programming, DFCPP (Luo Q, Huang J, Li J, Du Z. Proceedings of the 52nd International Conference on Parallel Processing Workshops. ACM;2023:145-152.), and builds upon it to design and implement a multi-machine C++ dataflow library, M-DFCPP. In comparison to existing dataflow programming environments, DFCPP features a user-friendly interface and richer expressive capabilities (Luo Q, Huang J, Li J, Du Z. Proceedings of the 52nd International Conference on Parallel Processing Workshops. ACM;2023:145-152.), enabling the representation of various types of dataflow actor tasks (static, dynamic and conditional task). Besides that, DFCPP addresses the memory management and task scheduling for non-uniform memory access architectures, while other dataflow libraries lack attention to these issues. M-DFCPP extends the capability of current dataflow runtime libraries (DFCPP, taskflow, openstream, etc.) and capable of multi-machine computing, while maintains the API compatible with DFCPP. M-DFCPP adopts the concepts of master and follower (Dean J, Ghemawat S. Commun ACM. 2008;51(1):107-113;Ghemawat S, Gobioff H, Leung ST. ACM SIGOPS Operating Systems Review. ACM;2003:29-43.), which form a worksharing framework as many multi-machine system. To shift to the M-DFCPP framework, a filtering layer is inserted to the original DFCPP, transforming it into followers that can cooperate with each other. The master is made of modules for scheduling, data processing, graph partition, state management and so forth. In benchmark tests with workload with directed acyclic graph topology of binary trees and random graphs, DFCPP demonstrated performance improvements of 20% and 8%, respectively, compared to the second fastest library. M-DFCPP consistently exhibits outstanding performance across varying levels of concurrency and task workloads, achieving a maximum speedup of more than 20 over DFCPP, when the task parallelism e

关键词： Libraries

来源：评论

学校读者我要写书评

暂无评论

Passive on-chip isolators based on the thin-film lithium niobate platform

引用

Chinese Physics B 2025年第3期34卷 408-413页

作者： Jiacheng Liu Gongyu Xia Qilin Hong Pingyu Zhu Kai-Kai Zhang Keyu Xia Ping Xu Shiqiao Qin Zhihong Zhu College of Advanced Interdisciplinary Studies&Hunan Provincial Key Laboratory of Novel Nano Optoelectronic Information Materials and Devices National University of Defense TechnologyChangsha 410073China Institute for Quantum Information and State Key Laboratory of High-Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China College of Engineering and Applied Sciences National Laboratory of Solid State Microstructuresand Collaborative Innovation Center of Advanced MicrostructuresNanjing UniversityNanjing 210023China

Optical isolators,the photonic analogs of electronic diodes,are essential for ensuring the unidirectional flow of light in optical systems,thereby mitigating the destabilizing effects of back ***-film lithium niobate(TFLN),hailed as“the silicon of photonics,”has emerged as a pivotal material in the realm of chip-scale nonlinear optics,propelling the demand for compact optical *** report a breakthrough in the development of a fully passive,integrated optical isolator on the TFLN platform,leveraging the Kerr effect to achieve an impressive 10.3 dB of isolation with a minimal insertion loss of 1.87 *** theoretical simulations have demonstrated that our design,when applied to a microring resonator with a Q factor of 5×10^(6),can achieve 20 dB of isolation with an input power of merely 8 *** advancement underscores the immense potential of lithium niobate-based Kerr-effect isolators in propelling the integration and application of high-performance on-chip lasers,heralding a new era in integrated photonics.

关键词： thin-film lithium niobate Kerr effect optical isolator

来源：评论

学校读者我要写书评

暂无评论

Enhancing Topic Interpretability for Neural Topic Modeling Through Topic-Wise Contrastive Learning 40

Enhancing Topic Interpretability for Neural Topic Modeling T...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Gao, Xin Lin, Yang Li, Ruiqing Wang, Yasha Chu, Xu Ma, Xinyu Yu, Hailong Software Engineering Institution School of Computer Science Peking University Beijing China Key Lab of High Confidence Software Technologies Ministry of Education Beijing China Peking University National Engineering Research Center of Software Engineering Beijing China School of Computer Science Center on Frontiers of Computing Studies Peking University China

ISBN: (纸本)9798350317152

Data mining and knowledge discovery are essential aspects of extracting valuable insights from vast datasets. Neural topic models (NTMs) have emerged as a valuable unsupervised tool in this field. However, the predominant objective in NTMs, which aims to discover topics maximizing data likelihood, often lacks alignment with the central goals of data mining and knowledge discovery which is to reveal interpretable insights from large data repositories. Overemphasizing likelihood maximization without incorporating topic regularization can lead to an overly expansive latent space for topic modeling. In this paper, we present an innovative approach to NTMs that addresses this misalignment by introducing contrastive learning measures to assess topic interpretability. We propose a novel NTM framework, named ContraTopic, that integrates a differentiable regularizer capable of evaluating multiple facets of topic interpretability throughout the training process. Our regularizer adopts a unique topic-wise contrastive methodology, fostering both internal coherence within topics and clear external distinctions among them. Comprehensive experiments conducted on three diverse datasets demonstrate that our approach consistently produces topics with superior interpretability compared to state-of-the-art NTMs. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

GoMatching: A Simple Baseline for Video Text Spotting via Long and Short Term Matching 38

GoMatching: A Simple Baseline for Video Text Spotting via Lo...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： He, Haibin Ye, Maoyuan Zhang, Jing Liu, Juhua Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Wuhan University China College of Computing & Data Science Nanyang Technological University Singapore

Beyond the text detection and recognition tasks in image text spotting, video text spotting presents an augmented challenge with the inclusion of tracking. While advanced end-to-end trainable methods have shown commendable performance, the pursuit of multi-task optimization may pose the risk of producing sub-optimal outcomes for individual tasks. In this paper, we identify a main bottleneck in the state-of-the-art video text spotter: the limited recognition capability. In response to this issue, we propose to efficiently turn an off-the-shelf query-based image text spotter into a specialist on video and present a simple baseline termed GoMatching, which focuses the training efforts on tracking while maintaining strong recognition performance. To adapt the image text spotter to video datasets, we add a rescoring head to rescore each detected instance's confidence via efficient tuning, leading to a better tracking candidate pool. Additionally, we design a long-short term matching module, termed LST-Matcher, to enhance the spotter's tracking capability by integrating both long- and short-term matching results via Transformer. Based on the above simple designs, GoMatching delivers new records on ICDAR15-video, DSText, BOVText, and our proposed novel test set with arbitrary-shaped text termed ArTVideo, which demonstrates GoMatching's capability to accommodate general, dense, small, arbitrary-shaped, Chinese and English text scenarios while saving considerable training budgets. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MLPFormer: MLP-integrated transformer for colorectal histopathology whole slide image segmentation

引用

Neural computing and Applications 2025年第6期37卷 4651-4661页

作者： Wang, Yuxuan Li, Dan Li, Xuechen Guo, Yan Zuo, Yanfei Shen, Linlin Department of Computer Science Wenzhou-Kean University Wenzhou China School of Electronics and Information Engineering Wuyi University Jiangmen China Department of Histo Pathology Shanghai Histo Pathology Diagnostic Center Shanghai China College of Computer Sicence and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

Colorectal intraepithelial neoplasia is a precancerous lesion of colorectal cancer, which is mainly diagnosed using pathological images. According to the characteristics of lesions, precancerous lesions can be classified into four different grades, i.e., background, normal, low and high level. However, due to the continuity of lesion development, tissue in different stages has high similarity. Recently, visual transformers have achieved impressive results in different visual tasks, due to their capacity of capturing long-range dependencies. However, due to computational cost, transformer cannot well extract detailed feature, which is important for lesion grading. To accurately segment pathological tissues with high similarity, in this work, we embed the multi-head MLP mixer module in the transformer network to extract cell and edge information. Furthermore, we propose a hierarchical MLP decoder to facilitate multi-scale feature fusion. The proposed transformer, namely MLPFormer, achieves remarkable results against competitive baselines on the Histo-CRC Biopsy dataset. The experimental results demonstrate that MLPFormer significantly outperforms the competitive baselines, i.e., a 3% dice improvement is achieved over the SegFormer series. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Formal Verification Based Synthesis for Behavior Trees 9th

Formal Verification Based Synthesis for Behavior Trees

引用

9th International Symposium on Dependable software engineering: Theories, Tools and Applications, SETTA 2023

作者： Hong, Weijiang Chen, Zhenbang Li, Minglong Li, Yuhan Huang, Peishan Wang, Ji College of Computer National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China Institute for Quantum Information & State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China

ISBN: (纸本)9789819986637

Behavior trees (BTs) have been extensively applied in the area of both computer games and robotics, as the control architectures. However, the construction of BTs is labor-expensive, time-consuming, and even impossible as the complexity of task increases. In this work, we propose a formal verification based synthesis method to automatically construct BTs whose behaviors satisfy the given Linear Temporal Logic (LTL) specifications. Our method first explores candidate BTs by a grammar-based Monte Carlo Tree Search (MCTS), then the explored BTs are transformed into Communicating Sequential Processes (CSP) models. After that, we invoke the verifier to check the models’ correctness w.r.t. specifications, and provide feedback based on the verification result for guiding the search process. The application of our method on several representative robotic missions indicates its promising. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Behavior Trees CSP MCTS Synthesis

来源：评论

学校读者我要写书评

暂无评论

PEPC: Parallel and Extensible PC Implementation for Causal Structure Learning 23

PEPC: Parallel and Extensible PC Implementation for Causal S...

引用

7th International Conference on high performance Compilation, computing and Communications, HP3C 2023

作者： Feng, Yongquan Xu, Liyang Huang, Wanrong Yang, Wenjing Lu, Yutong Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781450399883

Learning the causal relationships among variables from observational data has been a significant problem in statistics and data mining, and one such algorithm is the PC algorithm. However, the existing CPU-based implementations are difficult to support Causal Structure Learning(CSL) on complex observational data due to inefficiency. In this paper, we propose an efficient CPU-based parallel implementation of the PC algorithm, called PEPC. It has an extensible framework, and some optimizations are adopted to reduce the CSL computation of the PC algorithm. Moreover, our PEPC supports efficient multi-thread parallelism. The experimental results demonstrate that PEPC outperforms existing methods in serial efficiency and multi-thread parallelism. In serial tests, our method achieves the maximum speedup ratios of 577.26, 116.74, and 134.68 over three existing approaches, Stable, ***, and Tetrad. In parallel experiments, it achieves 10.66X speedup when running the PC algorithm with 12 threads. © 2023 ACM.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：