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

Все статьи: 119

A Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems

A Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems

Akash Nag

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

The subset sum problem is to decide whether for a given set of integers A and an integer S, a possible subset of A exists such that the sum of its elements is equal to S. The problem of determining whether such a subset exists is NP-complete; which is the basis for cryptosystems of knapsack type. In this paper a fast heuristic algorithm is proposed for solving subset sum problems in pseudo-polynomial time. Extensive computational evidence suggests that the algorithm almost always finds a solution to the problem when one exists. The runtime performance of the algorithm is also analyzed.

Бесплатно

A Fuzzy Approach for Text Mining

A Fuzzy Approach for Text Mining

Deepa B. Patil, Yashwant V. Dongre

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

Document clustering is an integral and important part of text mining. There are two types of clustering, namely, hard clustering and soft clustering. In case of hard clustering, data item belongs to only one cluster whereas in soft clustering, data point may fall into more than one cluster. Thus, soft clustering leads to fuzzy clustering wherein each data point is associated with a membership function that expresses the degree to which individual data points belong to the cluster. Accuracy is desired in information retrieval, which can be achieved by fuzzy clustering. In the work presented here, a fuzzy approach for text classification is used to classify the documents into appropriate clusters using Fuzzy C Means (FCM) clustering algorithm. Enron email dataset is used for experimental purpose. Using FCM clustering algorithm, emails are classified into different clusters. The results obtained are compared with the output produced by k means clustering algorithm. The comparative study showed that the fuzzy clusters are more appropriate than hard clusters.

Бесплатно

A Hybrid Approach based on Classification and Clustering for Intrusion Detection System

A Hybrid Approach based on Classification and Clustering for Intrusion Detection System

Jasmeen K. Chahal, Amanjot Kaur

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

Computer security plays an important role in everybody's life. Therefore, to protect the computer and sensitive information from the untrusted parties have great significance. Intrusion detection system helps us to detect these malicious activities and sends the reports to the administration. But there is a problem of high false positive rate and low false negative rate. To eliminate these problems, hybrid system is proposed which is divided into two main parts. First, cluster the data using K-Mean algorithm and second, is to classify the train data using Adaptive-SVM algorithm. The experiments is carried out to evaluate the performance of proposed system is on NSL-KDD dataset. The results of proposed system clearly give better accuracy and low false positive rule and high false negative rate.

Бесплатно

A Multi-view Comparison of Various Metaheuristic and Soft Computing Algorithms

A Multi-view Comparison of Various Metaheuristic and Soft Computing Algorithms

Abdulrahman Ahmed Bobakr Baqais

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

AI algorithms have been applied in a wide spectrum of articles across different domains with great success in finding solutions. There is an increasing trend of applying these techniques on newer problems. However, the numerous numbers of algorithms that are classified as AI algorithm hinder the ability of any researcher to select which algorithm is suitable for his problem. The invention of new algorithms increases the difficulty for researchers to be updated about AI algorithms. This paper is intended to provide a multi-facet comparison between various AI algorithms in order to aid researchers in understanding the differences between some of the popular algorithms and select the suitable candidate for their problems.

Бесплатно

A Natural Language Query Builder Interface for Structured Databases Using Dependency Parsing

A Natural Language Query Builder Interface for Structured Databases Using Dependency Parsing

Rohini Kokare, Kirti Wanjale

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

A natural language query builder interface retrieves the required data in structured form from database when query is entered in natural language. The user need not necessarily have sufficient technical knowledge of structured query language statements so nontechnical users can also use this proposed model. In natural language parsing, getting highly accurate syntactic analysis is a crucial step. Parsing of natural languages is the process of mapping an input string or a natural language sentence to its syntactic representation. Constituency parsing approach takes more time for parsing. So, natural language query builder interface is developed in which the parsing of natural language sentence is done by using dependency parsing approach. Dependency parsing technique is widespread in natural language domain because of its state-of-art accuracy and efficiency and also it performs best. In this paper, the buffering scheme is also proposed for natural language statements which will not load the whole sentence if it was done previously. Also there was a need of generalized access to all tables from database which is handled in this system.

Бесплатно

A New Method of Generating Optimal Addition Chain Based on Graph

A New Method of Generating Optimal Addition Chain Based on Graph

K. Mani, M. Viswambari

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

In many number theoretic cryptographic algorithms, encryption and decryption is of the form xn mod p, where n and p are integers. Exponentiation normally takes more time than any arithmetic operations. It may be performed by repeated multiplication which will reduce the computational time. To reduce the time further fewer multiplications are performed in computing the same exponentiation operation using addition chain. The problem of determining correct sequence of multiplications requires in performing modular exponentiation can be elegantly formulated using the concept of addition chains. There are several methods available in literature in generating the optimal addition chain. But novel graph based methods have been proposed in this paper to generate the optimal addition chain where the vertices of the graph represent the numbers used in the addition chain and edges represent the move from one number to another number in the addition chain. Method 1 termed as GBAPAC which generates all possible optimum addition chains for the given integer n by considering the edge weight of all possible numbers generated from every number in addition chain. Method 2 termed as GBMAC which generates the minimum number of optimum addition chains by considering mutually exclusive edges starting from every number. Further, the optimal addition chain generated for an integer using the proposed methods are verified with the conjectures which already existed in the literature with respect to addition chains.

Бесплатно

A Note on Quasi-coincidence for Fuzzy Points of Fuzzy Topology on the Basis of Reference Function

A Note on Quasi-coincidence for Fuzzy Points of Fuzzy Topology on the Basis of Reference Function

Kangujam Priyokumar Singh, Bhimraj Basumatary

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

In this article our main aim is to revisit the definition of fuzzy point and fuzzy quasi-coincident of fuzzy topology which is accepted in the literature of fuzzy set theory. We analyse some results and also prove some proposition with extended definition of complementation of fuzzy sets on the basis of reference function and some new definitions have also been introduced whenever possible. In this work the main efforts have been made to show that the existing definition of complement of fuzzy point and definition of fuzzy quasi-coincident are not acceptable.

Бесплатно

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 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 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 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.

Бесплатно

An Application of the Two-Factor Mixed Model Design in Educational Research

An Application of the Two-Factor Mixed Model Design in Educational Research

O.A Nuga

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

As with any ANOVA, a repeated measure ANOVA tests the equality of means. However, a repeated measure ANOVA is used when all members of a random sample are measured under a number of different conditions. As the sample is exposed to each condition in turn, the measurement of the dependent variable is repeated. Using a standard ANOVA in this case is not appropriate because it fails to model the correlation between the repeated measures: the data violate the ANOVA assumption of independence. Some ANOVA designs combine repeated measures factors and independent group factors. These types of designs are called mixed-model ANOVA and they have a split plot structure since they involve a mixture of one between-groups factor and one within-subjects factor. The work present an application of the mixed model factorial ANOVA, using scores obtained by 120 secondary school students in mathematics. The between group factor is the different categories of students (science, commercial humanities) with three levels while the within group factor is the three years spent in senior secondary School.

Бесплатно

An Approach of Securing Data using Combined Cryptography and Steganography

An Approach of Securing Data using Combined Cryptography and Steganography

Rosalina, Nur Hadisukmana

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

The recent advance in information technology field forcing us to ensure the privacy of the digital data. It is very important to develop the method that may satisfy the needs. Many methods/techniques applied to reach that goal. One of efficient way to reach that secrecy can be achieved by combining Cryptography and Steganography. In this paper, a new RGB shuffling method proposed. The concept of encryption using RGB Shuffling is shuffling all of RGB element to distort the image. RGB Shuffling method will shuffle the RGB each pixel of image depends on the input password from user. The basic step of RGB shuffling is adding RGB element with ASCII password, invers and shuffle it.

Бесплатно

Журнал