Relevant bibliographies by topics / Bigraphs

Contents

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

Academic literature on the topic 'Bigraphs'

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

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 'Bigraphs.'

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 "Bigraphs"

1

Xu, Dong, Gang Zhu, and De Zhen Xu. "Towards Checking Bigraphical Context-Aware Models." Applied Mechanics and Materials 411-414 (September 2013): 545–48. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.545.

Full text
Abstract:
Context-aware computing is an important aspect of Pervasive Computing, Cyber-physical Systems (CPS), Cloud computing, etc. Recently, few works have been reported on formal approaches for this area. Bigraph was proposed as a mathematical structure that is consist of two graphs, a place graph and a link graph, intended for modeling distributed, mobile systems, etc. Bigraphs and its corresponding Bigraphical Reactive Systems (BRSs) present a modern, graphical structure, algebra calculus for the description of the syntax and semantics of systems in accordance with the orthogonal notions of connectivity and locality. Bigraphs and BRSs have been applied in various areas. Bigraph is used to formalize context-aware models in this paper. Then, we present an approach to check the formal context-aware models. The formalisms and checking are explicitly depicted through a simple but non-trivial example.
APA, Harvard, Vancouver, ISO, and other styles
2

Grohmann, Davide, and Marino Miculan. "Directed Bigraphs." Electronic Notes in Theoretical Computer Science 173 (April 2007): 121–37. http://dx.doi.org/10.1016/j.entcs.2007.02.031.

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

Krivine, Jean, Robin Milner, and Angelo Troina. "Stochastic Bigraphs." Electronic Notes in Theoretical Computer Science 218 (October 2008): 73–96. http://dx.doi.org/10.1016/j.entcs.2008.10.006.

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

Ó Conchúir, Shane. "Kind Bigraphs." Electronic Notes in Theoretical Computer Science 225 (January 2009): 361–77. http://dx.doi.org/10.1016/j.entcs.2008.12.086.

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

Rahimi, Fatemeh. "Splitting of Bigraphs." IOSR Journal of Mathematics 5, no. 3 (2013): 70–73. http://dx.doi.org/10.9790/5728-0537073.

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

Sevegnani, Michele, and Muffy Calder. "Bigraphs with sharing." Theoretical Computer Science 577 (April 2015): 43–73. http://dx.doi.org/10.1016/j.tcs.2015.02.011.

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

Jensen, Ole Høgh, and Robin Milner. "Bigraphs and transitions." ACM SIGPLAN Notices 38, no. 1 (2003): 38–49. http://dx.doi.org/10.1145/640128.604135.

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

Chang, Gerard Jennhwa, Ton Kloks, and Sheng-Lung Peng. "Probe interval bigraphs." Electronic Notes in Discrete Mathematics 19 (June 2005): 195–201. http://dx.doi.org/10.1016/j.endm.2005.05.027.

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

Birkedal, Lars, Troels Christoffer Damgaard, Arne John Glenstrup, and Robin Milner. "Matching of Bigraphs." Electronic Notes in Theoretical Computer Science 175, no. 4 (2007): 3–19. http://dx.doi.org/10.1016/j.entcs.2007.04.013.

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

Babić, Ranko, and Lidija Babić. "A New Type of Bipartite Random Graph as a Transform of Seismogram and Its Potential for Organizing Seismic Databases." Applied Sciences 13, no. 18 (2023): 10303. http://dx.doi.org/10.3390/app131810303.

Full text
Abstract:
This paper proposes a method to reduce seismogram variability as a determining factor in its interpretation, processing, and clustering. By introducing the concept of single fluctuations (SFs), the seismogram can be parsed into a sequence of random impulses with subsequent ordering. This rearrangement of SFs, if they are assigned by positive integers, represents the formal mapping of a regular string of integers into a random one, which can be represented with a bipartite random graph (bigraph). Due to its specific randomness, such a bigraph is considered a new type of random balanced bigraph. The R-envelope and RQ-envelope, its equidistant version, are defined by tracing the peak envelope over ordered SFs. The equivalence and complementariness of the RQ and bigraph are considered and discussed, forming a combined characteristic of the seismogram. The R/RQ provided a considerable reduction in seismogram variability, which was confirmed by creating and analyzing an ensemble of RQ from several seismograms. In the RQ domain, distance is defined as a possible basis for metrics and clustering, but the ensemble variability was quite narrow and not as suitable for this purpose. Otherwise, the ensemble shows high redundancy hidden in the seismogram population. As for the bigraph, the mesh of its edges is structuralized in bundles, forming a skeleton, which reflects the internal structural content of the seismogram. The distance over the domain of bigraphs is proposed to show the possibility of clustering. This means that only a combined RQ and bigraph provides a suitable frame for seismogram representation with reduced variability and, thus, the potential for more effectively organizing seismic databases and a deeper interpretation of seismograms; therefore, RQs and bigraphs can be considered as a transform of a seismogram. Many aspects of these concepts are thoroughly discussed. The similarity between concepts of SF and wavelets is briefly considered. This very complex theme is new and promises broad further research. All issues considered in the paper are abundantly illustrated.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Bigraphs"

1

Sevegnani, Michele. "Bigraphs with sharing and applications in wireless networks." Thesis, University of Glasgow, 2012. http://theses.gla.ac.uk/3742/.

Full text
Abstract:
Bigraphs are a fully graphical process algebraic formalism, capable of representing both the position in space of agents and their inter-connections. However, they assume a topology based on sets of trees and thus cannot represent spatial locations that are shared among several entities in a simple or intuitive way. This is a problem, because shared locations are often a requirement, for example, when modelling scenarios in the physical world or in modern complex computer systems such as wireless networks and spatial-aware applications in ubiquitous computing. We propose bigraphs with sharing, a generalisation of the original definition of bigraphs, to allow for overlapping topologies. The new locality model is based on directed acyclic graphs. We demonstrate the new formalism can be defined in the general framework of bigraphical theories and wide reactive systems, as originally devised by Robin Milner. We do so by defining a categorical interpretation of bigraphs with sharing, an axiomatisation derived from the equations of a bialgebra over finite ordinals, and a normal form to express bigraphical terms. We illustrate how sharing is essential for modelling overlapping localities by presenting two example case studies in the field of wireless networking. We show that bigraphs with sharing can be used realistically in a production environment by describing the implementation of an efficient matching algorithm and a software tool for the definition, simulation, visualisation and analysis of bigraphical reactive systems.
APA, Harvard, Vancouver, ISO, and other styles
2

Basu, Asim. "More results on representation of digraphs /bigraphs using intervals or circular-arcs." Thesis, University of North Bengal, 2012. http://hdl.handle.net/123456789/20.

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

Krishna, Renan. "Constructing runtime models with bigraphs to address ubiquitous computing service composition volatility." Thesis, University of Sussex, 2015. http://sro.sussex.ac.uk/id/eprint/54282/.

Full text
Abstract:
In this thesis, we explore the appropriateness of the language abstractions provided by Bigraphs to construct a model at runtime to tackle the problem of volatility in a service composition running on a mobile device. Our contributions to knowledge are as follows: 1) We have shown that Bigraphs (Milner, 2009) are suitable for expressing models at runtime. 2) We have offered Bigraph language abstractions as an appropriate solution to some of the research problems posed by the models at runtime community (Aßmann et al., 2012). 3) We have discussed the general lessons learnt from using Bigraphs for a practical application such as a model at runtime. 4) We have discussed the general lessons learnt from our experiences of designing models at runtime. 5) We have implemented the model at runtime using the BPL Tool (ITU, 2011) and have experimentally studied the response times of our Bigraphical model. We have suggested appropriate enhancements for the tool based on our experiences. We present techniques to parameterize the reaction rules so that the matching algorithm of the BPL Tool returns a single match giving us the ability to dynamically program the model at runtime. We also show how to query the Bigraph structure.
APA, Harvard, Vancouver, ISO, and other styles
4

Grzelak, Dominik. "Bigraphical Domain-specific Language (BDSL): User Manual." Technische Universität Dresden, 2021. https://tud.qucosa.de/id/qucosa%3A75217.

Full text
Abstract:
This report describes Bigraphical DSL (BDSL), a domain-specific language for reactive systems, rooted in the mathematical spirit of the bigraph theory devised by Robin Milner. BDSL is not only a platform-agnostic programming language but also a development framework for reactive applications, written in the Java programming language, with a focus on stability and interoperability. The report serves as a user manual mainly elaborating on how to write and execute BDSL programs, further covering several features such as how to incorporate program verification. Moreover, the manual procures some best practices on design patterns in form of code listings. The BDSL development framework comes with a ready-to-use interpreter and may be a helpful research tool to experiment with the underlying bigraph theory. The framework is further intended for building reactive applications and systems based on the theory of bigraphical reactive systems.:1 Introduction 1.1 Bigraphical Reactive Systems and Programming . . . . . 1.2 Installation 1.3 How to write and run BDSL programs? 1.4 Further Help 1.5 Remarks 2 General Usage of the BDSL Interpreter Tool 2.1 The CLI Interpreter of BDSL 2.2 Supplying a BDSL Program to the Interpreter 2.3 Externalized Configuration 3 BDSL Program Structure 3.1 Elements of a BDSL program 3.2 Main Block 3.3 Scoping, Namespaces and Imports 3.4 Classes and Variables 3.5 Event Listeners/Callbacks 4 Predefined Methods in BDSL 4.1 Printing to the Console 4.2 Loading Bigraphs 4.3 Synthesizing Random Bigraphs 4.4 Exporting Bigraph Variables 4.5 Executing BRSs 5 Examples 5.1 Basic Mathematical Calculations the Bigraphical Way 5.2 Importing External Libraries 5.3 Pathfinding: Naive Blind Search 5.4 Mutual Exclusion Problem 6 Advanced Topics 6.1 User-defined Functions 6.2 Using the Interpreter Programmatically 6.3 IDE Support 7 Conclusion 7.1 Future Work References Appendix A Configuration File for the BDSL Interpreter B BDSL Sample Programs C Using the BDSL Interpreter Programmatically
APA, Harvard, Vancouver, ISO, and other styles
5

Pardon, Aurélien. "Théories symétriques monoïdales closes, applications au lambda-calcul et aux bigraphes." Thesis, Lyon, École normale supérieure, 2011. http://www.theses.fr/2011ENSL0622.

Full text
Abstract:
En se fondant sur les travaux de Trimble et al., puis Hughes, on donne une notion de théorie symétrique monoïdale close (smc) et une construction explicite de la catégorie smc engendrée, formant ainsi une adjonction entre théories et catégories. On étudie les exemples du lambda-calcul pur linéaire, du lambda-calcul pur standard, puis des bigraphes de Milner. À chaque fois on donne une théorie smc et on compare la catégorie smc engendrée avec la présentation standard. Entre autres, dans les trois cas, on montre une équivalence entre les deux sur les termes clos<br>From the work of Trimble et al. and Hughes, we define a notion of symmetric monoidal closed (smc) theory and give an explicit construction of the smc category generated by it. This construction yields a monadic adjunction between smc theories and smc categories. We study in our algebraic framework different models of programming languages: the linear λ-calculus, the pure λ-calculus and Milner's bigraphs. For each model, we give a smc theory and compare the generated smc category with the standard presentation. We show that, in each case, there is an equivalence on closed terms
APA, Harvard, Vancouver, ISO, and other styles
6

Palinski, Amy M. "Investigating the Role of Open Bigrams in Visual Word Perception." Cleveland State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=csu1464265892.

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

Teline, Maria Fernanda. ""Avaliação de métodos para a extração automática de terminologia de textos em português"." Universidade de São Paulo, 2004. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-25052004-012204/.

Full text
Abstract:
Nas últimas décadas, o grande avanço da ciência e tecnologia com suas invenções, novos materiais, equipamentos e métodos gerou a necessidade da criação de novos nomes, chamados aqui de termos, e alterações nos seus significados, para nomear adequadamente esses avanços, principalmente em áreas dinâmicas como a Ciência da Computação, a Genética e a Medicina. Dado que o desenvolvimento de repertórios terminológicos é um trabalho difícil quando realizado manualmente, lingüistas computacionais, lingüistas aplicados, tradutores, intérpretes, jornalistas científicos têm se interessado pela extração automática de terminologias (EAT) de textos. O crescimento explosivo de dados do tipo texto disponíveis na Web foi um fator contribuinte para a facilidade na construção de córpus eletrônicos de textos técnicos e científicos, propiciando a implementação de métodos de EAT. A EAT tem sido de grande interesse para todos os tipos de aplicações do Processamento de Línguas Naturais (PLN) que trabalham com domínios especializados e que, conseqüentemente, necessitam de um vocabulário especial. O objetivo desse projeto de mestrado foi avaliar métodos de EAT para o português do Brasil, ainda carente do tratamento automatizado para a criação de terminologias. Especificamente, foram implementados e avaliados métodos de EAT das abordagens estatística, lingüística e híbrida para unigramas, bigramas e trigramas a partir de um córpus de textos do domínio de Revestimentos Cerâmicos. Esses métodos empregam recursos simples como (a) uma stoplist para eliminar palavras como advérbios, (b) padrões sintáticos para os termos do domínio, por exemplo &ltsubstantivo adjetivo&gt, &ltsubstantivo preposição adjetivo&gt, levantados após a aplicação de um etiquetador Part-Of-Speech, (c) uma lista de expressões e palavras características de definições, descrições, classificações como 'definido(a)(s) como', 'caracterizado(a)', 'conhecido(a)(s) como', 'significa(m)', entre outras que são concentradoras de termos. As medidas estatísticas utilizadas nos métodos estatísticos e híbridos para indicar a relevância de termos no domínio são a informação mútua, o log-likelihood, o coeficiente dice e a freqüência. Os métodos propostos foram avaliados pelas medidas de precisão, revocação e medida F, utilizando uma lista de referência da área de Revestimentos Cerâmicos. Os melhores resultados da precisão são do método híbrido para unigramas (7%), bigramas (17%) e trigramas (26%), enquanto que a revocação é melhor nos métodos puramente lingüísticos tanto para unigramas (95%) como para bigramas (90%) e trigramas (100%). Os melhores valores da medida F foram dos métodos híbridos (11%, 17% e 33% para uni, bi e trigramas, respectivamente). Esses valores, embora tenham se apresentado os mais relevantes, foram bastante inferiores àqueles normalmente encontrados na literatura que trata da EAT, cujo desempenho obtido para essa tarefa fica em torno de 60%. Esses valores motivam a busca e implementação de métodos mais avançados para tratar o português, bem como a obtenção de recursos mais elaborados, a fim de encontrar resultados mais significantes para essa tarefa, facilitando, conseqüentemente o trabalho do especialista da área, que vai analisar os candidatos a termos extraídos pelos métodos automáticos, visto que é possível fornecer a ele informações mais precisas (poucas palavras da língua geral) e completas (uma maior quantidade de termos) sobre o córpus considerado.<br>During the last decades, the great advance in science and technology and their inventions, new materials, equipment and methods had as one result the necessity of creation of new names, called here terms, and alterations on their meanings, to name adequately these advances, mainly in areas as Computer Science, Genetics and Medicine. Considering that the development of terminological lists is an arduous work if manually executed, computational linguists, applied linguists, translators, interpreters and scientific journalists have been interested on automatic extraction of terminologies (AET) from texts. The sudden growing of data available on the Web was a contributing factor to facilitate the construction of electronic corpus of technical and scientific texts, providing implementation of AET methods. AET is very important for every sort of Natural Language Processing (NLP) applications that works on specialized domains and, consequently, needs special vocabulary. The purpose of this MS project was to evaluate AET methods for Brazilian Portuguese particularly, which is a language still in need of development of automatic treatment for terminology. Specifically, AET methods with statistic, linguistic and hybrid approaches were implemented and evaluated for unigrams, bigrams and trigrams for a corpus of texts in the domain of Ceramic Tiles. These methods use simple resources as (a) stoplist to eliminate words as adverbs, (b) syntactic patterns for terms from the domain, as, for instance, &ltsubstantive adjective&gt, &ltsubstantive preposition adjective&gt, considered after the application of a tagger Part-Of-Speech, (c) list of expressions and words typical of definitions, descriptions and classifications, like, for instance, 'defined as', 'characterized as', 'known as', 'that means', among others that concentrate terms. The statistic measures used by statistic and hybrid methods to indicate the terms relevance in the domain are mutual information, log-likelihood, dice coefficient, and frequency. The methods proposed were evaluated by precision, recall and F-measure, using a reference list in the area of Ceramic Tiles. The best results for precision are from the hybrid method for unigrams (7%), bigrams (17%) and trigrams (26%), while for recall the best results are from purely linguistic methods for unigrams (95%) as well as for bigrams (90%) and trigrams (100%). The best values for F-measure are from hybrid methods (11%, 17% and 33% for uni, bi and trigrams, respectively). These values, although presented as the most relevant ones, were quite inferior when compared to those commonly found in the literature concerned with AET, whose performance obtained for this task is around 60%. These values motivate the search and implementation of more advanced methods for Portuguese treatment, as well as the obtainment of more elaborated resources, in order to find more significant results for this task. In this way, the work of analysis of possible terms extracted by automatic methods done by the specialist of the area becomes much easier, since it is possible to provide him/her more precise (few word from general language) and complete (greater number of terms) information about the corpus under consideration.
APA, Harvard, Vancouver, ISO, and other styles
8

Grigaitytė, Justina. "BNS informacinių žinučių analizė teminiu aspektu." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100617_111801-05840.

Full text
Abstract:
Darbe nagrinėjamas temų identifikavimo uždavinys, kuris siejamas su teksto klasifikavimu į tam tikras kategorijas, t.y. įvairių tekstinių duomenų grupavimas pagal atitinkamas temas. Žinutės naujienų agentūrose yra skirstomos į atskiras grupes ir pogrupius pagal temas. Šis darbas atliekamas rankomis, t.y. perskaitomas tekstas ir priskiriamas kokiai nors temai. Vis dėlto, vystantis žiniasklaidai ir kuriantis įvairiems naujienų portalams, aktualu naujienas skirstyti ne rankiniu, o automatiniu būdu, todėl galimybė automatizuoti šį procesą galėtų būti naudinga įvairiems naujienų portalams, padedant skirstyti pranešimus ir taupant laiko bei energijos sąnaudas. Darbo objektą apima 2007 metų BNS spaudos centro žinutės. Darbo tikslas – išsiaiškinti, kaip atskiri žodžiai padeda nustatyti teksto temą. Temos nustatymui taikomi trys metodai: dažnų žodžių, dvižodžių junginių (bigramų) ir prasminių žodžių. Darbas susideda iš trijų dalių. Pirmoje dalyje buvo aptarti teoriniai pagrindai (temos nustatymas, tekstų klasifikavimas, žinių kalba). Apžvelgus žinučių ypatumus pastebėta, kad šis informacinis žanras iš kitų išsiskiria tekstų glaustumu, faktų konstatavimu. Taip pat daroma prielaida, kad temos nustatymo tikslumui yra svarbu žinutės apimtis ir aktualumas. Antroje dalyje aprašyti dažnų žodžių ir dvižodžių junginių sąrašų sudarymo bei prasminių žodžių ištraukimo būdai. Apžvelgus naujienų skirstymą pagal temas, buvo sudarytas temų sąrašas ir juo remiantis, buvo anotuoti dažnų žodžių ir... [toliau žr. visą tekstą]<br>The thesis is based on topic detection in BNS news reports. The reports are divided into different groups and sub-grouped according to topics. This topic analysis is manual; namely, reading texts and assigning to any topic. However, media and various news portals are developing very quickly, so the possibility to distribute reports automatically is quite relevant problem. The automated topic detection process would be useful for various news portals, automated distribution would save time and energy costs. Therefore, the task of the paper is topic detection issue, which is associated with the classification of text into certain categories, in other words, various text data is classified by subject. The object of the thesis is reports from BNS news agency received in 2007. The aim of the paper is to analyze how separate words help identify the topic. Three methods are applied to detect the topic: high frequency words, bigrams (two-word compounds) and the keywords. The paper consists of three parts. The first part is theoretical; it presents the bases of topic detection, text classification and report language. The report was chosen because this information genre is concise and clearly stating facts. What is more, it is hypothesized that the accuracy of topic detection depends on the size and relevance of the report. The second part describes the formation of frequent words’ and bigram lists and keyword extraction techniques. Those frequent word and bigram lists were... [to full text]
APA, Harvard, Vancouver, ISO, and other styles
9

Comez, Murat Ali. "Large Vocabulary Continuous Speech Recogniton For Turkish Using Htk." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1205491/index.pdf.

Full text
Abstract:
This study aims to build a new language model that can be used in a Turkish large vocabulary continuous speech recognition system. Turkish is a very productive language in terms of word forms because of its agglutinative nature. For such languages like Turkish, the vocabulary size is far from being acceptable. From only one simple stem, thousands of new word forms can be generated using inflectional or derivational suffixes. In this thesis, words are parsed into their stems and endings. One ending includes the suffixes attached to the associated root. Then the search network based on bigrams is constructed. Bigrams are obtained either using stem and endings, or using only stems. The language model proposed is based on bigrams obtained using only stems. All work is done in HTK (Hidden Markov Model Toolkit) environment, except parsing and network transforming. Besides of offering a new language model for Turkish, this study involves a comprehensive work about speech recognition inspecting into concepts in the state of the art speech recognition systems. To acquire good command of these concepts and processes in speech recognition isolated word, connected word and continuous speech recognition tasks are performed. The experimental results associated with these tasks are also given.
APA, Harvard, Vancouver, ISO, and other styles
10

Sahin, Serkan. "Language Modeling For Turkish Continuous Speech Recognition." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/2/1223254/index.pdf.

Full text
Abstract:
This study aims to build a new language model for Turkish continuous speech recognition. Turkish is very productive language in terms of word forms because of its agglutinative nature. For such languages like Turkish, the vocabulary size is far from being acceptable from only one simple stem, thousands of new words can be generated using inflectional and derivational suffixes. In this work, word are parsed into their stem and endings. First of all, we consider endings as words and we obtained bigram probabilities using stem and endings. Then, bigram probabilities are obtained using only the stems. Single pass recognition was performed by using bigram probabilities. As a second job, two pass recognition was performed. Firstly, previous bigram probabilities were used to create word lattices. Secondly, trigram probabilities were obtained from a larger text. Finally, one-best results were obtained by using word lattices and trigram probabilities. All work is done in Hidden Markov Model Toolkit (HTK) environment, except parsing and network transforming.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Bigraphs"

1

Kiselev, A. A. Dvadt︠s︡tʹ pi︠a︡tʹ istoricheskikh portretov dei︠a︡teleĭ XX veka na fone Kolʹskogo Severa: Ot imperatora Rossii Nikolai︠a︡ II do prezidenta SSSR, M.S. Gorbacheva. Murmanskiĭ gosudarstvennyĭ pedagogicheskiĭ universitet, 2011.

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

Mayer, Claude. Bigras: Louis Bigras et Rose de Lima Vanier. La Compagnie Jérémie, 1993.

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

Okan, Bekir. İş'te başarı: "Yaşadıklarım, gördüklerim, öğrendiklerim". Okan Üniversitesi Yayınları, 2020.

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

Acedo, Luis Negró. Écrivains espagnols exilés à Paris: (de 1939 à nos jours) : un chapitre bilingue de la culture française. L'Harmattan, 2015.

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

name, No. La rage de l'ange: Scénario et réalisation, Dan Bigras. Alliance Atlantis Vivafilm, 2006.

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

Khāna, Sulatāna-uja Jāmāna. Smr̥tira sātakāhana: Eka āmalāra ātmakathā. Sāhitya Prakāsá, 2007.

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

Geyer, Georgie Anne. Buying the night flight: The autobiography of a woman foreign correspondent. Transaction Publishers, 1998.

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

Buying the night flight: The autobiography of a woman foreign correspondent : with a new preface. University of Chicago Press, 2001.

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

Geyer, Georgie Anne. Buying the night flight: The autobiography of a woman foreign correspondent. Brassey's, 1996.

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

Bigras, Carl. Infrared imaging of Coleridge annotations for Victoria University Library, Toronto, Ontario / Carl Bigras. Canadian Conservation Institute, 2004.

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

Book chapters on the topic "Bigraphs"

1

Syropoulos, Apostolos. "Fuzzy Bigraphs." In Algebraic Techniques and Their Use in Describing and Processing Uncertainty. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-38565-1_13.

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

Archibald, Blair, Muffy Calder, and Michele Sevegnani. "Conditional Bigraphs." In Graph Transformation. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51372-6_1.

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

Sevegnani, Michele, and Muffy Calder. "BigraphER: Rewriting and Analysis Engine for Bigraphs." In Computer Aided Verification. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41540-6_27.

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

Das, Ashok Kumar, and Rajkamal Sahu. "Mixed Unit Interval Bigraphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74180-2_2.

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

Conforti, Giovanni, Damiano Macedonio, and Vladimiro Sassone. "Spatial Logics for Bigraphs." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_62.

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

Elsborg, Ebbe, Thomas T. Hildebrandt, and Davide Sangiorgi. "Type Systems for Bigraphs." In Trustworthy Global Computing. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00945-7_8.

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

Milner, Robin. "Bigraphs for Petri Nets." In Lectures on Concurrency and Petri Nets. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27755-2_19.

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

Das, Ashok Kumar, and Ritapa Chakraborty. "New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs." In Algorithms and Discrete Applied Mathematics. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-14974-5_12.

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

Groshaus, M., A. L. P. Guedes, and F. S. Kolberg. "On the Helly Subclasses of Interval Bigraphs and Circular Arc Bigraphs." In LATIN 2020: Theoretical Informatics. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-61792-9_50.

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

Chiapperini, Alessio, Marino Miculan, and Marco Peressotti. "Computing Embeddings of Directed Bigraphs." In Graph Transformation. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51372-6_3.

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

Conference papers on the topic "Bigraphs"

1

Kolberg, Fabricio Schiavon, Marina Groshaus, André Luiz Pires Guedes, and Renato Carmo. "Results on Circular-Arc Bigraphs." In I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9846.

Full text
Abstract:
We present a series of results related to the structural properties of the bipartite graph class known as circular-arc bigraphs. We also propose the definition of a Helly circular-arc bigraph subclass, based on a concept known as bipartite-Helly, along with a few results related to its structural properties.&#x0D;
APA, Harvard, Vancouver, ISO, and other styles
2

Jensen, Ole Høgh, and Robin Milner. "Bigraphs and transitions." In the 30th ACM SIGPLAN-SIGACT symposium. ACM Press, 2003. http://dx.doi.org/10.1145/604131.604135.

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

Goldsmith, Michael, and Sadie Creese. "Refinement-Friendly Bigraphs and Spygraphs." In 2010 8th IEEE International Conference on Software Engineering and Formal Methods (SEFM). IEEE, 2010. http://dx.doi.org/10.1109/sefm.2010.25.

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

Perrone, Gian, Søren Debois, and Thomas T. Hildebrandt. "A model checker for Bigraphs." In the 27th Annual ACM Symposium. ACM Press, 2012. http://dx.doi.org/10.1145/2245276.2231985.

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

Xu, Dong, and Qing-Quan Shi. "An Operable Matching Algorithm for Bigraphs." In 2016 3rd International Conference on Information Science and Control Engineering (ICISCE). IEEE, 2016. http://dx.doi.org/10.1109/icisce.2016.54.

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

Bundgaard, Mikkel, and Vladimiro Sassone. "Typed polyadic pi-calculus in bigraphs." In the 8th ACM SIGPLAN symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1140335.1140336.

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

Yu, Lian, Wei-Tek Tsai, Chenjian Hu, Baijie Li, Jianbin Hu, and Enyan Deng. "Modeling Context-aware Legal Computing with Bigraphs." In 2017 IEEE Symposium on Service-Oriented System Engineering (SOSE). IEEE, 2017. http://dx.doi.org/10.1109/sose.2017.31.

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

Blackwell, Clive. "Formally modeling the electricity grid with bigraphs." In the Seventh Annual Workshop. ACM Press, 2011. http://dx.doi.org/10.1145/2179298.2179323.

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

Gassara, Amal, Ismael Bouassida, and Mohamed Jmaiel. "A tool for modeling SoS architectures using bigraphs." In SAC 2017: Symposium on Applied Computing. ACM, 2017. http://dx.doi.org/10.1145/3019612.3019802.

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

Burnwal, Shantanu Prasad, and Mathukumalli Vidyasagar. "Exact Completion of Rectangular Matrices Using Ramanujan Bigraphs." In 2020 American Control Conference (ACC). IEEE, 2020. http://dx.doi.org/10.23919/acc45564.2020.9147379.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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