2017年02月_MyLinChi

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

转载解决qt调试时Unknown debugger type "No Engine"(转载)

问题描述如图，qt能编译不能调试发生原因： windows的qt有两个版本一种是vs的编译器，一种是MinGW的。种问题主要是发生在选择了MSVC2013编译器的版本，这个版本的qt需要再装一个调试器，而MinGW不用。解决方法： (转自http://www.cnblogs.com/xiaomanon/p/3866736.html) 首先到微软官

2017-02-20 20:41:00 1361

转载 QTextCodec中的setCodecForTr等终于消失了 (Qt5)

在Qt4中，国内很多新手都喜欢——不分青红皂白地使用如下3行代码 QTextCodec::setCodecForTr(...) QTextCodec::setCodecForCStrings(...) QTextCodec::setCodecForLocale(...) 尽管之前零零散散写过一点这方面的内容，比如 QString 与中文问题 Qt中transla

2017-02-19 21:55:52 985

原创 VS2013编译环境集成QT的配置方法

下载文件（注：大文件是QT安装包，小文件是vs插件） 1.安装QT：双击QT安装包， “next”, "skip", "next", 设定好路径后“next”, "next", 同意后"next", "next", "install" 2.安装vs插件双击vs插件安装包， "next"，同意后“next”, "next", 设置好路径后“Insta

2017-02-19 21:31:19 1139

原创 word2010 排版问题

问题一：如何在指定页开始插入页码呢? 例如：以第2页开始在页面的下方中间以"-1-"的格式插入页码？ ①将光标定位到第1页的末尾。 ②“页面布局”->“分隔符”->“下一页” ③“插入”->"页码"->"页面低端"->"普通数字2" ④“页码”->“设置页码格式” 设置如下所示然后确定 ⑤定位到2页，点击“连接到前一条页眉” 删除第一页的页码数字

2017-02-19 19:11:24 1255

原创 vs2013下配置GDI+的步骤

GDI+是Windows XP和Windows Server 2003的一个子系统，它主要用于处理系统的绘制消息。GDI+所有的功能都被封装在一组C++类中，这些类提供了统一的图形接口，让开发者能够编写设备独立的图形程序。一下是vs2013下配置GDI+的详细步骤（以单文档项目为例，其他的类似） 1.新建项目的向导设置如下。 2.为项目在连接时添加gdiplus.lib "项目"

2017-02-12 14:57:49 3893 3

原创 vc数字图像处理中遇到的问题

1.使用LoadImage只能载入bmp格式的图片文件，如果图片原来是.jpg格式的，即使改后缀名也是没用的。解决的办法可以是进行格式转换或者截图后保存为.bmp格式的图片。（未完待续）

2017-02-07 21:13:03 853

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