2017年04月_MyLinChi

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

转载 Matlab下各个滤波器传递函数透视图的绘制

原文地址：http://blog.csdn.net/ljp1919/article/details/44781215本文主要绘制常用滤波器的透视图，包括低通，带阻和带通滤波器。而这三类滤波器又各自包含了理想、巴特沃兹和高斯滤波器。如，低通滤波器就可以分为理想低通滤波器、n阶巴特沃兹滤波器和高斯低通滤波器。第一：低通滤波器1）理想低通滤波器传递函数：

2017-04-28 20:18:02 5471

转载 Qt QIcon图标不显示

1：路径:/前缀/文件名或别名前缀为：/img 文件名为：a.png路径： :/img/a.png2：删除Qt Creater在编译生成文件时自动生成的release或debug文件夹，然后重新编译执行（demo005程序对应生成的debug或release文件夹删除）即Qt Creator中项目右键清除转自：http://b

2017-04-19 21:46:41 3787

Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly categorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving them. In Part II, we present linear programming based algorithms. These are categorized under two fundamental techniques: rounding and the primaldual schema. But once again, the exact approximation guarantee obtainable depends on the specific LP-relaxation used, and there is no fixed recipe for discovering good relaxations, just as there is no fixed recipe for proving a theorem in mathematics (readers familiar with complexity theory will recognize this as the philosophical point behind the P -=/= NP question).

2020-04-26