Auswahl der wissenschaftlichen Literatur zum Thema „High performances calculus“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "High performances calculus" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "High performances calculus"
Nicola, Marcel, und Claudiu-Ionel Nicola. „Sensorless Fractional Order Control of PMSM Based on Synergetic and Sliding Mode Controllers“. Electronics 9, Nr. 9 (11.09.2020): 1494. http://dx.doi.org/10.3390/electronics9091494.
Der volle Inhalt der QuelleBârsan, Ghiţă, Silviu Mihai Petrişor und Luminiţa Giurgiu. „Validation of the Mathematical and Numerical Models for Artillery Barrels Autofrettage Based on Hydrostatic Procedure“. Applied Mechanics and Materials 186 (Juni 2012): 58–69. http://dx.doi.org/10.4028/www.scientific.net/amm.186.58.
Der volle Inhalt der QuelleTenreiro Machado, José A., und António M. Lopes. „Fractional-order kinematic analysis of biomechanical inspired manipulators“. Journal of Vibration and Control 26, Nr. 1-2 (16.10.2019): 102–11. http://dx.doi.org/10.1177/1077546319877703.
Der volle Inhalt der QuelleWang, Jin, Xiancong Wu, Qiang Li und Jian Zhao. „First Order Plus Dead Time (FOPDT) Model Approximation and Proportional-Integral-Derivative Controllers Tuning for Multi-Volume Process“. Journal of Nanoelectronics and Optoelectronics 17, Nr. 3 (01.03.2022): 474–88. http://dx.doi.org/10.1166/jno.2022.3223.
Der volle Inhalt der QuelleWang, Jin, Xiancong Wu, Qiang Li und Jian Zhao. „First Order Plus Dead Time Model Approximation and Proportional-Integral-Derivative Controllers Tuning for Multi-Volume Process“. Journal of Nanoelectronics and Optoelectronics 17, Nr. 5 (01.05.2022): 794–808. http://dx.doi.org/10.1166/jno.2022.3253.
Der volle Inhalt der QuelleNiederle, Muriel, und Lise Vesterlund. „Explaining the Gender Gap in Math Test Scores: The Role of Competition“. Journal of Economic Perspectives 24, Nr. 2 (01.05.2010): 129–44. http://dx.doi.org/10.1257/jep.24.2.129.
Der volle Inhalt der QuelleChiu, Singa Wang, Liang-Wei You, Tsu-Ming Yeh und Tiffany Chiu. „The Collective Influence of Component Commonality, Adjustable-Rate, Postponement, and Rework on Multi-Item Manufacturing Decision“. Mathematics 8, Nr. 9 (11.09.2020): 1570. http://dx.doi.org/10.3390/math8091570.
Der volle Inhalt der QuellePadernal, Rogie E., und Crispina V. Diego. „Academic Performance of Senior High School Students in Pre-Calculus“. Philippine Social Science Journal 3, Nr. 2 (12.11.2020): 69–70. http://dx.doi.org/10.52006/main.v3i2.185.
Der volle Inhalt der QuelleKing, Nancy T. „Calculus & Technology: Calculus Reform for High School Teachers“. Journal of Educational Technology Systems 23, Nr. 2 (Dezember 1994): 183–95. http://dx.doi.org/10.2190/5q4b-p4db-m7n8-rxw3.
Der volle Inhalt der QuelleSadler, Philip, und Gerhard Sonnert. „The Path to College Calculus: The Impact of High School Mathematics Coursework“. Journal for Research in Mathematics Education 49, Nr. 3 (Mai 2018): 292–329. http://dx.doi.org/10.5951/jresematheduc.49.3.0292.
Der volle Inhalt der QuelleDissertationen zum Thema "High performances calculus"
Jerad, Sadok. „Approches du second ordre de d'ordre élevées pour l'optimisation nonconvex avec variantes sans évaluation de la fonction objective“. Electronic Thesis or Diss., Université de Toulouse (2023-....), 2024. http://www.theses.fr/2024TLSEP024.
Der volle Inhalt der QuelleEven though nonlinear optimization seems (a priori) to be a mature field, new minimization schemes are proposed or rediscovered for modern large-scale problems. As an example and in retrospect of the last decade, we have seen a surge of first-order methods with different analysis, despite the fact that well-known theoretical limitations of the previous methods have been thoroughly discussed.This thesis explores two main lines of research in the field of nonconvex optimization with a narrow focus on second and higher order methods.In the first series, we focus on algorithms that do not compute function values and operate without knowledge of any parameters, as the most popular currently used first-order methods fall into the latter category. We start by redefining the well-known Adagrad algorithm in a trust-region framework and use the latter paradigm to study two first-order deterministic OFFO (Objective-Free Function Optimization) classes. To enable faster exact OFFO algorithms, we then propose a pth-order deterministic adaptive regularization method that avoids the computation of function values. This approach recovers the well-known convergence rate of the standard framework when searching for stationary points, while using significantly less information.In the second set of papers, we analyze adaptive algorithms in the more classical framework where function values are used to adapt parameters. We extend adaptive regularization methods to a specific class of Banach spaces by developing a Hölder gradient descent algorithm. In addition, we investigate a second-order algorithm that alternates between negative curvature and Newton steps with a near-optimal convergence rate. To handle large problems, we propose subspace versions of the algorithm that show promising numerical performance.Overall, this research covers a wide range of optimization techniques and provides valuable insights and contributions to both parameter-free and adaptive optimization algorithms for nonconvex functions. It also opens the door for subsequent theoretical developments and the introduction of faster numerical algorithms
Peretti, Pezzi Guilherme. „High performance hydraulic simulations on the grid using Java and ProActive“. Nice, 2011. http://www.theses.fr/2011NICE4118.
Der volle Inhalt der QuelleL’optimisation de la distribution de l’eau est un enjeu crucial qui a déjà été ciblé par de nombreux outils de modélisation. Des modèles utiles, implémentés il y a des décennies, ont besoin d’évoluer vers des formalismes et des environnements informatiques plus récents. Cette thèse présente la refonte d’un ancien logiciel de simulation hydraulique (IRMA) écrit en FORTRAN, qui a été utilisé depuis plus de 30 ans par la Société du Canal de Provence, afin de concevoir et maintenir les réseaux de distribution d’eau. IRMA a été développé visant principalement pour le traitement des réseaux d’irrigation – en utilisant le modèle probabiliste d’estimation de la demande de Clément – et il permet aujourd’hui de gérer plus de 6000 km de réseaux d’eau sous pression. L’augmentation de la complexité et de la taille des réseaux met en évidence le besoin de moderniser IRMA et de le réécrire dans un langage plus actuel (Java). Cette thèse présente le modèle de simulation implémenté dans IRMA, y compris les équations de perte de charge, les méthodes de linéarisation, les algorithmes d’analyse de la topologie, la modélisation des équipements et la construction du système linéaire. Quelques nouveaux types de simulation sont présentés : la demande en pointe avec une estimation probabiliste de la consommation (débit de Clément), le dimensionnement de pompe (caractéristiques indicées), l’optimisation des diamètres des tuyaux, et la variation de consommation en fonction de la pression. La nouvelle solution adoptée pour résoudre le système linéaire est décrite et une comparaison avec les solveurs existant en Java est présentée. La validation des résultats est réalisée d’abord avec une comparaison avec une comparaison entre les résultats obtenus avec l’ancienne version FORTRAN et la nouvelle solution, pour tous les réseaux maintenus par la Société du Canal de Provence. Une deuxième validation est effectuée en comparant des résultats obtenus à partir d’un outil de simulation standard et bien connu (EPANET). Concernant les performances de la nouvelle solution, des mesures séquentielles de temps sont présentées afin de les comparer avec l’ancienne version FORTRAN. Enfin, deux cas d’utilisation sont présentés afin de démontrer la capacité d’exécuter des simulations distribuées dans une infrastructure de grille, utilisant la solution ProActive. La nouvelle solution a déjà été déployée dans un environnement de production et démontre clairement son efficacité avec une réduction significative du temps de calcul, une amélioration de la qualité des résultats et une intégration facilitée dans le système d’information de la Société du Canal de Provence, notamment la base de données spatiales
Bondouy, Manon. „Construction de modèles réduits pour le calcul des performances des avions“. Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30027/document.
Der volle Inhalt der QuelleThe objective of this thesis is to provide a methodology and the associated tools in order to standardize the building process of performance and handling quality models. This typically leads to elaborate surrogate models in order to satisfy industrial contrasting objectives of memory size, accuracy and computation time. After listing the different steps of a construction of surrogates methodology and realizing a critical state of the art, Neural Networks and High Dimensional Model Representation methods have been selected and validated on low dimension functions. For functions of higher dimension, a reduction method based on the optimal selection of submodel surrogates has been developed which allows to satisfy the requirements on accuracy, computation time and memory size. The efficiency of this method has been demonstrated on an aircraft performance model which will be embedded into the avionic systems
Pawlowski, Filip igor. „High-performance dense tensor and sparse matrix kernels for machine learning“. Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN081.
Der volle Inhalt der QuelleIn this thesis, we develop high performance algorithms for certain computations involving dense tensors and sparse matrices. We address kernel operations that are useful for machine learning tasks, such as inference with deep neural networks (DNNs). We develop data structures and techniques to reduce memory use, to improve data locality and hence to improve cache reuse of the kernel operations. We design both sequential and shared-memory parallel algorithms. In the first part of the thesis we focus on dense tensors kernels. Tensor kernels include the tensor--vector multiplication (TVM), tensor--matrix multiplication (TMM), and tensor--tensor multiplication (TTM). Among these, TVM is the most bandwidth-bound and constitutes a building block for many algorithms. We focus on this operation and develop a data structure and sequential and parallel algorithms for it. We propose a novel data structure which stores the tensor as blocks, which are ordered using the space-filling curve known as the Morton curve (or Z-curve). The key idea consists of dividing the tensor into blocks small enough to fit cache, and storing them according to the Morton order, while keeping a simple, multi-dimensional order on the individual elements within them. Thus, high performance BLAS routines can be used as microkernels for each block. We evaluate our techniques on a set of experiments. The results not only demonstrate superior performance of the proposed approach over the state-of-the-art variants by up to 18%, but also show that the proposed approach induces 71% less sample standard deviation for the TVM across the d possible modes. Finally, we show that our data structure naturally expands to other tensor kernels by demonstrating that it yields up to 38% higher performance for the higher-order power method. Finally, we investigate shared-memory parallel TVM algorithms which use the proposed data structure. Several alternative parallel algorithms were characterized theoretically and implemented using OpenMP to compare them experimentally. Our results on up to 8 socket systems show near peak performance for the proposed algorithm for 2, 3, 4, and 5-dimensional tensors. In the second part of the thesis, we explore the sparse computations in neural networks focusing on the high-performance sparse deep inference problem. The sparse DNN inference is the task of using sparse DNN networks to classify a batch of data elements forming, in our case, a sparse feature matrix. The performance of sparse inference hinges on efficient parallelization of the sparse matrix--sparse matrix multiplication (SpGEMM) repeated for each layer in the inference function. We first characterize efficient sequential SpGEMM algorithms for our use case. We then introduce the model-parallel inference, which uses a two-dimensional partitioning of the weight matrices obtained using the hypergraph partitioning software. The model-parallel variant uses barriers to synchronize at layers. Finally, we introduce tiling model-parallel and tiling hybrid algorithms, which increase cache reuse between the layers, and use a weak synchronization module to hide load imbalance and synchronization costs. We evaluate our techniques on the large network data from the IEEE HPEC 2019 Graph Challenge on shared-memory systems and report up to 2x times speed-up versus the baseline
Cohet, Romain. „Transport des rayons cosmiques en turbulence magnétohydrodynamique“. Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS051/document.
Der volle Inhalt der QuelleIn this thesis, we study the transport properties of high energy charged particles in turbulent electromagnetic fields.These fields were generated by using the magnetohydrodynamic (MHD) code RAMSES, which solve the compressible ideal MHD equations. We have developed a module for generating the MHD turbulence, by using a large scale forcing technique. The MHD equations induce a cascading of the energy from large scales to small ones, developing an energy spectrum which follows a power law, called the inertial range.We have developed a module for computing the charged particle trajectories once the turbulent spectrum is established. By injecting the particles to energy such as the inverse of the particle Larmor radius corresponds to a mode in the inertial range of the Fourier spectrum, we have highlighted systematic effects related to the power law spectrum. This method showed that the mean free path is independent of the particules energy until the Larmor radius takes values close to the turbulence coherence scale. The dependence of the mean free path with the alfvénic Mach number produced a power law.We have also developed a technique to measure the anisotropy effect of the MHD turbulence in the cosmic rays transport properties through the calculation of local magnetic fields. This study has shown an effect on the pitch angle scattering coefficient, which confirmed the assumption that the particles are more sensitive to changes in small scales fluctuations
Applencourt, Thomas. „Calcul haute performance & chimie quantique“. Thesis, Toulouse 3, 2015. http://www.theses.fr/2015TOU30162/document.
Der volle Inhalt der QuelleThis thesis work has two main objectives: 1. To develop and apply original electronic structure methods for quantum chemistry 2. To implement several computational strategies to achieve efficient large-scale computer simulations. In the first part, both the Configuration Interaction (CI) and the Quantum Monte Carlo (QMC) methods used in this work for calculating quantum properties are presented. We then describe more specifically the selected CI approach (so-called CIPSI approach, Configuration Interaction using a Perturbative Selection done Iteratively) that we used for building trial wavefunctions for QMC simulations. As a first application, we present the QMC calculation of the total non-relativistic energies of transition metal atoms of the 3d series. This work, which has required the implementation of Slater type basis functions in our codes, has led to the best values ever published for these atoms. We then present our original implementation of the pseudo-potentials for QMC and discuss the calculation of atomization energies for a benchmark set of 55 organic molecules. The second part is devoted to the Hight Performance Computing (HPC) aspects. The objective is to make possible and/or facilitate the deployment of very large-scale simulations. From the point of view of the developer it includes: The use of original programming paradigms, single-core optimization process, massively parallel calculations on grids (supercomputer and Cloud), development of collaborative tools , etc - and from the user's point of view: Improved code installation, management of the input/output parameters, GUI, interfacing with other codes, etc
Lagardère, Louis. „Calcul haute-performance et dynamique moléculaire polarisable“. Thesis, Paris 6, 2017. http://www.theses.fr/2017PA066042.
Der volle Inhalt der QuelleThis works is at the interface between theoretical chemistry, scientific computing and applied mathematics. We study different algorithms used to solve the specific equations that arise in polarizable molecular dynamics in a massively parallel context. This family of models requires indeed to solve more complex equations than in the classical case making the use of supercomputers mandatory in order to get significant results. We will more specifically study different types of boundary conditions that represent different ways to model solvation effects : first the Particle Mesh Ewald method to treat periodic boundary conditions and then a continuum solvation model discretized within a domain decomposition strategy : the ddCOSMO. The outline of this thesis is as follows : first, the different parallel strategies in the general context of molecular dynamics are reviewed. Then several methods to adapt these strategies to the specific case of polarizable force fields are presented. After that, strategies that allow to circumvent certain limits due to the use of iterative methods in the context of polarizable molecular dynamics are presented and studied. Then, the adapation of these methods to different cases of boundary conditions is presented : first in the case of the Particle Mesh Ewald method to treat periodic boundary conditions and then in the case of a particular continuum solvation model discretized with a domain decomposition strategy : the ddCOSMO. Finally, various numerical results and applications are presented
Guilloteau, Quentin. „Une approche autonomique à la régulation en ligne de systèmes HPC, avec un support pour la reproductibilité des expériences“. Electronic Thesis or Diss., Université Grenoble Alpes, 2023. http://www.theses.fr/2023GRALM075.
Der volle Inhalt der QuelleHigh-Performance Computing (HPC) systems have become increasingly more complex, and their performance and power consumption make them less predictable.This unpredictability requires cautious runtime management to guarantee an acceptable Quality-of-Service to the end users.Such a regulation problem arises in the context of the computing grid middleware CiGri that aims at harvesting the idle computing resources of a set of cluster by injection low priority jobs.A too aggressive harvesting strategy can lead to the degradation of the performance for all the users of the clusters, while a too shy harvesting will leave resources idle and thus lose computing power.There is thus a tradeoff between the amount of resources that can be harvested and the resulting degradation of users jobs, which can evolve at runtime based on Service Level Agreements and the current load of the system.We claim that such regulation challenges can be addressed with tools from Autonomic Computing, and in particular when coupled with Control Theory.This thesis investigates several regulation problems in the context of CiGri with such tools.We will focus on regulating the harvesting based on the load of a shared distributed file-system, and improving the overall usage of the computing resources.We will also evaluate and compare the reusability of the proposed control-based solutions in the context of HPC systems.The experiments done in this thesis also led us to investigate new tools and techniques to improve the cost and reproducibility of the experiments.We will present a tool named NixOS-Compose able to generate and deploy reproducible distributed software environments.We will also investigate techniques to reduce the number of machines needed to deploy experiments on grid or cluster middlewares, such as CiGri, while ensuring an acceptable level of realism for the final deployed system
Jolivet, Pierre. „Méthodes de décomposition de domaine. Application au calcul haute performance“. Thesis, Grenoble, 2014. http://www.theses.fr/2014GRENM040/document.
Der volle Inhalt der QuelleThis thesis introduces a unified framework for various domain decomposition methods:those with overlap, so-called Schwarz methods, and those based on Schur complements,so-called substructuring methods. It is then possible to switch with a high-level of abstractionbetween methods and to build different preconditioners to accelerate the iterativesolution of large sparse linear systems. Such systems are frequently encountered in industrialor scientific problems after discretization of continuous models. Even though thesepreconditioners naturally exhibit good parallelism properties on distributed architectures,they can prove inadequate numerical performance for complex decompositions or multiscalephysics. This lack of robustness may be alleviated by concurrently solving sparse ordense local generalized eigenvalue problems, thus identifying modes that hinder the convergenceof the underlying iterative methods a priori. Using these modes, it is then possibleto define projection operators based on what is usually referred to as a coarse solver. Theseauxiliary tools tend to solve the aforementioned issues, but typically decrease the parallelefficiency of the preconditioners. In this dissertation, it is shown in three points thatthe newly developed construction is efficient: 1) by performing large-scale numerical experimentson Curie—a European supercomputer, and by comparing it with state of the art2) multigrid and 3) direct solvers
Hascoët, Julien. „Contributions to Software Runtime for Clustered Manycores Applied to Embedded and High-Performance Applications“. Thesis, Rennes, INSA, 2018. http://www.theses.fr/2018ISAR0029/document.
Der volle Inhalt der QuelleThe growing need for computing is more and more challenging, especially in the embedded system world with autonomous cars, drones, and smartphones. New highly parallel and heterogeneous processors emerge to answer this challenge. They operate in constrained environments with real-time requirements, reduced power consumption, and safety. Programming these new chips is a time-consuming and challenging task leading to huge software development costs. The Kalray MPPA® processor is a competitive example for low-power super-computing on a single chip. It integrates up to 288 VLIW cores grouped in 18 clusters, each fitted with shared local memory. These clusters are interconnected with a high-bandwidth network-on-chip, and DMA engines are used to communicate. This processor is used in this thesis for experimental results. We propose the AOS library enabling highperformance communications and synchronizations of distributed local memories on clustered manycores. AOS provides 70% of the peak hardware throughput for transfers larger than 8 KB. We propose tools for the implementation of static and dynamic dataflow programs based on AOS to accelerate the parallel application developments onto clustered manycores. We propose an implementation of OpenVX for clustered manycores on top of AOS. OpenVX is a standard based on dataflow for the development of computer vision and neural network computing. The proposed OpenVX implementation includes automatic optimizations like data prefetch to overlap communications and computations, or kernel fusion to avoid the main memory bandwidth bottleneck. Results show super-linear speedups
Bücher zum Thema "High performances calculus"
Stone, Harold S. High-performance computer architecture. 2. Aufl. Reading, Mass: Addison-Wesley Pub. Co., 1990.
Den vollen Inhalt der Quelle findenStone, Harold S. High-performance computer architecture. Reading, Mass: Addison-Wesley Pub. Co., 1987.
Den vollen Inhalt der Quelle findenStone, Harold S. High-performance computer architecture. 3. Aufl. Reading, Mass: Addison-Wesley, 1993.
Den vollen Inhalt der Quelle findenFeucht, Dennis. Designing high-performance amplifiers. Raleigh, NC: SciTech Pub., 2010.
Den vollen Inhalt der Quelle findenShriver, Bruce D. The anatomy of a high-performance microprocessor: A systems perspective. Los Alamitos, Calif: IEEE Computer Society, 1998.
Den vollen Inhalt der Quelle findenInternational Conference on High Performance Computing (6th 1999 Calcutta, India). High performance computing--HiPC'99: 6th International Conference, Calcutta, India, December 1999 : proceedings. New York: Springer, 1999.
Den vollen Inhalt der Quelle findenJoe, Kazuki, Mateo Valero, Hidehiko Tanaka und Masaru Kitsuregawa. High Performance Computing: Third International Symposium, ISHPC 2000 Tokyo, Japan, October 16-18, 2000 Proceedings. Springer London, Limited, 2003.
Den vollen Inhalt der Quelle finden(Editor), Mateo Valero, Kazuki Joe (Editor), Masaru Kitsuregawa (Editor) und Hidehiko Tanaka (Editor), Hrsg. High Performance Computing: Third International Symposium, ISHPC 2000 Tokyo, Japan, October 16-18, 2000 Proceedings (Lecture Notes in Computer Science). Springer, 2000.
Den vollen Inhalt der Quelle findenHarth, Andreas, Ralf Schenkel und Katja Hose. Linked Data Management. Taylor & Francis Group, 2016.
Den vollen Inhalt der Quelle findenLinked Data Management. Taylor & Francis Inc, 2014.
Den vollen Inhalt der Quelle findenBuchteile zum Thema "High performances calculus"
Le Boudec, Jean-Yves, und Patrick Thiran. „Network Calculus Using Min-Plus System Theory“. In High-Performance Networks for Multimedia Applications, 153–66. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5541-4_9.
Der volle Inhalt der QuellePaulraj, D., und S. Swamynathan. „Composition of Composite Semantic Web Services Using Abductive Event Calculus“. In High Performance Architecture and Grid Computing, 201–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22577-2_28.
Der volle Inhalt der QuelleGeetha, G., und Saruchi. „From Calculus to Number Theory, Paves Way to Break OSS Scheme“. In High Performance Architecture and Grid Computing, 609–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22577-2_81.
Der volle Inhalt der QuelleChahed, Tijani, Gérard Hébuterne und Caroline Fayet. „Mapping of Loss and Delay Between IP and ATM Using Network Calculus“. In Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, 240–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-45551-5_21.
Der volle Inhalt der QuelleBhayat, Ahmed, und Martin Suda. „A Higher-Order Vampire (Short Paper)“. In Automated Reasoning, 75–85. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63498-7_5.
Der volle Inhalt der QuelleHou, Yafei, Shiyong Zhang und Yiping Zhong. „Scheduling Model in Global Real-Time High Performance Computing with Network Calculus“. In Grid and Cooperative Computing, 195–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24680-0_32.
Der volle Inhalt der Quelle„Issues Related to Acceleration of Algorithms“. In Advances in Systems Analysis, Software Engineering, and High Performance Computing, 173–94. IGI Global, 2022. http://dx.doi.org/10.4018/978-1-7998-8350-0.ch010.
Der volle Inhalt der QuelleMurturi, Ilir. „Transforming the Method of Least Squares to the Dataflow Paradigm“. In Advances in Systems Analysis, Software Engineering, and High Performance Computing, 114–21. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7156-9.ch008.
Der volle Inhalt der QuelleFowley, Frank, Claus Pahl und Li Zhang. „Cloud Service Brokerage“. In Advances in Systems Analysis, Software Engineering, and High Performance Computing, 613–39. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-6178-3.ch024.
Der volle Inhalt der Quelle„RESULTS AND DISCUSSION The olfactometer readings of the measurements are statistically treated as described in /3/. The results for the plants and air cleaning systems, described in table 1, are given in table 2. system chemical biological plant ABCDE rel. odour raw air 65200 14200 26800 41400 95100 concentration Z50 cleaned air 48300 7360 29500 7930 5100 /odour units/ olfactometric efficiency n 26 % 48 % 81 % 95 % Table 2. Results of measurements, obtained during normal performance, cooker closed. Taking the index R for raw air at the cleaner inlet and the index C for cleaned air at the cleaner outlet, the olfactometric efficiency of the cleaner is defined according to /6/: 50 R In the regarded air cleaning systems, the odoriferous pollutants are first seperated from the raw air by sorption and then decomposed by chemicals or by micro-organisms. As long as this decomposition is not yet completed, the pollutants may desorb and repollute the air, when sorption conditions, i.g. the raw gas concentration, change. By the relation of the difference in raw and cleaned gas concentration to the actual raw gas concentration, a negative efficiency may be calcula ted by equation 1, i.g. when a low raw air concentration is preceded by a high one. Table 3 shows peak concentrations and increasing olfactometric efficiency, wherT’in plant A the cooker is opened. rel. odour concentration raw air 627000 Zgg /odour units/ cleaned air 240800 olfactometric efficiency n 62 % Table 3. Results of measurements, obtained in peak load performance when cooker is opened. Although the number of measurements is too small for general assertions, some deductions can be drawn: The results confirm the superiority of the biofilters. And in fact, the number of biofilters in rendering plants increases. Concerning the rel. odour concentration in the cleaned air, a large difference is evident between the presented results and the assertion that a limit value of 100 odour units can be achieved. Two interpretations can be offered:“. In Odour Prevention and Control of Organic Sludge and Livestock Farming, 239. CRC Press, 1986. http://dx.doi.org/10.1201/9781482286311-98.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "High performances calculus"
Ying Li, Lei Lei, Siyu Lin und Zhangdui Zhong. „Performance Analysis for High-speed Railway Communication Network using Stochastic Network Calculus“. In 5th IET International Conference on Wireless, Mobile and Multimedia Networks (ICWMMN 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/cp.2013.2386.
Der volle Inhalt der QuelleIsaev, Mikhail, Nic Mcdonald, Larry Dennison und Richard Vuduc. „Calculon: a methodology and tool for high-level co-design of systems and large language models“. In SC '23: International Conference for High Performance Computing, Networking, Storage and Analysis. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3581784.3607102.
Der volle Inhalt der QuelleFeng, Quanyou, Jiannong Cao, Yue Qian und Wenhua Dou. „An Analytical Approach to Modeling and Evaluation of Optical Chip-scale Network using Stochastic Network Calculus“. In 2012 IEEE 14th Int'l Conf. on High Performance Computing and Communication (HPCC) & 2012 IEEE 9th Int'l Conf. on Embedded Software and Systems (ICESS). IEEE, 2012. http://dx.doi.org/10.1109/hpcc.2012.152.
Der volle Inhalt der QuelleCatania, Andrea Emilio, Alessandro Ferrari und Antonio Mittica. „High-Pressure Rotary Pump Performance in Multi-Jet Common Rail Systems“. In ASME 8th Biennial Conference on Engineering Systems Design and Analysis. ASMEDC, 2006. http://dx.doi.org/10.1115/esda2006-95590.
Der volle Inhalt der QuellePennock, G. R., und B. S. Ryuh. „Dynamic Analysis of Two Cooperating Robots“. In ASME 1987 Design Technology Conferences. American Society of Mechanical Engineers, 1987. http://dx.doi.org/10.1115/detc1987-0064.
Der volle Inhalt der QuelleChen, Wenqing, Jidong Tian, Caoyun Fan, Hao He und Yaohui Jin. „Dependent Multi-Task Learning with Causal Intervention for Image Captioning“. In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/312.
Der volle Inhalt der QuelleFlorea, Adrian, und Arpad Gellert. „DIFFERENT APPROACHES FOR SOLVING OPTIMIZATION PROBLEMS USING INTERACTIVE E-LEARNING TOOLS“. In eLSE 2014. Editura Universitatii Nationale de Aparare "Carol I", 2014. http://dx.doi.org/10.12753/2066-026x-14-081.
Der volle Inhalt der QuelleZderčík, Antonín, Jiří Nykodým, Jana Talašová, Pavel Holeček und Michal Bozděch. „The application of fuzzy logic in the diagnostics of performance preconditions in tennis“. In 12th International Conference on Kinanthropology. Brno: Masaryk University Press, 2020. http://dx.doi.org/10.5817/cz.muni.p210-9631-2020-5.
Der volle Inhalt der QuelleEncinas Pino, Felipe, André De Herde, Carlos Ramiro Marmolejo Duarte und Carlos Andrés Aguirre Núñez. „Comportamiento termico de edificios de departamentos en Santiago de Chile: segmentación de nichos en el mercado inmobiliario privado a partir de las exigencias de la reglamentación térmica nacional“. In International Conference Virtual City and Territory. Barcelona: Centre de Política de Sòl i Valoracions, 2009. http://dx.doi.org/10.5821/ctv.7586.
Der volle Inhalt der Quelle