计算机图形学课程设计（画图板程序）

计算理论复习总结,但是考试快要结束了，估计大家也没有什么需要了。28.文法是CFG的推广,任何CFG都是文法。G=(V,∑,R,S)29.语言被文法生成ⅲ它是re的。30.所有数值函数都是原始递归的31.原始递归函数集是递归可枚举的。32.特殊语言/问题H={"M"w":M在w上停机}lH={"M"w":M是一台在"w"上不停机的TM}H1={"M":M在“M”上停机}H1={w:要么w不是一台TM的编码,要么w是M的编码,M是一台在"M"上不停机的TM}H:re.;H1:re.;-H,-H1:非r.e.;2-SAT∈P;SAT∈NPThe world as We Dont Know itreAsumming P≠APCo『eHrecursiveSATSATCO-A伊II Asumming P=Npr, eCo-r.erecursiveNP= cO-Np= p33没有算法的问题称作不可判定的or不可解的,如TM的停机问题34.证明不可判定通用图灵机U通过递归函数归约到L如果L是递归的则U是递归的ic若L1非递归,并存在L1到L2的归约,则L2也非递归。递归函数是 Turing Computable的35.语言是图灵可枚举的,证存在枚举它的图灵机。(M通过空格代开始,周期性的经过特殊状态q来枚举L,任意顺序且可重复)6.不可判定语言与递归语言互为补集,与rc语言有交集。37语言是re.,if它是图灵可枚举的;语言是递归的,i它是以字典序 turing可枚举的。8.P在并交连接和补运算下封闭NP在并、连接运算下封闭。若NP在补下封闭则NP=P39.H={M"wM在最多2w步后停机}唾P40.所有正则语言和所有CFL都属于P41.NPA.机器角度去定义:被多项式界限非确定型图灵机判定的所有语言的类。B.基于 verifier的定义:NP问题上建立的非确定机包含两步1)非确定地猜一个解2〕用一个确定的算法判定该解是否为可行解判定一个给定猜测值是否满足该问题(可满足性)的算法称作 verifier,一个问题称作NP问题当且仅当存在一个多项式时间的 verifier这两个定义是不矛盾的,因为如果一台非确定TM在多项式时间内可以判定一个非确定选择的翰入是否满足,就是基于 verifier的定义。P和NP的区别a problem is in P if we can decide them in polynomial time. It is in NP if we candecide them in polynomial time, if we are given the right certificate42.若存在计算函数f的多项式界限的图灵机M,则f称为多项式时间可计算的43.若τ1是L1->l2的多项式归约,τ2是L2->I3的多项式归约,则τ1τ2是L1->l3的多项式归约44.证明NP完全法一、按定义:LΣ*,若(a)L∈NP,且(b)对每个语言L∈NP,存在从L到L的多项式归约则L称为NP完全的。法二、归约,对于语言L,(a)若L∈NP(b)一个NP完全问题可以在多项式时间规约到L,ie. SAT 0 is context-free but not regular49.L=L1L2,L是CFL,则L1一定是CFL(x50. Regular-CFL不一定是CFL,如a*b*c*-anbn包含 anben51. 2-way PDalie PDa whose input heads can move both left and right] are more powerfulthan 1-way pda52. Given a PDa M1 and an fa M2, the problem l(M1)cl(M2)is decidable53.DFA/NFA识别的是 exactly正则语言54.Re.只在补和差下不封闭,CFL在交下也不封闭55.非正则语言的可能是正则语言。比如A:[W=w}及所有回文,A=*,为正则语言56.典型非正则:w=wR57.正则语言的子集可能非正则,如 anben是a*b*c*的子集;又如Σ*是正则语言,H≌Σ*58.归约:X到Y的归约可以理解为X到Y问题的映射, reduction可以解释为 at least asdifficult as….比如ⅹ可以被Y的算法解决,则 X is no more difficult than yⅩ可以约到Y,记X≤Y。e.gx2可以归约到任意两数的乘积。若有A≤B,A是不可判定问题>B不可判定A不递归->B不递归B可判定>A可判定B是递归的->A是递归的59.若X多项式时间归约到Y,Y多项式时间可解,则X多项式时间可解若X多项式时间归约到Y,Ⅹ多项式时间不可解,则Y多项式时间不可解60.X多项式时间归约到Y,Y多项式时间归约到Z,则X多项式时间归约到Z61.PRME( COMPOSITE)多项式时间归约到 Factor,但是 Factor多项式时间不能归约到PRIME COMPOSITE )o62.若A≤PB,B∈NP,则A∈NP。证明A≤PB→存在确定图灵机X,可将A归约到B。B∈NP→存在一个非确定图灵机N可判定B。我们希望构造一个新的TM(ⅹN)是的ⅹ*N非确定多项式时间求解A,则A∈NPRunning time of X*N≤1+p(mB>+qp(m)(B多项式时间非确定判定是多项式时间所以A∈NP63若AsPB,B∈P,则A∈P64.若X是NPC的,则X在多项式时间内可解ifP=NP65.SAT多项式时间归约到3SA(3AT是NPC的)66.证明语言L是R/Re, Non rea) Intuitively想想有没有半判定(判定)的TM,有则Rc、(R)。若非R执行下一步。b)用能否由Re.( Non re.)语言归约到该语言,能则Re而非R( Non re)严格用归约函数定义f:A≤B,r1∈A当且仅当r1∈Beg1∈H,M∈L证明Recg2∈非H,iM∈L证明 Non rc注意方向:是从A的实例经过递归函数推向B的实例。详细介绍http://www.cs.rice.edu/nakhleh/comp481/finalreviewsp06sol.pdf67.递归与μ递归等价68.PDA中,若每一个格局至多有一个格局接在它后面,则为确定型的。确定型CF在补下封闭69.M半判定L:w∈L,ifM在w上停机,注意半判定图灵机中不存在“拒绝”状态。只要不接受w,就不停机。70. Chomsky hierarchyElements of the Chomsky HierarchyRecursively enumerable languagesRecursive languageContext sensitive languagesContext ee languageseterministccontext free languagesRegularanguages71.俩证明7.6证明P在并、交、 Kleene*连接和补运算下封闭(1)并:对任意L,LEP,遴n时间图灵机M1和nb时间图灵机M2判定它们且c=max{ab}对L1L2构造判定器MM=“对于输入字符串w1)在W上运行M1,在w上运行M22)若有一个接受则接受,否则拒绝。时间复杂度:设M1为0(n)M2为0(m)。令c=max{ab}第一步用时0(n+n),因此总时间为Oma+n)=0(n9所以L1L2属于P类,即P在并的运算下封闭。(2)连接对任意L1,L2属于P类,设有n时间图灵机M1和m时间图灵机M2判定它们,且c=max{ab}。对L1l2构造判定器MM=“对于输入字符串w=w2灬,Wn对k=0,1,21…,n重复下列步骤。在wW2…wk上运行M1,在wk1wk+2…n上运行M若都接受,则接受。否则继续。若对所有分法都不接受则拒绝。时间复杂度:(n+1x0(n+0m-0(m+4)+0(nb+4=0(nc+),F以L1oL2属于P类,即P在连接的运算下封闭。对任意L属于P类,设有时间0(n)判定器M判定它,对构造判定器MM=“对于输入字符串〔1)在w上运行M12)若M1接受则拒绝,若M1拒绝则接受。时间复杂度为:0(m)。所以属于P类,即P在补的运算下封闭。77证明NP在并和连接运算下封闭。1)并对任意L1,L2∈NP,设分别有n时间非确定图灵机M1和n时间非确定图灵机M2判定它们,且c=max{a,b}。构造判定LL2的非确定图灵机M:M=“对于输入字符串w1)在W上运行M1,在w上运行M2。2)若有一个接受则接受,否则拒绝。对于每一个非确定计算分支,第一步用时为O(n-)+O(n),因此总时间为On+n)=0(n。所以LLz∈NP,即NP在并的运算下封闭2)连接对任意L,L2∈NP设分别有na时间非确定图灵机M1和m时间非确定图灵机M2判定它们,且c=max{ab}。构造判定L1oL2的非确定图灵机M:M=“对于输入字符串w:1〕非确定地将分成两段xy,使得w=xy。2)在x上运行M1,在y上运行M23)若都接受则接受,否则拒绝。对于每一个非确定计算分支,第一步用时O(n,第二步用时为0(n)+0(m),因此总时间为o(n+m)=0(n。所以L1oL2∈NP,即NP在连接运算下封闭。专题一一图灵机可判定性问题判定以下问题是否可判定:声明:思路—想证明B问题不可解,1.从一个不可解问题A入手(如停机问题)2.创建B的—个实例,从中推出如果能解决B,A也就可以解决了3.所以B是不可解的1.一个图灵机有至少481个状态。我们可以给出这样一个TMN进行cnc(M)a)数M中状态数,直到481b)如果达到了481,N就接受,否则拒绝2.给定图灵机在空串上走了481步还没停机。构造2带图灵机N,a)2a带:写481个0b)1s带在空串上模拟M,每走一步,第2带就删掉一个0c)如果M在所有0都删掉之后停机,则N接受,否则不接受给定图灵机,判定它是否在一些输入上经过481步还没停机?a)按字典序找出所有 length

C# winform下将数据库中数据表的数据导出到Excel模板中，可以预览及保存Excel

1000款MT4_EA全部源代码文件，包含各种刷单、剥头皮、趋势、波段、跟单等源文件。

基于Matlab的双闭环直流电机调速系统的仿真

不调用库函数，纯C++实现灰度bmp任意尺寸图片的任意角度旋转~~~~采用最邻近插值法~~

自适应滤波器的权威Sayed的大作，用大量的实例诠释自适应滤波器的各种算法原理，是不可多得的好书。ADAPTIVE FILTERSADAPTIVE FILTERSALIH SAYEDUniversity of California at Los Angeles◆旧EEEIEEE PressWIlEYNTERSCIENCEA JOHN WILEY SONS, INC, PUBLICATIONCover design by Michael RutkowskiCopyright C 2008 by John Wiley Sons, Inc. All rights reservedPublished by John Wiley Sons, Inc, Hoboken, New JerseyPublished simultaneously in CanadaNo part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or bymeans, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under anySection 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of thePublisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center,Inc, 222 Rosewood Drive, Danvers, MA01923, (978)750-8400, fax(978)750-4470, or on the web atwww.copyright.comRequeststothePublisherforpermissionshouldbeaddressedtothePermissionsDepartment, John Wiley sons, Inc, 111 River Street, Hoboken, NJ,(201)748-6011, fax(201)748-6008,oronlineathttp:/www.wiley.com/go/permissionLimit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts inpreparing this book, they make no representations or warranties with respect to the accuracy or completeness ofe contents of this book and specifically disclaim any implied warranties of merchantability or fitness for aarticular purpose. No warranty may be created or extended by sales representatives or written sales materialsThe advice and strategies contained herein may not be suitable for your situation. You should consult with aprofessional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or anyother commercial damages, including but not limited to special, incidental, consequential, or other damagesFor general information on our other products and services or for technical support, please contact our CustomerCare Department within the United States at(800)762-2974, outside the United States at (317)572-3993 or fax(317)572-4002Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not beavailable in electronic formats. For more information about wiley products, visit our web site atwww.wlley.conLibrary of Congress Cataloging-in-Publication Data:Sayed, Ali hAdaptive filters/Ali H. Sayedp cmIncludes bibliographical references and indexISBN9780470-25388-5( cloth)Adaptive filters. I. TitleTK7872F5s285200862138l5324dc222008003731Printed in the united states of america10987654321To my parentsContentsPrefacexviiNotationXXVAcknowledgmentsXXXBACKGROUND MATERIALA Random variablesA 1 Variance of a random variableA2 Dependent random VariablesA3 Complex-Valued Random VariablesA 4 Vector -Valued Random variables3467A.5 Gaussian Random VectorsB Linear Algebra12B. Hermitian and Positive- Definite matricesB 2 Range spaces and nullspace of matrices14B3 Schur Complements16B 4 Cholesky factorizationB 5 QR DecompositionB6 Singular Value Decomposition20B 7 Kronecker productsC Complex Gradients25C 1 Cauchy-Riemann Conditions5C2 Scalar arguments26C3 Vector arguments26PART:。 PTIMAL ESTIMATIONScalar- Valued Data291. 1 Estimation Without observations1.2 Estimation Given Dependent observations1.3 Orthogonality Principl36CONTENTS1,4 Gaussian random variables382 Vector- Valued Data422. 1 Optimal Estimator in the vector Case422.2 Spherically Invariant Gaussian Variables462. 3 Equivalent Optimization Criterion49Summary and Notes51Problems and Computer Projects54PART I: LINEAR ESTIMATION3 Normal Equatlons603. 1 Mean-Square Error Criterion613.2 Minimization by Differentiation3.3 Minimization by Completion-of-Squares633.4 Minimization of the error Covariance matrix653.5 Optimal Linear estimator4 Orthogonality princlple4. 1 Design Examples4.2 Orthogonality Condition4.3 Existence of solutions744, 4 Nonzero-Mean variables5 Linear Models5.1 Estimation using Linear Relations5.2 Application: Channel Estimation5Application: Block Data Estimation815. 4 Application: Linear Channel equalization825.5 Application: Multiple-Antenna Receivers85Constralned estimation876.1 Minimum-Variance Unbiased estimation6.2 Example: Mean Estimation6.3 Application: Channel and Noise Estimation916.4 Application: Decision Feedback Equalization6.5 Application: Antenna Beamforming1017 Kalman Filter1047.1 Innovations process7.2 State-Space Model106

云顶夺宝搭建视频教程，云顶夺宝搭建视频教程，云顶夺宝搭建视频教程，云顶夺宝搭建视频教程

hadoop2.7.x 都可以使用，在windows环境下运行hadoop、hbase、spark需要winutils.exe，否则会报错Could not locate executable nullinwinutils.exe in the Hadoop binaries。

一种自适应平方根中心差分卡尔曼滤波算法（ASRCDKF），并应用于捷联惯性导航系统（SINS）大方位失准角初始对准中。ASRCDKF 算法以中心差分变换为基础，基于平方根滤波能够克服发散的思想，利用协方差平方根代替协方差参加递推运算，并将自适应估计原理引入该算法中，不仅克服了扩展卡尔曼滤波产生线性化误差和计算雅可比矩阵的不足，而且减小了计算量，保证了数值稳定性。同时，ASRCDKF 算法解决了传统滤波算法过度依赖系统动态模型和噪声统计特性先验知识的问题。通过滤波仿真，进一步表明了ASRCDKF 算法在SINS 大方位失准角初始对准中的有效性和优越性。

太阳能光伏发电最大功率点跟踪技术 ，著名专家赵争鸣教授的力作。