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

Все статьи: 240

A Novel Mathematical Model for Cross Dock Open-Close Vehicle Routing Problem with Splitting

A Novel Mathematical Model for Cross Dock Open-Close Vehicle Routing Problem with Splitting

Mahdi Alinaghian, Mina Rezaei Kalantari, Ali Bozorgi-Amiri, Nima Golghamat Raad

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

Cross docks play an important role in goods distribution. In most of the common models, the capacity of vehicles is not completely used as they assume that each node is met only by one vehicle. Also, due to high cost of purchasing vehicles with high capacity, rental vehicles are used in collecting section. In this paper, a novel mathematical model is presented in which, each node can be possibly visited by different vehicles (splitting). Besides, in the proposed model, existence of open routes in pickup section has been supposed. Then, one meta-heuristic method based on the simulation annealing algorithm with two different approaches has been developed. For testing the performance of the proposed algorithm, the obtained results compared with the exact answers in both small and large scales. The outcomes show that the algorithm works properly.

Бесплатно

A Novel Model for Recommending Information Systems with Suitable Cloud Computing Provider

A Novel Model for Recommending Information Systems with Suitable Cloud Computing Provider

Samah Ibrahim Abdel Aal

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

Cloud computing has been adopted widely by information systems due to its scalability and availability of resources and services. Cloud computing can provide different types of services through internet for Information Systems (IS). There are many cloud computing providers such as Google, Microsoft, and IBM are seeking for adopting of cloud services. Selecting the suitable cloud provider can maximize the benefits of cloud services. There is a need to determine the suitable cloud computing provider to achieve organizations' goals and maximize the benefits of cloud services. This work aims to introduce a decision support model based on trapezoidal neutrosophic numbers for determining the suitable cloud computing provider. The proposed model is applied by the Zagazig University (ZU) and the results indicated that the model can provide flexible method that can handle uncertainty in decision making for detecting the suitable provider. Also, the results show that the proposed model can support information systems in the choosing the suitable cloud computing provider.

Бесплатно

A Novel Verifiable Secret Sharing with Detection and Identification of Cheaters' Group

A Novel Verifiable Secret Sharing with Detection and Identification of Cheaters' Group

Qassim Al Mahmoud

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

Shamir's (t, n)-SS scheme is very simple to generate and distribute the shares for a secret among n participants by using such polynomial. We assume the dealer a mutually trust parity when he distributes the shares to participants securely. In addition when the participants pooling their shares in the secret reconstruction phase a honest participants can always reconstruct the real secret by Pooling areal shares. The property of verifiability enables participants to verify that their shares are consistent. Tompa and Woll suggested an important cheating scenario in Shamir's secret reconstruction. They found a solution to remove a single cheater with small probability, unfortunately, their scheme is based on computational assumptions. In addition each participants will receive a huge number of shares. In this paper we will construct scheme to be information-theoretically secure verifiable secret sharing which does not contain a single cheater. On the other hand we will eliminate these problems in Tompa and Woll scheme. Our proposed scheme is not only to detect and identify a cheater, but to prevent him from recovering the secret when the honest participants cannot.

Бесплатно

A Predictive Symptoms-based System using Support Vector Machines to enhanced Classification Accuracy of Malaria and Typhoid Coinfection

A Predictive Symptoms-based System using Support Vector Machines to enhanced Classification Accuracy of Malaria and Typhoid Coinfection

Enesi Femi Aminu, Emmanuel Onyebuchi Ogbonnia, Ibrahim Shehi Shehu

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

High costs of medical equipment and insufficient number of medical specialists have immensely contributed to the increment of death rate especially in rural areas of most developing countries. According to Roll Back Malaria there are 300 million acute cases of malaria per year worldwide, causing more than one million deaths. About 90% of these deaths happen in Africa, majorly in young children. Besides malaria when tested; a large number is coinfected with typhoid. Most often, symptoms of malaria and typhoid fevers do have common characteristics and clinicians do have difficulties in distinguishing them. For instance in Nigeria the existing diagnostic systems for malaria and typhoid in rural settlements are inefficient thereby making the result to be inaccurate and resulting to treatment of wrong ailments. Therefore in this paper, a predictive symptoms-based system for malaria and typhoid coinfection using Support Vector Machines (SVMs) is proposed for an improved classification results and the system is implemented using Microsoft Visual Basic 2013. Relatively high performance accuracy was achieved when tested on a reserved data set collected from a hospital. Hence the system will be of a great significant use in terms of affordable and quality health care services especially in rural settlement as an alternative and a reliable diagnostic system for the ailments.

Бесплатно

A Proposed Linear Programming Based Algorithm to Solve Arc Routing Problems

A Proposed Linear Programming Based Algorithm to Solve Arc Routing Problems

Hashnayne Ahmed

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

A new linear programming-based algorithm has been demonstrated to find the best way for arc routing. In most arc routing problems, the main goal is to minimize the total cost on the lane. To find the minimum cost giving lane, the existing algorithms find the smallest possible sum of weights by ticking the shortest paths [7-12]. The proposed computer-based algorithm is based on focusing the minimized total cost with some constraint criteria of fixed values. The routes are marked with a series of variables that may differ according to the lane choice and more accurately estimates the exact total cost considering the remaining weight. Finally, a stochastic model for a private company vehicle transport has been discussed with some possible solution expectations.

Бесплатно

A Proposed Technique for Solving Scenario Based Multi-Period Stochastic Optimization Problems with Computer Application

A Proposed Technique for Solving Scenario Based Multi-Period Stochastic Optimization Problems with Computer Application

Sajal Chakroborty, M. Babul Hasan

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

In this paper, we have presented a new technique for solving scenario based multi-period stochastic programming problems and presented a case study for the business policy of a super shop market in Bangladesh. We have developed our technique based on decomposition based pricing method which is the latest and faster decomposition technique in use. To our knowledge, this is the first work in the field of stochastic programming for solving multi-period stochastic optimization problems by using decomposition based pricing method. We have also developed a model by collecting data of a year from a super shop market of Bangladesh and analyzed their profit by dividing the whole year into four periods for different scenarios of an uncertainty. We have developed a computer code by using mathematical programming language AMPL and analyzed the model by using our developed technique.

Бесплатно

A Review of Quantum Computing

A Review of Quantum Computing

Arebu Dejen, Murad Ridwan

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

Quantum computing is a computational framework based on the Quantum Mechanism, which has gotten a lot of attention in the past few decades. In comparison to traditional computers, it has achieved amazing performance on several specialized tasks. Quantum computing is the study of quantum computers that use quantum mechanics phenomena such as entanglement, superposition, annealing, and tunneling to solve problems that humans cannot solve in their lifetime. This article offers a brief outline of what is happening in the field of quantum computing, as well as the current state of the art. It also summarizes the features of quantum computing in terms of major elements such as qubit computation, quantum parallelism, and reverse computing. The study investigates the cause of a quantum computer's great computing capabilities by utilizing quantum entangled states. It also emphasizes that quantum computer research requires a combination of the most sophisticated sciences, such as computer technology, micro-physics, and advanced mathematics.

Бесплатно

A Rigorous Euclidean Geometric Proof of the Cube Duplication Impossibility

A Rigorous Euclidean Geometric Proof of the Cube Duplication Impossibility

Alex Mwololo Kimuya

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

This paper introduces a rigorous impossibility proof in Euclidean geometry, presenting a scrupulous demonstration of the unattainability of doubling the volume of a cube through any given procedure. The proof methodically follows the rigorous principles of classical geometry, offering clarity and insight into a longstanding mathematical challenge. The paper further emphasizes the historical misconceptions and varied solutions that have emerged due to the lack of a definitive Euclidean geometric proof. It highlights the enduring strengths, independence, and richness of Euclidean geometry while dispelling the notion that algebraic methods are the exclusive avenue to tackle geometric impossibilities. The results obtained throughout this proof solidify the position of Euclidean geometry as a potent and illuminating tool, reaffirming its pivotal role in the world of mathematics. This work contributes not only to the resolution of a specific mathematical challenge but also to the broader understanding of the unique virtues and capabilities of Euclidean geometry in tackling complex geometric problems.

Бесплатно

A Robotic Path Planning by Using Crow Swarm Optimization Algorithm

A Robotic Path Planning by Using Crow Swarm Optimization Algorithm

Mohammed Yousif, Ahmad Salim, Wisam K. Jummar

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

One of the most common problem in the design of robotic technology is the path planning. The challenge is choosing the robotics’ path from source to destination with minimum cost. Meta-heuristic algorithms are popular tools used in a search process to get optimal solution. In this paper, we used Crow Swarm Optimization (CSO) to overcome the problem of choosing the optimal path without collision. The results of CSO compared with two meta-heuristic algorithms: PSO and ACO in addition to a hybrid method between these algorithms. The comparison process illustrates that the CSO better than PSO and ACO in path planning, but compared to hybrid method CSO was better whenever the smallest population. Consequently, the importance of research lies in finding a new method to use a new meta-humanistic algorithm to solve the problem of robotic path planning.

Бесплатно

A SEIRS Model of Tuberculosis Infection Model with Vital Dynamics, Early Treatment for Latent Patients and Treatment of Infective

A SEIRS Model of Tuberculosis Infection Model with Vital Dynamics, Early Treatment for Latent Patients and Treatment of Infective

Sulayman Fatima, Amit Mishra

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

Tuberculosis is one of the most destructive bacteria in human being and the second cause of mortality after HIV/AIDS in the whole world. In this research work, a SEIRS of mathematical model for the transmission of tuberculosis incorporating vital dynamics, early therapy of patient with tuberculosis were studied and a model for treatment of infective as controls was developed. The effective reproduction number and the disease-free equilibrium was also analysed for the stability. The results revealed that the two controls reduce effective number below unity. Furthermore, it shows that early therapy of patient with tuberculosis is more effective in mitigating the spread of tuberculosis burden.

Бесплатно

A Subspace Inclusion Graph of a Finite Dimensional Vector Space

A Subspace Inclusion Graph of a Finite Dimensional Vector Space

Weihua Yang

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

The combination of algebraic structures and graphs was carried out by investigating thoroughly the relation among the algebraic structure and the graph theoretic properties. Moreover, it needs to explore algebraic structure. The results of the combination of algebraic structures and graphs have many applications in the fields of Internet modeling, coding, etc. For example, the famous Cayley graph was constructed from groups and widely used in network models. Das introduced the subspace inclusion graph on finite-dimensional vector space over a finite filed, and studied that the graph is bipartite and some special properties if the dimension of the vector space is 3. In this paper, this bipartite inclusion graph in the case of 3-dimensional is extended to more general dimensional bipartite inclusion graph. The diameter, girth, clique number, covering number, independence number and matching number are studied and the properties are shown, such as regular, planar and Eulerian. Moreover, the authors also introduce a new results about the structure and the number of 1-dimensional and n-1-dimensional subspaces on n-dimensional vector space.

Бесплатно

A System to Predict Emotion from Bengali Speech

A System to Predict Emotion from Bengali Speech

Prashengit Dhar, Sunanda Guha

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

Predicting human emotion from speech is now important research topic. One’s mental state can be understood by emotion. The proposed research work is emotion recognition from human speech. Proposed system plays significant role in recognizing emotion while someone is talking. It has a great use for smart home environment. One can understand the emotion of other who is in home or may be in other place. University, service center or hospital can get a valuable decision support system with this emotion prediction system. Features like-MFCC (Mel-Frequency Cepstral Coefficients) and LPC are extracted from audio sample signal. Audios are collected by recording speeches. A test also applied by combining self-collected dataset and popular Ravdees dataset. Self-collected dataset is named as ABEG. MFCC and LPC features are used in this study to train and test for predicting emotion. This study is made on angry, happy and neutral emotion classes. Different machine learning algorithms are applied here and result is compared with each other. Logistic regression performs well as compared to other ML algorithm.

Бесплатно

A Verifiable Ring Signature Scheme of Anonymous Signcryption Using ECC

A Verifiable Ring Signature Scheme of Anonymous Signcryption Using ECC

Pratik Gupta, Manoj Kumar

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

The ring signature does hide the member of actually signature in the all possible signer. This technique was introduced by Rivest, Tauman and Shamir in 2001. This paper presents elliptic curve cryptosystem using signcryption algorithm with the anonymity feature. In the present paper, combines ring signature scheme with signcryption method to produce the anonymity feature for the signcryption scheme and discuss the characteristic of the security. Because elliptic curve cryptosystem yields like as small bandwidth requirements, low computation load, and high security and methodology of ring signature gives without revealing the actual signer to all possible signers. Combining the benefits of these two methodology, the result is an efficient anonymous signcryption algorithm and highly secure.

Бесплатно

A facial expression recognition model using support vector machines

A facial expression recognition model using support vector machines

Sivaiah Bellamkonda, N.P. Gopalan

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

Facial Expression Recognition (FER) has gained interest among researchers due to its inevitable role in the human computer interaction. In this paper, an FER model is proposed using principal component analysis (PCA) as the dimensionality reduction technique, Gabor wavelets and Local binary pattern (LBP) as the feature extraction techniques and support vector machine (SVM) as the classification technique. The experimentation was done on Cohn-Kanade, JAFFE, MMI Facial Expression datasets and real time facial expressions using a webcam. The proposed methods outperform the existing methods surveyed.

Бесплатно

A mathematical model for capturing cholera spread and containment options

A mathematical model for capturing cholera spread and containment options

Falaye Adeyinka Adesuyi, Akarawak E.E.E., Cole A.T., Evans O. Patience, Oluyori David Adeyemi, Falaye Roseline Adunola, Adama Ndako Victor

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

The explosive nature of cholera epidemic over the years in different parts of the world has been a subject of interest to scientists in proffering interventions towards controlling its spread. Over the years many models has been created by the following people Capaso and Pavari – Fontana (1973), Codeco (2001), Hartley, Tien (2009), Mukandivare (2009) etc. In the present study, we modify the Cholera model proposed by Mukandivare incorporating three (3) containment options such as vaccination, Therapeutic treatment and water treatment and solved the system analytically using Homotopy Perturbation Method. The results shows that with improved use of vaccination, therapy and proper sanitation we have a more healthy population. This research is therefore recommended to modelers who desire to know how homotopy perturbation methods works. The computations were done and further analyzed mathematically using a computer symbolic package MAPLE 13.

Бесплатно

A new approach to the design of a finite automaton that accepts class of IPV4 addresses

A new approach to the design of a finite automaton that accepts class of IPV4 addresses

P.Sri Ram Chandra, K.S.Sravan, M.S.Chakravarthy

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

Theory of computation is characterized as calculation through the conceptual machines. The three essential unique machines utilized are Finite Automata, Pushdown Automata and Turing Machine. In this paper we propose an outline of Finite Automata that accepts the class of IPV4 Addresses.

Бесплатно

A new credibilistic clustering method with mahalanobis distance

A new credibilistic clustering method with mahalanobis distance

Ahad Rafati, Shahin Akbarpour

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

The fuzzy c-means (FCM) is the best known clustering and use the degree of membership fuzzy to data clustering. But the membership is not always for all data correctly. That is, at scattered dataset belonging is less and noisy dataset belonging is more assigned and local optimization problem occurs. Possibility c-means (PCM) was introduced to correspond weaknesses FCM approach. In PCM was not self-duality property. In other words, a sample membership for all clusters be assigned more than one and basic condition FCM were violated. One of the new method is Credibilistic clustering and based on credibility theory proposed that is used to study the behavior of fuzzy phenomenon. The aim is to provide new Credibilistic clustering approach with replacing credibility measure instead of the fuzzy membership and Mahalanobis distance use in FCM objective function. Credibility measure has self-duality property and solves coincident clustering problem. Mahalanobis distance used instead of Euclidian distance to separate cluster centers from each other and dens samples of each cluster. The result of proposed method is evaluated with three numeric dataset and Iris dataset. The most important challenge will be how to choose the initial cluster centers in the noisy dataset. In the future, we can be used FCM combined with particle swarm optimization.

Бесплатно

A numerical approach for solving high-order boundary value problems

A numerical approach for solving high-order boundary value problems

Falade K.I

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

In this paper, a numerical method which produces an approximate solution is presented for the numerical solutions of sixth,eighth,ninth and twelfth order boundary value problems. With the aid of derivatives of power series which slightly perturbe and collocate, eventually converts boundary value problems into the square matrix equations with the unknown coefficients obtain using MAPLE 18 software. This method gives the approximate solutions and compare with the exact solutions. Finally, some examples and their numerical solutions are given by comparing the numerical results obtained to other methods available in the literature, show a good agreement and efficiency.

Бесплатно

A secure communication scheme using generalized modified projective synchronization of coupled Colpitts oscillators

A secure communication scheme using generalized modified projective synchronization of coupled Colpitts oscillators

Kammogne Soup Tewa Alain, Fotsin Hilaire Bertrand

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

A new scheme for secure information transmission is proposed using the generalized modified projective synchronization (GMPS) method. The linear transformation of the modified Colpitts oscillator, first introduced in Cristinel and Radu (Low-Power Realizations of Secure Chaotic Communication Schemes. IEEE Asia Pacific Conference on Circuits and Systems, 2000) is investigated prior to the more detailed study by Kammogne et al. (Journal of chaos. (2014). doi: 10.1155/2014/659647). This circuit is employed to encrypt the information signal. In the receiver end, by designing the controllers and the parameter update rule, GMPS between the transmitter and receiver systems is achieved and the unknown parameters are estimated simultaneously. Based on the Lyapunov stability theory, the controllers and corresponding parameters update rule are constructed to achieve generalized modified projective synchronization between the transmitter and receiver system with uncertain parameters. The original information signal can be recovered successfully through some simple operations by the estimated parameter. The message signal can be finally recovered by the identified parameter and the corresponding demodulation method. Numerical simulations are performed to show the validity and feasibility of the presented secure communication scheme.

Бесплатно

A systematic expository review of Schmidt-Samoa cryptosystem

A systematic expository review of Schmidt-Samoa cryptosystem

Qasem Abu Al-Haija, Mohamad M.Asad, Ibrahim Marouf

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

Public key cryptographic schemes are vastly used to ensure confidentiality, integrity, authentication and non-repudiation. Schmidt-Samoa cryptosystem (SSC) is a public key cryptosystem, which depends on the difficulty of large integer factorization problem. The implementation of SSC to secure different recent communication technologies such as cloud and fog computing is on demand due to the assorted security services offered by SSC such as data encryption/decryption, digital signature and data integrity. In this paper, we provide a systematic review of SSC public key cryptosystem to help crypto-designers to implement SSC efficiently and adopt it in hardware or software-based applications. According to the literature, the effective utilization and design SSC can place it as a viable alternative of RSA cryptosystems and many others.

Бесплатно

Журнал