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

IEEE Workshop on Signal Processing Systems (SIPS)

作者： K.-I. Kum W. Sung School of Electrical Engineering Seoul National University Seoul South Korea

Word-length optimization software is developed not only to reduce the hardware cost but also to minimize the optimization time. It inserts quantizers to a data flow graph representation, partitions the resultant graph, determines the minimum required word-length for each partitioned signal, conducts scheduling and binding using the minimum word-length information, and finally optimizes the word-lengths of functional units. Fixed-point simulation results are used as for the performance measure, thus this method can be applied to nonlinear and time-varying algorithms. Although this approach requires iterative fixed-point simulations, the search space is reduced significantly by grouping signals using the high-level synthesis, or hardware sharing, results. A fourth-order IIR filter, a fifth-order elliptic filter, and a 12th-order adaptive LMS filter are implemented using this software. The hardware cost of functional units is reduced by 25% in the IIR filter and 7% in the elliptic filter compared to the previous results.

关键词： high level synthesis IIR filters Hardware Cost function Adaptive filters Flow graphs Partitioning algorithms Iterative algorithms Iterative methods Least squares approximation

来源：评论

学校读者我要写书评

暂无评论

Planware-domain-specific synthesis of high-performance schedulers

Planware-domain-specific synthesis of high-performance sched...

引用

IEEE International conference on Automated software Engineering (ASE)

作者： L. Blaine L. Gilham Junbo Liu D.R. Smith S. Westfold Kestrel Institute Palo Alto CA USA

Planware is a domain-specific generator of high-performance scheduling software, currently being developed at the Kestrel Institute. Architecturally, Planware is an extension of the Specware system with domain-independent and domain-dependent parts. The domain-independent part includes a general algorithm design facility (including mechanisms to synthesize global-search and constraint propagation algorithms), as well as support for theorem-proving and witness finding. The domain-dependent part includes scheduling domain knowledge and architecture representations, and other domain-specific refinement knowledge that relates the scheduling domain to general algorithm design and data type refinement. Using Planware, the user interactively specifies a problem and then the system automatically generates a formal specification and refines it.

关键词： Scheduling algorithm Algorithm design and analysis Process design Logic Taxonomy Formal specifications Constraint theory Constraint optimization Design optimization Transportation

来源：评论

学校读者我要写书评

暂无评论

Determination of the design parameters of passive harmonic filters using nonlinear optimization

Determination of the design parameters of passive harmonic f...

引用

Annual Meeting Industrial and Commercial Power Systems Technical conference

作者： S.D. Upadhye Y.R. Atre Senior Systems Analyst Tata Infotech Limited Pune India Department of Electrical Engineering Walchand College of Engineering Sangli India

Power system harmonics are a menace with disastrous consequences. A number of ways were tried out to tackle the harmonic problem posed by nonlinear electric devices, but by far, the most popular and quite effective one is the use of passive filters. This provides a low impedance path to a harmonic or a group of harmonics. Usually the AC harmonics are odd harmonics. So normally the filter combination selected is such that for the predominant harmonics, one or more single tuned filters are used, and for the rest of the harmonics, a high pass filter is used. An alternate combination is that a damped filter is used for the two predominant harmonics with the filter being tuned at a frequency in between the two harmonics and another damped filter for the higher harmonics. If all the harmonics are not of very high magnitude then usually one high pass filter is sufficient for all the harmonics. Instead of the conventional design of these filters, which is based on experience of the designer, a better way is to use the optimization algorithms to obtain maximum performance from these filters.

关键词： Harmonic filters Design optimization Power harmonic filters Frequency Tuning Impedance Circuit optimization Inductors Ear Power system harmonics

来源：评论

学校读者我要写书评

暂无评论

System identification and machine setup of color xerographic machines using multivariate modeling and multiobjective optimization

System identification and machine setup of color xerographic...

引用

IEEE conference on Control Technology and Applications (CCTA)

作者： Sudhendu Rai Xerox Corporation Webster NY USA

ISBN: (纸本)078034104X

This paper describes an approach for performing system identification of the xerographic process and developing a model of the overall system. The experiment design is performed using orthogonal arrays. A nonlinear system model defining a vector mapping between the actuators and performance metrics is constructed using multivariate adaptive regression splines. These models provide a basis for providing automated and optimal machine setup on color machines. Multiobjective optimization techniques based on an underlying adaptive simulated annealing approach are discussed, which are then used for determining the Pareto-optimal set-points. The overall approach is applied to perform the automated setups of a high-end color machine-the Docucolor 40. Experimental results show that high quality machine setups can be performed in an efficient and automated manner. The use of these set-points as the basis of linearization about a nominal set-point for use in linear control algorithms are also discussed.

关键词： System identification Photoreceptors Corona Mars Electrophotography Voltage Dielectric substrates Pixel Image converters nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

nonlinear identification of control systems

Nonlinear identification of control systems

引用

American Control conference (ACC)

作者： S.E. Lyshevski Department of Electrical Engineering Purdue University Indianapolis IN USA

nonlinear system identification of dynamic systems is a topic of growing interest. The ability of model-based systems analysis and design to attain the desired objectives depends to a large degree on the accuracy of the mathematical models derived and parameters used. To avoid deficiencies associated with model validation and order estimation, accurate mathematical models should be found by using the fundamental laws, and the unknown parameters have to be identified to perform analysis, design, and prototyping. This paper thoroughly studies the model-relevant identification concept for continuous-time nonlinear multi-input/multi-output systems in time-domain by using a nonlinear mapping-based identification framework. Discrete-time and hybrid systems play an important role due to microprocessor-, microcomputer-, and DSP-based hardware platforms applied to implement comprehensive control algorithms in order to attain the desired objectives, specifications, and capabilities. However, the majority of systems to be controlled are continuous-time, and analog control is a manageable and straightforward solution in many practical problems. The importance of the researched time-domain concept lies on the need to identify continuous-time systems to be used in the corresponding analysis, design, stabilization, and optimization. As an illustrative example, the unknown parameters of a high-performance aircraft are identified using the flight data.

关键词： nonlinear control systems Control systems Mathematical model Time domain analysis nonlinear systems nonlinear dynamical systems System analysis and design performance analysis Prototypes Hardware

来源：评论

学校读者我要写书评

暂无评论

The Embedded Genetic Allocator-a system to automatically optimize the use of memory resources in high performance, scalable computing systems

The Embedded Genetic Allocator-a system to automatically opt...

引用

IEEE International conference on Systems, Man and Cybernetics

作者： D. Cousins J. Loomis F. Roeber P. Schoeppner A.-E. Tobin BBN Technologies/GTE Internetworking Middletown RI USA

Describes an approach to the problem of optimizing memory resource use in high-performance scalable computing systems. The approach is automatic and applicable to a wide variety of system architectures. It consists of a hybrid genetic algorithm optimizer (the Embedded Genetic Allocator or EGA), coupled with a high-precision software performance monitoring system. EGA requires no programmer knowledge of the underlying non-uniform memory access (NUMA) architecture of the target hardware; the programmer simply specifies the data buffers to be allocated and requires that certain groups of buffers share the same performance quality. EGA minimizes the execution time of time-critical portions of the target system by allocating target program data buffers to various memory banks in the NUMA architecture. These trial allocations are loaded and evaluated directly on the target hardware. Measurements of process execution time are derived from synchronized event logging of multiple processors performed by BBN TraceMaker/sup TM/. The timing data provides the information for an optimizer cost function which the genetic algorithm uses when selecting from amongst competing allocations. Thus, EGA automates the trial-and-error method of hand optimization. We have demonstrated EGA performing memory allocation optimizations on a typical VME-based multiprocessor DSP system and completed a set of optimization experiments. The results demonstrate that EGA can be used to optimize the memory allocation on a DSP with real-world code, and that the resulting optimizations can rival those generated manually by a skilled programmer.

关键词： Programming profession Computer architecture Genetic algorithms Hardware Computer buffers Digital signal processing software performance Monitoring Memory architecture Time factors

来源：评论

学校读者我要写书评

暂无评论

Minimal energy control of a biped robot with numerical methods and a recursive symbolic dynamic model

Minimal energy control of a biped robot with numerical metho...

引用

IEEE conference on Decision and Control

作者： M. Hardt K. Kreutz-Delgado J.W. Helton Department of Electrical & Computer Engineering University of California San Diego La Jolla CA USA Department of Mathematics University of California San Diego La Jolla USA

The problem of constructing a nonlinear controller for a biped robot optimal with respect to a minimal energy performance criteria is considered. The solution of this difficult, highly nonlinear problem is facilitated by the conjunction of several new developments in numerical optimal control and constrained recursive dynamic models for robotic systems. A 5-link biped model is used with the full dynamics and a uniform distribution of mass at each link. Contacts are modeled as inelastic, and the full dynamics together with the contact and collision forces are calculated efficiently using a recursive symbolic representation of the dynamics. The flexibility and modularity of our dynamics algorithms allows one to construct reduced unconstrained models which do not suffer from integration difficulties. The numerical optimal control software used is powerful and quick enough to handle high dimensional nonlinear systems. The result of our experiment is a walking controller which is optimal with respect to a type of minimum energy performance.

关键词： Optimal control Legged locomotion Robot kinematics Motion control Open loop systems nonlinear equations Jacobian matrices Mathematical model Numerical models Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for delay-bounded minimum cost path problem in communication networks

Efficient algorithms for delay-bounded minimum cost path pro...

引用

International conference on high performance Computing

作者： G. Kumar N. Narang C.P. Ravikumar Computer Science Department University of Maryland College Park MD USA Hughes Software Systems Limited Gurgaon Haryana India Department of Electrical Engineering Indian Institute of Technology New Delhi India

As the amount of data transmitted over a network increases and high bandwidth applications requiring point to multipoint communications like videoconferencing, distributed database management or cooperative work become widespread, it becomes very important to optimize network resources. One such optimization is multicast tree generation. The problem of generating a minimum cost multicast tree given the network topology and costs associated with the connecting links can be modelled as a Steiner tree problem which is NP-complete. Much work has been done in the direction of obtaining near-optimal multicast trees when the objective is only to minimize the cost. However, many real time applications such as videoconferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. We deal with the delay-bounded cost-optimal multicast tree (DBCPAT) generation problem. Specifically, we discuss a closely related problem which is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used as a starting point to solve the DBCMT. We present an exact solution to the DBCP which is based on the branch-and-bound paradigm. We also propose a heuristic technique to solve the DBCP using the principle of evolutionary computing. The results obtained using the two techniques are compared for several large networks.

关键词： Delay Costs Teleconferencing Multicast algorithms Bandwidth Distributed databases Resource management Collaborative work Network topology Joining processes

来源：评论

学校读者我要写书评

暂无评论

Simulated annealing and genetic algorithms for the facility layout problem: A survey

引用

COMPUTATIONAL optimization AND APPLICATIONS 1997年第1期7卷 111-126页

作者： Mavridou, TD Pardalos, PM Center for Applied Optimization Department of Industrial and Systems Engineering University of Florida Gainesville USA

The facility layout problem (FLP) has many practical applications and is known to be NP-hard. During recent decades exact and heuristic approaches have been proposed in the literature to solve FLPs. In this paper we review the most recent developments regarding simulated annealing and genetic algorithms for solving facility layout problems approximately.

关键词： heuristics simulated annealing genetic algorithms facility layout problem parallel algorithms combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Sparse linear least squares problems in optimization

引用

COMPUTATIONAL optimization AND APPLICATIONS 1997年第1期7卷 89-110页

作者： Matstoms, P Department of Mathematics Linköping University Linköping Sweden

Numerical and computational aspects of direct methods for large and sparse least squares problems are considered. After a brief survey of the most often used methods, we summarize the important conclusions made from a numerical comparison in MATLAB. Significantly improved algorithms have during the last 10-15 years made sparse QR factorization attractive, and competitive to previously recommended alternatives. Of particular importance is the multifrontal approach, characterized by low fill-in, dense subproblems and naturally implemented parallelism. We describe a Householder multifrontal scheme and its implementation on sequential and parallel computers. Available software has in practice a great influence on the choice of numerical algorithms. Less appropriate algorithms are thus often used solely because of existing software packages. We briefly survey software packages for the solution of sparse linear least squares problems. Finally, we focus on various applications from optimization, leading to the solution of large and sparse linear least squares problems. In particular, we concentrate on the important case where the coefficient matrix is a fixed general sparse matrix with a variable diagonal matrix below. Inner point methods for constrained linear least squares problems give, for example, rise to such subproblems. Important gains can be made by taking advantage of structure. Closely related is also the choice of numerical method for these subproblems. We discuss why the less accurate normal equations tend to be sufficient in many applications.

关键词： least squares problem sparse matrices QR factorization multifrontal method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：