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

REDUCING CORRELATION TO IMPROVE COVERAGE OF DELAY FAULTS IN SCAN-PATH design

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第5期13卷 638-646页

作者： MAO, WW CILETTI, MD UNIV COLORADO DEPT ELECT & COMP ENGNBOULDERCO 80309 UNIV COLORADO DEPT ELECT & COMP ENGNCOLORADO SPRINGSCO 80933

Simulation data is presented for eleven benchmark circuits to show how test pattern correlation in a scan-path design circuit adversely affects delay fault coverage, and to demonstrate that most undetected delay faults caused by correlation of test patterns are close to the outputs of latches. Topology- based latch correlation measures are introduced and used by a companion latch arrangement algorithm to guide the placement of latches in a scan-path design, with the objective of minimizing the effect of correlation and maximizing the coverage of delay faults. Simulation results with benchmark circuits indicate that the scan-path found by the algorithm clearly achieves better delay fault coverage than a scan-path having no deliberate arrangement. The data also indicates that the algorithm is most effective in covering delay faults that are located nearest the latch outputs of the circuit. The approach has an advantage over other arrangement schemes in that it is simple to implement and does not require significant computational time even for large circuits.

关键词： Circuit faults Circuit testing Latches Sequential analysis Routing algorithm design and analysis Delay effects Circuit simulation Sequential circuits Hardware

来源：评论

学校读者我要写书评

暂无评论

INCORPORATING A MULTI-CRITERIA DECISION PROCEDURE INTO THE COMBINED DYNAMIC-PROGRAMMING PRODUCTION SIMULATION algorithm FOR GENERATION EXPANSION PLANNING

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 1989年第1期4卷 165-175页

作者： YANG, HT CHEN, SL Electrical Engineering Department National Tsing Hua University Hsinchu Taiwan

A multiobjective optimization approach to generation expansion planning is presented. The approach is obtained by adding a new multicriteria decision (MCD) procedure to the conventional algorithm which combines dynamic programming with a production simulation method. The MCD procedure can help decision-makers weigh the relative importance of multiple attributes associated with the decision alternatives and find the near-best compromise solution efficiently at each optimization step of the conventional algorithm. Practical applications of the approach to evaluating the feasibility of the fourth nuclear power plant of Taiwan is presented, demonstrating its effectiveness and limitations.< >

关键词： Dynamic programming Production planning Costs Proposals algorithm design and analysis Heuristic algorithms Power generation Power systems Power engineering and energy Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

A NEURAL NETWORK ARCHITECTURE FOR PREATTENTIVE VISION

引用

IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 1989年第1期36卷 65-84页

作者： GROSSBERG, S MINGOLLA, E TODOROVIC, D UNIV BELGRADE DEPT PSYCHOL YU-11000 BELGRADE YUGOSLAVIA

Recent results towards development of a neural network architecture for general-purpose preattentive vision are summarized. The architecture contains two parallel subsystems, the boundary contour system (BCS) and the feature contour system (FCS), which interact together to generate a representation of form-and-color-and-depth. Emergent boundary segmentation within the BCS and featural filling-in within the FCS are emphasized within a monocular setting. Applications to the analysis of boundaries, textures, and smooth surfaces are described, as is a model for invariant brightness perception under variable illumination conditions. The theory shows how suitably defined parallel and hierarchical interactions overcome computational uncertainties that necessarily exist at early processing stages. Some of the psychophysical and neurophysiological data supporting the theory's predictions are mentioned.< >

关键词： Neural networks Layout Brightness Artificial intelligence algorithm design and analysis Biosensors Laser radar Glass Lighting Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A Harm-Reduction Framework for algorithmic Fairness

引用

IEEE SECURITY & PRIVACY 2018年第3期16卷 34-45页

作者： Altman, Micah Wood, Alexandra Vayena, Effy MIT Res Cambridge MA 02139 USA MIT MIT Lib Program Informat Sci Cambridge MA 02139 USA Harvard Univ Berkman Klein Ctr Internet & Soc Cambridge MA 02138 USA Swiss Fed Inst Technol Zurich Switzerland

In this article, we recognize the profound effects that algorithmic decision making can have on people’s lives and propose a harm-reduction framework for algorithmic fairness. We argue that any evaluation of algorithmic fairness must take into account the foreseeable effects that algorithmic design, implementation, and use have on the well-being of individuals. We further demonstrate how counterfactual frameworks for causal inference developed in statistics and computer science can be used as the basis for defining and estimating the foreseeable effects of algorithmic decisions. Finally, we argue that certain patterns of foreseeable harms are unfair. An algorithmic decision is unfair if it imposes predictable harms on sets of individuals that are unconscionably disproportionate to the benefits these same decisions produce elsewhere. Also, an algorithmic decision is unfair when it is regressive, that is, when members of disadvantaged groups pay a higher cost for the social benefits of that decision.

关键词： Decision Making Decision Support Systems Ethical Aspects Harm Reduction Framework algorithm Fairness algorithm Decision Making Individual Well Being Classification algorithms Prediction algorithms Decision Making Risk Management Law Machine Learning algorithms Inference algorithms Ethics Artificial Intelligence algorithm design and analysis Data Privacy Informational Harm Fairness Accountability Privacy AI Ethics

来源：评论

学校读者我要写书评

暂无评论

A NEURAL NETWORK REGULATOR FOR TURBOGENERATORS

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS 1992年第1期3卷 95-100页

作者： WU, QH HOGG, BW IRWIN, GW Department of Electrical Engineering Queen''s University Belfast Belfast UK

This paper presents a neural network (NN) based regulator for nonlinear, multivariable turbogenerator control. A hierarchical architecture of an NN is proposed for regulator design, consisting of two subnetworks, which are used for input-output (I-O) mapping and control respectively, based on the back-propagation (BP) algorithm. The regulator has the flexibility for accepting more sensory information to cater for multi-input, multioutput systems. Its operation does not require a reference model or inverse system model and it can produce more acceptable control signals than are obtained by using sign of plant errors during training. I-O mapping of turbogenerator systems using NN's has been investigated and the regulator has been implemented on a complex turbogenerator system model. Simulation results show satisfactory control performance and illustrate the potential of the NN regulator in comparison with an existing adaptive controller.

关键词： Neural networks Regulators Turbogenerators Adaptive control Inverse problems Programmable control Control systems algorithm design and analysis Control system synthesis Robust control

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT PARALLEL algorithmS FOR ROBOT FORWARD DYNAMICS COMPUTATION

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1988年第2期18卷 238-251页

作者： LEE, CSG CHANG, PR Ransburg Robotics Laboratory School of Electrical Engineering Purdue University West Lafayette IN USA

Two efficient parallel algorithms for computing the forward dynamics for real-time simulation were developed for implementation on a single-instruction multiple-data-stream (SIMD) computer with n processors, where n is the number of degrees of freedom of the manipulator. The first parallel algorithm, based on the composite rigid-body method, generates the inertia matrix using the parallel Newton-Euler algorithm, the parallel linear recurrence algorithm, and the modified row-sweep algorithm, and then inverts the inertia matrix to obtain the joint acceleration vector at time t. The time complexity of this parallel algorithm is of the order O(n/sup 2/) with O(n) processors. The second parallel algorithm, based on the conjugate gradient method, computes the joint acceleration with a time complexity of O(n) for multiplication operation and O(n log/sub 2/n) for addition operation. The interprocessor communication problem for the implementation of the proposed parallel algorithms on SIMD machines is also discussed and analyzed.< >

关键词： Parallel algorithms Parallel robots Concurrent computing Manipulator dynamics Acceleration Computational modeling Computer simulation Vectors Gradient methods algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A STUDY OF RECONSTRUCTION ARTIFACTS IN CONE BEAM TOMOGRAPHY USING FILTERED BACKPROJECTION AND ITERATIVE EM algorithmS

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 1990年第2期37卷 759-767页

作者： ZENG, GL GULLBERG, GT Department of Radiology University of Utah Medical Center Salt Lake UT USA

Reconstruction artifacts in cone beam tomography are studied for filtered backprojection (Feldkamp) and iterative EM algorithms. The filtered backprojection algorithm uses a voxel-driven, interpolated backprojection to reconstruct the cone beam data, whereas the iterative EM algorithm performs ray-driven projection and backprojection operations for each iteration. Two weighting schemes for the projection and backprojection operations in the EM algorithm are studied. One weights each voxel by the length of the ray through the voxel and the other equates the value of a voxel to the functional value of the midpoint of the line intersecting the voxel, which is obtained by interpolating between eight neighboring voxels. Cone beam reconstruction artifacts such as rings, bright vertical extremities, and slice-to-slice cross-talk are not found with parallel beam and fan beam geometries. When using filtered backprojection and iterative EM algorithms, the line-length weighting is susceptible to ring artifacts which are improved by using interpolated projector-backprojectors.< >

关键词： Tomography Iterative algorithms Image reconstruction Extremities Geometry Biomedical imaging algorithm design and analysis Radiology Cities and towns X-ray imaging

来源：评论

学校读者我要写书评

暂无评论

Static task-scheduling algorithms for battery-powered DVS systems (vol 13, pg 226, 2005)

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2005年第4期13卷 508-508页

作者： Chowdhury, P Chakrabarti, C Maxim Integrated Products Sunnyvale CA USA

Battery lifetime enhancement is a critical design parameter for mobile computing devices. Maximizing the battery lifetime is a particularly difficult problem due to the nonlinearity of the battery behavior and its dependence on the characteristics of the discharge profile. In this paper, we address the problem of task scheduling with voltage scaling in a battery-powered single and multiprocessor system such that the residual charge or the battery voltage (the parameters for evaluating battery performance) is maximized. We propose an efficient heuristic algorithm using a charge-based cost function derived from the analytical battery model. Our algorithm first creates a task sequence that ensures battery survival, and then distributes the available delay slack so that the cost function is maximized. The effectiveness of the algorithm has been verified using DUALFOIL, a low-level Li-ion battery simulator. The algorithm has been validated on synthetic examples created from applications running on Compaq's handheld computing research platform, ITSY

关键词： Battery Management Systems Dynamic Scheduling Lithium Mobile Computing Optimisation Processor Scheduling Secondary Cells Battery Lifetime Mobile Computing Devices Multiprocessor System Residual Charge Charge Based Cost Function Low Level Li Ion Battery Simulator Task Scheduling algorithms Battery Powered Dynamic Voltage Scalable Systems Critical design Parameter Heuristic algorithm Analytical Battery Model DUALFOIL Compaq Handheld Computing Research Platform Li Voltage Control Batteries Cost Function Mobile Computing Processor Scheduling Multiprocessing Systems Heuristic algorithms algorithm design and analysis Analytical Models Delay Battery Optimizations DVS Processors Low Power Scheduling Voltage Scaling

来源：评论

学校读者我要写书评

暂无评论

Automatic Dual Crane Cooperative Path Planning Based on Multiple RRT algorithm for Narrow Path Finding Scenario

引用

IEEE ACCESS 2024年 12卷 29049-29061页

作者： Kim, Ji-Chul Lee, Hanmin Kim, Yeongjae Lee, Dongwook Korea Inst Machinery & Mat Dept Smart Ind Machine Technol Daejeon 34103 South Korea Kongju Natl Univ Dept Mech & Automot Engn Cheonan 31080 South Korea Kongju Natl Univ Global Inst Mfg Technol GITECH Cheonan 31080 South Korea

Dual crane lifting, wherein two cranes collaborate to lift a single workpiece, serves as an essential solution in scenarios in which employing a single, sufficiently large crane is impractical due to cost constraints, ground conditions, and spatial limitations. Due to the complexity of double crane lifting operations, the implementation of automated path generation minimizes the risk of human error and removes the potential for accidents by simulating and validating the generated crane path. We propose a novel multiple rapidly-exploring random trees (RRT) based algorithm designed specifically for dual crane systems to produce lifting paths, particularly in challenging 'narrow path finding' scenarios. The multiple RRT method is an efficient way to find paths in environments with high complexity and low connectivity through a strategy that allows new trees to be generated and grown whenever a newly generated node that cannot be connected to an existing tree occurs. The proposed path planning algorithm not only adapts the multiple RRT method to the dual crane systems but also incorporates ideas to enhance the optimality of generated paths while reducing computational time. The effectiveness of this algorithm has been validated through a case studies covering various scenario.

关键词： Cranes Path planning Kinematics Complexity theory Collision avoidance Accidents Structural beams Lifting equipment algorithm design and analysis Dual crane cooperative system path planning multiple rapid-exploring random tree

来源：评论

学校读者我要写书评

暂无评论

A Velocity Estimation algorithm of Moving Targets using Single Antenna SAR

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2009年第3期45卷 1052-1062页

作者： Li, Gang Xia, Xiang-Gen Xu, Jia Peng, Ying-Ning Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE 19715 USA Radar Acad AF Wuhan 430019 Peoples R China

A new algorithm is proposed for velocity estimation of moving targets in single antenna synthetic aperture radar (SAR). Based on the fact that different velocity vectors cause different geometrical figures of the two-dimensional (2-D) signature in the range-Doppler (RD) domain, this algorithm estimates the azimuth and range velocities by a 2-D search such that the range cell migration correction (RCMC) and the second range compression (SRC) are correctly performed. It is shown that, using the proposed algorithm, the Doppler ambiguity problem can be avoided and satisfactory accurate velocity estimation can be obtained in high signal-to-clutter ratio (SCR) scenarios.

关键词： Synthetic aperture radar Azimuth Doppler shift Frequency estimation Radar antennas Matched filters Aperture antennas Two dimensional displays Phase estimation algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：