Bibliographies thématiques / Efficient implementation for HBVM

Littérature scientifique sur le sujet « Efficient implementation for HBVM »

Auteur : Grafiati
Publié le 10 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Efficient implementation for HBVM ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Efficient implementation for HBVM"

1

Di Stefano, F., E. S. Malinverni, R. Pierdicca, G. Fangi et S. Ejupi. « HBIM IMPLEMENTATION FOR AN OTTOMAN MOSQUE. CASE OF STUDY : SULTAN MEHMET FATIH II MOSQUE IN KOSOVO ». ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-2/W15 (22 août 2019) : 429–36. http://dx.doi.org/10.5194/isprs-archives-xlii-2-w15-429-2019.

Texte intégral
Résumé :
<p><strong>Abstract.</strong> <i>National Strategy For Cultural Heritage 2017–2027</i> is a Kosovo Government document that aims the enhancement of the system for the protection and preservation of Kosovan cultural heritage. Among the listed goals, one can find the promotion of an integrated data management approach towards cooperation platforms that involve advanced technologies and information systems applied to cultural heritage. In a country with a low technological progress, as Kosovo is, an innovative information management system like HBIM is a huge challenge. This research contributes in opening the debate about the use of HBIM even for historical architecture, illustrating a methodology of information management promoting the conservation and the valorization of a Kosovan ottoman mosque. The workflow pipeline started with the close range photogrammetric survey, obtaining first spherical panoramas and then the wire-frame processed in a 3D modelling environment, suitable to implement the HBIM project. Basing on the accuracy of the data acquisition, the availability of information about the building and the related level of knowledge, we proposed a semantic representation of the complex structure integrating in an HBIM collecting in an “ad hoc” database the geometrical building components, enriched with attributes as images, materials, decay, interventions, etc., linked to each features. Our approach is an example of how efficient semantic classification can be repeated for the analysis and the documentation of other similar ottoman mosque, simplifying the management of construction by a sort of unique and searchable archive. The advantage of the interoperability concept allows the data sharing is now stressed by HBIM.</p>
Styles APA, Harvard, Vancouver, ISO, etc.
2

Lowe, Christopher F., Linda Merrick, P. Richard Harrigan, Tony Mazzulli, Christopher H. Sherlock et Gordon Ritchie. « Implementation of Next-Generation Sequencing for Hepatitis B Virus Resistance Testing and Genotyping in a Clinical Microbiology Laboratory ». Journal of Clinical Microbiology 54, no 1 (4 novembre 2015) : 127–33. http://dx.doi.org/10.1128/jcm.02229-15.

Texte intégral
Résumé :
Sanger sequencing or DNA hybridization have been the primary modalities for hepatitis B (HBV) resistance testing and genotyping; however, there are limitations, such as low sensitivity and the inability to detect novel mutations. Next-generation sequencing (NGS) for HBV can overcome these limitations, but there is limited guidance for clinical microbiology laboratories to validate this novel technology. In this study, we describe an approach to implementing deep pyrosequencing for HBV resistance testing and genotyping in a clinical virology laboratory. A nested PCR targeting thepolregion of HBV (codons 143 to 281) was developed, and the PCR product was sequenced by the 454 Junior (Roche). Interpretation was performed by ABL TherapyEdge based on European Association for the Study of the Liver (EASL) guidelines. Previously characterized HBV samples by INNO-LiPA (LiPA) were compared to NGS with discordant results arbitrated by Sanger sequencing. Genotyping of 105 distinct samples revealed a concordance of 95.2% (100/105), with Sanger sequencing confirming the NGS result. Resistance testing by NGS was concordant with LiPA in 85% (68/80) of previously characterized samples. Additional mutations were found in 8 samples, which related to the identification of low-level mutant subpopulations present at <10% (6/8). To balance the costs of testing for the validation study, reproducibility of the NGS was investigated through an analysis of sequence variants at loci not associated with resistance in a single patient sample. Our validation approach attempts to balance costs with efficient data acquisition.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Pepe, Massimiliano, Domenica Costantino et Alfredo Restuccia Garofalo. « An Efficient Pipeline to Obtain 3D Model for HBIM and Structural Analysis Purposes from 3D Point Clouds ». Applied Sciences 10, no 4 (12 février 2020) : 1235. http://dx.doi.org/10.3390/app10041235.

Texte intégral
Résumé :
The aim of this work is to identify an efficient pipeline in order to build HBIM (heritage building information modelling) and create digital models to be used in structural analysis. To build accurate 3D models it is first necessary to perform a geomatics survey. This means performing a survey with active or passive sensors and, subsequently, accomplishing adequate post-processing of the data. In this way, it is possible to obtain a 3D point cloud of the structure under investigation. The next step, known as “scan-to-BIM (building information modelling)”, has led to the creation of an appropriate methodology that involved the use of Rhinoceros software and a few tools developed within this environment. Once the 3D model is obtained, the last step is the implementation of the structure in FEM (finite element method) and/or in HBIM software. In this paper, two case studies involving structures belonging to the cultural heritage (CH) environment are analysed: a historical church and a masonry bridge. In particular, for both case studies, the different phases were described involving the construction of the point cloud and, subsequently, the construction of a 3D model. This model is suitable both for structural analysis and for the parameterization of rheological and geometric information of each single element of the structure.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Kontoudaki, A., et A. Georgopoulos. « HBIM LIBRARY DEVELOPMENT FOR A DORIC TEMPLE COLUMN ». International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIII-B2-2022 (30 mai 2022) : 1153–58. http://dx.doi.org/10.5194/isprs-archives-xliii-b2-2022-1153-2022.

Texte intégral
Résumé :
Abstract. The growing interest within the construction industry in the preservation, rehabilitation, and conservation of heritage-value buildings has led to the implementation of Historic Building Information Modelling (HBIM). Especially in Greece, where the number of historical buildings is considerably large, having efficient and standardized processes of Cultural Heritage management and conservation becomes a prerequisite. The rigorously accurate representation of old constructions requires specific geometric modelling processes in order to generate the necessary relevant libraries of parametric objects. This paper describes the development of a parametrized library for the main parts of a Doric Temple to be used for introducing such parts in an HBIM system. Moreover, to verify the correctness of the parametrized column an application is performed in which the dimensions of a real column are compared with the dimensions of the standard one. The study improves the potential of the BIM process for its application to buildings with distinctive architecture in the context of the preservation or conversion of heritage buildings. In first section the term HBIM is explained and its usefulness to cultural heritage (CH) is justified. Section 2 describes previous attempts to create HBIM libraries for historic structures. After that, the construction of parametric model, which was created with visual programming Dynamo, is presented. Finally, the efficiency of the adjustment of a standard column to a given point cloud is described and in the end the results of the application are compared and discussed.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Steytler, M., et D. W. Thaldar. « Public health emergency preparedness and response in South Africa : A review of recommendations for legal reform relating to data and biological sample sharing ». South African Journal of Bioethics and Law 14, no 3 (31 décembre 2021) : 101–6. http://dx.doi.org/10.7196/sajbl.2021.v14i3.772.

Texte intégral
Résumé :
COVID-19 exposed flaws in the law regulating the sharing of data and human biological material (HBM). This poses obstacles to the epidemic response, which needs accelerated public health research and, in turn, efficient and legitimate HBM and data sharing. Legal reform and development are needed to ensure that HBM and data are shared efficiently and lawfully. Academics have suggested important legal reforms. The first is the clarification of the susceptibility of HBM and HBM derivatives to ownership, including, inter alia, the promulgation of a revised version of the South African Material Transfer Agreement (SA MTA) by the Minister of Health. This would remove uncertainty regarding the current SA MTA’s perpetual donor ownership clause. The second is the development of data trusts, the adoption of open access to research data, and the creation of an African ‘data corridor’. This would ensure that data are protected while allowing for the efficient transfer of data between researchers for the collective good and in the interest of the public. The third is the amendment of the Space Affairs Act to extend the powers of the Council of Space Affairs to include the management of data collected through the utilisation of Earth observation and geographical information systems. This would ensure the protection of outer space data, legislating its use and sharing once it lands on Earth. The implementation of these legal reforms and developments will better prepare SA to face future epidemics from a health research perspective.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Bruno, N., et R. Roncella. « A RESTORATION ORIENTED HBIM SYSTEM FOR CULTURAL HERITAGE DOCUMENTATION : THE CASE STUDY OF PARMA CATHEDRAL ». ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-2 (30 mai 2018) : 171–78. http://dx.doi.org/10.5194/isprs-archives-xlii-2-171-2018.

Texte intégral
Résumé :
The need to safeguard and preserve Cultural Heritage (CH) is increasing and especially in Italy, where the amount of historical buildings is considerable, having efficient and standardized processes of CH management and conservation becomes strategic. At the time being, there are no tools capable of fulfilling all the specific functions required by Cultural Heritage documentation and, due to the complexity of historical assets, there are no solution as flexible and customizable as CH specific needs require. Nevertheless, BIM methodology can represent the most effective solution, on condition that proper methodologies, tools and functions are made available. The paper describes an ongoing research on the implementation of a Historical BIM system for the Parma cathedral, aimed at the maintenance, conservation and restoration.<br> Its main goal was to give a concrete answer to the lack of specific tools required by Cultural Heritage documentation: organized and coordinated storage and management of historical data, easy analysis and query, time management, 3D modelling of irregular shapes, flexibility, user-friendliness, etc.<br> The paper will describe the project and the implemented methodology, focusing mainly on survey and modelling phases. In describing the methodology, critical issues about the creation of a HBIM will be highlighted, trying to outline a workflow applicable also in other similar contexts.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Leoni, Leonardo, Alessandra Cantini, Farshad BahooToroody, Saeed Khalaj, Filippo De Carlo, Mohammad Mahdi Abaei et Ahmad BahooToroody. « Reliability Estimation under Scarcity of Data : A Comparison of Three Approaches ». Mathematical Problems in Engineering 2021 (19 mars 2021) : 1–15. http://dx.doi.org/10.1155/2021/5592325.

Texte intégral
Résumé :
During the last decades, the optimization of the maintenance plan in process plants has lured the attention of many researchers due to its vital role in assuring the safety of operations. Within the process of scheduling maintenance activities, one of the most significant challenges is estimating the reliability of the involved systems, especially in case of data scarcity. Overestimating the average time between two consecutive failures of an individual component could compromise safety, while an underestimate leads to an increase of operational costs. Thus, a reliable tool able to determine the parameters of failure modelling with high accuracy when few data are available would be welcome. For this purpose, this paper aims at comparing the implementation of three practical estimation frameworks in case of sparse data to point out the most efficient approach. Hierarchical Bayesian modelling (HBM), maximum likelihood estimation (MLE), and least square estimation (LSE) are applied on data generated by a simulated stochastic process of a natural gas regulating and metering station (NGRMS), which was adopted as a case of study. The results identify the Bayesian methodology as the most accurate for predicting the failure rate of the considered devices, especially for the equipment characterized by less data available. The outcomes of this research will assist maintenance engineers and asset managers in choosing the optimal approach to conduct reliability analysis either when sufficient data or limited data are observed.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Harlin, Ulrika, Jörgen Frohm, Martina Berglund et Johan Stahre. « TOWARDS EFFICIENT AUTOMATION IMPLEMENTATION ». IFAC Proceedings Volumes 39, no 4 (2006) : 71–76. http://dx.doi.org/10.3182/20060522-3-fr-2904.00012.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Schiper, A. « Efficient Implementation of Rendezvous ». Computer Journal 32, no 3 (1 mars 1989) : 267–72. http://dx.doi.org/10.1093/comjnl/32.3.267.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Alpern, Bowen, Anthony Cocchi, Stephen Fink et David Grove. « Efficient implementation of Java interfaces ». ACM SIGPLAN Notices 36, no 11 (novembre 2001) : 108–24. http://dx.doi.org/10.1145/504311.504291.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Efficient implementation for HBVM"

1

King, Myron Decker. « An efficient sequential BTRS implementation ». Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/46603.

Texte intégral
Résumé :
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (leaves 73-74).
This thesis describes the implementation of BTRS, a language based on guarded atomic actions (GAA). The input language to the compiler which forms the basis of this work is a hierarchical tree of modules containing state, interface methods, and rules which fire atomically to cause state transitions. Since a schedule need not be specified, the program description is inherently nondeterministic, though the BTRS language does allow the programmer to remove nondeterminism by specifying varying degrees of scheduling constraints. The compiler outputs a (sequential) single-threaded C implementation of the input description, choosing a static schedule which adheres to the input constraints. The resulting work is intended to be used as the starting point for research into efficient software synthesis from guarded atomic actions, and ultimately a hardware inspired programming methodology for writing parallel software. This compiler is currently being used to generate software for a heterogeneous system in which the software and hardware components are both specified in BTRS.
by Myron Decker King.
S.M.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Patel, Nirav B. « Voronoi diagrams robust and efficient implementation / ». Diss., Online access via UMI:, 2005.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Stenman, Erik. « Efficient Implementation of Concurrent Programming Languages ». Doctoral thesis, Uppsala University, Department of Information Technology, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-2688.

Texte intégral
Résumé :

Dissertation in Computer Science to be publicly examined in Häggsalen, Ångströmlaboratoriet, Uppsala University, on Friday, November 1, 2002 at 1:00 pm for the degree of doctor of philosophy. The examination will be conducted in English.

This thesis proposes and experimentally evaluates techniques for efficient implementation of languages designed for high availability concurrent systems. This experimental evaluation has been done while developing the High Performance Erlang (HiPE) system, a native code compiler for SPARC and x86. The two main goals of the HiPE system are to provide efficient execution of Erlang programs, and to provide a research vehicle for evaluating implementation techniques for concurrent functional programming languages.

The focus of the thesis is the evaluation of two techniques that enable inter-process optimization through dynamic compilation. The first technique is a fast register allocator called linear scan, and the second is a memory architecture where processes share memory.

The main contributions of the thesis are:

An evaluation of linear scan register allocation in a different language setting. In addition the performance of linear scan on the register poor x86 architecture is evaluated for the first time.

A description of three different heap architectures (private heaps, shared heap, and a hybrid of the two), with a systematic investigation of implementation aspects and an extensive discussion on the associated performance trade-offs of the heap architectures. The description is accompanied by an experimental evaluation of the private vs. the shared heap setting.

A novel approach to optimizing a concurrent program, by merging code from a sender with code from a receiver, is presented together with other methods for reducing the overhead of context switching.

A description of the implementation aspects of a complete and robust native code Erlang system, which makes it possible to test compiler optimizations on real world programs.

Styles APA, Harvard, Vancouver, ISO, etc.
4

ALVES, ROGERIO GUEDES. « EFFICIENT MULTI-RATE SYSTEM IMPLEMENTATION FORMS ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1993. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=8692@1.

Texte intégral
Résumé :
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Inicialmente apresenta-se a estrutura de um sistema Multi- taxa, faz-se uma revisão teórica do mesmo, e descreve-se seu funcionamento. Posteriormente são apresentadas várias formas de implementar este sistema, como realizá-lo no domínio do tempo, parte no domínio do tempo e parte no domínio da freqüência e realizá-lo no domínio da freqüência. Nestas formas de implementação são considerados fatores como: emprego da técnica de overlap- save ou overlap-add para realização da convolução a ser implementada no sistema, e utilização de filtros do tipo IIR ou FIR para realizar o filtro de reconstrução. Nos sistemas implementados das diversas formas são analisados o atraso e a complexidade comparando-se os resultados teóricos obtidos. Nestas diferentes formas de implementação são mostrados sistemas com particularidades interessantes como: implementação da interpolação no domínio da freqüência e utilização de uma FFT inversa voltada para interpolação e decimação. Finalmente são apresentados resultados práticos dos sistemas realizados, sendo estes avaliados, comparados com os teóricos e comentados.
Firstly, a multi-rate system structure is presented, a theorical review is made and its behavior is described. Afterwards, many forms of its implementation are presented: in time domain, mixed time domain and frequency domain; and in the frequency domain only. In those implementation some factors are taken into account, such as the use of the overlap-save and overlap- add techniques for the convolution, and the utilization of IIR or FIR structures as reconstruction filters. In the system implemented, the delay and complexity are analised, by the comparing to the theorical results. Some interesting results are show, such as the implementation of the frequency domain interpolation and the use of an inverse FFT dedicated to decimation and interpolation. Finally, pratical results of the implemented system are presented. These are evaluated, compared to the theorical ones and commented upon.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mahdi, Abdul-Hussain Ebrahim. « Efficient generalized transform algorithms for digital implementation ». Thesis, Bangor University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277612.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Wojtczak, Dominik. « Recursive probabilistic models : efficient analysis and implementation ». Thesis, University of Edinburgh, 2009. http://hdl.handle.net/1842/3217.

Texte intégral
Résumé :
This thesis examines Recursive Markov Chains (RMCs), their natural extensions and connection to other models. RMCs can model in a natural way probabilistic procedural programs and other systems that involve recursion and probability. An RMC is a set of ordinary finite state Markov Chains that are allowed to call each other recursively and it describes a potentially infinite, but countable, state ordinary Markov Chain. RMCs generalize in a precise sense several well studied probabilistic models in other domains such as natural language processing (Stochastic Context-Free Grammars), population dynamics (Multi-Type Branching Processes) and in queueing theory (Quasi-Birth-Death processes (QBDs)). In addition, RMCs can be extended to a controlled version called Recursive Markov Decision Processes (RMDPs) and also a game version referred to as Recursive (Simple) Stochastic Games (RSSGs). For analyzing RMCs, RMDPs, RSSGs we devised highly optimized numerical algorithms and implemented them in a tool called PReMo (Probabilistic Recursive Models analyzer). PReMo allows computation of the termination probability and expected termination time of RMCs and QBDs, and a restricted subset of RMDPs and RSSGs. The input models are described by the user in specifically designed simple input languages. Furthermore, in order to analyze the worst and best expected running time of probabilistic recursive programs we study models of RMDPs and RSSGs with positive rewards assigned to each of their transitions and provide new complexity upper and lower bounds of their analysis. We also establish some new connections between our models and models studied in queueing theory. Specifically, we show that (discrete time) QBDs can be described as a special subclass of RMCs and Tree-like QBDs, which are a generalization of QBDs, are equivalent to RMCs in a precise sense. We also prove that for a given QBD we can compute (in the unit cost RAM model) an approximation of its termination probabilities within i bits of precision in time polynomial in the size of the QBD and linear in i. Specifically, we show that we can do this using a decomposed Newton’s method.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Taylor, David Eirik. « Efficient Implementation of Cross-Correlation in Hardware ». Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-25839.

Texte intégral
Résumé :
Low-area matched filter and correlator designs are explored in this thesis, for ADC resolutions of 1- and 2-bits. Correlators are used extensively in spread-spectrum communication technologies, where they serve as a means of detecting a known pseudo-random sequence (PN code). The correlator designs presented here are intended for direct-sequence spread spectrum (DSSS) radio, where the data to be sent is expanded using either the PN code, or the inverse of the PN code. The correlator or matched filter will then respond with a positive or negative peak when a data bit is detected.To test various correlator designs a testbench is developed in MATLAB, where a DSSS data sequence can be created and corrupted with an adjustable level of white Gaussian noise. The data stream with noise is filtered with an automatic gain stage, and sampled using an ADC of variable resolution and sampling rate. The sampled signal is then fed to a mathematical model of the given correlator design to see how it behaves. For an objective measure of performance in the presence of noise, a novel noise immunity test bench was developed, which subjects the correlator models to a signal with increasing levels of noise. The SNR where the correlator is no longer able to extract the correct data bits from the signal is considered the noise immunity level.Several HDL matched filter designs are presented for both 1- and 2-bits of ADC resolution. The 1-bit matched filters are tested using the Barker-11 PN code, whereas the 2-bit correlators are tested using a 36 chip long chirp sequence. For both the 1- and 2-bit correlators, a specific design type using a multiplexed parallel counter was the most area efficient. A novel grouping correlator design is also presented for 2-bit operation, however the area required by this design is larger than that of the other designs. The results from the grouping design indicate that a significant reduction in dynamic power is present. In terms of power efficiency, the dual correlator designs showed promising results of half the power consumption of the other designs. The design of parallel bit counters used in the matched filters are also presented, along with the area per bits required for each design.Verification of the designs is performed using mathematical correlator models, which are subjected to the same input as the Verilog modules. The results from these two tests are compared, and any discrepancies are reported to the user of the testbench. The mathematical and Verilog correlator models are fed with a simulated real-world input signal, which is essentially random noise for purposes of testing functionality.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Abdoel-Gawad, Farag Saleh. « Efficient hardware implementation of the CORDIC algorithm ». Thesis, Liverpool John Moores University, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299066.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Fan, Yanan. « Efficient implementation of Markov chain Monte Carlo ». Thesis, University of Bristol, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343307.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Jerez, Juan Luis. « Custom optimization algorithms for efficient hardware implementation ». Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/12791.

Texte intégral
Résumé :
The focus is on real-time optimal decision making with application in advanced control systems. These computationally intensive schemes, which involve the repeated solution of (convex) optimization problems within a sampling interval, require more efficient computational methods than currently available for extending their application to highly dynamical systems and setups with resource-constrained embedded computing platforms. A range of techniques are proposed to exploit synergies between digital hardware, numerical analysis and algorithm design. These techniques build on top of parameterisable hardware code generation tools that generate VHDL code describing custom computing architectures for interior-point methods and a range of first-order constrained optimization methods. Since memory limitations are often important in embedded implementations we develop a custom storage scheme for KKT matrices arising in interior-point methods for control, which reduces memory requirements significantly and prevents I/O bandwidth limitations from affecting the performance in our implementations. To take advantage of the trend towards parallel computing architectures and to exploit the special characteristics of our custom architectures we propose several high-level parallel optimal control schemes that can reduce computation time. A novel optimization formulation was devised for reducing the computational effort in solving certain problems independent of the computing platform used. In order to be able to solve optimization problems in fixed-point arithmetic, which is significantly more resource-efficient than floating-point, tailored linear algebra algorithms were developed for solving the linear systems that form the computational bottleneck in many optimization methods. These methods come with guarantees for reliable operation. We also provide finite-precision error analysis for fixed-point implementations of first-order methods that can be used to minimize the use of resources while meeting accuracy specifications. The suggested techniques are demonstrated on several practical examples, including a hardware-in-the-loop setup for optimization-based control of a large airliner.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Efficient implementation for HBVM"

1

Efficient DDC systems implementation. Radnor, Pa : Chilton Book Co., 1996.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Fontijne, D. H. F. Efficient implementation of geometric algebra. [S.l : s.n.], 2007.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Dörr, Heiko, dir. Efficient Graph Rewriting and Its Implementation. Berlin, Heidelberg : Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0031909.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Efficient graph rewriting and its implementation. New York, N.Y : Springer-Verlag, 1995.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Jiang, Guang-Shan. Efficient implementation of weighted ENO schemes. Hampton, VA : Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1995.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Shen, Hong. Efficient design and implementation of parallel algorithms. Åbo : Åbo Akademis Förlag, 1991.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Xia, Edward. Efficient implementation of an XML query algebra. Ottawa : National Library of Canada, 2002.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Nolan, Gary. Efficient SAP NetWeaver BW implementation and upgrade guide. 2e éd. Boston, MA : Galileo Press, 2010.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Stanley, Osher, et Langley Research Center, dir. Efficient implementation of essentially non-oscillatory shock capturing schemes. Hampton, Va : National Aeronautics and Space Administration, Langley Research Center, 1987.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Kosuge, Yoshimichi. AIX 4.3 elements of security : Effective and efficient implementation. Poughkeepsie, N.Y : IBM, International Technical Support Organization, 2000.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Chapitres de livres sur le sujet "Efficient implementation for HBVM"

1

Koopman, Pieter, et Rinus Plasmeijer. « Efficient Combinator Parsers ». Dans Implementation of Functional Languages, 120–36. Berlin, Heidelberg : Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48515-5_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Herout, Adam, Markéta Dubská et Jirí Havel. « Efficient Implementation of PClines ». Dans Real-Time Detection of Lines and Grids, 55–68. London : Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4414-4_6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Shenoy, Narendra, et Richard Rudell. « Efficient Implementation of Retiming ». Dans The Best of ICCAD, 615–30. Boston, MA : Springer US, 2003. http://dx.doi.org/10.1007/978-1-4615-0292-0_49.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

de Dormale, Guerric Meurice, Philippe Bulens et Jean-Jacques Quisquater. « Efficient Modular Division Implementation ». Dans Field Programmable Logic and Application, 231–40. Berlin, Heidelberg : Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30117-2_25.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Meinel, Christoph, et Thorsten Theobald. « Efficient Implementation of OBDDs ». Dans Algorithms and Data Structures in VLSI Design, 105–22. Berlin, Heidelberg : Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/978-3-642-58940-9_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Zein, André. « Towards Implementation ». Dans Transition Towards Energy Efficient Machine Tools, 111–30. Berlin, Heidelberg : Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32247-1_5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Franke, Hubertus, Peter Hochschild, Pratap Pattnaik et Marc Snir. « An Efficient Implementation of MPI ». Dans Programming Environments for Massively Parallel Distributed Systems, 219–29. Basel : Birkhäuser Basel, 1994. http://dx.doi.org/10.1007/978-3-0348-8534-8_22.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Indermark, K., et H. Klaeren. « Efficient implementation of structural recursion ». Dans Fundamentals of Computation Theory, 204–13. Berlin, Heidelberg : Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/3-540-18740-5_43.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Bischof, Mario, Tobias Oder et Tim Güneysu. « Efficient Microcontroller Implementation of BIKE ». Dans Innovative Security Solutions for Information Technology and Communications, 34–49. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-41025-4_3.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Izu, Tetsuya, Jun Kogure, Masayuki Noro et Kazuhiro Yokoyama. « Efficient Implementation of Schoof’s Algorithm ». Dans Lecture Notes in Computer Science, 66–79. Berlin, Heidelberg : Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49649-1_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Efficient implementation for HBVM"

1

Perich, Filip, Edward Morgan, Olga Ritterbush, Mark McHenry et Salvador D'Itri. « Efficient dynamic spectrum access implementation ». Dans MILCOM 2010 - 2010 IEEE Military Communications Conference. IEEE, 2010. http://dx.doi.org/10.1109/milcom.2010.5679564.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Wiesmaier, Alex, Moritz Horsch, Johannes Braun, Franziskus Kiefer, Detlef Hhnlein, Falko Strenzke et Johannes Buchmann. « An efficient mobile PACE implementation ». Dans the 6th ACM Symposium. New York, New York, USA : ACM Press, 2011. http://dx.doi.org/10.1145/1966913.1966936.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Huang, Yu-Jung, Yang-Shih Lin, Kuang-Yu Hung et Kuo-Chen Lin. « Efficient Implementation of AES IP ». Dans APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems. IEEE, 2006. http://dx.doi.org/10.1109/apccas.2006.342467.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Langhammer, Martin, et Bogdan Pasca. « Efficient FPGA Modular Multiplication Implementation ». Dans FPGA '21 : The 2021 ACM/SIGDA International Symposium on Field Programmable Gate Arrays. New York, NY, USA : ACM, 2021. http://dx.doi.org/10.1145/3431920.3439306.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Garcia-Vite, Pedro, Juan M. Ramirez et Julio C. Rosas-Caro. « Efficient implementation of DVR's control ». Dans Energy Society General Meeting (PES). IEEE, 2009. http://dx.doi.org/10.1109/pes.2009.5275931.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

« Session MA8a1 : Efficient hardware implementation ». Dans 2016 50th Asilomar Conference on Signals, Systems and Computers. IEEE, 2016. http://dx.doi.org/10.1109/acssc.2016.7869026.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Alpern, Bowen, Anthony Cocchi, Stephen Fink et David Grove. « Efficient implementation of Java interfaces ». Dans the 16th ACM SIGPLAN conference. New York, New York, USA : ACM Press, 2001. http://dx.doi.org/10.1145/504282.504291.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Hiroshi Tezuka, A. H., et Y. Ishikawa. « Highly Efficient Gang Scheduling Implementation ». Dans SC98 - High Performance Networking and Computing Conference. IEEE, 1998. http://dx.doi.org/10.1109/sc.1998.10007.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Mohammad, Khader, et Sos Agaian. « Efficient FPGA implementation of convolution ». Dans 2009 IEEE International Conference on Systems, Man and Cybernetics - SMC. IEEE, 2009. http://dx.doi.org/10.1109/icsmc.2009.5346737.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Chen, Xiaohe, Michael Cracraft, Yao Jiang Zhang, Jianmin Zhang, James L. Drewniak, Bruce Archambeault et Samuel Connor. « An Efficient Implementation of Parallel FDTD ». Dans 2007 International Symposium on Electromagnetic Compatibility. IEEE, 2007. http://dx.doi.org/10.1109/isemc.2007.197.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Efficient implementation for HBVM"

1

Harris, D., et T. Paik. Subspace Detectors : Efficient Implementation. Office of Scientific and Technical Information (OSTI), juillet 2006. http://dx.doi.org/10.2172/898451.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Heimbigner, Dennis. An Efficient Implementation of Query/Advertise. Fort Belvoir, VA : Defense Technical Information Center, mars 2003. http://dx.doi.org/10.21236/ada436796.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Braun, Thomas R., et Ralph C. Smith. Efficient Implementation Algorithms for Homogenized Energy Models. Fort Belvoir, VA : Defense Technical Information Center, janvier 2005. http://dx.doi.org/10.21236/ada439961.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Fung, Nicholas, et Philip David. Implementation of Efficient Pan-Tilt-Zoom Camera Calibration. Fort Belvoir, VA : Defense Technical Information Center, avril 2009. http://dx.doi.org/10.21236/ada497476.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Goldberg, Andrew V. Processor-Efficient Implementation of a Maximum Flow Algorithm,. Fort Belvoir, VA : Defense Technical Information Center, janvier 1990. http://dx.doi.org/10.21236/ada323469.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Day, David. An Efficient Implementation of Non Symmetric Lanczos Algorithm,. Fort Belvoir, VA : Defense Technical Information Center, octobre 1995. http://dx.doi.org/10.21236/ada310632.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Sherman, Rivi, et Amir Pnueli. Model Checking for Linear Temporal Logic : An Efficient Implementation. Fort Belvoir, VA : Defense Technical Information Center, juin 1990. http://dx.doi.org/10.21236/ada225189.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Braun, Thomas R., et Ralph C. Smith. Efficient Implementation Algorithm for a Homogenized Energy Model with Thermal Relaxation. Fort Belvoir, VA : Defense Technical Information Center, janvier 2005. http://dx.doi.org/10.21236/ada440030.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Hardwick, Jonathan C. Implementation and Evaluation of an Efficient 2D Parallel Delaunay Triangulation Algorithm,. Fort Belvoir, VA : Defense Technical Information Center, avril 1997. http://dx.doi.org/10.21236/ada328005.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Lala, P. K., et A. Walker. Modular Implementation of Efficient Self-Checking Checkers for the Berger Code. Fort Belvoir, VA : Defense Technical Information Center, mars 1996. http://dx.doi.org/10.21236/ada310441.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Efficient implementation for HBVM » pour d’autres types de sources :
Articles de revues Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie