混淆工具ConfuserEx_bin

一个能够实现学生信息登陆界面，登陆后可以对学生信息增删改查的功能。

AUTOSAR4.3 最新规范完整版共分为2册这个是1 还有个2同样可以在我的资源中下载，可以用作学习了解AUTOSAR核心工作过程，也可用作开发 AUTOSAR 参考规范

基于视频检测的车辆测速方法 基于视频检测的车辆测速方法《现代电子技术》2009年第23期总第310期b电子技术应用1.4基于灰度的图像匹配图像下端位置在世界坐标中的点(即Pa)距离相机的水由于拍摄范围较小,在两帧间.忽略车辆因远离相平距离,即图像中距离相机的最近点:;D_FAR为图像机产生的几何变化,根据图像块间的灰度差平方和作为上端位置在世界坐标中的点(即P)距离相机的水平距匹配判定依据离,即图像中距离相机的最远点;O为摄像机光心;HsiE=∑/li,j-I1(i,j)76)为图像高度;P为机动车上某一点,该点在图像坐标系式中:1,(i,j是第n帧中车尾处图像块l()为中的纵坐标上(即图像高度方向)对应点Q;dst为机第n+1帧中,从对应于第n帧的车尾位置开始,向上动车上的点P距离摄像机的水平距离;Y为机动车上依次搜索到的图像块的点P距离地面的高度如图2所示,在第87帧的帧差边缘二值图像中(c)由世界坐标中的相互关系可得检测到车尾时,将86帧中车尾区域对应图像作为被匹Z0= arctan(D_NEARH-CAM) (8)配图像(图2(a)),在87帧中搜索与该图像最匹配的位arctan(D-FARH- CAM置(图2(b))。图2(a)、(b)屮矩形框在垂直方向上移动结合图像坐标系的像素,即相机坐标系下车辆移功的距离∠0=(∠甲-∠0)12= arctan/ H/22车辆测速方法∠U= arct an2.1速度测量在各种测速方法中,所有的测速设备都是依据由式(5)可得:式(7)得到的n△s/△(7)利用视频检测方法对午辆进行测速时,Δt为两帧对车辆上任意点P到相机光心连线,与相机垂直图像之间的时间差,可根括摄像机采集帧率计算得到,方向的夹角通常是一个固定值,Δs需要通过图像处理方法在图像∠中= arctan H_CAM-y序列中找到被测车辆实际移动的距离。考虑图中∠中,∠0,∠8∠之间的关系,有:2.2距离测量考虑摄像机架设位置和角度,对两张图像中相匹配∠φ=∠0+(∠4-∠0)/2+∠V1Qn>H/2点建立车辆移动距离模型,如图3所示∠0+(∠9-∠0/2-∠Qv

这是前几天刚做的一个图像处理的大作业，给大家分享一下。主要是实现了一些基本的图像处理的功能，并做了一个小界面，很简单。基本功能有图像平滑（邻域平均法）、锐化（拉普拉斯）、二值、灰度化、腐蚀、膨胀、小波分解（只显示近似部分图像）、边缘提取、人脸识别（基于PCA）。 程序有两个，一个事GUI的，一个是人脸识别的（大家自己修改人脸库路径）。论文（word和PDF都有）也在里面，希望对大家能有帮助。

有限元网格剖分 有限元网格剖分 有限元网格剖分 有限元网格剖分

可以直接调用，求解任意时刻的太阳和月球坐标，在地心地固坐标系下，即ITRF框架坐标系下，WGS-84坐标系下，CGCS2000坐标系下

简易计算器.vi(labview)

常用跑包字典，懂行的不解释，有字典不一定跑出密码，不保证能跑出密码，这只是一种可能，想一定要求跑出密码的朋友不要下，不喜勿喷！本字典32大洋淘宝来，本人用EWSA跑出6个密码。

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

贡献本人本科毕业论文（代码 + 答辩PPT + 论文文档）细节：基于java的文本搜索引擎的设计与实现，页面使用css + html + jsp实现，分词器使用lucene，网络爬虫使用java实现，数据库使用mysql