Our research focusses on the problem of finding nearby peers in the Internet. We focus on one particular approach, Beacon Triangulation that is widely used to solve the peer-finding problem. Beacon Triangulation is based on relative distances of nodes to some special nodes called beacons. The scheme gives an error when a new node that wishes to join the network has the same relative distance to two or more nodes. One of the reasons for the error is that two or more nodes have the same distance vectors. As a part of our research work, we derive the conditions to ensure the uniqueness of distance vectors in any network given the shortest path distribution of nodes in that network. We verify our analytical results for G(n, p) graphs and the Internet. We also derive other conditions under which the error in the Beacon Triangulation scheme reduces to zero. We compare the Beacon Triangulation scheme to another well-known distance estimation scheme known as Global Network Positioning (GNP).

Thesis (Ph. D.)--Ohio State University, 2008. / Title from first page of PDF file. Includes bibliographical references (p. 88-89).

Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (p. 69-73).

Thesis (Ph. D.)--Open University. BLDSC no. DXN024722.

We study contact representations of graphs in the plane and in 3D space, where vertices are represented by polygons or polyhedra and each edge is represented by a common boundary between two polygons or polyhedra. In the weighted version of the problem, we find contact representations with the additional restriction that the areas for the polygons or the volumes for the polyhedra realize some pre-specified value for the vertices. We address different variants of the problem depending on the types of polygons or polyhedra (convex or non-convex, axis-aligned or not), types of contacts (proper contacts with common boundaries of non-zero lengths in 2D or non-zero areas in 3D or improper contacts where common boundaries of zero lengths or areas are allowed), and whether holes are allowed in the representation or not. In the plane we mainly focus on the weighted version of the problem. We find optimal (in terms of polygonal complexity) contact representations for planar graphs (both for axis-aligned and non-axis-aligned polygons) and some subclasses of planar graphs. With non-axis-aligned polygons we show that non-convex polygons with 4 sides are sometimes necessary and always sufficient for proportional contact representation of a planar graph, when point contacts are allowed; otherwise for proper contacts 7-sided polygons are sometimes necessary and always sufficient. We give a linear-time algorithm in each case to compute the optimal representation. We also give quadratic-time algorithms to construct optimal proportional contact representations for (2, 0)-sparse graphs (with triangles for improper contacts and with convex quadrilaterals for proper contacts). For maximal outerplanar graphs proportional contact representation with triangles can also be computed in linear time. In case only axis-aligned polygons are used, we show that 8 sides are sometimes necessary and always sufficient for a planar graph. While we do not have a polynomial-time algorithm to construct such a representation, we give a linear-time algorithm to compute representation with 10-sided axis-aligned polygons. We also give linear-time construction algorithms for optimal proportional contact representations with 8-sided polygons for planar 3-trees and Hamiltonian maximal planar graphs, and with rectangles for maximal outerplanar graphs. For contact representation with 3D polyhedra, we consider both the weighted and the unweighted variants of the problem for both planar and non-planar graphs and have some preliminary results. We find several subclasses of planar graphs that have contact representations using cubes or proportional boxes. We also consider (improper) contact representations using tetrahedra, and show that planar graphs, complete bipartite and tripartite graphs, and complete graphs with at most 10 vertices have contact representations with tetrahedra. We also addressed variants of this problem using only unit regular tetrahedra or considering contacts only between apices of the tetrahedra or using both restrictions.

This research explored the causal relationships among strategies, corporate structure, and performance of the largest U.S. non-financial firms using Directed Acyclic Graphs (DAGs). Corporate strategies and structure have been analyzed as major variables to influence corporate performance in management and organizational studies. However, their causal relationships in terms of which variables are leaders and followers, as well as the choices of variables to configure them, are controversial. Finding of causal relationships among strategic variables, structural variables, and corporate performance is beneficial to researchers as well as corporate mangers. It provides guidance to researchers how to build a model in order to measure influences from one variable to the other, lowering the risk of drawing spurious conclusions. It also provides managers a prospect of how certain important variables would change by making a certain strategic decision. Literatures from agency theory, transactional cost economics, and traditional strategic management perspective are used to suggest variables essential to analyze corporate performance. This study includes size and multi-organizational ownership hierarchy as variables to configure corporate structure. The variables to configure corporate strategies are unrelated and related diversification, ownership by institutional investors, debt, investment in R&D, and investment in advertisement. The study finds that most of the variables classified as corporate strategy and corporate structure variables are either direct or indirect causes of corporate accounting performance. Generally, results supports the relational model: corporate structure® corporate strategy® corporate performance. Ownership hierarchy structure, unrelated diversification, advertising expenses, and R&D intensity have direct causal influences on corporate accounting performance. Size and related diversification affected corporate accounting performance indirectly, both through ownership hierarchy structure. Theoretical causal relationships from agency theory are less supported than those from transaction cost economics and traditional strategic management perspective. Further my study suggests that, in general, good corporate performance in 1990s was mainly achieved by internal expansion through investment in R&D and advertisement, rather than external expansion of firms through unrelated diversification, related diversification, and expansion of ownership hierarchy.

No description available.

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The concept is related to the energy of a class of molecules in chemistry and was first brought to mathematics by Gutman in 1978 ([8]). In this thesis, we do a comprehensive study on the energy of graphs and digraphs. In Chapter 3, we review some existing upper and lower bounds for the energy of a graph. We come up with some new results in this chapter. A graph with n vertices is hyper-energetic if its energy is greater than 2n−2. Some classes of graphs are proved to be hyper-energetic. We find a new class of hyper-energetic graphs which is introduced and proved to be hyper-energetic in Section 3.3. The energy of a digraph is the sum of the absolute values of the real part of the eigenvalues of its adjacency matrix. In Chapter 4, we study the energy of digraphs in a way that Pe˜na and Rada in [19] have defined. Some known upper and lower bounds for the energy of digraphs are reviewed. In Section 4.5, we bring examples of some classes of digraphs in which we find their energy. Keywords. Energy of a graph, hyper-energetic graph, energy of a digraph. / vii, 80 leaves ; 29 cm

No description available.

Finding a common language in describing and interpreting multivariate data associated with rehabilitation and disturbance ecology, has became a major challenge. The main objective of this study is to find and evaluate mathematical models to describe ecosystem change based on selected indicators of change. Existing data from a previous rehabilitation project on Hendrina Power Station (Mpumalanga, South Africa) was used as a database for this study and this study aims to report on the development of models concentrating on radar graphs and a model based on matrix mathematics. The main groups of organisms selected for the construction of models, were vegetation, soil mesofauna and ant species. The datasets were limited to some indicative species and their mean abundances were determined. The grids that were used were randomly chosen and the models were constructed. Radar graphs were constructed to model the suite of species identified, through a sensitivity analysis, to indicate possible rehabilitation success over time and was applied to the different rehabilitation ages. The surface areas under the radar graphs were determined and compared for the different rehabilitation ages in the same year of survey. Correlation graphs were drawn between the surface area and the rehabilitation ages. These graphs did not indicate much relevance in indicating rehabilitation success, but the radar graphs proved to be good indicators of change in abundance of the selected species over time. iv The vegetation species, Eragrostis curvula, was the only species that showed a strong significant positive relationship with rehabilitation age and could be considered a good rehabilitation species and indicator of rehabilitation success. After the evaluation of this model, Eragrostis curvula, and two additional ant species, Tetramorium setigerum and Lepisiota laevis, were added. These species that were added, showed an increase in abundance over time, as found in a previous study. These radar graphs also did not indicate much relevance and it can be concluded that the radar graphs can only be used for a visual representation of the changes in abundance of the relevant species over time. This study also refers to a matrix model. This model focused on the interactions between the different variables selected. The percentage carbon in the soil were also added to the list of species. Model fitting graphs were constructed and correlations were drawn between the species that had significant values in the interaction table. This model could be useful for future studies, but more data and replication is necessary, over a longer period of time. This will serve to eliminate possible shortcomings of the model. / Thesis (M. Environmental Science (Biodiversity and Conservation Biology))--North-West University, Potchefstroom Campus, 2007.