| 1 |
Web Application for Automatic Code Generator using Structured Flowchart |
|
|
ชาญชัย ศุภอรรถกร |
Q3 |
นานาชาติ |
|
| 2 |
Vector field reconstruction via quaternionic setting |
|
|
พัชรี วงษาสนธิ์ |
Q3 |
นานาชาติ |
|
| 3 |
0 |
|
|
ปิยะนันท์ พนากานต์ |
Q2 |
นานาชาติ |
|
| 4 |
3D cone beam reconstruction formula by using cylindrical coordinates |
|
|
สุพจน์ สีบุตร |
Q3 |
นานาชาติ |
|
| 5 |
Trip Basket: Web Characterization for Smart Tourism |
|
|
วาสนา เหง้าเกษ |
Q3 |
นานาชาติ |
|
| 6 |
Development of the Edible and Poisonous
Mushrooms Classification Model by using the
Feature Selection and the Decision Tree
Techniques |
Development of the Edible and Poisonous
Mushrooms Classification Model by using the
Feature Selection and the Decision Tree
Techniques |
This research aims to develop a classification model for edible and poisonous mushrooms by applying the feature selection approach together with the decision tree technique. Two feature selection methods were applied, including 1) Chi-square and 2) Information Gain, while the effectiveness of the model was compared by three decision tree methods such as Iterative Dichotomiser3, C4.5 and Random Forest. The data used for classifying the edible and poisonous mushrooms derived from the Encyclopedia of Thai mushrooms and the book entitled “Diversity of Mushrooms and Macrofungi in Thailand”. The results of the model’s effectiveness evaluation revealed that the model using the Information Gain technique alongside with the Random Forest technique provided the most accurate classification outcomes at 94.19%; therefore, this model could be further applied in the future studies. |
วงกต ศรีอุไร |
Q4 |
นานาชาติ |
|
| 7 |
Convergence Theorems of the Modified SP-Iteration for $G$-Asymptotically Nonexpansive Mappings with Directed Grahps |
Convergence Theorems of the Modified SP-Iteration for $G$-Asymptotically Nonexpansive Mappings with Directed Grahps |
In this paper, weak and strong convergence theorems of the modified SP-iteration are established for three G-asymptotically nonexpansive mappings in Banach spaces. We give some numerical example for supporting our main theorem and compare convergence rate between the modified SP-iteration and the modified Noor iteration. |
รตนกร วัฒนทวีกุล |
Q4 |
นานาชาติ |
|
| 8 |
Matrix operators on function-valued function spaces |
Matrix operators on function-valued function spaces |
We study spaces of continuous-function-valued functions that have the property that composition with evaluation functionals induce weak∗ to norm continuous maps to lp space (p∈(1,∞)). Versions of H\"older's inequality and Riesz representation theorem are proved to hold on these spaces. We prove a version of Dixmier's theorem for spaces of function-valued matrix operators on these spaces, and an analogue of the trace formula for operators on Hilbert spaces. When the function space is taken to be the complex field, the spaces are just the lp spaces and the well-known classical theorems follow from our results. |
ฐิตารีย์ วุฒิจิรัฐิติกาล |
Q2 |
นานาชาติ |
|
| 9 |
การพัฒนาระบบการค้าส่งและบริหารลูกหนี้ กรณีศึกษาการประเมินความเสี่ยงในการชําระหนี้ |
|
|
ชุมพร หลินหะตระกูล |
Q1 |
นานาชาติ |
|
| 10 |
Numerical simulation of heat transfer over a torus rotating about its centerline |
Numerical simulation of heat transfer over a torus rotating about its centerline |
The heat transfer characteristics of axisymmetric flow past a rotating torus in viscous incompressible fluid have been investigated numerically. The torus surface rotates about its centerline with constant velocity. The governing equations in a toroidal coordinate system are solved by using a finite difference method for ranges of parameters: Reynolds number 20 40 Re ; Prandtl number 0 7 100 . Pr ; rotational speed 0 1 9 . ; and fixed aspect ratio Ar 2. The heat transfer characteristics are presented in terms of the isotherm patterns, local Nusselt numbers, and average Nusselt numbers. Variation of the local Nusselt number on the torus surface shows the effect of the Prandtl number and rotational speed on heat transfer from a torus in the flow regime. Torus rotation is an efficient Nusselt number reduction or torus surface temperature enhancement technique. |
ไพรินทร์ สุวรรณศรี |
Q4 |
นานาชาติ |
|
| 11 |
GoF Design Patterns in a Smart City System |
|
|
วาสนา เหง้าเกษ |
Q2 |
นานาชาติ |
ชื่อวารสาร
-
Journal of Computers
|
| 12 |
The Application of the Multi-Layer Perceptron Neural Network Technique for Developing the Career-Suggestion Simulation Model for Undergraduate Students |
The Application of the Multi-Layer Perceptron Neural Network Technique for Developing the Career-Suggestion Simulation Model for Undergraduate Students |
The goal of the study is to develop the career-suggestion simulation model for newly graduated students with a bachelor’s degree in information technology by using the Multi-Layer Perceptron Neural Network technique. Due to the lack of data collected for developing the model from a limited data sets, the researcher decided to apply the Resample technique to solve the problem of the data set with imbalanced prediction outputs by adjusting the imbalance of the data set starting from 100% to 500%. Subsequently, the Multi-Layer Perceptron Neural Network technique was applied for developing the career-suggestion simulation model. There were two approaches used for testing the effectiveness of the simulation model, including the 5-fold cross validation and 10-fold cross validation techniques. The results of the simulation model’s effectiveness test using the 10-fold cross validation technique with the adjusted resample of 500% and the Multi-Layer Perceptron Neural Network technique provide the accuracy of 93.62% which is higher than the career-suggestion simulation model which applies the MultiLayer Perceptron Neural Network technique alone. The research findings reveal that the simulation model can be used as the prototype of the career-suggestion simulation model for newly graduated students with a bachelor’s degree in information technology. |
วงกต ศรีอุไร |
Q4 |
นานาชาติ |
|
| 13 |
Second-hand Cars Recommender System Model
using the SMOTE and the Random Forest
Technique |
Second-hand Cars Recommender System Model
using the SMOTE and the Random Forest
Technique |
This article is object to develop a model for a second-hand cars recommender system towards the use of the SMOTE approach together with the Random Forest technique. The research team has modified the imbalance of the data by employing the SMOTE method to increase the amount of data to 400% and applying the Random Forest technique to create a decision tree for second-hand car recommendations. After evaluating the model’s effectiveness by using the 10- fold validation method, the findings revealed that the second-hand recommender system model applying the SMOTE approach and the Random Forest technique provided an accuracy of 98.84%, a precision of 98.89%, a recall of 98.80% and an F1 score of 98.80%; the overall scores of the model’s effectiveness were higher than of the model using only the Random Forest technique. This indicates that the model can be practically used for recommending second-hand cars. |
วงกต ศรีอุไร |
ยังไม่มีระดับ Quartile Scor |
นานาชาติ |
|
| 14 |
A Fast Fixed-Point Algorithm for Convex Minimization Problems and Its Application in Image Restoration Problems |
A Fast Fixed-Point Algorithm for Convex Minimization Problems and Its Application in Image Restoration Problems |
In this paper, we introduce a new iterative method using an inertial technique for approximating a common fixed point of an infinite family of nonexpansive mappings in a Hilbert space. The proposed method’s weak convergence theorem was established under some suitable conditions. Furthermore, we applied our main results to solve convex minimization problems and image restoration problems. |
รตนกร วัฒนทวีกุล |
Q1 |
นานาชาติ |
|
| 15 |
An Accelerated Fixed-Point Algorithm with an Inertial Technique for a Countable Family of G-Nonexpansive Mappings Applied to Image Recovery |
An Accelerated Fixed-Point Algorithm with an Inertial Technique for a Countable Family of G-Nonexpansive Mappings Applied to Image Recovery |
Many authors have proposed fixed-point algorithms for obtaining a fixed point of G-nonexpansive mappings without using inertial techniques. To improve convergence behavior, some accelerated fixed-point methods have been introduced. The main aim of this paper is to use a coordinate affine structure to create an accelerated fixed-point algorithm with an inertial technique for a countable family of G-nonexpansive mappings in a Hilbert space with a symmetric directed graph G and prove the weak convergence theorem of the proposed algorithm. As an application, we apply our proposed algorithm to solve image restoration and convex minimization problems. The numerical experiments show that our algorithm is more efficient than FBA, FISTA, Ishikawa iteration, S-iteration, Noor iteration and SP-iteration. |
รตนกร วัฒนทวีกุล |
Q1 |
นานาชาติ |
|
| 16 |
Python-based simulations of the probabilistic behavior of random events for secondary school students |
Python-based simulations of the probabilistic behavior of random events for secondary school students |
Simulation modeling is an effective tool for solving problems that cannot be explained analytically or when data cannot be collected. This is done by simulating the observed behavior of a problem under study using a computer program. In math education, this can develop knowledge and fundamental competencies of simulation modeling at a higher level and foster its applications in everyday life. This study created learning activities for secondary school students to simulate the probabilistic behavior of random events using Python. 28 grade 12 students took part in these activities using appropriate scaffolding strategies and a powerful mathematical tool, Python. After completing the activities, student competency in simulating the probabilistic behavior of random events with Python was evaluated using rubrics and the factors of student enjoyment, perceived value, interest, and self-efficacy were determined through a Likert-scale questionnaire. The assessment results showed that the activities had a positive effect on student competencies and emotions. The outcomes of the study can serve guidelines for teachers who are interested in expanding the results for further student development. © 2022. by the authors; licensee Modestum. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/). |
สุพจน์ สีบุตร |
Q1 |
นานาชาติ |
|
| 17 |
Swarming Computational Techniques for the Influenza Disease System |
Swarming Computational Techniques for the Influenza Disease System |
The current study relates to designing a swarming computational paradigm to solve the influenza disease system (IDS). The nonlinear system’s mathematical form depends upon four classes: susceptible individuals, infected people, recovered individuals and cross-immune people. The solutions of the IDS are provided by using the artificial neural networks (ANNs) together with the swarming computational paradigm-based particle swarm optimization (PSO) and interior-point scheme (IPA) that are the global and local search approaches. The ANNs-PSO-IPA has never been applied to solve the IDS. Instead a merit function in the sense of mean square error is constructed using the differential form of each class of the IDS and then optimized by the PSOIPA. The correctness and accuracy of the scheme are observed to perform the comparative analysis of the obtained IDS results with the Adams solutions (reference solutions). An absolute error in suitable measures shows the precision of the proposed ANNs procedures and the optimization efficiency of the PSOIPA. Furthermore, the reliability and competence of the proposed computing method are enhanced through the statistical performances. |
ศักดิ์ดา น้อยนาง |
Q1 |
นานาชาติ |
|
| 18 |
Swarming Computational Efficiency to Solve a Novel Third-Order Delay Differential Emden-Fowler System |
Swarming Computational Efficiency to Solve a Novel Third-Order Delay Differential Emden-Fowler System |
The purpose of this research is to construct an integrated neuro swarming scheme using the procedures of the artificial neural networks (ANNs) with the use of global search particle swarm optimization (PSO) along with the competent local search interior-point programming (IPP) called as ANN-PSOIPP. The proposed computational scheme is implemented for the numerical simulations of the third order nonlinear delay differential Emden-Fowler model (TON-DD-EFM). The TON-DD-EFM is based on two types along with the particulars of shape factor, delayed terms, and singular points. A merit function is performed using the optimization of PSOIPP to find the solutions to the TON-DD-EFM. The effectiveness of the ANN-PSOIPP is certified through the comparison with the exact results for solving four examples of the TON-DD-EFM. The scheme’s efficiency is observed by performing the absolute error in suitable measures found around 10−04 to 10−07. Furthermore, the statistical-based assessments for 100 trials are provided to compute the accuracy, stability, and constancy of the ANN-PSOIPP for solving the TON-DD-EFM. |
ศักดิ์ดา น้อยนาง |
Q1 |
นานาชาติ |
|
| 19 |
A Novel Stochastic Framework for the MHD Generator in Ocean |
A Novel Stochastic Framework for the MHD Generator in Ocean |
This work aims to study the nonlinear ordinary differential equations (ODEs) system of magnetohydrodynamic (MHD) past over an inclined plate using Levenberg-Marquardt backpropagation neural networks (LMBNNs). The stochastic procedures LMBNNs are provided with three categories of sample statistics, testing, training, and verification. The nonlinear MHD system past over an inclined plate is divided into three profiles, dimensionless momentum, species (salinity), and energy (heat) conservations. The data is applied 15%, 10%, and 75% for validation, testing, and training to solve the nonlinear system of MHD past over an inclined plate. A reference data set is designed to compare the obtained and proposed solutions for the MHD system. The plots of the absolute error (AE) are provided to check the accuracy and precision of the considered nonlinear system of MHD. The obtained numerical solutions of the nonlinear magnetohydrodynamic system have been considered to reduce the mean square error (MSE). For the capability, dependability, and aptitude of the stochastic LMBNNs procedure, the numerical performances are provided to authenticate the relative arrangements of MSE, error histograms (EHs), state transitions (STs), correlation, and regression. |
ศักดิ์ดา น้อยนาง |
Q1 |
นานาชาติ |
|
| 20 |
An accelerated common fixed point algorithm for a countable family of G-nonexpansive mappings with applications to image recovery |
An accelerated common fixed point algorithm for a countable family of G-nonexpansive mappings with applications to image recovery |
In this paper, we define a new concept of left and right coordinate affine of a directed graph and then employ it to introduce a new accelerated common fixed point algorithm for a countable family of G-nonexpansive mappings in a real Hilbert space with a graph. We prove, under certain conditions, weak convergence theorems for the proposed algorithm. As applications, we also apply our results to solve convex minimization and image restoration problems. Moreover, we show that our algorithm provides better convergence behavior than other methods in the literature. |
รตนกร วัฒนทวีกุล |
Q1 |
นานาชาติ |
|
| 21 |
A New Accelerated Fixed-Point Algorithm for Classification and Convex Minimization Problems in Hilbert Spaces with Directed Graphs |
A New Accelerated Fixed-Point Algorithm for Classification and Convex Minimization Problems in Hilbert Spaces with Directed Graphs |
A new accelerated algorithm for approximating the common fixed points of a countable family of G-nonexpansive mappings is proposed, and the weak convergence theorem based on our main results is established in the setting of Hilbert spaces with a symmetric directed graph G. As an application, we apply our results for solving classification and convex minimization problems. We also apply our proposed algorithm to estimate the weight connecting the hidden layer and output layer in a regularized extreme learning machine. For numerical experiments, the proposed algorithm gives a higher performance of accuracy of the testing set than that of FISTA-S, FISTA, and nAGA. |
รตนกร วัฒนทวีกุล |
Q1 |
นานาชาติ |
|
| 22 |
Representations of modified type 2 degenerate poly-Bernoulli polynomials |
Representations of modified type 2 degenerate poly-Bernoulli polynomials |
Research on the degenerate versions of special polynomials provides a new area, introducing the λ-analogue of special polynomials and numbers, such as λ-Sheffer polynomials. In this paper, we propose a new variant of type 2 Bernoulli polynomials and numbers by modifying a generating function. Then we derive explicit expressions and their representations that provide connections among existing λ-Sheffer polynomials. Also, we provide the explicit representations of the proposed polynomials in terms of the degenerate Lah-Bell polynomials and the higher-order degenerate derangement polynomials to confirm the presented identities. © 2022 the Author(s), licensee AIMS Press. |
พัชรี วงษาสนธิ์ |
Q1 |
นานาชาติ |
ชื่อวารสาร
-
AIMS Mathematics
|
| 23 |
Type 2 degenerate modified poly-Bernoulli polynomials arising from the degenerate poly-exponential functions |
Type 2 degenerate modified poly-Bernoulli polynomials arising from the degenerate poly-exponential functions |
We present a new type of degenerate poly-Bernoulli polynomials and numbers by modifying the polyexponential function in terms of the degenerate exponential functions and degenerate logarithm functions. Also, we introduce a new variation of the degenerate unipoly-Bernoulli polynomials by the similar modification. Based on these polynomials, we investigate some properties, new identities, and their relations to the known special functions and numbers such as the degenerate type 2-Bernoulli polynomials, the type 2 degenerate Euler polynomials, the degenerate Bernoulli polynomials and numbers, the degenerate Stirling numbers of the first kind, and λ-falling factorial sequence. In addition, we compute some of the proposed polynomials and present their zeros and behaviors for different variables in specific cases. |
พัชรี วงษาสนธิ์ |
Q1 |
นานาชาติ |
ชื่อวารสาร
-
AIMS Mathematics
|
