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

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

S<b>Part</b>an

  • The Kannel Open Source WAP and SMS gateway works as both an SMS gateway, for implementing keyword b

    The Kannel Open Source WAP and SMS gateway works as both an SMS gateway, for implementing keyword based services via GSM text messages, and a WAP gateway, via UDP. The SMS part is fairly mature, the WAP part is early in its development. In this release, the GET request for WML pages and WMLScript files via HTTP works, including compilation for WML and WMLScript to binary forms. Only the data call bearer (UDP) is supported, not SMS.

    標(biāo)簽: gateway implementing SMS keyword

    上傳時間: 2014-01-11

    上傳用戶:2525775

  • 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an

    加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds]

    標(biāo)簽: Cryptographic Primitives generate Library

    上傳時間: 2015-07-16

    上傳用戶:wqxstar

  • This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYS

    This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.

    標(biāo)簽: project implement developed Database

    上傳時間: 2013-12-25

    上傳用戶:semi1981

  • Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A c

    Verilog HDL: Magnitude For a vector (a,b), the magnitude representation is the following: A common approach to implementing these arithmetic functions is to use the Coordinate Rotation Digital Computer (CORDIC) algorithm. The CORDIC algorithm calculates the trigonometric functions of sine, cosine, magnitude, and phase using an iterative process. It is made up of a series of micro-rotations of the vector by a set of predetermined constants, which are powers of two. Using binary arithmetic, this algorithm essentially replaces multipliers with shift and add operations. In a Stratix™ device, it is possible to calculate some of these arithmetic functions directly, without having to implement the CORDIC algorithm.

    標(biāo)簽: representation Magnitude the magnitude

    上傳時間: 2013-12-24

    上傳用戶:金宜

  • About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses

    About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl

    標(biāo)簽: C. hamsterdb structure database

    上傳時間: 2013-12-11

    上傳用戶:LouieWu

  • ITU-T G.729語音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding

    ITU-T G.729語音壓縮算法。 description: Fixed-point description of commendation G.729 with ANNEX B Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic-Code-Excited Linear-Prediction (CS-ACELP) with Voice Activity Decision(VAD), Discontinuous Transmission(DTX), and Comfort Noise Generation(CNG).

    標(biāo)簽: description commendation Fixed-point 729

    上傳時間: 2014-11-23

    上傳用戶:thesk123

  • 本書提供用J B u i l d e r開發(fā)數(shù)據(jù)庫應(yīng)用程序、創(chuàng)建分布式應(yīng)用程序以及編寫J a v a B e a n 組件的高級資料。它包括下列幾個部分: • 第一部分是“開發(fā)數(shù)據(jù)庫應(yīng)用

    本書提供用J B u i l d e r開發(fā)數(shù)據(jù)庫應(yīng)用程序、創(chuàng)建分布式應(yīng)用程序以及編寫J a v a B e a n 組件的高級資料。它包括下列幾個部分: • 第一部分是“開發(fā)數(shù)據(jù)庫應(yīng)用程序”,它提供關(guān)于使用J b u i l d e r的D a t a E x p r e s s數(shù)據(jù) 庫體系結(jié)構(gòu)的信息,并解釋原始數(shù)據(jù)組件和類之間的相互關(guān)系,以及怎樣使用它 們來創(chuàng)建你的數(shù)據(jù)庫應(yīng)用程序。它還解釋怎樣使用Data Modeler(數(shù)據(jù)模型器)和 Application Generator(應(yīng)用程序生成器)創(chuàng)建數(shù)據(jù)驅(qū)動的客戶機(jī)/服務(wù)器應(yīng)用程 序。 • 第二部分是“開發(fā)分布式應(yīng)用程序”,它提供關(guān)于使用ORB Explorer、用J B u i l d e r 創(chuàng)建多級的分布應(yīng)用程序、調(diào)試分布式應(yīng)用程序、用J a v a定義C O R B A接口以及 使用s e r v l e t等的信息。 • 第三部分是“創(chuàng)建J a v a B e a n”,它解釋怎樣開發(fā)新的J a v a B e a n組件,描述在組件 開發(fā)中涉及的任務(wù), 怎樣使用B e a n s E x p r e s s創(chuàng)建新的J a v a B e a n,以及關(guān)于屬性、 事件、B e a nIn f o類和其他方面的詳細(xì)情況。

    標(biāo)簽: 8226 數(shù)據(jù)庫 應(yīng)用程序

    上傳時間: 2014-01-03

    上傳用戶:wpt

  • 實現(xiàn)最優(yōu)二叉樹的構(gòu)造;在此基礎(chǔ)上完成哈夫曼編碼器與譯碼器。 假設(shè)報文中只會出現(xiàn)如下表所示的字符: 字符 A B C D E F G H I J K L M N 頻度 186 64 13 22

    實現(xiàn)最優(yōu)二叉樹的構(gòu)造;在此基礎(chǔ)上完成哈夫曼編碼器與譯碼器。 假設(shè)報文中只會出現(xiàn)如下表所示的字符: 字符 A B C D E F G H I J K L M N 頻度 186 64 13 22 32 103 21 15 47 57 1 5 32 20 57 字符 O P Q R S T U V W X Y Z , . 頻度 63 15 1 48 51 80 23 8 18 1 16 1 6 2 要求完成的系統(tǒng)應(yīng)具備如下的功能: 1.初始化。從終端(文件)讀入字符集的數(shù)據(jù)信息,。建立哈夫曼樹。 2.編碼:利用已建好的哈夫曼樹對明文文件進(jìn)行編碼,并存入目標(biāo)文件(哈夫曼碼文件)。 3.譯碼:利用已建好的哈夫曼樹對目標(biāo)文件(哈夫曼碼文件)進(jìn)行編碼,并存入指定的明文文件。 4.輸出哈夫曼編碼文件:輸出每一個字符的哈夫曼編碼。

    標(biāo)簽: 186 字符 13 64

    上傳時間: 2014-11-23

    上傳用戶:shanml

  • 簡易數(shù)字頻率計題解.( 1997年 B 題 ) 編寫與講解人:田良(東南大學(xué)無線電系,2003年3月12日) 一)任務(wù) 設(shè)計并制作一臺數(shù)字顯示的簡易頻率計。 (二)要求 1.基本要求

    簡易數(shù)字頻率計題解.( 1997年 B 題 ) 編寫與講解人:田良(東南大學(xué)無線電系,2003年3月12日) 一)任務(wù) 設(shè)計并制作一臺數(shù)字顯示的簡易頻率計。 (二)要求 1.基本要求 (1)頻率測量 a.測量范圍 信號:方波、正弦波 幅度:0.5V~5V[注] 頻率:1Hz~1MHz b.測試誤差≤0.1% (2)周期測量 a.測量范圍 信號:方波、正弦波 幅度:0.5V~5V[注] 頻率:1Hz~1MHz b.測試誤差≤0.1% 3) 脈沖寬度測量 a.測量范圍 信號:脈沖波 幅度:0.5V~5V[注] 脈沖寬度≥100μs b.測試誤差≤0.1% (4)顯示器 十進(jìn)制數(shù)字顯示,顯示刷新時間1~10秒 連續(xù)可調(diào),對上述三種測量功能分別采用不同顏色的 發(fā)光二極管指示。 (5)具有自校功能,時標(biāo)信號頻率為1MHz。 (6)自行設(shè)計并制作滿足本設(shè)計任務(wù)要求的穩(wěn)壓電源

    標(biāo)簽: 1997 2003 數(shù)字頻率計 東南大學(xué)

    上傳時間: 2013-12-26

    上傳用戶:xg262122

  • %調(diào)用格式 =trapez_g( f_name ,a,b,n) %f_name: 被積函數(shù)的文件名f(x) % a:x的上限 % b:x的下限 % 部分區(qū)間數(shù) %實例:trapez_g( s

    %調(diào)用格式 =trapez_g( f_name ,a,b,n) %f_name: 被積函數(shù)的文件名f(x) % a:x的上限 % b:x的下限 % 部分區(qū)間數(shù) %實例:trapez_g( sin ,0,pi,20)

    標(biāo)簽: trapez_g f_name 函數(shù) 上限

    上傳時間: 2013-12-19

    上傳用戶:cjl42111

主站蜘蛛池模板: 射阳县| 宜良县| 宜昌市| 井冈山市| 石河子市| 富源县| 双鸭山市| 阜南县| 泗洪县| 沅陵县| 义乌市| 江孜县| 应城市| 阳江市| 白朗县| 惠东县| 富裕县| 巩留县| 麟游县| 隆子县| 扎赉特旗| 米易县| 平和县| 巨野县| 凤山县| 曲周县| 明水县| 小金县| 泾源县| 颍上县| 漠河县| 吉首市| 南木林县| 宁波市| 平乐县| 景东| 庆城县| 廊坊市| 咸宁市| 南靖县| 大厂|