基于matlab虹膜识别源程序

这是一个入门vue的实战项目，可以提升自己对vue的掌握。

STM32平衡车代码，基于PID算法，可实现两轮直立小车制作的完整代码，成品代码，如需硬件资料可以联系微信工作平台：DIY-work

中国echarts地图数据与全国各省级echarts地图数据，包含了.js和.json

从地形分析的复杂性角度，可以将地形分析分为两大部分：一部分是基本地形因子（包括坡度、破向、粗糙度等）的计算，另一部分是复杂的地形分析包括可视性分析、地形特征提取、水文系特征分析、道路分析等。　　其中坡面地形因子分析是数字地形分析的最基础的内容。

mlx90614红外测温传感器,使用stm32f103rct6实现，使用LCD屏幕显示。mlx90614红外测温传感器,使用stm32f103rct6实现，使用LCD屏幕显示。

问题描述：平均路径长度是网络中另一个重要的特征度量，他是网络中所有节点对之间的平均最短距离。这里节点间的距离指的是从一个节点要经历的边的最小数目，其中所有节点之间的最大距离称为网络的直径。平均路径长度和直径衡量的是网络的传输性能与效率。平均路径长度的公式为 ，其中dij表示点i和j之间的最短距离（若dij不存在时，dij就不能加入，且分母要相应减1）要求：输入邻接矩阵表示的图，计算其平均路径长度

自然场景OCR（YOLOv3+CTPN+CRNN）,附带整个项目代码，详细代码注释

混合定位中很不错的一篇文章，看过之后很受启发在TOA和AOA误差服从零均值的高斯分布时,以上⑧无AOAQ阵中AOATOA/AOA混合定位算法的克拉美一罗下界(CRLB)为:校准离差取rP=(GQG)90Q阵中AOA校准离差取(x-x1)/其中:G=(x-x r(y-m)/r(19)洲6050(x)2(+(y-y))(x-x)(+(y-y)0.020.040.060080.100.12(x-x1)AOA标准离差(stda,单位radx-图1都市环境中算法性能比较3仿真与分析为了检验和比较算法在实际蜂窝网络信道环境中的定位性能,假定在一蜂窝网络中,小区半径为2500m,参与TOA测量的BS为服务BS和4个相邻的BS,其位置坐标分别为(0,0),(4330,2500),(4330,2500),(0,5000),(-4330,2500)。假定由测量系统造成的TOA测量误差服从均值为0,方差为30米的高斯分布,信道环境造成的NIOS误差满是TP1.5信道模型14,服务BS始终能够提供AOA,AOA测量误差服从均值为0和一定标准差的高斯分布。图1为都市环境中假定只有服务BS能视距(LOS)传播时,MS在服务小区内均匀分布,在不同AOA标准差下算法定位误差在125m内的概率。图中可见,Q矩阵中σα的取值对算法定位性能有很大影响,在AOA标准差较小时用TOA测量值η近似替代σa能取得更好的定位性能,这是由于WLS算法采用了Q阵加权。此外,120只要AOA测量值达到一定精度(标准差小于一定值),采用10-10A-A0A00TOAAOA混合定位法就能取得比单纯TOA定位更好的性能。图29080为乡村环境中在不同AOA标准差下,由单纯TOA及 TOA/AOA70定位法(Q矩阵中取n=r)得到的由均方根误差(RMSE)表示的定位性能。由图2可见,乡村环境中由于TOA测量精度较高,30对AOA的精度要求也高。只有当AOA标准差更小(小于10-3)AOA标准离差(og)时,混合定位算法才能取得比单纯TOA定位更好的性能。图2乡村环境中算法性能比较为了检验MS与服务BS距离对算法定位性能的影响,在一般都市环境中可以假定MS位于与服务BS具有不同距离的两个位置(1200,0)和(2400,0)分别进行定位估计,五个BS具有非视距TOA测量值的概率分别为:0、0.2、04、0.6、0.8、1,服务BS能够提供的AOA测量误差分别服从均值为0,标准差为01、0.0lrad的高斯分布,Q矩阵中用r近似替代σn,对每个位置在每种条件下分别进行100次测量,算法在无AOA及具有两种标准差的AOA时的定位结果(RMSE)如图3、4所示仿真结果表明:AOA参与卜AOA标准离差=001AOA标准离差=0,01定位只有在AOA本身误差不大AOA标准离差=0.1AOA标准离差=0.1无AOA无AOA的情况下,才能对定位性能有改200善;如果AOA本身误差增大150则对TOA定位结果并不会有改l00善;MS距离服务BS越近,则50采用混合定位算法的效果越好。00.00.204060.810000.20.40.608104结论BS非视距概率Bs非视距概率图3个同标准差时算法图4不同标准差时算法本文的分析和仿真结果表性能比较(1200,0)性能比较(2400,0)明,只要服务BS提供的AOA测量值达到一定精度,合理选择Q矩阵中AOA标准差取值,本文提出的 TOA/AOA混合定位算法就o1994-2012ChinaAcademicJournalElectronicPUblishingHouseAllrightsreservedhttp:/www.cnki.neto1994-2012ChinaAcademicJournalElectronicPUblishingHouseAllrightsreservedhttp:/www.cnki.net

Concepts in Programming Languages by John Mitchell.一本国外经典教材，看了之后对编程语言更加理解。费了很多劲才找到的。Concepts in Programming LanguagesThis textbook for undergraduate and beginning graduate students explains and examines the central concepts used in modern programminglanguages, such as functions, types, memory management, and controlThe book is unique in its comprehensive presentation and comparisonof major object-oriented programming languages. Separate chapters ex-amine the history of objects, Simula and Smalltalk, and the prominentanguages c++ and JavaThe author presents foundational topics, such as lambda calculus anddenotational semantics, in an easy-to-read, informal style, focusing on themain insights provided by these theories. Advanced topics include concurrency and concurrent object-oriented programming. A chapter on logicprogramming illustrates the importance of specialized programming meth-ods for certain kinds of problemsThis book will give the reader a better understanding of the issuesand trade-offs that arise in programming language design and a betterappreciation of the advantages and pitfalls of the programming languagesthey useJohn C. mitchell is Professor of Computer Science at Stanford University,where he has been a popular teacher for more than a decade. Many of hisformer students are successful in research and private industry. He received his ph D. from mit in 1984 and was a member of technical staff atat&T Bell Laboratories before joining the faculty at Stanford. Over thepast twenty years, Mitchell has been a featured speaker at internationalconferences; has led research projects on a variety of topics, includingprogramming language design and analysis, computer security, and applications of mathematical logic to computer science; and has written morethan 100 research articles. His previous textbook, Foundations for Pro-gramming Languages(MIT Press, 1996), covers lambda calculus, typesystems, logic for program verification, and mathematical semantics ofprogramming languages. Professor Mitchell was a member of the programming language subcommittee of the ACM/ieEE Curriculum 2001standardization effort and the 2002 Program Chair of the aCm principlesof programming languages conferenceCONCEPTS NPROGRAMMINGLANGUAGESJohn c. mitchellStanford UniversityCAMBRIDGEUNIVERSITY PRESSPUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGEThe Pitt Building, Trumpington Street, Cambridge, United KingdomCAMBRIDGE UNIVERSITY PRESSThe Edinburgh Building, Cambridge CB2 2RU, UK40 West 20th Street, New York, NY 10011-4211 USA477 Williamstown Road, Port Melbourne vic 3207, AustraliaRuiz de alarcon 13, 28014 Madrid, spainDock House, The Waterfront, Cape Town 8001, South Africahttp://www.cambridge.orgo Cambridge university press 2004First published in printed format 2002isBN 0-511-03492-X eBook(adobe readerISBN 0-521-78098-5 hardbackContentsPrefacepage IxPart 1 functions and foundations1 Introduction1.1 Programming Languages1.2 Goals1.3 Programming Language History3561.4 Organization: Concepts and Languages2 Computability2. 1 Partial Functions and computability102.2 Chapter SummaryExercises163 Lisp: Functions, Recursion, and Lists3.1 Lisp History183.2 Good Language design203. 3 Brief Language overview223.4 Innovations in the Design of Lisp253.5 Chapter Summary: Contributions of LispExercises404 Fundamentals484.1 Compilers and syntax484.2 Lambda calculus4.3 Denotational semantics4.4 Functional and Imperative Languages4.5 Chapter SummaryExercisesContentsPart 2 Procedures, Types, Memory Management, and Control5 The algol Family and ML5.1 The Algol Family of Programming Languages5.2 The Development of C5.3 The LCF System and ml5.4 The Ml Programming Language1035.5 Chapter summary121Exercises1226 Type Systems and Type Inference1296.1 Types in Programming1296.2 Type Safety and Type Checking1326.3 Type Inference1356.4 Polymorphism and Overloadin1456.5 Type Declarations and Type Equality1516.6 Chapter Summary155Exercises1567 Scope, Functions, and storage Management1627.1 Block-Structured Languages1627.2 In-Line blocks1657.3 Functions and procedures1707.4 Higher-Order functions1827.5 Chapter summary190Exercises1918 Control in Sequential Languages2048.1 Structured control2048.2 Exceptions2078.3 Continuations2188.4 Functions and evaluation order2238.5 Chapter summary227Exercises8Part 3 Modularity, Abstraction, and object-Oriented Programming9 Data Abstraction and Modularity2359.1 Structured Programming2359.2 Language Support for Abstraction2429.3 Modules9.4 Generic Abstractions2599.5 Chapter Summary269Exercises27110 Concepts in Object-Oriented Languages27710.1 Object-Oriented design27710.2 Four Basic concepts in object-Oriented languages278Contents10.3 Program Structure28810.4 Design Patterns29010.5 Chapter summary29210.6 Looking Forward: Simula, SmalltalkC++Java293Exercises29411 History of objects: Simula and smalltalk30011.1 Origin of Objects in Simula30011.2 Objects in Simula30311.3 Subclasses and Subtypes in Simula30811.4 Development of smalltalk31011.5 Smalltalk Language features31211.6 Smalltalk flexibilit31811.7 Relationship between Subtyping andInheritance2211.8 Chapter SummaryExercises32712 objects and Run-Time Efficiency: C++33712.1 Design goals and Constraints33712.2 Overview of c++34012.3 Classes. Inheritance and Virtual functions34612.4 Subtyping35512.5 Multiple inheritance12.6 Chapter summary366Exercises36713 Portability and Safety: Java38413.1 Java language overview38613.2 Java Classes and Inheritance38913.3 Java Types and Subtyping39613.4 Java System architecture40413.5 Security Features41213.6 Java summary417Exercises420Part 4 Concurrency and Logic Programming14 Concurrent and Distributed Programming43114.1 Basic Concepts in Concurrency43314.2 The actor model44114.3 Concurrent ML14.4 Java concurrency45414.5 Chapter Summary466Exercises469Contents15 The Logic Programming Paradigm and Prolog47515. 1 History of logic Programming15.2 Brief Overview of the logic Programming Paradigm4715. 3 Equations solved by Unification as Atomic Actions15.4 Clauses as Parts of procedure declarations48215.5 Prologs Approach to Programming48615.6 Arithmetic in Prolog49215.7 Control, Ambivalent Syntax, and Meta-Variables49615.8 Assessment of Prolog50515.9 Bibliographic remarks50715.10 Chapter Summary507Appendix a Additional Program Examples509A 1 Procedural and Object-Oriented organization509Glossary521Index525

根据各点的位置，matlab实现点集最小圆覆盖问题。