This project solves the purpose of creating vb6 application using oracle database in back end. It shows how to handle the record with the oracle. my other source Codes are at: http://www.developerssourcecode.com Shyam Singh Chandel
標(biāo)簽： application creating database project
上傳時(shí)間： 2013-12-18
上傳用戶(hù)：清風(fēng)冷雨
this is a gcc file, you can download it and learn its usetility, for further detail please look at the source Codes
標(biāo)簽： usetility download further detail
上傳時(shí)間： 2014-11-21
上傳用戶(hù)：ywqaxiwang
Some thesis studies about wireless sensor network algorithms. Algorithms are considered and some pseudo Codes are shown.
標(biāo)簽： Algorithms algorithms considered wireless
上傳時(shí)間： 2013-11-27
上傳用戶(hù)：luopoguixiong
Basicaly,a chatterbot is a computer program that when you provide it with some inputs in Natural Language (English, French ...) responds with something meaningful in that same language. Which means that the strength of a chatterbot could be directly measured by the quality of the output selected by the Bot in response to the user. By the previous description,we could deduce that a very basic chatterbot can be written in a few lines of code in a given specific programming language. Lets make our first chatterbot (notice that all the Codes that will be used in this tutorial will be written in C++. Also, it is assumed that the reader is familiar wih the STL library)
標(biāo)簽： chatterbot Basicaly computer Natural
上傳時(shí)間： 2017-07-30
上傳用戶(hù)：小寶愛(ài)考拉
boost的matlab代碼， Matlab source Codes for the Boosting of the J-DLDA learner(B-JDLDA)
標(biāo)簽： boostcode
上傳時(shí)間： 2015-03-23
上傳用戶(hù)：52086
DATAS SEGMENT w dw 0 keybuf db 255 db 0 db 255 dup(0) ;定義鍵盤(pán)輸入需要的緩沖區(qū) DATAS ENDS STACKS SEGMENT db 200 dup(?) STACKS ENDS Codes SEGMENT ASSUME CS:Codes,DS:DATAS,SS:STACKS START: MOV AX,DATAS MOV DS,AX mov dx,offset keybuf ;用0a號(hào)功能，輸入一個(gè)字符串 mov ah,0ah ;用回車(chē)結(jié)束 int 21h mov dl,0ah ;再進(jìn)行換行，以便在下一行顯示轉(zhuǎn)換后的字符串 mov ah,2 int 21h ; push ax ; push dx ; mov dl,cl ; mov ah,02 ; int 21h ; pop dx ; pop ax mov bx,offset keybuf+1 ;取出字符串的字符個(gè)數(shù)，作為循環(huán)的次數(shù) mov cl,[bx] mov ch,0 mov ax,0 again: inc bx mov ax,[w] push bx mov bx,16 mul bx pop bx ;是小寫(xiě)字母，則轉(zhuǎn)換為大寫(xiě)字母 mov [w],ax mov dl,[bx] ;取出一個(gè)字符， cmp dl,'9' jbe lab1 cmp dl,'F' jbe lab2 sub dl,32 lab2: sub dl ,07h lab1: sub dl,30h add [w],dx loop again mov ax,[w] mov bx,-1 push bx mov bx,10 lab3 :mov dx,0 div bx push dx cmp ax,0 jnz lab3 lab5: pop dx cmp dx,-1 jz lab4 add dl,30h mov ah,02 int 21h jmp lab5 ;循環(huán)，處理完整個(gè)字符串 lab4: MOV AH,4CH INT 21H Codes ENDS END START
標(biāo)簽： 匯編
上傳時(shí)間： 2015-04-02
上傳用戶(hù)：wcc0310
Abstract—In the future communication applications, users may obtain their messages that have different importance levels distributively from several available sources, such as distributed storage or even devices belonging to other users. This scenario is the best modeled by the multilevel diversity coding systems (MDCS). To achieve perfect (information-theoretic) secrecy against wiretap channels, this paper investigates the fundamental limits on the secure rate region of the asymmetric MDCS (AMDCS), which include the symmetric case as a special case. Threshold perfect secrecy is added to the AMDCS model. The eavesdropper may have access to any one but not more than one subset of the channels but know nothing about the sources, as long as the size of the subset is not above the security level. The question of whether superposition (source separation) coding is optimal for such an AMDCS with threshold perfect secrecy is answered. A class of secure AMDCS (S-AMDCS) with an arbitrary number of encoders is solved, and it is shown that linear Codes are optimal for this class of instances. However, in contrast with the secure symmetric MDCS, superposition is shown to be not optimal for S-AMDCS in general. In addition, necessary conditions on the existence of a secrecy key are determined as a design guideline.
標(biāo)簽： Fundamental Limits Secure Class on of
上傳時(shí)間： 2020-01-04
上傳用戶(hù)：kddlas
Multiple-Input Multiple-Output (MIMO) systems have recently been the subject of intensive consideration in modem wireless communications as they offer the potential of providing high capacity, thus unleashing a wide range of applications in the wireless domain. The main feature of MIMO systems is the use of space-time processing and Space-Time Codes (STCs). Among a variety of STCs, orthogonal Space-Time Block Codes (STBCs) have a much simpler decoding method, compared to other STCs
標(biāo)簽： Orthogonal Space-Time Processing Complex
上傳時(shí)間： 2020-05-26
上傳用戶(hù)：shancjb
This book presents, in a unitary and novel perspective, some of the research work the authors have carried out over the last decade, along with several collaborators and students. The roots of this book can be traced back to the design of adaptive sequence detection algorithms for channels with parametric uncertainty. The explosion of turbo Codes and iterative decoding around the middle of the Nineties has motivated the design of iterative (turbo and graph-based) detection algorithms.
標(biāo)簽： Communications Algorithms Detection Wireless for
上傳時(shí)間： 2020-05-27
上傳用戶(hù)：shancjb
5GNR信道編碼研究，信道編碼是 5G 的關(guān)鍵技術(shù)之一，描述了 5G 新空口（NR——New Radio Access）的低密度奇偶校驗(yàn)碼（LDPCC——Low Density Parity Check Codes）和 極化碼（Polar Codes）的關(guān)鍵技術(shù)；通過(guò)仿真，比較了5G NR的信道編碼方案與 4G LTE信道編碼方案的性能。另外，還比較了這2代信道編碼技術(shù)的復(fù)雜度和 吞吐量。
標(biāo)簽： 信道編碼
上傳時(shí)間： 2022-06-30
上傳用戶(hù)：
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
