﻿Research Journal of Mathematics and Computer Science (ISSN:2576-3989)

Research Journal of Mathematics and Computer Science

An approximation algorithm for minimizing congestion in the single-source k-splittable flow

Research Article of Research Journal of Mathematics and Computer Science An approximation algorithm for minimizing congestion in the single-source k-splittable flow Chengwen Jiao*, Qi Feng, Weichun Bu College of Science, Zhongyuan University of Technology, Zhengzhou, Henan 450007, People’s Republic of China In the traditional multi-commodity transmission networks, the number of paths each commodity can use is unrestricted, and the commodities can use arbitrary number of paths to transmit the flow. However, in the real transmission networks, too many paths will increase the total transmission cost of the network and also cause difficulties in the management of the network. In 2002, Baier[1] proposed the-splittable flow problem, in which each commodity can only use a limited number of paths to transmit the flow. In this paper, we study the-splittable multi-commodity transmission flow problem with the objective of minimizing congestion and cost. We propose an approximation algorithm with performance ratio  for congestion and cost in the single-source case, in which is the minimum value of the number of paths each commodity can use. The congestion reflects the total load of the network to some extent. The main aim of minimizing congestion is to distribute the demands of the commodities on the network in a balanced way, avoiding the case that some edge is used too much. By this way, the performance of the network as a whole can be guaranteed and more commodities can be served. Keywords: k-splittable flow, congestion minimization, approximation algorithm ...

Application of the Discrete Geometrical Invariants to the Quantitative Monitoring of the Electrochemical Background

Research Article of Research Journal of Mathematics and Computer Science Application of the Discrete Geometrical Invariants to the Quantitative Monitoring of the Electrochemical Background R. R. Nigmatullin1, H. C. Budnikov2, A. V. Sidelnikov3, E. I. Maksyutova3 1Radioelectronic and Informative-Measurements Techniques Department, Kazan National Research Technical University (KNRTU-KAI)K. Marx str. 10. , 420011, Kazan, Tatarstan, Russian Federation; 2A.M. Butlerov Institute of Chemistry, Kazan Federal University (KFU), Kazan, Russian Federatio; 3Chemistry Department, Bashkir State University, Ufa, Russian Federation In this paper, we apply the statistics of the fractional moments (SFM) and discrete geometrical sets/invariants (DGI) for explain of the temporal evolution of the electrochemical background. For analysis of this phenomenon, we apply the internal correlation factor (ICF) and proved that integral curves expressed in the form of voltammograms (VAGs) are more sensitive in comparison with their derivatives. For analysis of the VAGs (integral curves), we propose the set of the quantitative parameters that form the invariant DGI curves of the second and the fourth orders, correspondingly. The method of their calculation based on the generalization of the well-known Pythagor’s theorem is described. The quantitative parameters that determine these DGI allow monitoring the background of the electrochemical solution covering the period of 1-1000 measurements for two types of electrode (Pt and C) and notice the specific peculiarities that characterize each electrode material. The total set of 1000 measurements was divided on 9 parts (1-100, 101-200, 201-300, …, 901-1000) and the duration of each hundred set was 1300 sec. The proposed algorithm is sensitive and has a “universal” character. It can be applied for a wide set of random curves (experimental measurements) that are needed to be compared in terms of a limited number of the integer moments. The qualitative peculiarities of the background behavior for two types of electrodes (Pt and C) based ...

An Implementation of a One-Time Pad Encryption Algorithm for Data Security in Cloud Computing Environment

Research Article of Research Journal of Mathematics and Computer Science An Implementation of a One-Time Pad Encryption Algorithm for Data Security in Cloud Computing Environment Omotunde Ayokunle A*1, Faith Adekogbe2, Onuiri Ernest3, Precious Uchendu4 1Computer Science Department, Babcock University, Ilishan-Remo, Ogun State, Nigeria. 2Computer Science Department, Babcock University, Ilishan-Remo, Ogun State, Nigeria 3Computer Science Department, Babcock University, Ilishan-Remo, Ogun State, Nigeria 4Computer Science Department, Babcock University, Ilishan-Remo, Ogun State, Nigeria The cloud is a computing model used by many consumers which include individuals and organizations for data storage which hitherto demands that adequate security measures be put in place to protect the confidentiality and integrity of that information. In cases where these security measures are inefficient or in some cases non-existent, client data is prone to a number of unauthorized violations which include breach of privacy, loss of data, compromised data integrity, and data manipulation among others. This therefore necessitates the demand for efficient security measures. Encryption is a security technique adopted by many for data protection which entails concealing the information content of a message in a way that only the intended recipient can make use of it. This research paper discusses the concept of encryption, a review of different encryption schemes that have been discussed over the years, and proposes a one-time pad encryption (OTP) algorithm (FAPE’s OTP). FAPE’s OTP implements the one time pad using a key expansion process that transforms a 512 bit key to the length of the plaintext. This research was carried out through a comprehensive study of encryption and cloud processes to understand both concepts independently and determine how they can be interleaved while sustaining optimum delivery. Furthermore, our findings indicate that FAPE’s OTP has a faster speed of operation in comparison to the Advanced Encryption Standard. Keywords: Data Storage, Security, Encryption, One-Time ...

Expert System Model for Diagnosing Legume Diseases

Research Article of Research Journal of Mathematics and Computer Science Expert System Model for Diagnosing Legume Diseases Rahmon,I.A,Adebola_Akinsanya and Eze M.,. Computer Science Department Babcock University, Ilishan, Ogun State. There is a current surge in designing expert systems to solve problems like humans in different domains of research but there presently exist dearth of models that can guide designers of expert systems that can be used to accurately diagnose Soya beans diseases. Soya bean is a leguminous plant that is commonly grown in sub Saharan region and it is currently one of the legumes with high Gross Domestic Product (GDP) in the Nigerian economy, but farmers of this product are faced with serious challenges from legume ravaging diseases that are usually similar in symptoms and very difficult to diagnose by the few practising botanist available. Most models available cannot be used to guide designers who are interested in developing secured and reliable expert systems that can accurately classify, identify, diagnose and recommend treatments for Soya beans diseases. The main aim of this paper is to review existing models that are currently being used in designing expert systems and identify their limitations in other to come up with a better, more reliable and secured model. In other to identify inherent gaps from other models, research review method was adopted to critically investigate the weak points in few related and current expert models for classifying and diagnosing legumes diseases. Keywords: expert system model, diagnosing legume diseases ...

Dr. S. Krishna Murthy
Associate Professor, Department of Applied Mathematics, Defence Institute of Advanced Technology, Deemed University(DU), Girinagar, Pune

Dr. S. Arivoli
Assistant Professor/EEE, VSB College of Engineering Technical Campus, Coimbatore

Dr. ABHISHEK SHUKLA
Assistant Professor, R.D. Engineering College Technical Campus, Ghaziabad

Dr. Sagar Chandrakant Jirapure
Assistant Professor, Mechanical Engineering Department, Jawaharlal Darda Institute of Engg and Technology.Yavatmal

Dr. Harish Nagar
Associate Professor, School of Basic and Applied Sciences, Sangam University

Dr. Vaibhav Sundriyal
Research Scientist, Old Dominion University research Foundation, USA

Dr. Mehmet Fatih Karaaslan
Statistics Department, Yildiz Technical University, Turkey

Dr. Faisal G. Khamis
Associate Professor, Department of Accounting and Finance & Banking, College of Business, Al Ain university of Science and Technology

Dr. G.N.Balaji
Assistant Professor, Dept. of Computer Science and Engineering, Cvr college of engineering, Hyderabad

Dr. S. Sathish
Assistant Professor and Head, Dept. of Automobile Engineering, Vels University, Pallavaram, Chennai.

Dr. Bingxu Wang
Automotive Tribology Center (ATC), School of Engineering and Computer Science, Oakland University

Dr. Yashar Hashemi
Ph.D in Electrical Power Engineering, Coding and Diagram Expert

Dr. Alfred DACI
Polytechnic University of Tirana, Mathematical and Physical Engineering Faculty, Department of Mathematics

Dr. Pushpraj Pal
Assistant Professor, SRM IET Ambala

Manuscript Title: The title should be a brief phrase.

Author Information: List full names and affiliation of all authors, including Emails and phone numbers of corresponding author.

Abstract: The abstract should be less than 500 words. Following abstract, a list of keywords and abbreviations should be added. The keywords should be no more than 10. Abbreviation are only used for non standard and long terms.

Introduction: The introduction should included a clear statement of current problems.

Materials and Methods: This section should be clearly described.

Results and discussion: Authors may put results and discussion into a single section or show them separately.

Acknowledgement: This section includes a brief acknowledgment of people, grant details, funds

References: References should be listed in a numbered citation order at the end of the manuscript. DOIs and links to referenced articles should be added if available. Abstracts and talks for conferences or papers not yet accepted should not be cited. Examples Published Papers:

1.S.E. Fadugba and T. E. Olaosebikan. Comparative Study of a Class of One-Step Methods for the Numerical Solution of Some Initial Value Problems in Ordinary Differential Equations. Research Journal of Mathematics and Computer Science, 2018; 2:9. DOI:10.28933/rjmcs-2017-12-1801
2.Ahmad Hamza Al Cheikha.Generating New Orthogonal Binary Sequences Using Quotient Rings Z/pm Z. Research Journal of Mathematics and Computer Science, 2018; 2:11.DOI:10.28933/rjmcs-2018-01-2901

Tables and figures: Tables should be used at a minimum with a short descriptive title. The preferred file formats for Figures/Graphics are GIF, TIFF, JPEG or PowerPoint.

Proofreading and Publication: A proof will be sent to the corresponding author before publication. Authors should carefully read the proof to avoid any errors and return the proof to the editorial office. Editorial office will publish the article shortly and send a notice to authors with the links of the paper.

Open Access
Research Journal of Mathematics and Computer Science is a peer reviewed open access journal publishing research manuscripts, review articles, editorials, letters to the editor in Mathematics and Computer Science (Indexing details).

Peer Review
To ensure the quality of the publications, all submitted manuscripts will be peer-reviewed by invited experts in the field. The decisions of editors will be made based on the comments of the reviewers.

Rapid Publication
Time to first decision: within 2 days for initial decision without review, 18 days with review; Time to publication: Accepted articles will be published online within 2 days, and final corrected versions will be accessible within 5 days. More details....

Rapid Response Team
Please feel free to contact our rapid response team if you have any questions. Our customer representative will answer you shortly.