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

2015 7th Conference on Information and Knowledge Technology (IKT)

作者： Noei, Abolfazl Ranjbar Kholerdi, Hedyeh Agheh Babol Univ Technol Dept Control Engn Babol Sar Iran Babol Univ Technol Dept Elect & Comp Engn Babol Sar Iran

ISBN: (纸本)9781467374859

This manuscript studies parameter identification of an induction motor using various optimization algorithms. Inertia, friction and load torque of a real three phase motor are optimized based on artificial bee colony (ABC), particle swarm and genetic optimization algorithms. A DC and no-load locked-rotor experiments are performed to spot other parameters. A MATLAB included model and a state space dynamic model of induction motor are simulated to investigate the performance of the identification. This method guarantees the high accuracy and estimation speed of parameter identification. Result of artificial bee colony algorithm shows the least difference between the speeds of real and state space motors over the first half of minute when the motor starts. This indeed reflects the robustness of the proposed algorithm with respect to the other implemented optimization algorithms.

关键词： parameter identification inertia friction load torque motor induction optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Medical Image Watermarking with DWT-BAT algorithm 4

Medical Image Watermarking with DWT-BAT algorithm

引用

2015 International Conference on Signal Processing And Communication Engineering Systems (SPACES)

作者： Kishore, P. V. V. Kishore, S. R. C. Kumar, E. Kiran Kumar, K. V. V. Aparna, P. KL Univ Dept ECE Miracle Educ Grp Guntur Andhra Pradesh India

ISBN: (纸本)9781479961085

Medical images communicate imperative information to the doctors about a patient's health situation. Internet broadcasts these medical images to inaccessible sites of the globe which are inspected by specialist doctors. But data transmissions through unsecured web invoke validation problems for any image data. Medical images that are transmitted through the internet must be watermarked with patient pictures for substantiation by the doctors to ascertain the medical image. Watermarking medical images necessitate attentive adjustments to protect the information in the medical images with patient image watermarks. The medical images are used as an envelope image in the watermarking process which is visible on the network. These envelope medical images are watermarked with patient images in wavelet domain there by using the BAT algorithm form optimizing the embedding process for peak signal to noise ratio (psnr) and normalized cross correlation coefficient (ncc) values. The medical image envelope and letter inside envelope i.e. watermark image are transformed into wavelet domain and are mixed using scaling factor alpha which is termed as embedding strength. BAT algorithm is an optimization algorithm specialized in optimizing the values of peak-signal-to-noise ratio for a particular value of alpha, the embedding watermark strength. Finally these watermarked medical images are put on the network along with the secret key that will be used for extraction. At the receiving the embedded watermark is extracted using 2DWT using the embedding strength value using BAT algorithm. The robustness of the proposed watermarking techniques is tested with various attacks on the watermarked medical images. Peak-Signal-to-Noise ratios and Normalized cross correlation coefficients are computed to accesses the quality of the watermarked medical images and extracted patient images. The results are produced for three types of medical images with one patient image watermarks using single key b

关键词： Medical Image Watermarking Discrete Wavelet Transform (DWT) optimization algorithms BAT algorithm MRI CT and Ultrasound Images psnr and ncc

来源：评论

学校读者我要写书评

暂无评论

CliqueSquare: Flat Plans for Massively Parallel RDF Queries 31

CliqueSquare: Flat Plans for Massively Parallel RDF Queries

引用

31st IEEE International Conference on Data Engineering

作者： Goasdoue, Francois Kaoudi, Zoi Manolescu, Ioana Quiane-Ruiz, Jorge-Arnulfo Zampetakis, Stamatis Univ Rennes 1 Rennes France INRIA Rocquencourt France Athena Res Ctr IMIS Maroussi Greece Univ Paris Sud Orsay France QCRI Doha Qatar

ISBN: (纸本)9781479979646

As increasing volumes of RDF data are being produced and analyzed, many massively distributed architectures have been proposed for storing and querying this data. These architectures are characterized first, by their RDF partitioning and storage method, and second, by their approach for distributed query optimization, i.e., determining which operations to execute on each node in order to compute the query answers. We present CliqueSquare, a novel optimization approach for evaluating conjunctive RDF queries in a massively parallel environment. We focus on reducing query response time, and thus seek to build flat plans, where the number of joins encountered on a root-to-leaf path in the plan is minimized. We present a family of optimization algorithms, relying on n-ary (star) equality joins to build flat plans, and compare their ability to find the flattest possibles. We have deployed our algorithms in a MapReduce-based RDF platform and demonstrate experimentally the interest of the flat plans built by our best algorithms.

关键词： Resource Description Framework refuse derived fuel optimization algorithms FLAT query analysis Planning Reaction Time

来源：评论

学校读者我要写书评

暂无评论

Pattern Nulling of Linear Antenna Arrays Using Backtracking Search optimization Algorithm

引用

INTERNATIONAL JOURNAL OF ANTENNAS AND PROPAGATION 2015年第Pt.1期2015卷 713080.1-713080.1页

作者： Guney, Kerim Durmus, Ali Nuh Naci Yazgan Univ Fac Engn Dept Elect & Elect Engn TR-38040 Kayseri Turkey Erciyes Univ Vocat Coll Dept Elect & Energy TR-38039 Kayseri Turkey

An evolutionary method based on backtracking search optimization algorithm (BSA) is proposed for linear antenna array pattern synthesis with prescribed nulls at interference directions. Pattern nulling is obtained by controlling only the amplitude, position, and phase of the antenna array elements. BSA is an innovative metaheuristic technique based on an iterative process. Various numerical examples of linear array patterns with the prescribed single, multiple, and wide nulls are given to illustrate the performance and flexibility of BSA. The results obtained by BSA are compared with the results of the following seventeen algorithms: particle swarm optimization (PSO), genetic algorithm (GA), modified touring ant colony algorithm (MTACO), quadratic programming method (QPM), bacterial foraging algorithm (BFA), bees algorithm(BA), clonal selection algorithm (CLONALG), plant growth simulation algorithm(PGSA), tabu search algorithm(TSA), memetic algorithm (MA), nondominated sortingGA-2 (NSGA-2), multiobjective differential evolution (MODE), decomposition with differential evolution (MOEA/D-DE), comprehensive learning PSO (CLPSO), harmony search algorithm (HSA), seeker optimization algorithm (SOA), and mean variance mapping optimization (MVMO). The simulation results show that the linear antenna array synthesis using BSA provides low side-lobe levels and deep null levels.

关键词： return-to-zero linear antenna arrays Backtracking Search Bovine serum albumin Antenna arrays BSA optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Protograph-Based Raptor-Like LDPC Codes for the Binary Erasure Channel

Protograph-Based Raptor-Like LDPC Codes for the Binary Erasu...

引用

Information Theory and Applications Workshop (ITA)

作者： Vakilinia, Kasra Divsalar, Dariush Wesel, Richard D. Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90024 USA CALTECH Jet Prop Lab Pasadena CA 91109 USA

ISBN: (纸本)9781479971954

This paper designs protograph-based Raptor-like (PBRL) codes as a class of rate-compatible (RC) LDPC codes for binary-erasure channels (BEC). Similar to the Raptor Codes, the RC property is achieved by X-OR operations of the precoded bits. The additional parity bits, which lower the rate, are selected such that their connections in the protograph optimize the density evolution threshold. In order to avoid problematic graphical objects in the CPEG lifted bipartite graph and guarantee the linear growth distance property some constraints are imposed in the threshold optimization algorithm. Simulation results are presented for information block sizes of k = 1032, and k = 16384. These results are compared with finite blocklength bounds of Polyanskiy, Poor, Verdu (PPV) as well as several asymptotic bounds. The k = 1032 code family operates at various rates in the range of 8/9 to 8/48 and has an average normalized threshold gap of 5.56% from capacity. The k = 16384 code family operates at rates 8/10 to 8/32 and has an average normalized threshold gap of 3.27% from capacity.

关键词： channel coding graph theory optimisation parity check codes BEC PBRL code X-OR operation binary erasure channel bipartite graph density evolution threshold finite blocklength bounds low density parity check code parity bit precoded bit protograph-based raptor-like LDPC code rate-compatible LDPC code threshold optimization algorithm Algorithm design and analysis Approximation methods Decoding Iterative decoding optimization Simulation low density parity check codes erasure channel Algorithm design and analysis Bipartite graph parity check codes Approximation method Iterative decoding Channel coding Graph theory DECODING optimization algorithms simulating

来源：评论

学校读者我要写书评

暂无评论

Optimal Algorithm of the M3Scheduling Problem 5

Optimal Algorithm of the M3Scheduling Problem

引用

5th International Conference on Transportation Engineering, ICTE 2015

作者： Wang, Wei Yan, Haifeng School of Transportation and Logistics Southwest Jiaotong University Sichuan China

ISBN: (数字)9780784479384

ISBN: (纸本)9780784479384

M3scheduling problem is one of the most difficult problems in the world in the field of operational research. Analysis of the problem suggests that all the processing time is equal to both the processing time of all parts and floor time on the third sets of machine tools. Correspondingly the minor floor time on the third machine tools matches the fewest total time. According to such thoughts to reduce the floor time of the third machine as much as possible, we design a general algorithm for M3scheduling problem, and give the algorithm steps. Finally, through examples we tested and verified the feasibility of the algorithm. © ASCE.

关键词： Scheduling problem 3 sets of machine tools Algorithm Example algorithms optimization algorithms Machine tool processing time Third in a sequence Third

来源：评论

学校读者我要写书评

暂无评论

Design and simulation of the nuSTORM facility

Design and simulation of the nuSTORM facility

引用

作者： Liu, Ao Indiana University

学位级别：Ph.D.

This thesis provides a full design and simulation of the nuSTORM beam line facility including the pion beam line , the pion and muon orbit combination section, and the muon decay ring. The study also includes the development of numerical optimization methods and their application to the design. At nuSTORM, one proton batch from the Main Injector (MI) is extracted and transported to the target station to bombard a solid target. A magnetic horn is used as the collection device for the secondary particles such as pions and kaons. A pion beam line is designed to transport the secondary particles downstream to the muon decay ring. In order to avoid the use of a fast kicker with a large aperture for the injection, an Orbit Combination Section (OCS) was designed to combine the reference pion orbit with the circulating muon orbit. This fulfills the stochastic injection scheme proposed in the 1980s. It is shown through the simulation that the pion beam line is able to deliver 0.011 muons per proton on target within the acceptance of the ring. In order to improve the circulating muon flux, an optimization of the magnetic collection horn was studied. A Multi-Objective Genetic Algorithm (MOGA), that was modified to integrate Message Passing Interface (MPI) in the process, is applied to the optimization. The number of muons within the ring acceptance from the pion decay is estimated by the pions after the collection horn. This new method was proposed to lower the requirement on the computing resources for the optimization. The study gives a new and better target and horn configuration after a full investigation of the system. The nuSTORM ring is examined with two optics designs. With different features, the two designs are optimized via correcting the nonlinearities with sextupolar field distribution in the ring. A modified MPI-based Simulated Annealing (SA) algorithm was applied to obtain the optimal ring acceptance. The comparison with the GA shows good agreements on the achie

关键词： accelerator design beam dynamics muon facility neutrino factory nuSTORM optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal design study of thermoacoustic regenerator with lexicographic optimization method

引用

JOURNAL OF ENGINEERING DESIGN AND TECHNOLOGY 2015年第3期13卷 499-519页

作者： Tartibu, L. K. Sun, B. Kaunda, M. A. E. Mangosuthu Univ Technol Dept Mech Engn Durban South Africa Cape Peninsula Univ Technol Dept Mech Engn Cape Town South Africa

Purpose - This paper aims to illustrate the use of the augmented epsilon-constraint method implemented in general algebraic modelling system (GAMS), aimed at optimizing the geometry of a thermoacoustic regenerator. Thermoacoustic heat engines provide a practical solution to the problem of heat management where heat can be pumped or spot cooling can be produced. However, the most inhibiting characteristic of thermoacoustic cooling is their current lack of efficiencies. Design/methodology/approach - Lexicographic optimization is presented as an alternative optimization technique to the common used weighting methods. This approach establishes a hierarchical order among all the optimization objectives instead of giving them a specific (and most of the time, arbitrary) weight. Findings - A practical example is given, in a hypothetical scenario, showing how the proposed optimization technique may help thermoacoustic regenerator designers to identify Pareto optimal solutions when dealing with geometric parameters. This study highlights the fact that the geometrical parameters are interdependent, which support the use of a multi-objective approach for optimization in thermoacoustic. Originality/value - The research output from this paper can be a valuable resource to support designers in building efficient thermoacoustic device. The research illustrates the use of a lexicographic optimization to provide more meaningful results describing the geometry of thermoacoustic regenerator. It applies the epsilon-constraint method (AUGMENCON) to solve a five-criteria mixed integer non-linear problem implemented in GAMS (GAM software).

关键词： Design Implementing Managing and practicing innovation optimization algorithms Mechanical design Modelling Multi-objective/attribute decision-making Design strategies

来源：评论

学校读者我要写书评

暂无评论

Model and Algorithm of Urban Road Discrete Network Design Based on CO Emissions 5

Model and Algorithm of Urban Road Discrete Network Design Ba...

引用

5th International Conference on Transportation Engineering, ICTE 2015

作者： Li, Jian Zha, Weixiong Zhu, Tingting Institute of Transportation and Economics Humanities and Social Sciences Research Base of Jiangxi Province East China Jiaotong University Nanchang China

ISBN: (数字)9780784479384

ISBN: (纸本)9780784479384

Network design is to optimize traffic network system performance by choosing to build or improve road sections under the given constraint conditions. This paper established a bi-level programming model of discrete traffic network design with optimization of environment protection and user goals, and designed a global optimization algorithm for solving the model based on the genetic optimization algorithm. This algorithm is simple and easy to implement, and the corresponding algorithm procedures have been developed in MATLAB platform. The validity of model and algorithm has been tested by Sioux Falls network and the results showed that the model and algorithm can be well applied to medium-sized network. © ASCE.

关键词： CO emissions Discrete network design Bi-level programming Genetic algorithm Network design algorithms optimization algorithms Genetic Algorithm (GA) discrete network traffic network Urban road Sioux operator level routine environment protection Optimal design Choose

来源：评论

学校读者我要写书评

暂无评论

An Improved Animal Migration optimization Algorithm for Clustering Analysis

引用

DISCRETE DYNAMICS IN NATURE AND SOCIETY 2015年第Pt.1期2015卷 12-12页

作者： Ma, Mingzhi Luo, Qifang Zhou, Yongquan Chen, Xin Li, Liangliang Guangxi Univ Nationalities Coll Informat Sci & Engn Nanning 530006 Peoples R China Guangxi High Sch Key Lab Complex Syst & Intellige Nanning 530006 Peoples R China

Animal migration optimization (AMO) is one of the most recently introduced algorithms based on the behavior of animal swarm migration. This paper presents an improved AMO algorithm (IAMO), which significantly improves the original AMO in solving complex optimization problems. Clustering is a popular data analysis and data mining technique and it is used in many fields. The well-known method in solving clustering problems is k-means clustering algorithm;however, it highly depends on the initial solution and is easy to fall into local optimum. To improve the defects of the k-means method, this paper used IAMO for the clustering problem and experiment on synthetic and real life data sets. The simulation results show that the algorithm has a better performance than that of the k-means, PSO, CPSO, ABC, CABC, and AMO algorithm for solving the clustering problem.

关键词： optimization algorithms seasonal migration algorithms Animal Migration Simulation results Cluster Analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：