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

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

space-vector

  • oracle中常用函數說明. SQL中的單記錄函數 1.ASCII 返回與指定的字符對應的十進制數 SQL> select ascii( A ) A,ascii( a ) a,

    oracle中常用函數說明. SQL中的單記錄函數 1.ASCII 返回與指定的字符對應的十進制數 SQL> select ascii( A ) A,ascii( a ) a,ascii( 0 ) zero,ascii( ) space from dual A A ZERO SPACE --------- --------- --------- --------- 65 97 48 32 2.CHR 給出整數,返回對應的字符 SQL> select chr(54740) zhao,chr(65) chr65 from dual ZH C -- - 趙 A 3.CONCAT 連接兩個字符串 SQL> select concat( 010- , 88888888 )|| 轉23 高乾競電話 from dual 高乾競電話 ---------------- 010-88888888轉23

    標簽: ascii SQL oracle select

    上傳時間: 2014-11-23

    上傳用戶:zhangyigenius

  • FLASH+SwiftMP3波形同步播放器模型 功能說明:FLASH+SwiftMP3波形同步的原理其實很簡單

    FLASH+SwiftMP3波形同步播放器模型 功能說明:FLASH+SwiftMP3波形同步的原理其實很簡單,SwiftMP3把MP3轉換成SWF的時候,把mp3中的音頻數據以變量s0、s1、s2、s3、……、s17共18個變量儲存,然后我們就可以根據這些變量的值即時設置波譜柱的高度了。注意我只是提供一個模型,解決了主要的技術內核,但這個播放器離實際應用還有一段距離,需要你自己去完善。 使用方法: 1,用SwiftMP3轉換音樂后,請在flash_boXing.xml文件中修改你的音樂名字和路徑,我設置最多為三條音樂,當然,相信聰明的你有了源文件,一定能自己隨便改:)。 2,“SwiftMP3-1.0”文件夾中是用來轉換MP3音樂的工具,你必須注冊,不然每次只能轉換一小段。 特別鳴謝sxl001 ,參考教程:http://space.flash8.net/bbs/thread-307160-1-1.html

    標簽: SwiftMP FLASH 波形 同步播放

    上傳時間: 2013-12-09

    上傳用戶:璇珠官人

  • Specification File adjacencyListGragh class GeneralGraph: use adjacency list to implement the gr

    Specification File adjacencyListGragh class GeneralGraph: use adjacency list to implement the graph which data structure is vector Construct methods: * public GeneralGraph(): contain an empty vector store the vertex and a boolean determines whether graph is directed or not, defaulted is undirected

    標簽: adjacencyListGragh Specification GeneralGraph adjacency

    上傳時間: 2013-12-13

    上傳用戶:lyy1234

  • 傳遞多種物品

    傳遞多種物品,并計數和單位 用vector進行保存 實現購物車的功能

    標簽:

    上傳時間: 2014-01-14

    上傳用戶:chenbhdt

  • 使用遞歸實現N重循環

    使用遞歸實現N重循環,這里的N是不確定的。此代碼實現的功能描述如下: 1. 有一個字符串的矩陣,用vector< vector< CStirng > > 表示 2. 行與行之間進行排列組合 3. 輸出所有組合的字符串

    標簽: 遞歸 循環

    上傳時間: 2014-01-02

    上傳用戶:coeus

  • Sensing and planning are at the core of robot motion. Traditionally, mobile robots have been used f

    Sensing and planning are at the core of robot motion. Traditionally, mobile robots have been used for performing various tasks with a general-purpose processor on-board. This book grew out of our research enquiry into alternate architectures for sensor-based robot motion. It describes our research starting early 2002 with the objectives of obtaining a time, space and energy-efficient solution for processing sensor data for various robotic tasks. New algorithms and architectures have been developed for exploration and other aspects of robot motion. The research has also resulted in design and fabrication of an FPGA-based mobile robot equipped with ultrasonic sensors. Numerous experiments with the FPGA-based mobile robot have also been performed and they confirm the efficacy of the alternate architecture.

    標簽: Traditionally planning Sensing motion

    上傳時間: 2013-12-20

    上傳用戶:古谷仁美

  • This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3

    This code proposes genetic algorithm (GA) to optimize the point-to-point trajectory planning for a 3-link robot arm. The objective function for the proposed GA is to minimizing traveling time and space, while not exceeding a maximum pre-defined torque, without collision with any obstacle in the robot workspace.

    標簽: point-to-point trajectory algorithm proposes

    上傳時間: 2013-12-21

    上傳用戶:chenxichenyue

  • SVDD的工具箱

    SVDD的工具箱,可以很好的處理一類分類問題,詳見Support Vector Data Description一文

    標簽: SVDD 工具箱

    上傳時間: 2014-03-01

    上傳用戶:songrui

  • DEV C++ 寫的一個矩陣類

    DEV C++ 寫的一個矩陣類,用列主元消去法求模的。類的構造函數接收矩陣的行列值或者是一個vector<vector<double> >類型的變量。沒有用模板,數據類型是double.

    標簽: DEV 矩陣

    上傳時間: 2017-06-14

    上傳用戶:lht618

  • The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT alg

    The code performs a number (ITERS) of iterations of the Bailey s 6-step FFT algorithm (following the ideas in the CMU Task parallel suite). 1.- Generates an input signal vector (dgen) with size n=n1xn2 stored in row major order In this code the size of the input signal is NN=NxN (n=NN, n1=n2=N) 2.- Transpose (tpose) A to have it stored in column major order 3.- Perform independent FFTs on the rows (cffts) 4.- Scale each element of the resulting array by a factor of w[n]**(p*q) 5.- Transpose (tpose) to prepair it for the next step 6.- Perform independent FFTs on the rows (cffts) 7.- Transpose the resulting matrix The code requires nested Parallelism.

    標簽: iterations performs Bailey number

    上傳時間: 2014-01-05

    上傳用戶:libenshu01

主站蜘蛛池模板: 马边| 望城县| 凉山| 饶河县| 贵港市| 大同县| 洞头县| 青川县| 朝阳市| 弥勒县| 桂阳县| 宕昌县| 佛冈县| 芜湖县| 九江市| 娄烦县| 额尔古纳市| 绥化市| 霍山县| 元朗区| 垫江县| 浮梁县| 阳谷县| 永新县| 嘉兴市| 庐江县| 竹北市| 昔阳县| 奉贤区| 阿拉善右旗| 房产| 克拉玛依市| 五峰| 大丰市| 绥江县| 冷水江市| 金平| 宁陵县| 梁平县| 辽宁省| 交口县|