登录
首页 » Others » 智能微电网粒子群优化算法

智能微电网粒子群优化算法

于 2020-11-28 发布
0 375
下载积分: 1 下载次数: 12

代码说明:

智能微电网粒子群优化算法,微源:光伏、风机、发电机、储能等

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • wusb600nomnipeek.rar
    omnipeek wusb600n 抓包驱动windows 下面解压后 里面有inf文件 只需要更新驱动就可以
    2019-12-20下载
    积分:1
  • TDOA时差定位算法仿真
    MATLAB仿真程序,使用解析法和牛顿迭代法,在已知时延信息的基础上,对目标定位。内涵符号迭代和等值线绘图等角复杂代码
    2020-12-04下载
    积分:1
  • 5G Mobile and Wireless Communications Technology
    关于5G通信和无线传输的相关知识5G Mobile and wirelessCommunications TechnologyEDITED BYAFIF OSSEIRANEricssonJOSE F MONSERRATUniversitat politecnica de valenciaPATRICK MARSCHCAMBRIDGEUNIVERSITY PRESSCAMBRIDGEUNIVERSITY PRESSUniversity Printing House, Cambridge CB2 8BS, United KingdomCambridge University Press is part of the University of CambridgeIt furthers the Universitys mission by disseminating knowledge in the pursuit ofeducation learning and research at the highest international levels of excellencewww.cambridge.orgInformationonthistitlewww.cambridge.org/9781107130098C Cambridge University Press 2016This publication is in copyright. Subject to statutory exceptionand to the provisions of relevant collective licensing agreementsno reproduction of any part may take place without the writtenpermission of Cambridge University PressFirst published 2016Printed in the United Kingdom by TJ International Ltd. Padstow Cornwalla catalogue record for this publication is available from the british libraryLibrary of Congress Cataloguing in Publication dataOsseiran. Afif editor5G mobile and wireless communications technology /[edited by] Afif Osseiran, EricssonJose F monserrat, Polytechnic University of Valencia, Patrick Marsch, Nokia NetworksNew York: Cambridge University Press, 2016LCCN2015045732|ISBN978110713009( hardback)LCSH: Global system for mobile communications. Mobile communication systems- StandardsLCC TK5103483A152016DDC62138456dc23Lcrecordavailableathttp://icCn.loc.gov/2015045732IsBN 978-1-107-13009-8 HardbackCambridge University Press has no responsibility for the persistence or accuracy ofURLS for external or third- party internet websites referred to in this publicationand does not guarantee that any content on such websites is, or will remainaccurate or appropriateTo my new born son S, my twin sons H& N, my wife L s-y for her unwaveringencouragement, and in the memory of a great lady my aunt K eA OsseiranTo my son, the proud fifth generation of the name Jose Monserrat. And with thewarmest love to my daughter and wife, for being always there.E MonserratTo my two small sons for their continuous energetic entertainment, and my dearwife for her amazing patience and support.P MarschContentsList of contributorspage xIvForewordAcknowledgmentsXIXAcronymsXXIIIntroduction1. 1 Historical background1.1.1 Industrial and technological revolution: from steam enginesto the internet1. 1.2 Mobile communications generations: from IG to 4G1.1.3 From mobile broadband ( mbb) to extreme MBB1. 1.4 IoT: relation to 5G1.2 From ICT to the whole economy6771.3 Rationale of 5G: high data volume, twenty-five billion connecteddevices and wide requirements1.3.1 Security1.4 Global initiatives1. 4.1 METIS and the 5G-PPP1. 4.2 China: 5G promotion group2241. 4.3 Korea: 5G Forum141. 4.4 Japan: ARIB 2020 and Beyond Ad Hoc1. 4.5 Other 5G initiatives14.6 Iot activities1.5 Standardization activities445551.5.1ITU-R1.5.23GPP161.5.3 EEE161.6 Scope of the book16References185G use cases and system concept212. 1 Use cases and requirements212.1.1 Use cases212. 1.2 Requirements and key performance indicatorsContents2.2 5G system concept322.2.1 Concept overview322. 2.2 Extreme mobile broadband342.2.3 Massive machine-type communication362.2.4 Ultra-reliable machine-type communication382.2.5 Dynamic radio access network392.2.6 Lean system control plane432. 2. 7 Localized contents and traffic flows52.2.8 Spectrum toolbox2. 3 Conclusions48References48The 5g architecture503.1 Introduction503.1.1 NFV and SDN503.1.2 Basics about ran architecture533.2 High-level requirements for the 5G architecture563.3 Functional architecture and 5g flexibility573.3.1 Functional split criteria583.3.2 Functional split alternatives593.3.3 Functional optimization for specific applications3.3.4 Integration of lte and new air interface to fulfill 5Grequirements3.3.5 Enhanced Multi-RAT coordination features663. 4 Physical architecture and 5G deployment3.4.1 Deployment enablers673.4.2 Flexible function placement in 5G deployments713.5 Conclusions74References75Machine-type communications774.1 Introduction774.1.1 Use cases and categorization of mto774.1.2 MTC requirements804.2 Fundamental techniques for MTC834.2.1 Data and control for short packets834.2.2 Non-orthogonal access protocols854.3 Massive mtc864.3.1 Design principles864.3.2 Technology components864.3. 3 Summary of mMTC features944.4 Ultra-reliable low-latency MTC944.4. 1 Design principles944.4.2 Technology componentsContents4.4.3 Summary of uMTC features1014.5 Conclusions102References103Device-to-device(D2D)communications1075.1 D2D: from 4G to 5G1075.1.1 D2D standardization: 4G LTE D2D1095.1. 2 D2D in 5G: research challenges1125.2 Radio resource management for mobile broadband D2D1135.2.1 RRM techniques for mobile broadband d2d5.2.2 RRM and system design for D2D1145.2.3 5G D2D RRM concept: an example5.3 Multi-hop d2d communications for proximity and emergencyservices1205.3.1 National security and public safety requirements in 3GPPand Metis1215.3.2 Device discovery without and with network assistance125.3.3 Network-assisted multi-hop d2d communications1225.3.4 Radio resource management for multi-hop D2D1245.3.5 Performance of D2D communications in the proximitcommunications scenario1255. 4 Multi-operator d2d communication1275.4.1 Multi-operator D2D discovery275.4.2 Mode selection for multi-operator D2D1285.4.3 Spectrum allocation for multi-operator D2D295.5 Conclusions133References1346Millimeter wave communications1376. 1 Spectrum and regulations1376.2 Channel propagation1396.3 Hardware technologies for mm W systems1396.3.1 Device technology1396.3.2 Antennas1426.3.3 Beamforming architecture1436.4 Deployment scenarios6. 5 Architecture and mobility1466.5.1 Dual connectivit1476.5.2 Mobility1476.6 Beamforming1496.6. 1 Beamforming techniques1496.6.2 Beam finding1506.7 Physical layer techniques1526.7.1 Duplex scheme152
    2020-12-06下载
    积分:1
  • 基于VHDL三层电梯控制器的设计.pdf
    【实例简介】·1.内容简介: --------------------------------------------------------------- 基于VHDL三层电梯控制器的设计.pdf pdf 设计论文 --------------------------------------------------------------- ·2.资源使用方法说明 无 --------------------------------------------------------------- ·3. wogeguaiguai的附言: 1.我的其他数学建模比赛和全国电子设计竞赛精华资源也欢迎您下载,大学生基本上都听过这个比赛吧,这个比赛比较有意思,而且获奖比例高。我的资料都是非常好的准备比赛要用的资料。我比赛结束之后,这些资料就不用啦,分享给大家!俺一年的搜索资源,同学们一朝即可获得! 2.下载本文件后,您可以获得所有信息,不必再零散下载,给您带来很大的方便。 3.1个资源分,绝对物超所值。评论后,您就可以获得2个资源分,欢迎您评论! --------------------------------------------------------------- ·4.如有问题,请在此留言,谢谢。 --------------------------------------------------------------- ·65.上传时间 2010-2-26-afternoon
    2021-12-02 00:38:03下载
    积分:1
  • python3 + wxpython 实现 RSA 安全传输工具.rar
    【实例简介】最近打算使用 python3 写一个图形化的安全传输工具,加密算法是编程实现的,而不是调用 python 自带的函数库。 主要功能: 1. 作为服务器登录 2. 作为客户端登录 3. 服务器生成公私钥文件并将公钥发送给客户端 4. 客户端用户输入明文 5. 客户端使用公钥加密并将密文发送给服务器 6. 服务器解密密文并将信息显示在主界面 7. 服务器和服务器都支持文件的查看和保存
    2021-12-05 00:37:19下载
    积分:1
  • 赛事大师(乒乓球)-2015-10-09
    一套功能强大,免费的抽签编排软件,纯绿色免安装。
    2020-12-04下载
    积分:1
  • 基于FPGA的雷达信号处理实现.rar
    01 雷达总体概括02 雷达信号处理类型和定义03 FPGA_DSP_PPC_ARM总体简介04 雷达信号处理仿真05 FPGA具体硬件模块06 雷达理论使用FPGA实现07 雷达抗干扰措施和仿真08 雷达抗干扰FPGA实现09 新体制雷达和具体实现10 雷达总体总结
    2020-11-28下载
    积分:1
  • [稀有资源]PKPM地震波文件
    PKPM地震波库(天然波)分类方式同PKPM地震波已进行归一化处理
    2020-12-11下载
    积分:1
  • 小甲鱼零基础学python全套课后及答案
    小甲鱼零基础学python全套课后题及答案,96集全部答案。
    2020-11-28下载
    积分:1
  • Finite-Dimensional Vector Spaces - P. Halmos (Springer, 1987)
    在学习代数学之余,值得一看的代数学书籍。里面介绍了更为丰富的代数学概念和结论。PREFACEMy purpose in this book is to treat linear transformations on finite-dimensional vector spaces by the methods of more general theories. Theidea is to emphasize the simple geometric notions common to many partsof mathematics and its applications, and to do so in a language that givesaway the trade secrets and tells the student what is in the back of the mindsof people proving theorems about integral equations and Hilbert spaces.The reader does not, however, have to share my prejudiced motivationExcept for an occasional reference to undergraduate mathematics the bookis self-contained and may be read by anyone who is trying to get a feelingfor the linear problems usually discussed in courses on matrix theory orhigher"algebra. The algebraic, coordinate-free methods do not lose powerand elegance by specialization to a finite number of dimensions, and theyare, in my belief, as elementary as the classical coordinatized treatmentI originally intended this book to contain a theorem if and only if aninfinite-dimensional generalization of it already exists, The temptingeasiness of some essentially finite-dimensional notions and results washowever, irresistible, and in the final result my initial intentions are justbarely visible. They are most clearly seen in the emphasis, throughout, ongeneralizable methods instead of sharpest possible results. The reader maysometimes see some obvious way of shortening the proofs i give In suchcases the chances are that the infinite-dimensional analogue of the shorterproof is either much longer or else non-existent.A preliminary edition of the book (Annals of Mathematics Studies,Number 7, first published by the Princeton University Press in 1942)hasbeen circulating for several years. In addition to some minor changes instyle and in order, the difference between the preceding version and thisone is that the latter contains the following new material:(1) a brief dis-cussion of fields, and, in the treatment of vector spaces with inner productsspecial attention to the real case.(2)a definition of determinants ininvariant terms, via the theory of multilinear forms. 3 ExercisesThe exercises(well over three hundred of them) constitute the mostsignificant addition; I hope that they will be found useful by both studentPREFACEand teacher. There are two things about them the reader should knowFirst, if an exercise is neither imperative "prove that.., )nor interrogtive("is it true that...?" )but merely declarative, then it is intendedas a challenge. For such exercises the reader is asked to discover if theassertion is true or false, prove it if true and construct a counterexample iffalse, and, most important of all, discuss such alterations of hypothesis andconclusion as will make the true ones false and the false ones true. Secondthe exercises, whatever their grammatical form, are not always placed 8oas to make their very position a hint to their solution. Frequently exer-cises are stated as soon as the statement makes sense, quite a bit beforemachinery for a quick solution has been developed. A reader who tries(even unsuccessfully) to solve such a"misplaced"exercise is likely to ap-preciate and to understand the subsequent developments much better forhis attempt. Having in mind possible future editions of the book, I askthe reader to let me know about errors in the exercises, and to suggest im-provements and additions. (Needless to say, the same goes for the text.)None of the theorems and only very few of the exercises are my discovery;most of them are known to most working mathematicians, and have beenknown for a long time. Although i do not give a detailed list of my sources,I am nevertheless deeply aware of my indebtedness to the books and papersfrom which I learned and to the friends and strangers who, before andafter the publication of the first version, gave me much valuable encourage-ment and criticism. Iam particularly grateful to three men: J. L. Dooband arlen Brown, who read the entire manuscript of the first and thesecond version, respectively, and made many useful suggestions, andJohn von Neumann, who was one of the originators of the modern spiritand methods that I have tried to present and whose teaching was theinspiration for this bookP、R.HCONTENTS的 FAPTERPAGRI SPACESI. Fields, 1; 2. Vector spaces, 3; 3. Examples, 4;4. Comments, 55. Linear dependence, 7; 6. Linear combinations. 9: 7. Bases, 108. Dimension, 13; 9. Isomorphism, 14; 10. Subspaces, 16; 11. Calculus of subspaces, 17; 12. Dimension of a subspace, 18; 13. Dualspaces, 20; 14. Brackets, 21; 15. Dual bases, 23; 16. Reflexivity, 24;17. Annihilators, 26; 18. Direct sums, 28: 19. Dimension of a directsum, 30; 20. Dual of a direct sum, 31; 21. Qguotient spaces, 33;22. Dimension of a quotient space, 34; 23. Bilinear forms, 3524. Tensor products, 38; 25. Product bases, 40 26. Permutations41; 27. Cycles,44; 28. Parity, 46; 29. Multilinear forms, 4830. Alternating formB, 50; 31. Alternating forms of maximal degree,52II. TRANSFORMATIONS32. Linear transformations, 55; 33. Transformations as vectors, 5634. Products, 58; 35. Polynomials, 59 36. Inverses, 61; 37. Mat-rices, 64; 38. Matrices of transformations, 67; 39. Invariance,7l;40. Reducibility, 72 41. Projections, 73 42. Combinations of pro-jections, 74; 43. Projections and invariance, 76; 44. Adjoints, 78;45. Adjoints of projections, 80; 46. Change of basis, 82 47. Similarity, 84; 48. Quotient transformations, 87; 49. Range and null-space, 88; 50. Rank and nullity, 90; 51. Transformations of rankone, 92 52. Tensor products of transformations, 95; 53. Determinants, 98 54. Proper values, 102; 55. Multiplicity, 104; 56. Triangular form, 106; 57. Nilpotence, 109; 58. Jordan form. 112III ORTHOGONALITY11859. Inner products, 118; 60. Complex inner products, 120; 61. Innerproduct spaces, 121; 62 Orthogonality, 122; 63. Completeness, 124;64. Schwarz e inequality, 125; 65. Complete orthonormal sets, 127;CONTENTS66. Projection theorem, 129; 67. Linear functionals, 130; 68. P aren, gBCHAPTERtheses versus brackets, 13169. Natural isomorphisms, 138;70. Self-adjoint transformations, 135: 71. Polarization, 13872. Positive transformations, 139; 73. Isometries, 142; 74. Changeof orthonormal basis, 144; 75. Perpendicular projections, 14676. Combinations of perpendicular projections, 148; 77. Com-plexification, 150; 78. Characterization of spectra, 158; 79. Spec-ptral theorem, 155; 80. normal transformations, 159; 81. Orthogonaltransformations, 162; 82. Functions of transformations, 16583. Polar decomposition, 169; 84. Commutativity, 171; 85. Self-adjoint transformations of rank one, 172IV. ANALYSIS....17586. Convergence of vectors, 175; 87. Norm, 176; 88. Expressions forthe norm, 178; 89. bounds of a self-adjoint transformation, 17990. Minimax principle, 181; 91. Convergence of linear transformations, 182 92. Ergodic theorem, 184 98. Power series, 186APPENDIX. HILBERT SPACERECOMMENDED READING, 195INDEX OF TERMS, 197INDEX OF SYMBOLS, 200CHAPTER ISPACES§L. FieldsIn what follows we shall have occasion to use various classes of numbers(such as the class of all real numbers or the class of all complex numbers)Because we should not at this early stage commit ourselves to any specificclass, we shall adopt the dodge of referring to numbers as scalars. Thereader will not lose anything essential if he consistently interprets scalarsas real numbers or as complex numbers in the examples that we shallstudy both classes will occur. To be specific(and also in order to operateat the proper level of generality) we proceed to list all the general factsabout scalars that we shall need to assume(A)To every pair, a and B, of scalars there corresponds a scalar a+called the sum of a and B, in such a way that(1) addition is commutative,a+β=β+a,(2)addition is associative, a+(8+y)=(a+B)+y(3 there exists a unique scalar o(called zero)such that a+0= a forevery scalar a, and(4)to every scalar a there corresponds a unique scalar -a such that十(0(B)To every pair, a and B, of scalars there corresponds a scalar aBcalled the product of a and B, in such a way that(1)multiplication is commutative, aB pa(2)multiplication is associative, a(Br)=(aB)Y,( )there exists a unique non-zero scalar 1 (called one)such that al afor every scalar a, and(4)to every non-zero scalar a there corresponds a unique scalar a-1or-such that aaSPACES(C)Multiplication is distributive with respect to addition, a(a+n)If addition and multiplication are defined within some set of objectsscalars) so that the conditions(A),B), and (c)are satisfied, then thatset(together with the given operations) is called a field. Thus, for examplethe set Q of all rational numbers(with the ordinary definitions of sumand product)is a field, and the same is true of the set of all real numberaand the set e of all complex numbersHHXERCISIS1. Almost all the laws of elementary arithmetic are consequences of the axiomsdefining a field. Prove, in particular, that if 5 is field and if a, and y belongto 5. then the following relations hold80+a=ab )Ifa+B=a+r, then p=yca+(B-a)=B (Here B-a=B+(a)(d)a0=0 c=0.(For clarity or emphasis we sometimes use the dot to indi-cate multiplication.()(-a)(-p)(g).If aB=0, then either a=0 or B=0(or both).2.(a)Is the set of all positive integers a field? (In familiar systems, such as theintegers, we shall almost always use the ordinary operations of addition and multi-lication. On the rare occasions when we depart from this convention, we shallgive ample warningAs for "positive, "by that word we mean, here and elsewherein this book, "greater than or equal to zero If 0 is to be excluded, we shall say"strictly positive(b)What about the set of all integers?(c) Can the answers to these questiong be changed by re-defining addition ormultiplication (or both)?3. Let m be an integer, m2 2, and let Zm be the set of all positive integers lessthan m, zm=10, 1, .. m-1). If a and B are in Zmy let a +p be the leastpositive remainder obtained by dividing the(ordinary) sum of a and B by m, andproduct of a and B by m.(Example: if m= 12, then 3+11=2 and 3. 11=9)a) Prove that i is a field if and only if m is a prime.(b What is -1 in Z5?(c) What is囊izr?4. The example of Z, (where p is a prime)shows that not quite all the laws ofelementary arithmetic hold in fields; in Z2, for instance, 1 +1 =0. Prove thatif is a field, then either the result of repeatedly adding 1 to itself is always dif-ferent from 0, or else the first time that it is equal to0 occurs when the numberof summands is a prime. (The characteristic of the field s is defined to be 0 in thefirst case and the crucial prime in the second)SEC. 2VECTOR SPACES35. Let Q(v2)be the set of all real numbers of the form a+Bv2, wherea and B are rational.(a)Ie(√2) a field?(b )What if a and B are required to be integer?6.(a)Does the set of all polynomials with integer coefficients form a feld?(b)What if the coeficients are allowed to be real numbers?7: Let g be the set of all(ordered) pairs(a, b)of real numbers(a) If addition and multiplication are defined by(a月)+(,6)=(a+y,B+6)and(a,B)(Y,8)=(ary,B6),does s become a field?(b )If addition and multiplication are defined by(α,月)+⑦,b)=(a+%,B+6)daB)(,b)=(ay-6a6+的y),is g a field then?(c)What happens (in both the preceding cases)if we consider ordered pairs ofcomplex numbers instead?§2. Vector spaceWe come now to the basic concept of this book. For the definitionthat follows we assume that we are given a particular field s; the scalarsto be used are to be elements of gDEFINITION. A vector space is a set o of elements called vectors satisfyingthe following axiomsQ (A)To every pair, a and g, of vectors in u there corresponds vectora t y, called the aum of a and y, in such a way that(1)& ddition is commutative,x十y=y十a(2)addition is associative, t+(y+2)=(+y)+a(3)there exists in V a unique vector 0(called the origin) such thata t0=s for every vector and(4)to every vector r in U there corresponds a unique vector -rthat c+(-x)=o(B)To every pair, a and E, where a is a scalar and a is a vector in u,there corresponds a vector at in 0, called the product of a and a, in sucha way that(1)multiplication by scalars is associative, a(Bx)=aB)=, and(2 lz a s for every vector xSPACESSFC B(C)(1)Multiplication by scalars is distributive with respect to vectorddition, a(+y=a+ ag, and2)multiplication by vectors is distributive with respect to scalar ad-dition, (a B )r s ac+ Bc.These axioms are not claimed to be logically independent; they aremerely a convenient characterization of the objects we wish to study. Therelation between a vector space V and the underlying field s is usuallydescribed by saying that v is a vector space over 5. If S is the field Rof real number, u is called a real vector space; similarly if s is Q or if gise, we speak of rational vector spaces or complex vector space§3. ExamplesBefore discussing the implications of the axioms, we give some examplesWe shall refer to these examples over and over again, and we shall use thenotation established here throughout the rest of our work.(1) Let e(= e)be the set of all complex numbers; if we interpretr+y and az as ordinary complex numerical addition and multiplicatione becomes a complex vector space2)Let o be the set of all polynomials, with complex coeficients, in avariable t. To make into a complex vector space, we interpret vectoraddition and scalar multiplication as the ordinary addition of two poly-nomials and the multiplication of a polynomial by a complex numberthe origin in o is the polynomial identically zeroExample(1)is too simple and example (2)is too complicated to betypical of the main contents of this book. We give now another exampleof complex vector spaces which(as we shall see later)is general enough forall our purposes.3)Let en,n= 1, 2,. be the set of all n-tuples of complex numbers.Ix=(1,…,轨)andy=(m1,…,n) are elements of e, we write,,bdefinitionz+y=〔1+叽,…十物m)0=(0,…,0),-inIt is easy to verify that all parts of our axioms(a),(B), and (C),52, aresatisfied, so that en is a complex vector space; it will be called n-dimenaionalcomplex coordinate space
    2020-12-05下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载