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

31st International Conference on Computational Linguistics, COLING 2025

作者： Hu, Biao Huang, Zhen Hu, Minghao Yang, Pinglv Qiao, Peng Dou, Yong Wang, Zhilin National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China Center of Information Research Academy of Military Science China College of Meteorology and Oceanology National University of Defense Technology China

ISBN: (纸本)9798891761964

Prototype network-based methods have made substantial progress in few-shot relation extraction (FSRE) by enhancing relation prototypes with relation descriptions. However, the distribution of relations and instances in distinct representation spaces isolates the constraints of relations on instances, making relation prototypes biased. In this paper, we propose an end-to-end partial order-centered hyperbolic representation learning (PO-HRL) framework, which imposes the constraints of relations on instances by modeling partial order in hyperbolic space, so as to effectively learn the distribution of instance representations. Specifically, we develop the hyperbolic supervised contrastive learning based on Lorentzian cosine similarity to align representations of relations and instances, and model the partial order by constraining instances to reside within the Lorentzian entailment cone of their respective relation. Experiments on three benchmark datasets show that PO-HRL outperforms the strong baselines, especially in 1-shot settings lacking relation descriptions. © 2025 Association for Computational Linguistics.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

PEbfs: Implement High-Performance Breadth-First Search on PEZY-SC3s 24th

PEbfs: Implement High-Performance Breadth-First Search on P...

引用

24th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2024

作者： Guo, Weihao Wang, Qinglin Liu, Xiaodong Peng, Muchun Yang, Shun Liang, Yaling Shi, Yongzhen Cao, Ligang Liu, Jie Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Changsha410073 China Engineering Research Center for National Fundamental Software National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789819615506

The breadth-first search (BFS) algorithm is a fundamental algorithm in graph theory, and it’s parallelization can significantly improve performance. Therefore, there have been numerous efforts to leverage the powerful parallel computing capabilities of hardware like GPGPU to implement high-performance BFS algorithms. However, the energy efficiency is relatively low due to the high power consumption of the platforms on which the algorithm is adapted to. To deal with these challenges, this paper introduces PEbfs that is a high-performance BFS algorithm based on the PEZY-SC3s efficient processor. We integrated three search algorithms, two algorithm optimization strategies, and a directional optimization scheme into PEbfs. Through multiple evaluations of the performance of PEbfs on the public SNAP dataset, the results demonstrate that the average energy efficiency ratio of PEbfs is higher than that of Enterprise and Tigr, the two most advanced implementations on Nvidia’s GPGPU: It achieves 3.08× the average energy efficiency ratio of Enterprise and 4.53× that of Tigr. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

HyperGAC: Information Entropy-Driven Resource Allocation for Cloud-Edge-End computing

引用

Journal of Grid computing 2025年第2期23卷 1-23页

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

Cloud-Edge-End computing provides favorable support for emerging applications by virtue of its low-latency and high reliability. Resource allocation strategies significantly impact the quality of service and response time of cloud-edge-end systems. Due to the decentralized storage of resources, large fluctuations in task demands, and the complexity of cloud-edge-end environments, achieving effective resource allocation remains challenging. Existing resource allocation strategies rely on static models or predefined rules, and cannot flexibly respond to real-time network conditions and changes in task requirements. Consequently, they are limited in achieving optimal resource utilization and effective load balancing. Therefore, this paper proposes an Information Entropy (IE)-driven cloud-edge-end resource allocation mechanism called HyperGAC. First, IE is employed to quantify resource fluctuations, so as to accurately capture the dynamic changes in resource demands. And an Entropy-based Correlation Recurrent Unit (ECRU) is designed to predict server resource utilization. Second, the hypergraph is used to model the complex relationships between resources and tasks, breaking through the limitations of traditional graph structures in multi-dimensional relationships modeling. Finally, the Hypergraph Neural Network (HGNN) is integrated into the actor-critic framework to extract the features from the hypergraph association model, while dynamically optimizing resource allocation strategy based on the prediction results. Experimental results demonstrate that the HyperGAC mechanism significantly improves resource utilization and load balancing performance while effectively reducing the task rejection rate.

关键词： Cloud-edge-end computing Deep reinforcement learning Information entropy Resource allocation Resource utilization prediction

来源：评论

学校读者我要写书评

暂无评论

An End-to-End Classification Network Model Based on Hybrid Supervision for Industrial Surface Defect Detection

引用

International Journal of Pattern Recognition and Artificial Intelligence 2025年第5期39卷

作者： Qin, Runbing Chen, Ningjiang Gan, Shukun Guangxi University School of Computer Electronics and Information Nanning530004 China Education Department of Guangxi Zhuang Autonomous Region Key Laboratory of Parallel Distributed and Intelligent Computing Guangxi University Nanning530004 China Guangxi Intelligent Digital Services Research Center of Engineering Technology Nanning530004 China

Industrial part surface defect detection aims to precisely locate defects in images, which is crucial for quality control in manufacturing. The traditional method needs to be designed in advance, but it has shortcomings in terms of generalization ability. Deep neural network-based defect detection faces issues such as low resolution, data scarcity, labeling costs, and high computation. Therefore, an improved solution is necessary to enhance industrial product quality control efficiency and accuracy. A new method is proposed that utilizes end-to-end training of a two-stage neural network based on segmentation with an extended training process. The gradient flow from the classification to the segmentation network is adjusted to prevent unstable features from interfering with learning. To address the problem of image oversampling and undersampling during training, a frequency sampling scheme for negative samples is introduced. Additionally, positive pixels in the region-based segmentation mask are weighted using the distance transform algorithm so that regions with a high probability of defects can be detected without detailed annotation. Experiments are conducted across three distinct defect datasets by applying hybrid supervision encompassing diverse conditions. In the optimal case, the AP rate of the proposed model on the DAGM and KolektorSDD datasets reaches 100%, and the AP rate on the Severstal Steel dataset reaches 98.99%. The experiments’ results show that the detection accuracy has improved greatly, showing how well the proposed method works in the industry. © 2025 World Scientific Publishing Company.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

SPECIAL ISSUE ON parallel ALGORITHMS FOR GEOMETRIC PROBLEMS ON DIGITIZED PICTURES

引用

ALGORITHMICA 1991年第5期6卷 621-623页

作者： DEHNE, F Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING DATA-STRUCTURES ON A HYPERCUBE MULTIPROCESSOR, AND APPLICATIONS IN parallel COMPUTATIONAL GEOMETRY

引用

JOURNAL OF parallel AND distributed computing 1990年第4期8卷 367-375页

作者： DEHNE, F RAUCHAPLIN, A Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6

In this paper, we study the problem of implementing standard data structures on a hypercube multiprocessor. We present a technique for efficiently executing multiple independent search processes on a class of graphs called ordered h -level graphs. We show how this technique can be utilized to implement a segment tree on a hypercube, thereby obtaining O (long 2 n ) time algorithms for solving the next element search problem, the trapezoidal composition problem, and the triangulation problem.

关键词： Computer Systems, Digital

来源：评论

学校读者我要写书评

暂无评论

computing THE CONFIGURATION SPACE FOR A ROBOT ON A MESH-OF-PROCESSORS

引用

parallel computing 1989年第2期12卷 221-231页

作者： DEHNE, F HASSENKLOVER, AL SACK, JR Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6

In this paper, we present a systolic algorithm for computing the configuration space of an arrangement of arbitrary obstacles in the plane for a rectilinearly convex robot. The obstacles and the robot are assumed to be represented in digitized form by a √ n × √ n nibary image. The algorithm is designed for a Mesh-of-Processors architecture with n processors (using the canonical representation of an image on a processor array) and has an execution time of O(√ n ) which is asymptotically optimal.

关键词： Computational geometry image processing robotics systolic algorithms

来源：评论

学校读者我要写书评

暂无评论

computing THE LARGEST EMPTY RECTANGLE ON ONE-DIMENSIONAL AND 2-DIMENSIONAL PROCESSOR ARRAYS

引用

JOURNAL OF parallel AND distributed computing 1990年第1期9卷 63-68页

作者： DEHNE, F Center for Parallel and Distributed Computing School of Computer Science Carleton University Ottawa Canada K1S 5B6

Given a rectangle R (with its edges parallel to the coordinate axes) containing a set S = { s 1 ,…, s n } of n points in the Euclidean plane, consider the problem of finding the largest area subrectangle r in R with sides parallel to the coordinate axes that contains no point of S . We present optimal parallel algorithms for solving this problem on one- and two-dimensional arrays of processors.

关键词： Computer Programming

来源：评论

学校读者我要写书评

暂无评论

Determining optimal update period for minimizing inconsistency in multi-server distributed virtual environments 11

Determining optimal update period for minimizing inconsisten...

引用

15th IEEE/ACM International Symposium on distributed Simulation and Real Time Applications, DS-RT 2011

作者： Li, Yusen Cai, Wentong Parallel and Distributed Computing Center Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9780769545530

The primary task of distributed virtual environments (DVEs) is to maintain a consistent view of the virtual world among all users. Multi-server architecture has been shown to have good scalability to support a large population of users in DVEs. However, some of the servers' resources like CPU, memory and network bandwidth can still get saturated as the scale of DVE increases. In this case, state updates cannot be disseminated timely and the consistency of the virtual world cannot be guaranteed. In this paper, we investigate how to efficiently use the limited resources for state update to minimize inconsistency in multi-server DVEs. Using time-space inconsistency metric, we firstly prove that periodic state update will result in minimal inconsistency for each replica. Then, in order to determine the optimal update periods for replicas to minimize the total time-space inconsistency of the DVE, we formulate the problem as a convex optimization problem with inequality constraints. Finally, an interior point method is adopted to solve the problem and the performance is evaluated using simulation results. © 2011 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Federate fault tolerance in HLA-based simulation 10

Federate fault tolerance in HLA-based simulation

引用

24th Annual Workshop on Principles of Advanced and distributed Simulation, PADS 2010

作者： Li, Zengxiang Cai, Wentong Turner, Stephen John Pan, Ke Parallel and Distributed Computing Center School of Computing Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781424472918

A large scale HLA-based simulation (federation) is composed of a large number of simulation components (federates), which may be developed by different participants and executed at different locations. These federates are subject to failures due to various reasons. What is worse, the risk of federation failure increases with the number of federates in the federation. In this paper, a fault tolerance mechanism is proposed to tolerate the crash-stop failures of federates. By exploiting the decoupled federate architecture, federate failures can be masked from the federation and recovery can take place without interrupting the executions of other federates. A basic state recovery protocol is first proposed to recover the state of the failed federate relying on the checkpoint and message logging taken before the failure. Then, an optimized protocol is further developed to accelerate the state recovery procedure. Experiments are carried out to verify that the proposed mechanism provides correct failure recovery. The experimental results also indicate that the optimized protocol can outperform the basic one considerably. © 2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：