BPNet多层网络学习算法可以实现有效的分类，包括完整代码、训练和测试数据集。

鲁棒估计中的Huber估计，C#源码，仅供参考

本程序是根据矩阵的形式实现了一维向量的快速傅里叶变换，程序输入为向量f，输出为其傅里叶变换所得序列F

包含最全的，ansys中所可能用于分析的材料属性和特征。

使用蚁群算法进行智能避障，并且不断比较出路程，然后寻找出最短路径。

这是我写的2011.5数学建模中B题车流量检测的matlab代码，压缩文件里面提供了当时的视频，程序可以直接运行，在车流量不是非常大的情况下统计的还是非常准确，有兴趣的朋友可以看看

让初学web开发人员快速上手项目详细设计文档编写！

Oracle Fusion Middleware Oracle WebLogic Server组件安全漏洞，这个是weblogic12.1.3.0 版本的补丁包，有需要的可以下载

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

【实例简介】线性矩阵不等式（LMI）工具箱是求解一般线性矩阵不等式问题的一个高性能软件包。由于其面向结构的线性矩阵不等式表示方式，使得各种线性矩阵不等式能够以自然块矩阵的形式加以描述。一个线性矩阵不等式问题一旦确定，就可以通过调用适当的线性矩阵不等式求解器来对这个问题进行数值求解。

信息学奥赛的重要资料。对于爱好信息学奥赛的青少年而言，此报告十分难得。Chapter 1Day 11.1 Day 1 rail11.1题目大意有两条平行的单向铁路(上方的从右到左,下方的从左到右),分为m段有η个车站,每个车站为C类型(只能从上往下)或D类型(只能从下往上),分布在某些段中,每个段最多一个车站。已知0号车站是C类型,并给出0号车站的位置,最多可以询问两车站之间的距离3(n-1)次(距离指经过段与段连接处的次数,例如上图0号车站到2号车站的距离为5),要求确定每个车站的位置和类型。保证车站两两可达11.2算法讨论先询问得到0号车站到其他车站的距离,而最近的一个,就是0号车站右侧第一个D类型的(称之为j号车站)然后询问得到号车站到其他车站的距离,其中最近的一个,可能是0号车站,也可能是其他车站(都称之为k号车站),显然和k之间不会冉有其他车IOI2014解题报告Day 1 Wall站,而0和k之间也不会有其他的D类型的车站,所有k号车站到其他车站的距离可直接算出有了和k到其他车站的距离,那就可以轻松分出左右了(离j号近,就在k的左侧,否则在j的右侧)。但分出左右后还是不能确定具体位置,而这时对于每个车站我们还留下次询问的机会。接下来称当前车站为号车站而这次询问一定是留给特殊位置的车站,假设当前车站在左侧,则考虑当前确定的最左侧的车站(称之为L号)。按离(或k)号车站的距离从近到远的顺序处理剩下的车站,那么只有这两和情况:L k j以及(注意下面这种L和之间还会有C类型的车站)L i k两者都会有以下关系式:dst(j,L)+|0s;-pos|=dist(j.)+x(x≥0)第一种情况多出来的是L到它右侧第一个D类型车站的距离×2,而第二种情况多出来的是L到它右侧第一个C类型车站的距离×2。所以,算出x之后,只要到L右侧的c/2的距离处看下车站的类型就可以确定位置了。这样问题就解决了如果当前车站在右侧,那么询问与已确定的最右侧车站的距离,类似讨论即可。1.2 Day 1 Wall21题目大意维护一个长度为的整数序列,一开始每个元素均为0,支持以下两种操作将连续一段中小于k的元素修改为k将连续段中大于k的元素修改为k问所有m个操作进行完之后序列各元素的值。3IOI2014解题报告Day 1 Game1.22算法讨论不难发现对某一个元素的操作是可加的,即说对于某一个元素来说,应用在其上的每一个操作可以都表示为“如果它的初值小于L,那么最终它等于l;如果它的初值大于γ,那么最终它等于η;否则它最终等于初值”这样的形式,并且多个这样的形式是可以合并的。于是我们可以把每个操作都看成一个值,这样原问题就转化成“维护一个序列,每次对一段区间加上一个值,问最后每个元素的值”。这是可以用带标记的线段树直接维护的。该算法的时间复杂度为O(m+ m log n)对于“维护一个序列,每次对一段区间加上一个值,问最后每个元素的值”这个问题,我们也可以使用扫描线进行维护。但本题中的值是不可减也不满足交换律的,因此在扫描过程中我们需要使用一个线段树来维护覆盖到当前点的值并将它们按时间顺序依次求和。该算法的时间复杂度为O(m+ m log m)1.3 Day 1 game131题目大意有一张n个点的无向图,小B每次会询问某两个点之间是否有边相连,小A每次回答yes或no。如果在小B把所有(条边间完之前,小B就能确定这整张图是否联選,小A就输了。现在让你当小A,依次对每个询问回答yes或no求一种获胜方案。1