On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part A†

2020 ◽  
Vol 28 (3) ◽  
pp. 317-346
Author(s):  
Hannes Leitgeb
Keyword(s):  
Graph Theory ◽  
Axiomatic Theory ◽  
Concrete Case ◽  
Graph Theoretic ◽  
Philosophical Interpretation ◽  
Criterion Of Identity

Abstract This is Part A of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A summarizes the general attractions of non-eliminative structuralism. Afterwards, it motivates an understanding of unlabeled graphs as structures sui generis and develops a corresponding axiomatic theory of unlabeled graphs. As the theory demonstrates, graph theory can be developed consistently without eliminating unlabeled graphs in favour of sets; and the usual structuralist criterion of identity can be applied successfully in graph-theoretic proofs. Part B will turn to the philosophical interpretation and assessment of the theory.

On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†

2020 ◽  
Author(s):  
Hannes Leitgeb
Keyword(s):  
Set Theory ◽  
Axiomatic Theory ◽  
Concrete Case ◽  
Philosophical Interpretation

Abstract This is Part B of an article that defends non-eliminative structuralism about mathematics by means of a concrete case study: a theory of unlabeled graphs. Part A motivated an understanding of unlabeled graphs as structures sui generis and developed a corresponding axiomatic theory of unlabeled graphs. Part B turns to the philosophical interpretation and assessment of the theory: it points out how the theory avoids well-known problems concerning identity, objecthood, and reference that have been attributed to non-eliminative structuralism. The part concludes by explaining how the theory relates to set theory, and what remains to be accomplished for non-eliminative structuralists.

Modern Applications of Graph Theory

2021 ◽  
Author(s):  
Vadim Zverovich
Keyword(s):  
Graph Theory ◽  
Molecular Epidemiology ◽  
Emergency Response ◽  
Real Life ◽  
Dominating Sets ◽  
Postgraduate Students ◽  
Graph Theoretic ◽  
Electric Vehicle Charging ◽  
Advanced Students ◽  
Doctoral Dissertations

This book discusses many modern, cutting-edge applications of graph theory, such as traffic networks and Braess’ paradox, navigable networks and optimal routing for emergency response, backbone/dominating sets in wireless sensor networks, placement of electric vehicle charging stations, pedestrian safety and graph-theoretic methods in molecular epidemiology. Because of the rapid growth of research in this field, the focus of the book is on the up-to-date development of the aforementioned applications. The book will be ideal for researchers, engineers, transport planners and emergency response specialists who are interested in the recent development of graph theory applications. Moreover, this book can be used as teaching material for postgraduate students because, in addition to up-to-date descriptions of the applications, it includes exercises and their solutions. Some of the exercises mimic practical, real-life situations. Advanced students in graph theory, computer science or molecular epidemiology may use the problems and research methods presented in this book to develop their final-year projects, master’s theses or doctoral dissertations; however, to use the information effectively, special knowledge of graph theory would be required.

scholarly journals Graph Theoretic Techniques in the Analysis of Uniquely Localizable Sensor Networks

2009 ◽  
pp. 146-173 ◽  
Author(s):  
Bill Jackson ◽  
Tibor Jordán
Keyword(s):  
Graph Theory ◽  
Sensor Networks ◽  
Optimization Problems ◽  
Partial Information ◽  
Two Dimensions ◽  
Localization Problem ◽  
Graph Theoretic ◽  
Network Localization ◽  
Exact Location ◽  
The Given

In the network localization problem the goal is to determine the location of all nodes by using only partial information on the pairwise distances (and by computing the exact location of some nodes, called anchors). The network is said to be uniquely localizable if there is a unique set of locations consistent with the given data. Recent results from graph theory and combinatorial rigidity made it possible to characterize uniquely localizable networks in two dimensions. Based on these developments, extensions, related optimization problems, algorithms, and constructions also became tractable. This chapter gives a detailed survey of these new results from the graph theorist’s viewpoint.

scholarly journals El archivo de la “Fundación Rodríguez”. Análisis, potencia y gestión del legado

2020 ◽  
Vol 23 ◽  
pp. 36-57
Author(s):  
Iker Fidalgo Alday
Keyword(s):  
Research Process ◽  
Digital Content ◽  
Concrete Case ◽  
Artistic Production ◽  
Collective Work ◽  
Artistic Work ◽  
Do So

El presente artículo parte de un caso de estudio concreto que es la investigación en torno al archivo del colectivo artístico “Fundación Rodríguez” (Vitoria-Gasteiz, 1994-2012). El proceso de investigación estará marcado por todo lo que conlleva enfrentarse a un archivo compuesto por contenido digital y con formatos a punto de la obsolescencia, así como las dificultades para su conservación y mantenimiento. Partiendo de esto, se contextualizará la práctica de “Fundación Rodríguez” y el papel que juega el concepto de archivo en varias de las fases de su producción artística. Para ello analizaremos su posición desde el trabajo colectivo, la disolución del rol del artista y la desmaterialización de la obra artística como los tres frentes principales desde los que se erige su producción. Con todo, podremos valorar desde la actualidad la vigencia y relevancia de su legado, así como la potencia del mismo en el contexto artístico al que pertenece. This article starts from a concrete case study that is the research around the archive of the artistic collective “Fundación Rodríguez” (Vitoria-Gasteiz, 1994-2012). The research process will be marked by all that is involved in dealing with an archive composed of digital content and formats on the verge of obsolescence, as well as the difficulties of preserving and maintaining them. Starting from this, the practice of “Fundación Rodríguez” and the role played by the concept of archive in several of the phases of its artistic production will be contextualized. To do so, we will analyze its position from the perspective of collective work, the dissolution of the role of the artist and the dematerialization of the artistic work as the three main fronts from which its production is built.With all this, we will be able to evaluate from the present time the validity and relevance of his legacy as well as its power in the artistic context to which it belongs.

A Valuation of the Reliability of a GIS Based on the Fuzzy Logic in a Concrete Case Study

2005 ◽  
pp. 185-208 ◽  
Author(s):  
Ferdinando Di Martino ◽  
Vincenzo Loia ◽  
Salvatore Sessa ◽  
Michele Giordano
Keyword(s):  
Fuzzy Logic ◽  
Concrete Case

Introduction

2021 ◽  
pp. 1-36
Author(s):  
Vadim Zverovich
Keyword(s):  
Graph Theory ◽  
Biological Networks ◽  
Real Life ◽  
Scale Free ◽  
Graph Theoretic ◽  
Life Problems ◽  
Scale Free Networks ◽  
Web Graph ◽  
The Web

This chapter gives a brief overview of selected applications of graph theory, many of which gave rise to the development of graph theory itself. A range of such applications extends from puzzles and games to serious scientific and real-life problems, thus illustrating the diversity of applications. The first section is devoted to the six earliest applications of graph theory. The next section introduces so-called scale-free networks, which include the web graph, social and biological networks. The last section describes a number of graph-theoretic algorithms, which can be used to tackle a number of interesting applications and problems of graph theory.

scholarly journals A RESTful middleware for AI controlled sensors, actuators and smart devices

2019 ◽  
Vol 11 (7) ◽  
pp. 2963-2986 ◽  
Author(s):  
Nikos Dipsis ◽  
Kostas Stathis
Keyword(s):  
Smart Home ◽  
Learning Algorithm ◽  
State Of The Art ◽  
Smart Devices ◽  
Machine Learning Algorithm ◽  
Concrete Case ◽  
Domain Specific ◽  
Sensor Actuator ◽  
Current State

Abstract The numerous applications of internet of things (IoT) and sensor networks combined with specialized devices used in each has led to a proliferation of domain specific middleware, which in turn creates interoperability issues between the corresponding architectures and the technologies used. But what if we wanted to use a machine learning algorithm to an IoT application so that it adapts intelligently to changes of the environment, or enable a software agent to enrich with artificial intelligence (AI) a smart home consisting of multiple and possibly incompatible technologies? In this work we answer these questions by studying a framework that explores how to simplify the incorporation of AI capabilities to existing sensor-actuator networks or IoT infrastructures making the services offered in such settings smarter. Towards this goal we present eVATAR+, a middleware that implements the interactions within the context of such integrations systematically and transparently from the developers’ perspective. It also provides a simple and easy to use interface for developers to use. eVATAR+ uses JAVA server technologies enhanced by mediator functionality providing interoperability, maintainability and heterogeneity support. We exemplify eVATAR+ with a concrete case study and we evaluate the relative merits of our approach by comparing our work with the current state of the art.

THE CUBE-OF-RINGS INTERCONNECTION NETWORK

1998 ◽  
Vol 09 (01) ◽  
pp. 25-37 ◽  
Author(s):  
THOMAS J. CORTINA ◽  
ZHIWEI XU
Keyword(s):  
Graph Theory ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Parallel Computers ◽  
Closed Form Expression ◽  
Form Expression ◽  
Graph Theoretic ◽  
Basic Graph

We present a family of interconnection networks named the Cube-Of-Rings (COR) networks along with their basic graph-theoretic properties. Aspects of group graph theory are used to show the COR networks are symmetric and optimally fault tolerant. We present a closed-form expression of the diameter and optimal one-to-one routing algorithm for any member of the COR family. We also discuss the suitability of the COR networks as the interconnection network of scalable parallel computers.

Sign in / Sign up

Export Citation Format

Share Document