[PDF] ALIO Back Matter

SD09
■ SD09
Aula 356- Third Floor
Analytic Hierarchy Process
Contributed Session
Chair: Valerio Salomon, Professor, UNESP, Av, Ariberto Pereira da Cunha,
333, Guaratinguetá, SP, 12516-410, Brazil, salomon@feg.unesp.br
1 - Generic Framework to Structure Complex Social Systems
Malcolm McKiggan, 1 Mary Street, Gawler East, 5118, Australia,
mckiggan@bigpond.com.au
Three Forms of Capital, defined as Individual, Collective and Institutional may be
used as a framework for analysis of complex social systems at Strategic, Operational
or Tactical levels and assist in the development of the Problem Definition by giving a
relative social context to primary data. They support the construct of a suitable
model for AHP or ANP prioritised trade off and sensitivity analysis highlighting
fundamental knowledge, specific domain experience and social justice.
2 - A Study on the Compatibility between Decision Vectors
Claudio Garuti, Fulcrum Ingeniería Ltda., Luis Thayer Ojeda 0180,
Oficina 1004, Santiago, Chile, claudiogaruti@fulcrum.cl,
Valerio Salomon
This work is related to the measurement of closeness or similarity among
preferences. These preferences could come from a set of decision makers and their
decision profiles or behavior patterns. The main difference among two types of
measurement, cardinal and ordinal preferences, are included in this study. To deal
with this subject, the compatibility index is presented in this work. Finally, some
examples, on the compatibility indices utilization, are presented.
3 - Two New Approaches to Set Priorities In Multicriteria Decision
Problems Under Fuzzy Uncertainties
Gustavo Schweickardt, Investigador, Instituto de Economía
Energética - CONICET, Av. Bustillo km 9,500 - Centro Atómico,
Bariloche, RN, 8400, Argentina, gschweickardt@arnet.com.ar,
Gustavo Wiman
In this work two approaches to set the priorities between criterias in multicriteria
decisions problems, as an alternative for Eigen-Vector method, are presented. The
uncertanties in the preferences are considered by mean fuzzy numbers, as an
extension from the IAHP methodology. The approaches are based in Linear
Programing (LP) and a new multiobjective Metaheuristics, named FEPSO. An
example is presented and the adventages of LP and FEPSO respect the Eigen-Vector
method, are evidenced.
4 - Selection of the Proper Tool to Developing Indicators’ Panels for an
Insurance Company: a Multicriteria Approach
José Fabiano Serra Costa, Dsc., UERJ, Rua São Francisco Xavier 524,
6028-B, Rio de Janeiro, RJ, 20559-900, Brazil, fabiano@ime.uerj.br,
Karine Duarte
Indicators’ panels consist in IT solutions to organize and present an up to date view
of a company’s performance measures. These panels help in business maintenance
and strategy, contributing significantly to decision making. Choosing the proper
tools to build these panels is fundamental to obtain quality performance and easy
user interface. This article presents the application of a multicriteria methodology to
select the ideal tool to support an indicators’ panel for an insurance company.
5 - Multiple Criteria Decision Making Modeling: An AHP Application to
Production Layout
Fernando Marins, Professor, UNESP, Av. Ariberto Pereira da Cunha,
333, Guaratinguetá, SP, 12516-410, Brazil, fmarins@feg.unesp.br,
Valerio Salomon, Ricardo Fino
It was applied Analytic Hierarchy Process for the production layout’s arrangement. It
was made a research in companies from the Paraiba River Valley, Brazil, and it was
possible the elaboration of the criteria’s ranking considering the importance of each
criterion in the industrial branches: Aeronautical, Automotive, Chemical,
Metallurgical and Mechanic.
ALIO / INFORMS International – 2010
44
■ SD10
Aula 357- Third Floor
Graph Spectra with Applications on
Combinatorial Optimization II
Cluster: Special Invited Sessions
Invited Session
Chair: Nair Abreu, Professor, Universidade Federal de Rio de Janeiro,
Centro de Tecnologia, Bloco F, Sala 103 - Ilha do Fundão, Rio de Janeiro,
22430-210, Brazil, nairabreunovoa@gmail.com
1 - Eigenvector Centrality: A Better Way of Measuring
Propagation of Technology
Ana Isabel Azevedo Spinola Dias, Professor, Universidade Federal
Fluminense(Depto de Ciíncia e Tecnologia), Rio das Ostras, RJ,
Brazil, belspinola@gmail.com, Renata Del-Vecchio, Karla Gonçalves,
Cynthia Bastos, Nair Abreu
We constructed a graph to define which countries, with jointly applied patents, are
the most central concerning propagation of technology. While degree centrality of
the nodes measures the direct cooperation between countries, eigenvector centrality
measures how much a country cooperates with countries that are cooperating with
many other countries, and so on. Propagation of technology is better measured by
eigenvector centrality.
2 - Spectral Graph Theory Applied to the Graph Isomorphism Problem
Philippe Leal Freire dos Santos, MSC Student - Departamento de
Informática, Universidade Federal do Espírito Santo, Av. Fernando
Ferrari, 514, Vitória, ES, 29075-910, Brazil, philippeleal@gmail.com,
Maria Cristina Rangel, Maria Claudia Silva Boeres
Spectral graph theory is the study of graph properties by their relationship with
some specific linear algebra concepts. The concepts of graph spectrum and
eigenvector centrality have been used in graph theory to characterize graph
properties and extract relevant graph structural information. In this work an exact
algorithm to detect the isomorphism between two graphs using their spectrum
information and their eigenvector centrality is proposed.
3 - Graphs with (k,t)-regulars Sets Corresponding to
All Distinct Eigenvalues
Paula Rama, PhD, Universidade de Aveiro, Campus Universitário de
Santiago, Aveiro, Portugal, prama@ua.pt, Paula Carvalho
Given a graph G=(V,E), a subset S of V is a (k,t)-regular set if S induces a k-regular
subgraph and each vertex v not in S has t neighbors in S. We introduce a lower
bound on the multiplicity of an eigenvalue of G associated with (k,t)-regular sets.
We present some classes of graphs with (k,t)-regular sets corresponding to all
distinct eigenvalues and we show some graph operations that generate graphs with
(k,t)-regular sets for all distinct eigenvalues from graphs with the same property.
4 - Some Regularity Properties of Circulant Graphs
Paula Carvalho, Professor, Universidade de Aveiro, Campus
Universitário de Santiago, Aveiro, Portugal, paula.carvalho@ua.pt,
Paula Rama
For a graph G=(V,E), a subset S of V is a (k,t)-regular set if S induces a k-regular
subgraph in G and every v in V \ S has t neighbors in S. We characterize (k,t)regular
sets for circulant graphs with symbol that fulfills some conditions and we
prove its existence for certain values on the order of G. If G is regular, S is a (k,t)regular
set if and only if k-t is an eigenvalue of G. Since circulant graphs are regular
graphs, we obtain a combinatorial characterization of its spectrum.
5 - A Survey of Orderings of Graphs by Algebraic Connectivity
Claudia Justel, Professor, Instituto Militar de Engenharia, Praca
General Tiburcio 80, Praia, Vermelha, Rio de Janeiro, 22290-270,
Brazil, cmjustel@gmail.com, Nair Abreu, Oscar Rojo
In this talk we present a survey of results about orderings of graphs by algebraic
connectivity. A total ordering of trees by algebraic connectivity is not known. Some
partial results about orderings of classes of trees of order n and fixed diameter d are
well known: for diameter equal to 3 and 4 and diameter d for trees that are
obtained from a path on d-1 vertices and two stars. Recently, other results have
been obtained for subclasses of trees.