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

Minimal Context-Switching Data Race Detection with Dataflow Tracking

Journal of computer Science & technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：评论

学校读者我要写书评

暂无评论

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

引用

Journal of computer Science & technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

来源：评论

学校读者我要写书评

暂无评论

Robust tube-based MPC with smooth computation for dexterous robot manipulation

引用

Science China(Information Sciences) 2024年第11期67卷 252-268页

作者： Yu LUO Tianying JI Fuchun SUN Qie SIMA Huaping LIU Mingxuan JING Jianwei ZHANG Department of Computer Science and Technology Tsinghua University Science & Technology on Integrated Information System Laboratory Institute of Software Chinese Academy of Sciences Department of Informatics University of Hamburg

Dexterous robot manipulation has shone in complex industrial scenarios, where multiple manipulators, or fingers, cooperate to grasp and manipulate objects. When encountering multi-objective optimization with system constraints in such scenarios, model predictive control(MPC) has demonstrated exceptional performance in complex multi-robot manipulation tasks involving multi-objective optimization with system constraints. However, in such scenarios, the substantial computational load required to solve the optimal control problem(OCP) at each triggering instant can lead to significant delays between state sampling and control application, hindering real-time performance. To address these challenges, this paper introduces a novel robust tube-based smooth MPC approach for two fundamental manipulation tasks: reaching a given target and tracking a reference trajectory. By predicting the successor state as the initial condition for imminent OCP solving, we can solve the forthcoming OCP ahead of time, alleviating delay effects. Additionally,we establish an upper bound for linearizing the original nonlinear system, reducing OCP complexity and enhancing response speed. Grounded in tube-based MPC theory, the recursive feasibility and closed-loop stability amidst constraints and disturbances are ensured. Empirical validation is provided through two numerical simulations and two real-world dexterous robot manipulation tasks, which shows that the seamless control input by our methods can effectively enhance the solving efficiency and control performance when compared to conventional time-triggered MPC strategies.

关键词： dexterous robot manipulation model predictive control smooth computation

来源：评论

学校读者我要写书评

暂无评论

Masked Generative Light Field Prompting for Pixel-Level Structure Segmentations

引用

Research 2024年第4期2024卷 533-544页

作者： Mianzhao Wang Fan Shi Xu Cheng Shengyong Chen The Engineering Research Center of Learning-Based Intelligent System(Ministry of Education) Tianjin University of TechnologyTianjin 300384China Key Laboratory of Computer Vision and System(Ministry of Education) Tianjin University of TechnologyTianjin 300384China School of Computer Science and Engineering Tianjin University of TechnologyTianjin 300384China

Pixel-level structure segmentations have attracted considerable attention,playing a crucial role in autonomous driving within the metaverse and enhancing comprehension in light field-based machine ***,current light field modeling methods fail to integrate appearance and geometric structural information into a coherent semantic space,thereby limiting the capability of light field transmission for visual *** this paper,we propose a general light field modeling method for pixel-level structure segmentation,comprising a generative light field prompting encoder(LF-GPE)and a prompt-based masked light field pretraining(LF-PMP)*** LF-GPE,serving as a light field backbone,can extract both appearance and geometric structural cues *** aligns these features into a unified visual space,facilitating semantic ***,our LF-PMP,during the pretraining phase,integrates a mixed light field and a multi-view light field *** prioritizes considering the geometric structural properties of the light field,enabling the light field backbone to accumulate a wealth of prior *** evaluate our pretrained LF-GPE on two downstream tasks:light field salient object detection and semantic *** results demonstrate that LF-GPE can effectively learn high-quality light field features and achieve highly competitive performance in pixel-level segmentation tasks.

关键词： prompt backbone integrate

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Low-Light Image Enhancement Based on Explicit Denoising and Knowledge Distillation

引用

computers, Materials & Continua 2025年第2期82卷 2537-2554页

作者： Wenkai Zhang Hao Zhang Xianming Liu Xiaoyu Guo Xinzhe Wang Shuiwang Li College of Computer Science and Engineering Guilin University of TechnologyGuilin541006China Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin University of TechnologyGuilin541004China

Under low-illumination conditions, the quality of image signals deteriorates significantly, typically characterized by a peak signal-to-noise ratio (PSNR) below 10 dB, which severely limits the usability of the images. Supervised methods, which utilize paired high-low light images as training sets, can enhance the PSNR to around 20 dB, significantly improving image quality. However, such data is challenging to obtain. In recent years, unsupervised low-light image enhancement (LIE) methods based on the Retinex framework have been proposed, but they generally lag behind supervised methods by 5–10 dB in performance. In this paper, we introduce the Denoising-Distilled Retine (DDR) method, an unsupervised approach that integrates denoising priors into a Retinex-based training framework. By explicitly incorporating denoising, the DDR method effectively addresses the challenges of noise and artifacts in low-light images, thereby enhancing the performance of the Retinex framework. The model achieved a PSNR of 19.82 dB on the LOL dataset, which is comparable to the performance of supervised methods. Furthermore, by applying knowledge distillation, the DDR method optimizes the model for real-time processing of low-light images, achieving a processing speed of 199.7 fps without incurring additional computational costs. While the DDR method has demonstrated superior performance in terms of image quality and processing speed, there is still room for improvement in terms of robustness across different color spaces and under highly resource-constrained conditions. Future research will focus on enhancing the model’s generalizability and adaptability to address these challenges. Our rigorous testing on public datasets further substantiates the DDR method’s state-of-the-art performance in both image quality and processing speed.

关键词： Deep learning low-light image enhancement real-time processing knowledge distillation

来源：评论

学校读者我要写书评

暂无评论

Enhancement Methods for Chiral Optical Signals by Tailoring Optical Fields and Nanostructures

引用

Engineering 2025年第2期45卷 25-43页

作者： Hanqing Cai Liangliang Gu Haifeng Hu Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Zhangjiang Laboratory Shanghai 201204China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China

The unique property of chirality is widely used in various *** the past few decades,a great deal of research has been conducted on the interactions between light and matter,resulting in significant technical advancements in the precise manipulation of light field *** this review,which focuses on current chiral optics research,we introduce the fundamental theory of chirality and highlight the latest achievements in enhancing chiral signals through artificial nano-manufacturing technology,with a particular focus on mechanisms such as light scattering and Mie resonance used to amplify chiral *** providing an overview of enhanced chiral signals,this review aims to provide researchers with an indepth understanding of chiral phenomena and its versatile applications in various domains.

关键词： Mie scattering Optical chirality Circular dichroism Orbital angular momentum Bound states in the continuum Nonlinear optics

来源：评论

学校读者我要写书评

暂无评论

Application-Oriented Cloud Workload Prediction:A Survey and New Perspectives

引用

Tsinghua Science and technology 2025年第1期30卷 34-54页

作者： Binbin Feng Zhijun Ding Key Laboratory of Embedded System and Service Computing Ministry of EducationDepartment of Computer Science and TechnologyTongji UniversityShanghai 201804China Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji UniversityDepartment of Computer Science and TechnologyTongji UniversityShanghai 201804China Shanghai Artificial Intelligence Laboratory Shanghai 200232China

Workload prediction is critical in enabling proactive resource management of cloud *** workload prediction is valuable for cloud users and providers as it can effectively guide many practices,such as performance assurance,cost reduction,and energy consumption ***,cloud workload prediction is highly challenging due to the complexity and dynamics of workloads,and various solutions have been proposed to enhance the prediction *** paper aims to provide an in-depth understanding and categorization of existing solutions through extensive literature *** existing surveys,for the first time,we comprehensively sort out and analyze the development landscape of workload prediction from a new perspective,i.e.,application-oriented rather than prediction methodologies per ***,we first introduce the basic features of workload prediction,and then analyze and categorize existing efforts based on two significant characteristics of cloud applications:variability and ***,we also investigate how workload prediction is applied to resource ***,open research opportunities in workload prediction are highlighted to foster further advancements.

关键词： cloud computing workload prediction resource management artificial intelligence for IT operations(AIOps)

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of computer Science & technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Orbit-Orbit Interaction in Spatiotemporal Optical Vortex

引用

Engineering 2025年第2期45卷 44-51页

作者： Jian Chen Jie Zhao Xi Shen Dewei Mo Cheng-Wei Qiu Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China Department of Electrical and Computer Engineering National University of SingaporeSingapore 117583Singapore

While spin-orbit interaction has been extensively studied,few investigations have reported on the interaction between orbital angular momenta(OAMs).In this work,we study a new type of orbit-orbit coupling between the longitudinal OAM and the transverse OAM carried by a three-dimensional(3D)spatiotemporal optical vortex(STOV)in the process of tight *** 3D STOV possesses orthogonal OAMs in the x-y,t-x,and y-t planes,and is preconditioned to overcome the spatiotemporal astigmatism effect.x,y,and t are the axes in the spatiotemporal *** corresponding focused wavepacket is calculated by employing the Debye diffraction theory,showing that a phase singularity ring is generated by the interactions among the transverse and longitudinal vortices in the highly confined *** Fourier-transform decomposition of the Debye integral is employed to analyze the mechanism of the orbit-orbit *** is the first revelation of coupling between the longitudinal OAM and the transverse OAM,paving the way for potential applications in optical trapping,laser machining,nonlinear light-matter interactions,and more.

关键词： Spatiotemporal optical vortex Orbital angular momentum Momentum interaction Highly confined wavepacket Diffraction

来源：评论

学校读者我要写书评

暂无评论

THL: Fast Targeted High Utility Itemset Mining within Length Consideration

Journal of Network Intelligence

引用

Journal of Network Intelligence 2025年第1期10卷 541-558页

作者： Xu, Peiming Jiang, Yixin Kuang, Xiaoyun Luo, Yu Chen, Jiahui Guangdong Provincial Key Laboratory of Power System Network Security CSG Guangzhou510000 China School of Computer Science and Technology Guangdong University of Technology Guangzhou510006 China

High utility itemset mining is a research topic of the pattern mining domain, which has been widely applied in reality during the past decade. Although most high utility itemset mining algorithms show significant execution performance regarding runtime and memory usage, numerous results are useless for users. Targeted high utility itemset mining can reduce the number of high utility itemsets and improve the efficiency of pattern analysis. However, the targeted high utility itemset mining task aims to find targeted high utility itemsets with as many items as possible. Users are not that interested in long results in actual scenarios. Therefore, in this article, we first formulate the problem and then address this issue by proposing a new algorithm named THL for mining targeted high utility itemset within length constraints, based on utility list structure. Furthermore, to improve the performance of the novel algorithm, THL adopts several efficiency pruning strategies, including length and utility aspects. Finally, we conduct an extensive experimental evaluation to compare the SOTA algorithms with THL on several datasets. © 2025, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： data mining high utility itemset length constraint targeted items

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：