The author, ATHAR KHARAL, defined the Euclidean distance using the symmetric difference of sets in soft space, however, we conclude that all the sets of "ε-approximate elements among the soft sets can't calculate their symmetric di erence in this way. To illustrate our point, in this paper, we define the finite(countable) soft topological space, and point out the Euclidean distance given by ATHAR KHARAL can just be applied to the countable soft space. Meanwhile, we give the general definition of the metric soft topological space, test the Euclidean distance being a metric in a countable soft topological space, and achieve a metric countable soft topology.
Since there are many procedural high level languages exists such as C, C++ etc. though we found many issues or drawbacks  that make these languages inefficient and slow in term of processing the real scenario programming. In this paper we have discussed why RAKS M. PLUS is better, efficient and more secure than other programming languages by explaining the working mechanism of this programming language. With the help of this paper we put your effort to focus on those issues that make the processing slow of any programming and how by taking a step that make the programming processing fast for the future deployment and advancement point of view. Also we try to create a new programming language RAKS. M. PLUS which deals with security problems to make it more efficient. Comparative study and analysis using C, C++ language platform . Department of Computer Science and Electronics & Communication Engineering, Since December 2012 to December 2014 in Simulation Lab, Cambridge Institute of Technology, Ranchi, Jharkhand, India. Since this language provides an environment for designing the kernel RAK M. PLUS which will provide fast compilation or processing of real scenario programming as well as wallet to store some user beneficial details. Reverse engineering followed to recreate the program and also to weak the existing deficiencies. Important steps against decomposition process used in the program to understand the code functionality, correcting code and also to secure the performance smartly. Apart from that improved SQL injection method used in web application for security vulnerability. Inbuilt function has been used instead of header file and this will help to decrease the execution time up to 40-50 percentages as compared to Turbo / Borland C++. The result will be purely depend upon user’s application and improves the performance level of execution. This language proves to be efficient in terms of time consumption, fast, secure and user friendly from student to scholar level.
The analysis of well test data for deviated wells penetrating layered reservoirs is usually a challenging problem due to the complexity of interlayer flow within reservoirs. These problems are as a result of insufficient data from unique layer flow into the wellbore. The aim of this work is to present a new analytical pressure-transient solution for deviated wells (0° ≤ θW ≤ 12°) in layered reservoirs with cross-flow. The individual layer skin property was also investigated. Green’s function for the layered system was obtained by Laplace transformation and double Fourier cosine transform. The wellbore was discretized into several segments and each segment was treated as a uniform flux source, a linear system was set up and the pressure drop solution was obtained in the Laplace space and transformed back to the real space. The nonlinear parameter estimation method was applied as a means to determine the layered skin. Applying the model to field data obtained from published works; the pressure derivative curves indicated that the early-time behaviours of reservoirs are totally different even with little change in well inclination (except the bottom boundary is set as constant pressure), but late-time behaviours (radial flow) are very similar for all the cases. The results also showed that early time pressure drop in commingled reservoirs is much higher than that of cross-flow reservoirs, because the wellbore sees the boundary (interfaces between layers) earlier. Finally, the pressure responses of reservoirs are sensitive to the thickness of the layers.
Despite massive efforts by regional governments and partners in the East and Central African region towards fighting Xanthomonas Wilt of banana, the disease is reported to continue to spread to new areas and resurge in others it had been contained. The use of asymptomatic but infectious plants is hypothesized to play a leading role in the persistence of the disease and it's introduction to new areas. A model for the transmission of BXW by symptomless plants is proposed and analyzed. It incorporates both horizontal and vertical transmission modes and a dual source of inoculum in the force of infection. The basic reproduction number, R0, is obtained and it is found to completely determine the global dynamics of the model. By construction of a suitable Lyapunov function for the second additive compound system, the global stability of the endemic equilibrium is established.
Numerical simulation and sensitivity analysis of the basic reproduction number indicate that the disease is mainly driven by parameters involving asymptomatic plants rather than symptomatic ones.
In this paper, we propose a multilevel least square support vector machine (LSSVM) for solving elliptic boundary value problems based on wavelet kernel functions. This algorithm is constructed by a sequence of residual corrections and separating the computations of different levels, where different scale parameters are employed to accommodate different scales. In this multilevel algorithm, a coarse data set and a large scale parameter are chosen and the target function is interpolated in this data set to capture the large-scale variations of the target function at the first level, next, a smaller scale parameter is used to interpolate the residuals on a ner data set, capturing the finer details on the second level. The numerical tests on some linear second order elliptic boundary value problems show the efficiency of the multilevel algorithm.