Utilitas Algorithmica (UA)

ISSN: xxxx-xxxx (print)

Utilitas Algorithmica (UA) is a premier, open-access international journal dedicated to advancing algorithmic research and its applications. Launched to drive innovation in computer science, UA publishes high-impact theoretical and experimental papers addressing real-world computational challenges. The journal underscores the vital role of efficient algorithm design in navigating the growing complexity of modern applications. Spanning domains such as parallel computing, computational geometry, artificial intelligence, and data structures, UA is a leading venue for groundbreaking algorithmic studies.

Mustapha Chellali1, Stephen T. Hedetniemi2, Nacéra Meddah1
1LAMDA-RO Laboratory, Department of Mathematics, University of Blida B.P. 270, Blida, Algeria
2School of Computing Clemson University Clemson, SC 29634 USA
Abstract:

In this note, we establish six Gallai theorems involving twelve minority and majority parameters. Accordingly, the complexity problems corresponding to some of these parameters are obtained.

Yixian Wen1
1School of Business, Hunan Institute of Technology, Hengyang 412002, China
Abstract:

The promotion of industrial digital transformation is a crucial breakthrough in the evolution of economic structures and the physical layout of spaces. It has the potential to elevate the entire industrial chain to a high-end value chain, creating more profit opportunities and enhancing the influence of domestic industries in the international cycle. This study uses the cities in the Yangtze River Delta Economic Belt as a case study to explore the spatial effects of digital transformation on the healthy transformation of traditional industrial structures. It constructs relevant spatial coupling models and empirically verifies them by testing specific assumptions. The experimental results indicate that the model is significant at a level greater than 5%, making it suitable for selecting spatial measurement models. The mean square error of its network simulation output is 0.1333, confirming the expected hypothesis and demonstrating that digital transformation has a significant spatial driving effect on industrial upgrading.

Allan Bickle1
1Department of Mathematics, Purdue University 610 Purdue Mall, West Lafayette, IN 47907 USA
Abstract:

A \(k\)-tree is a graph that can be formed by starting with \(K_{k+1}\) and iterating the operation of making a new vertex adjacent to all the vertices of a \(k\)-clique of the existing graph. A structural characterization of 3-trees with diameter at most 2 is proven. This implies a corollary for planar 3-trees which leads to a description of their degree sequences.

Huikang Wen1, Xiaobin Li1, Xun Yue1, Jianhua Li1
1Jiangmen Kaiping Power Supply Bureau, Guangdong Power Grid Co., Ltd., Jiangmen 529300, China
Abstract:

Electric shock accidents remain a major safety concern for distribution workers. Recent advancements in video AI applications allow for detecting when workers cross safety lines, but determining their height and the spatial distance between them and live equipment is still a challenge. This article proposes a pre-control system using LiDAR, an edge processing module, and a warning module to ensure safe operations in power distribution scenarios. The system scans the area in real time, uses deep learning to identify objects like distribution stations, human bodies, high-voltage equipment, and transmission lines in point clouds, and calculates the distance between operators and high-voltage equipment. When this distance approaches or exceeds safety limits, the warning module issues voice alerts. Experimental results show that this system significantly reduces false alarms compared to video-based methods, accurately measures distances, and provides timely warnings, making it a practical solution for enhancing worker safety in power distribution operations.

Vito Napolitano1
1Dipartimento di Matematica e Fisica, Università degli Studi della Campania Luigi Vanvitelli, Viale Lincoln 5, 81100 Caserta
Abstract:

In this paper, we present a new combinatorial characterization of Hermitian cones in \(\mathrm{PG}(3,q^2)\).

Chaadhanaa A1, Hemalatha P1
1Department of Mathematics, Vellalar College For Women, Tamil Nadu, India
Abstract:

Let \(K_n\), \(P_n\), and \(Y_n\) respectively denote a complete graph, a path, and a \(Y\)-tree on \(n\) vertices, and let \(K_{m,n}\) denote a complete bipartite graph with \(m\) and \(n\) vertices in its parts. Graph decomposition is the process of breaking down a graph into a collection of edge-disjoint subgraphs. A graph \(G\) has a \((H_1, H_2)\)-multi-decomposition if it can be decomposed into \(\alpha \geq 0\) copies of \(H_1\) and \(\beta \geq 0\) copies of \(H_2\), where \(H_1\) and \(H_2\) are subgraphs of \(G\). In this paper, we derive the necessary and sufficient conditions for the \((P_5, Y_5)\)-multi-decomposition of \(K_n\) and \(K_{m,n}\).

Linlin Cui1, Feng Li1
1Computer College, Qinghai Normal University, Xi’ning, 810000, Qinghai, China
Abstract:

With the rapid development of wireless communication networks, it brings more and more convenience to users. However, with the expansion of network size, the limitation of channel resources in network communication is becoming more obvious. Effective channel assignment has a great impact on the quality of communication networks. However, in real communication networks, underutilization of channels and excessive number of channels produce large interference, so it is necessary to find a reasonable channel assignment method. In this paper, we study the optimal channel assignment strategy for the Cartesian product of an \(m\)-vertex complete bipartite graph and an \(m\)-order cycle, where \(m\geq 5\) is odd. Determines the exact value and lower bound of its radio number.

Abaid ur Rehman Virk1, Iftikhar Ahmed2, Murat Cancan3
1Department of Mathematics, University of Management and Technology, Lahore, Pakistan
2University of Agriculture, Faisalabad, Burewala Campus, Pakistan
3Faculty of Education,Yuzuncu Yil University, Van, Turkey
Abstract:

This study introduces a novel approach to investigating Sombor indices and applying machine learning methods to assess the similarity of non-steroidal anti-inflammatory drugs (NSAIDs). The research aims to predict the structural similarities of nine commonly prescribed NSAIDs using a machine learning technique, specifically a linear regression model. Initially, Sombor indices are calculated for nine different NSAID drugs, providing numerical representations of their molecular structures. These indices are then used as features in a linear regression model trained to predict the similarity values of drug combinations. The model’s prediction performance is evaluated by comparing the predicted similarity values with the actual similarity values. Python programming is employed to verify accuracy and conduct error analysis.

Liupeng Zhao1
1TC Beirne School of Law, The University of Queensland, Brisbane, Queensland, 4072, Australia
Abstract:

Criminal evidence serves as the foundation for criminal proceedings, with evidence used to ascertain the facts of cases being critical to achieving fairness and justice. This study explores the application of digital information technology in building a data resource base for criminal cases, formulating standard evidence guideline rules, and optimizing evidence verification procedures. A named entity recognition model based on the SVM-BiLSTM-CRF framework is proposed, coupled with an evidence relationship extraction model using the Transformer framework to improve evidence information extraction through sequential features and global feature capturing. Results show that the F1 value for entity recognition in criminal cases reaches 94.19%, and the evidence extraction model achieves an F1 value of 81.83% on the CAIL-A dataset. These results are utilized to construct evidence guidelines, helping case handlers increase case resolution rates to approximately 99%. The application of digital technology enhances evidence collection efficiency, accelerates case closures, and offers a pathway to improving judicial credibility.

Ilker Akkus1, Gonca Kizilaslan1
1Kirikkale University, Department of Mathematics, Faculty of Science and Arts, 71450 Kirikkale, Turkey
Abstract:

In this paper we consider some new weighted and alternating weighted generalized Fibonomial sums and the corresponding \(q-\)forms. A generalized form of weight sequences which contains squares in subscripts is discussed for the first time in the literature. The main key to get success in sums is an ability to change one sum into another that is simpler in some way. Thus, in order to prove these sums by doing some manipulations and tricks, our approach is to use classical \(q-\)analysis, in particular a formula of Rothe, a version of Cauchy binomial theorem and Gauss identity.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;