Relevant bibliographies by topics / Median graphs

Academic literature on the topic 'Median graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Median graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Median graphs"

1

Klavžar, Sandi, and Riste Škrekovski. "On median graphs and median grid graphs." Discrete Mathematics 219, no. 1-3 (May 2000): 287–93. http://dx.doi.org/10.1016/s0012-365x(00)00085-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Imrich, Wilfried, Sandi Klavzar, and Henry Martyn Mulder. "Median Graphs and Triangle-Free Graphs." SIAM Journal on Discrete Mathematics 12, no. 1 (January 1999): 111–18. http://dx.doi.org/10.1137/s0895480197323494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Seemann, Carsten R., Vincent Moulton, Peter F. Stadler, and Marc Hellmuth. "Planar median graphs and cubesquare-graphs." Discrete Applied Mathematics 331 (May 2023): 38–58. http://dx.doi.org/10.1016/j.dam.2023.01.022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

McMorris, F. R., Henry Martyn Mulder, and Fred S. Roberts. "The median procedure on median graphs." Discrete Applied Mathematics 84, no. 1-3 (May 1998): 165–81. http://dx.doi.org/10.1016/s0166-218x(98)00003-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vesel, Aleksander. "Recognizing pseudo-median graphs." Discrete Applied Mathematics 116, no. 3 (February 2002): 261–69. http://dx.doi.org/10.1016/s0166-218x(00)00327-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

SIGARRETA, JOSÉ M. "Hyperbolicity in median graphs." Proceedings - Mathematical Sciences 123, no. 4 (October 27, 2013): 455–67. http://dx.doi.org/10.1007/s12044-013-0149-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Brešar, Boštjan. "Characterizing almost-median graphs." European Journal of Combinatorics 28, no. 3 (April 2007): 916–20. http://dx.doi.org/10.1016/j.ejc.2005.10.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bandelt, Hans-Jürgen, and Henry Martyn Mulder. "Regular pseudo-median graphs." Journal of Graph Theory 12, no. 4 (1988): 533–49. http://dx.doi.org/10.1002/jgt.3190120410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tardif, Claude. "On compact median graphs." Journal of Graph Theory 23, no. 4 (December 1996): 325–36. http://dx.doi.org/10.1002/(sici)1097-0118(199612)23:4<325::aid-jgt1>3.0.co;2-t.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chastand, Marc, and Norbert Polat. "Invariant Hamming graphs in infinite quasi-median graphs." Discrete Mathematics 160, no. 1-3 (November 1996): 93–104. http://dx.doi.org/10.1016/0012-365x(95)00151-l.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Median graphs"

1

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.

Full text
Abstract:
La classe des graphes quasi-médians est une généralisation des graphes médians, ou de manière équivalente, des complexes cubiques CAT(0). L'objectif de cette thèse est d'introduire ces graphes dans le monde de la théorie géométrique des groupes. Dans un premier temps, nous étendons la notion d'hyperplan définie dans les complexes cubiques CAT(0), et nous montrons que la géométrie d'un graphe quasi-médian se réduit essentiellement à la combinatoire de ses hyperplans. Dans la deuxième partie de notre texte, qui est le cœur de la thèse, nous exploitons la structure particulière des hyperplans pour démontrer des résultats de combinaison. L'idée principale est que si un groupe agit d'une bonne manière sur un graphe quasi-médian de sorte que les stabilisateurs de cliques satisfont une certaine propriété P de courbure négative ou nulle, alors le groupe tout entier doit satisfaire P également. Les propriétés que nous considérons incluent : l'hyperbolicité (éventuellement relative), les compressions lp (équivariantes), la géométrie CAT(0) et la géométrie cubique. Finalement, la troisième et dernière partie de la thèse est consacrée à l'application des critères généraux démontrés précédemment à certaines classes de groupes particulières, incluant les produits graphés, les groupes de diagrammes introduits par Guba et Sapir, certains produits en couronne, et certains graphes de groupes. Les produits graphés constituent notre application la plus naturelle, où le lien entre le groupe et son graphe quasi-médian associé est particulièrement fort et explicite; en particulier, nous sommes capables de déterminer précisément quand un produit graphé est relativement hyperbolique
The 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
APA, Harvard, Vancouver, ISO, and other styles
2

Bénéteau, Laurine. "Médians de graphes : algorithmes, connexité et axiomatique." Electronic Thesis or Diss., Aix-Marseille, 2022. http://www.theses.fr/2022AIXM0512.

Full text
Abstract:
Le problème du médian est un des problèmes les plus étudiés en théorie des espaces métriques. Nous l'étudions dans les graphes médians d'un point de vue algorithmique. Nous présentons un algorithme linéaire basé sur un calcul rapide des classes de parallélisme des arêtes (les Thêta-classes) via un parcours en largeur particulier (LexBFS). Nous donnons également un algorithme linéaire pour le problème du médian dans les l1-complexes cubiques des graphes médians et dans les structures d'évènements.Ensuite, nous présentons une caractérisation des graphes aux médians connexes dans la p-ième puissance Gp du graphe et donnons une méthode polynomiale pour vérifier si un graphe est un graphe aux médians Gp-connexes, étendant un résultat de Bandelt et Chepoi (cas p=1). Nous utilisons cette caractérisation pour montrer que certaines classes de graphes sont G2-connexes, comme les graphes de Helly bipartis et les graphes pontés. Nous travaillons également sur l'aspect axiomatique en étudiant l'ABC-problème, qui consiste à déterminer les graphes (nommés ABC-graphes) dans lesquels la fonction médian est l'unique fonction consensus respectant trois axiomes simples (A) Anonymat, (B) Intervalle (Betweeness) et (C) Cohérence. Nous montrons que les graphes modulaires aux médians G2-connexes sont des ABC-graphes et définissons de nouveaux axiomes pour caractériser la fonction médian dans d'autres classes de graphes, comme les graphes aux médians connexes. Nous prouvons également que les graphes respectant la propriété d'appariement (qui sont des ABC-graphes) est une sous-classe propre des graphes de Helly bipartis et étudions la complexité de la reconnaissance de ces graphes
The 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
APA, Harvard, Vancouver, ISO, and other styles
3

Ren, Haolin. "Visualizing media with interactive multiplex networks." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0036/document.

Full text
Abstract:
Les flux d’information suivent aujourd’hui des chemins complexes: la propagation des informations, impliquant éditeurs on-line, chaînes d’information en continu et réseaux sociaux, emprunte alors des chemins croisés, susceptibles d’agir sur le contenu et sa perception. Ce projet de thèse étudie l’adaptation des mesures de graphes classiques aux graphes multiplexes en relation avec le domaine étudié, propose de construire des visualisations à partir de plusieurs représentations graphiques des réseaux, et de les combiner (visualisations multi-vues synchronisées, représentations hybrides, etc.). L’accent est mis sur les modes d’interaction permettant de prendre en compte l’aspect multiplexe (multicouche) des réseaux. Ces représentations et manipulations interactives s’appuient aussi sur le calcul d’indicateurs propres aux réseaux multiplexes. Ce travail est basé sur deux jeux de données principaux: l’un est une archive de 12 ans de l’émission japonaise publique quotidienne NHK News 7, de 2001 à 2013. L’autre recense les participants aux émissions de télévision/radio françaises entre 2010 et 2015. Deux systèmes de visualisation s’appuyant sur une interface Web ont été développés pour analyser des réseaux multiplexes, que nous appelons «Visual Cloud» et «Laputa». Dans le Visual Cloud, nous définissons formellement une notion de similitude entre les concepts et les groupes de concepts que nous nommons possibilité de co-occurrence (CP). Conformément à cette définition, nous proposons un algorithme de classification hiérarchique. Nous regroupons les couches dans le réseau multiplexe de documents, et intégrons cette hiérarchie dans un nuage de mots interactif. Nous améliorons les algorithmes traditionnels de disposition de mise en forme de nuages de mots de sorte à préserver les contraintes sur la hiérarchie de concepts. Le système Laputa est destiné à l’analyse complexe de réseaux temporels denses et multidimensionnels. Pour ce faire, il associe un graphe à une segmentation. La segmentation par communauté, par attribut, ou encore par tranche temporelle, forme des vues de ce graphe. Afin d’associer ces vues avec le tout global, nous utilisons des diagrammes de Sankey pour révéler l’évolution des communautés (diagrammes que nous avons augmentés avec un zoom sémantique). Cette thèse nous permet ainsi de parcourir trois aspects (3V) des plus intéressants de la donnée et du BigData appliqués aux archives multimédia: Le Volume de nos données dans l’immensité des archives, nous atteignons des ordres de grandeurs qui ne sont pas praticables pour la visualisation et l’exploitation des liens. La Vélocité à cause de la nature temporelle de nos données (par définition). La Variété qui est un corollaire de la richesse des données multimédia et de tout ce que l’on peut souhaiter vouloir y investiguer. Ce que l’on peut retenir de cette thèse c’est que la traduction de ces trois défis a pris dans tous les cas une réponse sous la forme d’une analyse de réseaux multiplexes. Nous retrouvons toujours ces structures au coeur de notre travail, que ce soit de manière plus discrète dans les critères pour filtrer les arêtes par l’algorithme Simmelian backbone, que ce soit par la superposition de tranches temporelles, ou bien que ce soit beaucoup plus directement dans la combinaison d’indices sémantiques visuels et textuels pour laquelle nous extrayons les hiérarchies permettant notre visualisation
Nowadays, 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
APA, Harvard, Vancouver, ISO, and other styles
4

Tawfik, Israa. "Links and graphs." Thesis, University of Plymouth, 2013. http://hdl.handle.net/10026.1/2863.

Full text
Abstract:
In this thesis we derive some basic properties of graphs G embedded in a surface determining a link diagram D(G), having a specified number μ(D(G)) of components. ( The relationship between the graph and the link diagram comes from the tangle which replaces each edge of the graph). Firstly, we prove that μ (D(G)) ≤ f (G) + 2g, where f (G) is the number of faces in the embedding of G and g is the genus of the surface. Then we focus on the extremal case, where μ (D(G)) = f (G) + 2g. We note that μ (D(G)) does not change when undergoing graph Reidemeister moves or embedded ∆ ↔ Y exchanges. It is also useful that μ(D(G)) changes only very slightly when an edge is added to the graph. We finish with some observations on other possible values of μ(D(G)). We comment on two cases: when μ = 1, and the Petersen and Heawood families of graphs. These two families are obtained from K6 and K7 respectively by using ∆ ↔ Y exchanges.
APA, Harvard, Vancouver, ISO, and other styles
5

Wu, Diing-Wuu Vale. "Introduction to fractal by using interactive media design /." Online version of thesis, 1991. http://hdl.handle.net/1850/11287.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Monterio, Carlos Eduardo Ferreira. "Investigating critical sense in the interpretation of media graphs." Thesis, University of Warwick, 2005. http://wrap.warwick.ac.uk/73122/.

Full text
Abstract:
This research explores elements and processes involved in interpretation of media graphs. The investigation was comprised of a literature review and a collection of empirical data. The literature review revealed a lack of qualitative evidence related to the complex relationships between elements and processes which comprise the interpretation of media graphs. This study explores the interpretation of media graphs by primary student teachers who would be involved in teaching about graphing. The main study was composed of two complementary datasets: questionnaires and interviews, which allowed an interplay between qualitative and quantitative data. 218 undergraduate and PGCE student teachers from Britain and Brazil responded to a questionnaire with items related to individual details, reading background and media graph tasks. 13 volunteers gave interviews which explored three types of questions: reading the data, reading between the data and reading beyond the data. The interviews also recalled the questionnaire responses. The data analysis of the questionnaires was software based, and a micro analysis approach was developed with the data from the interviews. The analyses of data gave evidence for the discussion about the notion of critical sense in graphing. It was concluded that critical sense in interpretation of media graphs is related to the mobilisation and balance of several aspects, such as: mathematical knowledge, contextual reference, personal experience and affective exhibition. The discussion of the results might help the reflection about teaching and learning of graphing in ways that will support the development of critical sense.
APA, Harvard, Vancouver, ISO, and other styles
7

Ferrer, 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.

Full text
Abstract:
Donat un conjunt d'objectes, el concepte genèric de mediana està definit com l'objecte amb la suma de distàncies a tot el conjunt, més petita. Sovint, aquest concepte és usat per a obtenir el representant del conjunt.
En 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.
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
Abstract:

We 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.

APA, Harvard, Vancouver, ISO, and other styles
9

Ratel, Sébastien. "Densité, VC-dimension et étiquetages de graphes." Electronic Thesis or Diss., Aix-Marseille, 2019. http://www.theses.fr/2019AIXM0427.

Full text
Abstract:
Une partie des résultats de cette thèse sont initialement motivés par l'élaboration de schémas d'étiquetage permettant de réponde à l'adjacence, à la distance ou au routage. Ce document traite cependant de problèmes d'intérêt plus généraux tels que l'étude de bornes sur la densité de graphes, de la VC-dimension de familles d'ensembles, ou de propriétés métriques et structurelles.Nous établissons dans un premier temps des bornes supérieures sur la densité des sous-graphes de produits cartésien de graphes, puis des sous-graphes de demi-cubes. Pour ce faire, nous définissons des extensions du paramètre classique de VC-dimension. De ces bornes sur la densité, nous déduisons des bornes supérieures sur la longueur des étiquettes attribuées par un schéma d'adjacence à ces deux familles de graphes.Dans un second temps, nous nous intéressons à des schémas de distance et de routage pour deux familles importantes de la théorie métrique des graphes: les graphes médians et les graphes pontés. Nous montrons que la famille des graphes médians, sans cube, avec n sommets, admet des schémas de distance et de routage utilisant des étiquettes de O(\log^3 n). Ces étiquettes sont décodées en temps constant pour calculer, respectivement, la distance exacte entre deux sommets, ou le port vers un sommet rapprochant une source d'une destination. Nous décrivons ensuite un schéma de distances 4-approchées pour la famille des graphes pontés, sans K_4, avec n sommets, utilisant des étiquettes de O(\log^3 n) bits. Ces dernières peuvent être décodées en temps constant pour obtenir une valeur entre la distance exacte et quatre fois celle-ci
Constructing 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
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
Phos Graphis är en mötesplats för fotografer och modeller. Denna mötesplats ska fungera som en grund för att hitta den medpart man söker, t.ex. en fotograf som letar efter en modell till ett projekt. Användarna erbjuds även egna gallerier och möjligheter att diskutera i forum samt privat meddelandefunktionalitet. Grundtanken är att Phos Graphis ska fungera som ett verktyg för att lättare kunna utvecklas inom sin roll.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Median graphs"

1

Interactive design 2: The international collection of new media design = die Gestaltung der neuen Medien im internationale Überblick = le design des nouveaux médias dans le monde. New York: Graphis Inc., 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Media literacy: Grades 7-8. Westminster, CA: Teacher Created Resources, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jorinde, Seijdel, and Velthoven Willem, eds. Multi-media graphics. London: Thames and Hudson, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Iinkai, JAGDA Intānetto. Dejitaru media to Nihon no gurafikku dezain: Sono kako to mirai = Digital media and Japanese graphic design : its past and future. Tōkyō: Seibundō Shinkōsha, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

N, Baird Russell, ed. The Graphics of communication: Methods, media, and technology. 6th ed. Fort Worth: Harcourt Brace Jovanovich College Pub., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

W, Dyal William, Eddins Donald L, and Centers for Disease Control (U.S.), eds. Descriptive statistics: Tables, graphs, & charts. Atlanta, Ga: U.S. Dept. of Health and Human Services, Public Health Service, Centers for Disease Control, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

), Cicero Public Schools (Ill. Integrated media curriculum: [grades 4-6]. [Cicero, Ill.]: The Schools, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Daniel, Drennan, ed. The digital designer: The graphic artist's guide to the new media. New York: Watson-Guptil Publications, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Utah State Board of Education. Library media skills core curriculum, grades K-11. [Salt Lake City, Utah: Utah Office of Education], 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Maeda@media. London: Thames & Hudson, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Median graphs"

1

Serratosa, Francesc, Albert Solé-Ribalta, and Enric Vidiella. "Graph Indexing and Retrieval Based on Median Graphs." In Advances in Pattern Recognition, 311–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15992-3_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pravas, K., and A. Vijayakumar. "The Median Problem on Symmetric Bipartite Graphs." In Theoretical Computer Science and Discrete Mathematics, 262–70. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-64419-6_34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ferrer, Miquel, Ernest Valveny, and Francesc Serratosa. "Spectral Median Graphs Applied to Graphical Symbol Recognition." In Lecture Notes in Computer Science, 774–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11892755_80.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Changat, Manoj, Divya Sindhu Lekha, Henry Martyn Mulder, and Ajitha R. Subhamathi. "Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs." In Algorithms and Discrete Applied Mathematics, 138–49. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14974-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dereniowski, Dariusz, Aleksander Łukasiewicz, and Przemysław Uznański. "An Efficient Noisy Binary Search in Graphs via Median Approximation." In Lecture Notes in Computer Science, 265–81. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79987-8_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bardaji, Itziar, Miquel Ferrer, and Alberto Sanfeliu. "A Comparison between Two Representatives of a Set of Graphs: Median vs. Barycenter Graph." In Lecture Notes in Computer Science, 149–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14980-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Thorup, Mikkel. "Quick k-Median, k-Center, and Facility Location for Sparse Graphs." In Automata, Languages and Programming, 249–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bai, Chunsong, and Liying Kang. "The 2-Median Problem on Cactus Graphs with Positive and Negative Weights." In Combinatorial Optimization and Applications, 278–85. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-71150-8_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ferguson, Daniel, and François G. Meyer. "On the Number of Edges of the Fréchet Mean and Median Graphs." In Network Science, 26–40. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-97240-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Eppstein, David. "Algorithms for Drawing Media." In Graph Drawing, 173–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31843-9_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Median graphs"

1

Mukherjee, Lopamudra, Vikas Singh, Jiming Peng, Jinhui Xu, Michael J. Zeitz, and Ronald Berezney. "Generalized Median Graphs: Theory and Applications." In 2007 IEEE 11th International Conference on Computer Vision. IEEE, 2007. http://dx.doi.org/10.1109/iccv.2007.4408966.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yan-Qin, Bai, Wang Qin, and Tai Wei-Ying. "The inverse 1-median problem on star graphs." In Education (ICCSE 2010). IEEE, 2010. http://dx.doi.org/10.1109/iccse.2010.5593677.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dickinson, P., H. Bunke, A. Dadej, and M. Kraetzl. "Median graphs and anomalous change detection in communication networks." In Information, Decision and Control. IEEE, 2002. http://dx.doi.org/10.1109/idc.2002.995366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhou, Xiong, Hanzi Wang, Guobao Xiao, Xing Wang, Yan Yan, and Liming Zhang. "Weighted median-shift on graphs for geometric model fitting." In 2017 IEEE International Conference on Image Processing (ICIP). IEEE, 2017. http://dx.doi.org/10.1109/icip.2017.8296342.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Zihe, Hu Ding, Danyang Chen, Xiangyu Wang, Andrew Fritz, Nitasha Sehgal, Ronald Berezney, and Jinhui Xu. "Mining k-median chromosome association graphs from a population of heterogeneous cells." In BCB '15: ACM International Conference on Bioinformatics, Computational Biology and Biomedicine. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2808719.2808724.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ferguson, Kevin, James Hardin, Andrew Gillman, and Levent Burak Kara. "Scalar Field Prediction on Topologically-Varying Graphs Using Spectral Shape Encoding." In ASME 2022 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/detc2022-91209.

Full text
Abstract:
Abstract Scalar fields, such as stress or temperature fields, are often calculated in shape optimization and design problems in engineering. For complex problems where shapes have varying topology and cannot be parametrized, data-driven scalar field prediction can be faster than traditional finite-element methods. However, current data-driven techniques to predict scalar fields are limited to a fixed grid domain, instead of arbitrary graph/mesh structures. In this work, we propose a method to predict scalar fields on meshes of arbitrary refinement and topology. It uses features that capture shape geometry on a local and global scale as input to a multilayer perceptron to predict solutions to partial differential equations on graph data structures. The proposed set of global features is a vector that concisely represents the entire mesh as a spectral shape encoding. The model is trained on finite-element von Mises stress fields, and once trained it can estimate stress values at each node on any input mesh. Two shape datasets are investigated, and the model demonstrates decent performance on both, with a median R-squared value of 0.75. We also demonstrate the model’s performance on a temperature field in a conduction problem, where its predictions have a median R-squared value of 0.98. By predicting from a simple, yet rich, set of mesh features, our method provides a potential flexible alternative to finite-element simulation in engineering design contexts. Code and datasets are available at: https://github.com/kevinferg/spectral-shape-encoding.
APA, Harvard, Vancouver, ISO, and other styles
7

Vidal, Victor, Tássia Bastos, Rafael Ferreira Mello, Péricles Miranda, and André C. A. Nascimento. "On the impact of missing value imputation methods for multiple kernel learning on bipartite graphs." In Encontro Nacional de Inteligência Artificial e Computacional. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/eniac.2023.233884.

Full text
Abstract:
In the last decade, the study of pharmacological networks has received a lot of attention, given its relevance to the drug discovery process. Many different approaches for predicting biological interactions have been proposed, especially in the area of multiple kernel learning (MKL). Such methods comprise integrative approaches that can handle heterogeneous data sources in the form of kernels, but can suffer from the missing data problem. Techniques to handle missing values in the base kernel matrices can be used, usually based on simpler techniques, such as imputing zeroes, mean and median of the kernel matrix. In this work, techniques for handling missing values were evaluated in the context of bipartite networks. Our analyses showed that depending on the amount of missing data, k-NN and Singular Value Decomposition (SVD) techniques performed much better than the other techniques, bringing encouraging results, while zero-fill showed the worst performance in relation to all other evaluated methods.
APA, Harvard, Vancouver, ISO, and other styles
8

McWherter, David, Mitchell Peabody, William C. Regli, and Ali Shokoufandeh. "Transformation Invariant Shape Similarity Comparison of Solid Models." In ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/dfm-21191.

Full text
Abstract:
Abstract This paper presents two complementary approaches to comparing the shape and topology of solid models. First, we develop a mapping of solid models to Model Signature Graphs (MSGs) — labeled, undirected graphs that abstract the boundary representation of the model and capture relevant shape and engineering attributes. Model Signature Graphs are then used to define metric spaces over arbitrary sets of solid models. This paper introduces two such metric spaces: first, a mapping of MSGs to a high-dimension vector space where euclidean distance measures are applied; second, a distance computation performed between graph spectra constructed from MSGs using spectral graph theoretic techniques. In practice, exact computation of the edit distance between model signature graphs is believed to be an NP-hard problem. We show that properties of the design signature graph’s spectra, derived from the eigenvalues of its adjacency matrix, can be used as a efficient and tractable approximation of the edit distance. Lastly, we provide empirical results using real test data from the National Design Repository (http://www.designrepository.org) to validate our approach. We argue comparisons among solid models in these metric space are immune to problems caused by inexactness and ambiguity arising from basic modeling transformations (scale, translation, rotation, sheer, etc.). It is our belief that this work contributes to a growing body of techniques for comparing models and indexing CAD media types in database systems.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Hanchen, Defu Lian, Ying Zhang, Lu Qin, and Xuemin Lin. "GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/183.

Full text
Abstract:
Entity interaction prediction is essential in many important applications such as chemistry, biology, material science, and medical science. The problem becomes quite challenging when each entity is represented by a complex structure, namely structured entity, because two types of graphs are involved: local graphs for structured entities and a global graph to capture the interactions between structured entities. We observe that existing works on structured entity interaction prediction cannot properly exploit the unique graph of graphs model. In this paper, we propose a Graph of Graphs Neural Network, namely GoGNN, which extracts the features in both structured entity graphs and the entity interaction graph in a hierarchical way. We also propose the dual-attention mechanism that enables the model to preserve the neighbor importance in both levels of graphs. Extensive experiments on real-world datasets show that GoGNN outperforms the state-of-the-art methods on two representative structured entity interaction prediction tasks: chemical-chemical interaction prediction and drug-drug interaction prediction. Our code is available at Github.
APA, Harvard, Vancouver, ISO, and other styles
10

Sirico, Anthony, and Daniel R. Herber. "On the Use of Geometric Deep Learning Towards the Evaluation of Graph-Centric Engineering Systems." In ASME 2023 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2023. http://dx.doi.org/10.1115/detc2023-114592.

Full text
Abstract:
Abstract Many complex engineering systems can be represented in a topological form, such as graphs. This paper utilizes a machine learning technique called Geometric Deep Learning (GDL) to aid designers with challenging, graph-centric design problems. The strategy presented here is to take the graph data and apply GDL to seek the best realizable performing solution effectively and efficiently with lower computational costs. This case study used here is the synthesis of analog electrical circuits that attempt to match a specific frequency response within a particular frequency range. Previous studies utilized an enumeration technique to generate 43,249 unique undirected graphs presenting valid potential circuits. Unfortunately, determining the sizing and performance of many circuits can be too expensive. To reduce computational costs with a quantified trade-off in accuracy, the fraction of the circuit graphs and their performance are used as input data to a classification-focused GDL model. Then, the GDL model can be used to predict the remainder cheaply, thus, aiding decision-makers in the search for the best graph solutions. The results discussed in this paper show that additional graph-based features are useful, favorable total set classification accuracy of 80% in using only 10% of the graphs, and iteratively-built GDL models can further subdivide the graphs into targeted groups with medians significantly closer to the best and containing 88.2 of the top 100 best-performing graphs on average.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Median graphs"

1

Salamanca Velandia, Sandra Rocío, Juliana Marín Mancipe, Silvia Alejandra González, and Elenith Pérez Acevedo. Prevención de la ansiedad en estudiantes de instituciones educativas de media vocacional. Ediciones Universidad Cooperativa de Colombia, December 2022. http://dx.doi.org/10.16925/gcnc.33.

Full text
Abstract:
El objetivo de la siguiente guía es plantear diferentes estrategias por medio de ejercicios didácticos que pueden utilizarse en el aula de clase y nos permitan disminuir la ansiedad en estudiantes de los grados 9. °, 10. ° y 11. ° de instituciones educativas de media vocacional. Todo esto con el fin de poder aminorar los niveles de ansiedad de la población adolescente, particularmente en escenarios cotidianos que representan gran importancia para la presencia de sucesos significativos en la vida de esta población, tal como son las aulas de clase.
APA, Harvard, Vancouver, ISO, and other styles
2

Green, Nancy, Giuseppe Carenini, Stephen Kerpedjiev, Steven Roth, and Johanna Moore. A Media-Independent Content Language for Integrated Text and Graphics Generation. Fort Belvoir, VA: Defense Technical Information Center, January 1998. http://dx.doi.org/10.21236/ada459464.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Borja Buitrago, Diana. Bases para la construcción de un urbanismo prioritario para la reducción de la pobreza y la desigualdad social en Quibdó, Colombia. Propuesta de Plan de Indicadores y Líneas Estratégicas de Desarrollo Urbano. Fundación Carolina, June 2021. http://dx.doi.org/10.33960/issn-e.1885-9119.dte5.

Full text
Abstract:
Quibdó es una ciudad Colombiana, capital del departamento del Chocó y una de las poblaciones más importantes en la región del Pacífico Colombiano. Pese a estar ubicada en una de las regiones más biodiversas del país, la ciudad presenta graves problemas de pobreza y desigualdad social. En el contexto nacional, esta ciudad no alcanza un nivel mínimo de desarrollo social en cuestiones de salud, vivienda, educación y servicios públicos. Debido a su retraso urbano y social, es necesario implementar medidas mediante las cuales la ciudad supere esta vulnerabilidad y alcance un grado de prosperidad urbana que mejore la calidad de vida para todos sus ciudadanos. Por tal razón, esta investigación propone un nuevo modelo de ciudad, denominado “urbanismo prioritario”. Se trata de un modelo adaptado para entornos con características de extrema pobreza. Asimismo, ofrece una forma de medición alternativa, basada en 15 dimensiones ligadas a los lineamientos del urbanismo prioritario. Estas dimensiones ofrecen 53 indicadores urbanos, cuya finalidad es medir de manera correcta la pobreza de la ciudad. El objetivo consiste en detectar sus problemas reales, y ofrecer un diagnóstico que posibilite un planteamiento adecuado de las líneas estratégicas para el futuro desarrollo urbano de Quibdó.
APA, Harvard, Vancouver, ISO, and other styles
4

Nalla, Vineetha, and Nihal Ranjit. Afterwards: Graphic Narratives of Disaster Risk and Recovery from India. Indian Institute for Human Settlements, 2022. http://dx.doi.org/10.24943/9788195648559.

Full text
Abstract:
Afterwards is an anthology of visual narratives of disaster impacts and the process of recovery that follows. These stories were drawn from the testimonies of disaster-affected individuals, households, and communities documented between 2018-19 from the Indian states of Odisha, Tamil Nadu, and Kerala. They communicate challenges related to housing resettlement, loss of livelihoods, gender-based exclusion among others. At the heart of this anthology lies the idea of ‘representation’: how are those affected portrayed by the media, state actors, official documents; how are their needs represented and how do these portrayals impact the lives of those at risk and shape their recovery? Graphically illustrating these themes provides a platform to relay personal experiences of disaster risk and recovery.
APA, Harvard, Vancouver, ISO, and other styles
5

Mikhaleva, E., E. Babikova, G. Bezhashvili, M. Ilina, and I. Samkova. VALUE STREAM PROGRAM. Sverdlovsk Regional Medical College, December 2022. http://dx.doi.org/10.12731/er0618.03122022.

Full text
Abstract:
In order to increase the efficiency of the work of a medical organization, it is necessary to train medical workers, employees of medical organizations, students of educational organizations in the techniques and methods of lean production, followed by the application of the acquired skills directly at the workplace in a medical organization. The purpose of the training under the program is to acquire new competencies necessary to perform professional tasks using lean manufacturing tools - mapping the value stream to ensure maximum operational efficiency of production processes. The program provides for independent work: mapping the value stream of the current, ideal and target states of the process, analysis of the value stream of the current state of the process (problem identification: spaghetti method, pyramid of problems, graph-links, summary table of root causes and contribution of the solution), development of a plan measures to achieve the target state of the process.
APA, Harvard, Vancouver, ISO, and other styles
6

Nalla, Vineetha, Nihal Ranjit, Yashodara Udupa, Mythili Madhavan, Jasmitha Arvind, Garima Jain, and Teja Malladi. Afterwards – Graphic Narratives of Disaster Risk and Recovery from India (Volume Set). Indian Institute for Human Settlements, 2022. http://dx.doi.org/10.24943/9788195648573.

Full text
Abstract:
Afterwards is an anthology of graphic narratives of disaster impacts and the process of recovery that follows. These stories were drawn from the testimonies of disaster-affected individuals, households, and communities documented from the Indian states of Odisha, Tamil Nadu, and Kerala. The book has been translated into the regional languages of these states – Odia, Tamil, and Malayalam. They communicate challenges related to housing resettlement, loss of livelihoods, and gender-based exclusion among others. At the heart of this anthology lies the idea of ‘representation’: how are disaster-affected people portrayed by the media, state actors, and official documents; how are their needs represented and how do these portrayals impact the lives of those at risk and shape their recovery?
APA, Harvard, Vancouver, ISO, and other styles
7

Sánchez, José Miguel, Ricardo Sanhueza, and Leonardo S. Letelier. Autonomía de las instituciones gubernamentales de Chile. Inter-American Development Bank, October 1998. http://dx.doi.org/10.18235/0012006.

Full text
Abstract:
Las reformas llevadas a cabo en Chile a partir de mediados de los setenta tendientes a reducir el tamaño del Estado y a hacer más eficiente y efectivo su funcionamiento han sido, en general, evaluadas positivamente. Ellas contemplaron, entre otras medidas, reducciones de personal del sector público, ajustes de planilla, consolidación y re definición de los roles de las diversas instituciones públicas de modo de abordar los problemas de incentivos que las afectan. Ello respondió a que en Chile, en gran medida los problemas atribuidos al funcionamiento del Estado tenían que ver con su gran tamaño. Aspectos tales como excesiva centralización regional y de toma de decisiones, falta de instancias de control, corrupción, tramitación excesiva, incertidumbre sobre el marco regulatorio o de su grado de aplicabilidad, falta de claridad en las competencias de las agencias o superimposición de las mismas y falta de capacidad técnica son parte de una institucionalidad que arroja dudas sobre el funcionamiento adecuado del Sector Público y ellas fueron consideradas al momento de evaluar y realizar las reformas. El objetivo de este estudio es analizar y comprender en qué medida Chile ha conciliado la flexibilidad y la credibilidad en sus instituciones y cómo el diseño y contexto en el que se desenvuelven las mismas contribuyó al propósito deseado. El que dentro de Chile ciertas instituciones tengan distintos grados de autonomía permite analizar variables de contexto específicas incluso en un contexto nacional. Específicamente, analizamos los determinantes de la autonomía real de tres instituciones chilenas para comprender en qué medida tal autonomía afecta la ejecución de la política gubernamental. Estas instituciones son la Fiscalía Nacional Económica (antimonopolios), la Superintendencia de Servicios Sanitarios, y el Banco Central.
APA, Harvard, Vancouver, ISO, and other styles
8

Bayona Ramírez, Edgar Antonio, Julián Mateo Hernández Cavadia, Dana Valentina Carantón Nocua, and Luis Eduardo Rojas Avellaneda. Diseño de tostadora de cacao. Escuela Tecnológica Instituto Técnico Central, 2023. http://dx.doi.org/10.55411/2023.17.

Full text
Abstract:
El proceso de tostado de granos es un oficio que demanda transferencia de calor entre un medio generador de calor y un recipiente donde se deposita determinada cantidad de grano o materia prima para que con el calor recibido pierda un porcentaje de humedad y adquiera una coloración uniforme, con aroma y sabor agradable.
APA, Harvard, Vancouver, ISO, and other styles
9

Saavedra, José Jorge. Compete Caribbean Update. Inter-American Development Bank, September 2011. http://dx.doi.org/10.18235/0006929.

Full text
Abstract:
This presentation presents Compete Caribbean, which is a private sector development program that provides technical assistance grants and investment funding to support productive development policies, business climate reforms, clustering initiatives and Small and Medium Size Enterprise (SME) development activities in the Caribbean region. The program, jointly funded by the Inter-American Development Bank (IDB), the United Kingdom Department of International Development (DFID) and the Canadian International Development Agency (CIDA), supports projects in 15 Caribbean countries.
APA, Harvard, Vancouver, ISO, and other styles
10

Pinzón Candelario, Fanny. La interpretación ambiental como estrategia en educación ambiental con escolares de básica primaria del municipio de Leticia (Amazonas) en la reserva Agape. Universidad Nacional Abierta y a Distancia, July 2021. http://dx.doi.org/10.22490/ecapma.4232.

Full text
Abstract:
El presente documento es el resultado de un trabajo, cuyo objetivo era sensibilizar mediante la estrategia de interpretación ambiental, a estudiantes de básica primaria de los grados 4to y 5to del Municipio de Leticia (Amazonas), sobre el concepto de ambiente y la importancia de conservarlo. Se utilizó como metodología la Investigación acción participativa, mediante el desarrollo de una estrategia de Educación ambiental, como es la interpretación ambiental en senderos ya establecidos en la Reserva Ágape, ubicada en el Km 10,5 Vía Tarapacá, zona rural de la ciudad de Leticia, Amazonas. Uno de los hallazgos es que el conocimiento que tienen los niños sobre su ambiente es mínimo. Por medio de la estrategia de interpretación ambiental que tiene sus bases en un guion elaborado previamente para cada sendero, que incluye contenido conceptual y metafórico, se logró sensibilizar a los niños; la actividad incluía experiencias sensoriales, de juego, actividades de preservación, conservación, que permitieran fortalecer sus conocimientos, permitiendo la construcción de valores ambientales buscando generar nuevos patrones de conducta frente al ambiente y modificar patrones de comportamiento. Se concluyó que este tipo de actividades de interpretación ambiental, que incluye la participación de todos los sentidos en espacios abiertos accesibles, permite generar la curiosidad de los niños por conocer y explorar, más allá de su conocimiento formal de aula. Se evidencia que no es suficiente conocer sobre la problemática ambiental si esta, no se conoce en la realidad; más allá del conocimiento que se puede lograr en las aulas convencionales.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Median graphs' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography