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

Using software complexity measures to analyze algorithms - an experiment with the shortest-paths algorithms

COMPUTERS & OPERATIONS RESEARCH 2003年第8期30卷 1121-1134页

作者： Nurminen, JK Nokia Res Ctr FIN-00045 Helsinki Finland

In this paper, we apply different software complexity measures to a set of shortest-path algorithms. Our intention is to study what kind of new information about the algorithms the complexity measures (lines-of-code, Halstead's volume, and cyclomatic number) are able to give, to study which software complexity measures are the most useful ones in algorithm comparison, and to analyze when the software complexity comparisons are appropriate. The experiment indicates that the software complexity measures give a new dimension to empirical algorithm comparison. The results explicitly show the trade-off between speed and implementation complexity: a faster algorithm typically requires a more complex implementation. Different complexity measures correlate strongly. Therefore, even the simple lines-of-code measure gives useful results. As the software complexity measures are easy to calculate and since they give useful information, the study suggests that such measures should be included in empirical algorithm comparisons. Unfortunately, for meaningful results, all the algorithms have to be developed in the same fashion which makes the comparison of independent implementations difficult.

关键词： algorithm implementation software complexity measures shortest-path algorithms

来源：评论

学校读者我要写书评

暂无评论

Building design optimization using a convergent pattern search algorithm with adaptive precision simulations

引用

ENERGY AND BUILDINGS 2005年第6期37卷 603-612页

作者： Wetter, M Polak, E United Technol Res Ctr E Hartford CT 06108 USA Univ Calif Berkeley Dept Elect Engn Berkeley CA 94720 USA

We propose a simulation-precision control algorithm that can be used with a family of derivative free optimization algorithms to solve optimization problems in which the cost function is defined through the solutions of a coupled system of differential algebraic equations (DAEs). Our optimization algorithms use coarse precision approximations to the solutions of the DAE system in the early iterations and progressively increase the precision as the optimization approaches a solution. Such schemes often yield a significant reduction in computation time. We assume that the cost function is smooth but that it can only be approximated numerically by approximating cost functions that are discontinuous in the design parameters. We show that this situation is typical for many building energy optimization problems. We present a new building energy and daylighting simulation program, which constructs approximations to the cost function that converge uniformly on bounded sets to a smooth function as precision is increased. We prove that for our simulation program, our optimization algorithms construct sequences of iterates with stationary accumulation points. We present numerical experiments in which we minimize the annual energy consumption of an office building for lighting, cooling and heating. In these examples, our precision control algorithm reduces the computation time up to a factor of four. (c) 2004 Elsevier B.V. All rights reserved.

关键词： optimization algorithm implementation generalized pattern search Hooke-Jeeves

来源：评论

学校读者我要写书评

暂无评论

Precision control for generalized pattern search algorithms with adaptive precision function evaluations

引用

SIAM JOURNAL ON OPTIMIZATION 2006年第3期16卷 650-669页

作者： Polak, E Wetter, M Univ Calif Berkeley Dept Elect Engn Berkeley CA 94720 USA United Technol Res Ctr E Hartford CT 06108 USA

In the literature on generalized pattern search algorithms, convergence to a stationary point of a once continuously differentiable cost function is established under the assumption that the cost function can be evaluated exactly. However, there is a large class of engineering problems where the numerical evaluation of the cost function involves the solution of systems of differential algebraic equations. Since the termination criteria of the numerical solvers often depend on the design parameters, computer code for solving these systems usually defines a numerical approximation to the cost function that is discontinuous with respect to the design parameters. Standard generalized pattern search algorithms have been applied heuristically to such problems, but no convergence properties have been stated. In this paper we extend a class of generalized pattern search algorithms to include a subprocedure that adaptively controls the precision of the approximating cost functions. The numerical approximations to the cost function need not de. ne a continuous function. Our algorithms can be used for solving linearly constrained problems with cost functions that are at least locally Lipschitz continuous. Assuming that the cost function is smooth, we prove that our algorithms converge to a stationary point. Under the weaker assumption that the cost function is only locally Lipschitz continuous, we show that our algorithms converge to points at which the Clarke generalized directional derivatives are nonnegative in predefined directions. An important feature of our adaptive precision scheme is the use of coarse approximations in the early iterations, with the approximation precision controlled by a test. We show by numerical experiments that such an approach leads to substantial time savings in minimizing computationally expensive functions.

关键词： algorithm implementation approximations generalized pattern search Hooke Jeeves Clarke's generalized directional derivative nonsmooth optimization

来源：评论

学校读者我要写书评

暂无评论

Compressed Principal Component Regression (C-PCR) algorithm and FPGA Validation

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第12期67卷 3512-3516页

作者： Zamani, Hossein Bahrami, Hamid Reza Garris, Paul A. Mohseni, Pedram Case Western Reserve Univ Elect Comp & Syst Engn Dept Cleveland OH 44106 USA Univ Akron Elect & Comp Engn Dept Akron OH 44325 USA Illinois State Univ Sch Biol Sci Normal IL 61790 USA

To address the hardware and/or software implementation issues of principal component regression (PCR), we propose a novel algorithm called compressed PCR (C-PCR). C-PCR projects the input data to a lower dimensional space first, and then applies the compressed data to a significantly smaller PCR engine. We show that C-PCR can lower the computational complexity of PCR with a factor of compression ratio (CR) squared, i.e., CR2. Moreover, the output signal of C-PCR follows that of PCR with a small error, which increases with CR, when the projections are random. Using datasets of prerecorded brain neurochemicals, we experimentally show that C-PCR can achieve CRs as high as similar to 10. As far as hardware implementation is concerned, the experimental results show that reduction rates of 32% to 45% in different FPGA resources can be achieved using C-PCR.

关键词： Manganese Training Computational complexity Image coding Hardware Circuits and systems Signal processing algorithms algorithm implementation compressed learning compressive sensing principal component regression

来源：评论

学校读者我要写书评

暂无评论

Autoregressive parameter estimation from noisy data

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-ANALOG AND DIGITAL SIGNAL PROCESSING 2000年第1期47卷 71-75页

作者： Zheng, WX Univ Western Sydney Nepean Sch Sci Sydney NSW Australia

A least-squares based method for noisy autoregressive signals has been developed recently, which needs to neither prefilter noisy data nor perform parameter extraction. In this brief, a more computationally efficient procedure for estimating the measurement noise variance is developed, and then an efficient implementation of the method is presented. It is shown that this better way of implementation can considerably reduce the computational requirement of the least-squares based method without any performance degradation. Computer simulations that support the theoretical findings are given.

关键词： autoregressive signals algorithm implementation least-squares method parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Bite Weight Prediction From Acoustic Recognition of Chewing

引用

IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 2009年第6期56卷 1663-1672页

作者： Amft, Oliver Kusserow, Martin Troester, Gerhard Tech Univ Eindhoven NL-5600 MB Eindhoven Netherlands ETH Wearable Comp Lab CH-8092 Zurich Switzerland

Automatic dietary monitoring (ADM) offers new perspectives to reduce the self-reporting burden for participants in diet coaching programs. This paper presents an approach to predict weight of individual bites taken. We utilize a pattern recognition procedure to spot chewing cycles and food type in continuous data from an ear-pad chewing sound sensor. The recognized information is used to predict bite weight. We present our recognition procedure and demonstrate its operation on a set of three selected foods of different bite weights. Our evaluation is based on chewing sensor data of eight healthy study participants performing 504 habitual bites in total. The sound-based chewing recognition achieved recalls of 80% at 60%-70% precision. Food classification of chewing sequences resulted in an average accuracy of 94%. In total, 50 variables were derived from the chewing microstructure, and were analyzed for correlations between chewing behavior and bite weight. A subset of four variables was selected to predict bite weight using linear food-specific models. Mean weight prediction error was lowest for apples (19.4%) and largest for lettuce (31%) using the sound-based recognition. We conclude that bite weight prediction using acoustic chewing recordings is a feasible approach for solid foods, and should be further investigated.

关键词： algorithm implementation biosignal processors signal and image processing

来源：评论

学校读者我要写书评

暂无评论

A tightly integrated modelling and optimisation library: A new framework for rapid algorithm development

引用

ANNALS OF OPERATIONS RESEARCH 2001年第1-4期104卷 313-333页

作者： Tebboth, J Daniel, R Univ Buckingham Buckingham MK18 1EG England Dash Blisworth NN7 3BX Northants England

The development of mathematical programming algorithms and heuristics has traditionally been hampered by the separation of modeller and optimiser. Developers either have to sacrifice performance by switching between a modeller and optimiser and communicating through cumbersome matrix files;or they can work solely with the in-core matrix in the optimiser, where knowledge about the structured algebraic model is missing and thus difficult to exploit. We present EMOSL, a new combined modelling and optimisation subroutine library that overcomes these drawbacks. It allows the problem to be manipulated using the notation of the model language, which is of course close to the algebraic formulation of the problem. Access is provided directly to the in-core matrix of the optimiser, eliminating the need to communicate via files. Thus the scope and ease of algorithm development is greatly improved, without any degradation of performance. We substantiate these claims by describing four applications: a block structure extraction tool, and the implementations of three MIP heuristics and cutting planes techniques.

关键词： modelling languages integrated modelling and optimisation algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

Efficient perturbations for handling geometric degeneracies

引用

algorithmICA 1997年第1-2期19卷 219-242页

作者： Emiris, IZ Canny, JF Seidel, R UNIV SAARLAND FB 14 D-66041 SAARBRUCKEN GERMANY UNIV CALIF BERKELEY DIV COMP SCI BERKELEY CA 94720 USA

This article defines input perturbations so that an algorithm designed under certain restrictions on the input can execute on arbitrary instances. A syntactic definition of perturbations is proposed and certain properties are specified under which an algorithm executed on perturbed input produces an output from which the exact answer can be recovered. A general framework is adopted for linear perturbations, which are efficient from the point of view of worst-case complexity. The deterministic scheme of Emiris and Canny [1] was the first efficient scheme and is extended in a consistent manner, most notably to the InSphere primitive. We introduce a variant scheme, applicable to a restricted class of algorithms, which is almost optimal in terms of algebraic as well as bit complexity. Neither scheme requires any symbolic computation and both are simple to use as illustrated by our implementation of a convex hull algorithm in arbitrary dimension. Empirical results and a concrete application in robotics are presented.

关键词： input degeneracy efficient perturbations algorithm implementation general-dimensional convex hulls

来源：评论

学校读者我要写书评

暂无评论

MICROPROGRAMMING AND NUMERICAL ANALYSIS

引用

IEEE TRANSACTIONS ON COMPUTERS 1971年第7期C 20卷 808-&页

作者： SHRIVER, BD Department of Computer Science State University of New York University at Buffalo Amherst NY USA

This short note presents the view that microprogramming affords a technology that can provide a powerful, efficient, and versatile computer facility for numerical analysts. Particular areas of application are discusse... 详细信息

关键词： algorithm implementation matrix manipulation numerical analysis numeric efficiency storage.

来源：评论

学校读者我要写书评

暂无评论

Designing and algorithm Implementing of the Expert System Platform for Assistant Identification of Agricultural Pests Based on a Dendriform Hierarchical Structure

Designing and Algorithm Implementing of the Expert System Pl...

引用

World Congress on Software Engineering

作者： Gao, Lingwang Yan, Chunrong Shen, Zuorui China Agr Univ Coll Agr & Biotech Beijing 100094 Peoples R China Jiangsu Provincial Supervis & Testing Inst Pro Nanjing 210029 Peoples R China

ISBN: (纸本)9780769535708

Being numerous, the insect and disease pests were organized within classifications described as a dendriform hierarchical (tree-shape) structure The data of the structure were managed by database management system (DBMS), tables were designed to store the information about the species/category and related characteristics The characteristics were related to the species/category to construct a junction/x-ref table as the knowledge base of the expert system for insect and disease pest identification, including sets of identification characteristics for all species/category in the table Relational calculus was employed to estimate the potential species/category of the insect and disease pests in relation to inclusion of the set of characters selected by users and the sets of identification characteristics in the knowledge base of the system The system can be used as an open and flexible platform for professional users involved in plant protection to establish new expert application systems that provide pest identification services for common agricultural users

关键词： Dendriform Hierarchical Structure Expert System Assistant Identification Pest algorithm implementation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：