Categorical Properties Of Lattice-valued Convergence Spaces

This work can be roughly divided into two parts. Initially, it may be considered a continuation of the very interesting research on the topic of Lattice-Valued Convergence Spaces given by Jager [2001, 2005]. The alternate axioms presented here seem to lead to theorems having proofs more closely related to standard arguments used in Convergence Space theory when the Lattice is L = f0; 1g:Various Subcategories are investigated. One such subconstruct is shown to be isomorphic to the category of Lattice Valued Fuzzy Convergence Spaces defined and studied by Jager [2001]. Our principal category is shown to be a topological universe and contains a subconstruct isomorphic to the category of probabilistic convergence spaces discussed in Kent and Richardson [1996] when L = [0; 1]: Fundamental work in lattice-valued convergence from the more general perspective of monads can be found in Gahler [1995]. Secondly, diagonal axioms are defned in the category whose objects consist of all the lattice valued convergence spaces. When the latter lattice is linearly ordered, a diagonal condition is given which characterizes those objects in the category that are determined by probabilistic convergence spaces which are topological. Certain background information regarding filters, convergence spaces, and diagonal axioms with its dual are given in Chapter 1. Chapter 2 describes Probabilistic Convergence and associated Diagonal axioms. Chapter 3 defines Jager convergence and proves that Jager\u27s construct is isomorphic to a bireáective subconstruct of SL-CS. Furthermore, connections between the diagonal axioms discussed and those given by Gahler are explored. In Chapter 4, further categorical properties of SL-CS are discussed and in particular, it is shown that SL-CS is topological, cartesian closed, and extensional. Chapter 5 explores connections between diagonal axioms for objects in the sub construct δ(PCS) and SL-CS. Finally, recommendations for further research are provided

Bornological structures on many-valued sets

We introduce an approach to the concept of bornology in the framework of many-valued mathematical structures and develop the basics of the theory of many-valued bornological spaces and initiate the study of the category of many-valued bornological spaces and appropriately defined bounded "mappings" of such spaces. A scheme for constructing many-valued bornologies with prescribed properties is worked out. In particular, this scheme allows to extend an ordinary bornology of a metric space to a many-valued bornology on it

Tameness in generalized metric structures

We broaden the framework of metric abstract elementary classes (mAECs) in several essential ways, chiefly by allowing the metric to take values in a well-behaved quantale. As a proof of concept we show that the result of Boney and Zambrano on (metric) tameness under a large cardinal assumption holds in this more general context. We briefly consider a further generalization to partial metric spaces, and hint at connections to classes of fuzzy structures, and structures on sheaves

Pretopological and topological lattice-valued convergence spaces

We show that the classical axiom which characterizes pretopological convergence spaces splits into two axioms in the general Heyting algebra-valued case. Furthermore we present a generalization of Kowalski’s diagonal condition to the lattice-valued case

Lattice-valued Convergence: Quotient Maps

The introduction of fuzzy sets by Zadeh has created new research directions in many fields of mathematics. Fuzzy set theory was originally restricted to the lattice , but the thrust of more recent research has pertained to general lattices. The present work is primarily focused on the theory of lattice-valued convergence spaces; the category of lattice-valued convergence spaces has been shown to possess the following desirable categorical properties: topological, cartesian-closed, and extensional. Properties of quotient maps between objects in this category are investigated in this work; in particular, one of our principal results shows that quotient maps are productive under arbitrary products. A category of lattice-valued interior operators is defined and studied as well. Axioms are given in order for this category to be isomorphic to the category whose objects consist of all the stratified, lattice-valued, pretopological convergence spaces. Adding a lattice-valued convergence structure to a group leads to the creation of a new category whose objects are called lattice-valued convergence groups, and whose morphisms are all the continuous homomorphisms between objects. The latter category is studied and results related to separation properties are obtained. For the special lattice , continuous actions of a convergence semigroup on convergence spaces are investigated; in particular, invariance properties of actions as well as properties of a generalized quotient space are presented

Vibration analysis of piezoelectric laminated slightly curved beams using distributed transfer function method

AbstractPiezoelectric laminated slightly curved beams (PLSCB) is currently one of the most popular actuators used in smart structure applications due to the fact that these actuators are small, lightweight, quick response and relatively high force output. This paper presents an analytical model of PLSCB, which includes the computation of natural frequencies, mode shapes and transfer function formulation using the distributed transfer function method (DTFM). By setting the radius of curvature of the proposed model to infinity, a piezoelectric laminated straight beams (PLSB) model can be obtained. The DTFM is applied and extended to carry out the transfer function formulation of the PLSCB and PLSB models. This method will be used to solve for the natural frequencies, mode shapes and transfer functions of the PLSCB and PLSB models in exact and closed form solution without using truncated series of particular comparison or admissible functions. The natural frequencies of the cantilevered PLSCB and PLSB are calculated by the DTFM and the Rayleigh–Ritz method. The analysis indicates that the stretching–bending coupling due to curvature has a considerable effect on the frequency parameters. Increasing the radius of curvature of the PLSCB has its largest effect on the natural frequencies. But the inhomogeneity of the boundary conditions does not have any effects on the natural frequencies or system spectrum due to the both receptance and boundary transfer functions have the same characteristic equations. The method can also be generalized to the vibration analysis of non-piezoelectric composite beams with arbitrary boundary conditions

Exploiting prior knowledge and latent variable representations for the statistical modeling and probabilistic querying of large knowledge graphs

Large knowledge graphs increasingly add great value to various applications that require machines to recognize and understand queries and their semantics, as in search or question answering systems. These applications include Google search, Bing search, IBM’s Watson, but also smart mobile assistants as Apple’s Siri, Google Now or Microsoft’s Cortana. Popular knowledge graphs like DBpedia, YAGO or Freebase store a broad range of facts about the world, to a large extent derived from Wikipedia, currently the biggest web encyclopedia. In addition to these freely accessible open knowledge graphs, commercial ones have also evolved including the well-known Google Knowledge Graph or Microsoft’s Satori. Since incompleteness and veracity of knowledge graphs are known problems, the statistical modeling of knowledge graphs has increasingly gained attention in recent years. Some of the leading approaches are based on latent variable models which show both excellent predictive performance and scalability. Latent variable models learn embedding representations of domain entities and relations (representation learning). From these embeddings, priors for every possible fact in the knowledge graph are generated which can be exploited for data cleansing, completion or as prior knowledge to support triple extraction from unstructured textual data as successfully demonstrated by Google’s Knowledge-Vault project. However, large knowledge graphs impose constraints on the complexity of the latent embeddings learned by these models. For graphs with millions of entities and thousands of relation-types, latent variable models are required to exploit low dimensional embeddings for entities and relation-types to be tractable when applied to these graphs. The work described in this thesis extends the application of latent variable models for large knowledge graphs in three important dimensions. First, it is shown how the integration of ontological constraints on the domain and range of relation-types enables latent variable models to exploit latent embeddings of reduced complexity for modeling large knowledge graphs. The integration of this prior knowledge into the models leads to a substantial increase both in predictive performance and scalability with improvements of up to 77% in link-prediction tasks. Since manually designed domain and range constraints can be absent or fuzzy, we also propose and study an alternative approach based on a local closed-world assumption, which derives domain and range constraints from observed data without the need of prior knowledge extracted from the curated schema of the knowledge graph. We show that such an approach also leads to similar significant improvements in modeling quality. Further, we demonstrate that these two types of domain and range constraints are of general value to latent variable models by integrating and evaluating them on the current state of the art of latent variable models represented by RESCAL, Translational Embedding, and the neural network approach used by the recently proposed Google Knowledge Vault system. In the second part of the thesis it is shown that the just mentioned three approaches all perform well, but do not share many commonalities in the way they model knowledge graphs. These differences can be exploited in ensemble solutions which improve the predictive performance even further. The third part of the thesis concerns the efficient querying of the statistically modeled knowledge graphs. This thesis interprets statistically modeled knowledge graphs as probabilistic databases, where the latent variable models define a probability distribution for triples. From this perspective, link-prediction is equivalent to querying ground triples which is a standard functionality of the latent variable models. For more complex querying that involves e.g. joins and projections, the theory on probabilistic databases provides evaluation rules. In this thesis it is shown how the intrinsic features of latent variable models can be combined with the theory of probabilistic databases to realize efficient probabilistic querying of the modeled graphs

Linear logic for constructive mathematics

We show that numerous distinctive concepts of constructive mathematics arise automatically from an interpretation of "linear higher-order logic" into intuitionistic higher-order logic via a Chu construction. This includes apartness relations, complemented subsets, anti-subgroups and anti-ideals, strict and non-strict order pairs, cut-valued metrics, and apartness spaces. We also explain the constructive bifurcation of classical concepts using the choice between multiplicative and additive linear connectives. Linear logic thus systematically "constructivizes" classical definitions and deals automatically with the resulting bookkeeping, and could potentially be used directly as a basis for constructive mathematics in place of intuitionistic logic.Comment: 39 page

Lattice-Valued T-Filters and Induced Structures

A complete lattice is called a frame provided meets distribute over arbitrary joins. The implication operation in this context plays a central role. Intuitively, it measures the degree to which one element is less than or equal to another. In this setting, a category is defined by equipping each set with a T-convergence structure which is defined in terms of T-filters. This category is shown to be topological, strongly Cartesian closed, and extensional. It is well known that the category of topological spaces and continuous maps is neither Cartesian closed nor extensional. Subcategories of compact and of complete spaces are investigated. It is shown that each T-convergence space has a compactification with the extension property provided the frame is a Boolean algebra. T-Cauchy spaces are defined and sufficient conditions for the existence of a completion are given. T-uniform limit spaces are also defined and their completions are given in terms of the T-Cauchy spaces they induce. Categorical properties of these subcategories are also investigated. Further, for a fixed T-convergence space, under suitable conditions, it is shown that there exists an order preserving bijection between the set of all strict, regular, Hausdorff compactifications and the set of all totally bounded T-Cauchy spaces which induce the fixed space

Computational Model for the Construction of Cognitive Maps

The chapter considers an option for solving the problem of storing data in the Web environment and providing an access to the data, taking into account their semantics, i.e., in accordance with the nature of the tasks solved by users of different classes. The proposed solution is based on the use of presentation of the data in the form of semantic networks. As the main technical tool for describing access methods, the chapter proposes cognitive maps (CMs), which can also be considered as semantic networks of special type. When access is done, the presentation of information consistent with the semantic description of the user is provided. The suggested method of constructing CMs is based on the intensional logic. The solution is presented in the form of a computational model, which provides for the construction of CM’s dependence on the parameter. The proposed method of parametrization makes it possible to take into account the semantic characteristics of users of various classes. Some CM constructions for problem domain description are presented. A method for semantically oriented naming of CMs is proposed. The method is based on building of a functor of special type