亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

preview-samples

  • Welcome to the Microsoft CRM 3.0 Software Development Kit (SDK). This SDK contains a wealth of resou

    Welcome to the Microsoft CRM 3.0 Software Development Kit (SDK). This SDK contains a wealth of resources, including code samples, that are designed to help you build powerful vertical applications using the Microsoft CRM platform. It includes the following sections: 1 Server Programming Guide 2 Client Programming Guide 3 ISV Programming Guide 4 Report Writers Guide 5 Appendix A 6 Glossary –

    標(biāo)簽: Development Microsoft SDK Software

    上傳時(shí)間: 2014-01-20

    上傳用戶:zhichenglu

  • SharpZipLib之前叫做NZipLib

    SharpZipLib之前叫做NZipLib,完全由 C# 開發(fā)的壓縮庫,支持Zip, GZip, Tar and BZip2 ,為2007年8月最新0852release版的源文件和文檔說明! Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels

    標(biāo)簽: SharpZipLib NZipLib

    上傳時(shí)間: 2015-12-11

    上傳用戶:84425894

  • SharpZipLib之前叫做NZipLib

    SharpZipLib之前叫做NZipLib,完全由 C# 開發(fā)的壓縮庫,支持Zip, GZip, Tar and BZip2 ,為2007年8月最新0852release版的代碼實(shí)例! Changes for v0.85.2 release Minor tweaks for CF, ZipEntryFactory and ZipFile. Fix for zip testing and Zip64 local header patching. FastZip revamped to handle file attributes on extract + other fixes Null ref in path filter fixed. Extra data handling fixes Revamped build and conditional compilation handling Many bug fixes for Zip64. Minor improvements to C# samples. ZIP-1341 Non ascii zip password handling fix. ZIP-355 Fix for zip compression problem at low levels

    標(biāo)簽: SharpZipLib NZipLib

    上傳時(shí)間: 2015-12-11

    上傳用戶:love_stanford

  • In addition to all the people who contributed to the first edition, we would like to thank the follo

    In addition to all the people who contributed to the first edition, we would like to thank the following individuals for their generous help in writing this edition. Very special thanks go to Jory Prather for verifying the code samples as well as fixing them for consistency. Thanks to Dave Thaler, Brian Zill, and Rich Draves for clarifying our IPv6 questions, Mohammad Alam and Rajesh Peddibhotla for help with reliable multicasting, and Jeff Venable for his contributions on the Network Location Awareness functionality. Thanks to Vadim Eydelman for his Winsock expertise. And finally we would like to thank the .NET Application Frameworks team (Lance Olson, Mauro Ottaviani, and Ron Alberda) for their help with our questions about .NET Sockets.

    標(biāo)簽: the contributed addition to

    上傳時(shí)間: 2015-12-17

    上傳用戶:dongqiangqiang

  • We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude mo

    We address the problem of blind carrier frequency-offset (CFO) estimation in quadrature amplitude modulation, phase-shift keying, and pulse amplitude modulation communications systems.We study the performance of a standard CFO estimate, which consists of first raising the received signal to the Mth power, where M is an integer depending on the type and size of the symbol constellation, and then applying the nonlinear least squares (NLLS) estimation approach. At low signal-to noise ratio (SNR), the NLLS method fails to provide an accurate CFO estimate because of the presence of outliers. In this letter, we derive an approximate closed-form expression for the outlier probability. This enables us to predict the mean-square error (MSE) on CFO estimation for all SNR values. For a given SNR, the new results also give insight into the minimum number of samples required in the CFO estimation procedure, in order to ensure that the MSE on estimation is not significantly affected by the outliers.

    標(biāo)簽: frequency-offset estimation quadrature amplitude

    上傳時(shí)間: 2014-01-22

    上傳用戶:牛布牛

  • thinkinjava2English Thinking in Java, 2nd Edition, Release 11 To be published by Prentice-Hall mi

    thinkinjava2English Thinking in Java, 2nd Edition, Release 11 To be published by Prentice-Hall mid-June, 2000 Bruce Eckel, President, MindView, Inc. Planet PDF brings you the Portable Document Format (PDF) version of Thinking in Java (2nd Edition). Planet PDF is the premier PDF-related site on the web. There is news, software, white papers, interviews, product reviews, Web links, code samples, a forum, and regular articles by many of the most prominent and respected PDF experts in the world. Visit our sites for more detail: http://www.planetpdf.com/ http://www.codecuts.com/ http://www.pdfforum.com/ http://www.pdfstore.com/

    標(biāo)簽: thinkinjava2English Prentice-Hall published Thinking

    上傳時(shí)間: 2014-01-15

    上傳用戶:ANRAN

  • How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters S

    How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.

    標(biāo)簽: the decision clusters Cluster

    上傳時(shí)間: 2013-12-21

    上傳用戶:gxmm

  • Make a graph from database record and either send it to a printer directly selecting many print op

    Make a graph from database record and either send it to a printer directly selecting many print options or copy it in any file on disc. This project also gives you print preview option for A4 size paper and you can set your graph anywhere on the page.Also if you want to change graph s height or width you can change.Zooming effect is also given using hsrollbar.

    標(biāo)簽: selecting database directly printer

    上傳時(shí)間: 2016-02-06

    上傳用戶:s363994250

  • msdn幫助文檔;由于文件太大

    msdn幫助文檔;由于文件太大,分3大部分傳:MSDN2001 part1 和Samples和MSDN。Samples分兩部分,把Samples兩部分放到一個(gè)目錄Samples下;MSDN又分幾個(gè)部分傳;解壓后放到一個(gè)MSDN目錄下

    標(biāo)簽: msdn 文檔

    上傳時(shí)間: 2016-03-05

    上傳用戶:ardager

  • 高效的k-means算法實(shí)現(xiàn)

    高效的k-means算法實(shí)現(xiàn),使用了k-d樹與局部搜索等提高k-means算法的執(zhí)行效率,同時(shí)包含示例代碼,用c++代碼實(shí)現(xiàn)。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.

    標(biāo)簽: k-means 算法

    上傳時(shí)間: 2016-03-28

    上傳用戶:yulg

主站蜘蛛池模板: 合川市| 万源市| 蚌埠市| 晋中市| 绥宁县| 孝昌县| 顺昌县| 石台县| 璧山县| 永平县| 旌德县| 南开区| 天柱县| 高平市| 枣庄市| 土默特右旗| 巴东县| 广昌县| 大城县| 专栏| 宜良县| 南通市| 乌审旗| 柳江县| 清远市| 兴文县| 灌阳县| 肇东市| 房山区| 宁国市| 商南县| 嵊泗县| 仁化县| 卢湾区| 涿鹿县| 武宣县| 舟山市| 巩义市| 信阳市| 南昌市| 宣武区|