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

Все статьи: 198

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.

Бесплатно

Slow Invariant Manifold of Brusselator Model

Slow Invariant Manifold of Brusselator Model

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

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

The slow invariant manifold is a unique trajectory of the dynamical system that describes the long-time dynamics of the system’s evolution efficiently. Determining such manifolds is of obvious importance. On one hand they provide a basic insight into the dynamics of the system, on the other hand they allow a reduction of dimension of the system occurs on the invariant manifold only. If the dimension of the invariant manifold is sufficiently low, this reduction may result in substantial savings in computational costs. In this paper, differential geometry based new developed approach called the flow curvature method is considered to analyse the Brusselator model. According to this method, the trajectory curve or flow of any dynamical system of dimension considers as a curve in Euclidean space of dimension . Then the flow curvature or the curvature of the trajectory curve may be computed analytically. The set of points where the flow curvature is null or empty defines the flow curvature manifold. This manifold connected with the dynamical system of any dimension directly describes the analytical equation of the slow invariant manifold incorporated with the same dynamical system. In this article, we apply the flow curvature method for the first time on the two-dimensional Brusselator model to compute the analytical equation of the slow invariant manifold where we use the Darboux theorem to prove the invariance property of the slow manifold.

Бесплатно

Smart Contract Obfuscation Technique to Enhance Code Security and Prevent Code Reusability

Smart Contract Obfuscation Technique to Enhance Code Security and Prevent Code Reusability

Kakelli Anil Kumar, Aena Verma, Hritish Kumar

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

Along with the advancements in blockchain technology, many blockchain-based successful projects have been done mainly on the ethereum platform, most of which deal with transactions. Still, it also carries various risks when it comes to security, as evident from past attacks. Most big projects like uniswap, decentraland, and others use smart contracts, deployed on the ethereum platform, leading to similar projects via code reuse. Code reuse practice is quite frequent as a survey suggests 26% of contract code deployed is via code reuse. Smart contract code obfuscation techniques can be used on solidity code that is publicly verified, published (in the case of Ethereum), and on the deployment address. All the above techniques work by replacing characters with their random counterpart, known as statistical substitution. A statistical substitution is a process of transforming an input string into a new string where each character has been replaced by a random character drawn from a stock of all possible 'random' characters. Therefore, we proposed numerous methods in this paper to solve the above problems using various smart contract code obfuscation techniques. These techniques can be really useful in blockchain projects and can save millions of dollars to investors & companies by enhancing code security and preventing code reusability. Techniques mentioned in this paper when compared with other techniques. Our methods are not expensive to implement, very easy to use, and provide a developer-friendly selective increment in code complexity.

Бесплатно

Solving Bi-matrix Games in Tourism Planning Management under Rough Interval Approach

Solving Bi-matrix Games in Tourism Planning Management under Rough Interval Approach

M. G. Brikaa, El-Saeed Ammar, Zhoushun Zheng

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

The aim of this article is to propose a novel and simple technique for solving bi-matrix games with rough intervals payoffs. Since the payoffs of the rough bi-matrix games are rough intervals, then its value is also a rough interval. In this technique, we derived four bilinear programming problems, which are used to obtain the upper lower bound, lower lower bound, lower upper bound and upper upper bound of the rough interval values of the players in rough bi-matrix games which we called in this article as 'solution space'. Moreover, the expected value operator and trust measure of rough interval have been used to find the α-trust equilibrium strategies and the expected equilibrium strategies of rough interval bi-matrix games. Finally, numerical example of tourism planning management model is presented to illustrate the methodologies adopted and solution procedure.

Бесплатно

Some measures of picture fuzzy sets and their application in multi-attribute decision making

Some measures of picture fuzzy sets and their application in multi-attribute decision making

Nguyen Van Dinh, Nguyen Xuan Thao

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

To measure the difference of two fuzzy sets / intuitionistic sets, we can use the distance measure and dissimilarity measure between fuzzy sets. Characterization of distance/dissimilarity measure between fuzzy sets/intuitionistic fuzzy set is important as it has application in different areas: pattern recognition, image segmentation, and decision making. Picture fuzzy set (PFS) is a generalization of fuzzy set and intuitionistic set, so that it have many application. In this paper, we introduce concepts: difference between PFS-sets, distance measure and dissimilarity measure between picture fuzzy sets, and also provide the formulas for determining these values. We also present an application of dissimilarity measures in multi-attribute decision making.

Бесплатно

Sorting using a combination of bubble sort, selection sort & counting sort

Sorting using a combination of bubble sort, selection sort & counting sort

Sahil Kumar, Prerna Singla

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

One of the most important problems in computer science is the ordering of the data. Although sorting is a very old computer science problem, it still attracts a great deal of research. Usually, when we face a problem, we’re concerned with finding the solution, then getting it out of our heads and into a text editor, white-board, or down on a piece of paper. Eventually, we start transforming that idea into code, and the code is pretty terrible the first time around. But at some point, once we’ve made it work and made it right, we find ourselves asking: Can I make it fast? Can I make it better? This paper presents an enhanced sorting algorithm which comprises of a combination of Bubble Sort, Selection Sort, and Counting Sort. The new algorithm is analyzed, implemented, tested, compared and the results were promising.

Бесплатно

Stability analysis of equilibrium points of newcastle disease model of village chicken in the presence of wild birds reservoir

Stability analysis of equilibrium points of newcastle disease model of village chicken in the presence of wild birds reservoir

Furaha Michael Chuma, Gasper Godson Mwanga

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

Newcastle is a viral disease of chicken and other avian species. In this paper, the stability analysis of the disease free and endemic equilibrium points of the Newcastle disease model of the village chicken in the absence of any control are studied. The Hurwitz matrix criterion is applied to study the stability of the Newcastle disease free equilibrium point,Q0. The result shows that the disease free equilibrium point is locally asymptotically stable iff the principle leading minors of the Hurwitz Matrix, (for n∈ℝ+) are all positive. Using the Castillo Chavez Theorem we showed that, the disease free equilibrium point is globally asymptotically when R0-1. Furthermore, using the logarithmic function and the LaSalle’s Theorem, the endemic equilibrium point is found globally asymptotically stable for R0-1. Finally the numerical simulations confirm the existence and stability of the equilibrium points of the model. This reveals that, proper interventions are needed so as to decrease the frequently occurrence of the Newcastle disease in the village chicken population.

Бесплатно

Stochastic Rules in Nucleotide Sequences in Genomes of Higher and Lower Organisms

Stochastic Rules in Nucleotide Sequences in Genomes of Higher and Lower Organisms

S.V. Petoukhov, V.I. Svirin

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

The article presents new stochastic rules of nucleotide sequences in single-stranded DNA of eukaryotic and prokaryotic genomes. These discovered rules are candidates for the role of universal genomic rules. To reveal such rules, the authors represent any of genomic sequences in single-stranded DNA as a set of n parallel texts (or layers), each of which is written based on one of the different n-plets alphabets (n = 1, 2, 3, ...). Then comparison analysis of percentages of the 4n kinds of n-plets in the n parallel texts in such sequence is fulfield. In the result, unexpected stochastic rules of invariance of total sums of percentages for certain tetra-groupings of n-plets in different parallel texts of genomic DNA sequences are revealed.The presented rules significantly expand modern knowledge about stochastic regularities in long single-stranded DNA sequences, and they can be considered as generalizations of the second Chargaff's rule. A tensor family of matrix representations of interrelated DNA-alphabets of 4 nucleotides, 16 doublets, 64 triplets, and 256 tetraplets is used in the study. Some analogies of the discovered genetic phenomena with phenomena of Gestalt psychology are noted. The authors connect the received results about the genomic percentages rules with a supposition of P. Jordan, who is one of the creators of quantum mechanics and quantum biology, that life's missing laws are the rules of chance and probability of the quantum world.

Бесплатно

Study of memory effect in an inventory model with linear demand and shortage

Study of memory effect in an inventory model with linear demand and shortage

Rituparna Pakhira, Uttam Ghosh, Susmita Sarkar

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

For real market studies of any business, inclusion of memory or past experience in inventory model has great impact. Memory means it depends on the past state of the process not only current state of the process. Indeed, the inventory system is an appropriate example as a memory affected system. Presence of long past experiences or short past experiences of any company or shop has different importance on increasing or decreasing profit. The description of the memory dependent inventory model is more appropriate process compared to the memory less inventory model. Depending on demand rate, a comparison between the minimized total average costs of different numerical example has been presented. Fractional order derivative and integration have been used to establish the model. Our considered numerical example establishes that if linear type demand rate is only time proportional, profit of the business is high compared to the linear type demand rate.

Бесплатно

The Application of Meta-Heuristic Algorithms in Automatic Software Test Case Generation

The Application of Meta-Heuristic Algorithms in Automatic Software Test Case Generation

Maryam Mirzapour Moshizi, Amid Khatibi Bardsiri

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

Nowadays, software test is one of the most important activities that software's quality will be certified by it. Test operation includes program's implement on test case set and comparison of results with expected one. Manual test case for operation test program and error detect is time consuming with insufficient precision and complicated coverage of program, so, the use of algorithms in automatic test case generation has been considered. Meta-heuristic algorithms are known tools which are optimized and used in test case generation. Most of complicated matters need a lot of possible states assessment in order to reach the valid answer. With the proper answer, test case optimization and meta-heuristic algorithms play a constructive role. In this paper we would compare methods and their traits, and the software test case generation methods based on meta-heuristic algorithms with their description.

Бесплатно

The better pseudo-random number generator derived from the library function rand() in C/C++

The better pseudo-random number generator derived from the library function rand() in C/C++

Pushpam Kumar Sinha, Sonali Sinha

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

We choose a better pseudo-random number generator from a list of eight pseudo-random number generators derived from the library function rand() in C/C++, including rand(); i.e. a random number generator which is more random than all the others in the list. rand() is a repeatable pseudo-random number generator. It is called pseudo because it uses a specific formulae to generate random numbers, i.e. to speak the numbers generated are not truly random in strict literal sense. There are available several tests of randomness, some are easy to pass and others are difficult to pass. However we do not subject the eight set of pseudo random numbers we generate in this work to any known tests of randomness available in literature. We use statistical technique to compare these eight set of random numbers. The statistical technique used is correlation coefficient.

Бесплатно

Trend Analysis and Forecasting of Water Level in Mtera Dam Using Exponential Smoothing

Trend Analysis and Forecasting of Water Level in Mtera Dam Using Exponential Smoothing

Filimon Abel Mgandu, Mashaka Mkandawile, Mohamed Rashid

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

This study presents trend analysis and forecasting of water level in Mtera dam. Data for water level were obtained from Rufiji Basin Development Authority (RUBADA). The study analyzed trend of water level using time series regression while forecasting of water level in Mtera dam was done using Exponential smoothing. Results revealed that both maximum and minimum water level trends were decreasing. Forecasted values show that daily water level will be below 690 (m.a.s.l) which is the minimum level required for electricity generation on 2023. It was recommended that proper strategies should be taken by responsible authorities to reduce effects that may arise. Strategies my include constructing small dams on upper side of Mtera dam to harvest rain water during rainy season as reserves to be used on dry season. In long run Tanzania Electric Supply Company (TANESCO) should invest into alternative sources of energy.

Бесплатно

Use of the Ontological Model for Personification of the Semantic Search

Use of the Ontological Model for Personification of the Semantic Search

J. Rogushina

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

Semantic search is an important component of modern intelligent applications oriented on work in open information environment. The intelligence level of application depends of it's capabilities in knowledge processing and defines it's facilities. Now applications widely use ontologies for knowledge representation. Therefore criteria of intelligence level estimation (that can analyze ontologies) of applications and retrieval systems as their particular case are proposed. In this paper, an ontological model of the intelligent interaction of the main objects and subjects of the semantic search (the Web information resources, information objects and information consumers etc.) is developed. Software realization of semantic search on base of this ontological model and integration of this search instrument with applied systems are describes.

Бесплатно

Using Deep Learning Towards Biomedical Knowledge Discovery

Using Deep Learning Towards Biomedical Knowledge Discovery

Nadeem N. Rather, Chintan O. Patel, Sharib A. Khan

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

A vast amount of knowledge exists within biomedical literature, publications, clinical notes and online content. Identifying hidden, interesting or previously unknown biomedical knowledge from free text resources using an automated approach remains an important challenge. Towards this problem, we investigate the use of deep learning methods that have shown significant promise in identifying hidden patterns from large corpus of text in an unsupervised manner. For example, it can deduce that 'husband' - 'man' + 'woman' = 'wife'. We use the text corpus from MRDEF file in the Unified Medical Language System (UMLS) dataset as training set to discover potential relationships. To evaluate our approach, we cross-verify new relationships against the UMLS MRREL dataset and conduct a manual evaluation from a sample of the non-overlapping set. The algorithm found 32% of new relationships not originally represented in the UMLS. The deep learning methods provide a promising approach in discovering potential new biomedical knowledge from free text.

Бесплатно

Vertex Connected Domination Polynomial of some Coalescence of Complete and Wheel Graphs

Vertex Connected Domination Polynomial of some Coalescence of Complete and Wheel Graphs

Nechirvan Badal Ibrahim, Hariwan Fadhil M.Salih

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

In this paper, we introduce new results of vertex connected dominating set and vertex connected domination polynomial of vertex identification, edge introduced and t-tuple of complete graph, also we determine new results of vertex connected dominating set and vertex connected domination polynomial of vertex identification, edge introduced and t-tuple of wheel graph.

Бесплатно

Журнал