International Journal of Mathematical Sciences and Computing @ijmsc
Статьи журнала - International Journal of Mathematical Sciences and Computing
Все статьи: 258
Quantum Walk Algorithm to Compute Subgame Perfect Equilibrium in Finite Two-player Sequential Games
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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 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.
Бесплатно
Статья научная
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
Статья научная
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).
Бесплатно
Статья научная
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.
Бесплатно
Roman Domination in Semi-Middle Graphs: Insights and Applications in Computer Network Design
Статья научная
Consider a G=(V,E) and the function f :V -{0,1,2}. . Unguarded with regard to is defined as a node u with f (u) = 0 that is not next to a node with 1 or 2 . The function f (V0 ,V1,V2 ) fulfilling the condition, in which each node u for which f (u)=0 is adjoint to at least one node v to which f (v) =2 , is referred to be a Roman dominant function, known as RDF of a graph G . Roman domination number (RDN) of graph represented by rR (G), is the bare lowest count of guards that must be employed in any RDF. In this paper, we introduce a new form for graph called Semi-Middle Graph for any given graph and we find the RDN for the Semi - Middle Graph of some specific graphs. In the field of networking, the concept of the Semi-Middle Graph can be applied to network topology optimization. Specifically, it can be used in the design of communication networks where each direct connection (edge) between two nodes (devices or routers) has an intermediary node that facilitates more efficient data routing or enhances fault tolerance. Usefulness of Roman Domination Number of a Semi-Middle Graph in Networking includes Network Coverage and Monitoring, Fault Tolerance and Redundancy, Optimal Placement of Relays and Routers, Load Balancing and Resource Allocation.
Бесплатно
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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
Статья научная
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 Properties of Anti Imprecise Subgroup and its Application
Статья научная
Various authors from around the world have extended the fuzzy concept to study the uncertainty condition and define its degree of certainty in various real-life experiments. At the same time, many authors have discussed the shortcomings of the definition of fuzzy sets that currently exist. However, no author has properly highlighted the problem of not following the two main classical set theories logically. To address this issue, an imprecise set definition is introduced as an extended definition of fuzzy sets, where the new concept applies two parameters, namely the functions of membership and reference, instead of one, and is helpful in defining the uncertainty problem in a more convenient manner than the existing one. In our previous work, we have studied imprecise subgroup using this new concept addressed by Baruah. In this paper, using the concept of complement of imprecise subgroup, we have introduced anti imprecise subgroup and some properties of anti imprecise subgroup with examples. Imprecise subgroup is an extended version of fuzzy group theory developed using the definition of imprecise set defined by Baruah. In addition, we expected an application developed from an anti imprecise subgroup that can be used to resolve various networking problems.
Бесплатно
