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

Q-learning Based Meta-Heuristics for Scheduling Bi-Objective Surgery Problems with Setup Time

Complex system Modeling and Simulation 2024年第4期4卷 321-338页

作者： Ruixue Zhang Hui Yu Adam Slowik Kaizhou Gao School of Computer Science Liaocheng UniversityLiaocheng 252000China Macao Institute of System Engineering Macao University of Science and TechnologyMacao 999078China the Department of Electronics and Computer Science Koszalin University of TechnologyKoszalin 75-453Poland

Since the increasing demand for surgeries in hospitals,the surgery scheduling problems have attracted extensive *** study focuses on solving a surgery scheduling problem with setup *** a mathematical model is created to minimize the maximum completion time(makespan)of all surgeres and patient waiting time,*** time by the fatigue effect is included in the surgery time,which is caused by doctors’long working ***,four mate-heuristics are optimized to address the relevant *** novel strategies are designed to improve the quality of the initial *** improve the convergence of the algorithms,seven local search operators are proposed based on the characteristics of the surgery scheduling ***,Q-learning is used to dynamically choose the optimal local search operator for the current state in each ***,by comparing the experimental results of 30 instances,the *** based local search strategy's effectiveness is *** all the compared algorithms,the improved artificial bee colony(ABC)with Q-leaming based local search has the best competiiveness.

关键词： surgery scheduling meta-heuristics Q-earning makespan

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Techniques with LowDimensional Feature Extraction for Improving the Generalizability of Cardiac Arrhythmia

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2021年第2期48卷 1-10页

作者： Nurmaini, Siti Tutuko, Bambang Rachmatullah, Muhammad Naufal Darmawahyuni, Annisa Firdaus, Firdaus A Professor of Computer Engineering Intelligent System Research Group Universitas Sriwijaya Palembang30139 Indonesia A lecturer of Computer Engineering Department Faculty of Computer Science Universitas Sriwijaya Palembang30139 Indonesia A research assistant of Intelligent System Research Group Universitas Sriwijaya Palembang30139 Indonesia

Automatic heartbeat classification is an important stage in identifying cardiac arrhythmia. Several machine learning (ML) techniques have been proposed to perform this, but they produce an accuracy result of below 99%. In this study, a deep neural network (DNN) structure is applied to improve ML performance. The feature selection method is based on the combination of discrete wavelet transform (DWT) and principal component analysis (PCA). To avoid computational complexity, the components of PCA are derived by low-dimensional DWT coefficients. The results show that the proposed ML model achieves good performance, producing 99.76% accuracy, 91.80% sensitivity, 99.78% specificity, 93.02% precision, and 92.31% F1-score. To benchmark the proposed model, the support vector machine (SVM) and random forest (RF) techniques are used as the baseline models. The DNNs are 2.3% more sensitive than SVM, while the RF fails to classify the ECG heartbeat. Four datasets are used to analyze the robustness and generalization performance of the proposed model: MIT-BIH, SVDB, MITDB, and IncartDB. All testing results produce satisfying performance. The proposed ML model offers a potential solution to improve the generalizability of a DNN-based model in different cardiac datasets for classifying tasks. © 2021. All Rights Reserved.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

RGraph: Asynchronous graph processing based on asymmetry of remote direct memory access

RGraph: Asynchronous graph processing based on asymmetry of ...

引用

作者： Chen, Hanhua Yuan, Jie Jin, Hai Wang, Yonghui Wu, Sijie Jiang, Zhihao National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

The scale of real-world graphs is constantly growing. To deal with large-scale graphs, distributed graph processing has attracted much research efforts. Existing distributed graph processing systems are commonly built on traditional TCP/IP communication stack, which leads to network bottleneck because of low bandwidth and heavy kernel stack operations. Meanwhile, in real power-law graphs, the average number of mirror vertices after graph partitioning is very large, resulting in significant communication overhead among nodes. The emerging high-performance Remote Direct Memory Access (RDMA) network has the features of low latency, high bandwidth, and low CPU overhead, which brings new opportunities for distributed graph processing systems. Existing RDMA-assisted graph processing systems focus on synchronous execution, which imposes barriers between consecutive iterations. Synchronous execution transfers bulk data among nodes and thus only needs a small number of network transfers. However, synchronous execution is usually less efficient than asynchronous execution because of bulk synchronization. Asynchronous execution accelerates graph processing by eliminating barriers, which in turn requires to transfer a large amount of small size data. In this paper, we propose RGraph, an RDMA-assisted asynchronous distributed graph processing system. RGraph distributes edges into two parts to isolate master and mirror vertices. RGraph exploits the asymmetry of RDMA to accelerate the one-to-many communication between master and mirror vertices. We implement RGraph on top of PowerGraph and conduct comprehensive experiments with large-scale real graphs to evaluate its performance. Results show that compared to existing designs, RGraph reduces the execution time by up to 81%. © 2021 John Wiley & Sons Ltd.

关键词： Mirrors

来源：评论

学校读者我要写书评

暂无评论

Network Intrusion Detection Based on Feature Selection and Hybrid Metaheuristic Optimization

引用

computers, Materials & Continua 2023年第2期74卷 2677-2693页

作者： Reem Alkanhel El-Sayed M.El-kenawy Abdelaziz A.Abdelhamid Abdelhameed Ibrahim Manal Abdullah Alohali Mostafa Abotaleb Doaa Sami Khafaga Department of Information Technology College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of Communications and Electronics Delta Higher Institute of Engineering and TechnologyMansoura35111Egypt Department of Computer Science Faculty of Computer and Information SciencesAin Shams UniversityCairo11566Egypt Department of Computer Science College of Computing and Information TechnologyShaqra University11961Saudi Arabia Computer Engineering and Control Systems Department Faculty of EngineeringMansoura UniversityMansoura35516Egypt Information Systems Department College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia Department of System Programming South Ural State UniversityChelyabinsk454080Russia Department of Computer Sciences College of Computer and Information SciencesPrincess Nourah bint Abdulrahman UniversityP.O.Box 84428Riyadh11671Saudi Arabia

Applications of internet-of-things(IoT)are increasingly being used in many facets of our daily life,which results in an enormous volume of *** computing and fog computing,two of the most common technologies used in IoT applications,have led to major security *** are on the rise as a result of the usage of these technologies since present security measures are *** artificial intelligence(AI)based security solutions,such as intrusion detection systems(IDS),have been proposed in recent *** technologies that require data preprocessing and machine learning algorithm-performance augmentation require the use of feature selection(FS)techniques to increase classification accuracy by minimizing the number of features *** the other hand,metaheuristic optimization algorithms have been widely used in feature selection in recent *** this paper,we proposed a hybrid optimization algorithm for feature selection in *** proposed algorithm is based on grey wolf(GW),and dipper throated optimization(DTO)algorithms and is referred to as *** proposed algorithm has a better balance between the exploration and exploitation steps of the optimization process and thus could achieve better *** the employed IoT-IDS dataset,the performance of the proposed GWDTO algorithm was assessed using a set of evaluation metrics and compared to other optimization approaches in 2678 CMC,2023,vol.74,no.2 the literature to validate its *** addition,a statistical analysis is performed to assess the stability and effectiveness of the proposed *** results confirmed the superiority of the proposed approach in boosting the classification accuracy of the intrusion in IoT-based networks.

关键词： Feature selection grey wolf optimization dipper throated optimization intrusion detection internet-of-things(IoT)

来源：评论

学校读者我要写书评

暂无评论

Commonsense Knowledge Construction with Concept and Pretrained Model 19th

Commonsense Knowledge Construction with Concept and Pretrain...

引用

19th International Conference on Web Information systems and Applications, WISA 2022

作者： Cai, Hanjun Zhao, Feng 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 Wuhan China

ISBN: (纸本)9783031203084

Commonsense knowledge (CSK) is the information that people use in daily life but do not often mention. It summarizes the practical knowledge about how the world works. Existing machines have knowledge but lack commonsense because they do not understand and master commonsense knowledge in the same way that humans do. In the latest works, crowdsourcing-based method is costly and has low coverage, knowledge base completion method can highly fit samples, and methods extracted from unstructured data have the defects of low quality. CG &BF is commonsense knowledge construction with a concept-based generator and a BERT-based filter. We utilize semantic search for node matching and entropy encoder for filtering triples with high abstraction. Two algorithms based on concept aggregation and path credibility are proposed to obtain high-quality CSK triples. We subsequently finetuning a BERT to filter incorrect triples. We obtain 500,000 CSK triples based on ConceptNet, which is superior to other construction methods in novelty and quality. In the reading comprehension task, the three-way attention network is selected as the basic model and the knowledge we generate enables the base model to perform better, which proves that the output of CG &BF has higher quality and ease of use. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Penalized Semidefinite Programming Method for Elliptic Localization 5

Penalized Semidefinite Programming Method for Elliptic Local...

引用

5th International Conference on Information Communication and Signal Processing, ICICSP 2022

作者： Lin, Danyan Wang, Gang Wang, Ding Ningbo University Faculty of Electrical Engineering and Computer Science Ningbo China Institute of Information System Engineering Pla Strategic Support Force Information Engineering University Zhengzhou China

ISBN: (纸本)9781665485890

Elliptic localization has become a hot research topic and has been widely used in various fields. In this paper, we propose a penalized semidefinite programming (SDP) method for the elliptic localization problem when both the transmitter position and signal propagation speed are unknown. We first formulate a nonconvex constrained weighted least squares (CWLS) problem using the connections between the unknown variables in the measurement model. Since the nonconvex CWLS problem is difficult to solve, we relax it into a convex SDP problem by applying semidefinite relaxation (SDR). Although the SDP problem avoids local convergence or divergence, its solution cannot reach the Cramer-Rao lower bound (CRLB) accuracy owing to the relaxation. In order to address this issue, we propose to add a penalty term to tighten the above SDP problem. Furthermore, we propose an adaptive selection procedure for choosing a proper penalty factor. Simulation results validate the effectiveness and efficiency of the penalized SDP method and show that the proposed method is able to reach the CRLB. © 2022 IEEE.

关键词： Time delay

来源：评论

学校读者我要写书评

暂无评论

Semantic Reasoning Technology on Temporal Knowledge Graph 19th

Semantic Reasoning Technology on Temporal Knowledge Graph

引用

19th International Conference on Web Information systems and Applications, WISA 2022

作者： Li, Jianuo Zhao, Feng 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 Wuhan China

ISBN: (纸本)9783031203084

Semantic reasoning techniques based on knowledge graphs have been widely studied since they were proposed. Previous studies are mostly based on closed-world assumptions, which cannot reason about unknown facts. To this end, we propose the Two-Stage Temporal Reasoning Model (TSTR) for reasoning about future facts. In the first stage, probability of future facts occurring is reasoned using repeated information in history. In the second stage, the semantics of the neighborhood nodes are aggregated using the structural encoder and the temporal information is captured using the temporal encoder. The predicted probabilities are obtained by the decoder. Finally, the candidate entity probabilities of the two-stage reasoning are weighted to achieve the prediction of the two-stage fusion. We tested the performance of the TSTR on public datasets and the results demonstrated the effectiveness of the TSTR. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Fusion of Natural Language and Knowledge Graph for Multi-hop Reasoning 19th

Fusion of Natural Language and Knowledge Graph for Multi-hop...

引用

19th International Conference on Web Information systems and Applications, WISA 2022

作者： Lu, Xun Zhao, Feng 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 Wuhan China

ISBN: (纸本)9783031203084

Multi-hop reasoning has been widely studied for its important application values in the domain of intelligent search and question answering. Real-world applications are often dominated by natural language input, and it is difficult to directly model the relation semantics in natural language to fit the multi-hop reasoning model. In addition, the extremely large scale and complex structure of knowledge graphs increase the challenge. We propose a natural language and knowledge graph fusion model (NLKGF) for multi-hop reasoning. NLKGF embeds knowledge graph by fusing natural language semantics during the graph propagation process and adds a relation attention mechanism to enable entity representations to perceive the contribution of different relations. A relation path encoder is designed to encode the relation path by an improved recurrent neural network, the reasoning entity is obtained by calculating the correlation score with the natural language. We tested the performance of the NLKGF model on two datasets requiring multi-hop reasoning. The experimental results show that NLKGF beats advanced benchmark models in multi-hop reasoning tasks, which proves superiority of our model. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

xGCN: An Extreme Graph Convolutional Network for Large-scale Social Link Prediction 23

xGCN: An Extreme Graph Convolutional Network for Large-scale...

引用

2023 World Wide Web Conference, WWW 2023

作者： Song, Xiran Lian, Jianxun Huang, Hong Luo, Zihan Zhou, Wei Lin, Xue Wu, Mingqi Li, Chaozhuo Xie, Xing Jin, Hai Huazhong University of Science and Technology Wuhan China Microsoft Research Asia Beijing China Microsoft Gaming Redmond United States 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 China

ISBN: (纸本)9781450394161

Graph neural networks (GNNs) have seen widespread usage across multiple real-world applications, yet in transductive learning, they still face challenges in accuracy, efficiency, and scalability, due to the extensive number of trainable parameters in the embedding table and the paradigm of stacking neighborhood aggregations. This paper presents a novel model called xGCN for large-scale network embedding, which is a practical solution for link predictions. xGCN addresses these issues by encoding graph-structure data in an extreme convolutional manner, and has the potential to push the performance of network embedding-based link predictions to a new record. Specifically, instead of assigning each node with a directly learnable embedding vector, xGCN regards node embeddings as static features. It uses a propagation operation to smooth node embeddings and relies on a Refinement neural Network (RefNet) to transform the coarse embeddings derived from the unsupervised propagation into new ones that optimize a training objective. The output of RefNet, which are well-refined embeddings, will replace the original node embeddings. This process is repeated iteratively until the model converges to a satisfying status. Experiments on three social network datasets with link prediction tasks show that xGCN not only achieves the best accuracy compared with a series of competitive baselines but also is highly efficient and scalable. © 2023 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

An adaptive representation model for geoscience knowledge graphs considering complex spatiotemporal features and relationships

引用

science China Earth sciences 2023年第11期66卷 2563-2578页

作者： Yunqiang ZHU Kai SUN Shu WANG Chenghu ZHOU Feng LU Hairong LV Qinjun QIU Xinbing WANG Yanmin QI State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources ResearchChinese Academy of SciencesBeijing 100101China Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application Nanjing 210023China Department of Automation Tsinghua UniversityBeijing 100084China School of Computer Science China University of GeosciencesWuhan 430074China Department of Electronic Engineering Shanghai Jiao Tong UniversityShanghai 200240China School of Computer Science University of Nottingham Ningbo ChinaNingbo 315100China

Geoscience knowledge graph(GKG)can organize various geoscience knowledge into a machine understandable and computable semantic network and is an effective way to organize geoscience knowledge and provide knowledge-related *** a result,it has gained significant attention and become a frontier in *** knowledge is derived from many disciplines and has complex spatiotemporal features and relationships of multiple scales,granularities,and ***,establishing a GKG representation model conforming to the characteristics of geoscience knowledge is the basis and premise for the construction and application of ***,existing knowledge graph representation models leverage fixed tuples that are limited in fully representing complex spatiotemporal features and *** address this issue,this paper first systematically analyzes the categorization and spatiotemporal features and relationships of geoscience *** this basis,an adaptive representation model for GKG is proposed by considering the complex spatiotemporal features and *** the constraint of a unified spatiotemporal ontology,this model adopts different tuples to adaptively represent different types of geoscience knowledge according to their spatiotemporal *** model can efficiently represent geoscience knowledge,thereby avoiding the isolation of the spatiotemporal feature representation and improving the accuracy and efficiency of geoscience knowledge *** can further enable the alignment,transformation,computation,and reasoning of spatiotemporal information through a spatiotemporal ontology.

关键词： Geoscience Knowledge graph Representation model Spatiotemporal features Spatiotemporal relationships

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：