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

A reposition algorithm for e-hailing based on quantum annealing and intuitive reasoning

Intelligent and Converged Networks 2024年第4期5卷 317-335页

作者： Chao Wang Yiyun Shi Sumin Wang Key Laboratory of Specialty Fiber Optics and Optical Access Networks Shanghai UniversityShanghai 200444China School of Information Engineering Ganzhou Key Laboratory of Cloud Computing and Big Data ResearchGannan University of Science and TechnologyGanzhou 341000China

Currently,the challenge lies in the traditional intelligent algorithm’s ability to effectively address the e-hailing repositioning *** identifying the underlying characteristics in extensive traffic data within a limited timeframe is difficult,ultimately preventing the achievement of the most optimal *** paper suggests a hybrid computing architecture involving reinforcement learning and quantum annealing based on intuitive *** reasoning aims to enhance performance in scenarios with poor system robustness,complex tasks,and diverse goals.A deep learning model is constructed,trained to extract scene features,and combined with expert knowledge,then transformed into a quantum annealable *** final strategy is obtained using a D-wave quantum computer with quantum tunneling effect,which helps in finding optimal solutions by jumping out of local suboptimal *** on 400000 real data,four algorithms are compared:minimum-cost flow,sequential markov decision process,hot-dot strategy,and driver-prefer *** average total revenue increases by about 10%and vehicle utilization by about 15%in various *** summary,the proposed architecture effectively solves the e-hailing reposition problem,offering new directions for robust artificial intelligence in big data decision problems.

关键词： intuitive reasoning reinforcement learning quantum annealing

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua Science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Reliability via Subsystem Structures of Arrangement Graph Networks

引用

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs

引用

Frontiers of computer Science 2023年第4期17卷 97-107页

作者： Jia LI Wenjun LI Yongjie YANG Xueying YANG School of Information Engineering Hunan Industry PolytechnicChangsha 410036China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410015China Chair of Economic Theory Saarland UniversitySaarbrücken 66123Germany

In the minimum degree vertex deletion problem,we are given a graph,a distinguished vertex in the graph,and an integer κ,and the question is whether we can delete at most κ vertices from the graph so that the distinguished vertex has the unique minimum *** maximum degree vertex deletion problem is defined analogously but here we want the distinguished vertex to have the unique maximum *** is known that both problems areΨ-hard and fixed-parameter intractable with respect to some natural *** this paper,we study the(parameterized)complexity of these two problems restricted to split graphs,p-degenerate graphs,and planar *** study provides a comprehensive complexity landscape of the two problems restricted to these special graphs.

关键词： minimum degree maximum degree vertex deletion split graphs planar graphs parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

FF-LSTM: Phenotype prediction based on feature fusion 3

FF-LSTM: Phenotype prediction based on feature fusion

引用

3rd International Conference on Electronic information engineering and data Processing, EIEDP 2024

作者： Zhang, Ge Zhang, Zhou Kou, Xuye Chen, Yitong School of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China

ISBN: (纸本)9781510680531

Phenotypic prediction before crop planting and harvest facilitates plant phenotyping analysis and the implementation of precision agriculture, which is crucial for food security policy formulation, crop management, and food security. Environmental data collected in the field, as important factors affecting phenotypes, can be used together with genotypes to train phenotypic prediction models to improve their prediction capabilities. Although the rise of deep learning has provided a powerful tool for predicting phenotypes using genotype and environmental data, current research only performs simple splicing operations when processing genotype and environmental data and fails to effectively model the impact of genotype and environment on phenotype. Therefore, it is still challenging to accurately predict phenotype using genotype and environment. To solve the problems mentioned above, we design a phenotype prediction model named FF-LSTM. In this method, LSTM is used to extract features from SNP and environmental, and the feature fusion method weights the extracted features to simulate the influence of genotype and environment on phenotype. We conducted experiments on the dataset and verified the effectiveness of this method by analyzing and evaluating the experimental results. © 2024 SPIE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Trajectory optimization for UAV-enabled relaying with reinforcement learning

引用

Digital Communications and Networks 2025年第1期11卷 200-209页

作者： Chiya Zhang Xinjie Li Chunlong He Xingquan Li Dongping Lin School of Electronic and Information Engineering Harbin Institute of TechnologyShenzhenChina Guangdong Key Laboratory of Intelligent Information Processing Shenzhen UniversityShenzhenChina Peng Cheng Laboratory(PCL) ShenzhenChina National Mobile Communications Research Laboratory Southeast UniversityNanjingChina Shenzhen Institute of Information Technology ShenzhenChina Guangdong-Hong Kong Joint Laboratory for Big Data Imaging and Communication Shenzhen UniversityShenzhenChina

In this paper,we investigate the application of the Unmanned Aerial Vehicle(UAV)-enabled relaying system in emergency communications,where one UAV is applied as a relay to help transmit information from ground users to a Base Station(BS).We maximize the total transmitted data from the users to the BS,by optimizing the user communication scheduling and association along with the power allocation and the trajectory of the *** solve this non-convex optimization problem,we propose the traditional Convex Optimization(CO)and the Reinforcement Learning(RL)-based ***,we apply the block coordinate descent and successive convex approximation techniques in the CO approach,while applying the soft actor-critic algorithm in the RL *** simulation results show that both approaches can solve the proposed optimization problem and obtain good ***,the RL approach establishes emergency communications more rapidly than the CO approach once the training process has been completed.

关键词： Unmanned aerial vehicle Emergency communications Trajectory optimization Convex optimization Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic lorentz attention for synthetic lethality prediction 3

Hyperbolic lorentz attention for synthetic lethality predict...

引用

3rd International Conference on Biomedical and Intelligent Systems, IC-BIS 2024

作者： Zhang, Ge Chen, Yitong Kou, Xuye Zhang, Zhou School of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China

ISBN: (纸本)9781510681279

Synthetic lethal interactions are critical genetic interactions that have been discovered for identifying new drug targets and potential cancer drug combination strategies. As a targeted approach to selectively kill cancer cells, it has attracted great attention in the field of cancer treatment. However, with the rapid growth of high-throughput data, effective identification of synthetic lethal interactions remains challenging. Although many graph topology methods focus on predicting SL interactions, heterogeneous graphs that exist in the real world tend to be scale-free, where the number of high-order neighbor nodes of high-degree nodes grows exponentially. The graph embedding method based on Euclidean space may not be able to effectively capture the internal hierarchical structure of the scale-free network, and there is not enough space to accommodate the nodes, making the node embedding highly distorted, which greatly limits the modeling ability. In this paper, we propose a model named HLASL based on the hyperbolic Lorentz attention mechanism, it ensures that the learned node features follow a Lorentz manifold. Specifically, in hyperbolic space, we use Lorentzian manifolds to encode heterogeneous information from KGs and information about synthetic lethality. In addition, we introduce the Lorenz knowledge graph attention mechanism to distinguish the weights of different information from the hyperbolic space to optimize gene embedding. Experiments on two datasets show that HLASL outperforms several state-of-the-art baseline methods in synthetic lethality prediction. © 2024 SPIE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Single cell clustering using ZINB Model and variational graph attention autoencoder 3

Single cell clustering using ZINB Model and variational grap...

引用

3rd International Conference on Biomedical and Intelligent Systems, IC-BIS 2024

作者： Zhang, Ge Kou, Xuye Chen, Yitong Zhang, Zhou School of Computer and Information Engineering Henan University Kaifeng475004 China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng475004 China

ISBN: (纸本)9781510681279

Single-cell RNA sequencing allows to discovery of new cell subtypes based on transcriptomic information. Clustering analysis is an effective approach for exploring single-cell heterogeneity. Nevertheless, current single-cell clustering methodologies are challenged by the high-dimensional, sparse, and dropouts on the one hand, and on the other hand, they neglect the thorough exploration of potential relationships between cells and noise removal. To tackle these challenges, this study introduces a novel self-optimized single-cell clustering algorithm named scZVEA, which combines Zero- Inflated Negative Binomial (ZINB) model and variational graph attention autoencoder. The scZVEA framework comprises three key modules. Firstly, a Deep Count Autoencoder (DCA) is designed to model data distribution and eliminate noise. Then, a variational graph attention autoencoder to extract latent features from the data. Lastly, the self-optimized clustering module enables the two previously independent clustering and feature modules to mutually benefit each other by iteratively updating cluster centers to further enhance clustering performance. Experimental findings based on six authentic scRNAseq datasets illustrate that the proposed clustering algorithm significantly enhances clustering accuracy when compared to alternative methods. © 2024 SPIE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Task Offloading Optimization Based on Position Prediction in Pedestrian- Robot Mixed Traffic Flows 8

Task Offloading Optimization Based on Position Prediction in...

引用

8th IEEE International Conference on computer and Communications, ICCC 2022

作者： Zheng, Dawen Wang, Lusheng Kai, Caihong Peng, Min Key Laboratory of Knowledge Engineering with Big Data Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781665450515

Service robots play an increasingly important role in people's daily life. The density of pedestrians is large and the movement is irregular in pedestrian-robot mixed traffic flows. Robots are prone to collision with pedestrians, and the tasks to be offloaded are closely related to pedestrians. How to analyze the tasks of robots and select the appropriate roadside unit is an important issue. In this paper, the social force model is used to predict the positions of pedestrians and robots, taking into account the influence of various forces to avoid collisions. A task offloading resource optimization algorithm with position prediction is proposed. According to the predicted information, the size and position distribution of all tasks in the scenario are obtained, and then the neural network trained beforehand based on deep Q-Iearning is used to generate a task offloading strategy. The simulation results show that the running time of the proposed algorithm is very short, and the resource allocation required for task offloading is completed in advance based on the predicted information before robots arriving the corresponding positions. Besides, the algorithm significantly reduces the task offloading delay. © 2022 IEEE.

关键词： Edge computing

来源：评论

学校读者我要写书评

暂无评论

Visual abstraction of dynamic network via improved multi-class blue noise sampling

引用

Frontiers of computer Science 2023年第1期17卷 171-185页

作者： Yanni PENG Xiaoping FAN Rong CHEN Ziyao YU Shi LIU Yunpeng CHEN Ying ZHAO Fangfang ZHOU School of Computer Science and Engineering Central South UniversityChangsha 410083China Institute of Big Data Hunan University of Finance and EconomicsChangsha 410205China Rail Data Research and Application Key Laboratory of Hunan Province Changsha 410083China

Massive sequence view (MSV) is a classic timeline-based dynamic network visualization approach. However, it is vulnerable to visual clutter caused by overlapping edges, thereby leading to unexpected misunderstanding of time-varying trends of network communications. This study presents a new edge sampling algorithm called edge-based multi-class blue noise (E-MCBN) to reduce visual clutter in MSV. Our main idea is inspired by the multi-class blue noise (MCBN) sampling algorithm, commonly used in multi-class scatterplot decluttering. First, we take a node pair as an edge class, which can be regarded as an analogy to classes in multi-class scatterplots. Second, we propose two indicators, namely, class overlap and inter-class conflict degrees, to measure the overlapping degree and mutual exclusion, respectively, between edge classes. These indicators help construct the foundation of migrating the MCBN sampling from multi-class scatterplots to dynamic network samplings. Finally, we propose three strategies to accelerate MCBN sampling and a partitioning strategy to preserve local high-density edges in the MSV. The result shows that our approach can effectively reduce visual clutters and improve the readability of MSV. Moreover, our approach can also overcome the disadvantages of the MCBN sampling (i.e., long-running and failure to preserve local high-density communication areas in MSV). This study is the first that introduces MCBN sampling into a dynamic network sampling.

关键词： dynamic network visualization massive sequence view multi-class blue noise sampling visual abstraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：