最新规范eMMC5.1（JESD84-B51）

一个简单的基于C#的人事工资管理系统的实现，数据库使用的是Sql Sever2005。实现了工资考勤等简单的管理

引力搜索算法源程序，包括原始论文，全未修改的英文原著和程序，参考价值高

凸优化理论在信号处理以及通信系统中的应用 比较经典的通信系统凸优化入门教程ContentsList of contributorspage IxPrefaceAutomatic code generation for real- time convex optimizationJacob Mattingley and stephen Boyd1.1 Introduction1.2 Solvers and specification languages61. 3 Examples121. 4 Algorithm considerations1.5 Code generation261.6 CVXMOD: a preliminary implementation281.7 Numerical examples291. 8 Summary, conclusions, and implicationsAcknowledgments35ReferencesGradient-based algorithms with applications to signal-recoveryproblemsAmir beck and marc teboulle2.1 Introduction422.2 The general optimization model432.3 Building gradient-based schemes462. 4 Convergence results for the proximal-gradient method2.5 A fast proximal-gradient method2.6 Algorithms for l1-based regularization problems672.7 TV-based restoration problems2. 8 The source-localization problem772.9 Bibliographic notes83References85ContentsGraphical models of autoregressive processes89Jitkomut Songsiri, Joachim Dahl, and Lieven Vandenberghe3.1 Introduction893.2 Autoregressive processes923.3 Autoregressive graphical models983. 4 Numerical examples1043.5 Conclusion113Acknowledgments114References114SDP relaxation of homogeneous quadratic optimization: approximationbounds and applicationsZhi-Quan Luo and Tsung-Hui Chang4.1 Introduction1174.2 Nonconvex QCQPs and sDP relaxation1184.3 SDP relaxation for separable homogeneous QCQPs1234.4 SDP relaxation for maximization homogeneous QCQPs1374.5 SDP relaxation for fractional QCQPs1434.6 More applications of SDP relaxation1564.7 Summary and discussion161Acknowledgments162References162Probabilistic analysis of semidefinite relaxation detectors for multiple-input,multiple-output systems166Anthony Man-Cho So and Yinyu Ye5.1 Introduction1665.2 Problem formulation1695.3 Analysis of the SDr detector for the MPsK constellations1725.4 Extension to the Qam constellations1795.5 Concluding remarks182Acknowledgments182References189Semidefinite programming matrix decomposition, and radar code design192Yongwei Huang, Antonio De Maio, and Shuzhong Zhang6.1 Introduction and notation1926.2 Matrix rank-1 decomposition1946.3 Semidefinite programming2006.4 Quadratically constrained quadratic programming andts sdp relaxation201Contents6.5 Polynomially solvable QCQP problems2036.6 The radar code-design problem2086.7 Performance measures for code design2116.8 Optimal code design2146.9 Performance analysis2186.10 Conclusions223References226Convex analysis for non-negative blind source separation withapplication in imaging22Wing-Kin Ma, Tsung-Han Chan, Chong-Yung Chi, and Yue Wang7.1 Introduction2297.2 Problem statement2317.3 Review of some concepts in convex analysis2367.4 Non-negative, blind source-Separation criterion via CAMNS2387.5 Systematic linear-programming method for CAMNS2457.6 Alternating volume-maximization heuristics for CAMNS2487.7 Numerical results2527.8 Summary and discussion257Acknowledgments263References263Optimization techniques in modern sampling theory266Tomer Michaeli and yonina c. eldar8.1 Introduction2668.2 Notation and mathematical preliminaries2688.3 Sampling and reconstruction setup2708.4 Optimization methods2788.5 Subspace priors2808.6 Smoothness priors2908.7 Comparison of the various scenarios3008.8 Sampling with noise3028. 9 Conclusions310Acknowledgments311References311Robust broadband adaptive beamforming using convex optimizationMichael Rubsamen, Amr El-Keyi, Alex B Gershman, and Thia Kirubarajan9.1 Introduction3159.2 Background3179.3 Robust broadband beamformers3219.4 Simulations330Contents9.5 Conclusions337Acknowledgments337References337Cooperative distributed multi-agent optimization340Angelia Nedic and asuman ozdaglar10.1 Introduction and motivation34010.2 Distributed-optimization methods using dual decomposition34310.3 Distributed-optimization methods using consensus algorithms35810.4 Extensions37210.5 Future work37810.6 Conclusions38010.7 Problems381References384Competitive optimization of cognitive radio MIMO systems via game theory387Gesualso Scutari, Daniel P Palomar, and Sergio Barbarossa11.1 Introduction and motivation38711.2 Strategic non-cooperative games: basic solution concepts and algorithms 39311.3 Opportunistic communications over unlicensed bands411.4 Opportunistic communications under individual-interferenceconstraints4151.5 Opportunistic communications under global-interference constraints43111.6 Conclusions438Ackgment439References43912Nash equilibria: the variational approach443Francisco Facchinei and Jong-Shi Pang12.1 Introduction44312.2 The Nash-equilibrium problem4412. 3 EXI45512.4 Uniqueness theory46612.5 Sensitivity analysis47212.6 Iterative algorithms47812.7 A communication game483Acknowledgments490References491Afterword494Index49ContributorsSergio BarbarossaYonina c, eldarUniversity of rome-La SapienzaTechnion-Israel Institute of TechnologyHaifaIsraelAmir beckTechnion-Israel instituteAmr El-Keyiof TechnologyAlexandra universityHaifEgyptIsraelFrancisco facchiniStephen boydUniversity of rome La sapienzaStanford UniversityRomeCaliforniaItalyUSAAlex b, gershmanTsung-Han ChanDarmstadt University of TechnologyNational Tsing Hua UniversityDarmstadtHsinchuGermanyTaiwanYongwei HuangTsung-Hui ChangHong Kong university of scienceNational Tsing Hua Universityand TechnologyHsinchuHong KongTaiwanThia KirubarajanChong-Yung chiMcMaster UniversityNational Tsing Hua UniversityHamilton ontarioHsinchuCanadaTaiwanZhi-Quan LuoJoachim dahlUniversity of minnesotaanybody Technology A/sMinneapolisDenmarkUSAList of contributorsWing-Kin MaMichael rebsamenChinese University of Hong KongDarmstadt UniversityHong KonTechnologyDarmstadtAntonio de maioGermanyUniversita degli studi di napoliFederico iiGesualdo scutariNaplesHong Kong University of Sciencealyand TechnologyHong KongJacob MattingleyAnthony Man-Cho SoStanford UniversityChinese University of Hong KongCaliforniaHong KongUSAJitkomut songsinTomer michaeliUniversity of californiaTechnion-Israel instituteLoS Angeles. CaliforniaogyUSAHaifaMarc teboulleTel-Aviv UniversityAngelia NedicTel-AvUniversity of Illinois atIsraelUrbana-ChampaignInoSLieven VandenbergheUSAUniversity of CaliforniaLos Angeles, CaliforniaUSAAsuman OzdaglarMassachusetts Institute of TechnologyYue WangBoston massachusettsVirginia Polytechnic InstituteUSAand State UniversityArlingtonDaniel p palomarUSAHong Kong University ofScience and TechnologyYinyu YeHong KongStanford UniversityCaliforniaong-Shi PangUSAUniversity of illinoisat Urbana-ChampaignShuzhong zhangIllinoisChinese university of Hong KongUSAHong KongPrefaceThe past two decades have witnessed the onset of a surge of research in optimization.This includes theoretical aspects, as well as algorithmic developments such as generalizations of interior-point methods to a rich class of convex-optimization problemsThe development of general-purpose software tools together with insight generated bythe underlying theory have substantially enlarged the set of engineering-design problemsthat can be reliably solved in an efficient manner. The engineering community has greatlybenefited from these recent advances to the point where convex optimization has nowemerged as a major signal-processing technique on the other hand, innovative applica-tions of convex optimization in signal processing combined with the need for robust andefficient methods that can operate in real time have motivated the optimization commu-nity to develop additional needed results and methods. The combined efforts in both theoptimization and signal-processing communities have led to technical breakthroughs ina wide variety of topics due to the use of convex optimization This includes solutions tonumerous problems previously considered intractable; recognizing and solving convex-optimization problems that arise in applications of interest; utilizing the theory of convexoptimization to characterize and gain insight into the optimal-solution structure and toderive performance bounds; formulating convex relaxations of difficult problems; anddeveloping general purpose or application-driven specific algorithms, including thosethat enable large-scale optimization by exploiting the problem structureThis book aims at providing the reader with a series of tutorials on a wide varietyof convex-optimization applications in signal processing and communications, writtenby worldwide leading experts, and contributing to the diffusion of these new developments within the signal-processing community. The goal is to introduce convexoptimization to a broad signal-processing community, provide insights into how convexoptimization can be used in a variety of different contexts, and showcase some notablesuccesses. The topics included are automatic code generation for real-time solvers, graphical models for autoregressive processes, gradient-based algorithms for signal-recoveryapplications, semidefinite programming(SDP)relaxation with worst-case approximationperformance, radar waveform design via SDP, blind non-negative source separation forimage processing, modern sampling theory, robust broadband beamforming techniquesdistributed multiagent optimization for networked systems, cognitive radio systems viagame theory, and the variational-inequality approach for Nash-equilibrium solutionsPrefaceThere are excellent textbooks that introduce nonlinear and convex optimization, providing the reader with all the basics on convex analysis, reformulation of optimizationproblems, algorithms, and a number of insightful engineering applications. This book istargeted at advanced graduate students, or advanced researchers that are already familiarwith the basics of convex optimization. It can be used as a textbook for an advanced graduate course emphasizing applications, or as a complement to an introductory textbookthat provides up-to-date applications in engineering. It can also be used for self-study tobecome acquainted with the state of-the-art in a wide variety of engineering topicsThis book contains 12 diverse chapters written by recognized leading experts worldwide, covering a large variety of topics. Due to the diverse nature of the book chaptersit is not possible to organize the book into thematic areas and each chapter should betreated independently of the others. a brief account of each chapter is given nextIn Chapter 1, Mattingley and Boyd elaborate on the concept of convex optimizationin real-time embedded systems and automatic code generation. As opposed to genericsolvers that work for general classes of problems, in real-time embedded optimization thesame optimization problem is solved many times, with different data, often with a hardreal-time deadline. Within this setup the authors propose an automatic code-generationsystem that can then be compiled to yield an extremely efficient custom solver for theproblem familyIn Chapter 2, Beck and Teboulle provide a unified view of gradient-based algorithmsfor possibly nonconvex and non-differentiable problems, with applications to signalrecovery. They start by rederiving the gradient method from several different perspectives and suggest a modification that overcomes the slow convergence of the algorithmThey then apply the developed framework to different image-processing problems suchas e1-based regularization, TV-based denoising, and Tv-based deblurring, as well ascommunication applications like source localizationIn Chapter 3, Songsiri, Dahl, and Vandenberghe consider graphical models for autore-gressive processes. They take a parametric approach for maximum-likelihood andmaximum-entropy estimation of autoregressive models with conditional independenceconstraints, which translates into a sparsity pattern on the inverse of the spectral-densitymatrix. These constraints turn out to be nonconvex. To treat them the authors proposea relaxation which in some cases is an exact reformulation of the original problem. Theproposed methodology allows the selection of graphical models by fitting autoregressiveprocesses to different topologies and is illustrated in different applicationsThe following three chapters deal with optimization problems closely related to SDPand relaxation techniquesIn Chapter 4, Luo and Chang consider the SDP relaxation for several classes ofquadratic-optimization problems such as separable quadratically constrained quadraticprograms(QCQPs)and fractional QCQPs, with applications in communications and signal processing. They identify cases for which the relaxation is tight as well as classes ofquadratic-optimization problems whose relaxation provides a guaranteed, finite worstcase approximation performance. Numerical simulations are carried out to assess theefficacy of the SDP-relaxation approach

对船舶数学模型的各个推进器参数进行系统辨识，具有实际价值李文华,等:船舶动力定位系统数学模型参数辨识方法研究针对动力定位技术的发展,我国研究人员也进表1离散时间摘要扩展卡尔曼滤波行了积极有益的探索。文献[]用固定增益的卡尔f(k+1)=F((k),(k)+vw(k)曼滤波估计低频运动,而高频运动则用一个参数模系统模型量测|/(k)~N(O,Q(k》)x(k)=H((k)();型来模拟,并用递推增广最小二乘法来估计参数,从u(k)-N(0,Q(k)而估计出船舶的髙频运动。通过控制计算和模拟试初始情况1(0)+5np(0)=验取得了良好的效果。文献[12]提出了水面舰船动力定位控制系统模型参数的离线最速下降寻优的状态估计传递|(k+1)=F((k),()误差协方差传递辨识方法,提高了动力定位系统研制过程的工作效P(h+1)=(h)P()(k)+r(kQ(k )r(k)率。文献[13]在建立船舶三维几何模型基础上,对K()=P(k)HT(k)H()(kH()+R()]-满载船舶从浅水40m到深水500m的水动力系状态估计更新)=()1)((数进行数值计算。利用三维线性势流理论在频域误差协方差更新P)=kk)H(FLK)H()y里研究船舶在浅水中的辐射问题,应用三维源汇分K()R(k)K(k)布法对不同水深下船舶运动的水动力系数,包括附定义φ(k)=0()JH(-)加质量和阻尼系数进行数值计算与分析,得出了有(k)H(k)=0(k)限深水域的附加质量和阻尼系数的渐进特性。文献14]考虑具有修正PM波谱的长峰不规则浪,基于尾部隧道式侧推m,艏部隧道式侧推,艄部方海浪幅值响应算子(RAO研究了船舶在海浪中的六角式推进器。质量阵M可利用文献9]里介绍自由度运动预报模型。为了有效地量化海洋环境对的 Strip Theory计算得到:动力定位船舶的作用,文献[5提出了海洋环境负从/1127400018902-00744载(包括风、海浪和海流)的建模方法,并运用00.07440.1278MATLAB的M文件和SIMUⅠNK分别编制了风干为了得到需要辨识的量需重复进行3项(每项扰力和力矩计算及随机海浪的仿真程序。在三级海2次,共6次)海上试验,以此提高参数估计器的收况下,实现了对海洋环境的仿真,得到了合理的仿真敛性和表现。具体如下结果。文献[1]考虑到船舶的动态特性存在固有的第1项:解耦了的纵荡运动。船舶仅依靠主螺强非线性以及非线性控制改善系统性能和鲁棒性的旋桨山和实现恒速前进,艏向通过艏侧推控制。能力,将非线性控制理论应用到船舶动力定位控制第2项:结耦了的横荡与艏摇运动。通过三个隧道系统的设计中,对某供应船的计算机模型进行仿真,式推进器砌、4、实现两次结耦了的横荡与艏摇运验证了非线性控制系统是有效的。文献[17]提出并动。第3项:在结耦的横荡与艏摇运动中得到方位验证了基于线性核函数在线支持向量回归的模型预角式推进器u的推力系数K6测控制方案。在线支持向量回归算法的引入可以通第1项是为了计算主螺旋桨的推力系数K1和过在线调整,确保预测模型的精确性。Xa,需要的输入量是X本文中X的计算方法是利22船舶数学模型参数辨识用文献[19]里介绍的切片法。第2项是为了计算结文献[18]讨论了使用两个并行测量序列来估计耦了的横荡与艏摇运动的参数数值,可以辨识出的动力定位船舶模型参数的离线并行扩展卡尔曼滤波向量为[ YYNNK3K5]第3项是为了计算全方器算法(O- line parallel extended Kalman filter位推进器的推力系数K6( EKF) Algorithm),见表1。最后采用一项以供给船使用动量方程来代替标准动力学方程,不仅可为对象的全尺度的海上试验来验证提出的参数估计以显著提高状态和参数估计器的性能还具有以下器的收敛性和鲁棒性。优点:实验对象以挪威ABB公司的“ Far Scandia”号供(1)增加数据冗余度;给船为原型。该船总长762m,船宽18:8m,型深(2)降低量测噪声;825m,吃水625m,净吨位4200t,主发动机功率(3)降低环境干扰;3533kW。推进器配置左右舷两个主推进器u1、l2,(4)增加数据记录长度第23卷第3期(总第135期)船羔vd.23N.3012年6月shiP boatJune, 2012(5)以对参数分批进行辨识等手段提高参数辨风。将风速分量定义为识的精确度。L=v,cos(ψ图2显示了实验辨识得到的A和。其中A包(5)W V sin(B-0)含的待求未知量[XyYM而R包含的待求末式中和v分别为风速在X轴和Y轴的分量;v知量是[kk2k3k4k5k6]。和月分别表示风速和风向。如图1所示。假设风速远大于船速,风在纵荡、横荡和艏摇方向的负荷向量可表述为As elements.pAcM(o)V, IV0.5p.A_C-(r )V,V6)0.SpA,Lo C(rm)VV.式中,风的相对角为y=ψp为空气密度,单位e号为kgm3;Lm为船舶总长,单位为m;V为相对风速,103K elements单位为kn;A-和A为正投影面积和侧投影面积,2015单位均为m2;C(y)Cn(y)和C(4)分别为纵荡横荡和艄摇方向的无因次风系数,是通过 Isherwood半经验公式得到的。00003,波浪扰动数学模型波浪干扰力一般分为两种:一种是一阶波浪干图2实验辨识得到的参数曲线扰力,也称高频波浪干扰力。这是在假设波浪为微幅波,未引起船舶大幅摇荡的情况下,认为船舶受到经实验辨识出的动量方程中的量:与波高成线性关系并且与波浪同频率的波浪力。另0.03180种是二阶波浪力,也称波浪漂移力该波浪力与波A000602006l8高平方成比例。0.0075_0.2454这种具有高频率小振幅振荡特性的波浪所产生K=103ding([93,93,20,2.0,28,26]的一阶波浪干扰力最主要是引发船舶的纵摇和垂荡经过计算公式D-M得到运动,对横摇的影响稍次之,而对横荡及艄摇运动的002820影响相对来说就小一些。至于具有慢时变特性的二00.0130475900.081419676阶波浪干扰力,本身同时又是非线性的,它仍然和波写成动力定位模式下的状态空间表达式为:浪的频率有关。波浪的二阶漂移力不但会改变船舶元=AU+Bx(4)疔的航向和航迹,尤其对于在锚泊状态下船舶位置的移动及钻井平台的动力定位系统的工作等均有式中A=MA4M,并且B=MTK。其数值表达式为:重要影响00318000.062800030下面介绍一种估算二阶波浪漂移力方法。19740.0046-0.2428年, Newman提出一种应用频域波浪漂移力系数的0008200082000估算方法。通过把波谱(通常选用PM谱)分为N0∞505-069000108等份,每份有相对应的波浪频率m和波幅A。这样波浪漂移力对横荡、纵荡、艏摇运动的作用力计算公3环境扰动数学模型式为131风扰动数学模型A,(T(W,B=-y)1(W+)风的作用可分为平缓变化的风和快速变化的李文华,等:船舶动力定位系统数学模型参数辨识方法研究[5] Fossen T L. Handbook of Marine Craft Hydrodynamics and式中,T()x0是频域波浪偏移力公式fB是平均Motion Control[M]. Wiley Sons Ltd, 2011: 81-83.波浪方向:是随机的相角。[6] Balchen J G, Jenssen N A, Saelid S Dynamic Positioning可以通过对本估算式进行改变,以避免在数值Using Kalman Filtering and Optimal Control Theory[C]/上产生无物理意义的高频分量。还可对本式进行扩Proceedings of IFAC/IFIP Symposium on Automation in展,用来包括波浪蔓延( wave spreading)。Offshore Oil Field Operation Norway 1976: 183-18633海流扰动数学模型[7]Balchen J G, Jenssen N A Mathisen E, et al. Dynamic作用在海上动力定位船舶上的海流具有方向和Positioning System Based on Kalman Filtering and OptimalControl[J]Modeling, Identification and ControL 1980, 1(3)速度的特征,研究中一般不考虑在大地坐标系下铅135-163垂方向运动。海流分为恒定流和潮汐流。恒定流一般[8] Strand JP, Fossen t inonlinear Passive Observer Design为固定方向和速度的海流,如洋流。潮汐流指海洋for Ships with Adaptive Wave Filtering, In: New Directions因为潮汐运动而引起的海水流动,其典型的表现为in Nonlinear Observer Design(Nijmeijer H, Fossen T L)海流方向的缓慢变化。但对于动力定位来说,海流[M].London: Springer-Verlag London Ld, 1999: 113-134的大小与方向可以认为是确定的,所以海流的模型[9] Guttorm t, Jerome J, Fosset I. Nonlinear Dynamic可以统一按照大小和方向恒定来确立。流的速度分Positioning of Ships with Gain-Scheduled Wave Filtering量表示为5:[C]//The Proceedings of 43rd IEEE Conference orL=V2cos(ψ)Decision and Control, Atlantis, Paradise Island, BahamasDecemher2004:5340-5347ve=y sin(8-n)式中:和v分别为流速在X轴和y轴的分量;V10 i Do K d. Global Robust and Adaptive Output FeedbackDynamic Positioning of Surface Ships[C]/The Proceedings和月分别代表流速和流向。如图1所示。of 2007 IEEE Internati在此没有考虑第摇方向的流速,而海流对水面Automation. Roma, April 2007: 10-14船舶的作用可以通过将各海流速度分量引人到船的1]王晓声船舶动力定位系统设计及试验研究门J国造运动方程中由相对速度向量v=[u-,-a,r丁体现。船,1991(3):12-21[12]边信黔,严渐平,施小成船舶动力定位系统参数辨识4结论方法的研究[J]船舶工程,19994):36-38[13]姜哲,石珦,王磊动力定位船舶水动力参数数值试验本文讨论了船舶及推进器动力学数学模型与船研究[门]实验室研究与搡索,2005(12):14-17.舶外界环境干扰因素数学模型的建模策略。通过对14]李文魁张博田蔚风等.一种波浪中的船舶动力定位已有研究方法的分析研究与总结,有助于建立适用运动建模方法研究[]仪器仪表学报,2007(6):1051于各种海况和操作模式的船舶动力定位系统非线性数学模型。[15]施小成王元慧船舶动力定位海洋环境的建模与仿真J,计算机仿真,2006(11):237-239[16]刘芙蓉陈辉基于非线性控制理论的船舶动力定位控[参考文献制系统的数学模型[〕船海工程,209(5):92-95[1]杜佳璐,张显库汪思源,等船舶动力定位系统的自适[17]邓志良,胡寿松,张军峰船舶动力定位系统的在线模应非线性控制器设计[ C]/proceedings of the2 g chinese型预测控制[门中国造船,2009(6):879Control Conference. Beijing, 2010: 585-589.[2]周利,王磊,陈恒动力定位控制系统研究[船海[18] Fossen T I.Identification of Dynamically Positioned Shipe[].Control Engineering Practice, Volume 4, Issue 3, March程,008,37(2)86-911996:369-376[3]马超庄亚锋陈俊英船舶动力定位系统技术[J中国[19] FaltinsenO M Sea Loads on Ships and Oishore Structures造船,2009,50(增刊):52-57[4]贾欣乐,杨盐生船舶运动数学模型机理建模与数学建[M].Cambridge University Press, 1990:41-45模[M]大连大连海事大学出版社,199:294-356船舶动力定位系统数学模型参数辨识方法研究旧WANFANG DATA文献链接作者:李文华,杜佳璐,张银东,宋健,孙玉清,陈海泉, LI Wen-hua, DU Jia-luZHANG Yin-dong, SONG Jian, SUN Yu-ging, CHEN Hai-quan作者单位李文华,张银东,宋健,孙玉清,陈海泉, LI Wen-hua, ZHANG Yin-dong, SONG Jian, suN Yu-qing, chen Hai-quan(大连海事大学轮机工程学院大连116026),杜佳璐, DU Jia-lu(大连海事大学信息科学技术学院大连116026)刊名:船舶英文刊名:Ship boat年,卷(期):2012,23(3)参考文献(19条1. Balchen J G; Jenssen N A; Mathisen E Dynamic Positioning System Based on Kalmon Filtering andOptimal Control 1980(03)2. Balchen J G; Jenssen N A; Saelid S Dynamic Positioning Using Kalman Filtering and Optimal ControlTheory 19763. Fossen T I Handbook of Marine Craft Hydrodynamics and Motion Control 20114贾欣乐;杨盐生船舶运动数学模型机理建模与数学建模19995.马超;庄亚锋;陈俊英船舶动力定位系统技术2009(增刊)6.周利;王磊;陈恒动力定位控制系统研究[期刊论文]船海工程2008(02)7. Faltinsen 0 M Sea Loads on Ships and Offshore Structures 19908. Fossen t I Identification of Dynamically Positioned Ships 19969.邓志良;胡寿松;张军峰船舶动力定位系统的在线模型预测控制2009(06)10.刘芙蓉;陈辉基于非线性控制理论的船舶动力定位控制系统的数学模型[期刊论文]船海工程2009(05)11.施小成;王元慧船舶动力定位海洋环境的建模与仿真[期刊论文]计算机仿真2006(11)12.李文魁;张博;田蔚风一种波浪中的船舶动力定位运动建模方法硏究[期刊论文]仪器仪表学报2007(06)13.姜哲;石珣;王磊动力定位船舶水动力参数数值试验硏究[期刊论文]实验室硏究与探索2005(12)14.边信黔;严浙平;施小成船舶动力定位系统参数辨识方法的硏究[期刊论文]船舶工程1999(01)15.王晓声船舶动力定位系统设计及试验研究1991(03)Do K d Global robust and Adaptive Output Feedback Dynamic Positioning of Surface Ships 200717. Guttorm T; Jer(o)me J; Fossen T I Nonlinear Dynamic Positioning of Ships with Gain-Scheduled WaveFiltering 200418. Strand J P; Fossen T I Nonlinear Passive Observer Design for Ships with Adaptive Wave Filtering19.杜佳璐;张显库;汪思源船舶动力定位系统的自适应非线性控制器设计2010本文链接http://d.g.wanfangdata.comcn/periodiCalcb201203011.aspx

基本算法，亲测可用

python书中的代码，可以很快的习得BP神经网络，并且其中提供了修改后的预测程序

数据结构_C#_雷军环版_程序代码源代码是根据书本内容写的。

该文档包含了比较全面的行为识别的综述，以及深度学习的最近进展，能够帮助大家尽快掌握该领域的发展现状，为大家理清研究思路提供一定的帮助和参考。

该文档是我的本科毕业设计，包含论文以及对应的MATLAB上的simulink仿真，代码主要包括：光伏MPPT算法，光伏电池和蓄电池构成能量管理系统，光伏电池、蓄电池和超级电容构成能量管理系统。比较全面

将模拟退火算法应用于神经网络中，可解决神经网络算法易陷入局部极小和收敛速度慢的问题