On The Center Sets and Center Numbers of Some Graph Classes

For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes

Concept exploration - a tool for creating and exploring conceptual hierarchies

Concept exploration is a knowledge acquisition tool for interactively exploring the hierarchical structure of finitely generated lattices. Applications comprise the support of knowledge engineers by constructing a type lattice for conceptual graphs, and the exploration of large formal contexts in formal concept analysis.

A contextual-logic extension of TOSCANA

The aim of this paper is to indicate how TOSCANA may be extended to allow graphical representations not only of concept lattices but also of concept graphs in the sense of Contextual Logic. The contextual-logic extension of TOSCANA requires the logical scaling of conceptual and relatioal scales for which we propose the Peircean Algebraic Logic as reconstructed by R. W. Burch. As graphical representations we recommend, besides labelled line diagrams of concept lattices and Sowa's diagrams of conceptual graphs, particular information maps for utilizing background knowledge as much as possible. Our considerations are illustrated by a small information system about the domestic flights in Austria.

Semantic network analysis of ontologies

A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools provide only basic functionalities for analyzing ontologies. Since ontologies can be considered as (labeled, directed) graphs, graph analysis techniques are a suitable answer for this need. Graph analysis has been performed by sociologists for over 60 years, and resulted in the vivid research area of Social Network Analysis (SNA). While social network structures in general currently receive high attention in the Semantic Web community, there are only very few SNA applications up to now, and virtually none for analyzing the structure of ontologies. We illustrate in this paper the benefits of applying SNA to ontologies and the Semantic Web, and discuss which research topics arise on the edge between the two areas. In particular, we discuss how different notions of centrality describe the core content and structure of an ontology. From the rather simple notion of degree centrality over betweenness centrality to the more complex eigenvector centrality based on Hermitian matrices, we illustrate the insights these measures provide on two ontologies, which are different in purpose, scope, and size.

Dataflow Computation for the J-Machine

The dataflow model of computation exposes and exploits parallelism in programs without requiring programmer annotation; however, instruction- level dataflow is too fine-grained to be efficient on general-purpose processors. A popular solution is to develop a "hybrid'' model of computation where regions of dataflow graphs are combined into sequential blocks of code. I have implemented such a system to allow the J-Machine to run Id programs, leaving exposed a high amount of parallelism --- such as among loop iterations. I describe this system and provide an analysis of its strengths and weaknesses and those of the J-Machine, along with ideas for improvement.

Neural Networks

We present an overview of current research on artificial neural networks, emphasizing a statistical perspective. We view neural networks as parameterized graphs that make probabilistic assumptions about data, and view learning algorithms as methods for finding parameter values that look probable in the light of the data. We discuss basic issues in representation and learning, and treat some of the practical issues that arise in fitting networks to data. We also discuss links between neural networks and the general formalism of graphical models.

Evaluación y mejoramiento productivo de PLASPUCOL

Este proyecto de grado pretende evaluar el comportamiento productivo de la empresa Plaspucol ubicada en la ciudad de Bogotá, identificando las deficiencias en su proceso y generando mecanismo de mejoramiento a través de un previo análisis. Para ello es necesario partir de un marco teórico del plástico como lo es su historia, su evolución, clasificación y su posicionamiento e influencia económica a nivel mundial y vista a su vez desde el ámbito nacional. Para analizar dichas situaciones se usaron herramientas aprendidas en lo largo de nuestra formación profesional como los diagramas de recorrido, diagramas de flujo, diagrama hombre-máquina, diagrama de balanceo, muestreo y un moderno simulador llamado Promodel con el cual se diagnostica a la empresa identificando puntos débiles y cuellos de botella en la producción en la situación actual y se crea una situación futura con propuestas de mejora empleando éste simulador.

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 5: Affiliation Networks

How can we analyze and understand affiliation networks? In this class, we will discuss properties of affiliation networks and we will investigate the use of Galois lattices for the exploration of structural patterns in bi-partite graphs. Optional : L.C. Freeman and D.R. White. Using Galois Lattices to Represent Network Data. Sociological Methodology, (23):127--146, (1993)

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 4: Social Network Analysis

What are fundamental entities in social networks and what information is contained in social graphs? We will discuss some selected concepts in social network analysis, such as one- and two mode networks, prestige and centrality, and cliques, clans and clubs. Readings: Web tool predicts election results and stock prices, J. Palmer, New Scientist, 07 February (2008) [Protected Access] Optional: Social Network Analysis, Methods and Applications, S. Wasserman and K. Faust (1994)

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 7: Link Analysis and Search

What are ways of searching in graphs? In this class, we will discuss basics of link analysis, including Google's PageRank algorithm as an example. Readings: The PageRank Citation Ranking: Bringing Order to the Web, L. Page and S. Brin and R. Motwani and T. Winograd (1998) Stanford Tecnical Report

Introduction to Matlab - a self-study tutorial

Matlab is a high level language that is very easy to use and very powerful. It comes with a wealth of libraries and toolboxes, that you can use directly, so that you don't need to program low level functions. It enables you to display results very easily on graphs and images. To get started with it, you need to understand how to manipulate and represent data, and how to find information about the available functions. During this self-study tutorial, you will learn: 1- How to start Matlab. 2- How you can find out all the information you need. 3- How to create simple vectors and matrices. 4- What functions are available and how to find them. 5- How to plot graphs of functions. 6- How to write a script. After this (should take about an hour), you will know most of what you need to know about Matlab and should definitely know how to go on learning about it on your own…

Matlab self study tutorial - Graphing

These resources are designed to support students in gaining more confidence with using Matlab. The PDFs provide guidance and information; Objectives: Introduce basic syntax and data preparation for graphing with Matlab by providing some data, examples of code and some background documents. Outcomes: -how to write an m file script -the importance of syntax -how to load files -how to produce simple graphs -where to get help and further examples There are also some data files to provide example data for students to work with in producing Matlab resources.

Social Networks and Small World phenomena

Social Networking tools like Facebook yield recognisable small world phenomena, that is particular kinds of social graphs that facilitate particular kinds of interaction and information exchange.

Exam 1999 pdf

Exam questions and solutions in PDF

Lecture notes

Lecture notes in LaTex