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

IEEE Congress on Evolutionary Computation (CEC)

作者： Noman, Nasimul Bollegala, Danushka Iba, Hitoshi Univ Tokyo Grad Sch Engn Tokyo 1138656 Japan

ISBN: (纸本)9781424478354

The performance of Differential Evolution (DE) algorithm is significantly affected by its parameter setting. But the choice of parameters is heavily dependent on the problem characteristics. Therefore, recently a couple of adaptation schemes that automatically adjust DE parameters have been proposed. The current work presents another adaptation scheme for DE parameters namely amplification factor and crossover rate. We systematically analyze the effectiveness of the proposed adaptation scheme for DE parameters using a standard benchmark suite consisting of ten functions. The undertaken empirical study shows that the proposed adaptive DE (aDE) algorithm exhibits an overall better performance compared to other prominent adaptive DE algorithms as well as canonical DE.

关键词： algorithm design and analysis Benchmark testing Chaos Convergence Logistics Mathematical model Optimization

来源：评论

学校读者我要写书评

暂无评论

A Discussion of Digital Processing in Synthetic Aperture Radar

引用

IEEE Transactions on Aerospace and Electronic Systems 1975年第3期AES-11卷 326-337页

作者： Kirk, John C. Raytheon Company Goleta Calif. 93017 United States

This is a summary paper describing the processing of synthetic aperture radar (SAR) data using digital correlation algorithms. Fundamental SAR theory as it applies to the various SAR modes, namely, strip mapping, spotlight mapping, and Doppler beam sharpened mapping, is described and a baseline design applicable to all SAR modes is presented. Digital processor design is developed, starting with a simple single filter mechanization and proceeding through more complex processing algorithms. Prefilter design is discussed, asis the more advanced processing algorithms, namely, multiple parallel prefilters, two-stage correlation, and FFT processing. The primary processor tradeoff is increased functional complexity versus reduced arithmetic and memory requirements. For high-resolution applications, the arithmetic requirements can be reduced by an order of magnitude or more by implementing the more advanced processing algorithms. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Synthetic aperture radar Optical signal processing Arithmetic Optical sensors Phased arrays Azimuth Optical filters Adaptive optics Signal processing algorithms algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Noise-Blind Image Deblurring 30

Noise-Blind Image Deblurring

引用

30th IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Jin, Meiguang Roth, Stefan Favaro, Paolo Univ Bern Bern Switzerland Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781538604571

We present a novel approach to noise-blind deblurring, the problem of deblurring an image with known blur, but unknown noise level. We introduce an efficient and robust solution based on a Bayesian framework using a smooth generalization of the 0-1 loss. A novel bound allows the calculation of very high-dimensional integrals in closed form. It avoids the degeneracy of Maximum a-Posteriori (MAP) estimates and leads to an effective noise-adaptive scheme. Moreover, we drastically accelerate our algorithm by using Majorization Minimization (MM) without introducing any approximation or boundary artifacts. We further speed up convergence by turning our algorithm into a neural network termed GradNet, which is highly parallelizable and can be efficiently trained. We demonstrate that our noise-blind formulation can be integrated with different priors and significantly improves existing deblurring algorithms in the noise-blind and in the known-noise case. Furthermore, GradNet leads to state-of-the-art performance across different noise levels, while retaining high computational efficiency.

关键词： Noise level Image restoration Kernel Bayes methods Estimation Robustness algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Relationships between window-based real-time constraints

Relationships between window-based real-time constraints

引用

13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Gang Tu Jun-lin Li Fu-min Yang Wei Luo Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China Wuhan Digital Engn Inst Wuhan 430074 Peoples R China

ISBN: (纸本)9780769529752

This paper analyses the computational relationships of two types of window-based real-time constraint, sliding and fixed window constraint. First, based on the definition of "strict harder", the paper gives out the computing system, making possible of precisely comparing or translating window constraints. The analyses on the constraints are helpful for arranging task scheduling. Thereby, a scheduling framework that is capable of adapting to the changing environment is presented next, it bases on the idea that trying to guarantee unsolvable constraints is not as good as adjusting them. The scheduling framework modulates real-time system by adjusting the constraints on tasks so as to fit the changed resources. Last, evaluation results are presented to show that the scheduling framework is efficient and can largely decrease the mean rate of missed constraints for real-time tasks.

关键词： Processor scheduling Real time systems Scheduling algorithm Dynamic scheduling algorithm design and analysis Quality of service Voltage control Computer science Heuristic algorithms Degradation

来源：评论

学校读者我要写书评

暂无评论

Personalizable Smartphone Application for Detecting Falls

Personalizable Smartphone Application for Detecting Falls

引用

IEEE-EMBS International Conference on Biomedical and Health Informatics (BHI)

作者： Medrano, C. Igual, R. Plaza, I. Castro, M. Fardoun, H. M. Univ Zaragoza Escuela Univ Politecn EduQTech Grp Teruel 44003 Spain Spanish Univ Distance Educ UNED Elect & Comp Engn Dept DIEEC Madrid Spain King Abdulazia Univ Jeddah Saudi Arabia

ISBN: (纸本)9781479921317

A personalizable fall detector system is presented in this paper. It relies on a semisupervised novelty detection technique and has been implemented in a smartphone application. Thus, it has been tested that the algorithm can run comfortably in this kind of devices. Details about the internal structure of the application and a preliminary evaluation are also shown. The main difference with previous approaches relies in the fact that semisupervised techniques only require activities of daily life for its operation. Departures from normal movements are considered as falls. In this way, no simulated falls are needed, except for testing the performance. Therefore, the system can be easily adapted to each user.

关键词： Acceleration Accelerometers Aging algorithm design and analysis Classification algorithms Detectors Smart phones

来源：评论

学校读者我要写书评

暂无评论

Quadratic Goldreich-Levin Theorems

Quadratic Goldreich-Levin Theorems

引用

52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)

作者： Tulsiani, Madhur Wolf, Julia Princeton Univ Princeton NJ 08544 USA Ecole Polytech Ctr Math F-91128 Palaiseau France

ISBN: (纸本)9780769545714

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin algorithm [7] can be viewed as an algorithmic analogue of such a decomposition as it gives a way to efficiently find the linear phases associated with large Fourier coefficients. In the study of "quadratic Fourier analysis", higher-degree analogues of such decompositions have been developed in which the pseudorandomness property is stronger but the structured part correspondingly weaker. For example, it has previously been shown that it is possible to express a bounded function as a sum of a few quadratic phases plus a part that is small in the U-3 norm, defined by Gowers for the purpose of counting arithmetic progressions of length 4. We give a polynomial time algorithm for computing such a decomposition. A key part of the algorithm is a local self-correction procedure for Reed-Muller codes of order 2 (over F-2(n)) for a function at distance 1/2 - epsilon from a codeword. Given a function f : F-2(n) -> {-1, 1} at fractional Hamming distance 1/2 - epsilon from a quadratic phase (which is a codeword of Reed-Muller code of order 2), we give an algorithm that runs in time polynomial in n and finds a codeword at distance at most 1/2 - eta for eta = eta (epsilon). This is an algorithmic analogue of Samorodnitsky's result [17], which gave a tester for the above problem. To our knowledge, it represents the first instance of a correction procedure for any class of codes, beyond the list-decoding radius.

关键词： Additives algorithm design and analysis Approximation algorithms Computer science Correlation Fourier analysis Fourier coefficients Hafnium Hamming codes Polynomials Reed-Muller codes Reed-Muller codes algorithmic analogue codeword decomposition theorem f

来源：评论

学校读者我要写书评

暂无评论

A novel genetic algorithm based on image databases for mining association rules

A novel genetic algorithm based on image databases for minin...

引用

6th IEEE/ACIS International Conference on Computer and Information Science in conjunction with 1st IEEE/ACIS International Workshop on e-Activity

作者： Dai, Shangping Gao, Li Zhu, Qiang Zhu, Changwu Hua Zhong Normal Univ Dept Comp Sci Wuhan 430079 Peoples R China Zhejiang Univ Media & Commun Hangzhou 310018 Peoples R China

ISBN: (纸本)9780769528410

Data mining technology has emerged as a means for identifying patterns and trends from large quantities of data. Mining encompasses various algorithms such as clustering, classification, and association rule mining. In this paper we take advantage of the genetic algorithm (GA) designed specifically for discovering association rules. We propose a novel spatial mining algorithm, called ARMNGA(Association Rules Mining in Novel Genetic algorithm), Compared to the algorithm in Reference[2], the ARMNGA algorithm avoids generating impossible candidates, and therefore is more efficient in terms of the execution time.

关键词： Genetic algorithms Image databases Data mining Association rules Clustering algorithms algorithm design and analysis Frequency measurement Computer science Biological cells Genetic mutations

来源：评论

学校读者我要写书评

暂无评论

Informal proof analysis towards testing enhancement 13

Informal proof analysis towards testing enhancement

引用

13th International Symposium on Software Reliability Engineering

作者： Lussier, G Waeselynck, H CNRS LAAS F-31077 Toulouse 4 France

ISBN: (纸本)0769517633

This paper aims at verifying properties of generic fault-tolerance algorithms. Our goal is to enhance the testing process with information extracted from the proof of the algorithm, whether this proof is formal or informal: ideally, testing is intended to focus on the weak parts of the proof (e.g., unproved lemmas or doubtful informal evidence). We use the Fault-Tolerant Rate Monotonic Scheduling algorithm as a case study. This algorithm was proven by informal demonstration, but two faults were revealed afterwards. In this paper we focus on the analysis of the informal proof which we restructure in a semiformal proof tree based on natural deduction. From this proof tree, we extract several functional cases and use them for testing a prototype of the algorithm. Experimental results show that a flawed informal proof does not necessarily provide relevant information for testing. It remains to investigate whether formal (partial) proofs allow better connection with potential faults.

关键词： algorithm design and analysis Buildings Data mining Fault tolerance Information analysis Operating systems Prototypes Sampling methods Scheduling algorithm Testing

来源：评论

学校读者我要写书评

暂无评论

Bio-inspired Adaboost method for efficient face recognition

Bio-inspired Adaboost method for efficient face recognition

引用

Conference on Frontiers in the Convergence of Bioscience and Information Technologies

作者： Sedai, Suman Rhee, Phill Kyu Inha Univ Dept Comp Sci & Engn Inchon South Korea

ISBN: (纸本)9780769529998

We present the design of face recognition system based on the Adaboost algorithm and bio- inspired evolutionary search. We start by extracting the feature vector of the face image based on fixed fiducial points. Then we decompose the strong feature into several feature subsets using GA and classification models of each feature subsets are combined using the Adaboost algorithm. GA searches the best feature combination that gives minimum training error. We use the fixed feature decomposition method, where the length of the feature subset is constant. We use Gabor filter of 8 orientations and 8 frequencies to extract the feature of the face. Experiments are conducted on FERET database which contains 2418 images of 1209 subjects taking 2 images per subject. The outcome of these experiments suggests that the classification model using aggregation of feature combinations by means of Adaboost and GA gives better result than classification model that uses the entire feature vector.

关键词： Face recognition Feature extraction Spatial databases Image converters Information technology Computer science design engineering algorithm design and analysis Gabor filters Frequency

来源：评论

学校读者我要写书评

暂无评论

On the Local Structure of Stable Clustering Instances 58

On the Local Structure of Stable Clustering Instances

引用

58th IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Cohen-Addad, Vincent Schwiegelshohn, Chris Univ Copenhagen Copenhagen Denmark Sapienza Univ Rome Rome Italy

ISBN: (纸本)9781538634646

We study the classic k-median and k-means clustering objectives in the beyond-worst-case scenario. We consider three well-studied notions of structured data that aim at characterizing real-world inputs: Distribution Stability (introduced by Awasthi, Blum, and Sheffet, FOCS 2010) Spectral Separability (introduced by Kumar and Kannan, FOCS 2010) Perturbation Resilience (introduced by Bilu and Linial, ICS 2010) We prove structural results showing that inputs satisfying at least one of the conditions are inherently "local". Namely, for any such input, any local optimum is close both in term of structure and in term of objective value to the global optima. As a corollary we obtain that the widely-used Local Search algorithm has strong performance guarantees for both the tasks of recovering the underlying optimal clustering and obtaining a clustering of small cost. This is a significant step toward understanding the success of local search heuristics in clustering applications.

关键词： Clustering algorithms Approximation algorithms algorithm design and analysis Stability analysis Extraterrestrial measurements Resilience

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：