A programmable digital signal processor (PDSP) is a special-purpose microprocessor with specialized architecture and instruction set for implementing DSP algorithms. Typical architectural features include multiple memory partitions (onchip, off-chip, data memory, program memory, etc.), multiple (generally pipelined) arithmetic and logic units (ALUs), nonuniform register sets, and extensive hardware numeric support [1,2]. Single-chip PDSPs have become increasingly popular for real-time DSP applications [3,4].
標簽： special-purpose microprocessor programmable specialized
上傳時間： 2017-08-13
上傳用戶：腳趾頭
The potential of solving real-time demanding industrial applications, using vision-based algorithms, drastically grew due to an increasing availability of computational power. In this thesis a novel real-time, vision-based Blackjack analysis system is presented. The embedding of the vision algorithms in a compound system of other information sources such as an electronic chip tray, reduces the vision task to detect cards and chips. Robust results are achieved by not just analyzing single frames but an image stream regarding game-ß ow informations. The requirements for such a system are a highly robust and adaptive behav- ior. This is motivated by the vital interest of casino entrepreneurs in a 100 statistical analysis of their offered gambling in order to support the business plan, measuring table and dealer performance and give accurate player rating. Extensive experiments show the robustness and applicability of the proposed system.
標簽： applications vision-based algorithms industrial
上傳時間： 2017-08-20
上傳用戶：liansi
Servlets and JavaServer Pages is the first complete guide to building dynamic Java-based Web applications using the new JavaServer Pages 2.0 and Servlets 2.4. Servlets and JavaServer Pages (JSP) provide a robust solution to developing large, complex Web applications, including multiserver projects. In addition to built-in security, portability, and a Web server, they offer developers the freedom to work with any operating system that supports Javabe it Linux, Windows, OSX, or Solaris. This authoritative book begins by explaining how to set up a Servlet and JSP development environment, including a discussion of containers, Java support, and installing and configuring Tomcat. The authors then thoroughly explore servlets and JSP, including significant coverage of custom tag libraries, newly available filters, and popular servlet and JSP design patterns. Readers can then test-drive the knowledge gained by constructing a book-support Web site.
標簽： JavaServer Java-based Servlets complete
上傳時間： 2014-01-02
上傳用戶：zsjzc
userial is an Free project building an USB to I2C/SPI/GPIO bridge, using the Atmel AT90USB647 chip. Hardware and Software are released under an Open Source licence. It supports the following interfaces: * USB interface (serial emulation) * JTAG * I2C (TWI) * SPI * 8 General purpose digital I/O * 4 Analog to Digital converters (currently no firmware support)
標簽： USB building userial project
上傳時間： 2013-12-25
上傳用戶：小鵬
程序設計導引及在線實踐 本書的最大特點是和“北京大學程序在線評測系統"緊密結合，因而把實踐性擺到了一個特殊的地位。“北京大學程序在線評測系統”（簡稱“POJ”）是一個免費的公益性網上程序設計題庫，網址為http://acm.pku.edu.cn/JudgeOnline，它包含2000多道饒有趣味的程序設計題，題目大部分來自ACM國際大學生程序設計競賽，很多題目就反映工作和生活中的實際問題
上傳時間： 2013-12-13
上傳用戶：Yukiseop
中型通訊視資料applied to SIP, H323, and other agreements soft phone, the single gateway, VoIP billing, to support the then separate billing.
標簽： agreements applied gateway billing
上傳時間： 2013-12-18
上傳用戶：wff
matlab 仿真實例 本書籍版權歸作者所有！請購買紙質書籍支持作者 站內書籍均由網上搜集,為方便網友購買正版之前做參考，若無意中侵犯到您的權利請發郵件至：wing2008@yahoo.cn，我們會及時處理。謝謝!
上傳時間： 2013-12-13
上傳用戶：蟲蟲蟲蟲蟲蟲
If you are a C++ programmer who desires a fuller understanding of what is going on "under the hood," then Inside the C++ Object Model is for you! Inside the C++ Object Model focuses on the underlying mechanisms that support object-oriented programming within C++: constructor semantics, temporary generation, support for encapsulation, inheritance, and "the virtuals"-virtual functions and virtual inheritance. This book shows how your understanding the underlying implementation models can help you code more efficiently and with greater confidence. Lippman dispells the misinformation and myths about the overhead and complexity associated with C++, while pointing out areas in which costs and trade offs, sometimes hidden, do exist. He then explains how the various implementation models arose, points out areas in which they are likely to evolve, and why they are what they are. He covers the semantic implications of the C++ object model and how that model affects your programs.
標簽： understanding programmer desires fuller
上傳時間： 2017-09-25
上傳用戶：gtzj
網點后臺，NetShop網店系統安裝方法 注意： 安裝包僅適用于您的站點沒有安裝過NetShop網店系統的情況下全新安裝，如果您的站點曾經安裝過NetShop網店系統，則不能使用本包進行安裝、升級等操作，否則會清空現有產品使用的的數據庫。 詳細安裝過程如下： 1.解壓程序包內的所有文件，使用FTP工具將./upload目錄中所有文件上傳至服務器； 2.在瀏覽器中訪問：http://您的網址/install/index.aspx； 3.請根據向導，填入必要的信息，開始安裝； 特別注意的是，要根據安裝向導的提示，正確設置各個目錄的讀寫屬性，并保證服務器相關的配置啟用 4.安裝完畢后為了保證數據安全，務必刪除install目錄； 如果您還有安裝問題，請參考NetShop幫助文檔或登錄NetShop官網論壇:http://bbs.netshop.net.cn；
上傳時間： 2014-11-08
上傳用戶：cx111111
兩個鏈表的交集 #include<stdio.h> #include<stdlib.h> typedef struct Node{ int data; struct Node *next; }Node; void initpointer(struct Node *p){ p=NULL; } int printlist(struct Node* head){ int flag=1; head=head->next; /* 因為標記1的地方你用了頭結點，所以第一個數據域無效，應該從下一個頭元結點開始 */ if(head==NULL) printf("NULL\n"); else { while(head!=NULL) { if(flag==1) { printf("%d",head->data); flag=0; } else { printf(" %d",head->data); } head=head->next; } printf("\n"); } return 0; } struct Node *creatlist(struct Node *head) { int n; struct Node *p1=(struct Node *)malloc(sizeof(struct Node)); p1->next=NULL; while(scanf("%d",&n),n!=-1) { struct Node *pnode=(struct Node *)malloc(sizeof(struct Node)); pnode->next=NULL; pnode->data=n; if(head==NULL) head=pnode; p1->next=pnode; p1=pnode; } return head; } struct Node *Intersect(struct Node *head1, struct Node *head2) { struct Node *p1=head1,*p2=head2;/*我這里沒有用頭指針和頭結點，這里是首元結點head1里面就是第一個數據，一定要理解什么事頭指針， 頭結點，和首元結點 具體你一定要看這個博客：http://blog.sina.com.cn/s/blog_71e7e6fb0101lipz.html*/ struct Node *head,*p,*q; head = (struct Node *)malloc(sizeof(struct Node)); head->next = NULL; p = head; while( (p1!=NULL)&&(p2!=NULL) ) { if (p1->data == p2->data) { q = (struct Node *)malloc(sizeof(struct Node)); q->data = p1->data; q->next = NULL; p->next = q;//我可以認為你這里用了頭結點，也就是說第一個數據域無效 **標記1** p = q; p1 = p1->next; p2 = p2->next; } else if (p1->data < p2->data) { p1 = p1->next; } else { p2 = p2->next; } } return head; } int main() { struct Node *head=NULL,*headt=NULL,*t; //initpointer(head);//這里的函數相當于head=NULL; // initpointer(headt);//上面已經寫了headt=NULL那么這里可以不用調用這個函數 head=creatlist(head); headt=creatlist(headt); t=Intersect(head,headt); printlist(t); }
標簽： c語言編程
上傳時間： 2015-04-27
上傳用戶：coco2017co
