subject:(Message Passing model)

Rice University

1. Xue, Bing. Distributed Communication Middleware for an Selector Model.

Degree: MS, Engineering, 2017, Rice University

URL: http://hdl.handle.net/1911/105507

► The problem sizes that the community is dealing with today in both scientific re- search and day-to-day use computing exceed the capacity of modern shared-memory… (more)

Subjects/Keywords: selector model; actor model; distributed; mobile platform; message passing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xue, B. (2017). Distributed Communication Middleware for an Selector Model. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105507

Chicago Manual of Style (16^th Edition):

Xue, Bing. “Distributed Communication Middleware for an Selector Model.” 2017. Masters Thesis, Rice University. Accessed January 22, 2021. http://hdl.handle.net/1911/105507.

MLA Handbook (7^th Edition):

Xue, Bing. “Distributed Communication Middleware for an Selector Model.” 2017. Web. 22 Jan 2021.

Vancouver:

Xue B. Distributed Communication Middleware for an Selector Model. [Internet] [Masters thesis]. Rice University; 2017. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1911/105507.

Council of Science Editors:

Xue B. Distributed Communication Middleware for an Selector Model. [Masters Thesis]. Rice University; 2017. Available from: http://hdl.handle.net/1911/105507

Brigham Young University

2. Huang, Yu. An Analyzer for Message Passing Programs.

Degree: PhD, 2016, Brigham Young University

URL: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6864&context=etd

► Asynchronous message passing systems are fast becoming a common means for communication between devices. Two problems existing in message passing programs are difficult to solve.… (more)

▼ Asynchronous message passing systems are fast becoming a common means for communication between devices. Two problems existing in message passing programs are difficult to solve. The first problem, intended or otherwise, is message-race where a receive may match with more than one send in the runtime system. This non-determinism often leads to intermittent and unexpected behavior depending on the resolution of the race. Another problem is deadlock, which is a situation in that each member process of the group is waiting for some member process to communicate with it, but no member is attempting to communicate with it. Detecting if message-race and/or deadlocks exist in a message passing program are both NP-complete. The difficulty of solving the two problems also comes from three factors that complicate the semantics: asynchronous communication, synchronous barrier, and buffering settings including infinite buffering (the system can buffer messages) and zero buffering (the system has no internal buffering). To solve the above problems with complicating factors, this research provides a novel predictive analysis that initializes a concrete execution and then predicts the behavior of other executions that arise from the initial execution. This research starts with Satisfiability Modulo Theories (SMT) based model checking that provides precise analysis for the program behavior. Unfortunately, a precise analysis using SMT does not scale to large programs. As such, the SMT based model checking is combined with heuristic search for witnessing program properties. The heuristic search is efficient in identifying how sends may match with receives in the runtime as it only looks for the match relations for sends and receives in a small searching space initially; the space is increased only if the program property is not witnessed, until all possible match relations for sends and receives reflected in message non-determinism are found. This research also gives a static analysis approach that is scalable as it does not need to analyze the full set of program behaviors; rather, the static analysis only uses polynomial-time algorithms to identify all potential deadlocks in a send-receive templates given a set of pre-defined deadlock patterns. Given the predictive analysis consisting of SMT based model checking with heuristic search and static analysis, this research is able to solve the two problems above. The work in this dissertation also demonstrates that the predictive analysis is more efficient than the existing tools for verifying message passing programs.

Subjects/Keywords: Message passing; MPI; MCAPI; SMT; Static analysis; Model checking; Computer Sciences

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Huang, Y. (2016). An Analyzer for Message Passing Programs. (Doctoral Dissertation). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6864&context=etd

Chicago Manual of Style (16^th Edition):

Huang, Yu. “An Analyzer for Message Passing Programs.” 2016. Doctoral Dissertation, Brigham Young University. Accessed January 22, 2021. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6864&context=etd.

MLA Handbook (7^th Edition):

Huang, Yu. “An Analyzer for Message Passing Programs.” 2016. Web. 22 Jan 2021.

Vancouver:

Huang Y. An Analyzer for Message Passing Programs. [Internet] [Doctoral dissertation]. Brigham Young University; 2016. [cited 2021 Jan 22]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6864&context=etd.

Council of Science Editors:

Huang Y. An Analyzer for Message Passing Programs. [Doctoral Dissertation]. Brigham Young University; 2016. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=6864&context=etd

University of Illinois – Urbana-Champaign

3. Kale, Vivek. Load Balancing Regular Meshes on SMPS with MPI.

Degree: MS, 0112, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/18248

► Domain decomposition for regular meshes on parallel computers has traditionally been performed by attempting to exactly partition the work among the available processors (now cores).… (more)

Subjects/Keywords: Regular Meshes; Scientific Computing; Message-Passing Interface (MPI); Performance Tuning; Hybrid MPI-pthreads model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kale, V. (2011). Load Balancing Regular Meshes on SMPS with MPI. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/18248

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kale, Vivek. “Load Balancing Regular Meshes on SMPS with MPI.” 2011. Thesis, University of Illinois – Urbana-Champaign. Accessed January 22, 2021. http://hdl.handle.net/2142/18248.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kale, Vivek. “Load Balancing Regular Meshes on SMPS with MPI.” 2011. Web. 22 Jan 2021.

Vancouver:

Kale V. Load Balancing Regular Meshes on SMPS with MPI. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2142/18248.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kale V. Load Balancing Regular Meshes on SMPS with MPI. [Thesis]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/18248

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

4. Wang, Chang-jen. Study on Multiuser Detection for Massive MIMO with Low-Precision Analog to Digital Converters.

Degree: Master, Communications Engineering, 2015, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620115-130201

► In recent year, communication systems are required to be able to serve explosive growth of the large number of data sent by users. Massive multi-input… (more)

Subjects/Keywords: linear minimize mean square error detector; addition quantize noise model; message-passing de-quantization detector; generalized approximated message passing; low resolution analog-to-digital converter; massive MIMO

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, C. (2015). Study on Multiuser Detection for Massive MIMO with Low-Precision Analog to Digital Converters. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620115-130201

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wang, Chang-jen. “Study on Multiuser Detection for Massive MIMO with Low-Precision Analog to Digital Converters.” 2015. Thesis, NSYSU. Accessed January 22, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620115-130201.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wang, Chang-jen. “Study on Multiuser Detection for Massive MIMO with Low-Precision Analog to Digital Converters.” 2015. Web. 22 Jan 2021.

Vancouver:

Wang C. Study on Multiuser Detection for Massive MIMO with Low-Precision Analog to Digital Converters. [Internet] [Thesis]. NSYSU; 2015. [cited 2021 Jan 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620115-130201.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang C. Study on Multiuser Detection for Massive MIMO with Low-Precision Analog to Digital Converters. [Thesis]. NSYSU; 2015. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0620115-130201

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Université de Grenoble

5. Sabah, Quentin. Siaam : Simple Isolation for an Actor-based Abstract Machine : Isolation dynamique pour une machine abstraite à base d'acteurs.

Degree: Docteur es, Informatique, 2013, Université de Grenoble

URL: http://www.theses.fr/2013GRENM082

►

Dans cette thèse nous étudions l’isolation mémoire et les mesures de communications efficaces par passage de message dans le contexte des environnements à mémoire partagée… (more)

▼

Dans cette thèse nous étudions l’isolation mémoire et les mesures de communications efficaces par passage de message dans le contexte des environnements à mémoire partagée et la programmation orientée-objets. L’état de l’art en la matière se base presque exclusivement sur deux techniques complémentaires dites de propriété des objets (ownership) et d’unicité de références (reference uniqueness) afin d’adresser les problèmes de sécurité dans les programmes concurrents. Il est frappant de constater que la grande majorité des travaux existants emploient des méthodes de vérification statique des programmes, qui requirent soit un effort d’annotations soit l’introduction de fortes contraintes sur la forme et les références vers messages échangés. Notre contribution avec SIAAM est la démonstration d’une solution d’isolation réalisée uniquement à l’exécution et basée sur le modèle de programmation par acteurs. Cette solution purement dynamique ne nécessite ni annotations ni vérification statique des programmes. SIAAM permet la communication sans copie de messages de forme arbitraire. Nous présentons la sémantique formelle de SIAAM ainsi qu’une preuve d’isolation vérifiée avec l’assistant COQ. L’implantation du modèle de programmation pour le langage Java est réalisé dans la machine virtuelle JikesRVM. Enfin nous décrivons un ensemble d’analyses statiques qui réduit automatiquement le cout à l’exécution de notre approche.

In this thesis we study state isolation and efficient message-passing in the context of concurrent object-oriented programming. The ’ownership’ and ’reference uniqueness’ techniques have been extensively employed to address concurrency safety in the past. Strikingly the vast majority of the previous works rely on a set of statically checkable typing rules, either requiring an annotation overhead or introducing strong restrictions on the shape and the aliasing of the exchanged messages.Our contribution with SIAAM is the demonstration of a purely runtime, actor-based, annotation-free, aliasing-proof approach to concurrent state isolation allowing efficient communication of arbitrary objects graphs. We present the formal semantic of SIAAM, along with a machine-checked proof of isolation. An implementation of the model has been realized in a state-of-the-art Java virtual-machine and a set of custom static analyses automatically reduce the runtime overhead.

Advisors/Committee Members: Stefani, Jean-Bernard (thesis director).

Subjects/Keywords: Acteurs; Isolation; Ownership; Concurrence; Modele de programmation; Passage de messages; Actors; Isolation; Ownership; Concurrency; Programming model; Message passing; 004

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sabah, Q. (2013). Siaam : Simple Isolation for an Actor-based Abstract Machine : Isolation dynamique pour une machine abstraite à base d'acteurs. (Doctoral Dissertation). Université de Grenoble. Retrieved from http://www.theses.fr/2013GRENM082

Chicago Manual of Style (16^th Edition):

Sabah, Quentin. “Siaam : Simple Isolation for an Actor-based Abstract Machine : Isolation dynamique pour une machine abstraite à base d'acteurs.” 2013. Doctoral Dissertation, Université de Grenoble. Accessed January 22, 2021. http://www.theses.fr/2013GRENM082.

MLA Handbook (7^th Edition):

Sabah, Quentin. “Siaam : Simple Isolation for an Actor-based Abstract Machine : Isolation dynamique pour une machine abstraite à base d'acteurs.” 2013. Web. 22 Jan 2021.

Vancouver:

Sabah Q. Siaam : Simple Isolation for an Actor-based Abstract Machine : Isolation dynamique pour une machine abstraite à base d'acteurs. [Internet] [Doctoral dissertation]. Université de Grenoble; 2013. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2013GRENM082.

Council of Science Editors:

Sabah Q. Siaam : Simple Isolation for an Actor-based Abstract Machine : Isolation dynamique pour une machine abstraite à base d'acteurs. [Doctoral Dissertation]. Université de Grenoble; 2013. Available from: http://www.theses.fr/2013GRENM082

6. Allam, Diana. Loose coupling and substitution principle in objet-oriented frameworks for web services : Couplage faible et principe de substitution dans les environnements à objets pour les services web.

Degree: Docteur es, Informatique et applications, 2014, Nantes, Ecole des Mines

URL: http://www.theses.fr/2014EMNA0115

►

Actuellement, l’implémentation des services (modèles SOAP et RESTful) et de leurs applications clientes est de plus en plus basée sur la programmation par objet. Ainsi,… (more)

▼

Actuellement, l’implémentation des services (modèles SOAP et RESTful) et de leurs applications clientes est de plus en plus basée sur la programmation par objet. Ainsi, les cadriciels orientés-objets pour les services Web sont essentiellement composés de deux couches : une couche à objets qui enveloppe une couche à services. Dans ce contexte, deux principes sont nécessaires pour la spécification de ces cadriciels : (i) En premier lieu, un couplage faible entre les deux couches, ce qui permet de cacher la complexité des détails techniques de la couche à services dans la couche à objets et de faire évoluer la couche à services avec un impact minimal sur la couche à objets (ii) En second lieu, une interopérabilité induite par le principe de substitution associée au sous-typage dans la couche à objets. Dans cette thèse, nous présentons d’abord les faiblesses existantes dans les cadriciels orientés-objets liés à ces deux principes. Ensuite, nous proposons une nouvelle spécification pour ces cadriciels en vue de résoudre ces problèmes. Comme application, nous décrivons la mise en œuvre de notre spécification dans le cadriciel cxf, à la fois pour SOAP et RESTful.

Today, the implementation of services (SOAP and RESTful models) and of client applications is increasingly based on object-oriented programming languages. Thus, object-oriented frameworks for Web services are essentially composed with two levels: an object level built over a service level. In this context, two properties could be particularly required in the specification of these frameworks: (i)First a loose coupling between the two levels, which allows the complex technical details of the service level to be hidden at the object level and the service level to be evolved with a minimal impact on the object level, (ii) Second, an interoperability induced by the substitution principle associated to subtyping in the object level, which allows to freely convert a value of a subtype into a supertype. In this thesis, first we present the existing weaknesses of object-oriented frameworks related to these two requirements. Then, we propose a new specification for object-oriented Web service frameworks in order to resolve these problems. As an application, we provide an implementation of our specification in the cxf framework, for both SOAP and RESTful models.

Advisors/Committee Members: Royer, Jean-Claude (thesis director).

Subjects/Keywords: Architecture Orientée-Services; Programmation par objet; Interopérabilité; Couplage faible; Sous-typage; Modèle de passation de messages; Service-Oriented architecture; Object-Oriented programming; Interoperability; Loose coupling; Subtyping; Message-Passing model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Allam, D. (2014). Loose coupling and substitution principle in objet-oriented frameworks for web services : Couplage faible et principe de substitution dans les environnements à objets pour les services web. (Doctoral Dissertation). Nantes, Ecole des Mines. Retrieved from http://www.theses.fr/2014EMNA0115

Chicago Manual of Style (16^th Edition):

Allam, Diana. “Loose coupling and substitution principle in objet-oriented frameworks for web services : Couplage faible et principe de substitution dans les environnements à objets pour les services web.” 2014. Doctoral Dissertation, Nantes, Ecole des Mines. Accessed January 22, 2021. http://www.theses.fr/2014EMNA0115.

MLA Handbook (7^th Edition):

Allam, Diana. “Loose coupling and substitution principle in objet-oriented frameworks for web services : Couplage faible et principe de substitution dans les environnements à objets pour les services web.” 2014. Web. 22 Jan 2021.

Vancouver:

Allam D. Loose coupling and substitution principle in objet-oriented frameworks for web services : Couplage faible et principe de substitution dans les environnements à objets pour les services web. [Internet] [Doctoral dissertation]. Nantes, Ecole des Mines; 2014. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2014EMNA0115.

Council of Science Editors:

Allam D. Loose coupling and substitution principle in objet-oriented frameworks for web services : Couplage faible et principe de substitution dans les environnements à objets pour les services web. [Doctoral Dissertation]. Nantes, Ecole des Mines; 2014. Available from: http://www.theses.fr/2014EMNA0115

7. Lauterburg, Steven T. Systematic testing for actor programs.

Degree: PhD, 0112, 2011, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/26314

► The growing use of multicore and networked computing systems is increasing the importance of developing reliable parallel and distributed code. Testing such code is notoriously… (more)

▼ The growing use of multicore and networked computing systems is increasing the importance of developing reliable parallel and distributed code. Testing such code is notoriously difficult, especially for shared-memory models of programming. The actor model of programming offers a promising alternative for developing concurrent systems based on message passing. In actor-based systems, shared-memory access is not allowed, and the key source of non-determinism is the order in which messages are delivered to and processed by the actors. As a result, errors may occur in actor programs due to the incorrect interleaving of messages, conflicting constraints on what messages can be delivered, or errors in the sequential code within individual actors. The research community has expended a great deal of effort on the testing and verification of concurrent systems. However, much of this effort has been general in nature or focused on shared-memory models. Given the differences in how errors manifest in actor programs, it seems natural that tools and techniques for testing such programs should take into account the particular nature of the actor model. To effectively and efficiently automate the detection of these errors, we propose a set of tools and techniques specifically designed to systematically explore the different behaviors of actor programs resulting from possible message delivery schedules. Specifically, this dissertation presents Basset, a general framework for the systematic testing of actor systems developed with languages that compile to Java bytecode. This framework provides a common set of capabilities designed and implemented to take advantage of actor semantics. By building these capabilities into a language-independent core, they are available for use by any instantiation of the framework. This dissertation illustrates the practicality and effectiveness of this approach by presenting two tool instantiations of the Basset framework: one for the Scala programming language and the other for the ActorFoundry library for Java. The implementation of Basset was built as an extension to Java PathFinder, a popular model checker for Java, in order to leverage capabilities that already exist in that model checker. The Basset framework approach directly enables the relatively quick development of testing environments for actor-based languages and/or libraries that compile to Java bytecode. This dissertation also considers the effectiveness of dynamic partial-order reduction techniques as they relate to the exploration of actor programs. The use of dynamic partial-order reduction speeds up systematic testing by pruning parts of the exploration space. However, the level of potential pruning is highly dependent on the order in which messages are considered for processing. This dissertation presents an evaluation of a number of heuristics for choosing the order in which messages are explored in Basset. The experiments show that the choice of heuristic can affect the number of execution paths that need to be explored by… Advisors/Committee Members: Marinov, Darko (advisor), Marinov, Darko (Committee Chair), Agha, Gul A. (committee member), Viswanathan, Mahesh (committee member), Johnson, Ralph E. (committee member).

Subjects/Keywords: systematic testing; concurrency; actor model; message passing; partial-order reduction; model checking

…actor model provides message passing with object-style data encapsulation [Agh86, AMST97… …associated with message passing in actors. In other words, we can model the delivery order… …parallel and distributed code is message passing, where multiple autonomous agents communicate by… …better pruning in DPOR for message-passing systems. We consider the following questions… …scheduling decisions in DPOR for message-passing systems? • What is the impact of choosing one…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lauterburg, S. T. (2011). Systematic testing for actor programs. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/26314

Chicago Manual of Style (16^th Edition):

Lauterburg, Steven T. “Systematic testing for actor programs.” 2011. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 22, 2021. http://hdl.handle.net/2142/26314.

MLA Handbook (7^th Edition):

Lauterburg, Steven T. “Systematic testing for actor programs.” 2011. Web. 22 Jan 2021.

Vancouver:

Lauterburg ST. Systematic testing for actor programs. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2011. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2142/26314.

Council of Science Editors:

Lauterburg ST. Systematic testing for actor programs. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2011. Available from: http://hdl.handle.net/2142/26314

University of Waterloo

8. Ye, Isaac Keeheon. Investigation of the scalar variance and scalar dissipation rate in URANS and LES.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/5801

► Large-eddy simulation (LES) and unsteady Reynolds-averaged Navier-Stokes (URANS) calculations have been performed to investigate the effects of different mathematical models for scalar variance and its… (more)

Subjects/Keywords: Large Eddy Simulation; Scalar variance; Unsteady Reynolds-Averaged Simulation; Scalar dissipation rate; Turbulent channel flow; Parallel computing; Combustion; Bluff-body turbulent flow; Message Passing Interface; Finite Volume Method; Laminar flamelet model; Chemical equilibrium model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ye, I. K. (2011). Investigation of the scalar variance and scalar dissipation rate in URANS and LES. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5801

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ye, Isaac Keeheon. “Investigation of the scalar variance and scalar dissipation rate in URANS and LES.” 2011. Thesis, University of Waterloo. Accessed January 22, 2021. http://hdl.handle.net/10012/5801.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ye, Isaac Keeheon. “Investigation of the scalar variance and scalar dissipation rate in URANS and LES.” 2011. Web. 22 Jan 2021.

Vancouver:

Ye IK. Investigation of the scalar variance and scalar dissipation rate in URANS and LES. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10012/5801.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ye IK. Investigation of the scalar variance and scalar dissipation rate in URANS and LES. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5801

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

9. Sonoda, Eloiza Helena. Paralelização de um programa para cálculo de propriedades físicas de impurezas magnéticas em metais.

Degree: Mestrado, Física Aplicada, 2001, University of São Paulo

URL: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-19102001-135247/ ;

►

Este trabalho se dedica à paralelização de um programa para cálculos de propriedades físicas de ligas magnéticas diluídas. O método do grupo de renormalização aplicado… (more)

▼

Este trabalho se dedica à paralelização de um programa para cálculos de propriedades físicas de ligas magnéticas diluídas. O método do grupo de renormalização aplicado ao modelo de Anderson de duas impurezas se mostrou particularmente adequado ao processamento paralelo visto que grande parte dos cálculos pode ser executada simultaneamente, assim como variações nos conjuntos de dados requeridas pelo método. Para tal reescrevemos o programa seqüencial usado anteriormente pelo Grupo de Física Teórica do IFSC e implementamos três versões paralelas. Essas versões diferem entre si em relação à abordagem dada à paralelização. O uso de clusters de computadores se revelou uma opção conveniente pois verificamos que o limitante no desempenho é o tempo tomado pelos cálculos e não pela comunicação. Os resultados mostram uma grande redução no tempo total de execução, porém deficiências no speedup e escalabilidade devido a problemas de balanceamento de carga. Analisamos esses problemas e sugerimos alternativas para solucioná-los.

This dissertation discuss the parallelization of a program that calculates physical properties of dilute magnetic alloys. The renormalization group method applied to Anderson's two impurities model showed to be specially suitable to parallel processing because a large amount of calculations as well as variations of data entries required by the method can be performed simultaneously. To achieve this we rewrote the sequential program previously used by the Theoretical Physics Group of the IFSC and wrote three parallel versions. These versions differ from each other by the parallelization approach. The use of computer clusters revealed to be an appropriate option because the calculation time is the limiting factor on performance instead of communication time. The results show a good reduction of execution time, but speedup and scalability lack due to load balancing problems. We analyze these problems and suggest possible solutions.

Advisors/Committee Members: Travieso, Gonzalo.

Subjects/Keywords: Anderson model; grupo de renormalização; message passing; modelo de Anderson; parallel processing; passagem de mensagens; processamento paralelo; renormalization group

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sonoda, E. H. (2001). Paralelização de um programa para cálculo de propriedades físicas de impurezas magnéticas em metais. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/76/76132/tde-19102001-135247/ ;

Chicago Manual of Style (16^th Edition):

Sonoda, Eloiza Helena. “Paralelização de um programa para cálculo de propriedades físicas de impurezas magnéticas em metais.” 2001. Masters Thesis, University of São Paulo. Accessed January 22, 2021. http://www.teses.usp.br/teses/disponiveis/76/76132/tde-19102001-135247/ ;.

MLA Handbook (7^th Edition):

Sonoda, Eloiza Helena. “Paralelização de um programa para cálculo de propriedades físicas de impurezas magnéticas em metais.” 2001. Web. 22 Jan 2021.

Vancouver:

Sonoda EH. Paralelização de um programa para cálculo de propriedades físicas de impurezas magnéticas em metais. [Internet] [Masters thesis]. University of São Paulo; 2001. [cited 2021 Jan 22]. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-19102001-135247/ ;.

Council of Science Editors:

Sonoda EH. Paralelização de um programa para cálculo de propriedades físicas de impurezas magnéticas em metais. [Masters Thesis]. University of São Paulo; 2001. Available from: http://www.teses.usp.br/teses/disponiveis/76/76132/tde-19102001-135247/ ;

Brno University of Technology

10. Šimeček, Josef. Inference v Bayesovských sítích: Inference in Bayesian Networks.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/53484

► This master's thesis deals with demonstration of various approaches to probabilistic inference in Bayesian networks. Basics of probability theory, introduction to Bayesian networks, methods for… (more)

Subjects/Keywords: Bayesovské sítě; pravděpodobnostní inference; exaktní inference; Kimův a Pearlův algoritmus posílání zpráv; transformace na rozložitelný model; logické vzorkování; věrohodnostní váhování; Gibbsovo vzorkování; Bayesian networks; probabilistic inference; exact inference; Kim and Pearl's message passing algorithm; junction tree algorithm; logic sampling; likelihood weighting; Gibbs sampling

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Šimeček, J. (2018). Inference v Bayesovských sítích: Inference in Bayesian Networks. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53484

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Šimeček, Josef. “Inference v Bayesovských sítích: Inference in Bayesian Networks.” 2018. Thesis, Brno University of Technology. Accessed January 22, 2021. http://hdl.handle.net/11012/53484.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Šimeček, Josef. “Inference v Bayesovských sítích: Inference in Bayesian Networks.” 2018. Web. 22 Jan 2021.

Vancouver:

Šimeček J. Inference v Bayesovských sítích: Inference in Bayesian Networks. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/11012/53484.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Šimeček J. Inference v Bayesovských sítích: Inference in Bayesian Networks. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53484

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

11. Kochems, Jonathan Antonius. Verification of asynchronous concurrency and the shaped stack constraint.

Degree: PhD, 2014, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795

► In this dissertation, we study the verification of concurrent programs written in the programming language Erlang using infinite-state model-checking. Erlang is a widely used, higher… (more)

▼ In this dissertation, we study the verification of concurrent programs written in the programming language Erlang using infinite-state model-checking. Erlang is a widely used, higher order, dynamically typed, call-by-value functional language with algebraic data types and pattern-matching. It is further augmented with support for actor concurrency, i.e. asynchronous message passing and dynamic process creation. With decidable model-checking in mind, we identify actor communicating systems (ACS) as a suitable target model for an abstract interpretation of Erlang. ACS model a dynamic network of finite-state processes that communicate over a fixed, finite number of unordered, unbounded channels. Thanks to being equivalent to Petri nets, ACS enjoy good algorithmic properties. We develop a verification procedure that extracts a sound abstract model, in the form of an ACS, from a given Erlang program; the resulting ACS simulates the operational semantics of the input. Using this abstract model, we can conservatively verify coverability properties of the input program, i.e. a weak form of safety properties, with a Petri net model-checker. We have implemented this procedure in our tool Soter, which is the first sound verification tool for Erlang programs using infinite-state model-checking. In our experiments, we find that Soter is accurate enough to verify a range of interesting and non-trivial benchmarks. Even though ACS coverability is Expspace-complete, Soter's analysis of these verification problems is surprisingly quick. In order to improve the precision of our verification procedure with respect to recursion, we investigate an extension of ACS that allows pushdown processes: asynchronously communicating pushdown systems (ACPS). ACPS that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular subclass of ACPS with good decision and complexity properties. In the context of Erlang, the empty stack constraint is unfortunately not realistic. We introduce a relaxation of the empty-stack constraint for ACPS called the shaped stack constraint. Stacks that fit the shape constraint may reach arbitrary heights. Further, a process may execute any communication action (be it process creation, message send or retrieval) whether or not its stack is empty. We prove that coverability for shaped ACPS, i.e. ACPS that satisfy the shaped constraint, reduces to the decidable coverability problem for well-structured transition systems (WSTS). Thus, shaped ACPS enable the modelling and verification of a larger class of message passing programs. We establish a close connection between shaped ACPS and a novel extension of Petri nets: nets with nested coloured tokens (NNCT). Tokens in NNCT are of two types: simple and complex. Complex tokens carry an arbitrary number of coloured tokens. The rules of a NNCT can synchronise complex and simple tokens, inject coloured tokens into a complex token, and eject all tokens of a specified set of active colours to predefined places. We show that the…

Subjects/Keywords: 005.1; Computer science (mathematics); Computing; Theory and automated verification; Applications and algorithms; Concurrent Pushdown Systems; Asynchronous Message Passing; Verification; Infinite-State Model-Checking; Petri Nets; Well-Structured Transition Systems; Erlang; Infinite-State Systems Verification

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kochems, J. A. (2014). Verification of asynchronous concurrency and the shaped stack constraint. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795

Chicago Manual of Style (16^th Edition):

Kochems, Jonathan Antonius. “Verification of asynchronous concurrency and the shaped stack constraint.” 2014. Doctoral Dissertation, University of Oxford. Accessed January 22, 2021. http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795.

MLA Handbook (7^th Edition):

Kochems, Jonathan Antonius. “Verification of asynchronous concurrency and the shaped stack constraint.” 2014. Web. 22 Jan 2021.

Vancouver:

Kochems JA. Verification of asynchronous concurrency and the shaped stack constraint. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2021 Jan 22]. Available from: http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795.

Council of Science Editors:

Kochems JA. Verification of asynchronous concurrency and the shaped stack constraint. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:cd487639-0e7f-4248-9405-e05e8a8383d5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.664795

12. Kim, Jong-Hoon. Compressed sensing and finite rate of innovation for efficient data acquisition of quantitative acoustic microscopy images : Echantillonnage compressé et technique dite "finite rate of innovation" pour l'acquisition efficace d'images de microscopie acoustique.

Degree: Docteur es, Signal, Image, Acoustique et Optimisation, 2019, Université Toulouse III – Paul Sabatier

URL: http://www.theses.fr/2019TOU30225

►

La microscopie acoustique quantitative (MAQ) est une modalité d'imagerie bien établie qui donne accès à des cartes paramétriques 2D représentatives des propriétés mécaniques des tissus… (more)

▼

La microscopie acoustique quantitative (MAQ) est une modalité d'imagerie bien établie qui donne accès à des cartes paramétriques 2D représentatives des propriétés mécaniques des tissus à une échelle microscopique. Dans la plupart des études sur MAQ, l'échantillons est scanné ligne par ligne (avec un pas de 2µm) à l'aide d'un transducteur à 250 MHz. Ce type d'acquisition permet d'obtenir un cube de données RF 3D, avec deux dimensions spatiales et une dimension temporelle. Chaque signal RF correspondant à une position spatiale dans l'échantillon permet d'estimer des paramètres acoustiques comme par exemple la vitesse du son ou l'impédance. Le temps d'acquisition en MAQ est directement proportionnel à la taille de l'échantillon et peut aller de quelques minutes à quelques dizaines de minutes. Afin d'assurer des conditions d'acquisition stables et étant donnée la sensibilité des échantillons à ces conditions, diminuer le temps d'acquisition est un des grand défis en MAQ. Afin de relever ce défi, ce travail de thèse propose plusieurs solutions basées sur l'échantillonnage compressé (EC) et la théories des signaux ayant un faible nombre de degré de liberté (finite rate of innovation - FRI, en anglais). Le principe de l'EC repose sur la parcimonie des données, sur l'échantillonnage incohérent de celles-ci et sur les algorithmes d'optimisation numérique. Dans cette thèse, les phénomènes physiques derrière la MAQ sont exploités afin de créer des modèles adaptés aux contraintes de l'EC et de la FRI. Plus particulièrement, ce travail propose plusieurs pistes d'application de l'EC en MAQ : un schéma d'acquisition spatiale innovant, un algorithme de reconstruction d'images exploitant les statistiques des coefficients en ondelettes des images paramétriques, un modèle FRI adapté aux signaux RF et un schéma d'acquisition compressée dans le domaine temporel.

Quantitative acoustic microscopy (QAM) is a well-accepted modality for forming 2D parameter maps making use of mechanical properties of soft tissues at microscopic scales. In leading edge QAM studies, the sample is raster-scanned (spatial step size of 2µm) using a 250 MHz transducer resulting in a 3D RF data cube, and each RF signal for each spatial location is processed to obtain acoustic parameters, e.g., speed of sound or acoustic impedance. The scanning time directly depends on the sample size and can range from few minutes to tens of minutes. In order to maintain constant experimental conditions for the sensitive thin sectioned samples, the scanning time is an important practical issue. To deal with the current challenge, we propose the novel approach inspired by compressed sensing (CS) and finite rate of innovation (FRI). The success of CS relies on the sparsity of data under consideration, incoherent measurement and optimization technique. On the other hand, the idea behind FRI is supported by a signal model fully characterized as a limited number of parameters. From this perspective, taking into account the physics leading to data acquisition of QAM system, the QAM…

Advisors/Committee Members: Basarab, Adrian (thesis director), Kouamé, Denis (thesis director).

Subjects/Keywords: Microscopie acoustique; Echantillonnage compressé; Parcimonie; Mesures incohérentes; Débruitage; Modèle paramétrique; Modèle AR; Quantitative acoustic microscopy; Compressed sensing; Sparsity; Incoherent measurement; Approximate message passing; Cauchy denoiser; Finite rate of innovation; Autoregressive model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kim, J. (2019). Compressed sensing and finite rate of innovation for efficient data acquisition of quantitative acoustic microscopy images : Echantillonnage compressé et technique dite "finite rate of innovation" pour l'acquisition efficace d'images de microscopie acoustique. (Doctoral Dissertation). Université Toulouse III – Paul Sabatier. Retrieved from http://www.theses.fr/2019TOU30225

Chicago Manual of Style (16^th Edition):

Kim, Jong-Hoon. “Compressed sensing and finite rate of innovation for efficient data acquisition of quantitative acoustic microscopy images : Echantillonnage compressé et technique dite "finite rate of innovation" pour l'acquisition efficace d'images de microscopie acoustique.” 2019. Doctoral Dissertation, Université Toulouse III – Paul Sabatier. Accessed January 22, 2021. http://www.theses.fr/2019TOU30225.

MLA Handbook (7^th Edition):

Kim, Jong-Hoon. “Compressed sensing and finite rate of innovation for efficient data acquisition of quantitative acoustic microscopy images : Echantillonnage compressé et technique dite "finite rate of innovation" pour l'acquisition efficace d'images de microscopie acoustique.” 2019. Web. 22 Jan 2021.

Vancouver:

Kim J. Compressed sensing and finite rate of innovation for efficient data acquisition of quantitative acoustic microscopy images : Echantillonnage compressé et technique dite "finite rate of innovation" pour l'acquisition efficace d'images de microscopie acoustique. [Internet] [Doctoral dissertation]. Université Toulouse III – Paul Sabatier; 2019. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2019TOU30225.

Council of Science Editors:

Kim J. Compressed sensing and finite rate of innovation for efficient data acquisition of quantitative acoustic microscopy images : Echantillonnage compressé et technique dite "finite rate of innovation" pour l'acquisition efficace d'images de microscopie acoustique. [Doctoral Dissertation]. Université Toulouse III – Paul Sabatier; 2019. Available from: http://www.theses.fr/2019TOU30225

University of Illinois – Urbana-Champaign

13. Guan, Jian. Multi-solver schemes for electromagnetic modeling of large and complex objects.

Degree: PhD, Electrical & Computer Engr, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/98097

► The work in this dissertation primarily focuses on the development of numerical algorithms for electromagnetic modeling of large and complex objects. First, a GPU-accelerated multilevel… (more)

▼ The work in this dissertation primarily focuses on the development of numerical algorithms for electromagnetic modeling of large and complex objects. First, a GPU-accelerated multilevel fast multipole algorithm (MLFMA) is presented to improve the efficiency of the traditional MLFMA by taking advantage of GPU hardware advancement. The proposed hierarchical parallelization strategy ensures a high computational throughput for the GPU calculation. The resulting OpenMP-based multi-GPU implementation is capable of solving real-life problems with over one million unknowns with a remarkable speedup. The radar cross sections (RCS) of a few benchmark objects are calculated to demonstrate the accuracy of the solution. The results are compared with those from the CPU-based MLFMA and measurements. The capability and efficiency of the presented method are analyzed through the examples of a sphere, an aircraft, and a missile-like object. Compared with the 8-threaded CPU-based MLFMA, the OpenMP-CUDA-MLFMA method can achieve from 5 to 20 times total speedup. Second, an efficient and accurate finite element – boundary integral (FE-BI) method is proposed for solving electromagnetic scattering and radiation problems. A mixed testing scheme, in which the Rao-Wilton-Glisson and the Buffa-Christiansen functions are both employed as the testing functions, is first presented to improve the accuracy of the FE-BI method. An efficient absorbing boundary condition (ABC)-based preconditioner is then proposed to accelerate the convergence of the iterative solution. To further improve the efficiency of the total computation, a GPU-accelerated MLFMA is applied to the iterative solution. The RCSs of several benchmark objects are calculated to demonstrate the numerical accuracy of the solution and also to show that the proposed method not only is free of interior resonance corruption, but also has a better convergence than the conventional FE-BI methods. The capability and efficiency of the proposed method are analyzed through several numerical examples, including a large dielectric coated sphere, a partial human body, and a coated missile-like object. Compared with the 8-threaded CPU-based algorithm, the GPU-accelerated FE-BI-MLFMA algorithm can achieve a total speedup up to 25.5 times. Third, a multi-solver (MS) scheme based on combined field integral equation (CFIE) is proposed. In this scheme, an object is decomposed into multiple bodies based on its material property and geometry. To model bodies with complicated materials, the FE-BI method is applied. To model bodies with homogeneous or conducting materials, the method of moments is employed. Specifically, three solvers are integrated in this multi-solver scheme: the FE-BI(CFIE) for inhomogeneous objects, the CFIE for dielectric objects, and the CFIE for conducting objects. A mixed testing scheme that utilizes both the Rao-Wilton-Glisson and the Buffa-Christiansen functions is adopted to obtain a good accuracy of the proposed multi-solver algorithm. In the iterative solution of the… Advisors/Committee Members: Jin, Jianming (advisor), Jin, Jianming (Committee Chair), Schutt-Aine, Jose E. (committee member), Hirani, Anil N. (committee member), Kloeckner, Andreas (committee member).

Subjects/Keywords: Boundary integral equation; Buffa-Christiansen function; Combined field integral equation (CFIE); Compute unified device architecture (CUDA); Electromagnetic scattering; Finite element method; Finite element-boundary integral (FE-BI); Hybrid parallel programming model; Multi-graphics processing unit (GPU); Message passing interface (MPI); Multilevel fast multipole algorithm; Multi-solver scheme; Open Multi-Processing (OpenMP); Radar cross section; Robin transmission condition; Method of moments (MoM)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Guan, J. (2017). Multi-solver schemes for electromagnetic modeling of large and complex objects. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/98097

Chicago Manual of Style (16^th Edition):

Guan, Jian. “Multi-solver schemes for electromagnetic modeling of large and complex objects.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed January 22, 2021. http://hdl.handle.net/2142/98097.

MLA Handbook (7^th Edition):

Guan, Jian. “Multi-solver schemes for electromagnetic modeling of large and complex objects.” 2017. Web. 22 Jan 2021.

Vancouver:

Guan J. Multi-solver schemes for electromagnetic modeling of large and complex objects. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2142/98097.

Council of Science Editors:

Guan J. Multi-solver schemes for electromagnetic modeling of large and complex objects. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/98097

14. Byrne, Evan. Inference in Generalized Linear Models with Applications.

Degree: PhD, Electrical and Computer Engineering, 2019, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555152640361367

► In this dissertation, we first consider two problems involving the generalized linear model: sparse multinomial logistic regression (SMLR) and sketched clustering, which in the context… (more)

▼ In this dissertation, we first consider two problems involving the generalized linear model: sparse multinomial logistic regression (SMLR) and sketched clustering, which in the context of machine learning are forms of supervised and unsupervised learning, respectively. Conventional approaches to these problems fit the parameters of the model to the data by minimizing some regularized loss function between the model and data with an iterative gradient-based algorithm, which may suffer from various issues such as slow convergence or finding a sub-optimal solution. Slow convergence is particularly detrimental when applied to modern datasets, which may contain upwards of millions of sample points. We take an alternate inference approach based on approximate message passing, rather than optimization. In particular, we apply the hybrid generalized approximate message passing (HyGAMP) algorithm to both of these problems in order to learn the underlying parameters of interest. The HyGAMP algorithm approximates the sum-product or min-sum loopy belief propagation algorithms, which approximate minimum mean squared error (MMSE) or maximum a posteriori (MAP) estimation, respectively, of the unknown parameters of interest. We apply a simplified form of HyGAMP (SHyGAMP) to SMLR, where we show through numerical experiments that our approach meets or exceeds the performance of state-of-the-art SMLR algorithms with respect to classification accuracy and algorithm training time. We then apply the MMSE-SHyGAMP algorithm to the sketched clustering problem, where we also show through numerical experiments that our approach exceeds the performance of other state-of-the-art sketched clustering algorithms with respect to clustering accuracy and computational efficiency, as well as the widely used K-means++ algorithm in some regimes.Finally, we study the problem of adaptive detection from quantized measurements. We focus on the case of strong, but low-rank interference, which is motivated by wireless communications applications for the military, where the receiver is experiencing strong jamming from a small number of sources in a time-invariant channel. In this scenario, the receiver requires many antennas to effectively null out the interference, but at the cost of increased hardware complexity, and total volume of data to be processed. Using highly quantized measurements is one method of reducing the amount of data to be processed, but it is unknown how this affects detection performance. We first investigate the effect of quantized measurements on existing unquantized detection algorithms. We observe that unquantized detection algorithms applied to quantized measurements lack the ability to null arbitrarily large interference, despite being able to null arbitrarily large interference when applied to unquantized measurements. We then derive a generalized likelihood ratio test for the quantized measurement model, which gives rise to a generalized bilinear model. Via simulation, we empirically observe the quantized algorithm only offers a… Advisors/Committee Members: Schniter, Philip (Advisor).

Subjects/Keywords: Electrical Engineering; generalized linear model; multinomial logistic regression; sketched clustering; classification; approximate message passing; adaptive detection; quantization

…Message Passing . . . . . . . 1.3 Outline and Contributions… …3. 4. Sparse Multinomial Logistic Regression via Approximate Message Passing 19 3.1… …Clustering via Approximate Message Passing . . . . . . . . . . 62 4.1 Introduction… …Framework 4.2.2 Approximate Message Passing . . . . . . 4.2.3 From SHyGAMP to CL-AMP… …we introduce a class of inference algorithms based on Approximate Message Passing that…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Byrne, E. (2019). Inference in Generalized Linear Models with Applications. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1555152640361367

Chicago Manual of Style (16^th Edition):

Byrne, Evan. “Inference in Generalized Linear Models with Applications.” 2019. Doctoral Dissertation, The Ohio State University. Accessed January 22, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1555152640361367.

MLA Handbook (7^th Edition):

Byrne, Evan. “Inference in Generalized Linear Models with Applications.” 2019. Web. 22 Jan 2021.

Vancouver:

Byrne E. Inference in Generalized Linear Models with Applications. [Internet] [Doctoral dissertation]. The Ohio State University; 2019. [cited 2021 Jan 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555152640361367.

Council of Science Editors:

Byrne E. Inference in Generalized Linear Models with Applications. [Doctoral Dissertation]. The Ohio State University; 2019. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1555152640361367

University of Florida

15. AGGARWAL,VIKAS. SHMEM+ and SCF System-Level Programming Models for Scalable Reconfigurable Computing.

Degree: PhD, Electrical and Computer Engineering, 2011, University of Florida

URL: https://ufdc.ufl.edu/UFE0042821

► Heterogeneous computing systems comprised of FPGAs coupled with standard microprocessors are becoming an increasingly popular solution for building future high-performance computing (HPC) and high-performance embedded… (more)

Subjects/Keywords: Application programming interfaces; Architectural models; Bandwidth; Communication models; Communication systems; Data transmission; Libraries; Multilevel models; Productivity; Programming models; FPGA – HETEROGENEOUS – MESSAGE – MODEL – PARALLEL – PASSING – PGAS – PORTABILITY – PRODUCTIVITY – PROGRAMMING – RECONFIGURABLE

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

AGGARWAL,VIKAS. (2011). SHMEM+ and SCF System-Level Programming Models for Scalable Reconfigurable Computing. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0042821

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16^th Edition):

AGGARWAL,VIKAS. “SHMEM+ and SCF System-Level Programming Models for Scalable Reconfigurable Computing.” 2011. Doctoral Dissertation, University of Florida. Accessed January 22, 2021. https://ufdc.ufl.edu/UFE0042821.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7^th Edition):

AGGARWAL,VIKAS. “SHMEM+ and SCF System-Level Programming Models for Scalable Reconfigurable Computing.” 2011. Web. 22 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

AGGARWAL,VIKAS. SHMEM+ and SCF System-Level Programming Models for Scalable Reconfigurable Computing. [Internet] [Doctoral dissertation]. University of Florida; 2011. [cited 2021 Jan 22]. Available from: https://ufdc.ufl.edu/UFE0042821.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

AGGARWAL,VIKAS. SHMEM+ and SCF System-Level Programming Models for Scalable Reconfigurable Computing. [Doctoral Dissertation]. University of Florida; 2011. Available from: https://ufdc.ufl.edu/UFE0042821

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

16. Μιχαηλίδης, Παναγιώτης. Παράλληλες και κατανεμημένες υλοποιήσεις για την προσεγγιστική αναζήτηση αλφαριθμητικών.

Degree: 2004, University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών

URL: http://hdl.handle.net/10442/hedi/14459

Subjects/Keywords: Προσεγγιστική αναζήτηση αλφαριθμητικών; Παράλληλη επεξεργασία; Κατανεμημένη επεξεργασία; Συστοιχία σταθμών εργασίας; Διεπαφή περάσματος μηνυμάτων; Ετερογενές υπολογιστικό μοντέλο; Μοντέλο συντονιστής - εργαζόμενος; Διατάξεις επεξεργαστών; Μοντέλο πρόβλεψης απόδοσης; Approximate string searching; Parallel procesisng; Distributed processing; Cluster of workstations; Message passing interface library; Heterogeneous computing model; Master - worker model; Array processors; Performance prediction model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Μιχαηλίδης, . �. (2004). Παράλληλες και κατανεμημένες υλοποιήσεις για την προσεγγιστική αναζήτηση αλφαριθμητικών. (Thesis). University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών. Retrieved from http://hdl.handle.net/10442/hedi/14459

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Μιχαηλίδης, Παναγιώτης. “Παράλληλες και κατανεμημένες υλοποιήσεις για την προσεγγιστική αναζήτηση αλφαριθμητικών.” 2004. Thesis, University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών. Accessed January 22, 2021. http://hdl.handle.net/10442/hedi/14459.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Μιχαηλίδης, Παναγιώτης. “Παράλληλες και κατανεμημένες υλοποιήσεις για την προσεγγιστική αναζήτηση αλφαριθμητικών.” 2004. Web. 22 Jan 2021.

Vancouver:

Μιχαηλίδης �. Παράλληλες και κατανεμημένες υλοποιήσεις για την προσεγγιστική αναζήτηση αλφαριθμητικών. [Internet] [Thesis]. University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; 2004. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10442/hedi/14459.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Μιχαηλίδης �. Παράλληλες και κατανεμημένες υλοποιήσεις για την προσεγγιστική αναζήτηση αλφαριθμητικών. [Thesis]. University of Macedonia Economic and Social Sciences; Πανεπιστήμιο Μακεδονίας Οικονομικών και Κοινωνικών Επιστημών; 2004. Available from: http://hdl.handle.net/10442/hedi/14459

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations