Relevant bibliographies by topics / Constellation graphs

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Constellation graphs'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Constellation 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 "Constellation graphs"

1

Quilles Queiroz, Cátia R. de O., and Reginaldo Palazzo Júnior. "Codes over Graphs Derived from Quotient Rings of the Quaternion Orders." ISRN Algebra 2012 (June 27, 2012): 1–14. http://dx.doi.org/10.5402/2012/956017.

Full text
Abstract:
We propose the construction of signal space codes over the quaternion orders from a graph associated with the arithmetic Fuchsian group Γ8. This Fuchsian group consists of the edge-pairing isometries of the regular hyperbolic polygon (fundamental region) P8, which tessellates the hyperbolic plane 𝔻2. Knowing the generators of the quaternion orders which realize the edge pairings of the polygon, the signal points of the signal constellation (geometrically uniform code) derived from the graph associated with the quotient ring of the quaternion order are determined.
APA, Harvard, Vancouver, ISO, and other styles
2

Beynon, Malcolm J. "Constellation graphs and the role of rank position criteria value frontiers in PROMETHEE analysis." International Journal of Operational Research 3, no. 1/2 (2008): 201. http://dx.doi.org/10.1504/ijor.2008.016161.

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

Karsaev, O. V. "Modifi cation of the CGR-Algorithm on Data Routing in a Communication Network of Satellite Constellation." Mekhatronika, Avtomatizatsiya, Upravlenie 21, no. 2 (February 10, 2020): 75–85. http://dx.doi.org/10.17587/mau.21.75-85.

Full text
Abstract:
Communication networks in space systems involving the use of satellite constellations are DTN networks (Delay and Disruption Tolerant Networks). The establishment of communication channels in space communication networks has certain specifics: communication channels can be planned. In this regard, the CGR approach (Contact Graph Routing) is considered as the most promising solution to the problem of data routing. At the basis of this approach, taking into account this specificity, the calculation of the contact plan is considered. On the basis of this plan in the network nodes contact graphs are calculated, which are used to search the shortest data transmission routes. The paper proposes two interrelated solutions as a modification of this approach: the route search based on the contact plan, i.e. without calculation and use of the contact graph, and an adaptive method of finding the set of shortest routes required for routing. The essence of the first solution is as follows. In the standard CGR approach, the graph vertices correspond to the planned contacts between the network nodes, and the edges correspond to the data storage processes in the network nodes. In contrast, in the proposed approach, the vertices of the graph correspond to the nodes of the network, and the edges of the graph and their weight are determined dynamically, in the process of finding the shortest routes. The second solution is based on the concept of the planning front, which means a list of the closest contacts in time. The required routes are divided into a certain number of pools. Each pool combines the routes that use the specified contact from the planning front. The planning front is updated in two cases. If the network topology changes, the completed or not established contacts are replaced by subsequent ones with the same network nodes that are closest in time. If message traffic grows, a certain extension of the planning front and the use of additional route pools are performed. The article concludes with a description and justification of the expected advantages of the proposed approach.
APA, Harvard, Vancouver, ISO, and other styles
4

FUJIWARA, Mika, Shoji KAJINISHI, and Koji KURIHARA. "VISUALIZATION OF MULTIVARIATE DATA USING EXPANDED CONSTELLATION AND EXPANDED KANJI GRAPHS AND THEIR APPLICATION TO CLUSTERING." Journal of Environmental Science for Sustainable Society 10, no. 1 (2021): 1–8. http://dx.doi.org/10.3107/jesss.10.1.

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

Gao, Hua Meng, and He Liu. "Design of Regional Coverage Resource Satellite Constellation Based on Analytical Method." Advanced Materials Research 1049-1050 (October 2014): 1894–97. http://dx.doi.org/10.4028/www.scientific.net/amr.1049-1050.1894.

Full text
Abstract:
Using analytical method, based on the principle of effectively using satellite coverage area, constrained by satellite load operating height, the paper designed the regional coverage resource satellite constellation and presented all the design process. After that, the satellite orbit and constellation’s orbit parameters were obtained. Based on that, the resource satellite constellation graph was generated by using STK.
APA, Harvard, Vancouver, ISO, and other styles
6

Habel, Christopher, and Cengiz Acarturk'. "Causal inference in graph-text constellations: Designing verbally annotated graphs." Tsinghua Science and Technology 16, no. 1 (February 2011): 7–12. http://dx.doi.org/10.1016/s1007-0214(11)70002-5.

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

Sugano, Osamu, Sung H. Park, Masaaki Taguri, and Kazumasa Wakimoto. "CONSTELLATION GRAPH MODEL FOR PREDICTION." Journal of the Japanese Society of Computational Statistics 1, no. 1 (1988): 45–57. http://dx.doi.org/10.5183/jjscs1988.1.45.

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

Hou, Zhaoyang, Zheng Xiang, Peng Ren, and Bohao Cao. "SCMA Codebook Design Based on Decomposition of the Superposed Constellation for AWGN Channel." Electronics 10, no. 17 (August 30, 2021): 2112. http://dx.doi.org/10.3390/electronics10172112.

Full text
Abstract:
In this study, we propose a method named decomposition of the superposed constellation (DCSC) to design sparse code multiple access (SCMA) codebooks for the additive white Gaussian noise (AWGN) channel. We prove that the power of the user symbols (USs) is accurately determined by the power of the superposed constellation (SC). Thus, we select quadrature amplitude modulation (QAM) constellations as the SC and decompose the SC into several groups of USs with power diversity. The minimum Euclidean distance (MED) between superposed symbols (SS-MED) in the receiver is determined by the selected QAM and MED between the multi-dimensional codewords (CW-MED) is optimized by matching the symbols on different dimensions. We propose a simplified DCSC (S-DCSC) by modifying the factor graph and avoiding the transmission of USs with low power, which greatly reduces the complexity of the message passing algorithm (MPA). The simulations show that the SS-MEDs of DCSC and S-DCSC are larger than those in previous papers and the BER performance of the proposed codebooks is better than others.
APA, Harvard, Vancouver, ISO, and other styles
9

Martínez, C., E. Stafford, R. Beivide, and E. M. Gabidulin. "Modeling hexagonal constellations with Eisenstein-Jacobi graphs." Problems of Information Transmission 44, no. 1 (March 2008): 1–11. http://dx.doi.org/10.1134/s0032946008010018.

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

Sugano, Osamu. "GENERALIZED CONSTELLATION GRAPH TRANSFORMATION MODEL FOR PREDICTION." Journal of the Japanese Society of Computational Statistics 13, no. 1 (2000): 41–48. http://dx.doi.org/10.5183/jjscs1988.13.41.

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

Dissertations / Theses on the topic "Constellation graphs"

1

Dutta, Atri. "Optimal cooperative and non-cooperative peer-to-peer maneuvers for refueling satellites in circular constellations." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/28082.

Full text
Abstract:
Thesis (M. S.)--Aerospace Engineering, Georgia Institute of Technology, 2009.
Committee Chair: Panagiotis Tsiotras; Committee Member: Eric Feron; Committee Member: Joseph Saleh; Committee Member: Ryan Russell; Committee Member: William Cook
APA, Harvard, Vancouver, ISO, and other styles
2

Péret, Laurent. "Recherche en ligne pour les Processus Décisionnels de Markov : application à la maintenance d'une constellation de satellites." Phd thesis, Toulouse, INPT, 2004. https://hal.science/tel-04603802.

Full text
Abstract:
La résolution de Processus de Markov de grande dimension est habituellement basée sur le calcul hors ligne d'une approximation de la fonction de valeur optimale et sur son exploitation en ligne pour définir une politique a priori. Toutefois, quand l'espace d'états est très vaste et qu'aucune représentation structurée efficace n'est reconnue, le calcul d'une bonne approximation de la fonction de valeur optimale s'avère souvent être une tâche difficile. Nous proposons ici une approche alternative reposant sur la simulation stochastique du processus décisionnel depuis chaque état courant sur un certain horizon de raisonnement. Cette approche conduit à la définition en ligne d'une politique stochastique en remplacement de la politique a prioi traditionnelle. Nous proposons en particulier deux algorithmes pour contrôler l'allocation en ligne des simulations. Notre démarche a été validée sur une application proposée par le Centre National d'Etudes Spatiales concernant la maintenance d'une constellation de 32 satellites en orbite basse. Les actions à entreprendre définissent la préparation au sol de nouveaux satellites puis leur injection en orbite. L'objectif est de pallier efficacement les pannes affectant les satellites, qui, en raison de l'hostilité du milieu spatial, sont relativement fréquentes. Ce problème nous a conduit à mettre en oeuvre diverses techniques à base de simulations pour optimiser les politiques de maintenance. Les plus performantes de ces méthodes, combinant optimisation hors ligne et recherche en ligne, ont permis de diminuer les coûts simulés de maintenance de 26%.
APA, Harvard, Vancouver, ISO, and other styles
3

Martínez, Fernández María del Carmen. "Códigos y grafos sobre anillos de enteros complejos." Doctoral thesis, Universidad de Cantabria, 2007. http://hdl.handle.net/10803/10699.

Full text
Abstract:
El objetivo de esta tesis es definir códigos perfectos sobre diferentes espacios de señal multidimensionales. Para resolver este problema, esta memoria presenta una relación original entre las Teorías de Grafos, Números y Códigos. Uno de nuestros principales resultados es la propuesta de una métrica adecuada sobre constelaciones de señal de tipo cuadrático, hexagonal y cuatro-dimensional. Esta métrica es la distancia entre los vértices de una nueva clase de grafos de Cayley definidos sobre diferentes anillos de enteros, en concreto, los enteros de Gauss, Eisenstein-Jacobi y Lipschitz. Así, resolvemos el problema de Teoría de Grafos conocido como el cálculo del conjunto perfecto dominante sobre las familias de grafos definidas en esta memoria. Para cada caso, daremos una condición suficiente para obtener dicho conjunto. La obtención de estos conjuntos de dominación implica directamente la construcción de códigos perfectos sobre los alfabetos que se consideran.Además, se obtendrán algunos resultados de isomorfía y embebimiento de grafos. En particular, se establecerán las relaciones entre grafos circulantes, toroidales y los que se presentan en este trabajo. Más concretamente, se mostrará que siempre existen órdenes para los cuales un grafo Toro puede ser embebido en un grafo Gaussiano, de Esenstein-Jacobi o de Lipschitz. Esto implica que la conocida distancia de Lee es un caso particular de las métricas presentadas en este trabajo.
The aim of this work is to define perfect codes for different multidimensional signal spaces. To solve this problem, this thesis presents an original relationship among the fields of Graph Theory, Number Theory and Coding Theory. One of our main findings is the proposal of a suitable metric over quadratic, hexagonal and four-dimensional constellations of signal points. This metric is the distance among vertices of a new class of Cayley graphs defined over integer rings, namely Gaussian integers, the Eisenstein-Jacobi integers and the Lipschitz integers.A problem in Graph Theory known as the perfect dominating set calculation is solved over the families of graphs defined in this memory. A sufficient condition for obtaining such a set is given for each case. The obtention of these sets of domination directly yields to the construction of perfect codes for the alphabets under consideration. In addition, some isomorphism and graph embedding results are going to be obtained. Specially, the relations between circulant, toroidal and the graphs presented in this work are stated. In particular, there always exist orders for which a Torus graph can be embedded in Gaussian, Eisenstein-Jacobi and Lipschitz graphs. This implies that the well-known Lee distance is a subcase of the metrics presented in this research.
APA, Harvard, Vancouver, ISO, and other styles
4

Cunha, Daniel Carvalho da. "Canal M-APSK não-coerente de bloco : capacidade e proposta de codificação para receptores iterativos." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260836.

Full text
Abstract:
Orientador: Jaime Portugheis
Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação
Made available in DSpace on 2018-08-06T20:11:55Z (GMT). No. of bitstreams: 1 Cunha_DanielCarvalhoda_D.pdf: 2995961 bytes, checksum: 3bbce0e569994999c363151f6510cef1 (MD5) Previous issue date: 2006
Resumo: Em varios sistemas de transmissão passa-faixa, uma recepção coerente satisfatória é dificil de ser alcancada. Para alguns destes sistemas, é comum supor que a rotaçãoo de fase introduzida pelo canal é constante durante um bloco de L simbolos e que ela varia de maneira independente de bloco a bloco. Este canal é denominado canal não-coerente de bloco. Investigamos a capacidade de um canal não-coerente de bloco utilizando a modulação M-APSK (do inglês, M-ary Amplitude Phase Shift Keying). Apresentamos a caracterização da distribuição de entrada que atinge a capacidade e obtivemos limitantes superiores e inferiores para a mesma. Adicionalmente, desenvolvemos um algoritmo que simultaneamente fornece a distribuição de entrada e os parametros da modulação M-APSK que maximizam a informação mutua com recepção coerente. A investigação da capacidade mostrou que o aumento de L faz a capacidade não-coerente convergir para a coerente. Alem disso, o uso de codificação diferencial torna a convergência mais rapida. Motivados por este comportamento, apresentamos um esquema de codificação eficiente em faixa. Este esquema é formado pela concatenação serial de um codigo LDPC (do ingles, Low-Density Parity Check ), um entrela¸cador e um codificador diferencial. Para o esquema apresentado, o receptor iterativo é descrito por um grafo-fator. Os desempenhos do esquema com diferentes tamanhos de codigos LDPC são comparados
Abstract: Coherent reception is not possible for many bandpass transmission systems. In some of these systems, it is commonly assumed that the unknown carrier phase rotation is constant over a block of L symbols and it is independent from block to block. This channel is denominated blockwise noncoherent channel. The blockwise noncoherent channel capacity using M-ary Amplitude and Phase Shift Keying (M-APSK) modulation is investigated. The characterization of the input distribution achieving capacity is presented. Upper and lower bounds to this capacity are derived. In addition, an algorithm for simultaneously computing the input distribution and the M-APSK constellation parameters which maximizes the mutual information with coherent reception is developed. The investigation of the capacity showed that as L increases, the noncoherent capacity converges to the coherent one. Besides that, the use of differential encoding makes this convergence faster. Motivated by this fact, a bandwidth efficient coding scheme is presented. This scheme is composed of a serial concatenation of a Low-Density Parity Check (LDPC) code, an interleaver, and a differential encoder. For this scheme, the iterative receiver is described by a factor graph. The scheme performances for different lengths of LDPC codes are compared.
Doutorado
Telecomunicações e Telemática
Doutor em Engenharia Elétrica
APA, Harvard, Vancouver, ISO, and other styles
5

Acartürk, Cengiz [Verfasser]. "Multimodal comprehension of graph-text constellations : an information processing perspective / von Cengiz Acartürk." 2009. http://d-nb.info/1000521222/34.

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

Books on the topic "Constellation graphs"

1

ill, Chewning Randy, ed. Glow-in-the-dark constellations: A field guide for young stargazers. New York: Grosset & Dunlap, 1989.

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

Farrell, John. Stargazer's alphabet: Night-sky wonders from A to Z. Honesdale, Pa: Boyds Mills Press, 2007.

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

Honami, Yukine, and Chisako Sakuragi. Constellations In My Palm (Yaoi). Digital Manga Publishing, 2007.

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

Peters, Stephanie True. Andromeda (Peters, Stephanie True, Library of Constellations.). PowerKids Press, 2003.

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

Peters, Stephanie True. Pisces (Peters, Stephanie True, Library of Constellations.). PowerKids Press, 2003.

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

Glow-in-the-Dark Constellations. Grosset & Dunlap, 1999.

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

Glow-in-the-Dark Constellations. Grosset & Dunlap, 1999.

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

Thompson, C. E. Glow-In-The-Dark Constellations: A Field Guide for Young Stargazers. Tandem Library, 1999.

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

Holt, Laurence. Stikky Night Skies: Learn 6 Constellations, 4 Stars, a Planet, a Galaxy, and How to Navigate at Night--In One Hour. Holt Books, Incorporated, Laurence, 2014.

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

Holt, Laurence. Stikky Night Skies: Learn 6 Constellations, 4 Stars, A Planet, A Galaxy, And How To Navigate At Night--in One Hour, Guaranteed (Stikky). Laurence Holt Books, 2004.

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

Book chapters on the topic "Constellation graphs"

1

Mayumi, Oyama-Higa, and Tiejun Miao. "Representation of a Physio-psychological Index Through Constellation Graphs." In Lecture Notes in Computer Science, 811–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11539087_109.

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

Lando, Sergei K., and Alexander K. Zvonkin. "Constellations, Coverings, and Maps." In Graphs on Surfaces and Their Applications, 7–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-38361-1_2.

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

Tonkin, Emma L., Heather D. Pfeiffer, and Gregory J. L. Tourte. "Analyzing Clusters and Constellations from Untwisting Shortened Links on Twitter Using Conceptual Graphs." In Conceptual Structures for STEM Research and Education, 58–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-35786-2_6.

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

"From “Maus” to MetaMaus: Art Spiegelman’s Constellation of Holocaust Textimonies." In The Trauma Graphic Novel, 112–50. New York: Routledge, 2017. |: Routledge, 2017. http://dx.doi.org/10.4324/9781315296616-10.

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

Wade, Leslie A. "Exceptional Performance, Exceptional Place." In Downtown Mardi Gras, 214–25. University Press of Mississippi, 2019. http://dx.doi.org/10.14325/mississippi/9781496823786.003.0008.

Full text
Abstract:
This chapter assesses New Orleans’ situation in 2018. One can see Downtown Mardi Gras as a vast piece of egalitarian street theatre, whose process may witness ego-rivalries and identity contestations, but whose final performance achieves something greater than the sum of its parts—the physical manifestation of an aspirant desire, for a reanimated city, of tolerance, equity, and mutual respect. Downtown Mardi Gras may portend a new future for Carnival practices, the opening of the door to further, yet-to-be-realized ludic expressions and energies; it may also point to new civic constellations, themselves yet unmaterialized, that could help elevate actual lives, spreading more widely the benefits of post-Katrina recovery.
APA, Harvard, Vancouver, ISO, and other styles
6

Taylor, David Francis. "The Literariness of Graphic Satire." In The Politics of Parody, 3–39. Yale University Press, 2018. http://dx.doi.org/10.12987/yale/9780300223750.003.0001.

Full text
Abstract:
This introductory chapter discusses the literariness of graphic satire. First applied to visual satire in the mid-nineteenth century, the term graphic satire problematically implies a straightforward formal equivalence between the modern editorial cartoon and the political caricature of the Georgian period, which was published and disseminated as a single-sheet etching. However, the fallacy that such images yield their meaning directly and near instantaneously is an old one. To speak of the literariness of caricature is to recognize and attend to its syntactical and narrative structures: structures that are themselves constituted through the enmeshing of images and words; the appropriation and parody of literary scenes and tropes; and often-dense networks of allusions to other cultural texts, practices, and traditions. It is also necessary to acknowledge that a print's meaning and sociopolitical orientation comes into focus only when seen in relation to the cultural constellation of which it was a vital and highly self-conscious constituent.
APA, Harvard, Vancouver, ISO, and other styles
7

Gornykh, Andrei. "Trava-Travlya-Trata: Tarkovsky’s Psychobiography à la Lettre." In ReFocus: The Films of Andrei Tarkovsky, 30–45. Edinburgh University Press, 2020. http://dx.doi.org/10.3366/edinburgh/9781474437233.003.0003.

Full text
Abstract:
This chapter offers a close reading of Tarkovsky’s diary from a Lacanian perspective by focusing on the director’s recurrent use of those key words which symbolically epitomize and organize the major thematic layers of his biography and cinema as well: namely, grass (or trava in Russian), persecution from the state authorities (travlia), and expense (trata). Phonetically consonant and etymologically derived from the same root tra- (or proto-Slavic ter), these words make up a coherent cluster of signifiers (trava-trata-travlia) which are centred around the director’s primal fantasy of the house. As the author argues, the signifying constellation “trava-trata-travlia” in Tarkovsky’s diary could be viewed as a psychobiographical code to the internal dynamics of his visual imagery
APA, Harvard, Vancouver, ISO, and other styles
8

Ravat, Franck, Olivier Teste, and Gilles Zurfluh. "Constraint-Based Multi-Dimensional Databases." In Database Technologies, 961–86. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-058-5.ch056.

Full text
Abstract:
This chapter deals with constraint-based multidimensional modelling. The model we define integrates a constellation of facts and dimensions. Along each dimension, various hierarchies are possibly defined and the model supports multiple instantiations of dimensions. The main contribution is the definition of intra-dimension constraints between hierarchies of a same dimension as well as inter-dimension constraints of various dimensions. To facilitate data querying, we define a multi-dimensional query algebra, which integrates the main multi-dimensional operators such as rotations, drill down, roll up… These operators support the constraint-based multi-dimensional modelling. Finally, we present two implementations of this algebra. First, OLAP-SQL is a textual language integrating multi-dimensional concepts (fact, dimension, hierarchy), but it is based on classical SQL syntax. This language is dedicated to specialists such as multi-dimensional database administrators. Second, a graphical query language is presented. This language consists in a graphical representation of multi-dimensional databases, and users specify directly their queries over this graph. This approach is dedicated to non-computer scientist users.
APA, Harvard, Vancouver, ISO, and other styles
9

Zachar Podolinská, Tatiana. "Traces of the Mary in Post-Communist Europe." In Traces of the Virgin Mary in Post-Communist Europe, 16–55. Institute of Ethnology and Social Anthropology, Slovak Academy of Sciences, VEDA, Publishing House of the Slovak Academy of Sciences, 2020. http://dx.doi.org/10.31577/2019.9788022417822.16-55.

Full text
Abstract:
The Virgin Mary as such cannot be examined scientifically. We can, however, examine her ‘apparitions’ in the world, as well as the innumerable variants of Marian devotion and cult. This volume focuses on her manifestations in the post-Communist region with some geographical spillovers. It is either because post-Communist transformation concerned not only the former socialist countries, but also had an impact on the entire European region and was part of the overall post-modern and post-Communist reconfiguration of the European area. Another factor is that Marian worship is not controlled by political borders of present-day nation states. It has a wider transnational potential and impact. Nevertheless, we focused our viewfinder primarily on the post-Communist region, as we believe that thanks to its geographical and symbolic location and economic position in Europe, as well as its historical roots and traditions and common Communist history and heritage, it not only shows different traits of modernity compared to ‘Western Europe’, but we also face specific features and forms of worshipping of the Virgin Mary. We therefore decided to present in this volume the traces of the Virgin Mary by means of more in-depth analyses from selected countries of the post-socialist region. By means of this publication, we can observe how the Virgin Mary is manifested in the faces of seers and pilgrims and how audio-visual means are becoming a direct part of Marian apparitions in Germany in the modern era (H. Knoblauch and S. Petschke); how she speaks through the mouth of a blind Roma woman and pacifies the ethnic and religious tensions between various groups in Romania (L. Peti); how she attributes meaning to meaningless places on the map by reallocating her presence through the geo- graphical and time distribution of Marian dedications in Slovakia (J. Majo); how, after the fall of Communism, she revitalises the old places of her cult with new power, bringing together traditional and non-traditional forms of worship in the secular Czech Lands (M. Holubová); how her messages are spread on the websites of new non-traditional Marian movements and how their apocalyptical warnings are being updated and localised into the specific national environment in Czechia (V. Tutr); how she addresses the readers of Marian literature differently on the shelves of book- stores in Slovakia and Austria (R. Kečka); but also how the Virgin Mary absorbs ultra-modern millennial and spiritualistic concepts of Mother Earth and Mother of the Universe, becoming the speak- er of the great unified Hungarian nation (J. Kis-Halas); how she is becoming the re-discovered herald of Serbian national identity (A. Pavićević); how she absorbs the local forms of faith and folk Christianity in modern era and is thus the manifestation of grass- root Christianity and local religious culture in Bulgaria (V. Baeva and A. Georgieva); and how the path from a private to an officially recognised apparition depends not only on the Virgin Mary and the seer, but also on the overall constellation of the audience and the ability to offer a religious ready-made event (T. Zachar Podolinská and L. Peti). This publication observes the current diversity of the forms of Marian devotion in post-Communist countries through different national and geographically defined contours and, in particular, the ability of the Virgin Mary to satisfy the hunger for modern spirituality and authentic religiousness, give voice to unofficial and popular religions, revitalise and redefine old places of cult and add new ones, appease war conflicts, speak out on behalf of nations and marginalised ethnic groups, and guard national and conservative values. The post-modern and post-Communist Mary thus restores ruptured traditions with love and enchants the violently atheised European region with new miracles and apparitions, regardless of whether top Church and state representatives like it or not.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Constellation graphs"

1

"Distinction of Patterns within Time-Series Data Using Constellation Graphs." In 5th International Workshop on Pattern Recognition in Information Systems (PRIS-2004). SciTePress - Science and and Technology Publications, 2005. http://dx.doi.org/10.5220/0002559301920197.

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

Martinez, C., E. Stafford, R. Beivide, C. Camarero, F. Vallejo, and E. Gabidulin. "Graph-based metrics over QAM constellations." In 2008 IEEE International Symposium on Information Theory - ISIT. IEEE, 2008. http://dx.doi.org/10.1109/isit.2008.4595440.

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

Rogers, Jen, Matthieu Poyade, and Frank Pollick. "Constellations of movement." In SIGGRAPH '17: Special Interest Group on Computer Graphics and Interactive Techniques Conference. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3102163.3102168.

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

Juan Lin, H. Yamagishi, M. Oyama-Higa, T. Suzuki, and K. Satoh. "Time-series representation of biological information utilizing a constellation graph." In 2009 6th International Symposium on Image and Signal Processing and Analysis. IEEE, 2009. http://dx.doi.org/10.1109/ispa.2009.5297729.

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

Lima, João, Luana Lima, and Wilken Melo. "Modulations for Large Signal Constellations Coming from Embedding of Complete Graph." In VII International Telecommunications Symposium. Sociedade Brasileira de Telecomunicações, 2010. http://dx.doi.org/10.14209/sbrt.2010.16.

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

Berger, Jean, Emmanuel Giasson, Mihai Florea, Moufid Harb, Alexander Teske, Emil Petriu, Rami Abielmona, Rafael Falcon, and Nassirou Lo. "A Graph-based Genetic Algorithm to Solve the Virtual Constellation Multi-Satellite Collection Scheduling Problem." In 2018 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2018. http://dx.doi.org/10.1109/cec.2018.8477700.

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

Vazhkudai, Sudharshan S., John Harney, Raghul Gunasekaran, Dale Stansberry, Seung-Hwan Lim, Tom Barron, Andrew Nash, and Arvind Ramanathan. "Constellation: A science graph network for scalable data and knowledge discovery in extreme-scale scientific collaborations." In 2016 IEEE International Conference on Big Data (Big Data). IEEE, 2016. http://dx.doi.org/10.1109/bigdata.2016.7840959.

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

Mueller, Christian A., Kaustubh Pathak, and Andreas Birk. "Object shape categorization in RGBD images using hierarchical graph constellation models based on unsupervisedly learned shape parts described by a set of shape specificity levels." In 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014). IEEE, 2014. http://dx.doi.org/10.1109/iros.2014.6942984.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Constellation graphs' for particular source types:
Journal articles
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