随机生产模拟matlab程序

【目录】- MATLAB神经网络30个案例分析(开发实例系列图书)第1章 BP神经网络的数据分类——语音特征信号分类1本案例选取了民歌、古筝、摇滚和流行四类不同音乐，用BP神经网络实现对这四类音乐的有效分类。第2章 BP神经网络的非线性系统建模——非线性函数拟合11本章拟合的非线性函数为y=x21+x22。第3章 遗传算法优化BP神经网络——非线性函数拟合21根据遗传算法和BP神经网络理论，在MATLAB软件中编程实现基于遗传算法优化的BP神经网络非线性系统拟合算法。第4章 神经网络遗传算法函数极值寻优——非线性函数极值寻优36对于未知的非线性函数，仅通过函数的输入输出数

这是一个GMM的matlab集合包，包含了一共5个压缩包，每个包都是不同的GMM的matlab实现。都是在外国网站上评分很高的文档。1、EM algorithm for Gaussian mixture model。2、Gaussian Mixture Model (GMM) - Gaussian Mixture Regression (GMR)。3、Gaussian Mixture Modeling GUI (GMM DEMO)。4、gaussian_mixture_model(1D)。5、GMM

语音是时变信号，处理时先加窗处理，分窗采用汉明窗

英集芯移动电源芯片的IIC寄存器手册，不是数据手册。支持IP5209/IP5109/IP5207/IP5108等芯片，有详细的寄存器地址说明。英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51086、12C通讯波形介绍SDANOURMSBAcknowleAcknowledgementSignal From ReceiverSignal From Receiver8Condition(S)RW ACKACK Condition(Py1 2c master写的时候,先传8bit数据,第9个bit读save返回的ack,ack为低代表写入成功,为高代表写入不成功。l2 c master读的时候,最后一个byte传输是 slave返叵数据, master返回nack(高电平),代表读结束:如果 master返回的是ack(低电平),则说明读没有结束, master会继续读所以第九个bit的ack信号要看 master端是读操作还是写操作:因为IP5209/P5109/P5108/P5207只能做save如果往1P5209/P5109/P5108/P5207寄存器写入数据,P5209/P5109/P5108/P5207返回ack为低电平;如果从P5209/P5109/P5108/P5207读取数据,IP5209/|5109/P5108/P5207返回nack高电平),( master必须发NACK,否则会有异常)代表读结束(英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51083、寄存器功能描述标示为“ Reserved”的寄存器位有特殊控制作用,不可改变原有的值,否则会出现无法预期的结果。对寄存器的操作必须按照“读-→>修改-->写”来进行,只修改要用到的bit,不能修改其他未用bit的值。1.1 SYS CTLOOffset= Ox01Bit(s)NameDescriptionR/WReset7:5Reserved手电筒检测是否使能RW1. enableO: disableLight enableRW0: disable1 enableBoost enableRW1O: disable1: enableCharger enableRWO disable1: enable0Reserved1.2 SYS CTL1Offset=0x02Bit(sNameDescriptionResetReserved轻载关机使能(0c可设定轻载关机阙|R/W值1:使能| BATLOW轻载关机功能0:关闭 BATLOW轻载关机功能负载插入自动开机R/W1:使能0:关闭英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51081.3 SYS CTL2Offset =0x0cBit(s)NameDescriptionR/WReset7:3轻载关机电流阈值设定RW00100n * 12mA当BAT电流小于设定阈值时,持续325米机注意:此电流设定阈值需要大于100mA2:0Reserved1. 4 SYS CTL3Offset=0x03it (s)NameDescriptionR/WReset7:6长按按键时间选择010:1S01:2s10:3S11:4S1:连续两次短按(两次短按在15内)R1关札功能使能O:连续两次短按(两次短按在15内)关机功能关闭4:0Reserved1.5 SYS CTL4Offset =0x04Bit(s)NameDescriptionR/WReset7:6关机时间设定R/W11:64s10:3201:16s00:8sV|N拔出是否开启 BOOST11:开启0:不开启4:0Reserved(i)英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51081.6 SYS CTLSOffset = 0x07Bit(s)NameDescriptionR/WResetReservedNNTC功能使能R/W:使能1:关闭ReservedR/W按键开关WLED于电筒方式选择:0:长按251:短按两次按键0按键关机方式选择:R/W0:短按两次按键1:长按251.7 Charger_ CTIOffset=0x22Bit(s)NameDescriptionR/WReset7:5Reserved3:2充电欠压环设定(充电时输出端voUT的R/电压)11:4.83V10:4.73V01:4.63V00:4.53V注:在充电的时候C会检测输出voUT的电压来自动调整充电电流,当VOUT的电压大于改置值时就以最大电流对充电充电,小于设定值时就自动减小充电电流以维持此电压;如果客户要求边充边放状态下可在输出端加采样电阻检测边充边放状态输出端的负载电流大于100mA时可把欠压环设置为最高,优先对外部负载充电1:0Reserved英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51081.8 Charger CTL2Offset=0x24Bit(s)NameDescriptionR/WResetReserved6:5BAT电池类型选择R/W0011: RESERVED10:4.35V电池01:43V电池00:4.2V电池4:3RESERVED2:1恒压充电电压加压设置1011:加压4210:加压28mV1:加压1400:不加压注:4.30V/4.35V建议加压14mV;4.2V建议加压28mV;如果客户需要支持44V的电芯,可以在435V电池的基础上选择加压48mV,充饱由MCU检测到电池电压大于44V,电流小于200MA才认为是电芯充饱了Reserved1.9 CHG DIG cTL4Offset = 0x26Bit(s)NameDescriptionR/WResetReserved电池类型内部寄存器设定还是外部setP|设定|RW选择1:外部 VSET PIN设置内部寄存器设置如果是该bit为0,可通过0x24寄存器的bit6:5来设定电池类型5:0Reserved英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51081.10 CHG DIG CTL4Offset=0x25Bit(s)NameDescriptionR/WReset7:5Reserved充电电流设置(设置为电氾端电流)R/W10111lbat=b0*0.1+b1*0.2+b2*0.4+b3*08+b4*1.6A注:默认值为1011123A左右1.11 MEP CTLOOffset = 0x51it (s)NameDescriptionR/WReset7:6Reserved5: 4 LIGHT selLGHT功能选择R/W0000: WLED01: GP10210: VREF11: Reserved3: 2 L4_selL4的功能选择R/W00:L401:GP|o110: Reserved11: Reserved1:0L3_seL3的功能选择R/W01: GPIO010: Reserved11: Reserved1.12 MFP CTL1Offset=0x52sit(s)NameDescriptionR/WReset7:4ReservedR/W3: 2 VSET selVSET功能选择W0000:电池电压选择PN)英集应利P5209/P5109/P5207/P510801: GP10410: Reserved11: Reserved1: 0 RSET seRS氏T功能选择R/W0000:电池内阻选择PN01:GP|O310: Reserved11: Reserved1.13 GPIO CTL2Offset =0x53 default oxoBit(sNameDescriptionR/WReset7:5Reserved4:0 GPIO_ INEN GPIO[4: 0]input enableRW00: Disable1: Enable1.14 GP0 CTL2Offset= Ox54 default oxoBits)NameDescriptionR/WReset7:5Reserved4: 0 GPIO_OUTEN GPIO[4: ]output enableRW00: Disable1: Enable在丌启 Output之前,需要先将data配好1.15 GPO CTL3Offset =0x55Bit(s)NameDescriptionR/w Reset7:5Reserved4:0 GPIO DATGPIO[4: 0]DATAR/W0(i)英集匙利技INJOINIC TECHNOLOGYP5209/P5109/P5207/P51082.1 BATVADC DATOOffset =Oxa2Bit(s)NameDescriptionR/WReset7:0 BATVADO7:| BATVADC数据的低8bitRO2.2 BATVADC DAT1Offset Oxa3Bit(s)NameDescriptionR/VReset7:6Reserved5:0 BATVADC[13: BATVADC数据的高6btR8]VBAT=BATVADC*0. 26855mv+2.6VBATVADC VALUE low =l2C Read Byte( 12C SLAVE ADDR, Oxa2);//low 8bitBATVADC VALUE high=12c Read Byte(I2C SLAVE ADDR, Oxa3); //high 6bitf( BATVADC VALUE high&0x20)=0x20)//补码BATVOL[=2600-("BATVADC VALUE low +((BATVADC vaLUe high & 0x1F)*256+1)*0.26855else//原码BATVOL[]=2600+(BATVADC VALUE low+BATVADC_ VALUE high *256)*0.26855; //mv 24i

LeetCode cpp最新中文题解.pdfLeetCode cpp最新中文题解.pdfLeetCode cpp最新中文题解.pdf目录3.4 Add binary615.1.5 Binary Tree Level Or-3.5 Longest Palindromic Substring. 62der traversal il3.6 Regular Expression Matching665.1.6 Binary Tree Zigzag3.7 Wildcard Matching67Level Order traversal. 963.8 Longest Common Prefix5.1.7 Recover Binary Search3. 9 Valid Number70Tree983.10 Integer to roman725. 1. 8 Same Tree3. 11 Roman to Integer735.1.9 Symmetric Tree1003.12 Count and Say745.1.10 Balanced Binary Tree.. 1023. 13 Anagrams755.1.11 Flatten Binary Tree to3. 14 Simplify Path76Linked List1033. 15 Length of Last Word775.1. 12 Populating Next RightPointers in each node ii 105第4章栈和队列7952二叉树的构建10641栈795.2.1 Construct Binary Tree4Valid Parentheses79from Preorder and In4.1.2 Longest valid Parenorder Traversa106theses805.2.2 Construct Binary Tree4.1.3 Largest Rectangle infrom Inorder and posHistogram82torder Traversal1074.1.4 Evaluate reverse pol-53二叉查找树108ish notation845.3. 1 Unique Binary Search4.2队列85Trees.1085.3.2 Unique Binary Search第5章树86Trees li.1105.1二叉树的遍历865.3.3 Validate Binary Search5.1.1 Binary Tree PreorderTreeTraversal865.3. 4 Convert Sorted array to5.1.2 Binary Tree InorderBinary Search Tree...112Traversal885.3.5 Convert Sorted List to5.1. 3 Binary Tree PostorderBinary Search Tree113Traversal9054二叉树的递归.1145. 1. 4 Binary Tree Level Or5.4.1 Minimum Depth of Bider traversal)2nary lree115目录5.4.2 Maximum Depth of Bi8.3.,2重新实现 next permunary Tree116tation1425.4.3 Path Sum11783.3递归.1435.4 4 Path Sum il118 8.4 Permutations II1445.4.5 Binary Tree Maximum8.4.1 next permutation... 144Path Suum11984.2重新实现 next permu5.4.6 Populating Next Righttation144Pointers in each node 120843递归1445.4.7 Sum Root to Leaf num8.5 Combinations146bers2185.1递归1468.5.2迭代147第6章排序1238.6 Letter Combinations of a phone6.1 Merge Sorted Array123umber1476.2 Merge Two Sorted Lists12486.1递归1486.3 Merge k Sorted Lists124862迭代96.4 Insertion Sort List125第9章广度优先搜索1506.5 Sort list1269.1 Word Ladder1506.6 First Missing Positive1279.2 Word Ladder il1546.7 Sort Colors1289.3 Surrounded regions162第7章查找94小结16413194.l适用场景1647.1 Search for a range131942思考的步骤7.2 Search Insert Position.13294.3代码模板1657. 3 Search a 2D Matrix133第10章深度优先搜索173第8章暴力枚举法13510.1 Palindrome Partitioning1738.1 Subsets13510.2 Unique Paths1768.1.1递归1350.2.1深搜1768.1.2迭代.1371022备忘录法.1768.2 Subsets il13810.23动规177821递归13810.24数学公式1788.2.2迭代.14110.3 Unique Paths Il1798. 3 Permutations14210.3.1备忘录法1798.3.1 next permutation14210.3.2动规.180目录10.4 N-Queens1813.4 Maximal rectangle21310.5 N-Queens II18413.5 Best Time to Buy and Sell Stock10.6 Restore ip addresses186.21410.7 Combination Sum18813.6 Interleaving String21510.8 Combination Sum Il18913.7 Scramble String21710.9 Generate Parentheses.19013. 8 Minimum Path Sum.22210.10 Sudoku solver19213.9 Edit Distance22410.11 Word Search.19313. 10 Decode Ways.22610.12小结19513. 11 Distinct sub22710.12.1适用场景19513. 12 Word Break22810.122思考的步骤19513 13 Word Break il2300.12.3代码模板197第14章图23210.12.4深搜与回溯法的区別.19714. 1 Clone Graph23210.12.5深搜与递归的区别..197第15章细节实现题235第11章分治法19915.1 Reverse Integer2351.1 Pow(x, n)19915.2 Palindrome Number.23611. 2 Sqrt(x)20015.3 Insert Interval237第12章贪心法20115.4 Merge Intervals23812.1 Jump game20115.5 Minimum Window Substring23912.2 Jump game II15.6 Multiply Strings24112. 3 Best Time to buy and Sell stock 20415.7 Substring with Concatenation12. 4 Best Time to buy and sell stock l205of all words24412. 5 Longest Substring Without re15.8 Pascal,s Triangle245peating Characters20615.9 Pascals Triangle Il24612.6 Container with Most Water.. 207 15.10 Spiral Matrix24715.11 Spiral matrix II248第13章动态规划20915.12 ZigZag Conversion25013. 1 Triangle20915.13 Divide Two Integers25113.2 Maximum Subarray15. 14 Text Justification25313.3 Palindrome Partitioning II1215.15 Max Points on a line255目录第1章编程技巧在判断两个浮点数a和b是否相等时,不要用a==b,应该判断二者之差的绝对值fabs(a-b)是否小于某个阈值,例如1e-9。判断一个整数是否是为奇数,用x%2!=0,不要用x%2=1,因为ⅹ可能是负用char的值作为数组下标(例如,统计字符串中每个字符岀现的次数),要考虑到char可能是负数。有的人考虑到了,先强制转型为 unsigned int再用作下标,这仍然是错的。正确的做法是,先强制转型为 unsigned char,再用作下标。这涉及C十整型提升的规则,就不详述了。以下是关于STL使用技巧的,很多条款来自《 Effective STL》这本书。vector和 string优先于动态分配的数组首先,在性能上,由于 vector能够保证连续内存,因此一旦分配了后,它的性能跟原始数组相当;其次,如果用new,意味着你要确保后面进行孓 delete,一旦忘记了,就会出现BUG,且这样需要都写一行 delete,代码不够短再次,声明多维数组的话,只能一个一个new,例如int** ary = new int*[row_num];for(int i=0: i< row num; ++1)ary [i] new int [col_num]用 vector的话一行代码搞定vectorary(row_num, vector(col_num, 0))使用 reserve来避免不必要的重新分配第2章线性表这类题目考察线性表的操作,例如,数组,单链表,双向链表等。2数组2.1.1 Remove Duplicates from Sorted array描述Given a sorted array, remove the duplicates in place such that each element appear only onceand return the new lengthDo not allocate extra space for another array, you must do this in place with constant memoryFor example, Given input array A =[1, 1, 2Your function should return length =2, and a is now [1, 2]分析无代码1/ LeetCode, Remove Duplicates from Sorted Array//时间复杂度0(n),空间复杂度0(1)class Solution tublicint removeDuplicates(vector& nums)tif (nums empty o) return 0;int index =ofor (int i =1: i nums size: 1++ iif (nums [index] ! nums [i])nums [++index]= nums [i]return index 12.1数组代码2//LeetCode, Remove Duplicates from Sorted Array/使用STL,时间复杂度0(n),空间复杂度0(1)class Solution ipublicint removeDuplicates(vector& nums)treturn distance(nums begin(), unique(nums begin(), nums end ())代码3/ LeetCode, Remove Duplicates from Sorted Array/使用STL,时间复杂度0(n),空间复杂度0(1)lass Solution fublicint removeDuplicates(vector& nums)treturn distance(nums begin(, removeDuplicates(nums begin(, nums end(), nums begintemplateOutIt removeDuplicates(InIt first, InIt last, OutIt output)thile (first last)i*output++ = *firstfirst upper_bound(first, last, *firstreturn output相关题目Remove Duplicates from Sorted Array I,见§2.1.22.1.2 Remove Duplicates from Sorted Array II描述Follow up for"Remove Duplicates " What if duplicates are allowed at most twice?For example, Given sorted array a =[1, 1, 1, 2, 2, 3]Your function should return length=5, and A is now [1, 1, 2, 2, 3分析加一个变量记录一下元素出现的次数即可。这题因为是已经排序的数组,所以一个变量即可解决。如果是没有排序的数组,则需要引入一个 hashmap来记录出现次数。4第2章线性表代码1// Leet Code, Remove Duplicates from Sorted Array II//时间复杂度0(n),空间复杂度0(1)//qauthorhex108(https://github.com/hex108)class Solution tublicint removeDuplicates(vector& nums)tif (nums size(

【实例简介】在重装window7较早版本的时候，会因为必要补丁包的缺少导致一些问题。我遇到的问题是在KB4474419+KB4490628(X64)两个补丁包缺少的情况下，安装独显的驱动会提示无法继续安装，该文件压缩包包含两个补丁包和补丁包下载地址，补丁包解压即可用，经过测试两个补丁包没有问题。

matlab最小二乘法滤波 滤波 去噪 复原拉格朗日复原

做项目涉及到打印的，前面用了水晶报表来做。结果客户说打印速度太慢，达不到要求，客户要求在1秒之内一个标签。结果就研究用ZPL指令直接发送到打印机。这速度就提高了。因为绕过了生成报表，打印池。

基于BP神经网络的自整定PID控制仿真，经测试，可成功运行，放心下载！

科大讯飞的语音唤醒功能，博客的示例源码。