检索结果-内蒙古大学图书馆

computation time Analysis of the Magnetic Gear Analytical Model

IEEE TRANSACTIONS ON MAGNETICS 2017年第5期53卷 1-9页

作者： Desvaux, Melaine Traulle, Benjamin Latimier, Roman Le Goff Sire, Stephane Multon, Bernard Ben Ahmed, Hamid Univ Bretagne Loire CNRS ENS Rennes SATIE F-35170 Bruz France Univ Brest F-29238 Brest France

This paper focuses on the computation time and precision of a linear 2-D magnetic gear analytical model. Two main models of magnetic gears are studied: 1) the first with an infinite relative permeability of yokes and 2) the second with a finite relative permeability of yokes. These models are based on the subdomain resolution of Laplace and Poisson equations. To accurately compute the magnetic field distribution, it is necessary to take into account certain harmonics of the various rings and other system harmonics due to modulation. Global system harmonics, which increase the value of computation time, must also be taken into account. If the magnetic gear has a high pole number, then computation time increases even more and no longer allows for system optimization. This paper proposes to compute magnetic field distribution using different harmonic selection methods in order to significantly reduce the computation time for the magnetic torque without any loss of accuracy.

关键词： Analytical model computation time electromagnetic torque harmonics magnetic gear optimization precision torque ripple yoke

来源：评论

学校读者我要写书评

暂无评论

computation time Analysis of D16 Algorithm for Surface Water Flow Direction Using Decision Tree 6

Computation Time Analysis of D16 Algorithm for Surface Water...

引用

6th International Conference on Information Technology, Information Systems and Electrical Engineering, ICITISEE 2022

作者： Firgiawan, Wawan Zainuddin, Zahir Achmad, Andani Universitas Hasanuddin Dapartment of Informatics Makassar Indonesia

ISBN: (纸本)9798350399615

Digital Elevation Model (DEM) is data used for modeling water flow. DEM data is in the form of a grid with X and Y points as coordinates and Z representing the surface elevation. One of the challenges in modeling the direction of water flow is the computational time of the algorithm to model the flow on DEM data. Based on the initial tests conducted in this study, it can be seen that the increase in computation time will always be directly proportional to the amount of data processed by the application. To overcome this problem, certain methods are needed to shorten computation time to make it more efficient. This study contributes to the existence of a computational model using a decision tree to solve the problem of finding the direction of surface water flow using the D16 algorithm. The D16 algorithm is a method for modeling the direction of surface water flow. The algorithm works by forming 16 flow directions in the search space. For testing in this study, we will compare the sequential computational model and the computational model with the decision tree that the author made to see the computational time efficiency of the D16 algorithm completion model. The test results show that modeling the direction of water flow with a decision tree produces a good computation time compared to the sequential program model, with an average computational difference of 82.66 seconds. © 2022 IEEE.

关键词： computation time D16 algorithm Decision tree DEM Surface water flow direction

来源：评论

学校读者我要写书评

暂无评论

A computation time optimization for the radio coverage prediction

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 2003年第7-8期58卷 1130-1156页

作者： Combeau, P Vauzelle, R Aveneau, L Pousset, Y Univ Poitiers IRCOM SIC UMR 6615 CNRS F-86962 Futuroscope France

This article presents a method which optimises the computation time for the prediction of a radio coverage, whatever the propagation model used. The principle consists in reducing the number of application points of the propagation model in relation to a classical technique. The proposed method is based on a multi resolution analysis of measured signals carried out around 2 GHz, and on an electromagnetic analysis of the propagation environment. The performances of the method are evaluated in term of reduction in computation time and of accuracy, in comparaison with the classical technique.

关键词： mobile radiocommunication transmitter coverage electromagnetic wave propagation radio wave multipath propagation wave reflection wave diffraction computation time wavelet expansion optimization partition

来源：评论

学校读者我要写书评

暂无评论

Analytical derivation of a formula for the reduction of computation time by the voxel crossing technique used in room acoustical simulation

引用

APPLIED ACOUSTICS 2006年第10期67卷 959-981页

作者： Stephenson, Uwe Martin Harbour City Univ D-22297 Hamburg Germany

computation times of room acoustical simulation algorithms still suffer from the time consuming search for ray-wall-intersections. Spatial subdivision may speed up ray tracing considerably. For room acoustics, where the number of surface polygons (walls) is not so high, the voxel technique appears suitable. The voxel crossing algorithm is very fast. However, its performance was not yet investigated up to now. Voxels are small cubes by which the space is subdivided periodically. The advantage: Only in the rare case a voxel intersects a wall the intersection point needs to be computed. In this paper, by estimating the probabilities of such intersections, an analytical formula is derived, by which the optimum degree of spatial subdivision and the factor of acceleration of the algorithm can be forecasted. It turns out that the computation time increases only with root K-0 instead of with K-0 (the number of polygons of the room). Thus, on a modern PC, computation time for a full room acoustical simulation even for highly complicated rooms may be reduced by a factor in the order of 100, i.e. to a few seconds. (c) 2006 Elsevier Ltd. All rights reserved.

关键词： room acoustics numerical acoustics computer graphics ray tracing algorithms voxels computation time

来源：评论

学校读者我要写书评

暂无评论

OPTIMIZATION OF computation time FOR SYSTOLIC ARRAYS

引用

IEEE TRANSACTIONS ON COMPUTERS 1992年第2期41卷 159-177页

作者： WONG, YW DELOSME, JM YALE UNIV DEPT ELECT ENGNNEW HAVENCT 06520

The time performance of a systolic array implementation of an algorithm is measured by the product of two quantities: the number of systolic cycles required to complete the computations, n(sys), and the cycle time, t(sys). Yet earlier works on systolic array synthesis have exclusively sought schedules that minimize n(sys), an approach justified only when the processors have a single functional unit. This paper deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time n(sys) x t(sys). The selection of a linear scheduling function which minimizes n(sys) x t(sys) is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples.

关键词： BRANCH-AND-BOUND METHOD COMBINATORIAL OPTIMIZATION computation time CYCLE time LINEAR SCHEDULING RETIMING SYSTOLIC ARRAY SYNTHESIS UNIFORM RECURRENCE EQUATIONS

来源：评论

学校读者我要写书评

暂无评论

Reduction of computation time in building energy performance simulation programs by applying tearing techniques

引用

ENERGY AND BUILDINGS 2016年第Oct.期130卷 667-675页

作者： Foncubierta Blazquez, Juan Luis Rodriguez Maestre, Ismael Gonzalez Gallero, Francisco Javier Mena Balades, J. Daniel Univ Cadiz Escuela Politecn Super Algeciras Ave Ramon Puyol S-N Algeciras 11202 Spain

Building energy simulation programs are powerful tools which are increasingly used at the design stage, for the assessment of compliance with energy efficiency regulations and for integration into energy management systems. A wider scope, a higher level of detail of building and thermal systems and the trend towards the use of dynamic simulations in real time are making these programs more computationally demanding. In this context, this paper presents a study of the computational time reduction in thermal simulations of buildings by applying equation tearing methods. These methods are employed to construct subsets of equations that can be independently solved with lower computational cost. The study was conducted at seven typical heating, ventilation, and air conditioning facilities. The computation time has been evaluated in five-minute intervals during a one-year period. The average saving ratio in processing time was 4.4;ratios ranged from 1.9 to 7.1. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Building simulation program Equation tearing method computation time

来源：评论

学校读者我要写书评

暂无评论

Hybrid algorithm to reduce the computation time of genetic algorithm for designing binary phase holograms

引用

OPTICAL ENGINEERING 2004年第9期43卷 2061-2065页

作者： Nguyen, TA An, JW Choi, JK Kim, N Jeon, SH Kwon, YS Chungbuk Natl Univ Chonju South Korea Univ Incheon Dept Elect Engn Inha South Korea

To reduce computation time, a new approach for designing computer-generated holograms is proposed. In this new method, we utilize artificial neural networks to initiate the genetic algorithm, so that the high computation cost of genetic algorithms for synthesizing holograms is significantly reduced, while the high diffraction efficiency and uniformity are still ensured. Designed binary phase holograms have a diffraction efficiency of 75.8% and uniformity of 5.8%, which are proven in computer simulation and experimentally demonstrated. (C) 2004 Society or Photo-optical Instrumentation Engineers.

关键词： computer-generated holograms genetic algorithm artificial neural network computation time

来源：评论

学校读者我要写书评

暂无评论

MUSIDH, multiple use of simulated demographic histories, a novel method to reduce computation time in microsimulation models of infectious diseases

引用

COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE 2008年第3期91卷 185-190页

作者： Fischer, E. A. J. De Vlas, S. J. Richardus, J. H. Habbema, J. D. F. Univ Med Ctr Rotterdam Erasmus MC Dept Publ Hlth NL-3000 CA Rotterdam Netherlands

Microsimulation of infectious diseases requires simulation of many life histories of interacting individuals. In particular, relatively rare infections such as leprosy need to be studied in very large populations. computation time increases disproportionally with the size of the simulated population. We present a novel method, MUSIDH, an acronym for multiple use of simulated demographic histories, to reduce computation time. Demographic history refers to the processes of birth, death and all other demographic events that should be unrelated to the natural course of an infection, thus non-fatal infections. MUSIDH attaches a fixed number of infection histories to each demographic history, and these infection histories interact as if being the infection history of separate individuals. With two examples, mumps and leprosy, we show that the method can give a factor 50 reduction in computation time at the cost of a small loss in precision. The largest reductions are obtained for rare infections with complex demographic histories. (C) 2008 Elsevier Ireland Ltd. All rights reserved.

关键词： microsimulation infectious disease computation time leprosy mumps

来源：评论

学校读者我要写书评

暂无评论

An optimization in computation time for the prediction of radio coverage zones

引用

RADIO SCIENCE 2007年第1期42卷 RS1003.1-RS1003.1页

作者： Combeau, Pierre Vauzelle, Rodolphe Pousset, Yannis Aveneau, Lilian Univ Poitiers Dept Elect F-86962 Futuroscope France Univ Poitiers Dept Informat F-86962 Futuroscope France

[ 1] This paper presents a method which optimizes the computation time for radio coverage prediction, whatever propagation model is used. The principle consists in reducing, in comparison with classical techniques, the number of application points of a propagation model. The proposed method is based on a multiresolution analysis of measured signals operating at 1.8 GHz and on an electromagnetic analysis of the propagation environment. The method is compared with a classical technique and is evaluated in terms of a reduction in computation time and of an increase in accuracy. Satisfactory results were obtained for microcells and small cells, and gains in computation time, with values close to 3 and 80, were achieved for scalar and vectorial models, respectively. As 90% of the estimation errors relating to the received signal level are less than 2.2 dB, a high level of accuracy was also assured.

关键词： mobile radio communication transmitter coverage electromagnetic wave propagation computation time wavelet expansion multipath propagation

来源：评论

学校读者我要写书评

暂无评论

Some theoretical results about the computation time of evolutionary algorithms 05

Some theoretical results about the computation time of evolu...

引用

Genetic and Evolutionary computation Conference

作者： Ding, Lixin Yu, Jinghu Wuhan Univ State Key Lab Software Engn Wuhan 430072 Peoples R China

ISBN: (纸本)1595930108

This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite search spaces are obtained theoretically by using the properties of Markov chain. Then, by introducing drift analysis and applying Dynkin's Formula, the general upper and lower bounds of the mean first hitting times of evolutionary algorithms are given rigorously under some mild conditions. These results obtained in this paper, and the analytic methods used in this paper, are widely valid for analyzing the computation are introduced.

关键词： evolutionary algorithms computation time drift analysis Dynkin's formula

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：