凸优化在信号处理与通信中的应用Convex Optimization in Signal Processing and Communications
凸优化理论在信号处理以及通信系统中的应用 比较经典的通信系统凸优化入门教程ContentsList of contributorspage IxPrefaceAutomatic code generation for real- time convex optimizationJacob Mattingley and stephen Boyd1.1 Introduction1.2 Solvers and specification languages61. 3 Examples121. 4 Algorithm considerations1.5 Code generation261.6 CVXMOD: a preliminary implementation281.7 Numerical examples291. 8 Summary, conclusions, and implicationsAcknowledgments35ReferencesGradient-based algorithms with applications to signal-recoveryproblemsAmir beck and marc teboulle2.1 Introduction422.2 The general optimization model432.3 Building gradient-based schemes462. 4 Convergence results for the proximal-gradient method2.5 A fast proximal-gradient method2.6 Algorithms for l1-based regularization problems672.7 TV-based restoration problems2. 8 The source-localization problem772.9 Bibliographic notes83References85ContentsGraphical models of autoregressive processes89Jitkomut Songsiri, Joachim Dahl, and Lieven Vandenberghe3.1 Introduction893.2 Autoregressive processes923.3 Autoregressive graphical models983. 4 Numerical examples1043.5 Conclusion113Acknowledgments114References114SDP relaxation of homogeneous quadratic optimization: approximationbounds and applicationsZhi-Quan Luo and Tsung-Hui Chang4.1 Introduction1174.2 Nonconvex QCQPs and sDP relaxation1184.3 SDP relaxation for separable homogeneous QCQPs1234.4 SDP relaxation for maximization homogeneous QCQPs1374.5 SDP relaxation for fractional QCQPs1434.6 More applications of SDP relaxation1564.7 Summary and discussion161Acknowledgments162References162Probabilistic analysis of semidefinite relaxation detectors for multiple-input,multiple-output systems166Anthony Man-Cho So and Yinyu Ye5.1 Introduction1665.2 Problem formulation1695.3 Analysis of the SDr detector for the MPsK constellations1725.4 Extension to the Qam constellations1795.5 Concluding remarks182Acknowledgments182References189Semidefinite programming matrix decomposition, and radar code design192Yongwei Huang, Antonio De Maio, and Shuzhong Zhang6.1 Introduction and notation1926.2 Matrix rank-1 decomposition1946.3 Semidefinite programming2006.4 Quadratically constrained quadratic programming andts sdp relaxation201Contents6.5 Polynomially solvable QCQP problems2036.6 The radar code-design problem2086.7 Performance measures for code design2116.8 Optimal code design2146.9 Performance analysis2186.10 Conclusions223References226Convex analysis for non-negative blind source separation withapplication in imaging22Wing-Kin Ma, Tsung-Han Chan, Chong-Yung Chi, and Yue Wang7.1 Introduction2297.2 Problem statement2317.3 Review of some concepts in convex analysis2367.4 Non-negative, blind source-Separation criterion via CAMNS2387.5 Systematic linear-programming method for CAMNS2457.6 Alternating volume-maximization heuristics for CAMNS2487.7 Numerical results2527.8 Summary and discussion257Acknowledgments263References263Optimization techniques in modern sampling theory266Tomer Michaeli and yonina c. eldar8.1 Introduction2668.2 Notation and mathematical preliminaries2688.3 Sampling and reconstruction setup2708.4 Optimization methods2788.5 Subspace priors2808.6 Smoothness priors2908.7 Comparison of the various scenarios3008.8 Sampling with noise3028. 9 Conclusions310Acknowledgments311References311Robust broadband adaptive beamforming using convex optimizationMichael Rubsamen, Amr El-Keyi, Alex B Gershman, and Thia Kirubarajan9.1 Introduction3159.2 Background3179.3 Robust broadband beamformers3219.4 Simulations330Contents9.5 Conclusions337Acknowledgments337References337Cooperative distributed multi-agent optimization340Angelia Nedic and asuman ozdaglar10.1 Introduction and motivation34010.2 Distributed-optimization methods using dual decomposition34310.3 Distributed-optimization methods using consensus algorithms35810.4 Extensions37210.5 Future work37810.6 Conclusions38010.7 Problems381References384Competitive optimization of cognitive radio MIMO systems via game theory387Gesualso Scutari, Daniel P Palomar, and Sergio Barbarossa11.1 Introduction and motivation38711.2 Strategic non-cooperative games: basic solution concepts and algorithms 39311.3 Opportunistic communications over unlicensed bands411.4 Opportunistic communications under individual-interferenceconstraints4151.5 Opportunistic communications under global-interference constraints43111.6 Conclusions438Ackgment439References43912Nash equilibria: the variational approach443Francisco Facchinei and Jong-Shi Pang12.1 Introduction44312.2 The Nash-equilibrium problem4412. 3 EXI45512.4 Uniqueness theory46612.5 Sensitivity analysis47212.6 Iterative algorithms47812.7 A communication game483Acknowledgments490References491Afterword494Index49ContributorsSergio BarbarossaYonina c, eldarUniversity of rome-La SapienzaTechnion-Israel Institute of TechnologyHaifaIsraelAmir beckTechnion-Israel instituteAmr El-Keyiof TechnologyAlexandra universityHaifEgyptIsraelFrancisco facchiniStephen boydUniversity of rome La sapienzaStanford UniversityRomeCaliforniaItalyUSAAlex b, gershmanTsung-Han ChanDarmstadt University of TechnologyNational Tsing Hua UniversityDarmstadtHsinchuGermanyTaiwanYongwei HuangTsung-Hui ChangHong Kong university of scienceNational Tsing Hua Universityand TechnologyHsinchuHong KongTaiwanThia KirubarajanChong-Yung chiMcMaster UniversityNational Tsing Hua UniversityHamilton ontarioHsinchuCanadaTaiwanZhi-Quan LuoJoachim dahlUniversity of minnesotaanybody Technology A/sMinneapolisDenmarkUSAList of contributorsWing-Kin MaMichael rebsamenChinese University of Hong KongDarmstadt UniversityHong KonTechnologyDarmstadtAntonio de maioGermanyUniversita degli studi di napoliFederico iiGesualdo scutariNaplesHong Kong University of Sciencealyand TechnologyHong KongJacob MattingleyAnthony Man-Cho SoStanford UniversityChinese University of Hong KongCaliforniaHong KongUSAJitkomut songsinTomer michaeliUniversity of californiaTechnion-Israel instituteLoS Angeles. CaliforniaogyUSAHaifaMarc teboulleTel-Aviv UniversityAngelia NedicTel-AvUniversity of Illinois atIsraelUrbana-ChampaignInoSLieven VandenbergheUSAUniversity of CaliforniaLos Angeles, CaliforniaUSAAsuman OzdaglarMassachusetts Institute of TechnologyYue WangBoston massachusettsVirginia Polytechnic InstituteUSAand State UniversityArlingtonDaniel p palomarUSAHong Kong University ofScience and TechnologyYinyu YeHong KongStanford UniversityCaliforniaong-Shi PangUSAUniversity of illinoisat Urbana-ChampaignShuzhong zhangIllinoisChinese university of Hong KongUSAHong KongPrefaceThe past two decades have witnessed the onset of a surge of research in optimization.This includes theoretical aspects, as well as algorithmic developments such as generalizations of interior-point methods to a rich class of convex-optimization problemsThe development of general-purpose software tools together with insight generated bythe underlying theory have substantially enlarged the set of engineering-design problemsthat can be reliably solved in an efficient manner. The engineering community has greatlybenefited from these recent advances to the point where convex optimization has nowemerged as a major signal-processing technique on the other hand, innovative applica-tions of convex optimization in signal processing combined with the need for robust andefficient methods that can operate in real time have motivated the optimization commu-nity to develop additional needed results and methods. The combined efforts in both theoptimization and signal-processing communities have led to technical breakthroughs ina wide variety of topics due to the use of convex optimization This includes solutions tonumerous problems previously considered intractable; recognizing and solving convex-optimization problems that arise in applications of interest; utilizing the theory of convexoptimization to characterize and gain insight into the optimal-solution structure and toderive performance bounds; formulating convex relaxations of difficult problems; anddeveloping general purpose or application-driven specific algorithms, including thosethat enable large-scale optimization by exploiting the problem structureThis book aims at providing the reader with a series of tutorials on a wide varietyof convex-optimization applications in signal processing and communications, writtenby worldwide leading experts, and contributing to the diffusion of these new developments within the signal-processing community. The goal is to introduce convexoptimization to a broad signal-processing community, provide insights into how convexoptimization can be used in a variety of different contexts, and showcase some notablesuccesses. The topics included are automatic code generation for real-time solvers, graphical models for autoregressive processes, gradient-based algorithms for signal-recoveryapplications, semidefinite programming(SDP)relaxation with worst-case approximationperformance, radar waveform design via SDP, blind non-negative source separation forimage processing, modern sampling theory, robust broadband beamforming techniquesdistributed multiagent optimization for networked systems, cognitive radio systems viagame theory, and the variational-inequality approach for Nash-equilibrium solutionsPrefaceThere are excellent textbooks that introduce nonlinear and convex optimization, providing the reader with all the basics on convex analysis, reformulation of optimizationproblems, algorithms, and a number of insightful engineering applications. This book istargeted at advanced graduate students, or advanced researchers that are already familiarwith the basics of convex optimization. It can be used as a textbook for an advanced graduate course emphasizing applications, or as a complement to an introductory textbookthat provides up-to-date applications in engineering. It can also be used for self-study tobecome acquainted with the state of-the-art in a wide variety of engineering topicsThis book contains 12 diverse chapters written by recognized leading experts worldwide, covering a large variety of topics. Due to the diverse nature of the book chaptersit is not possible to organize the book into thematic areas and each chapter should betreated independently of the others. a brief account of each chapter is given nextIn Chapter 1, Mattingley and Boyd elaborate on the concept of convex optimizationin real-time embedded systems and automatic code generation. As opposed to genericsolvers that work for general classes of problems, in real-time embedded optimization thesame optimization problem is solved many times, with different data, often with a hardreal-time deadline. Within this setup the authors propose an automatic code-generationsystem that can then be compiled to yield an extremely efficient custom solver for theproblem familyIn Chapter 2, Beck and Teboulle provide a unified view of gradient-based algorithmsfor possibly nonconvex and non-differentiable problems, with applications to signalrecovery. They start by rederiving the gradient method from several different perspectives and suggest a modification that overcomes the slow convergence of the algorithmThey then apply the developed framework to different image-processing problems suchas e1-based regularization, TV-based denoising, and Tv-based deblurring, as well ascommunication applications like source localizationIn Chapter 3, Songsiri, Dahl, and Vandenberghe consider graphical models for autore-gressive processes. They take a parametric approach for maximum-likelihood andmaximum-entropy estimation of autoregressive models with conditional independenceconstraints, which translates into a sparsity pattern on the inverse of the spectral-densitymatrix. These constraints turn out to be nonconvex. To treat them the authors proposea relaxation which in some cases is an exact reformulation of the original problem. Theproposed methodology allows the selection of graphical models by fitting autoregressiveprocesses to different topologies and is illustrated in different applicationsThe following three chapters deal with optimization problems closely related to SDPand relaxation techniquesIn Chapter 4, Luo and Chang consider the SDP relaxation for several classes ofquadratic-optimization problems such as separable quadratically constrained quadraticprograms(QCQPs)and fractional QCQPs, with applications in communications and signal processing. They identify cases for which the relaxation is tight as well as classes ofquadratic-optimization problems whose relaxation provides a guaranteed, finite worstcase approximation performance. Numerical simulations are carried out to assess theefficacy of the SDP-relaxation approach
- 2020-12-10下载
- 积分：1
鸡啄米VS2010-MFC编程入门教程
鸡啄米的这套VS2010/MFC编程入门教程到此就全部完成了，虽然有些内容还未涉及到，但帮助大家进行VS2010/MFC的入门学习业已足够。以此教程的知识为基础，学习VS2010/MFC较为深入的内容已非难事。作为本教程的最后一课，鸡啄米将对前面所讲内容进行目录归纳，并对这八个月加班加点的努力进行总结。vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米每布课的写作耗时差不多都在两三个小时以上,有时侯甚全写到凌晨一点多。付出了很多,同样也收获了很多,最大的收获莫过于大家的肯定和支,很多朋友都韶言或者发郎件支持鸡啄米,这说明我的辛勤劳动没有白费,帮助了很多人,感谢那些一直以来支关注鸡啄米的朋友,也特别感谢那些在鸡啄米经常留言支持的读者除了大家的支持,鸡啄米自己也通过本教程的完成更深入的理解了的很多内容,提高了对的认认水平,尤其是更加巩了一些较少使用的知认。在帮人的同时也帮了自己很多朋友在鸡啄米留言或者给鸡啄米发电子邮件讨论问题,由时间确实比较少,晚上夏新文章,白天上班,所以只叵复了一部分,望大家见谅。学会了编程,很多人就开始喜欢硏究了,但是提醒大家不要忘了根本,即谙言。从《鸡啄米编程入门系列》和《编程入门教程》这套学习教程的受欢迎程度,鸡啄米感觉大家有些忽规的学习,更喜欢应用性强的在你能熟练使用后,最好再认真学学,提高水平才能真正亡你的编程功力上一个台阶。以后鸡啄米会铼续分亨各种编程知识,还会编写一些教程,希曌人家能一如既往约关注鸡啄米网站,支持鸡啄米!格力高百力漆清风原木纯品系列了!这一耙已有微虾味)*1盒3层谜你纸手帕“10包已D体被害送出兔费领』兔费领推您可能也喜欢:日分2编程入门编稈入编稈入编程入编程入之三应用门之三十九(文档、门之十三(常门之刀十六常门之一五(对话框程序工程中文件的组视图和框架:概述)用类类月类异常处一股属性页对话框的成结构)创建及显示)除非特别注明,鸡啄兴文章均为原创转载请标明本文地止作着鸡啄米分类软件开发浏览评论上一篇:互联网的轻时代已成为趋势下一篇:最全面详细的评测相关文章编程入门之五十四界Ⅲ开发:使用更多空件并为控科添加消息欠理凶数)编程入门之五|三(界面开发:为添加控件)编程入门之开十二(界Ⅲ开发:创建样式的应用程序框架)编程入门之五十一(图形图像:对象之画刷编程入门之五十(图形图像:对象之画笔编程入门之四|元(图形图像:类及其屏暮绘图函数)编程入门之四十八(字体朴文本输出:文输出)编程入门之四十七(字体和文本输出:字体类)编程入门之四十六(常用类:异常处理)http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米编程入门之四十五(常用类文件操作类)楼我的名字叫麒我一直自学编程,觉得它比别的都好回复该留言楼愚人笔记希望还有下一个系列面世66鸡啄米于回复嗯,会有的,呵呵回复该留言楼蛉啊了非常感谢!继续加油!回复该留言偻楼主好热心好感动啊写了这么多而且写的非常详细!!再次谢谢你们。。虽然今天查百度无意间点到这里的,不过攸货确实好多,记住鸡啄米了哈!!!。。祝你们网站越来越火哈,,以后我会经常来你们网站的哈哈≤6鸡啄米于回复志同道合的朋友越来越多了回复该留言楼学土之爱楼主了不起啊回复该留言楼求助救助:按你第课制作的计算器,我加入了一个减法功能,里面参数如下初始时刻三个变量对立的都是,我需要他们为空也就是什么都没有还有就是输入数据后或没入数据而按时程序会自动结束,改怎么办?≤鸡啄米于回复变量是存到内存中的,它是不可能为空的,即使你没有赋初值,它也会有初值。按回车退出一般是因为默认按紐是,取消默认按钮或者把中的注掉就行了求助于回复谢谢老师,问题我已经解决了回复该留言楼李志红博客反正不懂这个,米看看。回复该留言http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米楼点点滴滴写得非常好,加油回复该留言楼欲取消子节点缩进您好,米哥,我想取消子节点与父节点的缩进,请问应该如何做啊!谢谢啊由鸡啄米于最后编辑回复该留言楼迷哎呀不得了,最近车学回复该留言写的真的非常详细,非常好!!!!怒赞于回复喽主虽是写技术博客,可惜一点讨论的氛围都没有,都是一些菜鸟在这淫须马,博客的板式中也只有喜欢和推两^能,连反对的机会都不给,可见作者多么自恋和自大。让人匪所思!写博客不是为了技术探讨,这种浅尝揶止的文章不如不看!写出来的东西也是玩具,实际立用中很容易腐烂。回复该留言第一次发现这个好东西,顶起,写得真好。回复该留言楼楼主好热心力能的热心楼主啊!!里加入控件怎么加啊????百度半大了也摆不到66喽主好热心于回复楼主快出现呀6鸡啄米于回复,日前还没用过控件,建议再搜索下,网上应该有相关资料回复该留言楼我考研的目的有点像博主,但我是因为自已出太真心没实力的说。。学的不是亡算机,本科也是浑浑噩噩的过去,化了点时间去考研,刚第一个学期,日子依旧浑浑噩噩的,因为要上程序课偶然发现这个对站。。看了博工一番感概,觉得自己确实要给自己一^定位一个方叵,但是我这专业有时候确实让人很迷茫。。。而且现在做什么都克制不住白三可以花上一天的时间看美剧。。。ε最近一直在想我到底该怎么做是好鸡啄米于回复想做什么一定要下决心,尤其是学生阶段,不要到找工作的时侯再着急回复该留言最近在学习很高兴能参照着博主的资料,一步一步一点点的学习下去。对于一个白来说是很好的入门学习材料。希望自己能在本门底将搞定,吼吼。再次感谢博主!!!http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米《鸡啄米于回复别急,步来,柞信看完我的教程:你入门没有问题回复该留言楼米哥,可有打算扩允教程,加个动态链接库编程什么的冫求指导啊,同忐们可是翘首以盼那6鸡啄米于回复这个后面会考愿回复该留言楼路过支持一下!6鸡啄米于回复谢谢攴持.欢迎常来逛逛回复该留言楼支持楼主辛苫了,写的很不错,是我们项目老大推荐给我看的,我是才入手,看了很有帮助,期待后续还有更好的。鸡啄米于回复谢谢你的支持,也谢谢你们老大。欢迎常米交流。回复该留言楼分享奉献让这个世界更好。感谢博主《鸡啄米于回复妇果有这和想法的人多了,那我们都能提高很快回复该留言楼蛋蛋蛋我不是程序员,但是在跟老师做目时经常要编写或调试一些程序。每当遇到不明白的就先来看看这里有没有介绍。博主的博客写的精炼,用最通俗的语言把和中一些特性的最主要内容介绍出来,让读者省时省力的同时,又能理解这些特生的灵龙去脉,即思想和用法。希望博主的博客开的长久,有需要还会经常来的≤6鸡啄米丁回复我就是希望能这样帮助大家,有东匹需要了解就到这里末查查大家也可以给我投稿,跟众多网友分享自已的看法和经验等。回复该留言你写的文章我都能把实例做出,但是对事件处理的每句语句的意思就不明白了,让自己写肯定也写不出兴。怎么办呀求指教?6鸡啄米于回复http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米多看几遍:自已多写写,最后一定会明白的回复该留言楼穷者独善其身,达者兼济大卜!楼主是一个脱离了低级趣味的好人!≤鸡啄米于回复谢谢,只是想大家分享些已经掌握的知识回复该留言兴哥,我已经把你的教程从第一篇看到这篇了(),收获很夭,希堊博主在写个数据库编程的。。。。回复该留言楼我的名字叫麒攸藏了,博主你千万别删除啊!回复该留言很有帮助,请问一下哈就是我如果创建了多个对正框,在一个对话框中点击按钮如何调用另一^对话框并且之前的对话框不消失?还有就是除了主对话框,其他对话框中的函数在那里改呢?谢谢!祝越办越好6鸡啄米于回复第一个叫颙,在对话柞的单击消息响应函数口,构造另一个对话枉的对象,然后调用成员函数,就可以了。第二个问题,其他对话框在使用前肯定要为其创建类,在对话框类中修改函数回复常感谢您的解答,又遇到一个问题,就是我添加了一个空间(在另一个对话框中)添加控制变量为在其中添加了成员函数为什么运行后,程序崩溃了?回复该留言楼简搜百科谢谢真的!辛苫了回复该留言我是住新建对话框的类中添加了一个成员函数如果是在主对话框中控件是可以添加字符的,为什么呢?谢啦回复该留言http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米能不能出一个美化界面的专题,比如怎么设置背景图突啊,之类的,谢谢拉66鸡啄米于回复不错的要求,先记下,有会为大家奉上回复该留博主,请冋一个叫颗哈,很感谢。我要做一个地图染色的程序,用种子填充法染色速度很慢,一个像素一个像素地染,有没有能很快填充整个区域的函数?谢谢!回复该留言楼读研期间要用,米哥这两套教程卡常好,感谢楼主并支持6鸡啄米于回复研究生阶段学的不少,望能给别人推荐下鸡啄米,在此谢远!回复该留言很不错的东西攴持博主学了一年多的编程了一直都是用命令行看到那个罴框框都要吐了看刭终于能做可视化的界面很激动呢鸡啄米于回复程序员还是很需要成就感的回复该留言楼新世纪娱乐减回复该留言今天偶然搜索到这个博客,好多我正好需要的东西。学了|几课,真的很有月。万分感谢。k鸡啄米于回复希望能常来,可能还会有你需要的东西哦,叫呵回复该留言非常感谢博主无私奉献的精神,我是看这个系列入门的!6鸡啄米于回复很高兴能帮你入门回复该留言http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米写得不铓,简单易懂,受用。要是再讲个网络编程和多线程的话,然后把前面的界面编程糅合起来讲个小小的一边聊天一边传输文件功能的案例就完关了。回复该留言楼要是那个案例里能捫聊犬派汞进数据库就更奷了,数据车叮以用嵌入式数据库,这个数据库很轻的,只需要在项匚中加入几个库文件就行了。回复该留言楼油烟机什么牌了好很不错啊博主继续加油k6鸡啄米于回复起加油回复该留言楼我的名字叫麒楼主好人啊!你可千万别删,我一直在学习6鸡啄米于回复不会删的,呵呵,欢逛常来学习回复该留言楼已纤顺利完成编程入门教程的全部内窣(当然个别暂时用不到的就掠过了)。冉次感谢作老完成这样非常适合学者的教程!≤鸡啄米于回复不用谢,以后常来逛逛啊回复该留鸡啄米先生;您的,文章使我受益匪浅,真诚的感谢你回复该留言楼我的名字叫麒博主,我实在搞不懂这些,看了很久了,连白学都不行,你看这样行不行?你给我培训,开价吧!46鸡啄米于回复那就从最基础的学起呵呵,如果有几个像你这样需求的朋友,看来我可以开培训班了。。回复该留言楼我的名字叫麒博主救我!我电脑里软伫管家现实,编程开发一栏里有个东西,请你带我删除一批。详细看这里≤6鸡啄米于回复你装的版本大多了,有和,可以卸毂两个,剩个就可以http://www.jizhuomi.com/software/257.tml[2013,969:48:41]vS2 DIO/MFC编程入门教程之目录和总结-敦一开发-鸡啄米回复该留言楼室内设计博客难刚起步,学学回复该留言楼诩谢!辛苦了。鸡啄米老师6鸡啄米于回复不用客气,欢迎常来回复该留言楼水上之舟每次不记得该如何操作,就会跑这来看看,真心很感谢回复该留琢米老师!想用同时绘制三个坐标图,点已经有了,还是不是很会弄,可以指点指点吗?回复该留言琢米老师是个妤老师啊,一直在跟着啄米老师走、觉着老师讲的非常容易理解,刚看完了的教程,现在打算开始学了,希望以后能和老师学到更多东西,提高自己!鸡啄米于回复先学再学记得回头再看看,呵呵回复该留言楼这篇文档介绍详细,对于我们这些刚入门的有极大作用,谢谢米哥回复该留言非常感谢前辈这个是我看过的最好的教程了,比我车图书馆里翻过的那些大部头教材好多了全部做下来感觉自己对很有自信了表小再也不用控制台了6鸡啄米于回复谢谢肯定,欢迎常来啊回复该留言楼多谢多谢写的非常好,果断多谢多谢回复该留言老师,你好:我想问下你的教稈有没有出书啊?我想买书看,不上网的时候也可以学习看下,谢谢鸡啄米于回复抱歉,没有出书,匚前只能在这里看http://www.jizhuomi.com/software/257.tml[2013,969:48:41]
- 2020-12-08下载
- 积分：1
