The definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then A is called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
Systems on Chips (SoCs) architecture complexity is result of integrating a large numbers of cores in a single chip. The approaches should address the systems particular challenges such as reliability, performance, and power constraints. Monitoring became a necessary part for testing, debugging and performance evaluations of SoCs at run time, as On-chip monitoring is employed to provide environmental information, such as temperature, voltage, and error data. Real-time system validation is done by exploiting the monitoring to determine the proper operation of a system within the designed parameters. The paper explains the common monitoring operations in SoCs, showing the functionality of thermal, voltage and soft error monitors. The different
... Show MoreDBN Rashid, Journal of Education College Wasit University 1(1):412-423, 2007
Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show MoreA space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
Despite ample research on soft linear spaces, there are many other concepts that can be studied. We introduced in this paper several new concepts related to the soft operators, such as the invertible operator. We investigated some properties of this kind of operators and defined the spectrum of soft linear operator along with a number of concepts related with this definition; the concepts of eigenvalue, eigenvector, eigenspace are defined. Finally the spectrum of the soft linear operator was divided into three disjoint parts.
The general objective of surface shape descriptors techniques is to categorize several surface shapes from collection data. Gaussian (K) and Mean (H) curvatures are the most broadly utilized indicators for surface shape characterization in collection image analysis. This paper explains the details of some descriptions (K and H), The discriminating power of 3D descriptors taken away from 3D surfaces (faces) is analyzed and present the experiment results of applying these descriptions on 3D face (with polygon mesh and point cloud representations). The results shows that Gaussian and Mean curvatures are important to discover unique points on the 3d surface (face) and the experiment result shows that these curvatures are very useful for some
... Show MoreThe palm vein recognition is one of the biometric systems that use for identification and verification processes since each person have unique characteristics for the veins. In this paper we can improvement palm vein recognition system have been made. The system based on centerline extraction of veins, and employs the concept of Difference-of Gaussian (DoG) Function to construct features vector. The tests results on our database showed that the identification rate is 100 % with the minimum error rate was 0.333.