A popular belief in the graph database community is that relational database management systems are generally ill-suited for efficient graph processing. This might apply for analytic graph queries performing iterative computations on the graph, but does not necessarily hold true for short-running, OLTP-style graph queries. In this paper we argue that, instead of extending a graph database management system with traditional relational operators—predicate evaluation, sorting, grouping, and aggregations among others—one should consider adding a graph abstraction and graph-specific operations, such as graph traversals and pattern matching, to relational database management systems. We use an exemplary query from the interactive query workload of the LDBC social network benchmark and run it against our enhanced in-memory, columnar relational database system to support our claims. Our performance measurements indicate that a columnar RDBMS—extended by graph-specific operators and data structures—can serve as a foundation for high-speed graph processing on big memory machines with non-uniform memory access and a large number of available cores.

<p>High-content screening (HCS) produces an immense amount of data, often on the scale of Terabytes. This requires considerable processing power resulting in long analysis time. As a result, HCS with a single-core processor system is an inefficient option because it takes a huge amount of time, storage and processing power. The situation is even worse because most of the image processing software is developed in high-level languages which make customization, flexibility and multi-processing features very challenging. Therefore, the goal of the project is to develop a multithreading model in C language. This model will be used to extract subcellular localization features, such as threshold adjacency statistics (TAS) from the HCS data. The first step of the research was to identify an appropriate dye for use in staining the MCF-7 cell line. The cell line has been treated with staurosporin kinase inhibitor, which can provide important physiological and morphological imaging information. The process of identifying a suitable dye involves treating cells with different dye options, capturing the fluorescent images of the treated cells with the Opera microscope, and analyzing the imaging properties of the stained cells. Several dyes were tested, and the most suitable dye to stain the cellular membrane was determined to be Di4-Anepps. The second part of the thesis was to design and develop a parallel program in C that can extract TAS features from the stained cellular images. The program reads the input cell images captured by Opera microscopes, converts it to TIFF format from the proprietary Opera format, identifies the region-of-interest contours of each cell, and computes the TAS features. A significant increase in speed in the order of four fold was obtained using the customized program. Different scalability tests using the developed software were compared against software developed in Acapella scripting language. The result of the test shows that the computational time is proportional to number of cells in the image and is inversely proportional to number of cores in a processor.</p> / Master of Applied Science (MASc)

La compréhension de la structure d’un logiciel est une première étape importante dans la résolution de tâches d’analyse et de maintenance sur celui-ci. En plus des liens définis par la hiérarchie, il existe un autre type de liens entre les éléments du logiciel que nous appelons liens d’adjacence. Une compréhension complète d’un logiciel doit donc tenir compte de tous ces types de liens. Les outils de visualisation sont en général efficaces pour aider un développeur dans sa compréhension d’un logiciel en lui présentant l’information sous forme claire et concise. Cependant, la visualisation simultanée des liens hiérarchiques et d’adjacence peut donner lieu à beaucoup d’encombrement visuel, rendant ainsi ces visualisations peu efficaces pour fournir de l’information utile sur ces liens. Nous proposons dans ce mémoire un outil de visualisation 3D qui permet de représenter à la fois la structure hiérarchique d’un logiciel et les liens d’adjacence existant entre ses éléments. Notre outil utilise trois types de placements différents pour représenter la hiérarchie. Chacun peut supporter l’affichage des liens d’adjacence de manière efficace. Pour représenter les liens d’adjacence, nous proposons une version 3D de la méthode des Hierarchical Edge Bundles. Nous utilisons également un algorithme métaheuristique pour améliorer le placement afin de réduire davantage l’encombrement visuel dans les liens d’adjacence. D’autre part, notre outil offre un ensemble de possibilités d’interaction permettant à un usager de naviguer à travers l’information offerte par notre visualisation. Nos contributions ont été évaluées avec succès sur des systèmes logiciels de grande taille. / Understanding the structure of software is an important first step in solving tasks of analysis and maintenance on it. However, in addition to the links defined by the hierarchy, there exists another type of links between elements of software that are called adjacency links. A complete understanding of software must take account of all these types of links. Visualization tools are generally effective in helping a developer in his understanding of software by presenting the information in a clear and concise manner. However, viewing these two types of links generate in general a lot of visual clutter, making these visualizations inefficient to provide useful information on these links. We propose in this M.Sc. thesis a 3D visualization tool that can represent both the hierarchical structure of an application and the adjacency relationships between its elements. Our tool uses three different types of layout to represent the hierarchy. Each layout can support efficiently the display of adjacency links. To represent adjacency links, we propose a 3D version of the Hierarchical Edge Bundles algorithm. We also use a metaheuristic algorithm to improve our layouts to further reduce visual clutter in the adjacency links. Moreover, our tool provides a set of interaction possibilities that allows a user to navigate through the information provided by our visualization. Our contributions have been evaluated successfully on large software systems.

<p>Device Management Applications are applications which are used to manage software on devices such as mobile phones. OMSI Forum provides such an application which is used to update the software on a phone. Software updates can be done at device management stations placed in stores or other service locations. Whenever a phone's software is updated, information about the update process is stored in a log. These logs can then be analyzed to generate statistics about updates such as the number of successful or failed updates or which faults that are common.</p><p>This master thesis project solves the problem of manually collecting and compiling logs from several stores by making this process automatic. Rather than collecting logs manually, each device management station sends its logs to a centralized server which stores all collected logs in a database. This makes it possible to generate charts and statistics in a simple manner from a web application. This solution makes the analysis more e ective, allowing users to concentrate on analyzing data by removing the work task of collecting logs.</p>

La compréhension de la structure d’un logiciel est une première étape importante dans la résolution de tâches d’analyse et de maintenance sur celui-ci. En plus des liens définis par la hiérarchie, il existe un autre type de liens entre les éléments du logiciel que nous appelons liens d’adjacence. Une compréhension complète d’un logiciel doit donc tenir compte de tous ces types de liens. Les outils de visualisation sont en général efficaces pour aider un développeur dans sa compréhension d’un logiciel en lui présentant l’information sous forme claire et concise. Cependant, la visualisation simultanée des liens hiérarchiques et d’adjacence peut donner lieu à beaucoup d’encombrement visuel, rendant ainsi ces visualisations peu efficaces pour fournir de l’information utile sur ces liens. Nous proposons dans ce mémoire un outil de visualisation 3D qui permet de représenter à la fois la structure hiérarchique d’un logiciel et les liens d’adjacence existant entre ses éléments. Notre outil utilise trois types de placements différents pour représenter la hiérarchie. Chacun peut supporter l’affichage des liens d’adjacence de manière efficace. Pour représenter les liens d’adjacence, nous proposons une version 3D de la méthode des Hierarchical Edge Bundles. Nous utilisons également un algorithme métaheuristique pour améliorer le placement afin de réduire davantage l’encombrement visuel dans les liens d’adjacence. D’autre part, notre outil offre un ensemble de possibilités d’interaction permettant à un usager de naviguer à travers l’information offerte par notre visualisation. Nos contributions ont été évaluées avec succès sur des systèmes logiciels de grande taille. / Understanding the structure of software is an important first step in solving tasks of analysis and maintenance on it. However, in addition to the links defined by the hierarchy, there exists another type of links between elements of software that are called adjacency links. A complete understanding of software must take account of all these types of links. Visualization tools are generally effective in helping a developer in his understanding of software by presenting the information in a clear and concise manner. However, viewing these two types of links generate in general a lot of visual clutter, making these visualizations inefficient to provide useful information on these links. We propose in this M.Sc. thesis a 3D visualization tool that can represent both the hierarchical structure of an application and the adjacency relationships between its elements. Our tool uses three different types of layout to represent the hierarchy. Each layout can support efficiently the display of adjacency links. To represent adjacency links, we propose a 3D version of the Hierarchical Edge Bundles algorithm. We also use a metaheuristic algorithm to improve our layouts to further reduce visual clutter in the adjacency links. Moreover, our tool provides a set of interaction possibilities that allows a user to navigate through the information provided by our visualization. Our contributions have been evaluated successfully on large software systems.

This dissertation seeks to address the multiple ways face or one’s public self-image is attacked, supported and maintained in Athol Fugard’s The Road to Mecca, My Children! My Africa! and Valley Song, and through this discussion demonstrate how the notion of face can make a contribution to the study and understanding of Athol Fugard’s work. In the pursuit of their goals/objectives, interactants perform speech acts which may threaten the face of other participants. The choice of strategies available to participants in the performance of these face-threatening acts (FTAs) includes going on record, off record (indirectly) or avoiding the FTA altogether (saying nothing). Each text offers a fresh perspective from which face can be analysed: rebelliousness against conformism (The Road to Mecca); the perspective of the cross-racial, cross-cultural relationships (My Children! My Africa!); and the context of a closely-knit family relationship (Valley Song). / English Studies / M.A. (Theory of Literature)

Neste estudo são apresentados os resultados do trabalho sobre simulações de redes de conexões complexas. Foram simuladas redes regulares, intermediárias e aleatórias com o número de nós e de conexões variando entre 103 e 5x103 e entre 2x104 e 105, respectivamente, e com probabilidade variando de 0 a 1 com passo de 0.1, com o enfoque na Teoria Espectral. Utilizando a linguagem C e o software Matlab, as redes são representadas pela sua matriz adjacência, com o objetivo de observar-se o comportamento de seus autovalores através de histogramas. A finalidade é a caracterização de redes complexas. Observa-se que a distribuição dos autovalores segue a lei semicircular de Wigner. / This study presents the results of the work about simulations of networks of complex connections. They were simulate regular networks, middlemen and aleatory with the number of nodes and of connections varying between 103 and 5x104 and between 2x104 and 105, respectively, and with probability varying from 0 to 1 with step of 0.1, with the focus in the Spectral Theory. Using the language C and the software Matlab, the networks are represented by its adjacency matrix, with the objective of observing the behavior of its eigenvalues through histograms. The purpose is the characterization of complex networks. Its observed that the eigenvalues distribution follows the Wigners semicircular law.

Neste estudo são apresentados os resultados do trabalho sobre simulações de redes de conexões complexas. Foram simuladas redes regulares, intermediárias e aleatórias com o número de nós e de conexões variando entre 103 e 5x103 e entre 2x104 e 105, respectivamente, e com probabilidade variando de 0 a 1 com passo de 0.1, com o enfoque na Teoria Espectral. Utilizando a linguagem C e o software Matlab, as redes são representadas pela sua matriz adjacência, com o objetivo de observar-se o comportamento de seus autovalores através de histogramas. A finalidade é a caracterização de redes complexas. Observa-se que a distribuição dos autovalores segue a lei semicircular de Wigner. / This study presents the results of the work about simulations of networks of complex connections. They were simulate regular networks, middlemen and aleatory with the number of nodes and of connections varying between 103 and 5x104 and between 2x104 and 105, respectively, and with probability varying from 0 to 1 with step of 0.1, with the focus in the Spectral Theory. Using the language C and the software Matlab, the networks are represented by its adjacency matrix, with the objective of observing the behavior of its eigenvalues through histograms. The purpose is the characterization of complex networks. Its observed that the eigenvalues distribution follows the Wigners semicircular law.

Made available in DSpace on 2016-03-15T19:37:45Z (GMT). No. of bitstreams: 1 Wander Lairson Costa.pdf: 1957133 bytes, checksum: 6819580d97bb5eaca5ea04352fcda0b8 (MD5) Previous issue date: 2013-03-15 / Universidade Presbiteriana Mackenzie / Cellular automata are totally discrete systems that act locally in a simple and deterministic way, but whose resulting global behavior can be extremely complex. The set of possible global configurations in one finite time step for a CA can be described by a regular language, which in turn can be represented by a finite automaton, more precisely the so-called process graph, in which all states are initial and final. Here, we study the temporal evolution complexity of the elementary cellular automata (i.e., one-dimensional, binary, with radius 1), and related previous works are revisited and discussed, indicating problems and their consequences. We also start up a novel approach for the problem, substituting the process graph based representation that describes the configuration at each time step by adjacency matrices derived from them. In fact, we extend the classical adjacency matrix notation, as they cannot fully represent process graphs. With this new notation, we show that it is possible to obtain the algorithm to generate a process graph for an arbitrary finite time step for each of the rules at study. In conclusion, although advancing the limit graph problem, it still remains open, and we provide suggestions for further research. / Autômatos celulares são sistemas totalmente discretos que agem localmente de forma simples e determinística, mas cujo comportamento global resultante pode ser extremamente complexo. O conjunto de possíveis configurações globais em um passo de tempo t finito para um autômato celular pode ser descrito por uma linguagem regular, a qual por sua vez pode ser representada por meio de um autômato finito, mais precisamente, pelo chamado grafo de processo, em que todos os estados são iniciais e finais. Estuda-se aqui a complexidade da evolução temporal dos autômatos celulares elementares (i.e., unidimensionais, binários, de raio 1), e trabalhos anteriores são revisitados e discutidos, no quais apontam-se problemas e suas consequências. Também inicia-se uma nova abordagem para o problema, substituindo a representação dos grafos de processo que descrevem a configuração a cada passo de tempo por matrizes de adjacência deles derivadas. De fato, estende-se a notação clássica de matriz de adjacência, já que ela se mostra insuficiente para descrever completamente os grafos de processo em questão. Com essa nova notação, mostra-se que é possível obter o algoritmo que gere o grafo de processo de tempo t para cada uma das regras estudadas. Conclui-se que, embora houve avanços para o problema do grafo limite, este ainda permanece aberto, e sugestões para continuação da pesquisa são dadas.

Device Management Applications are applications which are used to manage software on devices such as mobile phones. OMSI Forum provides such an application which is used to update the software on a phone. Software updates can be done at device management stations placed in stores or other service locations. Whenever a phone's software is updated, information about the update process is stored in a log. These logs can then be analyzed to generate statistics about updates such as the number of successful or failed updates or which faults that are common. This master thesis project solves the problem of manually collecting and compiling logs from several stores by making this process automatic. Rather than collecting logs manually, each device management station sends its logs to a centralized server which stores all collected logs in a database. This makes it possible to generate charts and statistics in a simple manner from a web application. This solution makes the analysis more e ective, allowing users to concentrate on analyzing data by removing the work task of collecting logs.