Search

In this work, some new classes of neutrosophic (1,2)-maps are investigated and discussed their basic attributions in neutrosophic bi-topological space (NBTS). In this paper, the relationships among these classes like neutrosophic (1,2)-continuous/ open/ strongly open/ generality open/ maps are discussed. Moreover, our work in this paper is examined and some examples are shown to support this research. [ABSTRACT FROM AUTHOR]

Most enterprises host their critical data in data centers to have a secure, robust environment supporting the highest uptime for their IT operations. As per industry best practices, standards, conference papers and journals; there are various ways suggested through which efficiency of data center is calculated. This review paper provides information on the efficiency calculation factors relatum to data center loads and its classification. It describes how measurement of data center efficiency is to be done and which are the crucial components which need to be considered for calculating the true values accurately for power usage efficiency (PUE) and data center infrastructure efficiency (DCiE).Basis on researchfindings & working towards data center efficiency measurement, the future research scope has been identified that how various techniques can be applied on data center major components - Power & Cooling which further can be helpful towards improvement of Data Center efficiency. [ABSTRACT FROM AUTHOR]

An mk-graph of a graph G is defined by taking m ≥ 2 copies G1, ... , Gm of a graph G in which every vertex uh of copy Gh is adjacent to a corresponding vertex vm of copy Gm. An mk-graph is represented by mk(G). In this paper we work on some degree based connectivity indices of subdivided mk-graph generated by ladder and triangular ladder graph. Also closed formulas for computing various degree based topological indices of said families of graphs have been presented. [ABSTRACT FROM AUTHOR]

In this paper, an improved energy balance method has been presented to obtain an analytical approximate solution to investigate a conservative non-linear oscillator having inertia and static non-linearity. The method is valid for both small and large amplitudes of oscillation. Although the trial solution of the present paper is the same as Khan and Mirzabeigy (2014), the solution procedure is different. Moreover, the algebraic equations appeared in the present technique are solved analytically. The results obtained in this paper are compared with other existing results. The present method not only gives better result than other existing result but also gives perfect agreement with the numerical result (considered to be exact result). [ABSTRACT FROM AUTHOR]

Calculus is the subject of evaluating derivatives and integrals of non-integer orders of a given function, fractional differential equations is the subject of studying the solution of differential equations of fractional order is considered in this paper, which contain initial conditions. The general form of a fractional differentia equation is supported by: y(s) = k(c, u), y(stk) (c0) = u. Where k = 1, 2, ... , n + 1, n < q < n + 1, and n is an integer number. The solution of fractional differential equations has so many difficulties in their analytic solution, therefore numerical methods may be in most cases be the suitable method of solution. This paper introduces and study a numerical solution by ADI methods for solving fractional differential equations. We used the matrix obtained from this solution as a key matrix for cryptography the plain text and transform it to cipher text by using the method of Hill matrix system the quantity demand and investment in research and development, while the other model focuses on a more realistic relationship between the quantity demand and the price. [ABSTRACT FROM AUTHOR]

Recently cryptography is one of the essence areas of study. There are two types of cryptography, this paper is concerned with the simplest and fastest which is "Symmetric Key Cryptography". Symmetric encryption text information is widely known as an effective and secure method for the purpose of secure transmission. In this paper, we present a new symmetric encryption scheme for text encryption and decryption based on Karhunen Loeve transform, where Karhunen Loeve transform is a reversible linear transform. The time complexity of the proposed scheme is calculated for both encryption and decryption. The proposed scheme has an has efficiency according to the security measures. [ABSTRACT FROM AUTHOR]

In this paper; we study the relationship between two modules in module theory namely injective and pseudo valuation modules. We investigated that every module has three properties which are noetherian, cyclic and regular is pseudo valuation modules. Also, if R is an Artinian ring and E is finitely generated regular module, it implies that E is (P.V.M). We proved that for an R-module E, if R is a commutative ring with E is a Noetherian, Artinian and regular module, then E is P.V.M. Finally, some definitions and new results have introduced in this paper. [ABSTRACT FROM AUTHOR]

An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, ... ,|E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = ∑f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. Let χ(G) be the chromatic number of G. In this paper, sharp upper and lower bounds of χla(G) for G with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for k ≥ 1, there are infinitely many graphs with k ≥ χ(G) - 1 pendant vertices and χla(G) = k + 1. The work of this paper leads to conjecture and problem on graphs with pendant(s). [ABSTRACT FROM AUTHOR]

Let T = (V, E) be a tree of order n. Let f : E → {1, 2, 3, ... } be an injective edge labeling of T. The weight of a path P is the sum of the labels of the edges of P and is denoted by w(P). If the set of weights of the paths in T is , then f is called a Leech labeling of T and a tree which admits a Leech labeling is called a Leech tree. In this paper, we introduce a new parameter called Leech index which gives a measure of how close a tree is towards being a Leech tree. Let f : E → {1, 2, 3, ... } be an edge labeling of T such that both f and w are injective. Let S denote the set of all weights of the paths in T. Let kf be the positive integer such that {1, 2, 3, ... , k f } ⊆ S and kf + 1 ∉ S. Then k(T) = max kf, where the maximum is taken over all such edge labelings f is called the Leech index of T. In this paper, we determine the Leech index of several families of trees and obtain bounds for this parameter. [ABSTRACT FROM AUTHOR]

This paper focuses on the mathematical model based on the input output realization with a view to analyzing the time-invariant dynamical behaviour of the blood flow through carotid artery. The entire system's characteristic is governed by the Navier-Stokes equation which is represented in this paper as differential-algebraic matrix representation. This mathematical representation is commonly known as state space model that is extracted from the Taylor-hood finite element discretization of the physical model. Later, for computational convenient, this model is divided into different sub-blocks studying the sparsity patterns of the matrices each of which contains the system's parameters responsible for any dynamical changes. This form is well-known as index-II descriptor data model representing the relationship between the input external force applying to the artery's boundary and the output measuring the changes in the blood velocity and the pressure. Based on the input-output realization, MATLAB interface is used to carry out numerical experiments and the results illustrate the numerical behaviour of the generated state space model for analyzing the blood flow nature through carotid artery. [ABSTRACT FROM AUTHOR]

Cloud computing is the on-demand availability of a group of networked elements providing services, especially data storage and computing power, without actual management and addressing by the user. In lieu, the entire suite of hardware and software is managed by a provider and have functions dispersed over various location, each location being a data center. Since cloud computing users rely on sharing resources and may request multiple cloud services concurrently, a dynamic provision must be there so that all the resources are available to the user in a competent manner. However, despite abundantly available benefits, many organizations are still skeptical about using the cloud computing service model because of security concerns associated with the service. The paper also discusses different types of cloud security, controls of cloud security and algorithms used for emanating the privacy of the client's data. In this paper, a CNN and SVM model is also applied for detection Anti-Spoofing images for identification on images on cloud. [ABSTRACT FROM AUTHOR]

Sharing information from one device to another is gradually replacing hand-to-hand paper work in this connected digital age. Digital, modern technology are used to control the data communication. Because of this, the pace of a device's cyber security is presently fast increasing. DDoS(Distributed Denial-of-Service), is one such phenomenon. TCP (Transmission Control Protocol) Half-open attacks include an SYN(Synchronization) flood attacks. It is a form of distributed denial of service attack that seeks to block all valid communication to a server in order to available server resources. This paper aims to protect the communication from DDoS TCP SYN flood attack. There are many research papers which can detect the attack after the attack take place and the prevention percentage is low. In this research paper this attack can be prevented much well than other model because a flood attack can detect before hampering the server and deny the connection attempt. There will be two cases studied and solved here that SYN-ACK(Synchronization-Acknowledgement) lost (no destination), SYN-ACK—no response. [ABSTRACT FROM AUTHOR]

In the number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. It noticed by Euler and Legendre and proved by Gauss. In this paper, we will study the quadratic reciprocity law theorem where the Euler Criterion and Legendre Symbol are involved. The application of quadratic reciprocity law theorem is given in cryptography, where the Quadratic Residuosity Problem considered as a hard mathematical problem for Goldwasser Micali Randomized Public Key Cryptosystem. This system will be discussed with the details in this paper. [ABSTRACT FROM AUTHOR]

The current stage in the development of cryptography is characterized by attention of researchers to the methods of many-valued logic. Of particular importance are the methods of three-valued logic, which are used in quantum cryptography, as well as in three-valued cryptographic algorithms with an increased level of cryptographic strength, implemented on binary computers. This circumstance leads to the need for further improvement of methods for constructing of high-quality cryptographic primitives. This paper is devoted to the generalization of definition of the correlation immunity of three-valued logic functions in the context of the properties of matrices of correlation coefficients of S-boxes built on their basis. The paper proposes methods for the synthesis of complete classes of 3-functions of length N = 9, the output of which does not depend on the input variable x1 or x2, as well as the full set of correlation immune 3-functions. The relationship between the introduced criterion of the correlation immunity of 3-functions and the criterion for the absence of a correlation interconnection between the output and input vectors of S-boxes of length N = 9 is also established. [ABSTRACT FROM AUTHOR]

In this paper, authors defined a conical open set's characterization. As a consequence, they introduced the (- space and - space)-open subdigraph in graph theory. Their interrelationships were investigated. As a result, several theorems have been proven. The aim of this paper, is to find graph theory applications due to the difficulty in finding applications in topological spaces, which are pure mathematics branches. We defined a conical open set's characterization. As a consequence, we introduced the (space and - space)-open subdigraph in graph theory. Their interrelationships were investigated. As a result, several theorems have been proven. [ABSTRACT FROM AUTHOR]