Journal of Combinatorial Optimization最新文献_第3页

Improved kernelization and fixed-parameter algorithms for bicluster editing 用于双簇编辑的改进型核化和固定参数算法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-07-03 DOI: 10.1007/s10878-024-01186-y

Manuel Lafond

引用次数: 0

On ABC spectral radius of uniform hypergraphs 论均匀超图的 ABC 谱半径

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-28 DOI: 10.1007/s10878-024-01182-2

Hongying Lin, Bo Zhou

引用次数: 0

A neural network accelerated optimization method for FPGA 用于 FPGA 的神经网络加速优化方法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-25 DOI: 10.1007/s10878-024-01117-x

Zhengwei Hu, Sijie Zhu, Leilei Wang, Wangbin Cao, Zhiyuan Xie

{"title":"A neural network accelerated optimization method for FPGA","authors":"Zhengwei Hu, Sijie Zhu, Leilei Wang, Wangbin Cao, Zhiyuan Xie","doi":"10.1007/s10878-024-01117-x","DOIUrl":"https://doi.org/10.1007/s10878-024-01117-x","url":null,"abstract":"A neural network accelerated optimization method for FPGA hardware platform is proposed. The method realizes the optimized deployment of neural network algorithms for FPGA hardware platforms from three aspects: computational speed, flexible transplantation, and development methods. Replacing multiplication based on Mitchell algorithm not only breaks through the speed bottleneck of neural network hardware acceleration caused by long multiplication period, but also makes the parallel acceleration of neural network algorithm get rid of the dependence on the number of hardware multipliers in FPGA, which can give full play to the advantages of FPGA parallel acceleration and maximize the computing speed. Based on the configurable strategy of neural network parameters, the number of network layers and nodes within layers can be adjusted according to different logical resource of FPGA, improving the flexibility of neural network transplantation. The adoption of HLS development method overcomes the shortcomings of RTL method in designing complex neural network algorithms, such as high difficulty in development and long development cycle. Using the Cyclone V SE 5CSEBA6U23I7 FPGA as the target device, a parameter configurable BP neural network was designed based on the proposed method. The usage of logical resources such as ALUT, Flip-Flop, RAM, and DSP were 39.6%, 40%, 56.9%, and 18.3% of the pre-optimized ones, respectively. The feasibility of the proposed method was verified using MNIST digital recognition and facial recognition as application scenarios. Compare to pre-optimization, the test time of MNIST number recognition is reduced to 67.58%, and the success rate was lost 0.195%. The test time for facial recognition applications was reduced to 69.571%, and the success rate of combining LDA algorithm was lost within 4%.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141448358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New efficient algorithms for the two-machine no-wait chain-reentrant shop problem 双机无等待链式逆向商店问题的新型高效算法

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-16 DOI: 10.1007/s10878-024-01180-4

Nazim Sami, Karim Amrouche, Mourad Boudhar

引用次数: 0

On the SVP for low-dimensional circulant lattices 关于低维环状网格的 SVP

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-01 DOI: 10.1007/s10878-024-01183-1

Gengran Hu, Yanbin Pan, Renzhang Liu

引用次数: 0

Phylogenetic network-assisted rooting of unrooted gene trees 系统发生网络辅助无根基因树生根

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-06-01 DOI: 10.1007/s10878-024-01181-3

Jerzy Tiuryn, Natalia Rutecka, Paweł Górecki

{"title":"Phylogenetic network-assisted rooting of unrooted gene trees","authors":"Jerzy Tiuryn, Natalia Rutecka, Paweł Górecki","doi":"10.1007/s10878-024-01181-3","DOIUrl":"https://doi.org/10.1007/s10878-024-01181-3","url":null,"abstract":"Gene trees inferred from molecular sequence alignments are typically unrooted, and determining the most credible rooting edge is a classical problem in computational biology. One approach to solve this problem is unrooted reconciliation, where the rooting edge is postulated based on the split of the root from a given species tree. In this paper, we propose a novel variant of the gene tree rooting problem, where the gene tree root is inferred using a phylogenetic network of the species present in the gene tree. To obtain the best rooting, unrooted reconciliation can be applied, where the unrooted gene tree is jointly reconciled with a set of splits inferred from the network. However, the exponential size of the set induced by display trees of the network makes this approach computationally prohibitive. To address this, we propose a broader and easier-to-control set of splits based on the structural properties of the network. We then derive exact mathematical formulas for the rooting problem and propose two general rooting algorithms to handle cases where the input network does not meet the initial requirements. Our experimental study based on simulated gene trees and networks demonstrates that our algorithms infer gene tree rootings correctly or with a small error in most cases.\u0000","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141187669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Diabetic prediction and classification of risk level using ODDTADC method in big data analytics 在大数据分析中使用 ODDTADC 方法预测和划分糖尿病风险等级

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-05-21 DOI: 10.1007/s10878-024-01179-x

G. Geo Jenefer, A. J. Deepa, M. Mary Linda

{"title":"Diabetic prediction and classification of risk level using ODDTADC method in big data analytics","authors":"G. Geo Jenefer, A. J. Deepa, M. Mary Linda","doi":"10.1007/s10878-024-01179-x","DOIUrl":"https://doi.org/10.1007/s10878-024-01179-x","url":null,"abstract":"Diabetes is regarded as one of the deadliest chronic illnesses that increases blood sugar. But there is no reliable method for predicting diabetic severity that shows how the disease will affect various body organs in the future. Therefore, this paper introduced Optimized Dual Directional Temporal convolution and Attention based Density Clustering (ODDTADC) method for predicting and classifying risk level in diabetic patients. In the diabetic prediction stage, the prediction is done by using an Integrated Dual Directional Temporal Convolution and an Enriched Remora Optimization Algorithm. Here, dual directional temporal convolution is used to extract temporal features by integrating dilated convolution and casual convolution in the feature extraction layer. Then, the attention module is used instead of max-pooling to emphasize the various features' importance in the feature aggregation layer. The Enriched Remora Optimization Algorithm is used to find optimal hyper parameters for Integrated Dual Directional Temporal Convolution. In the classification of stages based on risk level, the values from stage-I are fed into the Attention based Density Spatial Clustering of Applications with Noise, which allocate various weights based on their density values in the Core Points. Based on the results, the Nested Long Short-Term Memory is utilized to classify the risk levels of diabetic patients over a period of two or three years. Experimental evaluations were performed on five datasets, including PIMA Indian Diabetics Database, UCI Machine Learning Repository Diabetics Dataset, Heart Diseases Dataset, Chronic Disease Dataset and Diabetic Retinopathy Debrecen Dataset. The proposed ODDTADC method demonstrates superior performance compared to existing methods, achieving remarkable results in accuracy (98.21%), recall (94.46%), kappa coefficient (98.95%), precision (98.74%), F1-score (99.01%) and Matthew’s correlation coefficient (MCC) (0.87%).","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141079275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The frustum network model based on clique extension 基于簇扩展的簇网络模型

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-05-20 DOI: 10.1007/s10878-024-01178-y

Anthony Bonato, Ryan Cushman, Trent G. Marbach, Zhiyuan Zhang

引用次数: 0

On the oriented diameter of planar triangulations 论平面三角形的定向直径

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-05-20 DOI: 10.1007/s10878-024-01177-z

Debajyoti Mondal, N. Parthiban, Indra Rajasingh

{"title":"On the oriented diameter of planar triangulations","authors":"Debajyoti Mondal, N. Parthiban, Indra Rajasingh","doi":"10.1007/s10878-024-01177-z","DOIUrl":"https://doi.org/10.1007/s10878-024-01177-z","url":null,"abstract":"The diameter of an undirected or a directed graph is defined to be the maximum shortest path distance over all pairs of vertices in the graph. Given an undirected graph G, we examine the problem of assigning directions to each edge of G such that the diameter of the resulting oriented graph is minimized. The minimum diameter over all strongly connected orientations is called the oriented diameter of G. The problem of determining the oriented diameter of a graph is known to be NP-hard, but the time-complexity question is open for planar graphs. In this paper we compute the exact value of the oriented diameter for triangular grid graphs. We then prove an n/3 lower bound and an (n/2+Oleft( sqrt{n}right) ) upper bound on the oriented diameter of planar triangulations, where n is the number of vertices in G. It is known that given a planar graph G with bounded treewidth and a fixed positive integer k, one can determine in linear time whether the oriented diameter of G is at most k. We consider a weighted version of the oriented diameter problem and show it to be weakly NP-complete for planar graphs with bounded pathwidth.","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141074036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Scheduling of elective operations with coordinated utilization of hospital beds and operating rooms 通过协调利用医院病床和手术室，安排择期手术

IF 1 4区数学

Journal of Combinatorial Optimization Pub Date : 2024-05-18 DOI: 10.1007/s10878-024-01167-1

Zhaohui Li, Haiyue Yu, Zhaowei Zhou

引用次数: 0