Academic literature on the topic 'Graph projection'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Graph projection.'
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 "Graph projection"
1
Bae, Yeolhui, Yugyeom Yi, Jeongmoo Lee, and Sungmo Kang. "Research on Definition of BLL Graphs of Knot Diagrams and its Applications." Korean Science Education Society for the Gifted 14, no. 3 (2022): 229–36. http://dx.doi.org/10.29306/jseg.2022.14.3.229.
Full textAbstract:
This paper is the research on the Knot theory in Topology. A knot is a simple closed curve in ℝ and its projection onto a plane in ℝ is called a knot projection. As the results of this paper we define a BLL(Bidirectional Linear Link) graph for a knot projection which is a bidirectional linear link representing the relations between arcs of a knot projection and obtain some properties of the BLL graphs. We also define an Eulerian cycle of the BLL graph and an Eulerian cycle of a knot projection. As the main results of this paper, we obtain the equivalent conditions of being an alternation knot projection as follows: (1) an out-degree of every vertex of the corresponding BLL graph is 2; (2) the corresponding BLL graph has an Eulerian cycle; (3) the knot projection has an Eulerian cycle. As the subsequent study, using these results of the BLL graphs, we propose the analysis on the BLL graphs for deformation operation obtaining a new alternating knot projection, decision on the tricolorability of a knot projection, and a polynomial of a knot projection.
2
Ledermann, Florian. "Classifying Cartographic Projections Based on Dynamic Analysis of Program Code." Abstracts of the ICA 2 (October 9, 2020): 1. http://dx.doi.org/10.5194/ica-abs-2-38-2020.
Full textAbstract:
Abstract. Analyzing a given map to identify its projection and other geometrical properties has long been an important aspect of cartographic analysis. If explicit information about the projection used in a particular map is not available, the properties of the cartographic transformation can sometimes be reconstructed from the map image. However, such a process of projection analysis requires significant manual labor and oversight.For digital maps, we usually expect the projection from geographic space to map space to have been calculated by a computer program. Such a program can be expected to contain the implementation of the mathematical rules of the projection and subsequent coordinate transformations such as translation and scaling. The program code, therefore, contains information that would allow an analyst to reliably identify map projections and other geometrical transformations applied to the input data.In the case of interactive online maps, the code generating the map is in fact delivered to the map user and could be used for cartographic analysis. The core idea of our novel method proposed for map analysis is to apply reverse engineering techniques on the code implementing the cartographic transformations in order to retrieve the properties of the applied map projection. However, automatic reasoning about computer code by way of static analysis (analyzing the source code without running it) is provably limited – for example, the code delivered to the map user may contain a whole library of different map projections, of which only a specific one may be actually used at runtime. Instead, we propose a dynamic analysis approach to observe and monitor the operations performed by the code as the program runs, and to retrieve the mathematical operations that have been used to calculate the coordinates of every graphical element on the map.The presented method produces, for every graphical element of the map, a transformation graph consisting of low-level mathematical operations. Cartographic projections can be identified as distinctive patterns in the transformation graph, and can be distinguished in a fully automatic way by matching a set of predefined patterns against a particular graph.Projections vary widely in their arithmetic structure, and therefore by the structure of the corresponding transformation graphs extracted from program code. Some projections can be computed directly using continuous equations involving trigonometric functions. Other projections involve solving nonlinear equations, which need to be solved by approximation. Composite projections use different projections depending on some threshold value. Yet other projections, such as the Robinson projection, define a table of predefined values, between which interpolation is used etc.. In each of these cases, we expect to find the operations corresponding to the mathematical structure of the projection in the transformation graph extracted by the presented method.For verifying the method, we have implemented the patterns of several well-known cartographic projections based on the literature and have used it on the transformation graphs extracted from a variety of sample programs. To ensure a diversity of implementations, we have evaluated programs using different and independent JavaScript implementations of projections, including the open source libraries D3.js, proj4js, Leaflet, OpenLayers, and informal implementations of example programs found online. For these case studies, we could successfully identify many projections based on identifying patterns in the transformation graph in a fully automated, unsupervised manner.In the future, the proposed method may be further developed for many innovative application scenarios, such as building a “cartographic search engine” or constructing novel tools for semi-automatic cartographic analysis and review.
3
CAELLI, TERRY, and SERHIY KOSINOV. "INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING." International Journal of Pattern Recognition and Artificial Intelligence 18, no. 03 (2004): 329–54. http://dx.doi.org/10.1142/s0218001404003186.
Full textAbstract:
Graph eigenspaces have been used to encode many different properties of graphs. In this paper we explore how such methods can be used for solving inexact graph matching (the matching of sets of vertices in one graph to those in another) having the same or different numbers of vertices. In this case we explore eigen-subspace projections and vertex clustering (EPS) methods. The correspondence algorithm enables the EPC method to discover a range of correspondence relationships from one-to-one vertex matching to that of inexact (many-to-many) matching of structurally similar subgraphs based on the similarities of their vertex connectivities defined by their positions in the common subspace. Examples in shape recognition and random graphs are used to illustrate this method.
4
Dal Col, Alcebiades, and Fabiano Petronetto. "Graph regularization multidimensional projection." Pattern Recognition 129 (September 2022): 108690. http://dx.doi.org/10.1016/j.patcog.2022.108690.
Full text
5
NIKKUNI, RYO, MAKOTO OZAWA, KOUKI TANIYAMA, and YUKIHIRO TSUTSUMI. "NEWLY FOUND FORBIDDEN GRAPHS FOR TRIVIALIZABILITY." Journal of Knot Theory and Its Ramifications 14, no. 04 (2005): 523–38. http://dx.doi.org/10.1142/s0218216505003932.
Full textAbstract:
A planar graph is said to be trivializable if every regular projection of the graph produces a trivial spatial embedding by giving some over/under informations to the double points. Every minor of a trivializable graph is also trivializable, thus the set of forbidden graphs is finite. Seven forbidden graphs for the trivializability were previously known. In this paper, we exhibit nine more forbidden graphs.
6
HUH, YOUNGSIK. "AN ELEMENTARY SET FOR EMBEDDED BOUQUET GRAPHS WITH TWO CYCLES." Journal of Knot Theory and Its Ramifications 20, no. 02 (2011): 305–25. http://dx.doi.org/10.1142/s0218216511008796.
Full textAbstract:
A projection of the bouquet graph B with two cycles is said to be trivial if only trivial embeddings are obtained from the projection. In this paper a finite set of nontrivial embeddings of B is shown to be minimal among those which produce all nontrivial projections of B.
7
HUH, YOUNGSIK, and KOUKI TANIYAMA. "IDENTIFIABLE PROJECTIONS OF SPATIAL GRAPHS." Journal of Knot Theory and Its Ramifications 13, no. 08 (2004): 991–98. http://dx.doi.org/10.1142/s0218216504003640.
Full textAbstract:
A generic map from a finite graph to the 2-space is called identifiable if any two embeddings of the graph into the 3-space obtained by lifting the map with respect to the natural projection from the 3-space to the 2-space are ambient isotopic in the 3-space. We show that only planar graphs have identifiable maps. We characterize the identifiable maps for some planar graphs.
8
Douar, Brahim, Chiraz Latiri, Michel Liquiere, and Yahya Slimani. "A Projection Bias in Frequent Subgraph Mining Can Make a Difference." International Journal on Artificial Intelligence Tools 23, no. 05 (2014): 1450005. http://dx.doi.org/10.1142/s0218213014500055.
Full textAbstract:
The aim of the frequent subgraph mining task is to find frequently occurring subgraphs in a large graph database. However, this task is a thriving challenge, as graph and subgraph isomorphisms play a key role throughout the computations. Since subgraph isomorphism testing is a hard problem, subgraph miners are exponential in runtime. To alleviate the complexity issue, we propose to introduce a bias in the projection operator and instead of using the costly subgraph isomorphism projection, one can use a polynomial projection having a semantically-valid structural interpretation. This paper presents a new projection operator for graphs named AC-projection, which exhibits nice theoretical complexity properties. We study the size of the search space as well as some practical properties of the projection operator. We also introduce a novel breadth-first algorithm for frequent AC-reduced subgraphs mining. Then, we prove experimentally that we can achieve an important performance gain (polynomial complexity projection) without or with non-significant loss of discovered patterns in terms of quality.
9
Bach, Nguyen Gia, Chanh Minh Tran, Tho Nguyen Duc, Phan Xuan Tan, and Eiji Kamioka. "Novel Projection Schemes for Graph-Based Light Field Coding." Sensors 22, no. 13 (2022): 4948. http://dx.doi.org/10.3390/s22134948.
Full textAbstract:
In light field compression, graph-based coding is powerful to exploit signal redundancy along irregular shapes and obtains good energy compaction. However, apart from high time complexity to process high dimensional graphs, their graph construction method is highly sensitive to the accuracy of disparity information between viewpoints. In real-world light field or synthetic light field generated by computer software, the use of disparity information for super-rays projection might suffer from inaccuracy due to vignetting effect and large disparity between views in the two types of light fields, respectively. This paper introduces two novel projection schemes resulting in less error in disparity information, in which one projection scheme can also significantly reduce computation time for both encoder and decoder. Experimental results show projection quality of super-pixels across views can be considerably enhanced using the proposals, along with rate-distortion performance when compared against original projection scheme and HEVC-based or JPEG Pleno-based coding approaches.
10
Hjouj, Fawaz. "On Tomography with Unknown Orientation." Journal of Mathematical Sciences & Computer Applications 2, no. 2 (2017): 125–35. http://dx.doi.org/10.5147/jmsca.v2i1.99.
Full textAbstract:
We consider the two-dimensional parallel beam Tomography problem in which both the object being imaged and the projection directions are unknown. The angles of projections need not to be uniformly distributed. Our solution combines two known approaches: the Geometric Moment and the Graph Laplacian. After sorting the projections using the Graph Laplacian method we create a one to one moment function of the angles. We then solve for each angle uniquely.
Dissertations / Theses on the topic "Graph projection"
1
Wu, Yingxin. "Hybrid multivariate network visualization combining dimensional projection and graph drawing." Thesis, The University of Sydney, 2008. https://hdl.handle.net/2123/28136.
Full textAbstract:
The goal of information visualization is to transform abstract data into efficient visual format which
help humans extract useful information from the data collected. Two distinctive types of data are
of particular interest to the information visualization community: one is multidimensional data in
which each data point/entity is described by various attributes. The other is relational data which
represent the interaction between the entities. These two types of data are common in the real world
but difficult for people to understand. Many visualization approaches have been developed to help
people gain insight in to such data sets.
This thesis focuses on visualizing the multivariate networks which contains the aforementioned
two types of data. The word “multivariate" has two meanings: l) The entities have multiple attributes.
2) The same set of entities can have different relationships. Visualizations should help
viewers to compare attributes of different entities, recognize entities’ roles in various relationships
and detect correlation between attributes and relationships.
We present a two-phase approach to visualize the multivariate networks. In the first phase,
vertices with similar attribute values and short graph distance are mapped to proximate regions on
the representation. In the second phase. the layout generated in the first phase is adjusted to separate
overlapping vertices. reduce vertex—edge overlaps and edge crossings. A user study is carried out
to evaluate the effectiveness of this hybrid approach. Results are compared against the commonly
used glyph-based technique. The user study shows that the hybrid approach helps users to find
correlations between the vertices’ attribute and relationship. In addition, the users find the hybrid
visualization facilitates comparing different relationships between the same set of entities. Finally,
the hybrid approach is applied to visualize four international trading networks.
2
Taki, Sara. "Anonymisation de données liées en utilisant la confidentialité différentielle." Electronic Thesis or Diss., Bourges, INSA Centre Val de Loire, 2023. http://www.theses.fr/2023ISAB0009.
Full textAbstract:
Cette thèse étudie le problème de la protection de la vie privée dans le LinkedOpen Data (ou « LOD », en français « web des données ouvertes » ou encore « donnéesliées ouvertes »). Ce travail se situe à l’intersection d’une longue série de travaux sur laconfidentialité des données et le LOD. Notre objectif est d’étudier l’impact des aspectssémantiques sur la publication des données et sur les fuites éventuelles d’information.Nous considérons RDF comme le format de représentation du LOD et la confidentialitédifférentielle (DP) comme le principal critère de protection de la vie privée. La DP a étéinitialement conçue pour définir la confidentialité dans le domaine des bases de donnéesrelationnelle. Elle est basée sur une quantification de la difficulté pour un attaquantd’identifier, en observant le résultat d’un algorithme, quelle base de données parmis unvoisinage a été utilisée pour le produire.Les objectifs de cette thèse sont au nombre de quatre: O1) améliorer la protectiondes données LOD. En particulier, proposer une approache permettant de construire desméchanismes DP utilisables sur RDF ; O2) étudier comment les définitions des voisinagessur les bases de données relationnelles en présence de contraintes de clés étrangères (FK) peuvent être traduites en RDF : O3) proposer de nouvelles définitions de voisinages sur des bases de données relationnelles équivalente à des notions existantes de voisinage sur les graphes (avec une sémantique précise) et O4) proposer un formalisme facilitant laconception et l’implémentation de mécanismes d’anonymisation de données RDF.Concernant O1, nous proposons une nouvelle approche basée sur la projection degraphes pour adapter le concept de DP à RDF. Pour O2, nous déterminons le modèlede protection qui correspond à la traduction de modèles déjà existants pour des basesde données relationnelles sous contraintes FK. Pour O3, nous introduisons le conceptde restrict deletion neighborhood (voisinage d’effacement limité) équivalent envoisinage de type "typed-node" (noeud typé). Nous proposons également une relaxation de la définition permettant de traduite les voisinages "typed-outedge" (arc sortanttypé). Pour O4, nous proposons un langage de transformation de graphes basé sur leconcept de réécriture de graphes, qui sert de fondation pour construire divers mécanismes d’anonymisation sur des graphes attribués.L’ensemble de nos contributions théoriques ont été implémentées par des prototypes"preuve de concept" et ont été évalués sur des jeux de données réels, afin de montrerl’applicabilité de nos travaux à des cas d’usage réels<br>This thesis studies the problem of privacy in linked open data (LOD). Thiswork is at the intersection of long lines of work on data privacy and linked open data.Our goal is to study how the presence of semantics impacts the publication of data andpossible data leaks. We consider RDF as the format to represent LOD and DifferentialPrivacy (DP) as the main privacy concept. DP was initially conceived to define privacyin the relational database (RDB) domain and is based on a quantification of the difficultyfor an attacker observing an output to identify which database among a neighborhoodis used to produce it.The objective of this thesis is four-fold: O1) to improve the privacy of LOD. Inparticular, to propose an approach to construct usable DP-mechanisms on RDF; O2) tostudy how neighborhood definitions over RDB in the presence of foreign key (FK) constraints translate to RDF; O3) to propose new neighborhood definitions over relationaldatabase translating into existing graph concepts to ease the design of DP mechanisms;and O4) to support the implementation of sanitization mechanisms for RDF graphs witha rigorous formal foundation.For O1, we propose a novel approach based on graph projection to adapt DP toRDF. For O2, we determine the privacy model resulting from the translation of popularprivacy model over RDB with FK constraints to RDF. For O3, we propose the restrictdeletion neighborhood over RDB with FK constraints whose translation to the RDFgraph world is equivalent to typed-node neighborhood. Moreover, we propose a looserdefinition translating to typed-outedge neighborhood. For O4, we propose a graphtransformation language based on graph rewriting to serve as a basis for constructingvarious sanitization mechanisms on attributed graphs.We support all our theoretical contributions with proof-of-concept prototypes thatimplement our proposals and are evaluated on real datasets to show the applicability ofour work
3
Douar, Brahim. "Fouille de sous-graphes fréquents à base d'arc consistance." Thesis, Montpellier 2, 2012. http://www.theses.fr/2012MON20108/document.
Full textAbstract:
Avec la croissance importante du besoin d'analyser une grande masse de données structurées tels que les composés chimiques, les structures de protéines ou même les réseaux sociaux, la fouille de sous-graphes fréquents est devenue un défi réel en matière de fouille de données. Ceci est étroitement lié à leur nombre exponentiel ainsi qu'à la NP-complétude du problème d'isomorphisme d'un sous-graphe général. Face à cette complexité, et pour gérer cette taille importante de l'espace de recherche, les méthodes classiques de fouille de graphes ont exploré des heuristiques de recherche basées sur le support, le langage de description des exemples (limitation aux chemins, aux arbres, etc.) ou des hypothèses (recherche de sous-arborescence communes, de chemins communs, etc.). Dans le cadre de cette thèse, nous nous basons sur une méthode d'appariement de graphes issue du domaine de la programmation par contraintes, nommée AC-projection, qui a le mérite d'avoir une complexité polynomiale. Nous introduisons des approches de fouille de graphes permettant d'améliorer les approches existantes pour ce problème. En particulier, nous proposons deux algorithmes, FGMAC et AC-miner, permettant de rechercher les sous-graphes fréquents à partir d'une base de graphes. Ces deux algorithmes profitent, différemment, des propriétés fortes intéressantes de l'AC-projection. En effet, l'algorithme FGMAC adopte un parcours en largeur de l'espace de recherche et exploite l'approche par niveau introduite dans Apriori, tandis que l'algorithme AC-miner parcourt l'espace en profondeur par augmentation de motifs, assurant ainsi une meilleure mise à l'échelle pour les grands graphes. Ces deux approches permettent l'extraction d'un type particulier de graphes, il s'agit de celui des sous-graphes AC-réduits fréquents. Dans un premier temps, nous prouvons, théoriquement, que l'espace de recherche de ces sous-graphes est moins important que celui des sous-graphes fréquents à un isomorphisme près. Ensuite, nous menons une série d'expérimentations permettant de prouver que les algorithmes FGMAC et AC-miner sont plus efficients que ceux de l'état de l'art. Au même temps, nous prouvons que les sous-graphes AC-réduits fréquents, en dépit de leur nombre sensiblement réduit, ont le même pouvoir discriminant que les sous-graphes fréquents à un isomorphisme près. Cette étude est menée en se basant sur une évaluation expérimentale de la qualité des sous-graphes AC-réduits fréquents dans un processus de classification supervisée de graphes<br>With the important growth of requirements to analyze large amount of structured data such as chemical compounds, proteins structures, social networks, to cite but a few, graph mining has become an attractive track and a real challenge in the data mining field. Because of the NP-Completeness of subgraph isomorphism test as well as the huge search space, frequent subgraph miners are exponential in runtime and/or memory use. In order to alleviate the complexity issue, existing subgraph miners have explored techniques based on the minimal support threshold, the description language of the examples (only supporting paths, trees, etc.) or hypothesis (search for shared trees or common paths, etc.). In this thesis, we are using a new projection operator, named AC-projection, which exhibits nice complexity properties as opposed to the graph isomorphism operator. This operator comes from the constraints programming field and has the advantage of a polynomial complexity. We propose two frequent subgraph mining algorithms based on the latter operator. The first one, named FGMAC, follows a breadth-first order to find frequent subgraphs and takes advantage of the well-known Apriori levelwise strategy. The second is a pattern-growth approach that follows a depth-first search space exploration strategy and uses powerful pruning techniques in order to considerably reduce this search space. These two approaches extract a set of particular subgraphs named AC-reduced frequent subgraphs. As a first step, we have studied the search space for discovering such frequent subgraphs and proved that this one is smaller than the search space of frequent isomorphic subgraphs. Then, we carried out experiments in order to prove that FGMAC and AC-miner are more efficient than the state-of-the-art algorithms. In the same time, we have studied the relevance of frequent AC-reduced subgraphs, which are much fewer than isomorphic ones, on classification and we conclude that we can achieve an important performance gain without or with non-significant loss of discovered pattern's quality
4
Luqman, Muhammad Muzzamil. "Fuzzy multilevel graph embedding for recognition, indexing and retrieval of graphic document images." Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4005/document.
Full textAbstract:
Cette thèse aborde le problème du manque de performance des outils exploitant des représentationsà base de graphes en reconnaissance des formes. Nous proposons de contribuer aux nouvellesméthodes proposant de tirer partie, à la fois, de la richesse des méthodes structurelles et de la rapidité des méthodes de reconnaissance de formes statistiques. Deux principales contributions sontprésentées dans ce manuscrit. La première correspond à la proposition d'une nouvelle méthode deprojection explicite de graphes procédant par analyse multi-facettes des graphes. Cette méthodeeffectue une caractérisation des graphes suivant différents niveaux qui correspondent, selon nous,aux point-clés des représentations à base de graphes. Il s'agit de capturer l'information portéepar un graphe au niveau global, au niveau structure et au niveau local ou élémentaire. Ces informationscapturées sont encapsulés dans un vecteur de caractéristiques numériques employantdes histogrammes flous. La méthode proposée utilise, de plus, un mécanisme d'apprentissage nonsupervisée pour adapter automatiquement ses paramètres en fonction de la base de graphes àtraiter sans nécessité de phase d'apprentissage préalable. La deuxième contribution correspondà la mise en place d'une architecture pour l'indexation de masses de graphes afin de permettre,par la suite, la recherche de sous-graphes présents dans cette base. Cette architecture utilise laméthode précédente de projection explicite de graphes appliquée sur toutes les cliques d'ordre 2pouvant être extraites des graphes présents dans la base à indexer afin de pouvoir les classifier.Cette classification permet de constituer l'index qui sert de base à la description des graphes etdonc à leur indexation en ne nécessitant aucune base d'apprentissage pré-étiquetées. La méthodeproposée est applicable à de nombreux domaines, apportant la souplesse d'un système de requêtepar l'exemple et la granularité des techniques d'extraction ciblée (focused retrieval)<br>This thesis addresses the problem of lack of efficient computational tools for graph based structural pattern recognition approaches and proposes to exploit computational strength of statistical pattern recognition. It has two fold contributions. The first contribution is a new method of explicit graph embedding. The proposed graph embedding method exploits multilevel analysis of graph for extracting graph level information, structural level information and elementary level information from graphs. It embeds this information into a numeric feature vector. The method employs fuzzy overlapping trapezoidal intervals for addressing the noise sensitivity of graph representations and for minimizing the information loss while mapping from continuous graph space to discrete vector space. The method has unsupervised learning abilities and is capable of automatically adapting its parameters to underlying graph dataset. The second contribution is a framework for automatic indexing of graph repositories for graph retrieval and subgraph spotting. This framework exploits explicit graph embedding for representing the cliques of order 2 by numeric feature vectors, together with classification and clustering tools for automatically indexing a graph repository. It does not require a labeled learning set and can be easily deployed to a range of application domains, offering ease of query by example (QBE) and granularity of focused retrieval
5
Phan, Minh-Son. "Contribution à l'estimation de la similarité dans un ensemble de projections tomographiques non-orientées." Thesis, Strasbourg, 2016. http://www.theses.fr/2016STRAD041/document.
Full textAbstract:
La cryo-microscopie électronique est une technique tomographique permettant de reconstituer la structure 3D d’un objet complexe en biologie à partir d’un jeu d’acquisitions. Ces images de l’objet complexe sont appelées les projections et sont acquises sous orientations inconnues. Un des avantages de la cryo-microscopie électronique est l’obtention d’un modèle 3D de très haute résolution de l’objet dans un état naturel. La procédure de reconstruction comporte plusieurs étapes telles que l’alignement, la classification des projections, l’estimation de leurs orientations et le raffinement des projections. Lors de ces étapes, la distance entre deux projections est fréquemment mesurée. Le travail réalisé au cours de cette thèse s’organise autour de la recherche théorique d’une distance entre des projections non-orientées avec comme objectif l’amélioration de la procédure de reconstruction tomographique en cryo-microscopie électronique. La contribution de ce travail de thèse est une méthode permettant d’estimer la différence angulaire entre deux projections dans les cas 2D et 3D. Notre méthode est basée sur la construction d’un graphe de voisinage dont les sommets sont les projections, dont les arêtes relient des projections voisines et sont pondérées par une approximation locale de la différence angulaire. Le calcul de ces poids repose sur les propriétés des moments de projection. Notre méthode est testée sur des images simulées de différentes résolutions et de différents niveaux du bruit. La comparaison avec des autres méthodes d’estimation de la différence angulaire est aussi réalisée<br>Cryo-electron microscopy is a tomographic technique allowing to reconstruct a 3D model of complex structure in biology from a set of acquired images. These images are known as the tomographic projections and are taken at unknown directions. The advantage of the cryo-electron microscopy is the 3D reconstruction at very high resolution. The reconstruction procedure consists of many steps such as projection alignment, projection classification, orientation estimation and projection refinement. During these steps, the distance between two projections is frequently measured. The work in this thesis aims at studying the distances mesured between two unknown-direction projections with the objective of improving the reconstruction result in the cryo-electron microscopy. The contribution of this thesis is the developement of a method for estimating the angular difference between two projections in 2D and 3D. Our method is based on the construction of a neighborhood graph whose vertices are the projections, whose edges link the projection neighbors and are weighted by a local approximation of the angular difference. The calculation of the weights relies on the projection moment properties. The proposed method has been tested on simulated images with different resolutions and at different noise levels. The comparison with others estimation methods of angular difference has been realised
6
Farkas, Ábel. "Dimension and measure theory of self-similar structures with no separation condition." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/7854.
Full textAbstract:
We introduce methods to cope with self-similar sets when we do not assume any separation condition. For a self-similar set K ⊆ ℝᵈ we establish a similarity dimension-like formula for Hausdorff dimension regardless of any separation condition. By the application of this result we deduce that the Hausdorff measure and Hausdorff content of K are equal, which implies that K is Ahlfors regular if and only if Hᵗ (K) > 0 where t = dim[sub]H K. We further show that if t = dim[sub]H K < 1 then Hᵗ (K) > 0 is also equivalent to the weak separation property. Regarding Hausdorff dimension, we give a dimension approximation method that provides a tool to generalise results on non-overlapping self-similar sets to overlapping self-similar sets. We investigate how the Hausdorff dimension and measure of a self-similar set K ⊆ ℝᵈ behave under linear mappings. This depends on the nature of the group T generated by the orthogonal parts of the defining maps of K. We show that if T is finite then every linear image of K is a graph directed attractor and there exists at least one projection of K such that the dimension drops under projection. In general, with no restrictions on T we establish that Hᵗ (L ∘ O(K)) = Hᵗ (L(K)) for every element O of the closure of T , where L is a linear map and t = dim[sub]H K. We also prove that for disjoint subsets A and B of K we have that Hᵗ (L(A) ∩ L(B)) = 0. Hochman and Shmerkin showed that if T is dense in SO(d; ℝ) and the strong separation condition is satisfied then dim[sub]H (g(K)) = min {dim[sub]H K; l} for every continuously differentiable map g of rank l. We deduce the same result without any separation condition and we generalize a result of Eroğlu by obtaining that Hᵗ (g(K)) = 0. We show that for the attractor (K1, … ,Kq) of a graph directed iterated function system, for each 1 ≤ j ≤ q and ε > 0 there exists a self-similar set K ⊆ Kj that satisfies the strong separation condition and dim[sub]H Kj - ε < dim[sub]H K. We show that we can further assume convenient conditions on the orthogonal parts and similarity ratios of the defining similarities of K. Using this property we obtain results on a range of topics including on dimensions of projections, intersections, distance sets and sums and products of sets. We study the situations where the Hausdorff measure and Hausdorff content of a set are equal in the critical dimension. Our main result here shows that this equality holds for any subset of a set corresponding to a nontrivial cylinder of an irreducible subshift of finite type, and thus also for any self-similar or graph directed self-similar set, regardless of separation conditions. The main tool in the proof is an exhaustion lemma for Hausdorff measure based on the Vitali's Covering Theorem. We also give several examples showing that one cannot hope for the equality to hold in general if one moves in a number of the natural directions away from `self-similar'. Finally we consider an analogous version of the problem for packing measure. In this case we need the strong separation condition and can only prove that the packing measure and δ-approximate packing pre-measure coincide for sufficiently small δ > 0.
7
Kourtellis, Nicolas. "On the Design of Socially-Aware Distributed Systems." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4107.
Full textAbstract:
Social media services and applications enable billions of users to share an unprecedented amount of social information, which is further augmented by location and collocation information from mobile phones, and can be aggregated to provide an accurate digital representation of the social world. This dissertation argues that extracted social knowledge from this wealth of information can be embedded in the design of novel distributed, socially-aware applications and services, consequently improving system response time, availability and resilience to attacks, and reducing system overhead. To support this thesis, two research avenues are explored.
First, this dissertation presents Prometheus, a socially-aware peer-to-peer service that collects social information from multiple sources, maintains it in a decentralized fashion on user-contributed nodes, and exposes it to applications through an interface that implements non-trivial social inferences. The system's socially-aware design leads to multiple system improvements: 1) it increases service availability by allowing users to manage their social information via socially-trusted peers, 2) it improves social inference performance and reduces message overhead by exploiting naturally-formed social groups, and 3) it reduces the opportunity of attackers to influence application requests. These performance improvements are assessed via simulations and a prototype deployment on a local cluster and on a worldwide testbed (PlanetLab) under emulated application workloads.
Second, this dissertation defines the projection graph, the result of decentralizing a social graph onto a peer-to-peer system such as Prometheus, and studies the system's network properties and how they can be used to design more efficient socially-aware distributed applications and services. In particular: 1) it analytically formulates the relation between centrality metrics such as degree centrality, node betweenness centrality, and edge betweenness centrality in the social graph and in the emerging projection graph, 2) it experimentally demonstrates on real networks that for small groups of users mapped on peers, there is high association of social and projection graph properties, 3) it shows how these properties of the (dynamic) projection graph can be accurately inferred from the properties of the (slower changing) social graph, and 4) it demonstrates with two search application scenarios the usability of the projection graph in designing social search applications and unstructured P2P overlays.
These research results lead to the formulation of lessons applicable to the design of socially-aware applications and distributed systems for improved application performance such as social search, data dissemination, data placement and caching, as well as for reduced system communication overhead and increased system resilience to attacks.
8
Tsukamoto, Tatsuya. "Knot-inevitable projections of planar graphs /." Electronic version of summary, 1999. http://www.wul.waseda.ac.jp/gakui/gaiyo/2870.pdf.
Full text
9
Sun, Qiang. "A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS109/document.
Full textAbstract:
Dans cette thèse, nous etudions deux principaux problèmes de la théorie des graphes: problème d’homomorphisme des graphes planaires (signés) et problème de cycle hamiltonien.Comme une extension du théorème des quatre couleurs, il est conjecturé([80], [41]) que chaque graphe signé cohérent planaire de déséquilibré-maille d+1(d>1) admet un homomorphisme à cube projective signé SPC(d) de dimension d. La question suivant étalés naturelle:Est-ce que SPC(d) une borne optimale de déséquilibré-maille d+1 pour tous les graphes signés cohérente planaire de déséquilibré-maille d+1?Au Chapitre 2, nous prouvons que: si (B,Ω) est un graphe signé cohérente dedéséquilibré-maille d qui borne la classe des graphes signés cohérents planaires de déséquilibré-maille d+1, puis |B| ≥2^{d−1}. Notre résultat montre que si la conjecture ci-dessus est vérifiée, alors le SPC(d) est une borne optimale à la fois en terme du nombre des sommets et du nombre de arêtes.Lorsque d=2k, le problème est équivalent aux problème des graphes:est-ce que PC(2k) une borne optimale de impair-maille 2k+1 pour P_{2k+1} (tous les graphes planaires de impair-maille au moins 2k+1)? Notez que les graphes K_4-mineur libres sont les graphes planaires, est PC(2k) aussi une borne optimale de impair-maille 2k+1 pour tous les graphes K_4-mineur libres de impair-maille 2k+1? La réponse est négative, dans[6], est donné une famille de graphes d’ordre O(k^2) que borne les graphes K_4-mineur libres de impair-maille 2k+1. Est-ce que la borne optimale? Au Chapitre 3, nous prouvons que: si B est un graphe de impair-maille 2k+1 qui borne tous les graphes K_4-mineur libres de impair-maille 2k+1, alors |B|≥(k+1)(k+2)/2. La conjonction de nos résultat et le résultat dans [6] montre que l’ordre O(k^2) est optimal. En outre, si PC(2k) borne P_{2k+1}, PC(2k) borne également P_{2r+1}(r>k).Cependant, dans ce cas, nous croyons qu’un sous-graphe propre de P(2k) serait suffisant à borner P_{2r+1}, alors quel est le sous-graphe optimal de PC2k) qui borne P_{2r+1}? Le premier cas non résolu est k=3 et r= 5. Dans ce cas, Naserasr [81] a conjecturé que le graphe Coxeter borne P_{11}. Au Chapitre 4, nous vérifions cette conjecture pour P_{17}.Au Chapitres 5, 6, nous étudions les problèmes du cycle hamiltonien. Dirac amontré en 1952 que chaque graphe d’ordre n est hamiltonien si tout sommet a un degré au moins n/2. Depuis, de nombreux résultats généralisant le théorème de Dirac sur les degré ont été obtenus. Une approche consiste à construire un cycle hamiltonien à partir d'un ensemble de sommets en contrôlant leur position sur le cycle. Dans cette thèse, nous considérons deux conjectures connexes. La première est la conjecture d'Enomoto: si G est un graphe d’ordre n≥3 et δ(G)≥n/2+1, pour toute paire de sommets x,y dans G, il y a un cycle hamiltonien C de G tel que dist_C(x,y)=n/2.Notez que l’ ́etat de degre de la conjecture de Enomoto est forte. Motivé par cette conjecture, il a prouvé, dans [32], qu’une paire de sommets peut être posé des distances pas plus de n/6 sur un cycle hamiltonien. Dans [33], les cas δ(G)≥(n+k)/2 sont considérés, il a prouvé qu’une paire de sommets à une distance entre 2 à k peut être posé sur un cycle hamiltonien. En outre, Faudree et Li ont proposé une conjecture plus générale: si G est un graphe d’ordre n≥3 et δ(G)≥n/2+1, pour toute paire de sommets x,y dans G et tout entier 2≤k≤n/2, il existe un cycle hamiltonien C de G tel que dist_C(x,y)=k. Utilisant de Regularity Lemma et Blow-up Lemma, au chapitre 5, nous donnons une preuve de la conjeture d'Enomoto conjecture pour les graphes suffisamment grand, et dans le chapitre 6, nous donnons une preuve de la conjecture de Faudree et Li pour les graphe suffisamment grand<br>In this thesis, we study two main problems in graph theory: homomorphism problem of planar (signed) graphs and Hamiltonian cycle problem.As an extension of the Four-Color Theorem, it is conjectured ([80],[41]) that every planar consistent signed graph of unbalanced-girth d+1(d>1) admits a homomorphism to signed projective cube SPC(d) of dimension d. It is naturally asked that:Is SPC(d) an optimal bound of unbalanced-girth d+1 for all planar consistent signed graphs of unbalanced-girth d+1?In Chapter 2, we prove that: if (B,Ω) is a consistent signed graph of unbalanced-girth d which bounds the class of consistent signed planar graphs of unbalanced-girth d, then |B|≥2^{d-1}. Furthermore,if no subgraph of (B,Ω) bounds the same class, δ(B)≥d, and therefore,|E(B)|≥d·2^{d-2}.Our result shows that if the conjecture above holds, then the SPC(d) is an optimal bound both in terms of number of vertices and number of edges.When d=2k, the problem is equivalent to the homomorphisms of graphs: isPC(2k) an optimal bound of odd-girth 2k+1 for P_{2k+1}(the class of all planar graphs of odd-girth at least 2k+1)? Note that K_4-minor free graphs are planar graphs, is PC(2k) also an optimal bound of odd-girth 2k+1 for all K_4-minor free graphs of odd-girth 2k+1 ? The answer is negative, in [6], a family of graphs of order O(k^2) bounding the K_4-minor free graphs of odd-girth 2k+1 were given. Is this an optimal bound? In Chapter 3, we prove that: if B is a graph of odd-girth 2k+1 which bounds all the K_4-minor free graphs of odd-girth 2k+1,then |B|≥(k+1)(k+2)/2. Our result together with the result in [6] shows that order O(k^2) is optimal.Furthermore, if PC(2k) bounds P_{2k+1},then PC(2k) also bounds P_{2r+1}(r>k). However, in this case we believe that a proper subgraph of PC(2k) would suffice to bound P_{2r+1}, then what’s the optimal subgraph of PC(2k) that bounds P_{2r+1}? The first case of this problem which is not studied is k=3 and r=5. For this case, Naserasr [81] conjectured that the Coxeter graph bounds P_{11} . Supporting this conjecture, in Chapter 4, we prove that the Coxeter graph bounds P_{17}.In Chapter 5,6, we study the Hamiltonian cycle problems. Dirac showed in 1952that every graph of order n is Hamiltonian if any vertex is of degree at least n/2. This result started a new approach to develop sufficient conditions on degrees for a graph to be Hamiltonian. Many results have been obtained in generalization of Dirac’s theorem. In the results to strengthen Dirac’s theorem, there is an interesting research area: to control the placement of a set of vertices on a Hamiltonian cycle such that thesevertices have some certain distances among them on the Hamiltonian cycle.In this thesis, we consider two related conjectures, one is given by Enomoto: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G, there is a Hamiltonian cycle C of G such that dist_C(x, y)=n/2. Motivated by this conjecture, it is proved,in [32],that a pair of vertices are located at distances no more than n/6 on a Hamiltonian cycle. In [33], the cases δ(G) ≥(n+k)/2 are considered, it is proved that a pair of vertices can be located at any given distance from 2 to k on a Hamiltonian cycle. Moreover, Faudree and Li proposed a more general conjecture: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G andany integer 2≤k≤n/2, there is a Hamiltonian cycle C of G such that dist_C(x, y) = k. Using Regularity Lemma and Blow-up Lemma, in Chapter 5, we give a proof ofEnomoto’s conjecture for graphs of sufficiently large order, and in Chapter 6, we give a proof of Faudree and Li’s conjecture for graphs of sufficiently large order
10
Chu, Lei. "Colouring Cayley Graphs." Thesis, University of Waterloo, 2005. http://hdl.handle.net/10012/1125.
Full textAbstract:
We will discuss three ways to bound the chromatic number on a Cayley graph.
1. If the connection set contains information about a smaller graph, then these two graphs are related. Using this information, we will show that Cayley graphs cannot have chromatic number three.
2. We will prove a general statement that all vertex-transitive maximal triangle-free graphs on <i>n</i> vertices with valency greater than <i>n</i>/3 are 3-colourable. Since Cayley graphs are vertex-transitive, the bound of general graphs also applies to Cayley graphs.
3. Since Cayley graphs for abelian groups arise from vector spaces, we can view the connection set as a set of points in a projective geometry. We will give a characterization of all large complete caps, from which we derive that all maximal triangle-free cubelike graphs on 2<sup>n</sup> vertices and valency greater than 2<sup>n</sup>/4 are either bipartite or 4-colourable.
Books on the topic "Graph projection"
1
Ali, Abdalla, and Australian Bureau of Agricultural and Resource Economics., eds. Wine grapes: Projections of wine grape production and winery intake to 1994-95. Australian Bureau of Agricultural and Resource Economics, 1992.
Find full text
2
Shepherd, Angela. Australian wine grape production and winery intake: Projections to 2002-03. ABARE, 2000.
Find full text
3
Alberto, Corso, and Polini Claudia 1966-, eds. Commutative algebra and its connections to geometry: Pan-American Advanced Studies Institute, August 3--14, 2009, Universidade Federal de Pernambuco, Olinda, Brazil. American Mathematical Society, 2011.
Find full text
4
Coolen, A. C. C., A. Annibale, and E. S. Roberts. Applications of random graphs. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198709893.003.0011.
Full textAbstract:
This chapter reviews graph generation techniques in the context of applications. The first case study is power grids, where proposed strategies to prevent blackouts have been tested on tailored random graphs. The second case study is in social networks. Applications of random graphs to social networks are extremely wide ranging – the particular aspect looked at here is modelling the spread of disease on a social network – and how a particular construction based on projecting from a bipartite graph successfully captures some of the clustering observed in real social networks. The third case study is on null models of food webs, discussing the specific constraints relevant to this application, and the topological features which may contribute to the stability of an ecosystem. The final case study is taken from molecular biology, discussing the importance of unbiased graph sampling when considering if motifs are over-represented in a protein–protein interaction network.
Book chapters on the topic "Graph projection"
1
van Wyk, Barend Jacobus, Michaël Antonie van Wyk, and Hubert Edward Hanrahan. "Successive Projection Graph Matching." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-70659-3_27.
Full text
2
Dwyer, Tim, and George Robertson. "Layout with Circular and Other Non-linear Constraints Using Procrustes Projection." In Graph Drawing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-11805-0_37.
Full text
3
de Ridder, H. N., and H. L. Bodlaender. "Graph automorphisms with maximal projection distances." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48321-7_16.
Full text
4
Zhu, Lei, Jingjing Li, and Zheng Zhang. "Dynamic Graph Learning for Feature Projection." In Dynamic Graph Learning for Dimension Reduction and Data Clustering. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-42313-0_2.
Full text
5
Soylu, Ahmet, and Evgeny Kharlamov. "Navigating OWL 2 Ontologies Through Graph Projection." In Metadata and Semantic Research. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-14401-2_10.
Full text
6
Husák, Martin, Joseph Khoury, Đorđe Klisura, and Elias Bou-Harb. "On the Provision of Network-Wide Cyber Situational Awareness via Graph-Based Analytics." In Complex Computational Ecosystems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-44355-8_12.
Full textAbstract:
AbstractIn this paper, we posit how semi-static (i.e., not changing very often) complex computer network-based intelligence using graph-based analytics can become enablers of Cyber Situational Awareness (CSA) (i.e., perception, comprehension, and projection of situations in a cyber environment). A plethora of newly surfaced cyber security researchers have used graph-based analytics to facilitate particular down tasks in dynamic complex cyber environments. This includes graph-, node- and edge-level detection, classification, and others (e.g., credit card fraudulent transactions as an edge classification problem). To the best of our knowledge, very limited efforts have consolidated the outputs of heterogeneous computer network monitoring and reconnaissance tools (e.g., Nmap) in enabling actionable CSA. As such, in this work, we address this literature gap while describing several use cases of graph traversal, graph measures, and subgraph mining in vulnerability and security state assessment, attack projection and mitigation, and device criticality estimation. We highlight the benefits of the graph-based approaches compared to traditional methods. Finally, we postulate open research and application challenges in graph-based analytics for CSA to prompt promising research directions and operational capabilities.
7
Fatemi, Bahareh, Soheila Molaei, Hadi Zare, and Shirui Pan. "Manifold Approximation and Projection by Maximizing Graph Information." In Advances in Knowledge Discovery and Data Mining. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75768-7_11.
Full text
8
Yoshida, Tetsuya, and Kazuhiro Okatani. "A Graph-Based Projection Approach for Semi-supervised Clustering." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15037-1_1.
Full text
9
Ma, Xiangnan, Wenting Yu, Lin Zhu, and Luyi Bai. "Cross-Projection for Embedding Translation in Knowledge Graph Completion." In Advances in Natural Computation, Fuzzy Systems and Knowledge Discovery. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32591-6_20.
Full text
10
Douar, Brahim, Michel Liquiere, Chiraz Latiri, and Yahya Slimani. "Graph-Based Relational Learning with a Polynomial Time Projection Algorithm." In Inductive Logic Programming. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31951-8_13.
Full textConference papers on the topic "Graph projection"
1
Liu, Hanyang, Junwei Han, and Feiping Nie. "Semi-supervised Orthogonal Graph Embedding with Recursive Projections." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/321.
Full textAbstract:
Many graph based semi-supervised dimensionality reduction algorithms utilize the projection matrix to linearly map the data matrix from the original feature space to a lower dimensional representation. But the dimensionality after reduction is inevitably restricted to the number of classes, and the learned non-orthogonal projection matrix usually fails to preserve distances well and balance the weight on different projection direction. This paper proposes a novel dimensionality reduction method, called the semi-supervised orthogonal graph embedding with recursive projections (SOGE). We integrate the manifold smoothness and label fitness as well as the penalization of the linear mapping mismatch, and learn the orthogonal projection on the Stiefel manifold that empirically demonstrates better performance. Moreover, we recursively update the projection matrix in its orthocomplemented space to continuously learn more projection vectors, so as to better control the dimension of reduction. Comprehensive experiment on several benchmarks demonstrates the significant improvement over the existing methods.
2
Zhang, Zhaoyang, and Zheng Tian. "Image Registration Using Isometric Projection of Graph." In 2009 International Conference on Information Engineering and Computer Science. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5363554.
Full text
3
Shang, Ming-Sheng, Yan Fu, and Duan-Bin Chen. "Personal Recommendation using Weighted Bipartite Graph Projection." In 2008 International Conference on Apperceiving Computing and Intelligence Analysis (ICACIA 2008). IEEE, 2008. http://dx.doi.org/10.1109/icacia.2008.4770004.
Full text
4
Weerasinghe, Thilina, Daniel Romero, Cesar Asensio-Marco, and Baltasar Beferull-Lozano. "Fast Distributed Subspace Projection via Graph Filters." In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8462110.
Full text
5
Wan, Hai, Yonghao Luo, Bo Peng, and Wei-Shi Zheng. "Representation Learning for Scene Graph Completion via Jointly Structural and Visual Embedding." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/132.
Full textAbstract:
This paper focuses on scene graph completion which aims at predicting new relations between two entities utilizing existing scene graphs and images. By comparing with the well-known knowledge graph, we first identify that each scene graph is associated with an image and each entity of a visual triple in a scene graph is composed of its entity type with attributes and grounded with a bounding box in its corresponding image. We then propose an end-to-end model named Representation Learning via Jointly Structural and Visual Embedding (RLSV) to take advantages of structural and visual information in scene graphs. In RLSV model, we provide a fully-convolutional module to extract the visual embeddings of a visual triple and apply hierarchical projection to combine the structural and visual embeddings of a visual triple. In experiments, we evaluate our model on two scene graph completion tasks: link prediction and visual triple classification, and further analyze by case studies. Experimental results demonstrate that our model outperforms all baselines in both tasks, which justifies the significance of combining structural and visual information for scene graph completion.
6
Futamura, Yasunori, Ryota Wakaki, and Tetsuya Sakurai. "Spectral Graph Partitioning Using Geodesic Distance-based Projection." In 2021 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 2021. http://dx.doi.org/10.1109/hpec49654.2021.9622831.
Full text
7
Topczewska, Magdalena, and Kurt Frischmuth. "Rank Regression by Projection Method vs Graph-Theoretical Algorithms." In 2008 7th Computer Information Systems and Industrial Management Applications (CISIM). IEEE, 2008. http://dx.doi.org/10.1109/cisim.2008.25.
Full text
8
Li, Bing C., and Lockheed Martin. "Graph and Projection Pursuits Approach for Time Frequency Analysis." In 2021 IEEE Radar Conference (RadarConf21). IEEE, 2021. http://dx.doi.org/10.1109/radarconf2147009.2021.9455233.
Full text
9
Ceylan, Oguzhan, and Gulsen Taskin. "Graph Optimized Locality Preserving Projection Via Heuristic Optimization Algorithms." In IGARSS 2019 - 2019 IEEE International Geoscience and Remote Sensing Symposium. IEEE, 2019. http://dx.doi.org/10.1109/igarss.2019.8900479.
Full text
10
Ma, Jun, and GuangXia Wang. "Construction and Intelligent Application of Map Projection Knowledge Graph." In 2022 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS). IEEE, 2022. http://dx.doi.org/10.1109/icitbs55627.2022.00026.
Full textReports on the topic "Graph projection"
1
Beck, D. M., M. J. Scott, S. F. Shindle, et al. Hanford Area 1990 population and 50-year projections. [Appendix contains computer programming for population projections and graphs showing them by grid areas]. Office of Scientific and Technical Information (OSTI), 1991. http://dx.doi.org/10.2172/5070450.
Full text
2
Tavella, Pilar, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): Issue 24: September, 2012. Inter-American Development Bank, 2012. http://dx.doi.org/10.18235/0008079.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from central banks on a monthly basis to produce a report and a set of illustrative graphs and tables.
3
Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 12 : April, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008245.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this April issue, REVELA reports that growth expectations for 2008 on average remained almost unchanged in Latin America at 5.23%. There are six countries with higher expected 2008 growth rates and two with lower expectations than last month's survey. On the other hand, inflation expectations continue to rise; now the expected inflation rate for 2008 is 7.7%, up from last month's 7.6%.
4
Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 10 : February, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008243.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this February issue, REVELA reports that growth expectations in Latin America for 2008 remain relatively high and stable. The average expected 2008 growth rate for the countries surveyed is now 5.2%. Inflation expectations continue to rise, increasing most significantly in Bolivia, Guatemala, Honduras and Peru. Now the expected inflation rate for 2008 is 7.1%, 0.1% higher than last surveyed.
5
Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 9 : January, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008260.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this January issue, REVELA reports that growth expectations in Latin America for 2008 were stable or even increased, except in Chile. The average expected 2008 growth rate for the countries surveyed is now 5.21%, higher than December's prediction of 5.03%. Inflation expectations increased in six countries and declined in four. In particular, expected 2008 inflation in Bolivia fell from 14.02% to 12.54%.
6
Salazni, Mariana, and Andrew Powell. Revelation of Expectations in Latin America (REVELA): No. 11 : March, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008244.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this March issue, REVELA reports that although growth expectations in Latin America for 2008 remain almost unchanged at 5.2%, there are six countries with lower expected 2008 growth rates. On the other hand, Inflation expectations continue to rise, now the expected inflation rate for 2008 is 7.6%, 0.54% higher than last month. The most significant increase occurred in Bolivia where the expected inflation rate rose from 12.91% to 16.97%.
7
Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 17 : September, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008250.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. The September issue of REVELA reports that growth expectations for 2008 are almost unchanged with respect to last month's survey. Now the simple average expected growth rate is 5.29%. However, growth is expected to slow in 2009, to an average of 4.7%, slightly down from last month 4.8% 2009 forecast. On the other hand, the expected inflation rate for 2008 increased from 9.43% to 9.59%. Inflation expectations for 2009 decreased, reaching a simple average of 8.63%.
8
Galindo, Arturo, and Mauricio Pinzon. Revelation of Expectations in Latin America (REVELA): No. 23 : March, 2009. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0008255.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this March issue, REVELA reports that growth expectations for 2009 decreased with respect to last month's survey. Now the simple average expected growth rate is 1.91%. In the same way, growth is expected to slow in 2010, to an average of 3.29%, down from last month's 3.62% 2010 forecast. On the other hand, the expected inflation rate for 2009 decreased from 7.25% to 6.66%. The simple average of the expected inflation rate for 2010 is 5.99%.
9
Salazni, Mariana, Andrew Powell, Mauricio Pinzon, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 16 : August, 2008. Inter-American Development Bank, 2008. http://dx.doi.org/10.18235/0008249.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this August issue, REVELA reports that growth expectations for 2008 are almost unchanged with respect to last month's survey. Now the simple average expected growth rate is 5.31%. However, growth is expected to slow in 2009, to an average of 4.8%, slightly down from last month 4.9% 2009 forecast. On the other hand, inflation expectations continue to rise; the expected inflation rate for 2008 increased from 8.95% to 9.43%. Inflation expectations for 2009 have also increased, reaching a simple average of 8.4%.
10
Pinzon, Mauricio, and Arturo Galindo. Revelation of Expectations in Latin America (REVELA): No. 21 : January, 2009. Inter-American Development Bank, 2009. http://dx.doi.org/10.18235/0008253.
Full textAbstract:
REVELA analyzes market expectations of growth and inflation in Latin American countries. The figures analyzed represent the results of surveys of private sector actors conducted by the central banks of each country according to their own specific methodologies. They do not represent official projections by the IDB or any other official body. RES collects the results of these surveys from participating central banks on a monthly basis to produce a report and a set of illustrative graphs and tables. In this January issue, REVELA reports that growth expectations for 2009 decreased with respect to last month's survey. Now the simple average expected growth rate is 2.97%. In the same way, growth is expected to slow in 2010, to an average of 3.54%, down from last month's 3.62% 2010 forecast. On the other hand, the expected inflation rate for 2009 decreased from 8.09% to 7.56%. The simple average of the expected inflation rate for 2010 is 5.96%.