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

arXiv 2025年

作者： Wu, Qianliang Jiang, Haobo Ding, Yaqing Luo, Lei Xie, Jin Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China School of Computer Science and Engineering Nanjing University of Science and Technology China Nanyang Technological University Singapore Visual Recognition Group Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic State Key Laboratory for Novel Software Technology Nanjing University Nanjing China School of Intelligence Science and Technology Nanjing University Suzhou China

Establishing reliable correspondences is crucial for all registration tasks, including 2D image registration, 3D point cloud registration, and 2D-3D image-to-point cloud registration. However, these tasks are often complicated by challenges such as scale inconsistencies, symmetry, and large deformations, which can lead to ambiguous matches. Previous feature-based and correspondence-based methods typically rely on geometric or semantic features to generate or polish initial potential correspondences. Some methods typically leverage specific geometric priors, such as topological preservation, to devise diverse and innovative strategies tailored to a given enhancement goal, which cannot be exhaustively enumerated. Additionally, many previous approaches rely on a single-step prediction head, which can struggle with local minima in complex matching scenarios. To address these challenges, we introduce an innovative paradigm that leverages a diffusion model in matrix space for robust matching matrix estimation. Our model treats correspondence estimation as a denoising diffusion process in the matching matrix space, gradually refining the intermediate matching matrix to the optimal one. Specifically, we apply the diffusion model in the doubly stochastic matrix space for 3D-3D and 2D-3D registration tasks. In the 2D image registration task, we deploy the diffusion model in a matrix sub-space, where dual-softmax projection regularization is applied. For all three registration tasks, we provide adaptive matching matrix embedding implementations tailored to the specific characteristics of each task while maintaining a consistent"match-to-warp" encoding pattern. Furthermore, we adopt a lightweight design for the denoising module. In inference, once points or image features are extracted and fixed, this module performs multi-step denoising predictions through reverse sampling. Evaluations on both 2D and 3D registration tasks demonstrate the effectiveness of our approach. Copyrigh

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression

Improving the performance of multithreaded sparse matrix-vec...

引用

37th International Conference on Parallel Processing, ICPP 2008

作者： Kourtis, Kornilios Goumas, Georgios Koziris, Nectarios National Technical University of Athens School of Electrical and Computer Engineering Computing Systems Laboratory

ISBN: (纸本)9780769533742

The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth requirements. To decrease memory contention and improve the performance of the kernel we propose two compression schemes. The first, called CSR-DU, targets the reduction of the matrix structural data by applying coarse grain delta encoding for the column indices. The second scheme, called CSR-VI, targets the reduction of the numerical values using indirect indexing and can only be applied to matrices which contain a small number of unique values. Evaluation of both methods on a rich matrix set showed that they can significantly improve the performance of the multithreaded version of the kernel and achieve good scalability for large matrices. © 2008 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Mobile robot path planning using parallel computer system

Mobile robot path planning using parallel computer system

引用

1992 IEEE International Workshop on Emerging Technologies and Factory Automation, ETFA 1992

作者： Shang, W. Egan, G.K. Laboratory for Concurrent Computing Systems Computer Systems Engineering School of Electrical Engineering Swinburne Institute of Technology Australia

ISBN: (纸本)0780308867

This paper presents a fast, parallel method for mobile robot path planning. The technique is applicable to autonomous robots operating in an obstacle space populated by other similar co-operating robots, such as robot aircraft or large numbers of robots in an industrial workspace. The technique is based on visibility-Graph algorithm proposed by Lozano-Perez. It has been extended and applied to multiple robots with particular priorities. The parallel algorithm takes advantage of the MIMD shared memory machine. Each robot's path planning can be executed simultaneously because each processor can work independently. The results on Encore-Multimax multiprocessor system show that the computation time of the parallel algorithm is much less than that of the sequential algorithm. © 1992 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Efficient block device sharing over myrinet with memory bypass

Efficient block device sharing over myrinet with memory bypa...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Koukis, Evangelos Koziris, Nectarios National Technical University of Athens School of Electrical and Computer Engineering Computing Systems Laboratory

ISBN: (纸本)1424409101

Efficient sharing of block devices over an interconnection network is an important step in deploying a shared-disk parallel filesystem on a cluster of SMPs. In this paper we present gmbock, a client/server system for network sharing of storage devices over Myrinet, which uses an optimized data path in order to transfer data directly from the storage medium to the NIC, bypassing the host CPU and main memory bus. Its design enhances existing programming abstractions, combining the user level networking characteristics of Myrinet with Linux's virtual memory infrastructure, in order to construct the datapath in a way that is independent of the type of block device used. Experimental evaluation of a prototype system shows that remote I/O bandwidth can improve up to 36.5%, compared to an RDMA-based implementation. Moreover, interference on the main memory bus of the host is minimized, leading to an up to 41% improvement in the execution time of memory-intensive applications. © 2007 IEEE.

关键词： Interconnection networks

来源：评论

学校读者我要写书评

暂无评论

BAT: A Versatile Bipartite Attention-based Approach for Comprehensive Truth Inference in Mobile Crowdsourcing

引用

IEEE Transactions on Mobile computing 2025年

作者： Liu, Jiacheng Tang, Feilong Liu, Hao Chen, Long Yu, Yichuan Zhu, Yanmin Yu, Jiadi Hou, Xiaofeng Heng, Pheng-Ann The Chinese University of Hong Kong Department of Computer Science and Engineering 999077 Hong Kong Shanghai Jiao Tong University School of Computer Science Shanghai200240 China East China Normal University School of Data Science and Engineering China Simon Fraser University School of Computing Science Canada Huawei Technologies Co. Ltd China Chinese Academy of Sciences Guangdong-Hong Kong-Macao Joint Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology Shenzhen518055 China

The proliferation of smart mobile devices has catalyzed the growth of Mobile CrowdSourcing (MCS) as a distributed problem-solving paradigm. MCS platforms heavily rely on advanced truth inference techniques to extract reliable information from diverse and potentially noisy crowd-contributed data. Existing truth inference models often made simplified assumptions about workers or tasks, employing complex Bayesian models or stringent data aggregation methods. These approaches tend to be task-specific, primarily limited to categorical labeling, making adaptations to other mobile computing scenarios labor-intensive. To address these limitations, we introduce the Bipartite Attention-driven Truth (BAT), a versatile approach tailored for mobile computing environments. BAT utilizes an Attributed Bipartite Graph (ABG) to holistically model the MCS process, with workers and tasks as nodes connected by edges representing answer-specific attributes. The approach employs a bipartite graph neural network with an innovative attention mechanism to assess the importance of different answers. BAT extends beyond categorical tasks to support numerical ones by incorporating novel feature representations and model extensions. Theoretical analyses clarify the link between answer similarity and worker expertise. Extensive experiments using diverse real-world datasets demonstrate BAT's superior performance compared to state-of-the-art categorical and numerical truth inference models, highlighting its effectiveness in mobile computing scenarios. © 2002-2012 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Memory and network bandwidth aware scheduling of multiprogrammed workloads on clusters of SMPs

Memory and network bandwidth aware scheduling of multiprogra...

引用

12th International Conference on Parallel and Distributed systems, ICPADS 2006

作者： Koukis, Evangelos Koziris, Nectarios National Technical University of Athens School of Electrical and Computer Engineering Computing Systems Laboratory

ISBN: (纸本)0769526128

Symmetric Multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processors for access to shared resources, as is the main memory bus and the NIC can limit their efficiency significantly. In this paper, we first provide an experimental demonstration of the effect of resource contention on the total execution time of applications. Then, we present the design and implementation of an informed gang-like scheduling algorithm aimed at improving the throughput of multiprogrammed workloads on clusters of SMPs. Our algorithm selects the processes to be coscheduled so as not to saturate nor underutilize the memory bus or network link bandwidth. Its input data are acquired dynamically using hardware monitoring counters and a modified Myrinet NIC firmware, without any modifications to existing application binaries. Experimental evaluation shows throughput can improve up to 40-48% compared to the standard Linux 2.6 O(1) scheduler. © 2006 IEEE.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Coarse-grain parallel execution for 2-dimensional PDE problems

Coarse-grain parallel execution for 2-dimensional PDE proble...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Goumas, Georgios Drosinos, Nikolaos Karakasis, Vasileios Koziris, Nectarios National Technical University of Athens School of Electrical and Computer Engineering Computing Systems Laboratory

ISBN: (纸本)1424409101

This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE problems with finite-differencing schemes. Tiling transformation is an efficient loop transformation to achieve coarse-grain parallelism in such algorithms, while rectangular tile shapes are the only feasible shapes that can be manually applied by program developers. However, rectangular tiling transformations are not always valid due to data dependencies, and thus requiring the application of an appropriate skewing transformation prior to tiling in order to enable rectangular tile shapes. We employ cyclic mapping of tiles to processes and propose a method to determine an efficient rectangular tiling transformation for a fixed number of processes for 2-dimensional, skewed PDE problems. Our experimental results confirm the merit of coarse-grain execution in this family of applications and indicate that the proposed method leads to the selection of highly efficient tiling transformations. © 2007 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Constrained temperature and relative humidity predictive control:Agricultural greenhouse case of study

引用

Information Processing in Agriculture 2024年第3期11卷 409-420页

作者： Hafsa Hamidane Samira EL Faiz Iliass Rkik Mohamed El Khayat Mohammed Guerbaoui Abdelali Ed-Dahhak Abdeslam Lachhab Computer Engineering and Intelligent Electrical Systems Laboratory ModelingMaterials and Control of Systems TeamHigher School of TechnologyMoulay Ismail University of MeknesMorocco

The importance of Model Predictive Control(MPC)has significant applications in the agricultural industry,more specifically for greenhouse’s control ***,the complexity of the greenhouse and its limited prior knowledge prevent an exact mathematical description of the *** methods provide a promising solution to this issue through their capacity to identify the system’s comportment using the fit between model output and observed *** this paper,we introduce an application of Constrained Model Predictive Control(CMPC)for a greenhouse temperature and relative *** this purpose,two Multi Input Single Output(MISO)systems,using Numerical Subspace State Space System Identification(N4SID)algorithm,are firstly suggested to identify the temperature and the relative humidity comportment to heating and ventilation *** this sense,linear state space models were adopted in order to evaluate the robustness of the control *** the system is identified,the MPC technique is applied for the temperature and the humidity *** results show that the regulation of the temperature and the relative humidity under constraints was guaranteed,both parameters respect the ranges 15℃≤T_(int)≤30℃and 50%≤H_(int)≤70%*** the other hand,the control signals uf and uh applied to the fan and the heater,respect the hard constraints notion,the control signals for the fan and the heater did not exceed 0≤uf≤4.3 Volts and 0≤uh≤5 Volts,respectively,which proves the effectiveness of the MPC and the tracking ***,we show that with the proposed technique,using a new optimization toolbox,the computational complexity has been significantly *** greenhouse in question is devoted to Schefflera Arboricola cultivation.

关键词： Constrained model predictive control Greenhouse MISO systems Optimization Relative humidity Temperature

来源：评论

学校读者我要写书评

暂无评论

Rethinking attention mechanism for enhanced pedestrian attribute recognition

引用

Neurocomputing 2025年 639卷

作者： Wu, Junyi Huang, Yan Gao, Min Niu, Yuzhen Chen, Yuzhong Wu, Qiang Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fujian Fuzhou350108 China Engineering Research Center of BigData Intelligence Ministry of Education Fujian Fuzhou350108 China Australian Artificial Intelligence Institute University of Technology Sydney SydneyNSW2007 Australia Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou University Fujian Fuzhou350108 China School of Electrical and Data Engineering University of Technology Sydney SydneyNSW2007 Australia

Pedestrian Attribute Recognition (PAR) plays a crucial role in various computer vision applications, demanding precise and reliable identification of attributes from pedestrian images. Traditional PAR methods, though effective in leveraging attention mechanisms, often suffer from the lack of direct supervision on attention, leading to potential overfitting and misallocation. This paper introduces a novel and model-agnostic approach, Attention-Aware Regularization (AAR), which rethinks the attention mechanism by integrating causal reasoning to provide direct supervision of attention maps. AAR employs perturbation techniques and a unique optimization objective to assess and refine attention quality, encouraging the model to prioritize attribute-specific regions. Our method demonstrates significant improvement in PAR performance by mitigating the effects of incorrect attention and fostering a more effective attention mechanism. Experiments on standard datasets showcase the superiority of our approach over existing methods, setting a new benchmark for attention-driven PAR models. © 2025 The Authors

关键词： Perturbation techniques

来源：评论

学校读者我要写书评

暂无评论

Realizations of focus invariance in optical-digital systems with wave-front coding

引用

APPLIED OPTICS 1997年第35期36卷 9157-9166页

作者： Bradburn, S Cathey, WT Dowski, ER []The authors are with the Imaging Systems Laboratory Opto-electronic Computing Systems Center Department of Electrical and Computer Engineering University of Colorado at Boulder Boulder Colorado 80309-0525.

We report experimental verification of an extended depth of focus (EDF) system with near-diffraction-limited performance capabilities. Dowski and Cathey [Appl. Opt. 34, 1859-1866 (1995)] described the theory of this system in detail. We can create an EDF system by modifying a standard incoherent optical system with a special cubic phase plate placed at the aperture stop. We briefly review the theory and present the first optical experimental verification of this EDF system. The phase plate codes the wave front, producing a modified optical transfer function. Once the image is transformed into digital form, a signal-processing step decodes the image and produces the final in-focus image. We have produced a number of images from various optical systems using the phase plate, thus demonstrating the success of this EDF system. (C) 1997 Optical Society of America.

关键词： extended depth of focus focus invariant optical-digital imaging systems image formation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：