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

EFFECTS OF ARCHITECTURE IMPLEMENTATION ON DFT algorithm PERFORMANCE

IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING 1985年第3期33卷 684-693页

作者： MEHALIC, MA RUSTAN, PL ROUTE, GP USAF INST TECHNOLWRIGHT PATTERSON AFBOH 45433

Five major DFT algorithms were evaluated on seven different computers. The relative performances of these algorithms were related to the architecture of each computer by finding a relationship between the execution time and the instruction counts. The relative performance of these algorithms on other computers is predicted, based on the knowledge of the computer architecture. On certain implementations, data transfers are more important than floating-point additions and multiplications when comparing DFT algorithms. On the average, data transfers account for a greater percentage of the execution time than floating-point operations,

关键词： Computer architecture Assembly Computer aided instruction Testing Radio access networks algorithm design and analysis Military computing

来源：评论

学校读者我要写书评

暂无评论

Medical Image analysis

引用

IEEE PULSE 2011年第6期2卷 60-70页

作者： Ritter, Felix Boskamp, Tobias Homeyer, Andre Laue, Hendrik Schwier, Michael Link, Florian Peitgen, Heinz-Otto Fraunhofer MEVIS-Institute for Medical Image Computing

Since the discovery of the X-ray radiation by Wilhelm Conrad Roentgen in 1895, the field of medical imaging has developed into a huge scientific discipline. The analysis of patient data acquired by current image modalities, such as computerized tomography (CT), magnetic resonance tomography (MRT), positron emission tomography (PET), or ultrasound (US), offers previously unattained opportunities for diagnosis, therapy planning, and therapy assessment. Medical image processing is essential to leverage this increasing amount of data and to explore and present the contained information in a way suitable for the specific medical task. In this tutorial, we will approach the analysis and visualization of medical image data in an explorative manner. In particular, we will visually construct the image processing algorithms using the popular graphical data-flow builder MeVisLab, which is available as a free download for noncommercial research. We felt that it could be more interesting for the reader to see and explore examples of medical image processing that go beyond simple image enhancements. The part of exploration, to inspect medical image data and experiment with image-processing pipelines, requires software that encourages this kind of visual exploration.

关键词： Data visualization Image segmentation Rendering (computer graphics) Computed tomography Medical diagnostic imaging algorithm design and analysis Medical image processing X-ray imaging

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Packing Programming for Space Station Extravehicular Missions

引用

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE 2017年第4期12卷 38-47页

作者： Zhu, Yuehe Luo, Yazhong Tan, Kay Chen Qiu, Xin Natl Univ Def Technol Coll Aerosp Sci & Engn Changsha Hunan Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Natl Univ Singapore NUS Grad Sch Integrat Sci & Engn Singapore Singapore

Packing programming for extravehicular missions to the space station is the process of arranging a set of missions into multiple extravehicular activities. It is an interesting combinatorial optimization problem developed from the traditional bin-packing problem. This paper first formulates a practical mathematical model that considers both the constraints of the time window for each extravehicular mission and the spacewalk time per astronaut. An Ant Colony Optimization (ACO) algorithm with a self-adaptation strategy and a new pheromone matrix characterizing the relationship between any two extravehicular missions is then proposed. The simulation results on various independent experiments show that the proposed ACO algorithm is capable of producing optimal packing programming schemes with a success rate of over 90%, which is acceptable for application to real-world problems.

关键词： Optimization algorithm design and analysis Programming Mathematical model Space missions

来源：评论

学校读者我要写书评

暂无评论

Making greed work in networks: A game-theoretic analysis of switch service disciplines

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 1995年第6期3卷 819-831页

作者： Shenker, SJ Xerox Palo Alto Res. Center CA USA

This paper discusses congestion control from a game-theoretic perspective. There are two basic premises, 1) Users are assumed to be independent and selfish, 2) Central administrative control is exercised only at the network switches, The operating points resulting from selfish user behavior depend crucially on the service disciplines implemented in network switches, This effect is investigated in a simple model consisting of a single exponential server shared by many Poisson sources, We discuss the extent to which one can guarantee, through the choice of switch service disciplines, that these selfish operating points will be efficient and fair. We also discuss to what extent the choice of switch service disciplines can ensure that these selfish operating points are unique and are easily and rapidly accessible by simple self optimization techniques, We show that no service discipline can guarantee optimal efficiency, As for the other properties, we show that the traditional FIFO service discipline guarantees none of these properties, but that a service discipline called fair share guarantees all of them. While the treatment utilizes game-theoretic concepts, no previous knowledge of game theory is assumed.

关键词： Telecommunication Congestion Control Game Theory Optimisation Computer Networks Packet Switching Selfish User Behavior Switch Service Disciplines Congestion Control Central Administrative Control Network Switches Simple Model Single Exponential Server Poisson Sources Self Optimization Techniques Optimal Efficiency FIFO Service Discipline Game Theory Fair Share Service Discipline Switches Intelligent Networks Centralized Control Game Theory Proposals Control Systems Network Servers Computer Networks algorithm design and analysis Humans

来源：评论

学校读者我要写书评

暂无评论

COMPUTATIONAL analysis OF ROTATIONAL SEARCH METHODS FOR ADAPTIVE PISARENKO HARMONIC RETRIEVAL

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1993年第5期41卷 1974-1979页

作者： DEBRUNNER, V School of Electrical Engineering University of Oklahama Norman OK USA

One useful method of reducing the computational burden of adaptive implementations of the Pisarenko method is the rotational search method (RSM). However, the algorithm encounters catastrophic numerical problems under interesting signal conditions, because the search direction orthogonality to the estimated eigenvector is not strictly enforced. A more stringent enforcement of this orthogonality with minimal computational increase is proposed, and numerical analysis verifies the proposed fix.

关键词： Harmonic analysis Search methods Signal processing algorithms Convergence Speech processing Adaptive signal processing Finite impulse response filter Adaptive filters algorithm design and analysis Least squares approximation

来源：评论

学校读者我要写书评

暂无评论

An Improved Many-Objective Evolutionary algorithm for Multi-Satellite Joint Large Regional Coverage

引用

IEEE ACCESS 2023年 11卷 45838-45849页

作者： Li, Feng Wan, Qiuhua He, Qien Zhong, Xing Xu, Kai Zhu, Ruifei Chinese Acad Sci Changchun Inst Opt Fine Mech & Phys Changchun 130033 Peoples R China Univ Chinese Acad Sci Daheng Coll Fine Mech & Phys Beijing 100049 Peoples R China Chang Guang Satellite Technol Co Ltd Changchun 130102 Peoples R China

Multi-satellite joint regional coverage aims to select the optimal combination of satellite resources to acquire the image information of the specified area. Meanwhile, more than three objectives are usually considered simultaneously during this process. Therefore, it is a typical many-objective optimization problem that is NP-hard. Most existing many-objective optimization algorithms cannot preserve extreme solutions due to the failure of Pareto dominance. In this paper, through introducing the idea of S-CDAS into the traditional NSGA-III, an improved many-objective evolutionary algorithm named NSGA-III for extreme solutions preservation (ESP-NSGA-III) is proposed with problem-specific genetic operations to generate regional coverage schemes. A comparative study is conducted with other six state-of-the-art many-objective evolutionary algorithms. Hypervolume (HV) and pure diversity (PD) metrics are used to evaluate the performance of algorithms. The simulation results show that ESP-NSGA-III has good comprehensive performance and improves the diversity of original algorithms. The maximum difference of the coverage rate between ESP-NSGA-III and other six algorithms is 0.2576 so that satisfactory regional coverage scheme can be obtained by ESP-NSGA-III. Our proposed methods are not only applicable to regional coverage tasks, but also have important reference significance for solving other real-world problems.

关键词： Satellite communication Evolutionary computation Simulation Resource management Performance evaluation algorithm design and analysis Many-objective optimization multi-satellite joint NSGA-III regional coverage S-CDAS

来源：评论

学校读者我要写书评

暂无评论

A neural network approach to PLA folding problems

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1996年第10期15卷 1299-1305页

作者： Tsuchiya, K Takefuji, Y FUJI FACOM CO HINO TOKYO 191 JAPAN CASE WESTERN RESERVE UNIV DEPT ELECT ENGN & APPL PHYS CLEVELAND OH 44106 USA

A near-optimum parallel algorithm for solving PLA folding problems is presented in this paper where the problem is NP-complete and one of the most fundamental problems in VLSI design. The proposed system is composed of nxn neurons based on an artificial two-dimensional maximum neural network where n is the number of inputs and outputs or the number of product lines of PLA. The two-dimensional maximum neurons generate the permutation of inputs and outputs or product lines. Our algorithm can solve not only a simple folding problem but also multiple, bipartite, and constrained folding problems. We have discovered improved solutions in four benchmark problems over the best existing algorithms using the proposed algorithm.

关键词： Neural networks Programmable logic arrays Very large scale integration Combinational circuits Neurons Logic design Circuit testing MOS devices Parallel algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

EFFECTIVE DAMPING FOR SSR analysis OF PARALLEL TURBINE-GENERATORS

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1988年第4期3卷 1441-1448页

作者： AGRAWAL, BL FARMER, RG Arizona Public Service Company Phoenix AZ USA

Damping is a dominant parameter in studies to determine SSR (subsynchronous resonance) problem severity and countermeasure requirements. To reach valid conclusions for multiunit plants, it is essential that the net effective damping of unequally loaded units be known. For the Palo Verde Nuclear Generating Station, extensive testing and analysis have been performed to verify and develop an accurate means of determining the effective damping of unequally loaded units in parallel. This has led to a unique and simple algorithm for calculating the effective damping which correlates well with two other analytic techniques. The features of this algorithm are discussed, and correlation results are presented.< >

关键词： Damping Nuclear power generation Testing Performance analysis Performance evaluation algorithm design and analysis Resonance Capacitors Power transmission lines Shafts

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE AND SCALABILITY OF PRECONDITIONED CONJUGATE-GRADIENT METHODS ON PARALLEL COMPUTERS

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1995年第5期6卷 455-469页

作者： GUPTA, A KUMAR, V SAMEH, A Department of Computer Science University of Minnesota Minneapolis MN USA

This paper analyzes the performance and scalability of an iteration of the preconditioned conjugate gradient algorithm on parallel architectures with a variety of interconnection networks, such as the mesh, the hypercube, and that of the CM-5(TM 1) parallel computer. It is shown that for block-tridiagonal matrices resulting from two-dimensional finite difference grids, the communication overhead due to vector inner products dominates the communication overheads of the remainder of the computation on a large number of processors. However, with a suitable mapping, the parallel formulation of a PCG iteration is highly scalable for such matrices on a machine like the CM-5 whose fast control network practically eliminates the overheads due to inner product computation. The use of the truncated Incomplete Cholesky (IC) preconditioner can lead to further improvement in scalability on the CM-5 by a constant factor. As a result, a parallel formulation of the PCG algorithm with IC preconditioner may execute faster than that with a simple diagonal preconditioner even if the latter runs faster in a serial implementation. For the matrices resulting from three-dimensional finite difference grids, the scalability is quite good on a hypercube or the CM-5, but not as good on a 2-D mesh architecture. In the case of unstructured sparse matrices with a constant number of nonzero elements in each row, the parallel formulation of the PCG iteration is unscalable on any message passing parallel architecture, unless some ordering is applied on the sparse matrix. The parallel system can be made scalable either if, after reordering, the nonzero elements of the N x N matrix can be confined in a band whose width is O(N-y) for any y < 1, or if the number of nonzero elements per row increases as N-x for any x > 0. Scalability increases as the number of nonzero elements per row is increased and/or the width of the band containing these elements is reduced. For unstructured sparse matrices, the sca

关键词： Scalability Computer networks Concurrent computing Performance analysis algorithm design and analysis Parallel architectures Multiprocessor interconnection networks Hypercubes Finite difference methods Grid computing

来源：评论

学校读者我要写书评

暂无评论

TOPEX/POSEIDON MICROWAVE RADIOMETER (TMR) .2. ANTENNA PATTERN CORRECTION AND BRIGHTNESS TEMPERATURE algorithm

引用

IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING 1995年第1期33卷 138-146页

作者： JANSSEN, MA RUF, CS KEIHM, SJ PENN STATE UNIV DEPT ELECT ENGNUNIVERSITY PKPA 16802

The calibrated antenna temperatures measured by the TOPEX Microwave Radiometer are used to derive radiometric brightness temperatures in the vicinity of the altimeter footprint, The basis for the procedure devised to do this-the antenna pattern correction and brightness temperature algorithm-is described in this paper, along with its associated uncertainties, The algorithm is based on knowledge of the antenna pattern, the ground-based measurements of which are presented along with their analyses, Using the results of these measurements, we perform an error analysis that yields the net uncertainties in the derived Th IR footprint brightness temperatures, The net brightness temperature uncertainties range from 0.79 to 0.88 degrees K for the three TMR frequencies, and include the radiometer calibration uncertainties which range from 0.54 to 0.57 degrees K, We also derive an estimate of the uncertainty incurred by using brightness temperatures measured in the similar to 40 km TMR footprint to estimate path delay in the similar to 3 km altimeter footprint. The RR IS difference in path delay averaged over the largest TMR footprint relative to that in the altimeter footprint is estimated to be about 0.3 cm, Finally, we discuss the error associated with using unequal beams at the three TMR frequencies to derive path delays, and describe an approach using along-track averaging of the algorithm brightness temperatures to reduce this error,

关键词： Microwave radiometry Brightness temperature Delay estimation Temperature measurement Antenna measurements Frequency estimation Microwave antennas Microwave measurements Pattern analysis algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：