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

2023 Asia-Pacific Conference on Image Processing, Electronics and computers, IPEC 2023

作者： Shao, Zexiang Zhang, Shibin Kumar, Sachin School of Cyberspace Security Chengdu University of Information Technology Chengdu610225 China Sichuan Key Laboratory of Advanced Cryptography and System Security Chengdu610225 China Ajay Kumar Garg Engineering College Department of Computer Science and Engineering India

ISBN: (纸本)9781665457033

The Quantum K-means clustering algorithm offers the advantage of quantum parallel computing, but suffers from issues related to cluster center initialization and sensitivity to noisy data due to its similarity with the K-means clustering algorithm. To address these challenges, we propose a quantum K-means model based on an optimization framework. Specifi-cally, we use a quantum genetic algorithm with pin optimization to adjust the fitness function for the Quantum K-means clustering algorithm. The optimally adapted quantum genetic algorithm reduces the sensitivity of cluster center initialization and improves the noise robustness of the Quantum K-means clus-tering algorithm using a noise reduction self-encoder. As a result, the proposed model achieves better clustering performance even in the presence of noise. Experimental results demonstrate that our proposed quantum K-means model has fewer clustering iterations, lower probability of falling into local optima, and improved noise robustness after optimizing the clustering cen-ters. The model's effectiveness in clustering is also demon-strated experimentally. © 2023 IEEE.

关键词： Noise abatement

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

arXiv 2024年

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

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 will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

A Robot Pick and Place Skill Learning Method Based on Maximum Entropy and DDQN Algorithm

A Robot Pick and Place Skill Learning Method Based on Maximu...

引用

2021 International Conference on Robotics Automation and Intelligent Control, ICRAIC 2021

作者： Wu, Peiliang Zhang, Yan Li, Yao Mao, Bingyi Chen, Wenbai Gao, Guowei School of Information Science and Engineering Yanshan University Hebei Qinhuangdao066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei Qinhuangdao066004 China School of Automation Beijing Information Science and Technology University Beijing100192 China

Pick and place (PAP) skill learning is a fundamental ability of intelligent robots, such as home service robot. Due to the NP-hard nature of the PAP problem, it takes a long time for an intelligent robot to learn the PAP skill based on current methods. In order to improve the learning efficiency of robot PAP skills, this paper proposes a Soft-DDQN-based PAP skill learning method. Firstly, the Soft-DDQN is proposed by introducing maximum entropy into robot DDQN framework, and the learning goal of Soft-DDQN is to maximize reward and information entropy. Secondly, PAP problem is modelled as a discrete form and Soft-DDQN is applied to solve the PAP problem. Finally, in order to verify the efficiency of Soft-DDQN-based PAP skill learning, comparisons have been given from two standard perspectives and shown that Soft-DDQN improves efficiency of PAP skill learning evidently. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

Significant Engagement Community Search on Temporal Networks: Concepts and Algorithms

arXiv

引用

arXiv 2022年

作者： Zhang, Yifei Lin, Longlong Yuan, Pingpeng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science & Technology HuaZhong University of Science and Technology Luoyu Road 1037 Hubei Wuhan430074 China

Community search, retrieving the cohesive subgraph which contains the query vertex, has been widely touched over the past decades. The existing studies on community search mainly focus on static networks. However, real-world networks usually are temporal networks where each edge is associated with timestamps. The previous methods do not work when handling temporal networks. We study the problem of identifying the significant engagement community to which the user-specified query belongs. Specifically, given an integer k and a query vertex u, then we search for the subgraph H which satisfies (i) u ∈ H;(ii) the de-temporal graph of H is a connected k-core;(iii) In H that u has the maximum engagement level. To address our problem, we first develop a top-down greedy peeling algorithm named TDGP, which iteratively removes the vertices with the maximum temporal degree. To boost the efficiency, we then design a bottom-up local search algorithm named BULS and its enhanced versions BULS+ and BULS*. Lastly, we empirically show the superiority of our proposed solutions on six real-world temporal graphs. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Memory Architecture Supporting Fine-Grained Data Migration

SSRN

引用

SSRN 2022年

作者： Chi, Ye Yue, Jianhui Liao, Xiaofei Liu, Haikun Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Computer Science Michigan Technological University HoughtonMI United States

We propose Mocha, a non-hierarchical caching architecture that organizes DRAM and NVM in a flat address space physically, but manages DRAM/NVM in a cache/memory hierarchy in this paper. Since the commercial NVM device-Intel Optane DC Persist Memory Modules (DCPMM) actually access the physical media at a granularity of 256 bytes (an Optane block), we manage the DRAM cache at the 256-byte size to adapt to this device feature of Optane. This design not only enables fine-grained data migration and management for the DRAM cache, but also avoids write amplification for Optane DCPMM. We also create a the \textit{ Indirect Address Cache} (IAC) in \textit{Hybrid Memory Controller}(HMC) and propose a reverse address mapping table in the DRAM to speed up address translation and cache replacement. Besides, we exploit an utility-based caching mechanism to filter cold blocks in the NVM, and further improve DRAM cache effectiveness. We implement Mocha in an architecture simulator. Experimental results indicate that MOCHA can improve performance of applications by 8.2\% on average (up to 24.6\%), provide 6.9\% reduction in average energy consumption and 25.9\% reduction in average data migration traffic, compared to the most advanced hybrid memory architecture-HSCC. © 2022, The Authors. All rights reserved.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

An Early Detection Model of Prostate Cancer Based on MRI 9

An Early Detection Model of Prostate Cancer Based on MRI

引用

9th IEEE International Conference on Data science in Cyberspace, DSC 2024

作者： Liu, Yuankun Xing, Lumin Wang, Di Nie, Xin Zhang, Xueyan Wu, Di Liu, Wenjian The First Affiliated Hospital of Shandong First Medical University Shandong Provincial Qianfoshan Hospital Jinan China City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Chongqing Jianzhu College Chongqing China Shandong Youth University of Political Science School of Information Work Office Jinan China University of Southern Queensland School of Mathematics Physics and Computing QLD Australia

ISBN: (纸本)9798350391367

Prostate cancer is a prevalent form of cancer among men, with a high rate of occurrence but relatively lower mortality compared to other types of cancer. Early detection is crucial because it allows for earlier intervention, potentially preventing progression to more severe stages, and improving patient outcomes. However, human diagnosis is time-consuming and inefficient, an autonomous early detection system is essential for saving lives. To address this challenge, we propose a novel MoE-MRIViT framework that uses advanced machine learning and computer vision techniques to analyze MRI images and identify features indicative of prostate cancer. The system processes the data using a vision transformer to extract precise prostate cancer features from MRI scans, and uses attention mechanisms to focus on significant areas. Through the MoE-MRIViT intervention in two stages, we have achieved superior results compared to the state-of-the-art (SOTA) methods. Experimental results demonstrate that our model achieves an impressive accuracy of 94.84%, outperforming the ResNet-101 and the basic ViT models, which achieve accuracies of 89.4% and 92.31%, respectively. © 2024 IEEE.

关键词： Urology

来源：评论

学校读者我要写书评

暂无评论

LLM-Driven Neighborhood Search for Efficient Heuristic Design

LLM-Driven Neighborhood Search for Efficient Heuristic Desig...

引用

Congress on Evolutionary Computation

作者： Zhuoliang Xie Fei Liu Zhenkun Wang Qingfu Zhang Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology & School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong China

ISBN: (数字)9798331534318

ISBN: (纸本)9798331534325

Handcrafting heuristics often demands extensive domain knowledge and significant development effort. Recently, heuristic search powered by large language models (LLMs) has emerged as a new approach, offering enhanced automation and promising performance. Existing methods rely on an evolutionary computation (EC) framework with carefully designed prompt strategies. However, the large heuristic search space poses significant challenges for these EC-based methods. This paper proposes a simple yet effective LLM-driven Heuristic Neighborhood Search (LHNS) paradigm to iteratively search in the heuristic neighborhood in a principled way for efficient heuristic design. Three distinct methods are designed under this neighborhood search paradigm and demonstrated on three widely studied problems. Results indicate that LHNS exhibits very competitive performance and surpasses existing EC-based methods in efficiency. It also demonstrates sufficient robustness in the absence of problem-specific knowledge regarding the target problem. The efficiency and robust adaptability make it a practical new solution for efficient heuristic design.

关键词： Automation Large language models Evolutionary computation Search problems Robustness

来源：评论

学校读者我要写书评

暂无评论

A Speed Measurement Method of Rail Transit Based on Millimeter-Wave Radar 1

引用

5th International Symposium for Intelligent Transportation and Smart City, ITASC 2022

作者： Shen, Tuo Xie, Lanxin Luo, Jinnan Zeng, Xiaoqing Shanghai Key Laboratory of Rail Infrastructure Durability and System Safety Shanghai201804 China School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai200093 China Institute of Rail Transit Tongji University Shanghai China

ISBN: (数字)9789819922529

ISBN: (纸本)9789819922512

The growing use of millimeter-wave radars in the intelligent transportation field and increasing accuracy provide new possibilities for train speed measurement. This paper proposes a measuring train speed method by using millimeter-wave radar to detect static objects. The millimeter-wave radar was used to obtain and process objects data. Then, using the RANSAC algorithm to extract the static objects group, and calculated the relative speed of the millimeter-wave radar and the static objects group. Finally, we completed the comparative experiment of using millimeter-wave radar and odometer to measure train speed in a real track environment. The results show that the measurement error of this method is less than 1.5 m/s, and it has the characteristics of low cost, fast speed measurement, and high precision. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Parallelism or Fairness? How to Be Friendly for SSDs in Cloud Environments

Parallelism or Fairness? How to Be Friendly for SSDs in Clou...

引用

IEEE International Conference on Cluster computing

作者： Yang Zhou Fang Wang Zhan Shi Dan Feng Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of data storage systems and Technology Ministry of Education of China Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350358711

ISBN: (纸本)9798350358728

Modern SSDs achieve low latency and high throughput by utilizing multiple levels of SSD parallelism. Fairness is also a critical design consideration in cloud environments and has inspired great interest in recent years to study it. However, we find that excessive striving for SSD parallelism can inadvertently harm the SSD fairness due to the striped data layout. We observe from our experimental analysis that some common access patterns in cloud loads (e.g., high-intensity I/O) are not addressed by SSD parallelism, which can affect both SSD parallelism and fairness. In this paper, we analyze two address mapping policies with orthogonal characteristics from SSD parallelism and fairness perspectives. Based on extensive experiments and observations, we schedule a hybrid address mapping policy to achieve fairness of SSDs in cloud environments by distinguishing different I/O access modes and cold/hot data, while ensuring SSD performance. Experimental results on the latest block-level I/O traces show that our approach significantly improves performance and fairness by up to 77.3% and 62.8%, respectively, over the previous schemes with negligible cost. Meanwhile, it can also reduce the write amplification by 23.5% to 33.5%.

关键词： Schedules Layout Interference Parallel processing Predictive models Throughput Data models Resource management Decision trees Low latency communication

来源：评论

学校读者我要写书评

暂无评论

Few-shot Face Image Translation via GAN Prior Distillation

arXiv

引用

arXiv 2023年

作者： Zhao, Ruoyu Zhu, Mingrui Wang, Xiaoyu Wang, Nannan State Key Laboratory of Integrated Services Networks Xidian University Xi’an China School of Computer Science and Technology University of Science and Technology of China China

Face image translation has made notable progress in recent years. However, when training on limited data, the performance of existing approaches significantly declines. Although some studies have attempted to tackle this problem, they either failed to achieve the few-shot setting (less than 10) or can only get suboptimal results. In this paper, we propose GAN Prior Distillation (GPD) to enable effective few-shot face image translation. GPD contains two models: a teacher network with GAN Prior and a student network that fulfills end-to-end translation. Specifically, we adapt the teacher network trained on large-scale data in the source domain to the target domain with only a few samples, where it can learn the target domain’s knowledge. Then, we can achieve few-shot augmentation by generating source domain and target domain images simultaneously with the same latent codes. We propose an anchor-based knowledge distillation module that can fully use the difference between the training and the augmented data to distill the knowledge of the teacher network into the student network. The trained student network achieves excellent generalization performance with the absorption of additional knowledge. Qualitative and quantitative experiments demonstrate that our method achieves superior results than state-of-the-art approaches in a few-shot setting. Copyright © 2023, The Authors. All rights reserved.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：