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

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Chen, Kang Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Mobile crowdsensing (MCS) is a potential technology for large-scale data collection. This technology requires the platform to recruit users to complete tasks in specific areas. A vital issue in MCS is task assignment, and most existing task assignment efforts consider only a single user type, which is not reasonable in real scenarios. Task assignment becomes more complicated when the platform tries to assign tasks to heterogeneous users with a limited budget in the platform. In this paper, we consider a quality-oriented task assignment for heterogeneous users problem. Professional users have a high sensing quality with a high cost, and normal users have a low sensing quality with a low cost First, we model the sensing capabilities and the costs of different users and formulate the quality-oriented task assignment for heterogeneous users problem. Then, we design the integer linear programming form and prove that the problem is NP-hard. By verifying the submodularity of the objective function, we present a greedy algorithm. Considering the inefficiency of the algorithm, we design two genetic algorithms to improve the total sensing quality. Finally, we evaluate the proposed algorithms under different cost cases based on a real dataset The results show that our proposed algorithm performs well under different cost distribution scenarios. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards DDIs Identification by Knowledge Graph with BiRW and Back Aggregation

Towards DDIs Identification by Knowledge Graph with BiRW and...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Yin, Zhuang Lin, Xiaoli Zhang, Xiaolong Wuhan University of Science and Technology Hubei Key Laboratory of Intelligent Information Processing and Real-time Industrial System School of Computer Science and Technology Wuhan China

ISBN: (纸本)9781665468190

Effective identification of potential drug-drug interactions (DDIs) can prevent adverse effects caused by DDIs to a certain extent. This paper proposes the new hybrid method for predicting DDIs, which is called BiRW-KGBAN that combines bidirectional random walk and back aggregation based on knowledge graph. BiRW-KGBAN first constructs two knowledge graph KG-DrugBank and KG-KEGG that integrate data related to drugs. Then, an improved sampling method based on bidirectional random walk (BiRW) is used to sample the neighborhood information of drugs, including directly connected entities, related semantic relations and potential information. In addition, the path with drug as the center node is also extracted. Finally, two improved back aggregation model KGBAN1 and KGBAN2 are used to obtain the final embedded representation of the drugs. The experiments show that, compared with other existing methods, our method could obtain the higher-order topological information and the deeper potential neighborhood information of drugs, and has great improvements in DDIs prediction. The case study also shows that the proposed method has the potential for actual DDIs prediction. © 2022 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

On Privacy-Preserving Task Assignment for Heterogeneous Users in Mobile Crowdsensing 26

On Privacy-Preserving Task Assignment for Heterogeneous User...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Ji Li, Peng Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350331684

Task assignment is a key challenge in mobile crowd-sensing because of the varying capabilities of crowd users. Location-based task assignment schemes require users to upload their location to an untrusted platform, which raises many privacy concerns. However, stronger privacy preservation may lead to lower system utility. It is challenging to maximize system utility under privacy preservation for users. In this paper, we propose a privacy-preserving task assignment for heterogeneous users (PTAH) problem in mobile crowdsensing. Specifically, we divide users into two groups: private users with location privacy requirements and public users without location privacy requirements. We first design a privacy-preserving mechanism to obfuscate the actual location of private users. Then we construct a relationship graph based on the locations between users and tasks. We prove that the PTAH problem is an NP-hard problem, so to maximize the system utility, we propose an approximation algorithm based on the greedy algorithm. Then we propose a multi-thread cooperative simulated annealing algorithm to search for a better approximate solution. Finally, we conducted simulations based on the widely-used real-world Roma dataset. The results show that our proposed algorithm consistently outperforms other baseline algorithms. © 2023 IEEE.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

An end-to-end instance segmentation method based on improved ConvNeXt V2

引用

International Journal of Wireless and Mobile Computing 2024年第4期26卷 384-392页

作者： Wang, Wenlu Sun, Ying Xu, Manman Bai, Dongxu Huang, Li Zou, Chunlong Chen, Baojia Tang, Dalai Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education Wuhan University of Science and Technology Hubei Wuhan China Research Centre for Biomimetic Robot and Intelligent Measurement and Control Wuhan University of Science and Technology Hubei Wuhan China Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering Wuhan University of Science and Technology Hubei Wuhan China College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Hubei Wuhan China College of Mechanical Engineering Hubei University of Automotive Technology Hubei Shiyan China Hubei Key Laboratory of Hydroelectric Machinery Design and Maintenance China Three Gorges University Hubei Yichang China School of Computer Information Management Inner Mongolia University of Finance and Economics Hohhot China

In order to improve the efficiency of indoor mobile robots in locating and segmenting environmental instances, an instance segmentation method based on RTMDet is proposed. Firstly, the more powerful ConvNeXt V2 is used as the backbone network of the model, which improves the performance of the existing RTMDet model. Subsequently, NAS-FPN is used as a converged network to detect the network at any given time. Finally, AdamW is used as the model optimiser, which effectively solves the problem of excessive memory occupation when updating parameters and improves the performance of the model. The proposed method obtains the highest evaluation index in all cases. After training and testing on the Cityscapes data set, the recognition accuracy reaches 65.0%. © 2024 Inderscience Enterprises Ltd.

关键词： Statistical tests

来源：评论

学校读者我要写书评

暂无评论

Semantic Segmentation of 3D Liver Image Based on Multi-Path Features Attention Mechanism

Semantic Segmentation of 3D Liver Image Based on Multi-Path ...

引用

2023 IEEE International Conference on systems, Man, and Cybernetics, SMC 2023

作者： Jiang, Zhihui Zhang, Xiaolong Deng, He Ren, Hongwei Wuhan University of Science and Technology Hubei Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Wuhan University of Science and Technology Medical Imaging Research Center Tianyou Hospital Affiliated Wuhan China

ISBN: (纸本)9798350337020

It is challenging to precisely segment the liver from surrounding organs in medical images because of the poor contrast between them. A method of semantic segmentation of 3D liver images based on multi-path features attention mechanism is proposed to address this issue. It integrates three-dimensional spatial information and feature information from several paths in the model to automatically segment the liver area. The model in this paper uses the LiTS dataset for training, testing, and ablation experiments, and compares the results with previous models. The experimental results demonstrate that the model in this paper has reached 0.965 in the DICE similarity coefficient, and has also improved in evaluation indicators such as volume overlap error (VOE) and root mean square symmetric surface distance (RMSD). It also has better segmentation performance when tested on the CHAOS dataset. Cross-validation was carried out on the clinical MRI dataset of a hospital, and the DICE similarity coefficient reached 0.971. The results show that the model has good performance on the multi-modal datasets of CT and MRI. © 2023 IEEE.

关键词： 3D medical image attention mechanism deep learning liver image semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

FELSDiff: Image Super-Resolution Based on Diffusion Model Fusing Feature Extraction with Latent Space 20

FELSDiff: Image Super-Resolution Based on Diffusion Model Fu...

引用

20th International Conference on Natural Computation, Fuzzy systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Wu, Cancan Zhang, Zhi Wuhan University of Science and Technology College of Computer Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Hubei Wuhan430065 China

ISBN: (纸本)9798350356328

In addressing issues like an excessive number of network parameters and the loss of fine texture details in image super-resolution reconstruction approaches based on diffusion models, this passage introduces a novel image super-resolution model (FELSDiff). This model relies on the fusion of diffusion models, feature extraction, and latent space. FELSDiff utilizes a Pre-trained CNN for initial super-resolution to extract the primary low-band features and part high-band features of the image. The preliminary super-resolved image is then concatenated as a condition to this model. We introduce a cross-attention mechanism guided by the high-band features of the preliminary super-resolved image to enhance the network's feature extraction capability and obtain more effective features. In the U-Net structure, we incorporate a latent space strategy, enabling the model's training and inference processes to be conducted in the latent space, thereby reducing the number of network parameters. Experimental results on multiple standard datasets indicate that this method outperforms other advanced methods overall. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Solving Constrained Multi-objective Optimization Problems with Passive Archiving Mechanism 1

引用

17th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2022

作者： Jia, Huijuan Zhang, Kai Shen, Chaonan School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan University of Science and Technology Wuhan430065 China

ISBN: (数字)9789819915491

ISBN: (纸本)9789819915484

During these years, many advanced constrained multi-objective evolutionary algorithms (CMOEAs) have been developed to solve constrained multi-objective optimization problems (CMOPs). However, some existing constrained multi-objective algorithms do not use an archiving mechanism, which leads to easy loss of the searched feasible solutions during the search process. In addition, even if some algorithms use an archiving mechanism, an unsuitable archiving update strategy can cause difficulty in balancing the diversity and convergence of the archive set. To address these challenges, a two-stage constrained multi-objective evolutionary algorithm based on a passive archiving mechanism (PA-CMOEA) is proposed in this paper. In the first stage, the constrained multi-objective problem is modeled as an unconstrained multi-objective problem, which allows the population to fully explore the decision space. The archive set is passively updated in a constraint-domination principle (CDP) criterion using population information. The goal of this stage is for the archive set to converge to the constrained Pareto front region of the problem with the help of population information. In the second stage, a local search is performed on the archive set. Specifically, the convergence and diversity of the archived solution set is improved while ensuring that the feasibility of the archived set is not worse. Finally, the algorithm outputs the archive set. To estimate the performance of the proposed algorithm, experiments are conducted on the LIRCMOP and CF benchmarks in comparison with some of the most popular algorithms. The experimental results demonstrate that the proposed algorithm has a competitive advantage compared with the comparative algorithms. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

time Series Data Association Mining With High-Frequency Data Interference 24

Time Series Data Association Mining With High-Frequency Data...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Zhu, Rongjing Li, Peng Liu, Yu Deng, Miao School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

time series data mining is an important problem in data mining. It discovers the intrinsic correlation rules by analyzing a large amount of time series data. However, high-frequency data may exist in the dataset. High-frequency data is the data that occurs frequently in time series data, which will affect the mining of association rules. Traditional time series association mining tends to classify high-frequency data as correlated data because they co-occur too many times. In this paper, we propose the list mining framework to mine the association data by list co-occurrence to achieve the mining of massive data. We divide it into three phases, list generation phase, matrix generation phase, and rule generation phase. First, we create data lists based on time windows. Second, we create the initial count matrix, update the count matrix based on the list, and propose a GCPM algorithm to generate a conditional probability matrix based on the count matrix. Third, we propose a List Mining (LM) algorithm to generate the initial rules based on the conditional probability matrix and optimize the initial rules to get the final association rules. In addition, we weigh the rules according to the list mining method and propose a Weighted List Mining (WLM) algorithm to filter rules by reducing the weight of frequent item interference. The experimental results show that LM and WLM can effectively improve the accuracy of mining results. © 2022 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Mining Alarm Association Rules in Optical Transmission Networks Using a Statistical Approach 24

Mining Alarm Association Rules in Optical Transmission Netwo...

引用

作者： Deng, Miao Li, Peng Liu, Yu Zhu, Rongjing Zhang, Yujie School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

Due to the interconnection between devices in the optical transmission network (OTN), when one device fails and generates alarm information, a large number of other invalid alarms are generated in OTN. How to mining association rules in alarm data is an important problem. In this paper, we investigate the association rules mining problem based on a statistical method. First, we remove the chattering alarm in preprocess to reduce data redundancy. Second, we propose a statistics-based association rule mining algorithm. We use a sliding time window to scan the alarm data, and we exploit the matrix to record the corresponding results. According to the matrix, we calculate the support and confidence of association rules. Compared with other traditional association rule mining algorithms, the proposed algorithm does not need to set the minimum support artificially, and the obtained association rules have strong causality. Through extensive experiments on syn-thetic and real OTN alarm datasets, we verify the effectiveness of our proposed algorithm and the correctness of the obtained association rules. © 2022 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Enhanced fireworks algorithm based on particle swarm optimization and reverse learning of small-hole imaging experiment

Enhanced fireworks algorithm based on particle swarm optimiz...

引用

2022 IEEE International Conference on systems, Man, and Cybernetics, SMC 2022

作者： Jiao, Jiao Li, Jun Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Since the traditional fireworks algorithm (FWA) is easy to fall into local optimization and has insufficient global optimization capability and low optimization accuracy, this paper proposes the enhanced fireworks algorithm (EFWA-SI) based on particle swarm optimization and small-hole imaging reverse learning. First, a dynamic explosion amplitude mechanism based on the evolution speed of the population is designed. The evolution speed of the population is dynamically adjusted by evaluating the evolution speed of the fitness in each iteration process, and the global and local search information is controlled. Secondly, the small-hole imaging reverse learning strategy combined with the idea of optimal-worst reverse learning is proposed. This strategy increases the diversity of the optimal-seeking positions and improves the ability of the algorithm to jump out of the local optimum;Finally, the current position is updated according to the position and speed of each firework, and the globally optimal fireworks and personally optimal fireworks are updated simultaneously to improve the individual heuristic learning ability. Through the simulation experiments on the CEC2015 test function and comparison with related algorithms, the results show that the algorithm performs better in convergence speed, computational accuracy, and stability. © 2022 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：