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

International Workshop on Quality of Service

作者： Weipeng Cao Xi Tao Yinghui Pan Ye Liu Zhong Ming Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

The advantages of resource elasticity and proactive data backup in cloud databases have attracted a large number of users to consider deploying their IT systems in the cloud. Factors such as performance, reliability, security, and ease of use are the most important considerations for users when choosing to migrate to the cloud. This paper mainly discusses the necessity of Quality of Service (QoS) awareness for cloud applications in the current public cloud environment, as well as the technological trends and challenges associated with it.

关键词： Cloud computing databases Quality of service Elasticity Market research Real-time systems Security

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

GraphMetaP: Efficient MetaPath Generation for Dynamic Heterogeneous Graph Models

GraphMetaP: Efficient MetaPath Generation for Dynamic Hetero...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Haiheng He Dan Chen Long Zheng Yu Huang Haifeng Liu Chaoqiang Liu Xiaofei Liao Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Clusters and Grid Computing Lab Huazhong University of Science and Technology China Zhejiang Lab Hangzhou China

Metapath-based heterogeneous graph models (MHGM) show excellent performance in learning semantic and structural information in heterogeneous graphs. Metapath matching is an essential processing step in MHGM to find all metapath instances, bringing significant overhead compared to the total model execution time. Even worse, in dynamic heterogeneous graphs, metapath instances require to be rematched while graph updated. In this paper, we observe that only a small fraction of metapath instances change and propose GraphMetaP, an efficient incremental metapath maintenance method in order to eliminate the matching overhead in dynamic heterogeneous graphs. GraphMetaP introduces a novel format for metapath instances to capture the dependencies among the metapath instances. The format incrementally maintains metapath instances based on the graph updates to avoide the rematching metapath overhead for the updated graph. Furthermore, GraphMetaP uses the fold way to simplify the format in order to recover all metapath instances faster. Experiments show that GraphMetaP enables efficient maintenance of metapath instances on dynamic heterogeneous graphs and outperforms 172.4X on average compared to the matching metapath method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Effective Concurrency Testing for Go via Directional Primitive-Constrained Interleaving Exploration

Effective Concurrency Testing for Go via Directional Primiti...

引用

IEEE International Conference on Automated Software engineering (ASE)

作者： Zongze Jiang Ming Wen Yixin Yang Chao Peng Ping Yang Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System ByteDance Beijing China School of Computer Science and Technology Huazhong University of Science and Technology China

The Go language (Go/Golang) has been attracting increasing attention from the industry over recent years due to its strong concurrency support and ease of deployment. This programming language encourages developers to use channel-based concurrency, which simplifies the development of concurrent programs. Unfortunately, it also introduces new concurrency problems that differ from those caused by the mechanism of shared memory concurrency. However, there are only few works that aim to detect such Go-specific concurrency issues. Even state-of-the-art testing tools will miss critical concurrent bugs that require fine-grained and effective interleaving exploration. This paper presents GoPie, a novel testing approach for detecting Go concurrency bugs through primitive-constrained interleaving exploration. GoPie utilizes execution histories to identify new interleavings instead of relying on exhaustive exploration or random scheduling. To evaluate its performance, we applied GoPie to existing benchmarks and large-scale open-source projects. Results show that GoPie can effectively explore concurrent interleavings and detect significantly more bugs in the benchmark. Furthermore, it uncovered 11 unique previously unknown concurrent bugs, and 9 of which have been confirmed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Preserving Location Privacy of IoT Devices in Heterogeneous Edge computing Architecture Through Deniability-Based Authentication

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Graph-Based AU Relationship Learning for Facial Action Unit Detection

Spatial-Temporal Graph-Based AU Relationship Learning for Fa...

引用

IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)

作者： Zihan Wang Siyang Song Cheng Luo Yuzhi Zhou Shiling Wu Weicheng Xie Linlin Shen Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of Computing and Mathematical Sciences University of Leicester

This paper presents our Facial Action Units (AUs) detection submission to the fifth Affective Behavior Analysis in-the-wild Competition (ABAW). Our approach consists of three main modules: (i) a pre-trained facial representation encoder which produce a strong facial representation from each input face image in the input sequence; (ii) an AU-specific feature generator that specifically learns a set of AU features from each facial representation; and (iii) a spatio-temporal graph learning module that constructs a spatio-temporal graph representation. This graph representation describes AUs contained in all frames and predicts the occurrence of each AU based on both the modeled spatial information within the corresponding face and the learned temporal dynamics among frames. The experimental results show that our approach outperformed the baseline and the spatio-temporal graph representation learning allows our model to generate the best results among all ablated systems. Our model ranks at the 4th place in the AU recognition track at the 5th ABAW Competition. Our code is publicly available at https://***/wzh125/ABAW-5.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ev-IDID: Enhancing Solutions to Interactive Dynamic Influence Diagrams through Evolutionary Algorithms 21

Ev-IDID: Enhancing Solutions to Interactive Dynamic Influenc...

引用

21st International Conference on Autonomous Agents and Multiagent systems, AAMAS 2022

作者： Ma, Biyang Pan, Yinghui Zeng, Yifeng Ming, Zhong School of Computer Science and Engineering Minnan Normal University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer and Information Sciences Northumbria University United Kingdom College of Computer Science and Software Engineering Shenzhen University China

ISBN: (纸本)9781713854333

Interactive dynamic influence diagrams (I-DIDs) are a general framework for multiagent sequential decision making under uncertainty. Due to the model complexity, a significant amount of research has been invested into solving the model through various types of either exact or approximate algorithms. However, there is no tool that allows users to specify the algorithm parameters and visualise the model solutions. In this demo, we develop an interactive I-DID system that implements most of the state-of-art I-DID algorithms and develops a new type of algorithms based on evolutionary computation. In particular, we propose a multi-population genetic algorithm for solving the I-DID models and automate the generation of behavioural models in the solutions. This demo will facilitate the I-DID research development and practical applications, and elicit a new wave of I-DID solutions based on evolutionary algorithms. © 2022 International Foundation for Autonomous Agents and Multiagent systems (***). All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Enabling Efficient Large Recommendation Model Training with Near CXL Memory Processing

Enabling Efficient Large Recommendation Model Training with ...

引用

Annual International Symposium on Computer Architecture, ISCA

作者： Haifeng Liu Long Zheng Yu Huang Jingyi Zhou Chaoqiang Liu Runze Wang Xiaofei Liaot Hai Jinf Jingling Xue National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab Huazhong University of Science and Technology China School of Computer Science and Engineering University of New South Wales Australia Zhejiang Lab Hangzhou China

ISBN: (数字)9798350326581

ISBN: (纸本)9798350326598

Personalized recommendation systems have become one of the most important Internet services nowadays. A critical challenge of training and deploying the recommendation models is their high memory capacity and bandwidth demands, with the embedding layers occupying hundreds of GBs to TBs of storage. The advent of memory disaggregation technology and Compute Express Link (CXL) provides a promising solution for memory capacity scaling. However, relocating memory-intensive embedding layers to CXL memory incurs noticeable performance degradation due to its limited transmission bandwidth, which is significantly lower than the host memory bandwidth. To address this, we introduce ReCXL, a CXL memory disaggregation system that utilizes near-memory processing for scalable, efficient recommendation model training. ReCXL features a unified, hardwareefficient NMP architecture that processes the entire embedding training within CXL memory, minimizing data transfers over the bandwidth-limited CXL and enhancing internal bandwidth. To further improve the performance, ReCXL incorporates softwarehardware co-optimizations, including sophisticated dependencyfree prefetching and fine-grained update scheduling, to maximize hardware utilization. Evaluation results show that ReCXL outperforms the CPU-GPU baseline and the naïve CXL memory by $7.1 \times \sim 10.6 \times(9.4 \times$ on average) and $12.7 \times \sim 31.3 \times(22.6 \times$ on average), respectively.

关键词： Training Degradation Scalability Prefetching Memory management Web and internet services Bandwidth

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

DD-UNet: Densely Dilated U-Net for Curvilinear Structure Segmentation in Fundus Image

DD-UNet: Densely Dilated U-Net for Curvilinear Structure Seg...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yindong Zhang Jie Chen Li Wang Miaohong Chen Guoming Zhang Jianqiang Li College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Shenzhen Eye Hospital China

Retinopathy of Prematurity (ROP) is a retina disorder that affects premature infants with lower weights. If the patient cannot get the treatment in time when the illness reaches the last stage, irreversible vision loss will be caused. Nevertheless, there has been relatively little consideration given to the segmentation of the ridge, the key clinical characteristic of the illness. Additionally, existing research has not adequately addressed several segmentation issues, such as fragmentary topology, class imbalance, and false positives. This paper proposes a Densely Dilated U-Net (DD-UNet) improved from U-Net to tackle these challenges. Furthermore, the post-processing techniques based on the spatial relationship between vessels and ridges, along with the relative pixel counts of ridges and false positive results is integrated to mitigate false positive results in the predicted ridge. To enhance the precision of thin vessel, a sliding window sampling method is introduced for refined training. Compared with the state-of-the-art models in medical image segmentation, DD-UNet performs well in curvilinear structure segmentation of fundus image. For instance, our DD-UNet outperforms the Attention U-Net by 6.26% in terms of sensitivity and exhibits a 1.85% higher dice score in ridge segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：