Journal Description
Computer Sciences & Mathematics Forum
Computer Sciences & Mathematics Forum
is an open access journal dedicated to publishing findings resulting from academic conferences, workshops, and similar events in the area of computer science and mathematics. Each conference proceeding can be individually indexed, is citable via a digital object identifier (DOI), and is freely available under an open access license. The conference organizers and proceedings editors are responsible for managing the peer-review process and selecting papers for conference proceedings.
Latest Articles
Preface of the 2023 Summit of the International Society for the Study of Information
Comput. Sci. Math. Forum 2023, 8(1), 2; https://doi.org/10.3390/cmsf2023008002 - 28 Jul 2023
Abstract
The study of information, including the study of intelligence as its most comprehensive member, with its application to the economy and society are at the forefront of the advances in contemporary science and technology in the 21st century [...]
Full article
Open AccessEditorial
Statement of Peer Review
by
and
Comput. Sci. Math. Forum 2023, 8(1), 1; https://doi.org/10.3390/cmsf2023008001 - 28 Jul 2023
Abstract
The International Summit for The Study of Information (ISSI) is a biannual series of international conferences, dedicated to bringing experts worldwide together to exchange ideas, share progress and explore future trends in the information discipline, as well as facilitate collaborations between participants to
[...] Read more.
The International Summit for The Study of Information (ISSI) is a biannual series of international conferences, dedicated to bringing experts worldwide together to exchange ideas, share progress and explore future trends in the information discipline, as well as facilitate collaborations between participants to meet new challenges [...]
Full article
Open AccessEditorial
The 3rd International Day on Computer Science and Applied Mathematics (ICSAM’23)
by
and
Comput. Sci. Math. Forum 2023, 6(1), 10; https://doi.org/10.3390/cmsf2023006010 - 12 Jul 2023
Abstract
ICSAM’23 is an ideal forum for different researchers to present excellent results and new challenges facing the field of computer science and applied mathematics [...]
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
Open AccessProceeding Paper
The Burr XII Autoregressive Moving Average Model
Comput. Sci. Math. Forum 2023, 7(1), 46; https://doi.org/10.3390/IOCMA2023-14403 - 05 Jul 2023
Abstract
The present work proposes a new class of model for random variables with support in the positive real line, this model explains the conditional quantile and is an alternative for modeling data that indicate asymmetric behavior and heavy tails. We present a new
[...] Read more.
The present work proposes a new class of model for random variables with support in the positive real line, this model explains the conditional quantile and is an alternative for modeling data that indicate asymmetric behavior and heavy tails. We present a new autoregressive moving average model based on the –th quantile of the Burr XII distribution (BXII-ARMA) since the quantile is less sensitive than the average of heterogeneous populations and also suitable in the presence of outliers. This model makes it possible to model any quantile by a dynamic structure containing autoregressive terms and moving averages, time-varying regressors, unknown parameters, and a link function. The conditional maximum likelihood method is considered to estimate the parameters and build the confidence intervals of the BXII-ARMA model. In addition, the model is adjusted to real data related to the financial market and compared with other competing models.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Numerical Solution of The Effects of Variable Fluid Properties on Biomagnetic Fluid over an Unsteady Stretching Sheet
Comput. Sci. Math. Forum 2023, 7(1), 15; https://doi.org/10.3390/IOCMA2023-14399 - 15 Jun 2023
Abstract
In this paper, the effects of various fluid properties on two-dimensional unsteady biomagnetic fluid flow (blood) and heat transfer over a stretching sheet under the appearance of a magnetic dipole is investigated. The governing boundary layer equations are simplified via suitable transformation which
[...] Read more.
In this paper, the effects of various fluid properties on two-dimensional unsteady biomagnetic fluid flow (blood) and heat transfer over a stretching sheet under the appearance of a magnetic dipole is investigated. The governing boundary layer equations are simplified via suitable transformation which are then solved using the bvp4c function approach in MATLAB software. The results indicate that fluid velocity and temperature are greatly influenced by the ferromagnetic interaction parameter. With increasing ferromagnetic number, fluid velocity drops but temperature increases. It is also found that the coefficient of skin friction and Nusselt number increase with an increase in values of thermal conductivity parameter. For certain parameter values, the results are also compared with previously published studies and they are found to be in acceptable agreement.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Qutrit-Based Orthogonal Approximations with Inverse-Free Quantum Gate Sets
Comput. Sci. Math. Forum 2023, 7(1), 12; https://doi.org/10.3390/IOCMA2023-14416 - 13 Jun 2023
Abstract
The efficient compiling of arbitrary single-qubit gates into a sequence of gates from a finite gate set is of fundamental importance in quantum computation. The exact bounds of this compilation are given by the Solovay–Kitaev theorem, which serves as a powerful tool in
[...] Read more.
The efficient compiling of arbitrary single-qubit gates into a sequence of gates from a finite gate set is of fundamental importance in quantum computation. The exact bounds of this compilation are given by the Solovay–Kitaev theorem, which serves as a powerful tool in compiling quantum algorithms that require many qubits. However, the inverse closure condition it imposes on the gate set adds a certain complexity to the experimental compilation, making the process less efficient. This was recently resolved by a version of the Solovay–Kitaev theorem for inverse-free gate sets, yielding a significant gain. Considering the recent progress in the field of three-level quantum systems, in which qubits are replaced by qutrits, it is possible to achieve the quantum speedup guaranteed by the Solovay–Kitaev theorem simply from orthogonal gates. Nevertheless, it has not been investigated previously whether the condition of inverse closure can be relaxed for these qutrit-based orthogonal compilations as well. In this work, we answer this positively, by obtaining improved Solovay–Kitaev approximations to an arbitrary orthogonal qutrit gate, with an accuracy from a sequence of orthogonal gates taken from an inverse-free set.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
Open AccessProceeding Paper
The Criteria for Adapting a Blockchain Consensus Algorithm to IoT Networks
Comput. Sci. Math. Forum 2023, 6(1), 9; https://doi.org/10.3390/cmsf2023006009 - 07 Jun 2023
Abstract
The Internet of Things (IoT) is a network of smart objects connected via the Internet, where each object is identified by a unique, accessible, and programmable address, while Blockchain is a technology for storing and transmitting information based on a decentralized system such
[...] Read more.
The Internet of Things (IoT) is a network of smart objects connected via the Internet, where each object is identified by a unique, accessible, and programmable address, while Blockchain is a technology for storing and transmitting information based on a decentralized system such that the centralized validation of transactions is replaced by a consensus mechanism. The integration of these two technologies requires consensus protocols to overcome the major challenges encountered in IoT systems, including issues related to security, storage capacity limits, computing power, etc. Therefore, different consensus algorithms have been implemented. For this purpose, this paper presents a research study on the criteria that would render a Blockchain consensus algorithm suitable for IoT networks, namely, computing power, latency, storage capacity, and security.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Quantum Cryptography Simulation of Entanglement and Quantum Teleportation
Comput. Sci. Math. Forum 2023, 6(1), 8; https://doi.org/10.3390/cmsf2023006008 - 05 Jun 2023
Abstract
The objective of this article is to present a simulation of quantum information. We take advantage of quantum entanglement to ensure the spontaneous transfer of a state from one qubit to another similar qubit. Similarly, the principle of quantum teleportation is conceived in
[...] Read more.
The objective of this article is to present a simulation of quantum information. We take advantage of quantum entanglement to ensure the spontaneous transfer of a state from one qubit to another similar qubit. Similarly, the principle of quantum teleportation is conceived in the application; it is not about transfer of matter, but of information. Indeed, two systems already exist, and at the end of the teleportation, the process is destructive—the first system will no longer be in the same state as the initial state and the second system takes the state of the first, which does not contradict the no-cloning theorem.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Blockchain Architecture for IoT: Comparative Survey
Comput. Sci. Math. Forum 2023, 6(1), 7; https://doi.org/10.3390/cmsf2023006007 - 01 Jun 2023
Abstract
Blockchain technology is increasingly being used in the internet of things (BCoT: Blockchain for IoT) to ensure the security and reliability of data exchanged between connected devices. There are several generic blockchain architectures for IoT that differ in their network and consensus characteristics.
[...] Read more.
Blockchain technology is increasingly being used in the internet of things (BCoT: Blockchain for IoT) to ensure the security and reliability of data exchanged between connected devices. There are several generic blockchain architectures for IoT that differ in their network and consensus characteristics. Blockchain architectures for IoT can be compared based on various criteria such as the type of storage used, consensus, and security. They should be selected based on the specific needs of each use case, and the resource constraints of connected devices and security and resilience requirements. In this article, we present a review of blockchain architectures for the internet of things that have been studied and applied in some well-known contemporary applications.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Kiln Process Fan Vibrations Prediction Based on Machine Learning Models: Application to the Raw Mill Fan
Comput. Sci. Math. Forum 2023, 6(1), 6; https://doi.org/10.3390/cmsf2023006006 - 31 May 2023
Abstract
Kiln process fans play a crucial role in the cement manufacturing process. This article presents a study on the use of machine learning models to predict kiln process fan vibrations based on process fan running parameters. The study tested three different models, namely,
[...] Read more.
Kiln process fans play a crucial role in the cement manufacturing process. This article presents a study on the use of machine learning models to predict kiln process fan vibrations based on process fan running parameters. The study tested three different models, namely, k-nearest neighbors, linear regression, and random forest, and it found that all three could accurately predict fan vibrations. However, the random forest model performed the best due to its ability to handle non-linear relationships. The findings have significant implications for the maintenance and operation of kiln process fans, as predictive maintenance can reduce downtime and improve operational efficiency.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Analysis of Tools for the Development of Conversational Agents
Comput. Sci. Math. Forum 2023, 6(1), 5; https://doi.org/10.3390/cmsf2023006005 - 30 May 2023
Abstract
Conversational agents are being increasingly adopted in various domains, such as e-commerce and customer services, and as a direct communication channel between companies and end-users. Several tools have been developed to facilitate their definition and deployment. They exploit existing cloud infrastructures and artificial
[...] Read more.
Conversational agents are being increasingly adopted in various domains, such as e-commerce and customer services, and as a direct communication channel between companies and end-users. Several tools have been developed to facilitate their definition and deployment. They exploit existing cloud infrastructures and artificial intelligence (AI) techniques to efficiently process users’ input and extract conversational information. Major Information Technology (IT) companies, such as Google, IBM, Microsoft, and Amazon, have provided powerful tools to develop conversational agents. Still, choosing the most appropriate tool is not easy, as it may require high costs associated with automatic natural language processing (NLP) services and expertise in software engineering and AI. Therefore, this paper aims to analyze different tools to help developers and non-developers to choose the optimal tool for their specific scenario of creating a conversational agent.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
A Software Factory for Accelerating the Development of Recommender Systems in Smart Tourism Mobile Applications: An Overview
Comput. Sci. Math. Forum 2023, 6(1), 4; https://doi.org/10.3390/cmsf2023006004 - 30 May 2023
Abstract
Recommender Systems (RSs) have become essential for suggesting personalized recommendations to users across various fields, especially in tourism. Due to the rising popularity of mobile devices, mobile RSs have emerged as a potential research area. However, developing these systems into smart tourism mobile
[...] Read more.
Recommender Systems (RSs) have become essential for suggesting personalized recommendations to users across various fields, especially in tourism. Due to the rising popularity of mobile devices, mobile RSs have emerged as a potential research area. However, developing these systems into smart tourism mobile applications requires a significant investment in artificial intelligence experts and software engineering. Hence, to reduce the cost of this investment, we propose building a software factory that provides a robust set of assets such as domain-specific languages for accelerating the development process. To this aim, we apply a model-driven engineering approach that uses models, metamodels, and model transformations to support the designing and implementation of these software systems. In this paper, we introduce an overview of our software factory to support the development of several models of RSs.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Developing Conversational Agent Using Deep Learning Techniques
Comput. Sci. Math. Forum 2023, 6(1), 3; https://doi.org/10.3390/cmsf2023006003 - 30 May 2023
Abstract
Recent advances in artificial intelligence and natural language processing have been widely used in recent years, and one of the best applications of these technologies is conversational agents. These agents are computer programs that can converse with users in natural languages. Developing conversational
[...] Read more.
Recent advances in artificial intelligence and natural language processing have been widely used in recent years, and one of the best applications of these technologies is conversational agents. These agents are computer programs that can converse with users in natural languages. Developing conversational agents using artificial intelligence techniques is an exciting prospect in natural language processing. In this study, we built an intelligent conversational agent using deep learning techniques. We used a sequence-to-sequence model with encoder–decoder architecture. This encoder–decoder uses a recurrent neural network with long–short-term memory cells. The encoder was used to understand the user’s question, and the decoder was to provide the answer.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
A Sketch of a Model-Driven Approach to Develop Smart Tourism Mobile Applications
Comput. Sci. Math. Forum 2023, 6(1), 2; https://doi.org/10.3390/cmsf2023006002 - 30 May 2023
Abstract
Several approaches have been proposed to accelerate software development. Model-driven engineering (MDE) is one approach that aims to abstract and automate the development process using models and transformations as the main artifacts. This paper presents our model-driven approach to developing smart tourism mobile
[...] Read more.
Several approaches have been proposed to accelerate software development. Model-driven engineering (MDE) is one approach that aims to abstract and automate the development process using models and transformations as the main artifacts. This paper presents our model-driven approach to developing smart tourism mobile applications.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
Secure and Efficient Code-Based Cryptography for Multi-Party Computation and Digital Signatures
Comput. Sci. Math. Forum 2023, 6(1), 1; https://doi.org/10.3390/cmsf2023006001 - 26 May 2023
Abstract
Code-based cryptography is a promising candidate for post-quantum cryptography due to its strong security guarantees and efficient implementations. In this paper, we explore the use of code-based cryptography for multi-party computation and digital signatures, two important cryptographic applications. We present several efficient and
[...] Read more.
Code-based cryptography is a promising candidate for post-quantum cryptography due to its strong security guarantees and efficient implementations. In this paper, we explore the use of code-based cryptography for multi-party computation and digital signatures, two important cryptographic applications. We present several efficient and secure code-based protocols for these applications, based on the McEliece cryptosystem and its variants. Our protocols offer strong security guarantees against both classical and quantum attacks, and have competitive performance compared to other post-quantum cryptographic schemes. We also compare code-based cryptography with other post-quantum schemes, including lattice-based and hash-based cryptography, and discuss the advantages and disadvantages of each approach.
Full article
(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
Open AccessProceeding Paper
Non-Linear Optimization Method for Maximum Point Search in Functions with Corner or Cusp Points
Comput. Sci. Math. Forum 2023, 7(1), 14; https://doi.org/10.3390/IOCMA2023-14605 - 16 May 2023
Abstract
A function is non-differentiable when there is a cusp or a corner point in its graph. To solve this problem, we propose a nonlinear optimization model whose objective function is the Euclidean distance function. To identify the maximum points of a function that
[...] Read more.
A function is non-differentiable when there is a cusp or a corner point in its graph. To solve this problem, we propose a nonlinear optimization model whose objective function is the Euclidean distance function. To identify the maximum points of a function that has corner or cusp points, according to the proposed model, a series of segments are generated which are measured through the Euclidean distance, which are all perpendicular to the abscissa axis. Therefore, by maximizing the Euclidean distance, it is possible to identify the segment whose points represent the maximum of the function and its projection on the abscissa axis. The proposed model therefore could be an alternative to maximum point search methods in the presence of functions that have points of non-derivability.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
New Structure of Skew Braces and Their Ideals
Comput. Sci. Math. Forum 2023, 7(1), 54; https://doi.org/10.3390/IOCMA2023-14601 - 15 May 2023
Abstract
The primary motivation of this article is to introduce the definition of a strongly belonging element of a brace, presenting some results concerning the case where I acts as an ideal of a brace, . We
[...] Read more.
The primary motivation of this article is to introduce the definition of a strongly belonging element of a brace, presenting some results concerning the case where I acts as an ideal of a brace, . We find that an element acts as strongly belonging element of I when yields a for all b in I.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
Open AccessProceeding Paper
The Advanced Boundary Integral Equation Method for Modelling Wave Propagation in Layered Acoustic Metamaterials with Arrays of Crack-Like Inhomogeneities
by
, , , and
Comput. Sci. Math. Forum 2023, 7(1), 1; https://doi.org/10.3390/IOCMA2023-14602 - 15 May 2023
Abstract
The three-dimensional problem of the modelling of elastic wave propagation in a multi-layered acoustic metamaterial, a periodic elastic composite with periodic arrays of interface cracks or planar voids of arbitrary shape, is considered. The boundary integral equation method is extended for this purpose.
[...] Read more.
The three-dimensional problem of the modelling of elastic wave propagation in a multi-layered acoustic metamaterial, a periodic elastic composite with periodic arrays of interface cracks or planar voids of arbitrary shape, is considered. The boundary integral equation method is extended for this purpose. The unknown crack-opening displacement vectors for each array are related using the Floquet theorem and solved using the Galerkin method at reference delaminations in the arrays. The developed method provides an efficient tool for fast parametric analysis of the influence of the periodic crack array characteristics on the transmission and diffraction of elastic waves. Two modifications to the boundary integral equation method are proposed and compared for rectangular cracks. To reduce computational costs, a preliminary analytical evaluation of the arising integral representations in terms of the Fourier transform of Green’s matrices and the crack-opening displacements are presented.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
►▼
Show Figures
Figure 1
Open AccessProceeding Paper
A Stochastic Bilevel DEA-Based Model for Resource Allocation
by
, , , and
Comput. Sci. Math. Forum 2023, 7(1), 40; https://doi.org/10.3390/IOCMA2023-14594 - 11 May 2023
Abstract
The optimal allocation of limited resources along with output target setting are critical in pursuing the sustainability and competitiveness of organizations. The process of resource distribution is usually implemented through a central unit that routes resources to the subordinate decision-making units (DMUs) along
[...] Read more.
The optimal allocation of limited resources along with output target setting are critical in pursuing the sustainability and competitiveness of organizations. The process of resource distribution is usually implemented through a central unit that routes resources to the subordinate decision-making units (DMUs) along with DMUs lower bounds of desired efficiency. Moreover, the central unit has the authority to set the overall expected output targets so as to maximize organizational effectiveness. In this paper, we tackle evaluation efficiency questions using a type of bilevel network data envelopment analysis (DEA) approach within a stochastic framework. The proposed bilevel DEA model takes into account stochastic conditions and optimizes centralized resource allocation and target setting, imposing lower bounds on the efficiencies of all DMUs affiliated to the organization. Consequently, the total input consumption is minimized, and the total output production is maximized while considering additional bounds and availability constraints for inputs. In the proposed bilevel model, uncertainty is introduced through the upper level (leader) problem that attempts to maximize organizational effectiveness, while in the lower level (follower) problem, the efficiency of the subordinate DMUs is evaluated. A solution methodology for the bilevel network DEA-based model is presented and numerical results are obtained using data from the literature. The obtained results are compared with those published in other case studies for centralized resource allocation DEA models.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
Open AccessProceeding Paper
A Varadhan Estimate for Big Order Differential Generators
by
Comput. Sci. Math. Forum 2023, 7(1), 38; https://doi.org/10.3390/IOCMA2023-14554 - 06 May 2023
Abstract
We give a logarithmic estimate of an elliptic semi-group generated by a big-order generator by using the Malliavin Calculus of Bismut type and large deviation estimates.
Full article
(This article belongs to the Proceedings of The 1st International Online Conference on Mathematics and Applications)
Highly Accessed Articles
Latest Books
E-Mail Alert
News
31 July 2023
MDPI’s 2022 Best PhD Thesis Awards in Computer Science and Mathematics—Winners Announced
MDPI’s 2022 Best PhD Thesis Awards in Computer Science and Mathematics—Winners Announced
31 July 2023
MDPI’s 2022 Young Investigator Awards in Computer Science and Mathematics—Winners Announced
MDPI’s 2022 Young Investigator Awards in Computer Science and Mathematics—Winners Announced