显著性检测方法:LC（matlab实现)

优秀论文及配套源码。Hilbert-Huang变换(HHT)是一种新的非平稳信号处理技术，该方法由经验模态 分解(EMD)与Hilbert谱分析两部分组成。任意的非平稳信号首先经过EMD方法处理后被分解为一系列具有不同特征尺度的数据序列，每一个序列称为一个固有模态函数(IMF)，然后对每个IMF分量进行Hilbert谱分析得到相应分量的Hilbert谱，汇总所有Hilbert谱就得到了原信号的谱图。该方法从本质上讲是对非平稳信号进行平稳化处理，将信号中真实存在的不同尺度波动或趋势逐级分解出来，最终用瞬时频率和能量来表征原信号的频率含量。 本文研究了基于HHT的暂态电能质量扰动检测方法，介绍了H

用法1、图像序列放入data文件夹中；2、图像序列名称和跟踪初始范围在initCt.m中修改；3、结果文件.data/fct-result.txt参考论文：K. Zhang, L. Zhang, and M. Yang, “Fast Compressive Tracking”

是现代永磁同步电机控制原理及MATLAB仿真书中的MATLAB例程，本书着眼于现代永磁同步电机控制原理分析及MATLAB仿真应用，系统地介绍了永磁同步电机控制系统的基本理论、基本方法和应用技术。全书分为3部分共10章，主要内容包括三相永磁同步电机的数学建模及矢量控制技术、三相电压源逆变器PWM 技术、三相永磁同步电机

stanjan 热力学计算软件JANFILE is now the recommended method for preparing STANJAN data files. Itcontains a number of automatic features that make this task efficient andconsistent. For STANJAN versions 3.22 and higher, we recommend the use ofunformatted .SUD (Stanjan Unformatted Data) files if you are

PPT模板 创意 工作总结 汇报 PPT模板 创意 工作总结 汇报 PPT模板 创意 工作总结 汇报 PPT模板 创意 工作总结 汇报 PPT模板 创意 工作总结 汇报 PPT模板 创意 工作总结 汇报

7本量化投资方面笔试面试经常提及的问题，需要找量化相关工作，准备面试的看过来

很好的matlab混沌工具箱 可以看到源代码

完整版，带目录，机器学习必备经典；大部头要用力啃。Machine learning A Probabilistic PerspectiveMachine LearningA Probabilistic PerspectiveKevin P. MurphyThe mit PressCambridge, MassachusettsLondon, Englando 2012 Massachusetts Institute of TechnologyAll rights reserved. No part of this book may be reproduced in any form by any electronic or mechanicalmeans(including photocopying, recording, or information storage and retrieval)without permission inwriting from the publisherFor information about special quantity discounts, please email special_sales@mitpress. mit. eduThis book was set in the HEx programming language by the author. Printed and bound in the UnitedStates of AmLibrary of Congress Cataloging-in-Publication InformationMurphy, Kevin Png:a piobabilistctive/Kevin P. Murphyp. cm. -(Adaptive computation and machine learning series)Includes bibliographical references and indexisBn 978-0-262-01802-9 (hardcover: alk. paper1. Machine learning. 2. Probabilities. I. TitleQ325.5M872012006.31-dc232012004558109876This book is dedicated to alessandro, Michael and stefanoand to the memory of gerard Joseph murphyContentsPreactXXVII1 IntroductionMachine learning: what and why?1..1Types of machine learning1.2 Supervised learning1.2.1Classification 31.2.2 Regression 83 Unsupervised learning 91.3.11.3.2Discovering latent factors 111.3.3 Discovering graph structure 131.3.4 Matrix completion 141.4 Some basic concepts in machine learning 161.4.1Parametric vs non-parametric models 161.4.2 A simple non-parametric classifier: K-nearest neighbors 161.4.3 The curse of dimensionality 181.4.4 Parametric models for classification and regression 191.4.5Linear regression 191.4.6Logistic regression1.4.7 Overfitting 221.4.8Model selection1.4.9No free lunch theorem242 Probability2.1 Introduction 272.2 A brief review of probability theory 282. 2. 1 Discrete random variables 282. 2.2 Fundamental rules 282.2.3B292. 2. 4 Independence and conditional independence 302. 2. 5 Continuous random variable32CONTENTS2.2.6 Quantiles 332.2.7 Mean and variance 332.3 Some common discrete distributions 342.3.1The binomial and bernoulli distributions 342.3.2 The multinomial and multinoulli distributions 352. 3.3 The Poisson distribution 372.3.4 The empirical distribution 372.4 Some common continuous distributions 382.4.1 Gaussian (normal) distribution 382.4.2Dte pdf 392.4.3 The Laplace distribution 412.4.4 The gamma distribution 412.4.5 The beta distribution 422.4.6 Pareto distribution2.5 Joint probability distributions 442.5.1Covariance and correlation442.5.2 The multivariate gaussian2.5.3 Multivariate Student t distribution 462.5.4 Dirichlet distribution 472.6 Transformations of random variables 492. 6. 1 Linear transformations 492.6.2 General transformations 502.6.3 Central limit theorem 512.7 Monte Carlo approximation 522.7.1 Example: change of variables, the MC way 532.7.2 Example: estimating T by Monte Carlo integration2.7.3 Accuracy of Monte Carlo approximation 542.8 Information theory562.8.1Entropy2.8.2 KL dive572.8.3 Mutual information 593 Generative models for discrete data 653.1 Introducti653.2 Bayesian concept learning 653.2.1Likelihood673.2.2 Prior 673.2.3P683.2.4Postedictive distribution3.2.5 A more complex prior 723.3 The beta-binomial model 723.3.1 Likelihood 733.3.2Prior743.3.3 Poster3.3.4Posterior predictive distributionCONTENTS3.4 The Dirichlet-multinomial model 783. 4. 1 Likelihood 793.4.2 Prior 793.4.3 Posterior 793.4.4Posterior predictive813.5 Naive Bayes classifiers 823.5.1 Model fitting 833.5.2 Using the model for prediction 853.5.3 The log-sum-exp trick 803.5.4 Feature selection using mutual information 863.5.5 Classifying documents using bag of words 84 Gaussian models4.1 Introduction974.1.1Notation974. 1.2 Basics 974. 1.3 MlE for an mvn 994.1.4 Maximum entropy derivation of the gaussian 1014.2 Gaussian discriminant analysis 1014.2.1 Quadratic discriminant analysis(QDA) 1024.2.2 Linear discriminant analysis (LDA) 1034.2.3 Two-claSs LDA 1044.2.4 MLE for discriminant analysis 1064.2.5 Strategies for preventing overfitting 1064.2.6 Regularized LDA* 104.2.7 Diagonal LDA4.2.8 Nearest shrunken centroids classifier1094.3 Inference in jointly Gaussian distributions 1104.3.1Statement of the result 1114.3.2 Examples4.3.3 Information form 1154.3.4 Proof of the result 1164.4 Linear Gaussian systems 1194.4.1Statement of the result 1194.4.2 Examples 1204.4.3 Proof of the result1244.5 Digression: The Wishart distribution4.5. 1 Inverse Wishart distribution 1264.5.2 Visualizing the wishart distribution* 1274.6 Inferring the parameters of an MVn 1274.6.1 Posterior distribution of u 1284.6.2 Posterior distribution of e1284.6.3 Posterior distribution of u and 2* 1324.6.4 Sensor fusion with unknown precisions 138

PSO粒子群算法优化神经网络，针对bp神经网络容易陷入局部极小，收敛速度慢的缺点，利用pso优化神经网络，提高了网络的泛化能力。

这是一份Synopsys公司发行的PT workshop PDF课件，详细介绍了静态时序分析的相关概念和PT的使用规则，对于数字IC设计人员帮助很大