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

7th international workshop on Approximation algorithms for Combinatorial optimization Problems, APPROX 2004 and 8th international workshop on Randomization and Computation, RANDOM 2004

ISBN: (纸本)3540228942

The proceedings contain 37 papers. The special focus in this conference is on Approximation algorithms for Combinatorial optimization Problems. The topics include: Designing networks with existing traffic to support fast restoration;simultaneous source location;computationally-feasible truthful auctions for convex bundles;randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks;on the crossing spanning tree problem;maximum coverage problem with group budget constraints and applications;the greedy algorithm for the minimum common string partition problem;approximating additive distortion of embeddings into line metrics;polylogarithmic inapproximability of the radio broadcast problem;on systems of linear equations with two variables per equation;an auction-based market equilibrium algorithm for the separable gross substitutability case;cost-sharing mechanisms for network design;approximation schemes for broadcasting in heterogenous networks;centralized deterministic broadcasting in undirected multi-hop radio networks;convergence issues in competitive games;on semidefinite relaxations for the linear ordering problem;the chromatic number of random regular graphs;estimating the distance to a monotone function;derandomizing approximate quantum encryption;the sketching complexity of pattern matching;non-abelian homomorphism testing, and distributions close to their self-convolutions;robust locally testable codes and products of codes;a stateful implementation of a random function supporting parity queries over hypercubes;counting connected graphs and hypergraphs via the probabilistic method;improved randomness extraction from two independent sources and the diameter of randomly perturbed digraphs and some applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automated slogan production using a genetic algorithm

Automated slogan production using a genetic algorithm

引用

Student workshop on Bioinspired optimization Methods and their applications, BIOMA 2014

作者： Tomašič, Polana Papa, Gregor Žnidaršič, Martin XLAB Pot za Brdom 100 Ljubljana1000 Slovenia Jožef Stefan International Postgraduate School Ljubljana Slovenia Computer Systems Department Jožef Stefan Institute Ljubljana Slovenia Department of Knowledge Technologies Jožef Stefan Institute Ljubljana Slovenia

Invention of slogans is an intelligent and highly creative task. As such, it is a challenging problem for computational methods. In this paper we present our solution based on the use of linguistic resources and evolu... 详细信息

ISBN: (纸本)9789612640682

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

optimization of the FIND Algorithm to Compute the Inverse of a Sparse Matrix

Optimization of the FIND Algorithm to Compute the Inverse of...

引用

13th international workshop on Computational Electronics

作者： Li, S. Darve, E. Stanford Univ Inst Computat & Math Engn Stanford CA 94305 USA

ISBN: (纸本)9781424439256

The FIND algorithm is a fast algorithm designed to calculate entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. For a 2D device discretized as N x N mesh, the best known algorithms have a running time of O(N(4)), whereas FIND only requires O(N(3)), although with a larger constant factor. By exploiting the extra sparsity and symmetry, the size of the problem where FIND becomes faster than others may decrease from a 130 x 130 mesh down to a 40 x 40 mesh. This improvement will make the optimized FIND algorithm appealing to small problems as well, thus becoming competitive for most real applications.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Nonnegative matrix factorization with constrained second-order optimization

引用

SIGNAL PROCESSING 2007年第8期87卷 1904-1916页

作者： Zdunek, Rafal Cichocki, Andrzej RIKEN Brain Sci Inst Lab Adv Brain Signal Proc Wako Saitama 3510198 Japan Wroclaw Univ Technol Inst Telecommun Teleinformat & Acoust Wroclaw Poland Warsaw Univ Technol Warsaw Poland

Nonnegative matrix factorization (NMF) solves the following problem: find notinegative matrices A epsilon R-+(MxR) and X epsilon R-+(RxT) such that Y congruent to AX, given only Y epsilon R-MxT and the assigned index R. This method has found a wide spectrum of applications in signal and image processing, such as blind source separation (BSS), spectra recovering, pattern recognition, segmentation or clustering. Such a factorization is usually performed with an alternating gradient descent technique that is applied to the squared Euclidean distance or Kullback-Leibler divergence. This approach has been used in the widely known Lee-Seung NMF algorithms that belong to a class of multiplicative iterative algorithms. It is well known that these algorithms, in spite of their low complexity, are slowly convergent, give only a strictly positive solution, and can easily fall into local minima of a nonconvex cost function. In this paper, we propose to take advantage of the second-order terms of a cost function to overcome the disadvantages of gradient (multiplicative) algorithms. First, a projected quasi-Newton method is presented, where a regularized Hessian with the Levenberg-Marquardt approach is inverted with the Q-less QR decomposition. Since the matrices A and/or X are usually sparse, a more sophisticated hybrid approach based on the gradient projection conjugate gradient (GPCG) algorithm, which was invented by More and Toraldo, is adapted for NMF. The gradient projection (GP) method is exploited to find zero-value components (active), and then the Newton steps are taken only to compute positive components (inactive) with the conjugate gradient (CG) method. As a cost function, we used the a-divergence that unifies many well-known cost functions. We applied our new NMF method to a BSS problem with mixed signals and images. The results demonstrate the high robustness of our method. (C) 2007 Elsevier B.V. All rights reserved.

关键词： nonnegative matrix factorization blind source separation quasi-Newton method GPCG second-order optimization fixed-point algorithm

来源：评论

学校读者我要写书评

暂无评论

On the design of ACO for the biobjective quadratic assignment problem

引用

4th international workshop on Ant Colony optimization and Swarm Intelligence

作者： López-Ibáñez, M Paquete, L Stützle, T Tech Univ Darmstadt Dept Comp Sci Intellect Grp D-64283 Darmstadt Germany

ISBN: (纸本)3540226729

Few applications of ACO algorithms to multiobjective problems have been presented so far and it is not clear how to design an effective ACO algorithms for such problems. In this article, we study the performance of several ACO variants for the biobjective Quadratic Assignment Problem that are based on two fundamentally different search strategies. The first strategy is based on dominance criteria, while the second one exploits different scalarizations of the objective function vector. Further variants differ in the use of multiple colonies, the use of local search, and the pheromone update strategy. The experimental results indicate that the use of local search procedures and the correlation between objectives play an essential role in the performance of the variants studied in this paper.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

algorithms for IP network design with end-to-end QoS constraints

引用

COMPUTER NETWORKS 2006年第8期50卷 1086-1103页

作者： Wille, ECG Mellia, M Leonardi, E Marsan, MA Politecn Torino I-10129 Turin Italy Fed Technol Educ Ctr Parana Dept Elect Curitiba Parana Brazil

The new generation of packet-switching networks is expected to support a wide range of communication-intensive real-time multimedia applications. A key issue in the area is how to devise reasonable packet-switching network design methodologies that allow the choice of the most adequate set of network resources for the delivery of a given mix of services with the desired level of end-to-end Quality of Service (e2e QoS) and, at the same time, consider the traffic dynamics of today's packet-switching networks. In this paper, we focus on problems that arise when dealing with this subject, namely Buffer Assignment (BA), Capacity Assignment (CA), Flow and Capacity Assignment (FCA), Topology, Flow and Capacity Assignment (TCFA) problems. Our proposed approach maps the end-user's performance constraints into transport-layer performance constraints first, and then into network-layer performance constraints. This mapping is then considered together with a refined TCP/IP traffic modeling technique, that is both simple and capable of producing accurate performance estimates, for general-topology packet-switching design networks subject to realistic traffic patterns. Sub-problems are derived from a general design problem and a collection of heuristic algorithms are introduced for compute approximate solutions. We illustrate examples of network planning/dimensioning considering Virtual Private Networks (VPNs). (c) 2005 Elsevier B.V. All rights reserved.

关键词： packet-switching networks design and planning TCP/IP queueing theory mathematical programming/optimization heuristic methods

来源：评论

学校读者我要写书评

暂无评论

2011 3rd international workshop on Intelligent Systems and applications, ISA 2011 - Proceedings

2011 3rd International Workshop on Intelligent Systems and A...

引用

2011 3rd international workshop on Intelligent Systems and applications, ISA 2011

ISBN: (纸本)9781424498574

The proceedings contain 214 papers. The topics discussed include: an algorithm for solving knapsack problems utilizing knowledge evolution principle;coupled direct and indirect positive feedback loop motifs induce robust synchronized bursting behaviors;chaos control of permanent magnet synchronous motor via sliding mode variable structure scheme;an improved novel kernel parameter optimization and application;modified artificial bee colony algorithms for numerical optimization;requirement analysis for data warehouses based on the tropos;selection of continuous features based on distribution of objects;analysis of reservoir slopes based on fuzzy disturbance ant-cluster algorithm;component placement process optimization for multi-head surface mounting machine based on Tabu search and improved shuffled frog-leaping algorithm;and a dynamic intrusion detection model based on immunity for wireless sensor network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Particle Swarm optimization Algorithm for Finding DNA Sequence Motifs

A Particle Swarm Optimization Algorithm for Finding DNA Sequ...

引用

IEEE international Conference on Bioinformatics and Biomedicine

作者： Lei, Chengwei Ruan, Jianhua Univ Texas San Antonio Dept Comp Sci San Antonio TX 78249 USA

ISBN: (纸本)9781424428908

Discovering short DNA motifs from a set of co-regulated genes is an important step towards deciphering the complex gene regulatory networks and understanding gene functions. Despite significant improvement in the last decade, it still remains one of the most challenging problems in both computer science and molecular biology. In this work, we propose a novel motif finding algorithm based on a population-based stochastic optimization technique called Particle Swarm optimization (PSO), which has been shown to be effective in optimizing difficult multidimensional problems in many fields. However PSO has mainly been applied to problems in continuous domains. The motif finding problem, which is essentially a multiple local alignment problem, is discrete, as a slight shift in one sequence completely changes the alignment. Therefore, we propose to use a word dissimilarity graph to remap the neighborhood structure of the solution space, which transforms the motif finding problem into a contiguous integer domain, and propose a modification of the naive PSO algorithm to accommodate integer variables. In order to improve efficiency, we also propose several strategies for escaping from local optima, and determining the termination criteria automatically. Experimental results on simulated challenge problems show that our method is both more efficient and more accurate than several existing algorithms. applications to several sets of real promoter sequences also show that our approach is able to detect known transcription factor binding sites, and outperforms two of the most successful existing algorithms.

关键词： Molecular biology

来源：评论

学校读者我要写书评

暂无评论

Bird Body and Wing-Beat Radar Doppler Signature Separation using Sparse optimization 4

Bird Body and Wing-Beat Radar Doppler Signature Separation u...

引用

4th international workshop on Compressed Sensing Theory and its applications to Radar, Sonar and Remote Sensing (CoSeRa)

作者： Farshchian, Masoud Selesnick, Iva Parekh, Ankit Empyreal Waves LLC Fairfax Stn VA 22039 USA NYU Tandon Sch Engn Brooklyn NY USA

ISBN: (纸本)9781509029204

Radar bird detection and discrimination has many civilian and non-civilian applications such as collision avoidance, false alarm reduction for detection radars, stealthy target detection, classification of military unmanned aerial vehicles (UAVs) and civilian drones, and conservation ecology. In order to develop new and improve existing detection and discrimination algorithms, this paper proposes a feature extraction technique in which the wing-beat Doppler radar signature of a bird is separated from its respective body signature. More specifically, we propose non-linear morphological component analysis (MCA) using invertible short-time Fourier transform (STFT) for feature extraction. The method is applied to the Peregrine falcon data measured by Alabaster et al. (2012) resulting in successful separation of the aforementioned signatures.

关键词： Birds

来源：评论

学校读者我要写书评

暂无评论

Recent applications and numerical implementation of quasi-Newton methods for solving nonlinear systems of equations

引用

NUMERICAL algorithms 2004年第2-4期35卷 261-285页

作者： Pérez, R Lopes, VLR Univ Cauca Dept Math Popayan Cauca Colombia Univ Estadual Campinas Dept Appl Math IMECC UNICAMP BR-13081970 Campinas SP Brazil

This paper presents a survey on recent applications of quasi-Newton methods to solve nonlinear systems of equations which appear in applied areas such as physics, biology, engineering, geophysics, chemistry and industry. It is also presented a comparative analysis of the performance of the ICUM (Inverse Column-Updating Method) and Broyden's method when applied to some of the problems mentioned above.

关键词： nonlinear systems quasi-Newton methods Broyden's method inverse column-udpating method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：