In this paper, we answer two questions of Yoshioka [12]. We prove that every wγ, strongly quasi Nagata T2–space is metrizable; every regular c–semistratifiable quasi–γ, β–space is a Moore space.
This paper is focused on performing a new method for solving linear and nonlinear higher-order boundary value problems (HBVPs).This direct numerical method based on spectral method.The trial function of this method is the Monic Chebyshev polynomials (MCPs).This method was relying on derivative of MCPs which explicit in the series expansion.The advantage of this method is solved HBVPs without transforming it to a system of lower-order ordinary differential equations (ODEs).This method supported by examples of HBVPs in wide application.The mentioned examples showed that the proposed method is efficient and accurate.
The subject of routing in computer networks has got a considerable place in recent years. The reason of that is the determining role of routing in the efficiency of these networks. Service quality and security are considered as the most important challenges of routing due to the lack of reliable methods. Routers use routing algorithms for finding the best path to destination. When we speak about the best rout, we consider parameters such as the number of hops, changing time and the cost of communicational costs of sending packets. Using smart factors locally and nationally, in this thesis it has been tried to improve routing operations. The ant colony algorithm is a multifactor solution for optimization issues which has some models based on collective intelligence of ants and has been applicable by converting to an efficient technology in computer networks. Although the ant is a simple creature, but a colony of ants can do useful tasks such as finding the shortest route toward food and sharing this information with other ants through leaving a chemical material named Pheromone. This algorithm includes three stages. The first phase is clustering network nods to smaller colonies, this phase is accomplished using learning automata in accordance with network need; for example placing the nods which will have more interaction in a cluster in future. Second phase is finding the routes of network by ants; and the third phase is sending network traffic to destination through the found routs by ants.
Molodtsov introduced the concept of soft sets, which can be s een as a new mathematical tool for dealing with uncertainty. In this paper, we introduce and study soft subnear-rings, so ft ideals and soft N-subgroups of near-rings by using Molodtsov’s definition of the soft sets. Some related properties are investigated a nd illustrated by a great deal of examples.
In this paper, Galerkin method has been introduced using Legendre polynomials as basis functions over the interval [-1, 1] to solve the eighth-order linear boundary value problems with two-point boundary conditions. Legendre Galerkin method is an effective tool in numerically solving such problems. The performance and applicability of the method is illustrated through some examples that reveal the method presents much better results. The obtained numerical results are convincing and very close to the analytical ones.
The present study analyses the stagnation-point flow over a s tretching sheet embedded in a porous medium. The plane stagnation-point flow is a class of flow problem which involve s two-dimensional flow. The present study develops a mathema tical model of a non-Newtonian flow of Casson fluid. The novelty of th e present study is to account for the effect of permeability o f the medium as well as energy loss due to Julian dissipation. A lin ear Darcian model is used to model the flow through porous medi a, whereas the non-linear term in energy equation accounts for he Joulian dissipation. Some interesting outcomes of the p resent study are the presence of porous matrix, which enhances the velocity t hereby contributing to the growth of boundary layer and acce lerates the momentum diffusion through larger fluid layers, whereas Jul ian dissipation is counterproductive for the growth of ther mal boundary layer i.e. moderately large Eckert number produces thinner boundary layer.
In the present paper, first we establish a new form and apply it to find an non-selfadjoint differential operator correspon ding the proposed form utilizing the famous representation theo rem. At the end, the resolvent of the derived operator using a ew technique is given.
The synchronization speed, quality, robustness and cost of the controller design are the four important factors in chao tic synchronization phenomena. This paper presents improved r esults when two identical hyperchaotic systems are synchro ized using a modified active control approach. The complete synchroniza tion objective is achieved by means of only two stabilizing c ontrollers with a single feedback linear controller gain that reduce the con troller and synchronization cost significantly, and guaran tee the globally exponential stability of the closed-loop in a short transie t time. The advantages of the proposed modified active contr ol approach are revealed by analytically and numerically comparing the amplitude of the synchronized error signals, synchronizat ion ransient speed and cost of the designed controller with the past publi shed works in the literature concerned. The robust synchron ization of two Lorenz-Stenflo hyperchaotic systems is taken as an example t o verify the theoretical findings.
In 1982, the theory of rough sets proposed by Pawlak and in 2013, Luay concerned a rough probability by using the notion of Topology. In this paper, we study the rough probability in the stochastic approximation spaces by using set-valued mapping and obtain results on rough expectation, and rough variance.
We consider the Bitsadze–Samarskii type nonlocal boundary value problem for Poisson equation in a unit square, which is solved by a difference scheme of second-order accuracy. Using this approximate solution, we correct the right-hand side of the difference scheme. It is shown that the solution of the corrected scheme converges at the rate O(|h|s) in the discrete L2-norm provided that the solution of the original problem belongs to the Sobolev space with exponent s∈[2,4].
In this paper, we prove common fixed point theorem in intuitionistic fuzzy metric space using compatible mappings of type (A).
