Uncategorized

Rice Classification Using Three-Step Neural Network Integration

Rice Classification Using Three-Step Neural Network Integration Meesri, Sarawut., Amornsamankul, Somkid., Kraipeerapun, Pawalai This paper proposes a three-step neural network integration. In the first step, two neural networks are trained to produce a truth output and a falsity output. The second step uses cascade generalization to improve the results of the first step. A sequence …

Rice Classification Using Three-Step Neural Network Integration Read More »

Health Data Classification using Applied Cascade Generalization

Health Data Classification using Applied Cascade Generalization Chatree Nilnumpetch, Somkid Amornsamankul, Pawalai Kraipeerapun This research study introduces two steps to improve the binary classification technique without using threshold value. The first step is to use complementary neural networks to produce the truth data and falsity data. The truth and falsity data are used for decision …

Health Data Classification using Applied Cascade Generalization Read More »

Refining a chain theorem from matroids to internally 4-connected graphs

Refining a chain theorem from matroids to internally 4-connected graphs Chanun Lewchalermvongs, Guoli Ding Graph theory and matroid theory are interconnected with matroids providing a way to generalize and analyze the structural and independence properties within graphs. Chain theorems, vital tools in both matroid and graph theory, enable the analysis of matroid structures associated with …

Refining a chain theorem from matroids to internally 4-connected graphs Read More »

Enhancing Signed Graph Attention Network by Graph Characteristics: An Analysis

Enhancing Signed Graph Attention Network by Graph Characteristics: An Analysis Panatda Kaewhit, Chanun Lewchalermvongs, Phakaporn Lewchalermvongs – A graph neural network (GNN) is one of successful methods for handling tasks on a graph data structure, e.g. node embedding, link prediction and node classification. GNNs focus on a graph data structure that must aggregate messages on …

Enhancing Signed Graph Attention Network by Graph Characteristics: An Analysis Read More »

A game-theoretic approach for route planning on traveling by public transportation in the PM2.5 pollution: A case study in Bangkok

A game-theoretic approach for route planning on traveling by public transportation in the PM2.5 pollution: A case study in Bangkok Chanun Lewchalermvongs, Phakaporn Lewchalermvongs, Chettaporn Chuesuphan, Chutchawon Weeranukunjit, Chanon Boonkangwan, Montika Chaikittiporn, Patid Srikirinth, Tanaphoom Glinpatgij Extremely high levels of PM2.5 (particulate matter with a diameter of 2.5 micrometers or less) in Bangkok’s major areas …

A game-theoretic approach for route planning on traveling by public transportation in the PM2.5 pollution: A case study in Bangkok Read More »

Maximizing vertex rescue: investigating the firefighter problem with edge subdivision

Maximizing vertex rescue: investigating the firefighter problem with edge subdivision Chutchawon Weeranukunjit, Chanun Lewchalermvongs The firefighter problem is a game played on a connected graph where a fire breaks out at a vertex. In each round, a firefighter chooses a vertex to protect, and the fire then spreads to all unprotected neighbors of the burning vertex. …

Maximizing vertex rescue: investigating the firefighter problem with edge subdivision Read More »

A note on an analogue of Hadamard’s theorem for determining the radii of m-meromorphy

A note on an analogue of Hadamard’s theorem for determining the radii of m-meromorphy Nattapong Bosuwan In this paper, we prove an extension of Hadamard’s classical theorem for determining the radius of mmeromorphyof an analytic function in terms of its Taylor coefficients. Our extension is expressed in terms of Fouriercoefficients with respect to an orthonormal …

A note on an analogue of Hadamard’s theorem for determining the radii of m-meromorphy Read More »

Determining the first radii of meromorphy via orthogonal polynomials on the unit circle

Determining the first radii of meromorphy via orthogonal polynomials on the unit circle Nattapong Bosuwan Applying a result concerning a convergence of modified orthogonal Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard’s theorem for determining the radius of 1-meromorphy of a function holomorphic on the closed unit …

Determining the first radii of meromorphy via orthogonal polynomials on the unit circle Read More »

On exact rate of convergence of row sequences of multipoint Hermite-Padé approximants

On exact rate of convergence of row sequences of multipoint Hermite-Padé approximants Nattapong Bosuwan In this article, we analyze a rate of attraction of poles of an approximated function to poles of incomplete multipoint Padé approximants and use it to derive a sharp bound on the geometric rate of convergence of multipoint Hermite-Padé approximants to …

On exact rate of convergence of row sequences of multipoint Hermite-Padé approximants Read More »

An approximate analytical solution of the time-fractional Navier–Stokesequations by the generalized Laplace residual power series method

An approximate analytical solution of the time-fractional Navier–Stokes equations by the generalized Laplace residual power series method Patcharee Dunnimit, Wannika. Sawangtong, Panumart Sawangtong The paper introduces a novel approach for solving the time-fractional Navier-Stokes (NS) equation utilizing the Katugampola fractional derivative expressed in the Caputo type and a method termed the Generalized Laplace Residual Power …

An approximate analytical solution of the time-fractional Navier–Stokesequations by the generalized Laplace residual power series method Read More »