Rozprawy doktorskie na temat „Median graphs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Median graphs”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Genevois, Anthony. "Cubical-like geometry of quasi-median graphs and applications to geometric group theory". Thesis, Aix-Marseille, 2017. http://www.theses.fr/2017AIXM0569/document.
Pełny tekst źródłaThe class of quasi-median graphs is a generalisation of median graphs, or equivalently of CAT(0) cube complexes. The purpose of this thesis is to introduce these graphs in geometric group theory. In the first part of our work, we extend the definition of hyperplanes from CAT(0) cube complexes, and we show that the geometry of a quasi-median graph essentially reduces to the combinatorics of its hyperplanes. In the second part, we exploit the specific structure of the hyperplanes to state combination results. The main idea is that if a group acts in a suitable way on a quasi-median graph so that clique-stabilisers satisfy some non-positively curved property P, then the whole group must satisfy P as well. The properties we are interested in are mainly (relative) hyperbolicity, (equivariant) lp-compressions, CAT(0)-ness and cubicality. In the third part, we apply our general criteria to several classes of groups, including graph products, Guba and Sapir's diagram products, some wreath products, and some graphs of groups. Graph products are our most natural examples, where the link between the group and its quasi-median graph is particularly strong and explicit; in particular, we are able to determine precisely when a graph product is relatively hyperbolic
Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique". Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.
Pełny tekst źródłaThe median problem is one of the most investigated problem in metric graph theory. We will start by studying this problem in median graphs. We present a linear time algorithm based on the majority rule which characterize the median in median graphs and on a fast computation of the parallelism classes of the edges (the \Theta-classes) via LexBFS which is a particular breadth first search algorithm.We also provide linear time algorithms to compute the median set in the l_1-cube complexes of median graphs and in event structures. Then, we provide a characterization of the graphs with connected medians in the pth power of the graph and provide a polynomial method to check if a graph is a G^p-connected median graph, extending a result of Bandelt and Chepoi (case p=1). We use this characterization to prove that some important graph classes in metric graph theory have G2-connected medians, such as bipartite Helly graphs and bridged graphs. We will also studied the axiomatic aspect of the median function by investigating the ABC-problem, which determine the graphs (named ABC-graphs) in which the median function is the only consensus function verifying three simples axioms (A) Anonymat, (B) Betweeness and (C) Consistency. We show that modular graphs with G2-connected medians are ABC-graphs and define new axioms allowing us to characterize the median function on some graph classes. For example the graphs with connected medians (including Helly graphs). We also show that a known class of ABC-graphs (graphs satisfying the pairing property) is a proper subclass of bipartite Helly graphs and we investigate their recognition
Ren, Haolin. "Visualizing media with interactive multiplex networks". Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0036/document.
Pełny tekst źródłaNowadays, information follows complex paths: information propagation involving on-line editors, 24-hour news providers and social medias following entangled paths acting on information content and perception. This thesis studies the adaptation of classical graph measurements to multiplex graphs, to build visualizations from several graphical representations of the networks, and to combine them (synchronized multi-view visualizations, hybrid representations, etc.). Emphasis is placed on the modes of interaction allowing to take in hand the multiplex nature (multilayer) of the networks. These representations and interactive manipulations are also based on the calculation of indicators specific to multiplex networks. The work is based on two main datasets: one is a 12-year archive of the Japanese public daily broadcast NHK News 7, from 2001 to 2013. Another lists the participants in the French TV/radio shows between 2010 and 2015. Two visualization systems based on a Web interface have been developed for multiplex network analysis, which we call "Visual Cloud" and "Laputa". In the Visual Cloud, we formally define a notion of similarity between concepts and groups of concepts that we call co-occurrence possibility (CP). According to this definition, we propose a hierarchical classification algorithm. We aggregate the layers in a multiplex network of documents, and integrate that hierarchy into an interactive word cloud. Here we improve the traditional word cloud layout algorithms so as to preserve the constraints on the concept hierarchy. The Laputa system is intended for the complex analysis of dense and multidimensional temporal networks. To do this, it associates a graph with a segmentation. The segmentation by communities, by attributes, or by time slices, forms views of this graph. In order to associate these views with the global whole, we use Sankey diagrams to reveal the evolution of the communities (diagrams that we have increased with a semantic zoom). This thesis allows us to browse three aspects of the most interesting aspects of the data miming and BigData applied to multimedia archives: The Volume since our archives are immense and reach orders of magnitude that are usually not practicable for the visualization; Velocity, because of the temporal nature of our data (by definition). The Variety that is a corollary of the richness of multimedia data and of all that one may wish to want to investigate. What we can retain from this thesis is that we met each of these three challenges by taking an answer in the form of a multiplex network analysis. These structures are always at the heart of our work, whether in the criteria for filtering edges using the Simmelian backbone algorithm, or in the superposition of time slices in the complex networks, or much more directly in the combinations of visual and textual semantic indices for which we extract hierarchies allowing our visualization
Tawfik, Israa. "Links and graphs". Thesis, University of Plymouth, 2013. http://hdl.handle.net/10026.1/2863.
Pełny tekst źródłaWu, Diing-Wuu Vale. "Introduction to fractal by using interactive media design /". Online version of thesis, 1991. http://hdl.handle.net/1850/11287.
Pełny tekst źródłaMonterio, Carlos Eduardo Ferreira. "Investigating critical sense in the interpretation of media graphs". Thesis, University of Warwick, 2005. http://wrap.warwick.ac.uk/73122/.
Pełny tekst źródłaFerrer, Sumsi Miquel. "Theory and Algorithms on the Median Graph. Application to Graph-based Classification and Clustering". Doctoral thesis, Universitat Autònoma de Barcelona, 2008. http://hdl.handle.net/10803/5788.
Pełny tekst źródłaEn el reconeixement estructural de patrons, els grafs han estat usats normalment per a representar objectes complexos. En el domini dels grafs, el concepte de mediana és conegut com median graph. Potencialment, té les mateixes aplicacions que el concepte de mediana per poder ser usat com a representant d'un conjunt de grafs.
Tot i la seva simple definició i les potencials aplicacions, s'ha demostrat que el seu càlcul és una tasca extremadament complexa. Tots els algorismes existents només han estat capaços de treballar amb conjunts petits de grafs, i per tant, la seva aplicació ha estat limitada en molts casos a usar dades sintètiques sense significat real. Així, tot i el seu potencial, ha restat com un concepte eminentment teòric.
L'objectiu principal d'aquesta tesi doctoral és el d'investigar a fons la teoria i l'algorísmica relacionada amb el concepte de medinan graph, amb l'objectiu final d'extendre la seva aplicabilitat i lliurar tot el seu potencial al món de les aplicacions reals. Per això, presentem nous resultats teòrics i també nous algorismes per al seu càlcul. Des d'un punt de vista teòric aquesta tesi fa dues aportacions fonamentals. Per una banda, s'introdueix el nou concepte d'spectral median graph. Per altra banda es mostra que certes de les propietats teòriques del median graph poden ser millorades sota determinades condicions. Més enllà de les aportacioncs teòriques, proposem cinc noves alternatives per al seu càlcul. La primera d'elles és una conseqüència directa del concepte d'spectral median graph. Després, basats en les millores de les propietats teòriques, presentem dues alternatives més per a la seva obtenció. Finalment, s'introdueix una nova tècnica per al càlcul del median basat en el mapeig de grafs en espais de vectors, i es proposen dos nous algorismes més.
L'avaluació experimental dels mètodes proposats utilitzant una base de dades semi-artificial (símbols gràfics) i dues amb dades reals (mollècules i pàgines web), mostra que aquests mètodes són molt més eficients que els existents. A més, per primera vegada, hem demostrat que el median graph pot ser un bon representant d'un conjunt d'objectes utilitzant grans quantitats de dades. Hem dut a terme experiments de classificació i clustering que validen aquesta hipòtesi i permeten preveure una pròspera aplicació del median graph a un bon nombre d'algorismes d'aprenentatge.
Given a set of objects, the generic concept of median is defined as the object with the smallest sum of distances to all the objects in the set. It has been often used as a good alternative to obtain a representative of the set.
In structural pattern recognition, graphs are normally used to represent structured objects. In the graph domain, the concept analogous to the median is known as the median graph. By extension, it has the same potential applications as the generic median in order to be used as the representative of a set of graphs.
Despite its simple definition and potential applications, its computation has been shown as an extremely complex task. All the existing algorithms can only deal with small sets of graphs, and its application has been constrained in most cases to the use of synthetic data with no real meaning. Thus, it has mainly remained in the box of the theoretical concepts.
The main objective of this work is to further investigate both the theory and the algorithmic underlying the concept of the median graph with the final objective to extend its applicability and bring all its potential to the world of real applications. To this end, new theory and new algorithms for its computation are reported. From a theoretical point of view, this thesis makes two main contributions. On one hand, the new concept of spectral median graph. On the other hand, we show that some of the existing theoretical properties of the median graph can be improved under some specific conditions. In addition to these theoretical contributions, we propose five new ways to compute the median graph. One of them is a direct consequence of the spectral median graph concept. In addition, we provide two new algorithms based on the new theoretical properties. Finally, we present a novel technique for the median graph computation based on graph embedding into vector spaces. With this technique two more new algorithms are presented.
The experimental evaluation of the proposed methods on one semi-artificial and two real-world datasets, representing graphical symbols, molecules and webpages, shows that these methods are much more ecient than the existing ones. In addition, we have been able to proof for the first time that the median graph can be a good representative of a class in large datasets. We have performed some classification and clustering experiments that validate this hypothesis and permit to foresee a successful application of the median graph to a variety of machine learning algorithms.
Yang, Mengta. "Depth Functions, Multidimensional Medians and Tests of Uniformity on Proximity Graphs". Thesis, The George Washington University, 2014. http://pqdtopen.proquest.com/#viewpdf?dispub=3615104.
Pełny tekst źródłaWe represent the d-dimensional random vectors as vertices of a complete weighted graph and propose depth functions that are applicable to distributions in d-dimensional spaces and data on graphs. We explore the proximity graphs, examine their connection to existing depth functions, define a family of depth functions on the β-skeleton graph, suggest four types of depth functions on the minimal spanning tree (MST) and define depth functions including path depth, path depth of path length at most δ, all paths probability depth, eccentricity depth, peeling depth and RUNT depth. We study their properties, including affine invariance, maximality at the center, monotonicity and vanishing at infinity. We show that the β-skeleton depth is a family of statistical depth functions and define the sample β-skeleton depth function. We show that it has desirable asymptotic properties, including uniform consistency and asymptotic normality. We consider the corresponding multidimensional medians, investigate their robustness, computational complexity, compare them in a simulation study to find the multivariate medians under different distributions and sample sizes and explore the asymptotic properties of β-skeleton median. We generalize the univariate Greenwood statistic and Hegazy-Green statistic using depth induced order statistics and propose two new test statistics based on normal copula and interpoint distances for testing multivariate uniformity. We generalize the path depth under two-sample setting and propose a new multivariate equality of DF test. We study their empirical power against several copula and multivariate Beta alternatives. The topic is complemented with a discussion on the distribution and moments of the interpoint distances (ID) between bivariate uniform random vectors and the IDs between FGM copula random vectors.
Ratel, Sébastien. "Densité, VC-dimension et étiquetages de graphes". Electronic Thesis or Diss., Aix-Marseille, 2019. http://www.theses.fr/2019AIXM0427.
Pełny tekst źródłaConstructing labeling schemes supporting adjacency, distance or routing queries constituted the initial motivation of most of the results of this document. However, this manuscript concerns problem of more general interest such as bounding the density of graphs, studying the VC-dimension of set families, or investigating on metric and structural properties of graphs. As a first contribution, we upper bound the density of the subgraphs of Cartesian products of graphs, and of the subgraphs of halved-cubes. To do so, we extend the classical notion of VC-dimension (already used in 1994 by Haussler, Littlestone, and Warmuth to upper bound the density of the subgraphs of hypercubes). From our results, we deduce upper bounds on the size of labels used by an adjacency labeling scheme on these graph classes. We then investigate on distance and routing labeling schemes for two important families of metric graph theory: median graphs and bridged graphs. We first show that the class of cube-free median graphs on n vertices enjoys distance and routing labeling schemes both using labels of O(\log^3 n) bits. These labels can be decoded in constant time to respectively return the exact distance between two vertices, or a port to take from a source vertex in order to get (strictly) closer to a target one. We then describe an approximate distance labeling scheme for the family of K_4-free bridged graphs on n vertices. This scheme also uses labels of size O(\log^3 n) that can be decoded in constant time to return a value of at most four time the exact distance between two vertices
Johansson, Erik. "Phos Graphis". Thesis, Blekinge Tekniska Högskola, Sektionen för teknokultur, humaniora och samhällsbyggnad, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1627.
Pełny tekst źródłaRibeiro, Andre Figueiredo. "Graph dynamics : learning and representation". Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34184.
Pełny tekst źródłaIncludes bibliographical references (p. 58-60).
Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision a graph with five nodes and some edges can represent a table - where nodes correspond to particular shape descriptors for legs and a top, and edges to particular spatial relations. As a framework for representation, graphs invite us to simplify and view the world as objects of pure structure whose properties are fixed in time, while the phenomena they are supposed to model are actually often changing. A node alone cannot represent a table leg, for example, because a table leg is not one structure (it can have many different shapes, colors, or it can be seen in many different settings, lighting conditions, etc.) Theories of knowledge representation have in general concentrated on the stability of symbols - on the fact that people often use properties that remain unchanged across different contexts to represent an object (in vision, these properties are called invariants). However, on closer inspection, objects are variable as well as stable. How are we to understand such problems? How is that assembling a large collection of changing components into a system results in something that is an altogether stable collection of parts?
(cont.) The work here presents one approach that we came to encompass by the phrase "graph dynamics". Roughly speaking, dynamical systems are systems with states that evolve over time according to some lawful "motion". In graph dynamics, states are graphical structures, corresponding to different hypothesis for representation, and motion is the correction or repair of an antecedent structure. The adapted structure is an end product on a path of test and repair. In this way, a graph is not an exact record of the environment but a malleable construct that is gradually tightened to fit the form it is to reproduce. In particular, we explore the concept of attractors for the graph dynamical system. In dynamical systems theory, attractor states are states into which the system settles with the passage of time, and in graph dynamics they correspond to graphical states with many repairs (states that can cope with many different contingencies). In parallel with introducing the basic mathematical framework for graph dynamics, we define a game for its control, its attractor states and a method to find the attractors. From these insights, we work out two new algorithms, one for Bayesian network discovery and one for active learning, which in combination we use to undertake the object recognition problem in computer vision. To conclude, we report competitive results in standard and custom-made object recognition datasets.
by Andre Figueiredo Ribeiro.
S.M.
Zhu, Yanshu, i 朱妍姝. "Compact representation of medial axis transform". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206472.
Pełny tekst źródłapublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Rizzo, Thomas Philip. "Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands". Thesis, Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/91146.
Pełny tekst źródłaM.S.
Costa, André Luis da 1982. "Corte normalizado em grafos = um algoritmo aglomerativo para segmentação de imagens de colonias de bactérias= Normalized cut on graphs: an aglomerative algorithm for bacterial colonies image segmentation". [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267753.
Pełny tekst źródłaDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia
Made available in DSpace on 2018-08-22T22:09:46Z (GMT). No. of bitstreams: 1 Costa_AndreLuisda_M.pdf: 6614237 bytes, checksum: b36b41dce03cbb78f037ec20725bddd2 (MD5) Previous issue date: 2013
Resumo: O problema de segmentação de colônias de bactérias em placas de Petri possui algumas características bem distintas daquelas encontradas, por exemplo, em problemas de segmentação de imagens naturais. A principal característica é o alto número de colônias que podem ser encontradas em uma placa. Desta forma, é primordial que o algoritmo de segmentação seja capaz de realizar a segmentação da imagem em um grande número de regiões. Este cenário extremo é ideal para analisar limitações dos algoritmos de segmentação. De fato, neste trabalho foi verificado que o algoritmo de corte normalizado original, que se fundamenta na teoria espectral de grafos, é inadequado para aplicações que exigem que a segmentação seja realizada em um grande número de regiões. Contudo, a utilização do critério de corte normalizado para segmentar imagens de colônias de bactérias ainda é possível graças a um novo algoritmo que está sendo introduzido neste trabalho. O novo algoritmo fundamenta-se no agrupamento hierárquico dos nós do grafo, ao invés de utilizar conceito da teoria espectral. Experimentos mostram também que o biparticionamento de um grafo pelo novo algoritmo apresenta um valor de corte normalizado médio cerca de 40 vezes menor que o biparticionamento pelo algoritmo baseado na teoria espectral
Abstract: The problem of bacteria colonies segmentation in Petri dishes has some very different characteristics from those found, for example, in segmenting natural images. The main feature is the high number of colonies that can be found on a plate. Thus, it is essential that the segmentation algorithm is capable of performing the image segmentation into a huge number of regions. This extreme scenario is ideal for analyzing segmentation algorithms limitations. In fact, this study showed that the original normalized cut algorithm, which is based on the spectral graph theory, is inappropriate for applications that require that the segmentation be performed on a large number of regions. However, the use of normalized cut criteria for segmenting bacteria colonies images is still possible thanks to a new algorithm that is being introduced in this paper. The new algorithm is based on hierarchical clustering of the graph nodes, instead of using the spectral theory concepts. Experiments also show that the bi-partitioning of a graph by the new algorithm has a normalized cut average value about 40 times lesser than the bi-partitioning by the algorithm based on the spectral theory
Mestrado
Tecnologia e Inovação
Mestre em Tecnologia
Zulfiqar, Omer. "Detecting Public Transit Service Disruptions Using Social Media Mining and Graph Convolution". Thesis, Virginia Tech, 2021. http://hdl.handle.net/10919/103745.
Pełny tekst źródłaMaster of Science
Millions of people worldwide rely on public transit networks for their daily commutes and day to day movements. With the growth in the number of people using the service, there has been an increase in the number of daily passengers affected by service disruptions. This thesis and research involves proposing and developing three different approaches to help aid in the timely detection of these disruptions. In this work we have developed a pure data mining approach along with two deep learning models using neural networks and live data from Twitter to identify these disruptions. The data mining approach uses a set of dirsuption related input keywords to identify similar keywords within the live Twitter data. By collecting historical data we were able to create deep learning models that represent the vocabulary from the disruptions related Tweets in the form of a graph. A graph is a collection of data values where the data points are connected to one another based on their relationships. A longer chain of connection between two words defines a weak relationship, a shorter chain defines a stronger relationship. In our graph, words with similar contextual meanings are connected to each other over shorter distances, compared to words with different meanings. At the end we use a neural network as a classifier to scan this graph to learn the semantic relationships within our data. Afterwards, this learned information can be used to accurately classify the disruption related Tweets within a pool of random Tweets. Once all the proposed approaches have been developed, a benchmark evaluation is performed against other existing text classification techniques, to justify the effectiveness of the approaches. The final results indicate that the proposed graph based models achieved a higher accuracy, compared to the data mining model, and also outperformed all the other baseline models. Our Tweet-Level GCN had the highest accuracy of 89.9%.
He, Shuiqing, i 何水清. "Spectral analysis of medial axis for shape description". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2015. http://hdl.handle.net/10722/212606.
Pełny tekst źródłapublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Bruno, Alexander. "Visual-Audio Media: Transformation and Communication". VCU Scholars Compass, 2015. http://scholarscompass.vcu.edu/etd/3768.
Pełny tekst źródłaRajeh, Tawfik. "Modeling flow in fractured geologic media : upscaling and application to deep geothermal reservoirs". Thesis, Toulouse, INPT, 2019. http://www.theses.fr/2019INPT0051.
Pełny tekst źródłaFractures constitute major pathways for flow and transport in fractured porous rocks. These types of rocks are encountered in a wide range of applications like for example gas and petroleum engineering, CO2 sequestration and geothermal energy extraction. The present thesis presents a framework to analyze geometrical, topological and hydraulic properties of 3D planar fracture networks with focus on upscaling these properties to obtain an equivalent continuum, in view of application to simulations of geothermal reservoir exploitation. The description of fractures and discrete fracture networks (DFN), their statistical properties and their generation procedures are studied. As permeability plays a key role in flow and transport in fractured porous rocks, we have developed a fast upscaling approach for determining the equivalent permeability tensor of 3D fractured porous media. This new approach is based on the superposition principle improved by empirical connectivity factors in order to take into account the connectivity and percolation properties of the fracture network. Although efficient in predicting permeability, the proposed method presents a major limitation due mainly to the difficulty in assessing the percolation and connectivity properties of the network. To overcome these limitations and for further insightful analyses of DFN composed of planar fractures, an original framework of geometrical and topological analysis of 3D fracture networks has been developed. In this framework, all the geometrical and topological attributes (intersections, areas, trace lengths, clusters, percolating clusters, etc.) of a DFN are explicitly calculated by a set of algorithms. These algorithms are validated in detail by comparison to commercial softwares, and their computational efficiency is highlighted. The final purpose of this framework is to give a graph representation of the DFN. Given the newly developed tools, our capabilities of treating fracture networks have drastically increased. Hence, using a graph representation of the DFN, new approaches have been developed concerning two main issues with fracture networks: (i) percolation, (ii) clustering phenomenon (i.e., the formation of clusters by groups of fractures) and (iii) permeability upscaling. A large scale thermo-hydraulic simulator has therefore been developed with the finite volume open source code “OpenFoam”. The purpose is to apply the upscaling techniques to large scale reservoir configurations with a full coupling with heat transfer. A typical example of injectionproduction wells in a 3D geothermal reservoir is presented, and other cases are being developed within the GEOTREF project ( www.geotref.com )
Yamak, Zaher Rabah. "Multiple identities detection in online social media". Thesis, Normandie, 2018. http://www.theses.fr/2018NORMIR01/document.
Pełny tekst źródłaSince 2004, online social medias have grown hugely. This fast development had interesting effects to increase the connection and information exchange between users, but some negative effects also appeared, including fake accounts number growing day after day. Sockpuppets are multiple fake accounts created by a same user. They are the source of several types of manipulation such as those created to praise, defend or support a person or an organization, or to manipulate public opinion. In this thesis, we present SocksCatch, a complete process to detect and group sockpuppets, which is composed of three main phases: the first phase objective is the process preparation and data pre-processing; the second phase objective is the detection of the sockpuppet accounts using machine learning algorithms; the third phase objective is the grouping of sockpuppet accounts created by a same user using community detection algorithms. These phases are declined in three stages: a model stage to represent online social medias, where we propose a general model of social media dedicated to the detection and grouping of sockpuppets; an adaptation stage to adjust the process to a particular social media, where we instantiate and evaluate the SocksCatch model on a selected social media; and a real-time stage to detect and group the sockpuppets online, where SocksCatch is deployed online on a selected social media. Experiments have been performed on the adaptation stage using real data crawled from English Wikipedia. In order to find the best machine learning algorithm for sockpuppet's detection phase, the results of six machine learning algorithms are compared. In addition, they are compared with the literature, and the results show that our proposition improves the accuracy of the detection of sockpuppets. Furthermore, the results of five community detection algorithms are compared for sockpuppet's grouping phase, in order to find the best community detecton algorithm that will be used in real-time stage
Ajami, Sam, i Lucas Maupin. "The effects of video gaming on university grades". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146654.
Pełny tekst źródłaIn this 21st century IT-world, the use of video gaming has dramatically grown and taken a firm place in many young peoples’ busy day-to-day schedule. As a result, many are growing worried that video gaming will affect people in a negative way, especially when it comes to students’ academic performance. This thesis is an investigation of the correlation between games and university grades amongst students. Our results show that students, who played more, had more problems with their grades than the ones who played less. However, the results also show that gaming itself is not the problem, as the correlation between hours spent gaming and grades, is similar to the correlation between hours spent on other hobbies and grades. In essence, two hours of video gaming affects the grades just as much as two hours of physical exercise. The conclusion from our research is that it is the time spent on other activities than studying, that affects the grades. Video gaming is however amongst the easiest activities to be engaged in for an extended period of time, and can therefore be indirectly harmful to students’ grades.
De, Santis Simone. "Quantum Median Filter for Total Variation denoising". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2022.
Znajdź pełny tekst źródłaWang, Rui, i 王睿. "Medial axis simplification based on global geodesic slope and accumulated hyperbolic distance". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B48330139.
Pełny tekst źródłapublished_or_final_version
Computer Science
Master
Master of Philosophy
Khodabandeh, Bizhan. "Voice by Design: Experiments in Redistributing Media". VCU Scholars Compass, 2008. http://scholarscompass.vcu.edu/etd/980.
Pełny tekst źródłaTimney, Todd F. "Design History Matters: Visualizing Graphic Design History Through New Media". VCU Scholars Compass, 2007. http://scholarscompass.vcu.edu/etd_retro/38.
Pełny tekst źródłaVicente, Miguel Reis. "User characterization in social media". Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/21758.
Pełny tekst źródłaO crescimento acentuado das Redes Sociais que se verificou num passado recente, criou uma nova área de estudo na investigação em análise e extração de dados. A sua disseminação pela sociedade moderna torna-as uma fonte interessante para a aplicação de ciência dos dados, visto que auxiliam a perceção de comportamentos e padrões em dados sociais. Este tipo de informação possui valor estratégico em áreas como a publicidade e o marketing. Nesta dissertação é apresentado um protótipo para uma aplicação web que visa apresentar informação sobre a rede Twitter e os utilizadores que a compõem, através de esquemas de visualização de dados. Esta aplicação adota um modelo de dados de um grafo de propriedades, armazenado numa base de dados de grafos, para permitir uma análise eficiente das relações entre os dados existentes no Twitter. Para além disso, também faz uso de algoritmos de aprendizagem supervisionados e não-supervisionados, assim como análise estatística, para extrair padrões no conteúdo de tweets e prever atributos latentes em utilizadores do Twitter. O objetivo final é permitir a caraterização dos utilizadores Portugueses do Twitter, através da interpretação dos resultados apresentados.
The massive growth of Social Media platforms in recent years has created a new area of study for Data Mining research. Its general dissemination in modern society makes it a very interesting data science resource, as it enables the better understanding of social behavior and demographic statistics, information that has strategic value in business areas like marketing and advertising. This dissertation presents a prototype for a web application that provides a number of intuitive and interactive data visualization schemes that present information about the Twitter network and its individual users. This application leverages a property graph data model, modeled from a collection of millions of tweets from the Portuguese community and stored in a state of the art graph database, to enable an efficient analysis of the existent relationships in Twitter data. It also makes use of Supervised and Unsupervised learning algorithms, as well as statistical analysis, to extract meaningful patterns in tweets content and predict latent attributes in Twitter users. The end goal is to allow the characterization of the Portuguese users in Twitter, through the created visual representations of the achieved results.
King, Mike. "Computer media in the visual arts, and their user interfaces". Thesis, Royal College of Art, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293932.
Pełny tekst źródłaChak, Daniel 1980. "Enhanced modeling : real-time simulation and modeling of graph based problems on interactive workbenches". Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/26915.
Pełny tekst źródłaIncludes bibliographical references (p. 125-127).
This thesis presents a methodology and framework for designing systems that apply real-time simulation of computational models throughout the modeling and parameter modification stages of problem solving for graph based problems. An interactive problem solving technique is presented where the lines between problem modeling and simulation are blurred, enhancing the outcome of traditional problem solving. To demonstrate the versatility of the framework and methodology, two applications not normally thought of as graph problems - a circuit design application and an airport passenger flow application - are developed and tested. Three user studies test various parts of the framework, as well as the overall concept of real-time simulation on an interactive workbench. The first study provides quantitative support for the efficacy of the interaction technique chosen for manipulating graph structures. The second provides observational results of using the circuit design application to teach physics. The third addresses whether blurred lines of modeling and analysis enhance problem solving.
by Daniel Chak.
S.M.
Böhlen, Boris. "Ein parametrisierbares Graph-Datenbanksystem für Entwicklungswerkzeuge /". Aachen : Shaker, 2006. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=016030096&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Pełny tekst źródłaCascaes, Julio C?sar Silveira. "Fon?grafos e Gramofones : media??es t?cnicas em Porto Alegre (1892 ? 1927)". Pontif?cia Universidade Cat?lica do Rio Grande do Sul, 2016. http://tede2.pucrs.br/tede2/handle/tede/6628.
Pełny tekst źródłaMade available in DSpace on 2016-05-03T15:19:45Z (GMT). No. of bitstreams: 1 DIS_JULIO_CESAR_SILVEIRA_CASCAES_COMPLETO.pdf: 4298468 bytes, checksum: 3968286b6e07b771fe1bba84d9ef77aa (MD5) Previous issue date: 2016-03-21
Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior - CAPES
This paper discusses the history of mechanical sound recording devices and their subscription to the musical production chain and their development in Brazil, having printed sources, especially newspapers and magazines, as the means for analysis. Phonographs contributed for several technological innovations in the field of communication, but were also effective for the register of musical pieces. In the 20th century, Gramophones and records quickened the processes of mediation between the instances of production and the audiences, strengthening the first phonographic companies. The first phonograph arrived in Brazil in 1878 as a great technological innovation. The starting point is the premise that the press took fundamental part in the consolidation of these devices in the country. We intend to place sound reproducing devices within the context of representations of modernity, starting from the study of the urban changes taking place in Rio de Janeiro, S?o Paulo and Porto Alegre. The social environments of musical exchanges, the roles of cultural mediators and the main agents of technological interchange are examined in order to verify their contributions for the first phonographic records. Finally, the printed sources from Porto Alegre are analyzed so the emergence of phonographs and Gramophones can be featured. Taking urban growth, musical culture and the first phonographic experiences into account, this study will assemble city historians, old chroniclers, press critique, pieces of advertisement, catalogs and all sorts of printed material relevant to the mapping of the presence of phonographs and Gramophones in streets, bars and business establishments, probing, through texts and discourses, the exaltation of, the indifference towards and the reactions against the mechanical technology of sound recording.
Esta disserta??o problematiza a hist?ria dos reprodutores sonoros mec?nicos e sua inscri??o ? cadeia de produ??o musical brasileira, mediante a an?lise de fontes impressas (sobretudo por meio de jornais e revistas). Os fon?grafos apareceram junto a v?rias inova??es tecnol?gicas na ?rea da comunica??o, mas se mostraram tamb?m eficazes no registro de m?sicas. No s?culo XX, os gramofones e os discos aceleraram o processo de media??o t?cnica entre as inst?ncias de cria??o e o p?blico, determinando o fortalecimento das primeiras companhias fonogr?ficas. O primeiro fon?grafo chegou ao Brasil em 1878 como uma grande inova??o tecnol?gica. Parte-se do pressuposto de que a imprensa participou na consolida??o desses aparatos no pa?s. As not?cias e an?ncios dos peri?dicos brasileiros e das revistas ilustradas s?o utilizados na interpreta??o dos discursos de legitima??o e na constru??o de um p?blico consumidor. Busca-se contextualizar os reprodutores sonoros nas representa??es da modernidade, a partir da investiga??o das transforma??es urbanas ocorridas no Rio de Janeiro, S?o Paulo e Porto Alegre. Neste aspecto s?o verificados os espa?os de sociabilidade da m?sica, o papel dos mediadores culturais e os principais intermedi?rios da tecnologia para identificar suas contribui??es nos primeiros registros fonogr?ficos. Por fim, ser?o analisadas as fontes impressas porto-alegrenses para caracterizar a emerg?ncia de fon?grafos e gramofones na cidade. Considerando os aspectos de seu crescimento urbano, da sua cultura musical e das primeiras experi?ncias fonogr?ficas, este estudo tratar? de reunir os historiadores da cidade, os antigos cronistas, as cr?ticas jornal?sticas, os an?ncios publicit?rios, os cat?logos e demais impressos relevantes no rastreamento de fon?grafos e gramofones pelas ruas, lares e estabelecimentos comerciais, buscando, nos seus discursos, a exalta??o, a indiferen?a e as rea??es ? tecnologia mec?nica de grava??o sonora.
Rickert, Markus. "Inhaltsbasierte Analyse und Segmentierung narrativer, audiovisueller Medien". Doctoral thesis, Universitätsbibliothek Chemnitz, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-226724.
Pełny tekst źródłaAudiovisual media, especially movies and TV shows, developed within the last hundred years into major mass media. Today, large stocks of audiovisual media are managed in databases and media libraries. The content is provided to professional users as well as private consumers. A particular challenge lies in the indexing, searching and description of multimedia assets. The segmentation of audiovisual media as a branch of video analysis forms the basis for various applications in multimedia information retrieval, content browsing and video summarization. In particular, the segmentation into semantic meaningful scenes or sequences is difficult. It requires a special understanding of cinematic style elements that were used to support the narration during the creative process of film production. This work examines the cinematic style elements and how they can be used in the context of algorithmic methods for analysis. For this purpose, an analysis framework was developed as well as a method for sequence-segmentation of films and videos. It can be shown that semantic relationships can be found in narrative audiovisual media, which lead to an appropriate sequence segmentation, by using a multi-stage analysis process, based on visual MPEG-7 descriptors
Kowalczyk, Brian P. "EGANWO : the graphic novel's escape to digital media /". Online version of thesis, 2009. http://hdl.handle.net/1850/11652.
Pełny tekst źródłaBhattacharya, Devipsita, i Devipsita Bhattacharya. "Network Theoretic Approaches for Understanding and Analyzing Social Media Based News Article Propagation". Diss., The University of Arizona, 2016. http://hdl.handle.net/10150/620858.
Pełny tekst źródłaGhazal, Salman. "Étude de la conjecture de Seymour sur le second voisinage". Phd thesis, Université Claude Bernard - Lyon I, 2011. http://tel.archives-ouvertes.fr/tel-00744560.
Pełny tekst źródłaRickert, Markus. "Inhaltsbasierte Analyse und Segmentierung narrativer, audiovisueller Medien". Universitätsverlag Chemnitz, 2016. https://monarch.qucosa.de/id/qucosa%3A20753.
Pełny tekst źródłaAudiovisual media, especially movies and TV shows, developed within the last hundred years into major mass media. Today, large stocks of audiovisual media are managed in databases and media libraries. The content is provided to professional users as well as private consumers. A particular challenge lies in the indexing, searching and description of multimedia assets. The segmentation of audiovisual media as a branch of video analysis forms the basis for various applications in multimedia information retrieval, content browsing and video summarization. In particular, the segmentation into semantic meaningful scenes or sequences is difficult. It requires a special understanding of cinematic style elements that were used to support the narration during the creative process of film production. This work examines the cinematic style elements and how they can be used in the context of algorithmic methods for analysis. For this purpose, an analysis framework was developed as well as a method for sequence-segmentation of films and videos. It can be shown that semantic relationships can be found in narrative audiovisual media, which lead to an appropriate sequence segmentation, by using a multi-stage analysis process, based on visual MPEG-7 descriptors.
Waites, Peter. "On the Boundaries of Watchmen : Paratextual Narratives across Media". Licentiate thesis, Uppsala universitet, Engelska institutionen, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-266867.
Pełny tekst źródłaSchutte, Stacey C. "A study of strength and vasoactivity in a tissue engineered vascular media". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28241.
Pełny tekst źródłaCommittee Chair: Nerem, Robert M.; Committee Member: Gleason, Rudolf L.; Committee Member: Taylor, W. Robert; Committee Member: Vito, Raymond P.; Committee Member: Wang, Yadong.
Sisk, Christopher Andrew. "In Media Res". VCU Scholars Compass, 2018. https://scholarscompass.vcu.edu/etd/5444.
Pełny tekst źródłaWagner, Emmanuel Turaev Vladimir G. "Sur l'homologie de Khovanov-Rozansky des graphes et des entrelacs /". Paris, 2007. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=016808065&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Pełny tekst źródłaLukovszki, Tamás. "New results on geometric spanners and their applications /". Paderborn : HNI, 1999. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=015378426&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Pełny tekst źródłaUddin, Mohammed Saleh. "Representation of formal and spatial analysis in computational media : a case study of Louis I. Kahn's National Assembly complex". Thesis, University of Sheffield, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310630.
Pełny tekst źródłaRandall, Robert 1948. "Access writing written segment and documentation accompanying the multi-media research project submitted on a series of four CD ROMs". Monash University, Dept. of Fine Arts, 1998. http://arrow.monash.edu.au/hdl/1959.1/7634.
Pełny tekst źródłaCoco, Giuseppe Antonio. "Social media evaluation for non-profit organizations : The case of Oxfam Italia". Thesis, Uppsala universitet, Medier och kommunikation, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-232708.
Pełny tekst źródłaVandergriff, Elisa Leigh. "SONDER: Exploration of the Relationship between Digital Media and Graphic Design through the Creation of Print and Digital Publications". Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/honors/465.
Pełny tekst źródłaLangmajerová, Tereza. "Návrh mediální strategie společnosti Meetfactory". Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-206970.
Pełny tekst źródłaNeuhaus, Stefan. "Eigenschaften kleinster dominierender Mengen und Dominanzzahlen von Damengraphen /". München : Verl. Dr. Hut, 2009. http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017719424&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA.
Pełny tekst źródłaBaumann, Annika. "Network Science – Applications in Technology, Business and Social Media". Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19216.
Pełny tekst źródłaNetworks constitute an integral part of our lives. One of the most important communication networks is the Internet which led to large changes in everyday life, which are examined in part in this dissertation. Overall, the present dissertation is subdivided into three areas, which are based on the traditional three dimensions of information systems, comprising perspectives technology, management and organization. At the core of this dissertation is the technological perspective, centered on an analysis of the structure and robustness of the Internet network using the mathematical-methodical aspect of graph theory. The second part of the thesis deals with the management perspective. The focus lies on the understanding and prediction of user behavior in the e-commerce context utilizing methods of predictive modeling. The third area includes the organizational perspective from the point of view of users. Here, two specific sub-areas are selected. The first sub-area revolves around social media websites, with the goal of understanding how sub-groups of users utilize them in different ways. The second area is centered around the aspect of how the propagation of mobile devices influences individuals in their personal and professional environments. Based on these three perspectives, a total of 18 studies were conducted within the scope of this dissertation, using different methodological applications to gain scientific insights with respect to the areas examined.
Helgesson, Joy. "English in the digital era : Swedish grades 4-6 teachers’ use of pupil’s extramural English experience of new media". Thesis, Högskolan Dalarna, Pedagogiskt arbete, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:du-27445.
Pełny tekst źródłaEngelska
Politis, Anastasios E. "Human capital development and competence structures in changing media production environments". Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-25.
Pełny tekst źródłaThis doctoral thesis discusses the competence structures and the development of human capital in the graphic arts and media sector. The study has focused on exploring the new media landscape and in particular the structural changes that influence the sector, the print-versuselectronic- media debate and the future of print media. The influence of new technologies and management concepts on the graphic arts and media sector has also been investigated, as has the role and the importance of people in new societal and industrial settings as well as new ways of managing and developing people in changing media environments.
The primary research objective was to identify the competence requirements and characteristics for existing and potential employees in the graphic arts and media sector and, in particular, the areas of digital printing and cross-media publishing. The second objective was to elucidate the various actions and strategies established and applied for the professional development of people in the graphic arts and media sector, such as further training, recruitment policies and the evaluation and certification of competence. The third objective of the study was to suggest the formation of a strategy for the professional development of people in the graphic arts and media sector – namely the creation of a human capital development strategy. An important issue was to identify the various components (or substrategies) of the strategy and determine if it was possible to integrate them under a common platform.
The work has been based on literature studies, industry reports and observations, market analyses and forecasts, and empirical studies. Participatory research methods have also been used. In addition, case-study research has been performed at the company and sector levels. Human resource management and development concepts have been surveyed to determine whether they are efficient for the professional development of people in the entire spectrum of an industry sector.
The graphic arts and media sector – including print media – will remain active for the foreseeable future; however, the results presented here show that the sector has been significantly influenced by structural changes that have taken place over the last decade, affecting organizations, companies and people involved in the sector, and this process of change will continue.
The study shows that there is indeed a need for new competence in people employed in or to be recruited to the graphic arts and media sector. The initial identification and description of the competences for the new structure of the graphic arts and media industry is proposed. Various actions for the development of people in the sector, mainly regarding education, further and continuous learning, and recruitment, are also identified. However, these activities have been established mainly at the national level by various organizations (educational institutes, industrial partners and the governmental/European Union authorities).
Finally, the principal characteristics of a human capital development strategy are described, and components (or substrategies) that form a strategy that could be introduced for the graphic arts and media sector in Europe are proposed.
Keywords: Graphic arts and media sector, digital printing, cross-media publishing, human capital, intellectual capital, human resource management and development, human capital development strategy.
Merceron, Aymeric. "Milieux granulaires réactifs : dynamique et structure autour de grains en transformation". Thesis, Paris 6, 2016. http://www.theses.fr/2016PA066473/document.
Pełny tekst źródłaPhysical and chemical transformations appearing in reactive granular media yield strong dynamical and structural reorganizations. Widely used for industrial applications, the behavior of these evolving materials needs to be understood. In this work, we experimentally study the rearrangements of a model granular packing undergoing localized transformations of one or several grains. The experimental setups allow a two-dimensional tracking of the surrounding structure while one or several grains are either reducing in size or being pulled out of the packing. The average long-term response of the material is similar to quasi-static flows commonly observed in silos. The instantaneous behavior of the packing is heterogeneous in space and time. It shows an intermittent dynamic with events decorrelated in time whose amplitudes are power-law distributed. The sizes of the evolving grains play an important role on the dynamical response of the granular packing by the appearance of arches for the smallest intruders. Moreover, the presence of a second evolving grain generates cooperative effects. A characteristic distance between the two intruders is found, it does depend on the packing properties and not on the size of the evolving grains. Finally, instantaneous evolutions of local densities show similar distributions suggesting a unique mechanism in terms of structural reorganizations
Makryniotis, Thomas. "Identity through dress in virtual environments". Thesis, University of Kent, 2013. http://ualresearchonline.arts.ac.uk/7086/.
Pełny tekst źródła