Search results for: topological degree.
968 The Countabilities of Soft Topological Spaces
Authors: Weijian Rong
Abstract:
Soft topological spaces are considered as mathematical tools for dealing with uncertainties, and a fuzzy topological space is a special case of the soft topological space. The purpose of this paper is to study soft topological spaces. We introduce some new concepts in soft topological spaces such as soft first-countable spaces, soft second-countable spaces and soft separable spaces, and some basic properties of these concepts are explored.
Keywords: soft sets, soft first-countable spaces, soft second countable spaces, soft separable spaces, soft Lindelöf.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2399967 Complexity of Multivalued Maps
Authors: David Sherwell, Vivien Visaya
Abstract:
We consider the topological entropy of maps that in general, cannot be described by one-dimensional dynamics. In particular, we show that for a multivalued map F generated by singlevalued maps, the topological entropy of any of the single-value map bounds the topological entropy of F from below.Keywords: Multivalued maps, Topological entropy, Selectors
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1237966 Soft Connected Spaces and Soft Paracompact Spaces
Authors: Fucai Lin
Abstract:
Soft topological spaces are considered as mathematical tools for dealing with uncertainties, and a fuzzy topological space is a special case of the soft topological space. The purpose of this paper is to study soft topological spaces. We introduce some new concepts in soft topological spaces such as soft closed mapping, soft open mappings, soft connected spaces and soft paracompact spaces. We also redefine the concept of soft points such that it is reasonable in soft topological spaces. Moreover, some basic properties of these concepts are explored.
Keywords: soft sets, soft open mappings, soft closed mappings, soft connected spaces, soft paracompact spaces.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2030965 Topological Properties of an Exponential Random Geometric Graph Process
Authors: Yilun Shang
Abstract:
In this paper we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process. The transition probability matrix and stationary distribution are derived for the Markov chains concerning connectivity and the number of components. We analyze the algorithm for hitting time regarding disconnectivity. In addition to dynamical properties, we also study topological properties for static snapshots. We obtain the degree distributions as well as asymptotic precise bounds and strong law of large numbers for connectivity threshold distance and the largest nearest neighbor distance amongst others. Both exact results and limit theorems are provided in this paper.Keywords: random geometric graph, autoregressive process, degree, connectivity, Markovian, wireless network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1446964 Structure of Covering-based Rough Sets
Authors: Shiping Wang, Peiyong Zhu, William Zhu
Abstract:
Rough set theory is a very effective tool to deal with granularity and vagueness in information systems. Covering-based rough set theory is an extension of classical rough set theory. In this paper, firstly we present the characteristics of the reducible element and the minimal description covering-based rough sets through downsets. Then we establish lattices and topological spaces in coveringbased rough sets through down-sets and up-sets. In this way, one can investigate covering-based rough sets from algebraic and topological points of view.
Keywords: Covering, poset, down-set, lattice, topological space, topological base.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1839963 Topological Queries on Graph-structured XML Data: Models and Implementations
Authors: Hongzhi Wang, Jianzhong Li, Jizhou Luo
Abstract:
In many applications, data is in graph structure, which can be naturally represented as graph-structured XML. Existing queries defined on tree-structured and graph-structured XML data mainly focus on subgraph matching, which can not cover all the requirements of querying on graph. In this paper, a new kind of queries, topological query on graph-structured XML is presented. This kind of queries consider not only the structure of subgraph but also the topological relationship between subgraphs. With existing subgraph query processing algorithms, efficient algorithms for topological query processing are designed. Experimental results show the efficiency of implementation algorithms.Keywords: XML, Graph Structure, Topological query.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1407962 An Alternative Proof for the Topological Entropy of the Motzkin Shift
Authors: Fahad Alsharari, Mohd Salmi Md Noorani
Abstract:
A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of the theory of symbolic dynamics, the Motzkin shift is nonsofic, and therefore, we cannot use the Perron- Frobenius theory to calculate its topological entropy. The Motzkin shift M(M,N) which comes from language theory, is defined to be the shift system over an alphabet A that consists of N negative symbols, N positive symbols and M neutral symbols. For an x in the full shift, x will be in the Motzkin subshift M(M,N) if and only if every finite block appearing in x has a non-zero reduced form. Therefore, the constraint for x cannot be bounded in length. K. Inoue has shown that the entropy of the Motzkin shift M(M,N) is log(M + N + 1). In this paper, a new direct method of calculating the topological entropy of the Motzkin shift is given without any measure theoretical discussion.
Keywords: Motzkin shift, topological entropy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2003961 Topological Sensitivity Analysis for Reconstruction of the Inverse Source Problem from Boundary Measurement
Authors: Maatoug Hassine, Mourad Hrizi
Abstract:
In this paper, we consider a geometric inverse source problem for the heat equation with Dirichlet and Neumann boundary data. We will reconstruct the exact form of the unknown source term from additional boundary conditions. Our motivation is to detect the location, the size and the shape of source support. We present a one-shot algorithm based on the Kohn-Vogelius formulation and the topological gradient method. The geometric inverse source problem is formulated as a topology optimization one. A topological sensitivity analysis is derived from a source function. Then, we present a non-iterative numerical method for the geometric reconstruction of the source term with unknown support using a level curve of the topological gradient. Finally, we give several examples to show the viability of our presented method.Keywords: Geometric inverse source problem, heat equation, topological sensitivity, topological optimization, Kohn-Vogelius formulation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1110960 Periodic Solutions for a Two-prey One-predator System on Time Scales
Authors: Changjin Xu
Abstract:
In this paper, using the Gaines and Mawhin,s continuation theorem of coincidence degree theory on time scales, the existence of periodic solutions for a two-prey one-predator system is studied. Some sufficient conditions for the existence of positive periodic solutions are obtained. The results provide unified existence theorems of periodic solution for the continuous differential equations and discrete difference equations.
Keywords: Time scales, competitive system, periodic solution, coincidence degree, topological degree.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1359959 Elemental Graph Data Model: A Semantic and Topological Representation of Building Elements
Authors: Yasmeen A. S. Essawy, Khaled Nassar
Abstract:
With the rapid increase of complexity in the building industry, professionals in the A/E/C industry were forced to adopt Building Information Modeling (BIM) in order to enhance the communication between the different project stakeholders throughout the project life cycle and create a semantic object-oriented building model that can support geometric-topological analysis of building elements during design and construction. This paper presents a model that extracts topological relationships and geometrical properties of building elements from an existing fully designed BIM, and maps this information into a directed acyclic Elemental Graph Data Model (EGDM). The model incorporates BIM-based search algorithms for automatic deduction of geometrical data and topological relationships for each building element type. Using graph search algorithms, such as Depth First Search (DFS) and topological sortings, all possible construction sequences can be generated and compared against production and construction rules to generate an optimized construction sequence and its associated schedule. The model is implemented in a C# platform.
Keywords: Building information modeling, elemental graph data model, geometric and topological data models, and graph theory.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1186958 Optimization of Lakes Aeration Process
Authors: Mohamed Abdelwahed
Abstract:
The aeration process via injectors is used to combat the lack of oxygen in lakes due to eutrophication. A 3D numerical simulation of the resulting flow using a simplified model is presented. In order to generate the best dynamic in the fluid with respect to the aeration purpose, the optimization of the injectors location is considered. We propose to adapt to this problem the topological sensitivity analysis method which gives the variation of a criterion with respect to the creation of a small hole in the domain. The main idea is to derive the topological sensitivity analysis of the physical model with respect to the insertion of an injector in the fluid flow domain. We propose in this work a topological optimization algorithm based on the studied asymptotic expansion. Finally we present some numerical results, showing the efficiency of our approachKeywords: Quasi Stokes equations, Numerical simulation, topological optimization, sensitivity analysis.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1460957 Magnetic Field Effects on Parabolic Graphene Quantum Dots with Topological Defects
Authors: Defne Akay, Bekir S. Kandemir
Abstract:
In this paper, we investigate the low-lying energy levels of the two-dimensional parabolic graphene quantum dots (GQDs) in the presence of topological defects with long range Coulomb impurity and subjected to an external uniform magnetic field. The low-lying energy levels of the system are obtained within the framework of the perturbation theory. We theoretically demonstrate that a valley splitting can be controlled by geometrical parameters of the graphene quantum dots and/or by tuning a uniform magnetic field, as well as topological defects. It is found that, for parabolic graphene dots, the valley splitting occurs due to the introduction of spatial confinement. The corresponding splitting is enhanced by the introduction of a uniform magnetic field and it increases by increasing the angle of the cone in subcritical regime.Keywords: Coulomb impurity, graphene cones, graphene quantum dots, topological defects.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2090956 Reducing the False Rejection Rate of Iris Recognition Using Textural and Topological Features
Authors: M. Vatsa, R. Singh, A. Noore
Abstract:
This paper presents a novel iris recognition system using 1D log polar Gabor wavelet and Euler numbers. 1D log polar Gabor wavelet is used to extract the textural features, and Euler numbers are used to extract topological features of the iris. The proposed decision strategy uses these features to authenticate an individual-s identity while maintaining a low false rejection rate. The algorithm was tested on CASIA iris image database and found to perform better than existing approaches with an overall accuracy of 99.93%.Keywords: Iris recognition, textural features, topological features.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1933955 Character Segmentation Method for a License Plate with Topological Transform
Authors: Jaedo Kim, Youngjoon Han, Hernsoo Hahn
Abstract:
This paper propose the robust character segmentation method for license plate with topological transform such as twist,rotation. The first step of the proposed method is to find a candidate region for character and license plate. The character or license plate must be appeared as closed loop in the edge image. In the case of detecting candidate for character region, the evaluation of detected region is using topological relationship between each character. When this method decides license plate candidate region, character features in the region with binarization are used. After binarization for the detected candidate region, each character region is decided again. In this step, each character region is fitted more than previous step. In the next step, the method checks other character regions with different scale near the detected character regions, because most license plates have license numbers with some meaningful characters around them. The method uses perspective projection for geometrical normalization. If there is topological distortion in the character region, the method projects the region on a template which is defined as standard license plate using perspective projection. In this step, the method is able to separate each number region and small meaningful characters. The evaluation results are tested with a number of test images.Keywords: License Plate Detection, Character Segmentation, Perspective Projection, Topological Transform.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1924954 Periodic Solutions in a Delayed Competitive System with the Effect of Toxic Substances on Time Scales
Authors: Changjin Xu, Qianhong Zhang
Abstract:
In this paper, the existence of periodic solutions of a delayed competitive system with the effect of toxic substances is investigated by using the Gaines and Mawhin,s continuation theorem of coincidence degree theory on time scales. New sufficient conditions are obtained for the existence of periodic solutions. The approach is unified to provide the existence of the desired solutions for the continuous differential equations and discrete difference equations. Moreover, The approach has been widely applied to study existence of periodic solutions in differential equations and difference equations.
Keywords: Time scales, competitive system, periodic solution, coincidence degree, topological degree.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1391953 Approximation to the Hardy Operator on Topological Measure Spaces
Authors: Kairat T. Mynbaev, Elena N. Lomakina
Abstract:
We consider a Hardy type operator generated by a family of open subsets of a Hausdorff topological space. The family is indexed with non-negative real numbers and is totally ordered. For this operator, we obtain two-sided bounds of its norm, a compactness criterion and bounds for its approximation numbers. Previously bounds for its approximation numbers have been established only in the one-dimensional case, while we do not impose any restrictions on the dimension of the Hausdorff space. The bounds for the norm and conditions for compactness have been found earlier but our approach is different in that we use domain partitions for all problems under consideration.
Keywords: Approximation numbers, boundedness and compactness, multidimensional Hardy operator, Hausdorff topological space.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 81952 Positive Periodic Solutions in a Discrete Competitive System with the Effect of Toxic Substances
Authors: Changjin Xu, Qianhong Zhang
Abstract:
In this paper, a delayed competitive system with the effect of toxic substances is investigated. With the aid of differential equations with piecewise constant arguments, a discrete analogue of continuous non-autonomous delayed competitive system with the effect of toxic substances is proposed. By using Gaines and Mawhin,s continuation theorem of coincidence degree theory, a easily verifiable sufficient condition for the existence of positive solutions of difference equations is obtained.
Keywords: Competitive system, periodic solution, discrete time delay, topological degree.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1448951 On Submaximality in Intuitionistic Topological Spaces
Authors: Ahmet Z. Ozcelik, Serkan Narli
Abstract:
In this study, a minimal submaximal element of LIT(X) (the lattice of all intuitionistic topologies for X, ordered by inclusion) is determined. Afterwards, a new contractive property, intuitionistic mega-connectedness, is defined. We show that the submaximality and mega-connectedness are not complementary intuitionistic topological invariants by identifying those members of LIT(X) which are intuitionistic mega-connected.Keywords: Intuitionistic set; intuitionistic topology;intuitionistic submaximality and mega-connectedness.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1704950 TFRank: An Evaluation of Users Importance with Fractal Views in Social Networks
Abstract:
One of research issues in social network analysis is to evaluate the position/importance of users in social networks. As the information diffusion in social network is evolving, it seems difficult to evaluate the importance of users using traditional approaches. In this paper, we propose an evaluation approach for user importance with fractal view in social networks. In this approach, the global importance (Fractal Importance) and the local importance (Topological Importance) of nodes are considered. The basic idea is that the bigger the product of fractal importance and topological importance of a node is, the more important of the node is. We devise the algorithm called TFRank corresponding to the proposed approach. Finally, we evaluate TFRank by experiments. Experimental results demonstrate our TFRank has the high correlations with PageRank algorithm and potential ranking algorithm, and it shows the effectiveness and advantages of our approach.Keywords: TFRank, Fractal Importance, Topological Importance, Social Network
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1502949 Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues
Authors: Ayşe Dilek Maden
Abstract:
For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.
Keywords: Degree Kirchhoff index, normalized Laplacian eigenvalue, spanning tree.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2194948 Topology Preservation in SOM
Authors: E. Arsuaga Uriarte, F. Díaz Martín
Abstract:
The SOM has several beneficial features which make it a useful method for data mining. One of the most important features is the ability to preserve the topology in the projection. There are several measures that can be used to quantify the goodness of the map in order to obtain the optimal projection, including the average quantization error and many topological errors. Many researches have studied how the topology preservation should be measured. One option consists of using the topographic error which considers the ratio of data vectors for which the first and second best BMUs are not adjacent. In this work we present a study of the behaviour of the topographic error in different kinds of maps. We have found that this error devaluates the rectangular maps and we have studied the reasons why this happens. Finally, we suggest a new topological error to improve the deficiency of the topographic error.Keywords: Map lattice, Self-Organizing Map, topographic error, topology preservation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2990947 Integral Domains and Their Algebras: Topological Aspects
Authors: Shai Sarussi
Abstract:
Let S be an integral domain with field of fractions F and let A be an F-algebra. An S-subalgebra R of A is called S-nice if R∩F = S and the localization of R with respect to S \{0} is A. Denoting by W the set of all S-nice subalgebras of A, and defining a notion of open sets on W, one can view W as a T0-Alexandroff space. Thus, the algebraic structure of W can be viewed from the point of view of topology. It is shown that every nonempty open subset of W has a maximal element in it, which is also a maximal element of W. Moreover, a supremum of an irreducible subset of W always exists. As a notable connection with valuation theory, one considers the case in which S is a valuation domain and A is an algebraic field extension of F; if S is indecomposed in A, then W is an irreducible topological space, and W contains a greatest element.Keywords: Algebras over integral domains, Alexandroff topology, valuation domains, integral domains.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 490946 Efficient and Effective Gabor Feature Representation for Face Detection
Authors: Yasuomi D. Sato, Yasutaka Kuriya
Abstract:
We here propose improved version of elastic graph matching (EGM) as a face detector, called the multi-scale EGM (MS-EGM). In this improvement, Gabor wavelet-based pyramid reduces computational complexity for the feature representation often used in the conventional EGM, but preserving a critical amount of information about an image. The MS-EGM gives us higher detection performance than Viola-Jones object detection algorithm of the AdaBoost Haar-like feature cascade. We also show rapid detection speeds of the MS-EGM, comparable to the Viola-Jones method. We find fruitful benefits in the MS-EGM, in terms of topological feature representation for a face.
Keywords: Face detection, Gabor wavelet based pyramid, elastic graph matching, topological preservation, redundancy of computational complexity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1861945 Terminal Wiener Index for Graph Structures
Authors: J. Baskar Babujee, J. Senbagamalar,
Abstract:
The topological distance between a pair of vertices i and j, which is denoted by d(vi, vj), is the number of edges of the shortest path joining i and j. The Wiener index W(G) is the sum of distances between all pairs of vertices of a graph G. W(G) = i Keywords:
Graph,
Degree,
Distance,
Pendent vertex,
Wiener index,
Tree.
944 Topological Quantum Diffeomorphisms in Field Theory and the Spectrum of the Space-Time
Authors: Francisco Bulnes
Abstract:
Through the Fukaya conjecture and the wrapped Floer cohomology, the correspondences between paths in a loop space and states of a wrapping space of states in a Hamiltonian space (the ramification of field in this case is the connection to the operator that goes from TM to T*M) are demonstrated where these last states are corresponding to bosonic extensions of a spectrum of the space-time or direct image of the functor Spec, on space-time. This establishes a distinguished diffeomorphism defined by the mapping from the corresponding loops space to wrapping category of the Floer cohomology complex which furthermore relates in certain proportion D-branes (certain D-modules) with strings. This also gives to place to certain conjecture that establishes equivalences between moduli spaces that can be consigned in a moduli identity taking as space-time the Hitchin moduli space on G, whose dual can be expressed by a factor of a bosonic moduli spaces.Keywords: Floer cohomology, Fukaya conjecture, Lagrangian submanifolds, spectrum of ring, topological quantum diffeomorphisms.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 992943 Mapping Semantic Networks to Undirected Networks
Authors: Marko A. Rodriguez
Abstract:
There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled network). The edge label in the semantic network is represented as a topological feature of the directed network. Also, there exists an injective function that maps a directed network to an undirected network (i.e. an undirected unlabeled network). The edge directionality in the directed network is represented as a topological feature of the undirected network. Through function composition, there exists an injective function that maps a semantic network to an undirected network. Thus, aside from space constraints, the semantic network construct does not have any modeling functionality that is not possible with either a directed or undirected network representation. Two proofs of this idea will be presented. The first is a proof of the aforementioned function composition concept. The second is a simpler proof involving an undirected binary encoding of a semantic network.Keywords: general-modeling, multi-relational networks, semantic networks
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1427942 Altered Network Organization in Mild Alzheimer's Disease Compared to Mild Cognitive Impairment Using Resting-State EEG
Authors: Chia-Feng Lu, Yuh-Jen Wang, Shin Teng, Yu-Te Wu, Sui-Hing Yan
Abstract:
Brain functional networks based on resting-state EEG data were compared between patients with mild Alzheimer’s disease (mAD) and matched patients with amnestic subtype of mild cognitive impairment (aMCI). We integrated the time–frequency cross mutual information (TFCMI) method to estimate the EEG functional connectivity between cortical regions and the network analysis based on graph theory to further investigate the alterations of functional networks in mAD compared with aMCI group. We aimed at investigating the changes of network integrity, local clustering, information processing efficiency, and fault tolerance in mAD brain networks for different frequency bands based on several topological properties, including degree, strength, clustering coefficient, shortest path length, and efficiency. Results showed that the disruptions of network integrity and reductions of network efficiency in mAD characterized by lower degree, decreased clustering coefficient, higher shortest path length, and reduced global and local efficiencies in the delta, theta, beta2, and gamma bands were evident. The significant changes in network organization can be used in assisting discrimination of mAD from aMCI in clinical.
Keywords: EEG, functional connectivity, graph theory, TFCMI.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2493941 Topology Optimization of Aircraft Fuselage Structure
Authors: Muniyasamy Kalanchiam, Baskar Mannai
Abstract:
Topology Optimization is a defined as the method of determining optimal distribution of material for the assumed design space with functionality, loads and boundary conditions [1]. Topology optimization can be used to optimize shape for the purposes of weight reduction, minimizing material requirements or selecting cost effective materials [2]. Topology optimization has been implemented through the use of finite element methods for the analysis, and optimization techniques based on the method of moving asymptotes, genetic algorithms, optimality criteria method, level sets and topological derivatives. Case study of Typical “Fuselage design" is considered for this paper to explain the benefits of Topology Optimization in the design cycle. A cylindrical shell is assumed as the design space and aerospace standard pay loads were applied on the fuselage with wing attachments as constraints. Then topological optimization is done using Finite Element (FE) based software. This optimization results in the structural concept design which satisfies all the design constraints using minimum material.Keywords: Fuselage, Topology optimization, payloads, designoptimization, Finite Element Analysis.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 4080940 Synthesis of the Robust Regulators on the Basis of the Criterion of the Maximum Stability Degree
Authors: S. A. Gayvoronsky, T. A. Ezangina
Abstract:
The robust control system objects with interval- undermined parameters is considers in this paper. Initial information about the system is its characteristic polynomial with interval coefficients. On the basis of coefficient estimations of quality indices and criterion of the maximum stability degree, the methods of synthesis of a robust regulator parametric is developed. The example of the robust stabilization system synthesis of the rope tension is given in this article.
Keywords: An interval polynomial, controller synthesis, analysis of quality factors, maximum degree of stability, robust degree of stability, robust oscillation, system accuracy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1585939 Similarity Based Membership of Elements to Uncertain Concept in Information System
Authors: M. Kamel El-Sayed
Abstract:
The process of determining the degree of membership for an element to an uncertain concept has been found in many ways, using equivalence and symmetry relations in information systems. In the case of similarity, these methods did not take into account the degree of symmetry between elements. In this paper, we use a new definition for finding the membership based on the degree of symmetry. We provide an example to clarify the suggested methods and compare it with previous methods. This method opens the door to more accurate decisions in information systems.
Keywords: Information system, uncertain concept, membership function, similarity relation, degree of similarity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 800