Python爬取新冠肺炎疫情实时数据

SSD4 Exercise1，2，3，4，5，6，7，8，Exam1，2答案+SSD教程CHM学习Carnegie SSD系列课程的同学可以如果不想做凡人的Exercise和Exam的话就下吧！！别处找不到。全部为自己做 全部90分以上 好几个是100分

简单实现了二维装箱问题。不过仅仅是简单实现，排列7、8个矩形没问题，超过10个就要花N久了。。

非常漂亮的圣诞祝福网页源码，圣诞节祝福网页特别制作了圣诞祝福网页送给你，愿这圣诞祝福网页能给你带来你想要的东西！一起来发圣诞网页祝福吧！让这最漂亮的圣诞节祝福网页传达你的祝福——祝您圣诞节快乐

alternating direction method of multipliers优化算法讲解OutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsDual decompositionDual problemp convex equality constrained optimization problemminimizesubject to Ax= 6e Lagrangian: L(a, g)=f(a)+y(Ac-bdual function: g(y)=infx L(, g)e dual problem: maximize g(g)recover x*=argminL(, y*)Dual decompositionDual ascentgradient method for dual problem: y+l=yk +aVg(yky ")=A c-b, where a= argmin L(a, y")b dual ascent method isk+1gminz L(a, yk/-minimization(Axk+I-b)// dual updateworks, with lots of strong assumptionsDual decompositionDual decompositione suppose f is separablef(x)=f1(x1)+…+fN(xN),x=(x1Nthen L is separable in x: L(a, y)=L1(a1, 3)+...+Ln(N, 3)-y bLi(ai, y)=fi(ai)+y Aiaie -minimization in dual ascent splits into N separate minimizationsk+1argmin Li(li, y)Which can be carried out in parallelDual decompositionDual decompositiondual decomposition(Everett, Dantzig, Wolfe, Benders 1960-65k+1argLi(ei, y)N A: k+scatterupdate i in parallel, gather Ai k+solve a large problemby iteratively solving subproblems(in parallel)dual variable update provides coordinationworks, with lots of assumptions; often slowDual decompositionOutlineDual decompositionMethod of multipliersAlternating direction method of multipliersCommon patternsExamplConsensus and exchangeConclusionsMethod of multipliersMethod of multipliersa method to robustify dual ascentb use augmented Lagrangian(Hestenes, Powell 1969),p>0(, y)=f(c)+y(Ax-b)+(p/2)Acmethod of multipliers( Hestenes, Powell; analysis in Bertsekas 1982)k+1argmin Lp(a, yD(A.(note specific dual update step length pMethod of multipliersMethod of multipliers dual update stepoptimality conditions( for differentiableAcx-b=0, Vf(a*)+A(primal and dual feasibility)Since ah+1minimizes Lp(a, y)k+1 kf(x4+1)+A7(y+p(AVxf(at)+adual update yti=y+p(k+1k+1dual feasibleprimal feasibility achieved in limit: A k+I-b>0Method of multipliers

QT+OPenCV+USB 摄像头功能：录像、拍照、播放录像。

吴恩达机器学习编程作业python3.6版本，编译环境pycharm，配置Anaconda3 。代码含有较为详细的注释，对初学者较合适。

混沌系统同步控制的代码，以蔡氏电路为基础。有PID的P控制，还有其他控制方法，至少有两种，时间太长忘掉了，记得住的都把代码的名称换成中文的了。运行时注意把文件名换回来就行了。还有的看不懂的，可以留言，我到时补发下当时课程报告时的描述。

SAC(Seismic Analysis Code)是美国加州大学Lawrence Livermore国家实验室(LLNL)开发研制的，用于研究连续信号，特别是时间序列数据的通用程序

【实例简介】

OFDMA系统分析与设计的国外经典教材Chapter 1 Introduction to OFDM and OFDMAChapter 2 Characterization of the Mobile Wireless ChannelChapter 3 Fundamentals of Digital Communications and NetworkingChapter 4 Fundamentals of OFDM and OFDMA: Transceiver StructureChapter 5 Physical Layer: Time and FrequencyChapter For a listing of recent titles in theArtech House Mobile Communications Library,turn to the back of this bookOFDMA System Analysis and DesignSamuel C. YangARTECHHOUSEBOSTON LONDONartechhouse. comLibrary of Congress Cataloging-in-Publication DataA catalog record for this book is available from the U.S. Library of CongressBritish Library cataloguing in Publication DataA catalogue record for this book is available from the british libraryISBN-13:978-1-60807-076-3Cover design by vicki KaneC 2010 Artech House685 Canton streetNorwood. MA 02062All rights reserved. Printed and bound in the United States of America. No partof this book may be reproduced or utilized in any form or by any means, elec-tronic or mechanical, including photocopying, recording, or by any informationstorage and retrieval system, without permission in writing from the publisherAll terms mentioned in this book that are known to be trademarks or servicemarks have been appropriately capitalized artech House cannot attest to theaccuracy of this information. Use of a term in this book should not be regardedas affecting the validity of any trademark or service mark10987654321To my beautiful wife JennyContentsPrefaceAcknowledgmentsXVCHAPTER TIntroduction to ofdm and ofdma1.1 Motivation1.2 Conventional FDm1.3 Advantages of FDm1.3.1 Intersymbol Interference(ISI)and Multipath Fading1.3.2 Modulation and Coding per Subcarrier1.3.3 Simple equalization1.4 Disadvantages of FDM1.5 Basics of ofdm1.6 Advantages of OFDM1.6.1 Low-Complexity modulation1.6.2 Spectral Efficiency1.7 Basics of ofdma1.8 Advantages of OFDMA121.9 Some Practical issues of ofdm and ofdma1.9.1 Time Domain: Interblock Interference131.9.2 Frequency Domain: Intercarrier Interference131.10 OFDM and Dsss141.11 Overview of the book14References15Selected BibliographyCHAPTER 2Characterization of the mobile wireless channel2.1 Introduction2.2 Link analysis2.3 Distance Dimension: Propagation Loss2.3.1 Path Loss2.3.2 Shadowing Loss24Contents2.3.3 Multipath Fading26Example 2.1282.3.4 Concluding Remarks292.4 Time Dimension: Multipath Delay Spread302.4.1 Delay Spread30Example 2.231Example 2.3312. 4.2 Coherence bandwidth322.4.3 Implications for OFDM352.5 Frequency Dimension: Doppler Spread362.5.1 Doppler Spread36Example 2. 4372.5.2 Coherence time2.5.3 Implications for OFDM402. 6 Conclusions41References43Selected Bibliography44ChAPTER 3Fundamentals of Digital Communications and Networking453.1 Introduction453.2 Basic Functions of a Transceiver453.3 Channel Coding473.3.1 Linear block codes473.3.2 Convolutional codes493.4 Symbol mapping and modulation3.5 Demodulation563. 5. 1 Matched Filter563.5.2 Symbol Error3.6 Adaptive Modulation and Coding603.7 Cyclic Redundancy Check(CRC)623.8 Automatic Repeat Request(arQ)643.8.1 Stop-and-Wait ARQ643.8.2 Sliding Window arQ653.9 Hybrid ARQ67References69Selected bibliographyCHAPTER 4Fundamentals of ofdm and ofdma: transceiver structure4.1 Basic Transmitter functions714.2 Time domain: guard time4.3 Frequency Domain: Synchronization744.4 Basic receiver functions754.5 Equalization764.6 OFDM Symbol79Contents4.7 OFDMA Transmitter844. 8 OFDMA Receiver4.9 OFDMA4.9.1 Frequency diversity4.9.2 Multiuser diversity914.9.3 Concluding Remarks4.10 Peak-to-Average Power ratio924.11 Conclusions93References94Selected Bibliography95CHAPTER 5Physical Layer: Time and Frequency975.1 Introduction5.2 Distributed Subcarrier Permutation: Forming Subchannels onDownlink5.2.1 Full Usage of Subchannels(FUSC1005.2.2 Partial Usage of Subchannels(PUSC)1015.2.3 Tile Usage of Subchannels 1(TUSC1)1025.2.4 Tile Usage of Subchannels 2(TUSC2)1025.3 Distributed Subcarrier Permutation: Forming Subchannels on Uplink 1025.3.1 Partial Usage of Subchannels(PUSC)1035.3.2 Optional Partial Usage of Subchannels(Optional PUSC)1035.4 Adjacent Subcarrier Permutation: Downlink and Uplink1045.5 Summary of Subcarrier Permutation Modes1045.6 Bursts and Permutation Zones1055.7 Subframes and frames1075.7.1 Preamble1105.7.2 Frame Control Header(FCH)1105.7.3 Downlink MAP (DL-MAP)and Uplink MAP(UL-MAP1115. 8 TDD and FDD5. 9 System Design Issues1125.9.1 Frequency Diversity and multiuser diversity1125.9.2 Segmentation1125. 10 Adaptive burst profiles1155.10.1 Burst Profiles1155.10.2 Channel Quality Feedback116References117ChAPTER 6Physical Layer: Spatial Techniques1196.1 Introduction6.2 Spatial Diversity: Receive Diversity1206.2.1 Receive Diversity: Antenna Selection1226.2.2 Receive Diversity: Maximal Ratio Combining6.3 Spatial Diversity: Transmit Diversity123Contents6.3. 1 Transmit Diversity: Open-Loop 2 X 11246.3.2 Transmit Diversity: Open-Loop 2X 21266.3.3 Transmit Diversity: Closed-Loop Antenna Selection128Example 6.11296.3.4 Transmit Diversity: Closed-Loop precoding1306.3.5 Remarks1326.4 Spatial Multiplexing1336.5 MIMO-OFDM1366.6 Beamforming1366.7 System Design Issues139References140Selected Bibliography141CHAPTER 7Medium Access control: architecture and data plane1437.1 MAC Architecture1437.2 Convergence Sublayer1457. 2.1 Address Mapping( Classification1467. 2.2 Header Suppression1467. 3 Common Part Sublayer1477.3.1ARQ1477. 3.2 MAC SDU and MAc pdu1487.3.3 Fragmentation/Packing1497.4 Security Sublayer152References152chaPTeR 8Medium Access Control Lower Control plane1538. 1 Introduction1538.2 Scheduler1538.3 Bandwidth Request1558.3.1 Request in Existing Uplink Allocation1568.3.2 Unicast Polling1568.3.3 Multicast and Broadcast Polling1578.3.4 Contention-Based Request for OFDMA1578.4 Control Signaling1588.5 Ranging1598.5.1 Initial Ranging1598.5.2 Periodic Ranging1608.5.3 Handover ranging1618.6 Power Control1618.6.1 Uplink Power Control: Closed-Loop1648.6.2 Uplink Power Control: Open-Loop1668.6.3 Assignment of Uplink Modulation and Coding8.6.4 Concluding Remarks168References169ContentsChaPTER 9Medium Access Control: Upper Control plane1719.1 Introduction1719.2 Network Entry1719.2. 1 Synchronization with Downlink of Base Station and acquisitionof parameters1739.2.2 Initial Ranging1739. 2.3 Negotiation of Mobile Capabilities1749.2.4 Security Procedures1749.2.5 Mobile registration1759.2.6 IP Connectivity1759.2.7 Connection Setup1769.3 Mobility Management: Link Handover1769.3.1 Cell Reselection1779.3.2 Hard Handover(HHO1799.3.3 Macro Diversity Handover(MDHO)1849.3.4 Fast Base Station Switching(FBSS1879.3.5 System Design Issue: H Add and h delete1899.3.6 Concluding Remarks1919.4 Mobility management: Network handover192References192CHAPTER 10Quality of Service(Qos)19510.1 Introduction19510.2 Definitions and Fundamental Concepts19510.2.1 Service Flows and Qos Parameters19510.2.2 Connections19610.3 Object Relationship Model19710.4 Service flow transactions19910.4.1 Creating a Service Flow19910.4.2 Changing a Service Flow20010.4.3 Deleting a Service Flow20310.5 QoS Parameters20410.6 Scheduling Services20610.6.1 Unsolicited Grant Service(UGS)20610.6.2 Real-Time Polling Service(rtPS20710.6.3 Extended Real-Time Polling Service(ertPS20710.6.4 Nonreal-Time Polling Service(nrtPS20810.6.5 Best Effort(BE)20810.6.6 Remarks209References210