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

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

recursive-Least-Squares

  • The BeeStack Application Development Guide describes how to develop an application for BeeStack, in

    The BeeStack Application Development Guide describes how to develop an application for BeeStack, including discussions on major considerations for commercial applications. This document is intended for software developers who write applications for BeeStack-based products using Freescale development tools. It is assumed the reader is a programmer with at least rudimentary skills in the C programming language and that the reader is already familiar with the edit/compile/debug process.

    標簽: BeeStack Application Development application

    上傳時間: 2016-04-17

    上傳用戶:lijianyu172

  • KMEANS Trains a k means cluster model.CENTRES = KMEANS(CENTRES, DATA, OPTIONS) uses the batch K-mean

    KMEANS Trains a k means cluster model.CENTRES = KMEANS(CENTRES, DATA, OPTIONS) uses the batch K-means algorithm to set the centres of a cluster model. The matrix DATA represents the data which is being clustered, with each row corresponding to a vector. The sum of squares error function is used. The point at which a local minimum is achieved is returned as CENTRES.

    標簽: CENTRES KMEANS OPTIONS cluster

    上傳時間: 2014-01-07

    上傳用戶:zhouli

  • aiNet application is a very powerful and a very simple tool for solving the problems which are usual

    aiNet application is a very powerful and a very simple tool for solving the problems which are usually solved with artificial neural networks (ANN). All possible tests we had run proved that the results obtained with aiNet are at least as good as the results obtained with some other ANNs. Let us state some of aiNet抯 features. (c) aiNet 1995-1997

    標簽: very application powerful problems

    上傳時間: 2014-01-16

    上傳用戶:wang5829

  • This book is for the experience and not the same level of the design process so prepared by the staf

    This book is for the experience and not the same level of the design process so prepared by the staff, of course, the reader should at least be able to prepare a simple C language program. On the C language are learning readers, this book is any C language tutorial excellent supporting materials, to be able to answer all relevant questions.

    標簽: the experience prepared process

    上傳時間: 2013-12-20

    上傳用戶:jcljkh

  • GloptiPoly 3: moments, optimization and semidefinite programming. Gloptipoly 3 is intended to so

    GloptiPoly 3: moments, optimization and semidefinite programming. Gloptipoly 3 is intended to solve, or at least approximate, the Generalized Problem of Moments (GPM), an infinite-dimensional optimization problem which can be viewed as an extension of the classical problem of moments [8]. From a theoretical viewpoint, the GPM has developments and impact in various areas of mathematics such as algebra, Fourier analysis, functional analysis, operator theory, probability and statistics, to cite a few. In addition, and despite a rather simple and short formulation, the GPM has a large number of important applications in various fields such as optimization, probability, finance, control, signal processing, chemistry, cristallography, tomography, etc. For an account of various methodologies as well as some of potential applications, the interested reader is referred to [1, 2] and the nice collection of papers [5].

    標簽: optimization semidefinite programming GloptiPoly

    上傳時間: 2016-06-05

    上傳用戶:lgnf

  • 迭代自適應Simpson

    迭代自適應Simpson,Lobatto積分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.

    標簽: Simpson 迭代

    上傳時間: 2014-10-25

    上傳用戶:xc216

  • ClustanGraphics聚類分析工具。提供了11種聚類算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Li

    ClustanGraphics聚類分析工具。提供了11種聚類算法。 Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean Proximity Centroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of Squares Flexible (ß space distortion parameter) Density (or k-linkage, density-seeking mode analysis)

    標簽: ClustanGraphics Complete Neighbor Linkage

    上傳時間: 2014-01-02

    上傳用戶:003030

  • Jvm 規范說明。The Java Virtual Machine was designed to support the Java programming language. Some concep

    Jvm 規范說明。The Java Virtual Machine was designed to support the Java programming language. Some concepts and vocabulary from the Java language are thus necessary to understand the virtual machine. This chapter gives enough of an overview of Java to support the discussion of the Java Virtual Machine to follow. Its material has been condensed from The Java Language Specification, by James Gosling, Bill Joy, and Guy Steele. For a complete discussion of the Java language, or for details and examples of the material in this chapter, refer to that book. Readers familiar with that book may wish to skip this chapter. Readers familiar with Java, but not with The Java Language Specification, should at least skim this chapter for the terminology it introduces.

    標簽: Java programming designed language

    上傳時間: 2013-12-19

    上傳用戶:wangyi39

  • After the successful global introduction during the past decade of the second generation (2G) digita

    After the successful global introduction during the past decade of the second generation (2G) digital mobile communications systems, it seems that the third generation (3G) Universal Mobile Communication System (UMTS) has finally taken off, at least in some regions. The plethora of new services that are expected to be offered by this system requires the development of new paradigms in the way scarce radio resources should be managed. The Quality of Service (QoS) concept, which introduces in a natural way the service differentiation and the possibility of adapting the resource consumption to the specific service requirements, will open the door for the provision of advanced wireless services to the mass market.

    標簽: the introduction successful generation

    上傳時間: 2013-12-30

    上傳用戶:qq21508895

  • ST uPSD32XX I2C This example demo code is provided as is and has no warranty, implied or otherwise.

    ST uPSD32XX I2C This example demo code is provided as is and has no warranty, implied or otherwise. You are free to use/modify any of the provided code at your own risk in your applications with the expressed limitation of liability (see below) so long as your product using the code contains at least one uPSD products (device)

    標簽: otherwise provided warranty example

    上傳時間: 2013-12-07

    上傳用戶:標點符號

主站蜘蛛池模板: 阿坝| 陆川县| 海淀区| 云南省| 天长市| 泰安市| 通城县| 青冈县| 淮南市| 城市| 惠水县| 六盘水市| 潞西市| 柳州市| 赤城县| 鹤峰县| 上犹县| 油尖旺区| 万年县| 革吉县| 东乡| 库尔勒市| 黑山县| 淮北市| 治多县| 乌鲁木齐市| 新安县| 拉萨市| 通辽市| 夹江县| 涡阳县| 天镇县| 开鲁县| 大理市| 枣庄市| 澄江县| 和顺县| 深圳市| 临泽县| 象山县| 民权县|