Relevant bibliographies by topics / ICM algorithm

Contents

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

Academic literature on the topic 'ICM algorithm'

Author: Grafiati
Published: 3 June 2025
Last updated: 23 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'ICM algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "ICM algorithm"

1

Shahida, T. D., M. Othman, and M. K. Abdullah. "FAST ZEROX ALGORITHM FOR ROUTING IN OPTICAL MULTISTAGE INTERCONNECTION NETWORKS." IIUM Engineering Journal 11, no. 1 (2010): 28–39. http://dx.doi.org/10.31436/iiumej.v11i1.51.

Full text
Abstract:
Based on the ZeroX algorithm, a fast and efficient crosstalk-free time- domain algorithm called the Fast ZeroX or shortly FastZ_X algorithm is proposed for solving optical crosstalk problem in optical Omega multistage interconnection networks. A new pre-routing technique called the inverse Conflict Matrix (iCM) is also introduced to map all possible conflicts identified between each node in the network as another representation of the standard conflict matrix commonly used in previous Zero-based algorithms. It is shown that using the new iCM, the original ZeroX algorithm is simplified, thus improved the algorithm by reducing the time to complete routing process. Through simulation modeling, the new approach yields the best performance in terms of minimal routing time in comparison to the original ZeroX algorithm as well as previous algorithms tested for comparison in this paper.
APA, Harvard, Vancouver, ISO, and other styles
2

BOAST, CHARLES W., and PHILIPPE BAVEYE. "ALLEVIATION OF AN INDETERMINACY PROBLEM AFFECTING TWO CLASSICAL ITERATIVE IMAGE THRESHOLDING ALGORITHMS." International Journal of Pattern Recognition and Artificial Intelligence 20, no. 01 (2006): 1–14. http://dx.doi.org/10.1142/s021800140600448x.

Full text
Abstract:
Thresholding algorithms are being increasingly used in a wide variety of disciplines to objectively discern patterns and objects in micrographs, still pictures or remotely-sensed images. Our experience has shown that three common thresholding algorithms exhibit indeterminacy, in that different operator inputs may lead to very different pattern characterizations. A grayscale image of a soil profile is used to illustrate this phenomemon in the case of the intermeans (IM), minimum error (ME), and Besag's iterated conditional modes (ICM) algorithms. For the illustrative example, the IM algorithm depends only weakly on the starting point of the iterative process — it converges to only two adjacent threshold values. In contrast, the ME algorithm converges to 14 different threshold values plus a segmentation that identifies the entire image as dye, and one that identifies none of it as dye. The ICM algorithm converges to an even wider variety of final segmentations, depending on its starting point. A noniterative modification of the IM and ME algorithms is proposed, providing a consistent method for choosing from among a set of apparently equally-valid segmentations.
APA, Harvard, Vancouver, ISO, and other styles
3

Shan Gao, 高山, 李成 Cheng Li, and 毕笃彦 Duyan Bi. "Image enhancement algorithm based on NF-ICM." Chinese Optics Letters 8, no. 5 (2010): 474–77. http://dx.doi.org/10.3788/col20100805.0474.

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

Zhang, Yan Ming, Hong Ling Ye, Yao Ming Li, and Yun Kang Sui. "The Research of Optimization Algorithm of Dynamic Topology Optimization Model of Continuum Structure Based on the ICM Method." Applied Mechanics and Materials 380-384 (August 2013): 1804–7. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.1804.

Full text
Abstract:
In this paper, we mainly focus on the structural optimal design of dynamics for continuum structures, and aim at constructing the topological optimal formulation by using the ICM (Independent, Continuum and Mapping) method, which is considering weight as objective function and fundamental eigenfrequency as constraint. The local model is removed by selecting suitable filter function. And two algorithms, dual sequential quadratic programming (DSQP) and global convergent method of moving asymptotes (GCMMA) algorithm, were used to solve the mathematic optimal model. Finally, numerical example is provided to demonstrate the validity and effectiveness of the ICM method and compare the optimization results of two optimization algorithms. The results show that both optimization algorithms can solve the mathematics optimization model effectively.
APA, Harvard, Vancouver, ISO, and other styles
5

Deng, Yaqi, Zhengwang Pei, Wenguo Li, and Dongchu Jiang. "Clutter Suppression Algorithm with Joint Intrinsic Clutter Motion Errors Calibration and Off-Grid Effects Mitigation in Airborne Passive Radars." Applied Sciences 13, no. 9 (2023): 5653. http://dx.doi.org/10.3390/app13095653.

Full text
Abstract:
In an airborne passive radar, multipath (MP) clutter, which is caused by MP signals contained in the contaminated reference signal, degrades the space-time adaptive processing (STAP) performance. The MP clutter suppression algorithm before STAP can mitigate the influence of impure reference signals. However, the performances of the existing MP clutter suppression methods deteriorate when the intrinsic clutter motion (ICM) exists because the sparse model of MP clutter is disturbed. To eliminate the impacts of ICM on MP clutter suppression, a joint optimization algorithm is developed for airborne passive radar. Firstly, the sparse model of MP clutter is modified by taking ICM fluctuation into account. Subsequently, the joint optimization function of the ICM fluctuation and MP clutter profile is derived. Finally, based on the local search technique, MP clutter is suppressed with ICM error calibration and off-grid effects mitigation. A range of simulations verify the reliability and superiority of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
6

Thomas, Molnar. "CAPSULE NETWORK PERFORMANCE WITH AUTONOMOUS NAVIGATION." International Journal of Artificial Intelligence and Applications (IJAIA) 11, January (2020): 1–15. https://doi.org/10.5281/zenodo.3663522.

Full text
Abstract:
Capsule Networks (CapsNets) have been proposed as an alternative to Convolutional Neural Networks (CNNs). This paper showcases how CapsNets are more capable than CNNs for autonomous agent exploration of realistic scenarios. In real world navigation, rewards external to agents may be rare. In turn, reinforcement learning algorithms can struggle to form meaningful policy functions. This paper’s approach Capsules Exploration Module (Caps-EM) pairs a CapsNets architecture with an Advantage Actor Critic algorithm. Other approaches for navigating sparse environments require intrinsic reward generators, such as the Intrinsic Curiosity Module (ICM) and Augmented Curiosity Modules (ACM). CapsEM uses a more compact architecture without need for intrinsic rewards. Tested using ViZDoom, the CapsEM uses 44% and 83% fewer trainable network parameters than the ICM and Depth-Augmented Curiosity Module (D-ACM), respectively, for 1141% and 437% average time improvement over the ICM and DACM, respectively, for converging to a policy function across "My Way Home" scenariosCapsule Networks (CapsNets) have been proposed as an alternative to Convolutional Neural Networks (CNNs). This paper showcases how CapsNets are more capable than CNNs for autonomous agent exploration of realistic scenarios. In real world navigation, rewards external to agents may be rare. In turn, reinforcement learning algorithms can struggle to form meaningful policy functions. This paper’s approach Capsules Exploration Module (Caps-EM) pairs a CapsNets architecture with an Advantage Actor Critic algorithm. Other approaches for navigating sparse environments require intrinsic reward generators, such as the Intrinsic Curiosity Module (ICM) and Augmented Curiosity Modules (ACM). CapsEM uses a more compact architecture without need for intrinsic rewards. Tested using ViZDoom, the CapsEM uses 44% and 83% fewer trainable network parameters than the ICM and Depth-Augmented Curiosity Module (D-ACM), respectively, for 1141% and 437% average time improvement over the ICM and DACM, respectively, for converging to a policy function across "My Way Home" scenarios
APA, Harvard, Vancouver, ISO, and other styles
7

Ye, Hong Ling, Yao Ming Li, Yan Ming Zhang, and Yun Kang Sui. "Structural Topology Optimization with Dynamic Response Based on Independent Continuous Mapping Method." Advanced Materials Research 765-767 (September 2013): 1658–61. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.1658.

Full text
Abstract:
This paper refer to weight as objective and subject to multiple response amplitude of the harmonic excitation. The ICM method is employed for solving the topology optimization problem and dual sequence quadratic programming (DSQP) is effective to solve the algorithm. A numerical example was presented and demonstrated the validity and effectiveness of the ICM method.
APA, Harvard, Vancouver, ISO, and other styles
8

Glendinning, R. H. "An evaluation of the icm algorithm for image reconstruction." Journal of Statistical Computation and Simulation 31, no. 3 (1989): 169–85. http://dx.doi.org/10.1080/00949658908811141.

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

Guo, Hui Min, and Ling Chao Zhan. "The TEM Image Segmentation Based on ICM-MRF Algorithm." Journal of Physics: Conference Series 1087 (September 2018): 022017. http://dx.doi.org/10.1088/1742-6596/1087/2/022017.

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

Bleich, Amnon, Antje Linnemann, Benjamin Jaidi, Björn H. Diem, and Tim O. F. Conrad. "Enhancing Electrocardiogram (ECG) Analysis of Implantable Cardiac Monitor Data: An Efficient Pipeline for Multi-Label Classification." Machine Learning and Knowledge Extraction 5, no. 4 (2023): 1539–56. http://dx.doi.org/10.3390/make5040077.

Full text
Abstract:
Implantable Cardiac Monitor (ICM) devices are demonstrating, as of today, the fastest-growing market for implantable cardiac devices. As such, they are becoming increasingly common in patients for measuring heart electrical activity. ICMs constantly monitor and record a patient’s heart rhythm, and when triggered, send it to a secure server where health care professionals (HCPs) can review it. These devices employ a relatively simplistic rule-based algorithm (due to energy consumption constraints) to make alerts for abnormal heart rhythms. This algorithm is usually parameterized to an over-sensitive mode in order to not miss a case (resulting in a relatively high false-positive rate), and this, combined with the device’s nature of constantly monitoring the heart rhythm and its growing popularity, results in HCPs having to analyze and diagnose an increasingly growing number of data. In order to reduce the load on the latter, automated methods for ECG analysis are nowadays becoming a great tool to assist HCPs in their analysis. While state-of-the-art algorithms are data-driven rather than rule-based, training data for ICMs often consist of specific characteristics that make their analysis unique and particularly challenging. This study presents the challenges and solutions in automatically analyzing ICM data and introduces a method for its classification that outperforms existing methods on such data. It carries this out by combining high-frequency noise detection (which often occurs in ICM data) with a semi-supervised learning pipeline that allows for the re-labeling of training episodes and by using segmentation and dimension-reduction techniques that are robust to morphology variations of the sECG signal (which are typical to ICM data). As a result, it performs better than state-of-the-art techniques on such data with, e.g., an F1 score of 0.51 vs. 0.38 of our baseline state-of-the-art technique in correctly calling atrial fibrillation in ICM data. As such, it could be used in numerous ways, such as aiding HCPs in the analysis of ECGs originating from ICMs by, e.g., suggesting a rhythm type.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "ICM algorithm"

1

Frontera, Antonio. "ICD Algorithms in the management of arrhythmias : Pitfalls and advancements." Thesis, Bordeaux, 2019. http://www.theses.fr/2019BORD0324.

Full text
Abstract:
L'objectif de ma recherche était d'étudier les méthodes de fonctionnement des dispositifs cliniques, tels que les DAI et la PM, pour détecter les arythmies les plus communs rencontrées dans la pratique clinique. Récemment, des algorithmes spécifiques de discrimination sont implémentés dans les dispositifs actuels. Les pièges de la prise en charge des patients souffrant d'arythmie ne sont pas rares. Fréquemment, il s'agit d'érreurs de détection et de discrimination susceptibles de favoriser ou empirer l'arrythmie ou de déterminer des thérapies inappropriées tels que des chocs. En fait, la discrimination incorrecte des arythmies malignes pourrait avoir un impact significatif sur la morbidité et la mortalité. La meilleure gestion des arythmies devrait envisager des améliorations des algorithmes actuels des DAI propriétaires implantés dans la pratique clinique<br>The objective of my research was to investigate the manner in which clinical devices, such as ICDs and PMs, detect the most common arrhythmias encountered in clinical practice. Nowadays, specific algorithms of discrimination are implemented in current devices. The pitfalls in the management of patients with arrhythmias are not uncommon; most often these include errors in detection and discrimination which may promote and/or perpetuate the arrhythmia or determine inappropriate therapies such as shocks. In fact, the incorrect discrimination of malignant arrhythmias could have a significant impact on morbidity and mortality. The best management of arrhythmias should consider improvements of current algorithms of proprietary based ICDs implanted in the clinical practice
APA, Harvard, Vancouver, ISO, and other styles
2

El, Ghouat Mohamed Abdelwafi. "Classification markovienne pyramidale : adaptation de l'algorithme ICM aux images de télédétection." Sherbrooke : Université de Sherbrooke, 1997.

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

McDonald, Andrew James. "An ice-tracking algorithm applied to the North water polynya." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0004/MQ44918.pdf.

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

Ibn, Khedher Hatem. "Optimization and virtualization techniques adapted to networking." Thesis, Evry, Institut national des télécommunications, 2018. http://www.theses.fr/2018TELE0007/document.

Full text
Abstract:
Dans cette thèse, on présente nos travaux sur la virtualisation dans le contexte de la réplication des serveurs de contenu vidéo. Les travaux couvrent la conception d’une architecture de virtualisation pour laquelle on présente aussi plusieurs algorithmes qui peuvent réduire les couts globaux à long terme et améliorer la performance du système. Le travail est divisé en plusieurs parties : les solutions optimales, les solutions heuristiques pour des raisons de passage à l’échelle, l’orchestration des services, l’optimisation multi-objective, la planification de services dans des réseaux actifs et complexes et l'intégration d'algorithmes dans une plate-forme réelle<br>In this thesis, we designed and implemented a tool which performs optimizations that reduce the number of migrations necessary for a delivery task. We present our work on virtualization in the context of replication of video content servers. The work covers the design of a virtualization architecture for which there are also several algorithms that can reduce overall costs and improve system performance. The thesis is divided into several parts: optimal solutions, greedy (heuristic) solutions for reasons of scalability, orchestration of services, multi-objective optimization, service planning in complex active networks, and integration of algorithms in real platform. This thesis is supported by models, implementations and simulations which provide results that showcase our work, quantify the importance of evaluating optimization techniques and analyze the trade-off between reducing operator cost and enhancing end user satisfaction index
APA, Harvard, Vancouver, ISO, and other styles
5

Aydin, Ahmet Tarik. "Orbit selection and EKV guidance for space-based ICBM intercept." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Sep%5FAydin.pdf.

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

Pomerleau, François. "Registration algorithm optimized for simultaneous localization and mapping." Mémoire, Université de Sherbrooke, 2008. http://savoirs.usherbrooke.ca/handle/11143/1465.

Full text
Abstract:
Building maps within an unknown environment while keeping track of the current position is a major step to accomplish safe and autonomous robot navigation. Within the last 20 years, Simultaneous Localization And Mapping (SLAM) became a topic of great interest in robotics. The basic idea of this technique is to combine proprioceptive robot motion information with external environmental information to minimize global positioning errors. Because the robot is moving in its environment, exteroceptive data comes from different points of view and must be expressed in the same coordinate system to be combined. The latter process is called registration. Iterative Closest Point (ICP) is a registration algorithm with very good performances in several 3D model reconstruction applications, and was recently applied to SLAM. However, SLAM has specific needs in terms of real-time and robustness comparatively to 3D model reconstructions, leaving room for specialized robotic mapping optimizations in relation to robot mapping. After reviewing existing SLAM approaches, this thesis introduces a new registration variant called Kd-ICP. This referencing technique iteratively decreases the error between misaligned point clouds without extracting specific environmental features. Results demonstrate that the new rejection technique used to achieve mapping registration is more robust to large initial positioning errors. Experiments with simulated and real environments suggest that Kd-ICP is more robust compared to other ICP variants. Moreover, the Kd-ICP is fast enough for real-time applications and is able to deal with sensor occlusions and partially overlapping maps. Realizing fast and robust local map registrations opens the door to new opportunities in SLAM. It becomes feasible to minimize the cumulation of robot positioning errors, to fuse local environmental information, to reduce memory usage when the robot is revisiting the same location. It is also possible to evaluate network constrains needed to minimize global mapping errors.
APA, Harvard, Vancouver, ISO, and other styles
7

Mulligan, Shaun R. "A Comparison of ICA versus genetic algorithm optimized ICA for use in non-invasive muscle tissue EMG." Master's thesis, University of Cape Town, 2014. http://hdl.handle.net/11427/13149.

Full text
Abstract:
Includes bibliographical references.<br>The patent developed by Dr. L. John [1] allows for the the detection of deep muscle activation through the combination of specially positioned monopolar surface Electromyography (sEMG) electrodes and a Blind Source Separation algorithm. This concept was then proved by Morowasi and John [2] in a 12 electrode prototype system around the bicep. This proof of concept showed that it was possible to extract the deep tissue activity of the brachialis muscle in the upper arm, however, the effect of surface electrode positioning and effectual number of electrodes on signal quality is still unclear. The hope of this research is to extend this work. In this research, a genetic algorithm (GA) is implemented on top of the Fast Independent Component Analysis (FastICA) algorithm to reduce the number of electrodes needed to isolate the activity from all muscles in the upper arm, including deep tissue. The GA selects electrodes based on the amount of significant information they contribute to the ICA solution and by doing so, a reduced electrode set is generated and alternative electrode positions are identified. This allows a near optimal electrode configuration to be produced for each user. The benefits of this approach are: 1.The generalized electrode array and this algorithm can select the near optimal electrode arrangement with very minimal understanding of the underlying anatomy. 2. It can correct for small anatomical differences between test subjects and act as a calibration phase for individuals. As with any design there are also disadvantages, such as each user needs to have the electrode placement specifically customised for him or her and this process needs to be conducted using a higher number of electrodes to begin with.
APA, Harvard, Vancouver, ISO, and other styles
8

Lillrank, Dan. "Registration algorithms formatching laser scans in robotics application." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-234215.

Full text
Abstract:
In this study, we compare different variations of the Iterative ClosestPoint (ICP) algorithm for the purpose of matching laser scans generatedby an indoor robot. The study is mainly focused on investigating maxi-mum difference in the viewpoint the algorithms can handle, and if it canbe used for robot-pose estimation by matching laser scan data generatedat different positions in a home. This study was carried out at Electroluxusing the robotic vacuum cleaner PUREi9 for gathering the dataset tobe used for the comparison.The ICP algorithm and its variations can achieve improved perfor-mance by fine-tuning heuristics and correspondences, which often re-quires substantial manual assistance and the tuning result often varyingcase-by-case. This study limits this fine tuning to standard parametersfor the purpose of comparing standard implementations, and focuses theresult more as a guideline toward what version and format is suitable forour use case.The result confirms the superiority of the Generalized ICP (GICP)version over the other versions compared in this report. The GICP ver-sion performed better for estimating the correct transform for both thetranslation distance and rotational distance between the point clouds.Two data formats were also compared. One with the aim to create adense point cloud and another data format with a more sparse pointcloud. Comparing the result of on these two data formats, we also testedthe implicit assumption of the ICP algorithm that the point cloud have tobe dense for the algorithm to perform well. From the result obtained, weconclude that this implicit assumption does not affect the performanceof the algorithms for our usage.Keywords:, Iterative Closest Point, ICP<br>I den här studien jämför vi de olika variationerna av Iterative closest point- algoritmen för att matcha punkt-molnen genererade av laseravläsningar i olika positioner av en inomhusrobot. Studiens syfte är att undersöka hur stor skillnad i avstånd mellan de två punkt-molnen algoritmerna kan hantera, och om det kan användas för syftet att estimera robotens position genom att matcha laseravläsningar genererade i olika positioner i ett hem. Denna studie utfördes vid Electrolux. Robotdammsugaren PUREi9 av Electrolux användes för att samla datan som användas för jämförelsen.   ICP-algoritmen och dess variation kan uppnå förbättrad prestanda genom finjustering av heuristik och korrespondenser, vilket ofta kräver manuell korrigering och resultatet varierar ofta från fall till fall. Denna studie begränsar finjusteringen till standardparametrar för att jämföra standardimplementeringar och fokuserar på att undersöka vilken version och vilket format som passar vårt användningsfall.   Resultatet bekräftar att Generalized ICP-versionen (GICP) presterar bättre än de andra versionerna som jämfördes i denna rapport. GICP-versionen presterade bättre i att uppskatta den korrekta omvandlingen mellan punktmoln med stora variationer i avstånd och rotation. Genom att jämföra två dataformat, ett punktmoln med hög densitet och det andra ursprungliga (råa) dataformatet med låg densitet testade vi också det implicita antagandet av ICP att punktmoln måste ha hög densitet för att algoritmen ska fungera bra. Av det erhållna resultatet kan vi dra slutsatsen att detta implicita antagande inte påverkar algoritmens prestanda för vår användning.
APA, Harvard, Vancouver, ISO, and other styles
9

Ardam, Nagaraju. "Study of ASA Algorithms." Thesis, Linköpings universitet, Elektroniksystem, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70996.

Full text
Abstract:
Hearing aid devices are used to help people with hearing impairment. The number of people that requires hearingaid devices are possibly constant over the years, however the number of people that now have access to hearing aiddevices increasing rapidly. The hearing aid devices must be small, consume very little power, and be fairly accurate.Even though it is normally more important for the user that hearing impairment look good (are discrete). Once thehearing aid device prescribed to the user, she/he needs to train and adjust the device to compensate for the individualimpairment.We are within the framework of this project researching on hearing aid devices that can be trained by the hearingimpaired person her-/himself. This project is about finding suitable noise cancellation algorithm for the hearing-aiddevice. We consider several types of algorithms like, microphone array signal processing, Independent ComponentAnalysis (ICA) based on double microphone called Blind Source Separation (BSS) and DRNPE algorithm.We run this current and most sophisticated and robust algorithms in certain noise backgrounds like Cocktail noise,street, public places, train, babble situations to test the efficiency. The BSS algorithm was well in some situation andgave average results in some situations. Where one microphone gave steady results in all situations. The output isgood enough to listen targeted audio.The functionality and performance of the proposed algorithm is evaluated with different non-stationary noisebackgrounds. From the performance results it can be concluded that, by using the proposed algorithm we are able toreduce the noise to certain level. SNR, system delay, minimum error and audio perception are the vital parametersconsidered to evaluate the performance of algorithms. Based on these parameters an algorithm is suggested forheairng-aid.<br>Hearing-Aid
APA, Harvard, Vancouver, ISO, and other styles
10

Zamberlan, Pietro. "Quantum software per l'algebra lineare: l'algoritmo HHL e l'IBM quantum experience." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19398/.

Full text
Abstract:
Nei prossimi anni computer quantistici da 50-100 qubit saranno in grado di eseguire compiti che superano le capacita` dei supercomputer classici di oggi, ma fenomeni di rumore nelle porte logiche quantistiche limiteranno la grandezza dei circuiti che si potranno eseguire in maniera affidabile. Attraverso questo tipo di tecnologia sarà possibile svolgere algoritmi nuovi, o già classicamente noti, in maniera più efficiente rispetto ai computer odierni. Ne sono un esempio l’algoritmo di Shor per la fattorizzazione in numeri primi o l’algoritmo di Grover per la ricerca in un database non ordinato. In questa tesi si discute dell’algoritmo HHL (dai propositori: Harrow, Hassidim e Lloyd) per la risoluzione di un sistema lineare, studiando l’algoritmo completo, e le subroutine che lo compongono, sia su simulatori classici che su veri processori quantistici messi a disposizione da IBM Quantum Experience. Se ne ricava che per il caso di una matrice 2 × 2, opportunamente scelta, l’algoritmo restituisce la corretta soluzione con un alto grado di precisione sui simulatori classici (raggiungendo una fidelity del 99%) ma con una più bassa accuratezza sui qubit reali (fidelity del 84%).
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "ICM algorithm"

1

Flerov, I͡U A. SAPR sistem realʹnogo vremeni dli͡a IBM PC. Vychislitelʹnyĭ t͡sentr RAN, 1993.

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

Comiso, Josefino C. SSM/I sea ice concentrations using the Bootstrap algorithm. NationalAeronautics and Space Administration, 1995.

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

Comiso, Josefino C. SSM/I sea ice concentrations using the bootstrap algorithm. National Aeronautics and Space Administration, Goddard Space Flight Center, 1995.

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

Kapralski, Adam. Macierze binarne, ich zastosowania oraz przetwarzanie szeregowe i równoległe w dedykowanych procesorach. Politechnika Krakowska, 1989.

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

Cavalieri, Donald J. EOS Aqua AMSR-E Sea Ice Validation Program: Meltpond2000 flight report. National Aeronautics and Space Administration, Goddard Space Flight Center, 2000.

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

Flight, Goddard Space, ed. EOS Aqua AMSR-E Sea Ice Validation Program: Meltpond2000 flight report. National Aeronautics and Space Administration, Goddard Space Flight Center, 2000.

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

Flight, Goddard Space, ed. EOS Aqua AMSR-E Sea Ice Validation Program: Meltpond2000 flight report. National Aeronautics and Space Administration, Goddard Space Flight Center, 2000.

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

Jozef, Mikloško, and Ústav technickej kibernetiky SAV, eds. Rýchle algoritmy: A ich realizácia na špecializovaných počítačoch. Veda, 1985.

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

Bennane, Aomar. A TMS320/IBM PC coprocessor system for digital signal processing algorithms. University of Birmingham, 1987.

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

A, Maslanik James, Steffen Konrad, and United States. National Aeronautics and Space Administration., eds. Ice surface retrieval from AVHRR, ATSR and passive microwave satellite data: Algorithm development and application, NAGW-3437, year 2 annual report. National Aeronautics and Space Administration, 1995.

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

Book chapters on the topic "ICM algorithm"

1

Mukaidani, Hiroaki, Tetsu Shimomura, and Hua Xu. "Numerical Algorithm for Solving Cross-Coupled Multiparameter Algebraic Riccati Equations of Multimodeling Systems Related to Nash Games." In ICM Millennium Lectures on Games. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-662-05219-8_23.

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

Wang, Qin. "Intelligent College Management (ICM) and Evaluation Information System (IS) Based on ANN Algorithm." In Proceedings of the 3rd International Conference on Internet, Education and Information Technology (IEIT 2023). Atlantis Press International BV, 2023. http://dx.doi.org/10.2991/978-94-6463-230-9_162.

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

Zimmer, Wolf. "Ich twittere, also bin ich." In Ansturm der Algorithmen. Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-59771-2_3.

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

Dahal, Pragyan, Stefano Arrigoni, Mario Bijelic, and Francesco Braghin. "MLIO: Multiple LiDARs and Inertial Odometry." In Lecture Notes in Mechanical Engineering. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-70392-8_118.

Full text
Abstract:
AbstractWith the decreasing cost of LiDAR sensors, sensor setups with multiple LiDARs are becoming available. In such advanced setups with multiple LiDARs the sensor temporal asynchronicity and spatial miscalibration are critical factors for vehicle localization increasing measurement uncertainty. Hence, simple merging of synchronized point clouds as done in some literature can lead to sub-optimal results. To tackle this problem we propose MLIO, a factor graph-based odometry computation algorithm that fuses multiple LiDARs with an inertial measurement unit (IMU) and provides an accurate solution mitigating the effect of temporal asynchronisity and spatial miscalibration.The proposed algorithm is validated using a custom dataset. We compare the proposed algorithm with the state-of-the-art LiDAR-only odometry algorithms, such as KISS-ICP, and LiDAR-IMU fusion LIO-SAM and demonstrate its superiority. We were able to achieve up to 40% and 16% increment in positional and orientation accuracy compared to KISS-ICP and 25% increment in positional accuracy compared to LIO-SAM.
APA, Harvard, Vancouver, ISO, and other styles
5

Górriz, Juan Manuel, Carlos García Puntonet, Angel Manuel Gómez, and Oscar Pernía. "Guided GA-ICA Algorithms." In Advances in Neural Networks — ISNN 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11427391_151.

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

Li, Xue, Xiaolei Zhang, and Zhixin Sun. "Improved Collaborative Filtering Algorithm (ICF)." In Intelligent Computing Methodologies. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42297-8_55.

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

Abali, Bülent, and Cevdet Aykanat. "Routing algorithms for IBM SP1." In Parallel Computer Routing and Communication. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58429-3_35.

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

Wang, Gang, Ni-ni Rao, Zhi-lin Zhang, Quanyi Mo, and Pu Wang. "An Extended Online Fast-ICA Algorithm." In Advances in Neural Networks - ISNN 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11759966_163.

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

Kang, Ye, Shanshan Wang, Xiaoyan Liu, Hokyin Lai, Huaiqing Wang, and Baiqi Miao. "An ICA-Based Multivariate Discretization Algorithm." In Knowledge Science, Engineering and Management. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11811220_47.

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

Theis, Fabian J., Elmar W. Lang, Tobias Westenhuber, and Carlos G. Puntonet. "Overcomplete ICA with a Geometric Algorithm." In Artificial Neural Networks — ICANN 2002. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-46084-5_170.

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

Conference papers on the topic "ICM algorithm"

1

You, Fei, Manlin Lu, Yahao Song, et al. "A Low-Power ABR Characteristic Waveform Automatic Detection Algorithm Design and FPGA Implementation." In 2024 International Conference on Microelectronics (ICM). IEEE, 2024. https://doi.org/10.1109/icm63406.2024.10815903.

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

Heydrich, Marius, Tim Hammer, Thomas Mitsching, and Valentin Ivanov. "A New Method for One-Pedal Driving With Fuzzy-Based Efficiency-Optimization Algorithm." In 2025 IEEE International Conference on Mechatronics (ICM). IEEE, 2025. https://doi.org/10.1109/icm62621.2025.10934834.

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

Napawan, Yotsathorn, Xiangxian Zeng, and Chin-Hsing Kuo. "Position and Orientation Estimation in Magnetic Tracking Using Weighted Coefficients Combined with Monte Carlo Algorithm." In 2025 IEEE International Conference on Mechatronics (ICM). IEEE, 2025. https://doi.org/10.1109/icm62621.2025.10934921.

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

Khelifi, Lazhar, and Max Mignotte. "Semantic image segmentation using the ICM algorithm." In 2017 IEEE International Conference on Image Processing (ICIP). IEEE, 2017. http://dx.doi.org/10.1109/icip.2017.8296849.

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

Martins, A. L. D., M. R. P. Homem, and N. D. A. Mascarenhas. "Super-Resolution Image Reconstruction using the ICM Algorithm." In 2007 IEEE International Conference on Image Processing. IEEE, 2007. http://dx.doi.org/10.1109/icip.2007.4379990.

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

Ping, Xiao, and Zho Zhiheng. "Fuzzy de-blocking algorithm based on ICM filter." In 2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (FSKD). IEEE, 2010. http://dx.doi.org/10.1109/fskd.2010.5569558.

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

Guangshun Li, Junhua Wu, Baogui Huang, and Guangsheng Ma. "A time constrained scheduling method based on dynamic combination of genetic algorithm and ant algorithm." In 2007 International Conference on Microelectronics - ICM. IEEE, 2007. http://dx.doi.org/10.1109/icm.2007.4497675.

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

Sabreen, Abdel-Malik M., Adel A. Samir, Lojaine A. ElMahdy, et al. "Seizure Detection Using Gilbert’s Algorithm." In 2018 30th International Conference on Microelectronics (ICM). IEEE, 2018. http://dx.doi.org/10.1109/icm.2018.8704083.

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

Athow, Jacques L., and Asim J. Al-Khalili. "Placement algorithm for multiplier-based FPGA circuits." In 2008 International Conference on Microelectronics - ICM. IEEE, 2008. http://dx.doi.org/10.1109/icm.2008.5393533.

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

Wei, Zengju, and Ye Zhang. "A Channel Estimation Algorithm Based on Decision-Directed Algorithm." In 2011 International Conference on Information Technology, Computer Engineering and Management Sciences (ICM). IEEE, 2011. http://dx.doi.org/10.1109/icm.2011.283.

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

Reports on the topic "ICM algorithm"

1

Glendinning, R. H. An Evaluation of the ICM (Iterated Conditional Modes) Algorithm for Image Reconstruction. Defense Technical Information Center, 1987. http://dx.doi.org/10.21236/ada196141.

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

Chapman, Ray, Phu Luong, Sung-Chan Kim, and Earl Hayter. Development of three-dimensional wetting and drying algorithm for the Geophysical Scale Transport Multi-Block Hydrodynamic Sediment and Water Quality Transport Modeling System (GSMB). Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/41085.

Full text
Abstract:
The Environmental Laboratory (EL) and the Coastal and Hydraulics Laboratory (CHL) have jointly completed a number of large-scale hydrodynamic, sediment and water quality transport studies. EL and CHL have successfully executed these studies utilizing the Geophysical Scale Transport Modeling System (GSMB). The model framework of GSMB is composed of multiple process models as shown in Figure 1. Figure 1 shows that the United States Army Corps of Engineers (USACE) accepted wave, hydrodynamic, sediment and water quality transport models are directly and indirectly linked within the GSMB framework. The components of GSMB are the two-dimensional (2D) deep-water wave action model (WAM) (Komen et al. 1994, Jensen et al. 2012), data from meteorological model (MET) (e.g., Saha et al. 2010 - http://journals.ametsoc.org/doi/pdf/10.1175/2010BAMS3001.1), shallow water wave models (STWAVE) (Smith et al. 1999), Coastal Modeling System wave (CMS-WAVE) (Lin et al. 2008), the large-scale, unstructured two-dimensional Advanced Circulation (2D ADCIRC) hydrodynamic model (http://www.adcirc.org), and the regional scale models, Curvilinear Hydrodynamics in three dimensions-Multi-Block (CH3D-MB) (Luong and Chapman 2009), which is the multi-block (MB) version of Curvilinear Hydrodynamics in three-dimensions-Waterways Experiments Station (CH3D-WES) (Chapman et al. 1996, Chapman et al. 2009), MB CH3D-SEDZLJ sediment transport model (Hayter et al. 2012), and CE-QUAL Management - ICM water quality model (Bunch et al. 2003, Cerco and Cole 1994). Task 1 of the DOER project, “Modeling Transport in Wetting/Drying and Vegetated Regions,” is to implement and test three-dimensional (3D) wetting and drying (W/D) within GSMB. This technical note describes the methods and results of Task 1. The original W/D routines were restricted to a single vertical layer or depth-averaged simulations. In order to retain the required 3D or multi-layer capability of MB-CH3D, a multi-block version with variable block layers was developed (Chapman and Luong 2009). This approach requires a combination of grid decomposition, MB, and Message Passing Interface (MPI) communication (Snir et al. 1998). The MB single layer W/D has demonstrated itself as an effective tool in hyper-tide environments, such as Cook Inlet, Alaska (Hayter et al. 2012). The code modifications, implementation, and testing of a fully 3D W/D are described in the following sections of this technical note.
APA, Harvard, Vancouver, ISO, and other styles
3

Li, X., C. Bao, and F. Baker. IP/ICMP Translation Algorithm. RFC Editor, 2011. http://dx.doi.org/10.17487/rfc6145.

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

Bao, C., X. Li, F. Baker, T. Anderson, and F. Gont. IP/ICMP Translation Algorithm. RFC Editor, 2016. http://dx.doi.org/10.17487/rfc7915.

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

Nordmark, E. Stateless IP/ICMP Translation Algorithm (SIIT). RFC Editor, 2000. http://dx.doi.org/10.17487/rfc2765.

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

Matus, Sean, and Daniel Gambill. Automation of gridded HEC-HMS model development using Python : initial condition testing and calibration applications. Engineer Research and Development Center (U.S.), 2022. http://dx.doi.org/10.21079/11681/46126.

Full text
Abstract:
The US Army Corps of Engineers’s (USACE) Hydrologic Engineering Center-Hydrologic Modeling System (HEC-HMS) rainfall-runoff model is widely used within the research community to develop both event-based and continuous rainfall-runoff models. The soil moisture accounting (SMA) algorithm is commonly used for long-term simulations. Depending on the final model setup, 12 to 18 parameters are needed to characterize the modeled watershed’s canopy, surface, soil, and routing processes, all of which are potential calibration parameters. HEC-HMS includes optimization tools to facilitate model calibration, but only initial conditions (ICs) can be calibrated when using the gridded SMA algorithm. Calibrating a continuous SMA HEC-HMS model is an iterative process that can require hundreds of simulations, a time intensive process requiring automation. HEC-HMS is written in Java and is predominantly run through a graphical user interface (GUI). As such, conducting a long-term gridded SMA calibration is infeasible using the GUI. USACE Construction Engineering Research Laboratory (CERL) has written a workflow that utilizes the existing Jython application programming interface (API) to batch run HEC-HMS simulations with Python. The workflow allows for gridded SMA HEC-HMS model sensitivity and calibration analyses to be conducted in a timely manner.
APA, Harvard, Vancouver, ISO, and other styles
7

Hajj, Ramez, Marshall Thompson, Renan Santos Maia, et al. Updates to Mechanistic-Empirical Design Inputs for Illinois Flexible Pavements. Illinois Center for Transportation, 2024. http://dx.doi.org/10.36501/0197-9191/24-010.

Full text
Abstract:
This study reviews the Illinois Department of Transportation’s full-depth asphalt, limiting strain criterion, and asphalt over rubblized concrete design procedures, considering technological advancements in hot-mix asphalt—namely, the increased use of recycled materials and modified asphalt binders. The researchers evaluated the current |E*| algorithm by conducting laboratory tests with four mix designs and seven asphalt binders of different Superpave performance grades. They compared predictive models, including the current Illinois modulus algorithm as well as the Witczak, Hirsch, and newly developed Illinois Center for Transportation (ICT) Bayesian neural network (BNN) models. The ultrasonic pulse velocity (UPV) nondestructive test for modulus and field modulus measurements was evaluated as well. Subsequent tasks involved reviewing current fatigue endurance limit (FEL) criteria from an adapted protocol for the four-point bending beam fatigue test. This study found that typical hot-mix asphalt modulus values in Illinois are underestimated compared to modern mixes, suggesting potential savings by allowing an increased modulus value to be used, reducing layer thickness design. Low-temperature performance grades significantly influenced modulus, and the developed ICT BNN predictive model outperformed traditional ones. While UPV was promising for modulus screening, challenges related to material properties assumptions were identified. The current stage of research on assessing modern mixes’ FEL reveals the complexity of observing FEL using simplified methods. To advance this objective, a concept of acceptable stiffness ratio (SR) is introduced. In these cases, exceptionally long fatigue life would be obtained for mixes that demonstrate an acceptable drop in SR within 10,000 cycles, with no apparent evolution of the damage state. The most conservative estimation of strain level that would result in acceptable SR aligned with IDOT’s current 70 microstrain FEL criteria. On the less conservative side, allowing a 10% drop in SR within 10,000 loading cycles could increase the acceptable SR &lt; 1 strain level as high as approximately 180 microstrain, with caution needed regarding evolving mobility trends and environmental stressors including the changing climate.
APA, Harvard, Vancouver, ISO, and other styles
8

Witzig, Andreas, Camilo Tello, Franziska Schranz, Johannes Bruderer, and Matthias Haase. Quantifying energy-saving measures in office buildings by simulation in 2D cross sections. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541623658.

Full text
Abstract:
A methodology is presented to analyse the thermal behaviour of buildings with the goal to quantify energy saving measures. The solid structure of the building is modelled with finite elements to fully account for its ability to store energy and to accurately predict heat loss through thermal bridges. Air flow in the rooms is approximated by a lumped element model with three dynamical nodes per room. The dynamic model also contains the control algorithm for the HVAC system and predicts the net primary energy consumption for heating and cooling of the building for any time period. The new simulation scheme has the advantage to avoid U-values and thermal bridge coefficients and instead use well-known physical material parameters. It has the potential to use 2D and 3D geometries with appropriate automatic processing from BIM models. Simulations are validated by comparison to IDA ICE and temperature measurement. This work aims to discuss novel approaches to disseminating building simulation more widely.
APA, Harvard, Vancouver, ISO, and other styles
9

Lever, James, Allan Delaney, Laura Ray, E. Trautman, Lynette Barna, and Amy Burzynski. Autonomous GPR surveys using the polar rover Yeti. Engineer Research and Development Center (U.S.), 2022. http://dx.doi.org/10.21079/11681/43600.

Full text
Abstract:
The National Science Foundation operates stations on the ice sheets of Antarctica and Greenland to investigate Earth’s climate history, life in extreme environments, and the evolution of the cosmos. Understandably, logistics costs predominate budgets due to the remote locations and harsh environments involved. Currently, manual ground-penetrating radar (GPR) surveys must preceed vehicle travel across polar ice sheets to detect subsurface crevasses or other voids. This exposes the crew to the risks of undetected hazards. We have developed an autonomous rover, Yeti, specifically to conduct GPR surveys across polar ice sheets. It is a simple four-wheel-drive, battery-powered vehicle that executes autonomous surveys via GPS waypoint following. We describe here three recent Yeti deployments, two in Antarctica and one in Greenland. Our key objective was to demonstrate the operational value of a rover to locate subsurface hazards. Yeti operated reliably at −30 ◦C, and it has good oversnow mobility and adequate GPS accuracy for waypoint-following and hazard georeferencing. It has acquired data on hundreds of crevasse encounters to improve our understanding of heavily crevassed traverse routes and to develop automated crevasse-detection algorithms. Importantly, it helped to locate a previously undetected buried building at the South Pole. Yeti can improve safety by decoupling survey personnel from the consequences of undetected hazards. It also enables higher-quality systematic surveys to improve hazard-detection probabilities, increase assessment confidence, and build datasets to understand the evolution of these regions. Yeti has demonstrated that autonomous vehicles have great potential to improve the safety and efficiency of polar logistics.
APA, Harvard, Vancouver, ISO, and other styles
10

Olivier, Jason, and Sally Shoop. Imagery classification for autonomous ground vehicle mobility in cold weather environments. Engineer Research and Development Center (U.S.), 2021. http://dx.doi.org/10.21079/11681/42425.

Full text
Abstract:
Autonomous ground vehicle (AGV) research for military applications is important for developing ways to remove soldiers from harm’s way. Current AGV research tends toward operations in warm climates and this leaves the vehicle at risk of failing in cold climates. To ensure AGVs can fulfill a military vehicle’s role of being able to operate on- or off-road in all conditions, consideration needs to be given to terrain of all types to inform the on-board machine learning algorithms. This research aims to correlate real-time vehicle performance data with snow and ice surfaces derived from multispectral imagery with the goal of aiding in the development of a truly all-terrain AGV. Using the image data that correlated most closely to vehicle performance the images were classified into terrain units of most interest to mobility. The best image classification results were obtained when using Short Wave InfraRed (SWIR) band values and a supervised classification scheme, resulting in over 95% accuracy.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'ICM algorithm' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography