Готові списки джерел за темами / GTH algorithm

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Добірка наукової літератури з теми "GTH algorithm"

Автор: Grafiati
Опубліковано: 10 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "GTH algorithm".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "GTH algorithm"

1

Cohen, David M., Daniel P. Heyman, Asya Rabinovitch, and Danit Brown. "A Parallel Implementation of the GTH Algorithm." INFORMS Journal on Computing 9, no. 2 (May 1997): 218–23. http://dx.doi.org/10.1287/ijoc.9.2.218.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Seneta, E. "Complementation in Stochastic Matrices and the GTH Algorithm." SIAM Journal on Matrix Analysis and Applications 19, no. 2 (April 1998): 556–63. http://dx.doi.org/10.1137/s0895479896310172.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

O'Cinneide, Colm Art. "Relative-error bounds for the LU decomposition via the GTH algorithm." Numerische Mathematik 73, no. 4 (June 1, 1996): 507–19. http://dx.doi.org/10.1007/s002110050203.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Hong, Sung-Chul, and Soohan Ahn. "Application of GTH-like algorithm to Markov modulated Brownian motion with jumps." Communications for Statistical Applications and Methods 28, no. 5 (September 30, 2021): 477–91. http://dx.doi.org/10.29220/csam.2021.28.5.477.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

O’Leary, Dianne P., and Yuan-Jye Jason Wu. "A Block-GTH Algorithm for Finding the Stationary Vector of a Markov Chain." SIAM Journal on Matrix Analysis and Applications 17, no. 3 (July 1996): 470–88. http://dx.doi.org/10.1137/s0895479894262534.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Azaroual, Meryeme, Mohammed Ouassaid, and Mohamed Maaroufi. "Optimum Energy Flow Management of a Grid-Tied Photovoltaic-Wind-Battery System considering Cost, Reliability, and CO2 Emission." International Journal of Photoenergy 2021 (September 24, 2021): 1–20. http://dx.doi.org/10.1155/2021/5591456.

Повний текст джерела
Анотація:
The main goal of this paper is to explore the performance of a residential grid-tied hybrid (GTH) system which relies on economic and environmental aspects. A photovoltaic- (PV-) wind turbine- (WT-) battery storage system with maximizing self-consumption and time-of-use (ToU) pricing is conducted to examine the system efficiency. In so doing, technical optimization criteria with taking into consideration renewable energy benefits including feed-in-tariff (FIT) and greenhouse gas emission (GHG) reduction are analyzed. As the battery has a substantial effect on the operational cost of the system, the energy management strategy (EMS) will incorporate the daily operating cost of the battery and the effect of the degradation. The model can give the opportunity to the network to sell or purchase energy from the system. The simulation results demonstrate the effectiveness of the proposed approach in which the new objective function achieves the maximum cost-saving (99.81%) and income (5.16 $/day) compared to other existing strategies as well as the lowest GHG emission. Furthermore, the battery enhances the best daily self-consumption and load cover ratio. Then, as the model is nonlinear, a comparison with other existing algorithms is performed to select the feasible, robust, and reliable model for the residential application. A hybrid algorithm (HGAFMINCON) is developed to demonstrate the superiority of the algorithm over FMINCON and GA shown in terms of cost savings and income.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Linnemann, Birgit, Rupert Bauersachs, Hannelore Rott, Susan Halimeh, Rainer Zotz, Andrea Gerhardt, Barbara Boddenberg-Pätzold, Bettina Toth, and Ute Scholz. "Diagnosis of pregnancy-associated venous thromboembolism - position paper of the Working Group in Women’s Health of the Society of Thrombosis and Haemostasis (GTH)." Vasa 45, no. 2 (April 2016): 87–101. http://dx.doi.org/10.1024/0301-1526/a000503.

Повний текст джерела
Анотація:
Abstract. Pregnancy and the postpartum period are associated with an increased risk of venous thromboembolism (VTE). Over the past decade, new diagnostic algorithms have been established, combining clinical probability, laboratory testing and imaging studies for the diagnosis of deep vein thrombosis (DVT) and pulmonary embolism (PE) in the non-pregnant population. However, there is no such generally accepted algorithm for the diagnosis of pregnancy-associated VTE. Studies establishing clinical prediction rules have excluded pregnant women, and prediction scores currently in use have not been prospectively validated in pregnancy or during the postpartum period. D-dimers physiologically increase throughout pregnancy and peak at delivery, so a negative D-dimer test result, based on the reference values of non-pregnant subjects, becomes unlikely in the second and third trimesters. Imaging studies therefore play a major role in confirming suspected DVT or PE in pregnant women. Major concerns have been raised against radiologic imaging because of foetal radiation exposure, and doubts about the diagnostic value of ultrasound techniques in attempting to exclude isolated iliac vein thrombosis grow stronger as pregnancy progresses. As members of the Working Group in Women’s Health of the Society of Thrombosis and Haemostasis (GTH), we summarise evidence from the available literature and aim to establish a more uniform strategy for diagnosing pregnancy-associated VTE.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Makarevich, N. А. "Thermodynamics of real polymer solutions in the new Rényi and Tsallis formalism." Proceedings of the National Academy of Sciences of Belarus, Chemical Series 57, no. 2 (June 3, 2021): 162–76. http://dx.doi.org/10.29235/1561-8331-2021-57-2-162-176.

Повний текст джерела
Анотація:
The generalized non-ideality factor of systems (GNF) was introduced into the Renyi and Tsallis information entropy equations, and new expressions were obtained for information and thermodynamic entropies with a fractional moment of the order entropy gS and thermodynamic gth nonideality factors. Equations in formalism of Renyi and Tsallis: The equations describe self-organized structures of essentially non-equilibrium systems and can be used in studying the topological and conformational properties of solutions of high-molecular compounds. GNF: where is are relative average characteristics (pi are statistical probabilities) of opposite processes. Factor g varies in the range 0 ≤ g ≤ 2 and depends on which of the competitive processes prevails. An algorithm for calculating the thermodynamic functions of the state of the system under study is presented. The equations are intended for calculating the thermodynamic functions of objects of fractal nature, including real solutions of synthetic and natural highmolecular compounds of plant and animal origin (hyper branched structures, dendrimers, lignins, biological systems, dendrites, systems of internal organs, blood vessels, etc.).
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Zhang, Jianxun, Quan Zhu, and Jun Li. "Multiple Pathways for Dissociative Adsorption of SiCl4 on the Si(100)-c(4×2) Surface." Symmetry 15, no. 1 (January 11, 2023): 213. http://dx.doi.org/10.3390/sym15010213.

Повний текст джерела
Анотація:
The adsorption of silicon tetrachloride (STC, SiCl4) on the silicon surface is a crucial process in polysilicon manufacture. However, the underlying mechanism for the adsorption remains highly uncertain. Here, new dissociative adsorption (DA) reaction pathways involving a flip of a silicon dimer in the first layer and considering physisorption are identified. Different DA patterns, inter-row (IR), inter-dimer (ID), and on-dimer (OD), are confirmed by the density functional theory (DFT) calculations at the PBE-D3(BJ)/TZVP-MOLOPT-GTH level. The stable structures for all minima are searched by global optimization through the artificial bee colony (ABC) algorithm. Findings reveal that the parent molecules dissociate first by breaking one Si-Cl bond, following which the resulting SiCl3 and Cl fragments are attached to adjacent Si-atom sites. Moreover, dimer flipping significantly reduces the energy barrier for chemisorption, mainly due to the change in electronic structure that enhances the interaction of the site with the SiCl3 radical. Physisorption may also be accompanied by dimer flipping to form a stable adsorption structure.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Kirschner, Martin, Nicole do Ó Hartmann, Stefani Parmentier, Christina Hart, Larissa Henze, Guido Bisping, Martin Griesshammer, et al. "Primary Thromboprophylaxis in Patients with Malignancies: Daily Practice Recommendations by the Hemostasis Working Party of the German Society of Hematology and Medical Oncology (DGHO), the Society of Thrombosis and Hemostasis Research (GTH), and the Austrian Society of Hematology and Oncology (ÖGHO)." Cancers 13, no. 12 (June 10, 2021): 2905. http://dx.doi.org/10.3390/cancers13122905.

Повний текст джерела
Анотація:
Patients with cancer, both hematologic and solid malignancies, are at increased risk for thrombosis and thromboembolism. In addition to general risk factors such as immobility and major surgery, shared by non-cancer patients, cancer patients are exposed to specific thrombotic risk factors. These include, among other factors, cancer-induced hypercoagulation, and chemotherapy-mediated endothelial dysfunction as well as tumor-cell-derived microparticles. After an episode of thrombosis in a cancer patient, secondary thromboprophylaxis to prevent recurrent thromboembolism has long been established and is typically continued as long as the cancer is active or actively treated. On the other hand, primary prophylaxis, even though firmly established in hospitalized cancer patients, has only recently been studied in ambulatory patients. This recent change is mostly due to the emergence of direct oral anticoagulants (DOACs). DOACs have a shorter half-life than vitamin K antagonists (VKA), and they overcome the need for parenteral application, the latter of which is associated with low-molecular-weight heparins (LMWH) and can be difficult for the patient to endure in the long term. Here, first, we discuss the clinical trials of primary thromboprophylaxis in the population of cancer patients in general, including the use of VKA, LMWH, and DOACs, and the potential drug interactions with pre-existing medications that need to be taken into account. Second, we focus on special situations in cancer patients where primary prophylactic anticoagulation should be considered, including myeloma, major surgery, indwelling catheters, or immobilization, concomitant diseases such as renal insufficiency, liver disease, or thrombophilia, as well as situations with a high bleeding risk, particularly thrombocytopenia, and specific drugs that may require primary thromboprophylaxis. We provide a novel algorithm intended to aid specialists but also family practitioners and nurses who care for cancer patients in the decision process of primary thromboprophylaxis in the individual patient.
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "GTH algorithm"

1

Gil, Paulo Guilherme. "Algoritmo para conversão automática de modelos SAN GTA para modelos SAN CTA." Pontifícia Universidade Católica do Rio Grande do Sul, 2013. http://hdl.handle.net/10923/1642.

Повний текст джерела
Анотація:
Made available in DSpace on 2013-08-07T18:43:22Z (GMT). No. of bitstreams: 1 000447661-Texto+Completo-0.pdf: 550622 bytes, checksum: 5a831618aedabce5554e131c45fcd8d9 (MD5) Previous issue date: 2013
This work presents a formalism for modeling systems called Stochastic Automata Networks (SAN), SAN formalism aims to increase the abstraction’s level and provides a sophisticated alternative model to the tadicional formalism of Markov Chains (MC). SAN uses both Classical (CTA) and Generalized Tensor Algebra (GTA) to simplify the matrix of transitions between states of the model. Despite all models described with GTA having at least one equivalent model described using CTA, and that the solution of certain models based on CTA could be faster than the equivalent GTA based model, this dissertation proposes an algorithm for translating a model described in GTA into the equivalent model described in CTA. It is expected that some models described using functions (using GTA) could be solved more quickly or taking less memory through the solution of its CTA-converted model.
Este trabalho apresenta o formalismo para modelagem de sistemas chamado Redes de Autômatos Estocásticos (SAN). O formalismo SAN tem o objetivo de aumentar o nível de abstração e oferece uma alternativa de modelagem mais sofisticada do que a proporcionada pelas tradicionais Cadeias de Markov (MC). Este formalismo utiliza a álgebra tensorial clássica (CTA) e geralizada (GTA) para simplificar a matriz das transições entre os estados do modelo. Embora todos os modelos SAN descritos utilizando GTA possuam pelo menos um modelo equivalente descrito utilizando CTA, e que a solução de certos modelos utilizando CTA possa ser mais rápido que o modelo equivalente que utiliza GTA, este trabalho propõe um algoritmo para traduzir um modelo descrito em GTA para o modelo equivalente descrito em CTA. Espera-se com isto permitir que um modelo descrito utilizando funções (usando GTA) possa ser resolvido mais rapidamente ou ocupando menos memória através da solução de seu modelo convertido para CTA.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Santos, Simone Rodrigues dos. "Proposta de reconfiguração estratégica de sistema financeiro no contexto de governança de tecnologia da informação (GTI): o caso de uma indústria do setor plástico." Universidade do Vale do Rio do Sinos, 2009. http://www.repositorio.jesuita.org.br/handle/UNISINOS/2850.

Повний текст джерела
Анотація:
Made available in DSpace on 2015-03-05T19:14:42Z (GMT). No. of bitstreams: 0 Previous issue date: 23
Nenhuma
Este estudo desenvolveu uma proposta de reconfiguração estratégica de sistema financeiro no contexto de governança de tecnologia da informação apoiado por algoritmo de lógica difusa compensatória. Este estudo utilizou o método de Design Research em empresa do setor de plástico industrial. A proposta do sistema financeiro foi desenvolvida seguindo as seguintes etapas: 1 – identificação do sistema atual; 2 – identificações de variáveis estratégicas; 3 – quantificação das variáveis estratégicas com o uso de matrizes; 4 – cálculo de importância das variáveis estratégicas através de algoritmo difuso. Esta etapa gerou um ranking de importâncias ou prioridades. Com o ranking foi possível reconfigurar o sistema de Business Intelligence usado na empresa. Após a reconfiguração no contexto da governança da tecnologia de informação foi identificada a necessidade de uma maior evidenciação financeira. Para atender tal necessidade foi usada a linguagem XBRL e validada pelo Controller como satisfatória. Além disso, também f
This study developed a proposal for the strategic redesign of a finance system in the context of IT Governance supported by fuzzy logic algorithm. This study used a Design Research method in company of the plastic industrial sector. A new proposal was developed following these stages: 1 – Identification of current system; 2 – Identification of strategic variables; 3 – Quantification of strategic variables using matrixes; 4 – Calculation of the importance of strategic variables using a compensatory fuzzy logic algorithm. This stage created a ranking of importance or priorities. This ranking generated a redesigned system of Business Intelligence now used in the company. After the redesign in the IT context a necessity for financial disclosure was identified. XBRL language was used to do this and was validated by the company’s Controller as satisfactory. The following requisites were also identified: brand/image and costs optimization related to alignment of IT and strategy.
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Gil, Paulo Guilherme. "Algoritmo para convers?o autom?tica de modelos SAN GTA para modelos SAN CTA." Pontif?cia Universidade Cat?lica do Rio Grande do Sul, 2012. http://tede2.pucrs.br/tede2/handle/tede/5210.

Повний текст джерела
Анотація:
Made available in DSpace on 2015-04-14T14:49:59Z (GMT). No. of bitstreams: 1 447661.pdf: 550622 bytes, checksum: 5a831618aedabce5554e131c45fcd8d9 (MD5) Previous issue date: 2012-03-22
This work presents a formalism for modeling systems called Stochastic Automata Networks (SAN), SAN formalism aims to increase the abstraction s level and provides a sophisticated alternative model to the tadicional formalism of Markov Chains (MC). SAN uses both Classical (CTA) and Generalized Tensor Algebra (GTA) to simplify the matrix of transitions between states of the model. Despite all models described with GTA having at least one equivalent model described using CTA, and that the solution of certain models based on CTA could be faster than the equivalent GTA based model, this dissertation proposes an algorithm for translating a model described in GTA into the equivalent model described in CTA. It is expected that some models described using functions (using GTA) could be solved more quickly or taking less memory through the solution of its CTA-converted model
Este trabalho apresenta o formalismo para modelagem de sistemas chamado Redes de Aut?matos Estoc?sticos (SAN). O formalismo SAN tem o objetivo de aumentar o n?vel de abstra??o e oferece uma alternativa de modelagem mais sofisticada do que a proporcionada pelas tradicionais Cadeias de Markov (MC). Este formalismo utiliza a ?lgebra tensorial cl?ssica (CTA) e geralizada (GTA) para simplificar a matriz das transi??es entre os estados do modelo. Embora todos os modelos SAN descritos utilizando GTA possuam pelo menos um modelo equivalente descrito utilizando CTA, e que a solu??o de certos modelos utilizando CTA possa ser mais r?pido que o modelo equivalente que utiliza GTA, este trabalho prop?e um algoritmo para traduzir um modelo descrito em GTA para o modelo equivalente descrito em CTA. Espera-se com isto permitir que um modelo descrito utilizando fun??es (usando GTA) possa ser resolvido mais rapidamente ou ocupando menos mem?ria atrav?s da solu??o de seu modelo convertido para CTA
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Nigri, Simone. "Ottimizzatore per configurazione automatica di algoritmi di pattern matching." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Знайти повний текст джерела
Анотація:
Il tema del riconoscimento di oggetti, siano essi microscopici componenti in grandi catene di assemblaggio o segnali grafici posti su pacchi in spedizione, è uno degli argomenti più rilevanti all'interno del vasto mondo racchiuso nel settore interdisciplinare rappresentato da Computer Vision, inerente all'analisi di immagini al fine di estrapolarne informazioni. Nonostante ciò, l'utilizzo e la configurazione di strumenti (o tool) il cui obiettivo è esattamente quello di rilevare particolari modelli noti a priori in diverse immagini, potrebbe essere un compito particolarmente arduo per un utente medio senza preventiva conoscenza in tale ambito. Al fine di aiutare e guidare tale settore di utenza, lo scopo dell'elaborato sviluppato è, quindi, quello di creare un sistema di ottimizzazione automatica del processo di configurazione di strumenti dediti al Pattern Matching, considerando come study-case il setup del componente software Pattern Sort gentilmente messo a disposizione da Datalogic S.p.A.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Vacher, Blandine. "Techniques d'optimisation appliquées au pilotage de la solution GTP X-PTS pour la préparation de commandes intégrant un ASRS." Thesis, Compiègne, 2020. http://www.theses.fr/2020COMP2566.

Повний текст джерела
Анотація:
Les travaux présentés dans ce document portent sur des problèmes d'optimisation dans le domaine de la logistique interne des entrepôts. Le domaine est soumis à une forte concurrence et est en plein essor, poussé par les besoins croissants du marché et favorisé par l'automatisation. L'entreprise SAVOYE construit des équipements et propose sa propre solution GTP (Goods-To-Person) pour la préparation de commandes. La solution utilise un système de stockage automatisé appelé X-Picking Tray System (X-PTS) et achemine les charges automatiquement à des postes de travail via des carrousels pour effectuer des opérations séquencées. C'est un système de systèmes particulièrement complexe qui offre de nombreuses applications aux techniques de la recherche opérationnelle. Tout cela définit le périmètre applicatif et théorique des travaux menés dans cette thèse. Nous avons d'abord traité un problème d'ordonnancement de type Job Shop avec des contraintes de précédences. Le contexte particulier du problème a permis de le résoudre en un temps polynomial avec un algorithme exact. Celui-ci a permis de calculer les dates d'injection des charges provenant des différents flux de sortie du stockage pour s'agréger sur un carrousel, dans un ordre donné. Ainsi, la gestion inter-allées du stockage PTS a été améliorée et le débit du flux de charges maximisé, depuis le stockage jusqu'à un poste. Nous avons ensuite étudié des algorithmes de tri tels que le tri par base et développé un algorithme de tri en ligne, utilisé pour piloter des systèmes autonomes de tri appelés Buffers Séquenceurs (BS). Placés en amont de chaque poste de travail dans la solution GTP, les BS permettent de délocaliser la fonction de tri en aval du stockage, augmentant de facto le débit des flux de sortie. Enfin, nous avons considéré un problème de séquencement consistant à trouver une extension linéaire d'un ordre partiel minimisant une distance avec un ordre donné. Nous proposons de le résoudre par une approche de programmation linéaire en nombres entiers, par la construction de programmes dynamiques et par des heuristiques de type glouton. Une heuristique efficace a été développée en se basant sur des appels itératifs d'un des programmes dynamiques, permettant d'atteindre une solution proche ou égale à l'optimum en un temps très court. L'application de ce problème aux flux de sortie non ordonnés du stockage X-PTS permet de réaliser un pré-tri au niveau des carrousels. Les diverses solutions développées ont été validées par simulation et certaines ont été brevetées et/ou déjà été mises en application dans des entrepôts
The work presented in this PhD thesis deals with optimization problems in the context of internal warehouse logistics. The field is subject to strong competition and extensive growth, driven by the growing needs of the market and favored by automation. SAVOYE builds warehouse storage handling equipment and offers its own GTP (Goods-To-Person) solution for order picking. The solution uses an Automated Storage and Retrieval System (ASRS) called X-Picking Tray System (X-PTS) and automatically routes loads to workstations via carousels to perform sequenced operations. It is a highly complex system of systems with many applications for operational research techniques. All this defines the applicative and theoretical scope of the work carried out in this thesis. In this thesis, we have first dealt with a specific scheduling Job Shop problem with precedence constraints. The particular context of this problem allowed us to solve it in polynomial time with exact algorithms. These algorithms made it possible to calculate the injection schedule of the loads coming from the different storage output streams to aggregate on a carousel in a given order. Thus, the inter-aisle management of the X-PTS storage was improved and the throughput of the load flow was maximized, from the storage to a station. In the sequel of this work, the radix sort LSD (Least Significant Digit) algorithm was studied and a dedicated online sorting algorithm was developed. The second one is used to drive autonomous sorting systems called Buffers Sequencers (BS), which are placed upstream of each workstation in the GTP solution. Finally, a sequencing problem was considered, consisting of finding a linear extension of a partial order minimizing a distance with a given order. An integer linear programming approach, different variants of dynamic programming and greedy algorithms were proposed to solve it. An efficient heuristic was developed based on iterative calls of dynamic programming routines, allowing to reach a solution close or equal to the optimum in a very short time. The application of this problem to the unordered output streams of X-PTS storage allows pre-sorting at the carousel level. The various solutions developed have been validated by simulation and some have been patented and/or already implemented in warehouses
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Comblet, Fabrice. "Détection, localisation et identification de cibles radar par imagerie électromagnétique bistatique." Phd thesis, Université de Bretagne occidentale - Brest, 2005. http://tel.archives-ouvertes.fr/tel-00011931.

Повний текст джерела
Анотація:
L'objectif de cette thèse est de développer, caractériser et analyser l'imagerie radar en configuration bistatique. Dans le cadre de notre étude, nous nous plaçons dans le cas général d'une configuration bistatique sans condition sur la configuration d'acquisition. Nous avons alors développé un algorithme de reconstruction d'images tenant compte des polarisations d'émission et de réception. Ainsi, nous avons pu caractériser les images obtenues et donner l'expression des résolutions d'une image bistatique en fonction de la configuration d'acquisition. Ensuite, nous avons étudié les images bistatiques reconstruites lors de l'observation de cibles complexes ainsi que celles obtenues lors de la détection de cibles sur une surface océanique afin de les comparer avec celles d'une configuration monostatique. Les résultats ainsi obtenus permettent de valider l'intérêt de la configuration bistatique et de présenter les nouvelles perspectives qu'offre ce sujet de recherche en imagerie radar.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Ušiak, Michal. "Porovnání koncepcí hybridního pohonu v režimu denního dojíždění do práce." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2020. http://www.nusl.cz/ntk/nusl-417429.

Повний текст джерела
Анотація:
The master’s thesis deals with modelling of various architectures of hybrid powertrains for three vehicle sizes in GT-SUITE and compares them in daily commuting operating mode. On top of making of the hybrid vehicle simulation models, control algorithms had to be created to manage the energy split between the internal combustion engine and the electric motor for each of the architectures. Routes to work and back were logged using the GPS and postprocessed to obtain the speed and the road grade profiles. Resulting data was used as an input in simulations of daily commuting. To compare all hybrid powertrain architectures, fuel economy and electricity consumption were evaluated for WLTP and daily commuting operating modes. Finally, the environmental impact of each topology was assessed based on an estimation of corresponding well-to-wheel emissions.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Lawson, Brodie Alexander James. "Cell migration and proliferation on homogeneous and non-homogeneous domains : modelling on the scale of individuals and populations." Thesis, Queensland University of Technology, 2013. https://eprints.qut.edu.au/61066/1/Brodie_Lawson_Thesis.pdf.

Повний текст джерела
Анотація:
Cell migration is a behaviour critical to many key biological effects, including wound healing, cancerous cell invasion and morphogenesis, the development of an organism from an embryo. However, given that each of these situations is distinctly different and cells are extremely complicated biological objects, interest lies in more basic experiments which seek to remove conflating factors and present a less complex environment within which cell migration can be experimentally examined. These include in vitro studies like the scratch assay or circle migration assay, and ex vivo studies like the colonisation of the hindgut by neural crest cells. The reduced complexity of these experiments also makes them much more enticing as problems to mathematically model, like done here. The primary goal of the mathematical models used in this thesis is to shed light on which cellular behaviours work to generate the travelling waves of invasion observed in these experiments, and to explore how variations in these behaviours can potentially predict differences in this invasive pattern which are experimentally observed when cell types or chemical environment are changed. Relevant literature has already identified the difficulty of distinguishing between these behaviours when using traditional mathematical biology techniques operating on a macroscopic scale, and so here a sophisticated individual-cell-level model, an extension of the Cellular Potts Model (CPM), is been constructed and used to model a scratch assay experiment. This model includes a novel mechanism for dealing with cell proliferations that allowed for the differing properties of quiescent and proliferative cells to be implemented into their behaviour. This model is considered both for its predictive power and used to make comparisons with the travelling waves which result in more traditional macroscopic simulations. These comparisons demonstrate a surprising amount of agreement between the two modelling frameworks, and suggest further novel modifications to the CPM that would allow it to better model cell migration. Considerations of the model’s behaviour are used to argue that the dominant effect governing cell migration (random motility or signal-driven taxis) likely depends on the sort of invasion demonstrated by cells, as easily seen by microscopic photography. Additionally, a scratch assay simulated on a non-homogeneous domain consisting of a ’fast’ and ’slow’ region is also used to further differentiate between these different potential cell motility behaviours. A heterogeneous domain is a novel situation which has not been considered mathematically in this context, nor has it been constructed experimentally to the best of the candidate’s knowledge. Thus this problem serves as a thought experiment used to test the conclusions arising from the simulations on homogeneous domains, and to suggest what might be observed should this non-homogeneous assay situation be experimentally realised. Non-intuitive cell invasion patterns are predicted for diffusely-invading cells which respond to a cell-consumed signal or nutrient, contrasted with rather expected behaviour in the case of random-motility-driven invasion. The potential experimental observation of these behaviours is demonstrated by the individual-cell-level model used in this thesis, which does agree with the PDE model in predicting these unexpected invasion patterns. In the interest of examining such a case of a non-homogeneous domain experimentally, some brief suggestion is made as to how this could be achieved.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Addis, Elena. "Elementwise accurate algorithms for nonsymmetric algebraic Riccati equations associated with M-matrices." Doctoral thesis, 2022. http://hdl.handle.net/2158/1275470.

Повний текст джерела
Анотація:
We present an elementwise accurate algorithm which incorporates the shift technique for the computation of the minimal non negative solution of a nonsymmetric algebraic Riccati equation associated to M, when M is an irreducible singular M-matrix. We propose the idea of delayed shift and some results that guarantees the applicability and the convergence of structured doubling algorithm based only on the properties of the matrix of the initial setup of doubling algorithm instead of matrix M. We provide a componentwise error analysis for the algorithm and we also show some numerical experiments that illustrate the advantage in terms of accuracy and convergence speed.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Chou, Chun-Wei, and 周俊瑋. "A systolic array based GTD processor with a parallel algorithm." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/643kx6.

Повний текст джерела
Анотація:
碩士
國立交通大學
電子工程學系 電子研究所
103
Generalized triangular decomposition (GTD) has been found to be useful in the field of signal processing, but the feasibility of the related hardware has not yet been established. This paper presents (for the first time) a GTD processor architecture with a parallel algorithm. The proposed parallel GTD algorithm achieves an increase in speed of up to 1.66 times, compared to the speed of its conventional sequential counterpart for an 8x8 matrix. For hardware implementation, the proposed reconfigurable architecture is capable of computing singular value decomposition (SVD), geometric mean decomposition (GMD), and GTD for matrix sizes from 1x1 to 8x8. The proposed GTD processor is composed of 16 processing cores in a heterogeneous systolic array. Computations are distributed over area-efficient coordinate rotation digital computers (CORDICs) to achieve a high throughput. To establish the validity of the concept, a GTD processor was designed and implemented. The latency constraint of 16 us specified in the 802.11ac standard is adopted for the hardware realization. The proposed design achieves a maximum throughput of 83.3k matrix/sec for an 8x8 matrix at 112.4 MHz. The estimated power and core area are 172.7 mW and 1.96 mm^2, respectively, based on standard 90 nm CMOS technology.
Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "GTH algorithm"

1

Farebrother, R. W. Visualizing statistical models and concepts. New York: Marcel Dekker, 2002.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Grosso, Susana. ALGEFIT: ALgoritmo de GEstión de FITosanitarios. Teseo, 2020. http://dx.doi.org/10.55778/ts878668031.

Повний текст джерела
Анотація:
<p>Este manual, dirigido especialmente a gobiernos locales e ingenieros agrónomos, tiene como objetivo colaborar con la implementación de normas vinculadas a la aplicación de fitosanitarios.</p><p>ALGEFIT es una herramienta que ayuda a ordenar la gestión del uso de plaguicidas a través de la identificación de los problemas pertinentes, del nivel de gestión y de la factibilidad de ejecución de la gestión a partir de los recursos materiales y humanos disponibles y de las prioridades políticas existentes.</p><p>Facilita la interacción entre los actores locales. El uso de fitosanitarios es un tema sensible y en los pueblos rurales muchas veces se opta por no abordarlo, tratando de evitar conflictos entre vecinos. Esta herramienta ayuda a visualizar la magnitud y complejidad del problema, a despersonalizar las acciones y a ordenar la toma de decisiones.</p><p>ALGEFIT es complementario y compatible con el desarrollo de sistemas de producción de menor impacto ambiental, como las BPA o la producción agroecológica.</p>
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Silva, Catarina, and Bernardete Ribeiro. Aprendizagem Computacional em Engenharia. Imprensa da Universidade de Coimbra, 2020. http://dx.doi.org/10.14195/978-989-26-2011-4.

Повний текст джерела
Анотація:
<p>Aprendizagem Computacional em Engenharia permite que engenheiros possam usar técnicas de aprendizagem computacional para desenvolver soluções que promovam ou melhorem a produtividade nos vários domínios. Este livro aborda diversos temas, que vão desde as abordagens conexionistas, técnicas de aprendizagem por aglomeração de dados, lógica difusa e métodos de computação evolucionária, entre outros, tendo sempre em mente a utilização das técnicas duma forma rápida e eficiente, sem descurar, no entanto, o rigor que o assunto merece.</p> <p>É assim apresentado um conjunto dos algoritmos mais utilizados e um conjunto representativo dos problemas reais a que podem dar solução. De forma a que o livro seja razoavelmente autocontido, cada capítulo inclui uma pequena introdução ao algoritmo abordado, seguida de formas simples de o pôr em prática. Neste sentido, é apresentado o modo de utilização de software que disponibiliza os algoritmos, a sua configuração e a sua utilização em casos e dados reais.</p>
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Beyer, Elena, Katharina Erler, Christoph Hartmann, Malte Kramme, Michael F. Müller, Tereza Pertot, Elif Tuna, and Felix M. Wilke, eds. Privatrecht 2050 - Blick in die digitale Zukunft. Nomos Verlagsgesellschaft mbH & Co. KG, 2020. http://dx.doi.org/10.5771/9783748901723.

Повний текст джерела
Анотація:
Der Band enthält die Beiträge der 30. Jahrestagung der Gesellschaft Junge Zivilrechtswissenschaft e.V., die im September 2019 von Bayreuther Nachwuchswissenschaftlern ausgerichtet wurde. Die Beiträge befassen sich mit den Auswirkungen des digitalen Wandels auf die Entwicklung des Privatrechts in den kommenden Jahrzehnten und behandeln die folgenden Themenfelder: Legal Tech: Grenzen der Personalisierung dispositiven Rechts, Möglichkeiten zur Formalisierung des Rechts und zur automatischen Subsumtion, Rechtsdienstleistungen durch Online-Inkassodienste Vertragsrecht: vertragsrechtliche Erfassung der Plattformwirtschaft, Beteiligung künstlicher Intelligenz in Vertragsverhältnissen sowie Haftungsfragen im Internet der Dinge Sachenrecht: Übertragung von Bitcoins Gesellschaftsrecht: EU Company Law Package und die digitalisierte GmbH, virtuelle Hauptversammlung Prozessrecht: digitale Beweismittel und Smart Enforcement Diskriminierung durch Algorithmen Datenschutzverletzung als Wettbewerbsverstoß <b>Mit Beiträgen von </b> Martin Schmidt-Kessel, Philip Maximilian Bender, Johannes Klug, Sören Segger-Piening, Johannes Warter, Julia Grinzinger, Dimitrios Linardatos, Lena Maute, Miriam Kullmann, Ralf Knaier, Patrick Nutz, Miriam Buiten, Julia Harten, David Markworth, Lukas Klever, Julian Rapp
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Visualizing Statistical Models and Concepts (Statistics: a Series of Textbooks and Monogrphs). CRC, 2002.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "GTH algorithm"

1

Wu, Yuan-Jye Jason. "A Parallel Implementation of the Block-GTH Algorithm." In Computations with Markov Chains, 597–98. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2241-6_36.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Cohen, David M., Daniel P. Heyman, Asya Rabinovitch, and Danit Brown. "Parallel Implementation of the GTH Algorithm for Markov Chains." In Computations with Markov Chains, 594–96. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4615-2241-6_35.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Koç, Çetin Kaya, Funda Özdemir, and Zeynep Ödemiş Özger. "Boneh-Goh-Nissim Algorithm." In Partially Homomorphic Encryption, 123–33. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87629-6_11.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Sanduleanu, Sebastian, Simon Keek, Lars Hoezen, and Philippe Lambin. "Biomarkers for Hypoxia, HPVness, and Proliferation from Imaging Perspective." In Critical Issues in Head and Neck Oncology, 13–20. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-63234-2_2.

Повний текст джерела
Анотація:
AbstractRecent advances in quantitative imaging with handcrafted radiomics and unsupervised deep learning have resulted in a plethora of validated imaging biomarkers in the field of head and neck oncology. Generally speaking, these algorithms are trained for one specific task, e.g. to classify between two or multiple types of underlying tumor biology (e.g. hypoxia, HPV status), predict overall survival (OS) or progression free survival (PFS), automatically segment a region of interest e.g. an organ at risk for radiotherapy dose or the gross tumor volume (GTV). Despite relatively good performances in external validation cohorts these algorithms still have not found their way into routine clinical practice. The reason this has not happened yet is complex, multifactorial, and can be usually divided into three categories: technical (a part of the algorithm or pre-processing step is not technically sound), statistical (mainly related to selection of subset of relevant biomarkers), and translational (not enough understanding by clinicians, not easily implementable within clinical workflow). We currently foresee that the next artificial intelligence (AI)-driven technique to find its way into clinical practice beside existing techniques (e.g. automatic organ at risk segmentation) will be the automatic segmentation of head and neck gross tumor volumes.
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Baek, Seulkee, Mario Carneiro, and Marijn J. H. Heule. "A Flexible Proof Format for SAT Solver-Elaborator Communication." In Tools and Algorithms for the Construction and Analysis of Systems, 59–75. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_4.

Повний текст джерела
Анотація:
AbstractWe introduce , a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to , the format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to . The format is easy to parse forward and backward, and it is extensible to future proof methods. The provision of optional proof steps allows SAT solver developers to balance implementation effort against elaboration time, with little to no overhead on solver time. We benchmark our toolchain against a comparable toolchain and confirm >84% median reduction in elaboration time and >94% median decrease in peak memory usage.
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Dilliswar Reddy, Puli, and L. Rama Parvathy. "Prediction of Air Pollution Level in Particular Region Area Using Logistic Regression and Naive Bayes." In Advances in Parallel Computing Algorithms, Tools and Paradigms. IOS Press, 2022. http://dx.doi.org/10.3233/apc220088.

Повний текст джерела
Анотація:
To predict the air pollution level in a particular region area using an Innovative Logistic Regression algorithm compared with the Naive Bayes algorithm. The Logistic Regression Algorithm and the Naive Bayes Algorithm are two sets of algorithms. The algorithms were implemented and evaluated on a dataset of 32516 records. Various air pollution was identified through a programming experiment with N=5 iterations for each method. The threshold value is 0.05%, and the Confidence Interval is 95%. The G-power test used is about 80%. The innovative Logistic Regression algorithm (98.26%) has better accuracy when compared with Naive Bayes(97.32%). Logistic Regression has the highest accuracy in comparison to the Naive Bayes algorithm. Significance value for accuracy is 0.056(p>0.05), Precision 0.02(p<0.05) and recall 0.01(p<0.05) based on 2-tail analysis. Logistic Regression outperforms the Naive Bayes Algorithm in the prediction of air pollution.
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Venkat Sai Tarun, G., and P. Sriramya. "Ola Data Analysis for Dynamic Price Prediction Using Multiple Linear Regression and Random Forest Regression." In Advances in Parallel Computing Algorithms, Tools and Paradigms. IOS Press, 2022. http://dx.doi.org/10.3233/apc220071.

Повний текст джерела
Анотація:
This research aims to create the most efficient and accurate cab fare prediction system using two machine learning algorithms, the Multiple linear Regression algorithm and the random forest algorithm, and compare parameters r-square, Mean Square Error (MSE), Root MSE, and RMSLE values to evaluate the efficiency of two machine learning algorithm. Considering Multiple linear Regression as group 1 and random forest algorithms as implemented, the 2 group process was to predict prices and get the best accuracy to compare algorithms. The algorithm should be efficient enough to produce the exact fare amount of the trip before the trip starts. The sample size for implementing this work was N=10 for each group considered. The sample size calculation was done with clincle. The pretest analysis was kept at 80%. The sample size is estimated using G-power. Based on the statistical analysis significance value for calculating r-squared, MSE was 0.945 and 0.266(p>0.05), respectively. The Multiple linear algorithms give a slightly better accuracy rate with a mean r-squared percentage of 71.69%, and the Random forest algorithm has a mean r-square of 71.29%. Through this, prediction is made for online booking of cabs or taxis, and the Multiple linear algorithms give a slightly better r-squared value than the Random forest algorithm.
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Poojitha, M. R. S., and K. Malathi. "Decision Tree Over Support Vector Machine for Better Accuracy in Identifying the Problem Based on the Iris Flower." In Advances in Parallel Computing Algorithms, Tools and Paradigms. IOS Press, 2022. http://dx.doi.org/10.3233/apc220028.

Повний текст джерела
Анотація:
The iris dataset will be classified using the support vector machine and decision tree algorithms. flower dataset identifies the pattern and classifies it. The dataset has 150 rows and 5 attributes, which contains 50 samples from each species. There are three species in this dataset. Iris flower classification can be performed using support vector machines and decision tree algorithms. SVM stands for Support Vector Machine, and is a supervised machine learning technique that can be used for classification and regression. The Decision Tree algorithm is a simple approach mainly used for classification and prediction. The sample size has been determined to be 20 for both the groups using G Power 80%. The Support Vector Machine algorithm provides a mean accuracy of 98.09% when compared to the Decision Tree algorithm, with a mean accuracy of 95.55%. A statistically insignificant difference was observed between the Decision Tree and the Support Vector Machine, p = 0.92 (> 0.05) based on 2-tailed analysis. In the classification of Iris flowers, the Support Vector Machine outperformed the Decision Tree Algorithm.
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Dhoke, Pratik, Pranay Saraf, Pawan Bhalandhare, Yogadhar Pandey, H. R. Deshmukh, and Rahul Agrawal. "Algorithm For Intelligent Systems." In Machine Learning Methods for Engineering Application Development, 19–30. BENTHAM SCIENCE PUBLISHERS, 2022. http://dx.doi.org/10.2174/9879815079180122010005.

Повний текст джерела
Анотація:
In the 21st-century, machines are becoming more and more intelligent. Terms like artificial intelligence, automation, robotics, etc., are becoming the new normal in today's tech-savvy world. All of this is made possible because of complex programs (algorithms) which are able to perform such difficult tasks.<br><br>Intelligent systems are self-taught machines intended for a particular task. Intelligence is the ability to learn and use new information and skills. As the person learns from past data, the system can be programmed using various algorithms to make it intelligent.<br><br>In this chapter, we will be discussing some of the algorithms in brief, like- Reinforcement learning, Game theory, Machine Learning, Decision Tree, Artificial Neural Networks, Swarm Intelligence, and Natural Language Processing and its applications.
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Pérez, Óscar, and Manuel Sánchez-Montañés. "Class Prediction in Test Sets with Shifted Distributions." In Machine Learning, 660–67. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-60960-818-7.ch318.

Повний текст джерела
Анотація:
Machine learning has provided powerful algorithms that automatically generate predictive models from experience. One specific technique is <i>supervised learning</i>, where the machine is trained to predict a desired output for each input pattern <b>x</b>. This chapter will focus on <i>classification</i>, that is, supervised learning when the output to predict is a class label. For instance predicting whether a patient in a hospital will develop cancer or not. In this example, the class label <i>c</i> is a variable having two possible values, “cancer” or “no cancer”, and the input pattern <b>x</b> is a vector containing patient data (e.g. age, gender, diet, smoking habits, etc.). In order to construct a proper predictive model, supervised learning methods require a set of examples <b>x</b><sub>i</sub> together with their respective labels c<sub>i</sub>. This dataset is called the “training set”. The constructed model is then used to predict the labels of a set of new cases <b>x</b><sub>j</sub> called the “test set”. In the cancer prediction example, this is the phase when the model is used to predict cancer in new patients.<div><br></div><div>One common assumption in supervised learning algorithms is that the statistical structure of the training and test datasets are the same (Hastie, Tibshirani &amp; Friedman, 2001). That is, the test set is assumed to have the same attribute distribution p(<b>x</b>) and same class distribution p(c|<b>x</b>) as the training set. However, this is not usually the case in real applications due to different reasons. For instance, in many problems the training dataset is obtained in a specific manner that differs from the way the test dataset will be generated later. Moreover, the nature of the problem may evolve in time. These phenomena cause p<sup>Tr</sup>(<b>x</b>, c)&nbsp;<img src="http://resources.igi-global.com/Marketing/Preface_Figures/does_not_equal.png">&nbsp;p<sup>Test</sup>(<b>x</b>, c), which can degrade the performance of the model constructed in training.</div><div><br></div><div>Here we present a new algorithm that allows to re-estimate a model constructed in training using the unlabelled test patterns. We show the convergence properties of the algorithm and illustrate its performance with an artificial problem. Finally we demonstrate its strengths in a heart disease diagnosis problem where the training set is taken from a different hospital than the test set. </div>
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "GTH algorithm"

1

Bishop, C. M. "Magnification factors for the GTM algorithm." In Fifth International Conference on Artificial Neural Networks. IEE, 1997. http://dx.doi.org/10.1049/cp:19970703.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Kaewmanee, J., T. Indrasindhu, T. Menaneatra, and T. Tosukolvan. "Underground Cable Fault Location via Random Forest Algorithm." In 2019 IEEE PES GTD Grand International Conference and Exposition Asia (GTD Asia). IEEE, 2019. http://dx.doi.org/10.1109/gtdasia.2019.8715921.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

Ghosh, Swapnendu Narayan. "IBS - P&O Hybrid MPPT Algorithm for Solar PV Applications." In 2019 IEEE PES GTD Grand International Conference and Exposition Asia (GTD Asia). IEEE, 2019. http://dx.doi.org/10.1109/gtdasia.2019.8715847.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Haque, A. N. M. M., M. Xiong, and P. H. Nguyen. "Consensus Algorithm for Fair Power Curtailment of PV Systems in LV Networks." In 2019 IEEE PES GTD Grand International Conference and Exposition Asia (GTD Asia). IEEE, 2019. http://dx.doi.org/10.1109/gtdasia.2019.8715912.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

Lin, Xueshan, Hongbin Wu, Xin Liu, and Bin Xu. "Dynamic Equivalent Modeling of Induction Motors based on K-means Clustering Algorithm." In 2019 IEEE PES GTD Grand International Conference and Exposition Asia (GTD Asia). IEEE, 2019. http://dx.doi.org/10.1109/gtdasia.2019.8715950.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Singh, Shashank, Aryesh Namboodiri, and M. P. Selvan. "Simplified Algorithm for Dynamic Demand Response in Smart Homes Under Smart Grid Environment." In 2019 IEEE PES GTD Grand International Conference and Exposition Asia (GTD Asia). IEEE, 2019. http://dx.doi.org/10.1109/gtdasia.2019.8715935.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

Bassi, E., and F. Benzi. "Field orientation algorithm for current source GTO inverter." In Applied Power Electronics Conference and Exposition. IEEE, 1990. http://dx.doi.org/10.1109/apec.1990.66386.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Chen, Jianxin, Luis Lino Ferreira, and Eduardo Tovar. "An Explicit GTS allocation algorithm for IEEE 802.15.4." In Factory Automation (ETFA 2011). IEEE, 2011. http://dx.doi.org/10.1109/etfa.2011.6059020.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Kumar, V. Raja, Sravana Kumar Bali, and Ramesh Devarapalli. "GTO Algorithm Based Solar Photovoltaic Module Parameter Selection." In 2021 Innovations in Power and Advanced Computing Technologies (i-PACT). IEEE, 2021. http://dx.doi.org/10.1109/i-pact52855.2021.9696873.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Galias, Zbigniew. "Tree Structure Based Algorithm for Multiobjective Optimization of Switch Allocation in Radial Distribution Networks." In 2019 IEEE PES GTD Grand International Conference and Exposition Asia (GTD Asia). IEEE, 2019. http://dx.doi.org/10.1109/gtdasia.2019.8715939.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "GTH algorithm"

1

Sinclair, Samantha, and Sandra LeGrand. Reproducibility assessment and uncertainty quantification in subjective dust source mapping. Engineer Research and Development Center (U.S.), August 2021. http://dx.doi.org/10.21079/11681/41523.

Повний текст джерела
Анотація:
Accurate dust-source characterizations are critical for effectively modeling dust storms. A previous study developed an approach to manually map dust plume-head point sources in a geographic information system (GIS) framework using Moderate Resolution Imaging Spectroradiometer (MODIS) imagery processed through dust-enhancement algorithms. With this technique, the location of a dust source is digitized and recorded if an analyst observes an unobscured plume head in the imagery. Because airborne dust must be sufficiently elevated for overland dust-enhancement algorithms to work, this technique may include up to 10 km in digitized dust-source location error due to downwind advection. However, the potential for error in this method due to analyst subjectivity has never been formally quantified. In this study, we evaluate a version of the methodology adapted to better enable reproducibility assessments amongst multiple analysts to determine the role of analyst subjectivity on recorded dust source location error. Four analysts individually mapped dust plumes in Southwest Asia and Northwest Africa using five years of MODIS imagery collected from 15 May to 31 August. A plume-source location is considered reproducible if the maximum distance between the analyst point-source markers for a single plume is ≤10 km. Results suggest analyst marker placement is reproducible; however, additional analyst subjectivity-induced error (7 km determined in this study) should be considered to fully characterize locational uncertainty. Additionally, most of the identified plume heads (> 90%) were not marked by all participating analysts, which indicates dust source maps generated using this technique may differ substantially between users.
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Sinclair, Samantha, and Sandra LeGrand. Reproducibility assessment and uncertainty quantification in subjective dust source mapping. Engineer Research and Development Center (U.S.), August 2021. http://dx.doi.org/10.21079/11681/41542.

Повний текст джерела
Анотація:
Accurate dust-source characterizations are critical for effectively modeling dust storms. A previous study developed an approach to manually map dust plume-head point sources in a geographic information system (GIS) framework using Moderate Resolution Imaging Spectroradiometer (MODIS) imagery processed through dust-enhancement algorithms. With this technique, the location of a dust source is digitized and recorded if an analyst observes an unobscured plume head in the imagery. Because airborne dust must be sufficiently elevated for overland dust-enhancement algorithms to work, this technique may include up to 10 km in digitized dust-source location error due to downwind advection. However, the potential for error in this method due to analyst subjectivity has never been formally quantified. In this study, we evaluate a version of the methodology adapted to better enable reproducibility assessments amongst multiple analysts to determine the role of analyst subjectivity on recorded dust source location error. Four analysts individually mapped dust plumes in Southwest Asia and Northwest Africa using five years of MODIS imagery collected from 15 May to 31 August. A plume-source location is considered reproducible if the maximum distance between the analyst point-source markers for a single plume is ≤10 km. Results suggest analyst marker placement is reproducible; however, additional analyst subjectivity-induced error (7 km determined in this study) should be considered to fully characterize locational uncertainty. Additionally, most of the identified plume heads (> 90%) were not marked by all participating analysts, which indicates dust source maps generated using this technique may differ substantially between users.
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "GTH algorithm" для конкретних типів джерел:
Статті в журналах
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії