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

Memory test experiment: industrial results and data

IEE PROCEEDINGS-computerS AND DIGITAL TECHNIQUES 2006年第1期153卷 1-8页

作者： Hamdioui, S van de Goor, AJ Delos Reyes, J Rodgers, M Delft Univ Technol Comp Engn Lab NL-2628 CD Delft Netherlands Intel Corp Santa Clara CA 95052 USA

The results of 12 well-known and three fault-primitive-based memory test algorithms applied to 0.13 micron technology 512 kB single-port SRAMs are presented. Each test algorithm is used with up to 16 different stress combinations (SCs) (i.e. different address sequences, data backgrounds and voltages) resulting in 122 tests. The results show that SCs influence the fault coverage (FC) of the test algorithms, that the highest FC is obtained at a low voltage level and that the highest detected number of unique faults is obtained at a high voltage level. They also show that the tests with the most promising FC, based on the theory, also tend to have the highest FC in practice. Moreover, the test results show that some algorithms detect faults that cannot be explained with the existing fault models, indicating that the existing fault models still leave much to be explained;for example, no theoretical basis exists to model the stresses and the predicted FC for a given test.

关键词： computer storage devices computer input-output equipment TESTING computer algorithms computer programming RANDOM access memory HIGH voltages ELECTRIC fault location ELECTRIC circuits

来源：评论

学校读者我要写书评

暂无评论

An exact subexponential-time lattice algorithm for Asian options

引用

ACTA INFORMATICA 2007年第1期44卷 23-39页

作者： Dai, Tian-Shyr Lyuu, Yuh-Dauh Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 106 Taiwan Natl Chiao Tung Univ Dept Informat & Finance Management Hsinchu 300 Taiwan

Asian options are popular financial derivative securities. Unfortunately, no exact pricing formulas exist for their price under continuous-time models. Asian options can also be priced on the lattice, which is a discretized version of the continuous- time model. But only exponential-time algorithms exist if the options are priced on the lattice without approximations. Although efficient approximation methods are available, they lack accuracy guarantees in general. This paper proposes a novel lattice structure for pricing Asian options. The resulting pricing algorithm is exact (i.e., without approximations), converges to the value under the continuous-time model, and runs in subexponential time. This is the first exact, convergent lattice algorithm to break the long-standing exponential-time barrier.

关键词： INFORMATION science -- Research computer science MATHEMATICAL programming OPTIONS (Finance) DERIVATIVE securities computer algorithms PRICING

来源：评论

学校读者我要写书评

暂无评论

Multi-objective design of advanced power distribution networks using restricted-population-based multi-objective seeker-optimisation-algorithm and fuzzy-operator

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2015年第11期9卷 1195-1215页

作者： Kumar, Deepak Samantaray, Subhransu Ranjan Kamwa, Innocent Indian Inst Technol Sch Elect Sci Bhubaneswar Orissa India Hydroquebec IREQ Power Syst & Math Varennes PQ Canada

This study proposes a method for designing advanced power distribution system (PDS) including distributed generations, using a combination of fundamental loop generator and multi-objective seeker-optimisation algorithm (MOSOA). The proposed approach reduces the searching space using fundamental loop generator technique to obtain initial feasible solutions which is further improved by SOA to generate new set of solutions with improved aptitude. The proposed methodology uses a contingency-load-loss-index for reliability evaluation, which is independent of the estimation of failure rate and fault repair duration of feeder branches. This planning strategy includes distribution automation devices such as automatic reclosers (RAs) to enhance the reliability of PDS. The proposed algorithm generates a set of non-dominated solution by simultaneous optimisation of two conflicting objectives (economic cost and system reliability) using Pareto-optimality-based trade-off analysis including a fuzzy-operation to automatically select the most suitable solution over the Pareto-front. The performance of the proposed approach is assessed and illustrated on 54-bus and 100-bus PDS, considering realtime design practices. Extensive comparisons are made against some well-known and efficient MO algorithms such as fast non-dominated sorting genetic algorithm-II, MO particle-swarm-optimisation and MO immunised-particleswarm-optimisation. Simulation results show that the proposed approach is accurate and efficient, and a potential candidate for large-scale PDS planning.

关键词： ELECTRIC power distribution ELECTRIC power distribution -- Automation OPERATOR theory computer algorithms ELECTRIC power distribution -- Reliability FUZZY mathematics

来源：评论

学校读者我要写书评

暂无评论

The Research of Temperature Compensation for Thermopile Sensor Based on Improved PSO-BP Algorithm

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-6页

作者： Li, Yuanjiang Li, Yuehua Li, Feng Zhao, Bin Li, QingQing Nanjing Univ Sci & Technol Sch Elect Engn & Optoelect Technol Nanjing 210094 Jiangsu Peoples R China Jiangsu Univ Sci & Technol Sch Elect & Informat Zhenjiang 212003 Peoples R China Zhenjiang HJ Technol Co Ltd Zhenjiang 212003 Peoples R China

When thermopile sensor is used for safety monitoring of equipment in industrial environments, particularly for measuring the thermal radiation information of device, the measured result of this kind of sensor is usually affected by ambient temperature due to its unique structure. An improved PSO-BP algorithm is proposed for temperature compensation of thermopile sensor and correcting the error in the condition of the system accuracy requirements reduced by temperature. The core of improved PSO-BP algorithm is to improve the certainty of initial weights and thresholds that belonged to BP neural network and then train the samples by using BP neural network for enhancing the generalization ability and stability of system. The experimental results show that the proposed PSO-BP network outperforms other similar algorithms with faster convergence speed, lower errors, and higher accuracy.

关键词： TEMPERATURE compensation in electronic circuits THERMOPILES PARTICLE swarm optimization BACK propagation (Artificial intelligence) computer algorithms HEAT radiation & absorption

来源：评论

学校读者我要写书评

暂无评论

Model Predictive Control Algorithm Based on Off-Line Region Dependency

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2016年第1期2016卷 1-9页

作者： Kim, Sung Hyun Univ Ulsan Sch Elect Engn Daehak Ro 93 Ulsan 680749 South Korea

This paper presents an efficient MPC algorithm for uncertain time-varying systems with input constraints. The main advantage of this algorithm with respect to other published algorithms is to significantly enlarge the size of the stabilization set without regard to computational burdens. Specially, we introduce an off-line region-dependent MPC scheme to avoid the size limitation of the control horizon caused by huge on-line computational burdens. A numerical example is included to illustrate the validity of the result.

关键词： PREDICTIVE control TIME-varying systems computer algorithms COMPUTATIONAL complexity MATHEMATICAL analysis

来源：评论

学校读者我要写书评

暂无评论

An Image Filter Based on Shearlet Transformation and Particle Swarm Optimization Algorithm

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2015年第1期2015卷 1-9页

作者： Hu, Kai Song, Aiguo Xia, Min Fan, Zhiyong Chen, Xiaoying Zhang, Ruidong Zheng, Zhichen Nanjing Univ Informat Sci & Technol Nanjing 210044 Jiangsu Peoples R China Southeast Univ Nanjing 210000 Jiangsu Peoples R China PLA Univ Sci & Technol Nanjing 210000 Jiangsu Peoples R China

Digital image is always polluted by noise and made data postprocessing difficult. To remove noise and preserve detail of image as much as possible, this paper proposed image filter algorithm which combined the merits of Shearlet transformation and particle swarmoptimization (PSO) algorithm. Firstly, we use classical Shearlet transformto decompose noised image into many subwavelets under multiscale and multiorientation. Secondly, we gave weighted factor to those subwavelets obtained. Then, using classical Shearlet inverse transform, we obtained a composite image which is composed of those weighted subwavelets. After that, we designed fast and rough evaluation method to evaluate noise level of the new image;by using this method as fitness, we adopted PSO to find the optimal weighted factor we added;after lots of iterations, by the optimal factors and Shearlet inverse transform, we got the best denoised image. Experimental results have shown that proposed algorithmeliminates noise effectively and yields good peak signal noise ratio (PSNR).

关键词： IMAGE analysis TRANSFORMATIONS (Mathematics) PARTICLE swarm optimization computer algorithms ELECTRONIC data processing

来源：评论

学校读者我要写书评

暂无评论

An edge detection based noise removal algorithm

引用

computerS & ELECTRICAL ENGINEERING 2014年第3期40卷 769-784页

作者： Ranjbaran, Ali Abu Hassan, Anwar Hasni Kheng, Eng Swee Ranjbaran, Bahar Univ Sains Malaysia Sch Elect & Elect Engn Nibong Tebal 14300 Pulau Pinang Malaysia

We present an image denoising method using the edge map of an image. The denoised image is considered as a linear combination of the observed image and its average value, where the coefficients are controlled by a local edge detector. The parameters are set on suitable values related to noise energy computed by the curvature norm of the original image. Implementation can be done in a single iteration and the speed of the process is reasonably high. Noise reduction quality of the introduced method is compared with Wiener and Total Variation based filters for some images. The method appears to be easy, fast and useful for very noisy images. The differences between our method and the patent 6229578 "Edge Detection Based Noise Removal Algorithm" are explained. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： EDGE detection (Image processing) computer algorithms ELECTRIC noise SIGNAL denoising IMAGE analysis ELECTRIC filters

来源：评论

学校读者我要写书评

暂无评论

Development and validation of online parameter estimation for HVAC systems

引用

JOURNAL OF SOLAR ENERGY ENGINEERING-TRANSACTIONS OF THE ASME 2003年第3期125卷 324-330页

作者： Wen, J Smith, TF Univ Iowa Dept Mech & Ind Iowa City IA 52242 USA

Improving the energy efficiency of buildings by examining their heating, ventilating, and air-conditioning (HVAC) systems represents an opportunity. To improve energy efficiency, to increase occupant comfort, and to provide better system operation and control algorithms for these systems, online estimation of system parameters, including system thermophysical parameters and thermal loads, is desirable. Several reported studies have presented simulation results and assumed that the thermal loads are known. A difficulty in HVAC system parameter estimation is that most HVAC systems are nonlinear have multiple and time varying parameters, and require an estimate of the thermal loads for a building zone. In this study, building zones and variable-air-volume units are modeled. The system parameters including the thermal loads are estimated using the recursive-least-squares method with a variable forgetting factor. The sensitivity of the estimation results to different factors is examined. The estimated parameters are used to predict the zone and variable-air-volume-discharge-air temperatures. Several experiments are used to validate the prediction results. The comparisons show good agreement between the experiments and the prediction results.

关键词： Thermal loading Buildings Simulation results Energy efficiency time varying parameters High Voltage Alternating Current Systems Operating systems system parameter built up areas computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Candidate Attainable Regions for the Oxidative Dehydrogenation of n-Butane using the Recursive Constant Control (RCC) Policy Algorithm

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2009年第11期48卷 5211-5222页

作者： Milne, David Seodigeng, Tumisang Glasser, David Hildebrandt, Diane Hausberger, Brendon Univ Witwatersrand Ctr Mat & Proc Synth ZA-2050 Wits South Africa

Attainable region (AR) ideas have previously been used to identify candidate attainable regions (AR(C)s) for the oxidative dehydrogenation (ODH) of n-butane to butenes and butadiene and in so doing to identify the maximum possible yields of different hydrocarbon product. Because of the large dimensionality of the problem, it was not possible then to do a complete AR analysis. Among the configurations considered, it was found that the reactor configuration for the respective AR(C)s ill all instances was an inert membrane reactor (IMR) functioning as a differential side-stream reactor in which one of the reactants, oxygen, was introduced along the length of the reactor so as to maintain a very low and constant Value of its partial pressure. Nevertheless, despite producing high yields of product, extremely large and impractical residence times ensued. In this paper, a new tool, the recursive convex control (RCC) policy, is used to identify the AR(C)s in the full dimensional space. These AR(C)s showed excellent agreement with those previously published, and the optimal reactor structures presented in those publications have been confirmed albeit with different oxygen control parameters. The maximum yields are now achieved with very much lower residence times. These results also confirm the benefit from using the AR approach on problems where a full AR analysis is not possible.

关键词： BUTANE DEHYDROGENATION BUTADIENE CHEMICAL engineering MEMBRANE reactors HYDROCARBONS OXIDATION computer algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybrid Differential Evolution Optimisation for Earth Observation Satellite Scheduling with Time-Dependent Earliness-Tardiness Penalties

引用

MATHEMATICAL PROBLEMS IN ENGINEERING 2017年第1期2017卷 1-10页

作者： Li, Guoliang Chen, Cheng Yao, Feng He, Renjie Chen, Yingwu Natl Univ Def Technol Coll Informat Syst & Management Changsha Hunan Peoples R China

We study the order acceptance and scheduling (OAS) problem with time-dependent earliness-tardiness penalties in a single agile earth observation satellite environment where orders are defined by their release dates, available processing time windows ranging from earliest start date to deadline, processing times, due dates, sequence-dependent setup times, and revenues. The objective is to maximise total revenue, where the revenue from an order is a piecewise linear function of its earliness and tardiness with reference to its due date. We formulate this problem as a mixed integer linear programming model and develop a novel hybrid differential evolution (DE) algorithm under self-adaptation framework to solve this problem. Compared with classical DE, hybrid DE employs two mutation operations, scaling factor adaptation and crossover probability adaptation. Computational tests indicate that the proposed algorithm outperforms classical DE in addition to two other variants of DE.

关键词： DIFFERENTIAL evolution (computer science) ARTIFICIAL satellites DYNAMIC programming MATHEMATICAL optimization computer algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：