Статьи журнала - International Journal of Mathematical Sciences and Computing

Все статьи: 240

Predictive Analytics of Employee Attrition using K-Fold Methodologies

Predictive Analytics of Employee Attrition using K-Fold Methodologies

V. Kakulapati, Shaik Subhani

Статья научная

Currently, every company is concerned about the retention of their staff. They are nevertheless unable to recognize the genuine reasons for their job resignations due to various circumstances. Each business has its approach to treating employees and ensuring their pleasure. As a result, many employees abruptly terminate their employment for no apparent reason. Machine learning (ML) approaches have grown in popularity among researchers in recent decades. It is capable of proposing answers to a wide range of issues. Then, using machine learning, you may generate predictions about staff attrition. In this research, distinct methods are compared to identify which workers are most likely to leave their organization. It uses two approaches to divide the dataset into train and test data: the 70 percent train, the 30 percent test split, and the K-Fold approaches. Cat Boost, LightGBM Boost, and XGBoost are three methods employed for accuracy comparison. These three approaches are accurately generated by using Gradient Boosting Algorithms.

Бесплатно

Prevalence and Associated Risk Factors of 'Psychological, Financial and Career Effect' Among Bangladeshi Undergraduate Students in the COVID-19 Pandemic Situation

Prevalence and Associated Risk Factors of 'Psychological, Financial and Career Effect' Among Bangladeshi Undergraduate Students in the COVID-19 Pandemic Situation

Fee Faysal Ahmed, Tonmoy Adhikary, Tania Sultana, Sheikh Sadia Arny, Faria Tabassum Nishi, Partho Bosu, Samiran Mondal

Статья научная

Objective: The COVID-19 pandemic situation has deeply affected students' psychological, financial, and career problems. The objective of our study is to find out the prevalence and identify significant risk factors of psychological, financial and career effects among the students in the pandemic. Methods: The cross-sectional survey was performed online via multiple social media sites such as Facebook, Email, WhatsApp, and the survey included 723 individuals. Chi-square analysis was performed to show the association between different selected factors and psychological, financial and career problems. Risk factors were obtained by logistics regression on the basis of p-value (p-value<0.05). Findings: Our findings illustrate that 68.11% of students suffer from depression, 60.86% from anxiety, 61.98% from a mood disorder, and 63.23% from financial difficulties, such as being unable to afford the cost of education, working frustrated all the time, and losing interest in many things. Binary logistic regression demonstrated that student’s gender, feeling helpless, worried, lost interest, educational expenses, and opinion of solve the problems and problems for prolonging education system were the risk factors of career effects. On the other hand, student’s gender, marital status, feeling bad about yourself, symptoms of corona virus, feeling nervous, short term memory loss, mood change, communicating problem, lost interest, feeling helpless, continue of income, study interrupt, irritable mood were associated factors of psychological problems. Family income status, feeling bad about yourself, lost interest, educational expenses, continue of income source, study interrupt, reason of study interrupt, were the factors associated with financial problems. Novelty: We have found many statistically significant risk factors of the psychological (depression, anxiety and mood disorder) as well as financial and career of the students in the pandemic situation, which have not been discussed in previous studies.

Бесплатно

Proposed model for evaluating information systems quality based on single valued triangular neutrosophic numbers

Proposed model for evaluating information systems quality based on single valued triangular neutrosophic numbers

Samah Ibrahim Abdel Aal, Mahmoud M. A. Abd Ellatif, Mohamed Monir Hassan

Статья научная

One of the most important reasons for information systems failure is lack of quality. Information Systems Quality (ISQ) evaluation is important to prevent the lack of quality. ISQ evaluation is one of the most important Multi-Criteria Decision Making (MCDM) problems. The concept of Single Valued Triangular Neutrosophic Numbers (SVTrN-numbers) is a generalization of fuzzy set and intuitionistic fuzzy set that make it is the best fit in representing indeterminacy and uncertainty in MCDM. This paper aims to introduce an ISQ evaluation model based on SVTrN- numbers with introducing two types of evaluating and ranking methods. The results indicated that the proposed model can handle ill-known quantities in evaluating ISQ. Also by analyzing and comparing results of ranking methods, the results indicated that each method has its own advantage that make the proposed model introduces more than one option for evaluating and ranking ISQ.

Бесплатно

Proving Riemann Hypothesis through the Derivative of Zeta Reflection

Proving Riemann Hypothesis through the Derivative of Zeta Reflection

Salah Ameer

Статья научная

A novel proof is presented in this work indicating that all non-trivial zeros of the zeta function has a real part equal to ½. As no proof has been validated yet, this work was successful in introducing a proof through the use of elementary calculus theorems. A second version of the proof was also shown where a more advanced series analysis (e.g. Fourier series) is used.

Бесплатно

Quantum Mechanics Analysis: Modeling and Simulation of some simple systems

Quantum Mechanics Analysis: Modeling and Simulation of some simple systems

Younis A. Shah, Irshad.A. Mir, Uzair M. Rathea

Статья научная

Quantum Mechanics is a radically new way of thinking about the Nature. It is used for explaining the behavior of an electron to the possible existence of parallel universes. Most of the times, it is just too difficult to get an intuitive grasp of Quantum Mechanics. Quantum Mechanics is a mathematical framework for describing atomic and subatomic systems. In this paper the basic principles of Quantum Mechanics have been presented. It has been shown that classical probabilities when added increase the overall probability while in quantum probabilities can cancel each other and hence lower the overall probability. A simple approach has been taken by modeling the systems as graphs. The states and dynamics of the systems have been modeled as matrices. The principle of Superposition and the phenomenon of Interference have been explained in a single simulation. Finally the BLAS functions of Julia programming language have been used for simulating the systems under study on a classical computer and a detailed discussion is presented to highlight the incapability of the classical explanation of quantum phenomenon.

Бесплатно

Quantum Walk Algorithm to Compute Subgame Perfect Equilibrium in Finite Two-player Sequential Games

Quantum Walk Algorithm to Compute Subgame Perfect Equilibrium in Finite Two-player Sequential Games

Arish Pitchai, A V Reddy, Nickolas Savarimuthu

Статья научная

Subgame Perfect Equilibrium (SGPE) is a refined version of Nash equilibrium used in games of sequential nature. Computational complexity of classical approaches to compute SGPE grows exponentially with the increase in height of the game tree. In this paper, we present a quantum algorithm based on discrete-time quantum walk to compute Subgame Perfect Equilibrium (SGPE) in a finite two-player sequential game. A full-width game tree of average branching factor b and height h has nodes in it. The proposed algorithm uses oracle queries to backtrack to the solution. The resultant speed-up is times better than the best known classical approach, Zermelo's algorithm.

Бесплатно

RMSD Protein Tertiary Structure Prediction with Soft Computing

RMSD Protein Tertiary Structure Prediction with Soft Computing

Mohammad Saber Iraji, Hakimeh Ameri

Статья научная

Root-mean-square-deviation (RMSD) is an indicator in protein-structure-prediction-algorithms (PSPAs). Goal of PSP algorithms is to obtain 0 Å RMSD from native protein structures. Protein structure and RMSD prediction is very essential. In 2013, the estimated RMSD proteins based on nine features were obtained best results using D2N (Distance to the native). We presented in This paper proposed approach to reduce predicted RMSD Error Than the actual amount for RMSD and calculate mean absolute error (MAE), through feed forward neural network, adaptive neuro fuzzy method. ANFIS is achieved better and more accurate results.

Бесплатно

Raising Digital Security Awareness in the FinTech Sector: Case Studies and Defense Mechanisms

Raising Digital Security Awareness in the FinTech Sector: Case Studies and Defense Mechanisms

Awnon Bhowmik

Статья научная

The FinTech sector, an innovative blend of finance and technology, has significantly reshaped financial services by making transactions more efficient and accessible. However, this rapid digitalization has also introduced substantial cybersecurity risks, making the sector an attractive target for cybercriminals. This paper explores the current digital security landscape within the FinTech industry, highlighting prevalent threats such as phishing, malware, and data breaches. It underscores the importance of raising digital security awareness among employees, customers, and other stakeholders to mitigate these risks. The paper analyzes significant case studies and regulatory frameworks and examines the challenges and barriers to implementing effective security measures. It also proposes comprehensive strategies for enhancing digital security awareness, including employee training, customer education, and industry collaboration. The paper concludes with recommendations for future trends and best practices, emphasizing the need for a proactive and collaborative approach to building a secure and resilient FinTech ecosystem.

Бесплатно

Randamization technique for desiging of substitution box in data encryption standard algorithm

Randamization technique for desiging of substitution box in data encryption standard algorithm

Nilima S., Alind, Nitin Aror

Статья научная

A new approach for the generation of randomized substitution box (S-box) based on the concept of a redesign of S-box with fewer numbers of input bits processed at a time as compared to existing S-box in Data Encryption Standard (DES) Algorithm. The results of experimentation prove that proposed randomized approach also generate promising results, which can be particularly useful for devices with less processing power. Proposed approach retains the diffusion and confusion property of a good cryptosystem algorithm.

Бесплатно

Real Time Webcam based Infrared Tracking for Projection Display System

Real Time Webcam based Infrared Tracking for Projection Display System

Aniket Kudale, Kirti Wanjale

Статья научная

In this paper, we propose an interaction based projection display system, which enables an infrared pen touch interaction on flat surface (e.g. walls, whiteboard, tables), with a webcam (with an infrared filter removed) and a projector. The challenge of infrared pen touch detection is to sense the touching and movement information of an infrared pen on the surface just from the 2-dimensional image captured by the webcam. In our method, the content of a computer is projected on the surface and the user interacts with the surface using an infrared pen, the movement of an infrared pen is captured by the webcam. Here, the infrared LED light act as a tracking point which helps in controlling the content projected on surface. The proposed method is performed in three stages: 1) the infrared pen LED image is captured and tracked using webcam 2) the calibration of webcam-projector setup is done by principle of Homography 3) the tracked coordinates or location of Infrared pen LED is mapped to computer cursor. By this way, movement of infrared pen allows user to control computer content projected on the surface.

Бесплатно

Reducing hash function complexity: MD5 and SHA-1 as examples

Reducing hash function complexity: MD5 and SHA-1 as examples

Yousef Ali Al-Hammadi, Mohamed Fadl Idris Fadl

Статья научная

Hash functions algorithms also called message digest algorithms, compress a message input of an arbitrary length, and produce an output with a fixed length that is distributed randomly. Several hash algorithms exist such as Md5 and SHA1. These algorithms verify data integrity and restrict unauthorized data modification. However, they experience some complexities, especially when implemented in bitcoin mining, and low computation devices, in particularly IoT devices. As a remedy, this paper suggests a new compression function that reduces the complexity of the hash function algorithms such as MD5 and SHA-1. Also, proves that we can obtain the same results which are achieved by the original compression function.

Бесплатно

Reliability Evaluation of High Speed Train Bogie System Based on Stochastic Network Flow Model

Reliability Evaluation of High Speed Train Bogie System Based on Stochastic Network Flow Model

Vartika Sharma, Rajesh Mishra

Статья научная

Bogie is an emblematic complex mechanical as well as electronic part of the current high speed rail system. A small failure of components may lead to a loss of production, casualties and damage of the system. Therefore, security and reliability analysis of bogie system is a predominant task. This paper proposes a stochastic network flow model of bogie system based on the forces applied on the components of the bogie, simultaneously considering the deterioration level and functional correlation of components. At first, a detailed description of structure and functions of the CRH3 bogie is introduced. Then a stochastic network flow model is constructed by analysing the direction of various forces applied on bogie. In the proposed model, edges represent the bogie components and vertices are the transmission channels. The flow over each edge is analysed by the forces it withstands. Finally, a combination method using minimal cut sets is proposed to evaluate the reliability of high speed train bogie system. This paper provides a supportive guidance and practical approach to bogie system designers for efficient operation and maintenance of the bogie.

Бесплатно

Research Domain Selection using Naive Bayes Classification

Research Domain Selection using Naive Bayes Classification

Selvani Deepthi Kavila, Radhika Y

Статья научная

Research Domain Selection plays an important role for researchers to identify a particular document based on their discipline or research areas. This paper presents a framework which consists of two phases. In the first phase, a word list is constructed for each area of the research paper. In the second phase, the word list is continuously updated based on the new domains of research documents. Primary area and Sub area of the documents are identified by applying pre-processing and text classification techniques. Naive Bayes classifier is used to find the probability of various areas. An area having the highest probability is considered as primary area of the document. In this paper text classification procedures is condensed as that are utilized to arrange the content archives into predefined classes. Based on the performance analysis, it has been observed that the obtained results are efficient when compared to manual judgement.

Бесплатно

Results on Coregular Perfect Domination of Line Graph and Relation with Different Dominations of Graph

Results on Coregular Perfect Domination of Line Graph and Relation with Different Dominations of Graph

M.H Muddebihal, N. Jayasudha

Статья научная

For any graph G = (V, E),the line graph L(G)of a graph G is a graph whose set of vertices is the union of set of edges of G in which two vertices of L(G) are adjacent if and only if the corresponding edges of G are adjacent. A dominating set D_1 ⊆ V[L(G)] is called coregular perfect dominating set, if the induced subgraph V[L(G)]-D_1 is regular. The minimum cardinality of vertices in such a set is called coregular perfect domination number in L(G) and is represented by γ_cop [L(G)]. In this Article, we study the graph theoretic properties of γ_cop [L(G)] and many bounds were obtained in terms of elements of G and its relationship with other domination parameters were found .Our investigation on this work is to establish the application oriented standard results in the field of domination theory for several kinds of new concepts which are playing an important role of application.

Бесплатно

Revised Method for Sampling Coefficient Vector of GNR-enumeration Solution

Revised Method for Sampling Coefficient Vector of GNR-enumeration Solution

Gholam Reza Moghissi, Ali Payandeh

Статья научная

For selecting security parameters in lattice-based cryptographic primitives, the exact manner of BKZ algorithm (as total cost and specification of output basis) should be estimated in high block sizes. The simulations of BKZ are used to predict (estimate) the exact manner of BKZ algorithm which cannot be studied by practical running of BKZ algorithm for higher block sizes. Sampling method of GNR (Gamma-Nguyen-Regev) enumeration solution vector v is one of the main components of designing BKZ-simulation and it includes two phases: sampling the norm of solution vector v and sampling corresponding coefficient vectors. Our work, by Moghissi and Payandeh in 2021, entitled as “Better Sampling Method of Enumeration Solution for BKZ-Simulation”, introduces a simple and efficient idea for sampling the norm and coefficient vectors of GNR enumeration solution v. This paper proposes much better analysis for approximating the expected value and variance of the entries of these coefficient vectors. By this analysis, our previous idea for sampling the coefficient vectors is revised, which means that the expected value and variance of every entry in these coefficient vectors sampled by our new sampling method, are more close to the expected value and variance of corresponding entries in original sampling method, while these new sampled coefficient vectors include no violation from main condition of GNR bounding function (i.e., our new sampling method is not a rejection sampling).

Бесплатно

Revisited Quantum Protocols

Revisited Quantum Protocols

Shyam Sihare, V V Nath

Статья научная

Quantum cryptography is marches towards secure communication by using quantum protocols. Number of quantum protocols has been evolved based on an entanglement in three decades; similarly during this meanwhile non-entanglement based protocols have been evolved within the same period also. Among number of different protocols a torch bearer was BB84 protocol. Even though different quantum communication protocols exist, the BB84 protocol proved its application by initial experiments whereas most of the other protocols are theoretical which marches towards the practical application yet. But in quantum mechanics principle, cryptography based on an entanglement and superposition of entangled particle. Furthermore, challenges ahead are development and design high sensitive equipments for measurement of an entangled particle position at output end. Particle entanglements open a new door for computation worlds such as speedup, security. In this article, we discuss quantum protocols, their challenges, and applications based on above discussion.

Бесплатно

Service Time Management of Doctor's Consultation Using Parallel Service T me in Wesley Guild Hospital, Ilesa, Osun State, Nigeria

Service Time Management of Doctor's Consultation Using Parallel Service T me in Wesley Guild Hospital, Ilesa, Osun State, Nigeria

David O. Ikotun, Alaba T. Owoseni, Justus A. Ademuyiwa

Статья научная

How to manage patient's service time has been a burden in view of the condition of patients who have to wait for required service from doctors in many hospitals in developing countries. This paper deals with the management of service time of doctor's consultation using parallel service time. Though, the theoretical underlying distribution of service time is exponential, but this research showed service time to be non-exponential but, normal. This unusual distribution of service time was attributed to non-identical services required by patients from doctors in the considered sample space. Secondly, the mean service time from each service point as researched was found the same. This showed that no line could be preferred to other.

Бесплатно

Signature-based malware detection using approximate boyer moore string matching algorithm

Signature-based malware detection using approximate boyer moore string matching algorithm

A. Ojugoa, A. O. Eboka

Статья научная

Adversaries to any system restlessly continues to sought effective, non-detectable means to aid them successful penetrate secure systems, either for fun or commercial gains. They achieve these feats easily through the use of malware, which keeps on the rise, an ever-growing and corresponding overpopulated malware zoo. As such, information technology industry will continue to encounter via these escapades, both monetary and prestigious losses. Malware by design aims to alter the behaviour of its host by self-replicating its genome or codes unto it. They are quite fascinating in that on execution, some malware change their own structure so that its copies have same functionality but differ in signature and syntax from the original or parent virus. This makes signature detection quite unreliable. Study investigates detection of metamorphic malware attacks using the Boyer Moore algorithm for string-based signature detection scheme.

Бесплатно

Simulation of CPU Scheduling Algorithms using Poisson Distribution

Simulation of CPU Scheduling Algorithms using Poisson Distribution

Amit Mishra, Abdullahi Ofujeh Ahmed

Статья научная

Numerous scheduling algorithms have been developed and implemented in a bid to optimized CPU utilization. However, selecting a scheduling algorithm for real system is still very challenging as most of these algorithms have their peculiarities. In this paper, a comparative analysis of three CPU scheduling algorithms Shortest Job First Non-Preemptive, Dynamic Round-Robin even-odd number quantum Scheduling algorithm and Highest Response-Ratio-Next (HRRN) was carried out using dataset generated using Poisson Distribution. The performance of these algorithms was evaluated in the context of Average Waiting Time (AWT), Average Turnaround Time (ATT). Experimental results showed that Shortest Job First Non-Pre-emptive resulted in minimal AWT and ATT when compared with two other algorithms.

Бесплатно

Slow Invariant Manifold Analysis in a Mitotic Model of Frog Eggs via Flow Curvature Method

Slow Invariant Manifold Analysis in a Mitotic Model of Frog Eggs via Flow Curvature Method

A. K. M. Nazimuddin, Md. Showkat Ali

Статья научная

A slow-fast dynamical systems can be investigated qualitatively and quantitatively in the study of nonlinear chaotic dynamical systems. Slow-fast autonomous dynamical systems exhibit a dichotomy of motion, which is alternately slow and quick, according to experiments. Some investigations show that slow-fast dynamical systems have slow manifolds, which is supported by theory. The goal of the proposed study is to show how differential geometry may be used to examine the slow manifold of the dynamical system known as the mitotic model of frog eggs. The algebraic equation of the flow curvature manifold is obtained using the flow curvature technique applied to the dynamical mitosis model. Using the Darboux invariance theorem, we then argue that this slow manifold equation is invariant with regard to the flow.

Бесплатно

Журнал