,数字式电压,电流,功率测量电网数据集合在一起便于数据的分析，而且内有MODBUS-RTU与上位机直接数据通讯

基于相似度计算的主观题阅卷系统设计，此系统通过ictclas把答案进行分词，然后把分词结果对照中文停用词表把一些没有实际意义的词语过滤掉，然后根据余弦定理计算出学生答案和标准答案的相似度。句子分词是直接用的中科院的ictclas，其他地方是自己写的，包括分词后每个词的权值啦，去除无意义的词啦（比如：的，像，是，好。。。等等对照停用词表），最后通过自己的计算公式，计算出学生答案和标准答案的相似度百分比。可以直接在main方法中测试，不过自己又添加了struts，所以也可以在页面当中进行测试。功能经过自己测试完全通过，至于美化页面，自己有兴趣可以完善一下。

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

（本人 小论文 代码，通过验证）本文提出一种新的FIR滤波器FPGA实现方法。讨论了分布式算法原理，并提出了基于分布式算法FIR滤波器的实现方法。通过改进型分布式算法结构减少硬件资源消耗，用流水线技术提高运算速度，采用分割查找表方法减小存储规模，并在Matlab和Modelsim仿真平台得到验证。为了节省FPGA逻辑资源、提高系统速度，设计中引入了分布式算法实现有限脉冲响应滤波器(Finite Impulse Response, FIR)。由于FIR滤波器在实现上主要是完成乘累加MAC的功能，采用传统MAC算法设计FIR滤波器将消耗大量硬件资源。而采用分布式算法 (Distri

%该程序计算平面四节点四边形等参元的刚度矩阵%输入弹性模量E、泊松比NU和厚度h%输入四个节点1、2、3、4的坐标x1,x2,x3,x3,y1,y2,y3,y4%输入平面问题性质参数ID（1为平面应力，2为平面应变）%输出单元刚度矩阵

这个是由芬兰人提出的FastICA算法，我编写了一个主函数，名字叫zhuhanshu.m,打开后，可以调用其他程序，查看盲源分离的结果

Water Quality Analysis Simulation Program (WASP)是在1983年Di Toro等人建立模型的基础上的加强版。优点：灵活性：能够模拟大部分水体类型，河流、湖泊、河口、海洋水体。 内部链接：热模块计算结果提供给富营养化模块，再用于有毒物质模拟。 外部链接：能够和多种模型耦合。模块灵活性三种处理技术：分为简单、中级和复杂的处理方式。 模拟大部分水质问题：常规污染物，溶解氧、富营养化、温度；有毒污染物，有机物、简单的金属、汞等局限性： WASP的研究对象为完全混合水体控制单元，比如排污口附近这种类型的问题不能模拟。 非水相：油的比重、粘度和UTILITY PROGRAMS…128EUTROPHICATION MODEL ENHANCEMENTSTable of figuresTable of tablesSystem Data回囟Option Particulate Mass Dispersion Flow ATransport Field BalOrthophosphate [mgaoids 1Organic Phosphorous [mg/TSimulatedSolid5 Phytoplankton Ch.网g川 Simulatedoids 1Benthic如ae(gDm2Dissolved Oxygen (mg/)b9CBOD1(Ultimate)(mg/l)SimulatedSolids 110 CBOD 2 [Ultimate)(rng/Bypassed5a|d111 CBOD 3 (UlitrnateJ(mg/Bypassed鷗C」国e国F[√」xcmc」Figure I WASP 7 State Variable selection必劉图国K引T sta幽回因国团”B1xP3qpP明团9的旱994MFigure 2 Interface main ScreenParametersDescriptiModel t ypeRestart OptiNew river Input datEUTRONo Restart file□ mmentsC create restart fileC Load restart file noNon point Souice fileBed voluStart dateUse nPs fiBrowseNPS File name1211999C DrBed Compaction Time StepStart t ime- HydrodeNet flowEnd datesp calculated1-D Network kinematic wavea User defined2312002Hydrodynamic LinkageHydrodynamic Linkage FileSolution OptionsEnd timeC: WASP Project New River N ewRiverH hyd Negative S olution AlloweBrowseSolution techniqueX CancelFigure 3 WASP Simulation parameters screen+aB

设计了一种基于matlab的手写数字识别系统，全面覆盖多种分类器，有Fisher线性判别，贝叶斯分类器，神经网络，k近邻等等线性与非线性的分类器，识别的准确率较高，具体依据各个算法的不同，可以在此基础上进行改进。

本文介绍一种用MATLAB实现的语音识别系统，包含源代码

欧姆龙Fins通讯手册,想要自己写程序和欧姆龙PLC以太网通信的自己看

一个详细CBIR的MATLAB代码，包括HSV直方图特征、Haar纹理特征、GIST特征、形状特征。保证可用。.