The object detector described below has been initially proposed by P.F. Felzenszwalb in [Felzenszwalb2010]. It is based on a Dalal-Triggs detector that uses a single filter on histogram of oriented gradients (HOG) features to represent an object category. This detector uses a sliding window approach, where a filter is applied at all positions and scales of an image. The first innovation is enriching the Dalal-Triggs model using a star-structured part-based model defined by a “root” filter (analogous to the Dalal-Triggs filter) plus a set of parts filters and associated deformation models. The score of one of star models at a particular position and scale within an image is the score of the root filter at the given location plus the sum over parts of the maximum, over placements of that part, of the part filter score on its location minus a deformation cost easuring the deviation of the part from its ideal location relative to the root. Both root and part filter scores are defined by the dot product between a filter (a set of weights) and a subwindow of a feature pyramid computed from the input image. Another improvement is a representation of the class of models by a mixture of star models. The score of a mixture model at a particular position and scale is the maximum over components, of the score of that component model at the given location.
標簽： 計算機視覺
上傳時間： 2015-03-15
上傳用戶：sb_zhang
Boost C++ Libraries Free peer-reviewed portable C++ source libraries Boost C++ Libraries 基本上是一個免費的 C++ 的跨平臺函式庫集合，基本上應該可以把它視為 C++ STL 的功能再延伸；他最大的特色在於他是一個經過「同行評審」（peer review，可參考維基百科）、開放原始碼的函式庫，而且有許多 Boost 的函式庫是由 C++ 標準委員會的人開發的，同時部分函式庫的功能也已經成為 C++ TR1 (Technical Report 1，參考維基百科)、TR2、或是 C++ 0x 的標準了。 它的官方網站是：http://www.boost.org/，包含了 104 個不同的 library；由於他提供的函式庫非常地多，的內容也非常地多元，根據官方的分類，大致上可以分為下面這二十類： 字串和文字處理（String and text processing） 容器（Containers） Iterators 演算法（Algorithms） Function objects and higher-order programming 泛型（Generic Programming） Template Metaprogramming Preprocessor Metaprogramming Concurrent Programming 數學與數字（Math and numerics） 正確性與測試（Correctness and testing） 資料結構（Data structures） 影像處理（Image processing） 輸入、輸出（Input/Output） Inter-language support 記憶體（Memory） 語法分析（Parsing） 程式介面（Programming Interfaces） 其他雜項 Broken compiler workarounds 其中每一個分類，又都包含了一個或多個函式庫，可以說是功能相當豐富。
上傳時間： 2015-05-15
上傳用戶：fangfeng
VIP+ is support software for YAMAHA RCX series robot controllers. In addition to the functions of the previously released "VIP Windows" software, VIP+ includes an easy-to-use GUI (graphical user interface). VIP+ also allows control by 2 or more controllers or access to a controller from 2 or more clients via Ethernet connection. ● With VIP+ you can: ? Do offline editing of all data used on robot controllers ? Operate and monitor robots connected to robot controllers ? Do online editing of all data used with robot controllers ? Back up and restore robot controller data ● Functions and features newly added to VIP+: ? Ethernet connection to controllers ? Supports data input in spreadsheet software format ? Seamless backup and restoring of controller information such as point data ? Syntax coloring ? Data transfer between the online controller and an offline document by drag & drop ? Executes online commands using a terminal window ? Controller tree and document tree functions similar to Windows Explorer
標簽： 雅馬哈 VIPplus
上傳時間： 2015-11-18
上傳用戶：anncol
這是華為內部的優秀C項目，供大家學習參考。 body {background: #383838 !important;}::-webkit-scrollbar{height:10px !important; width:10px !important; overflow:visible !important;}::-webkit-scrollbar-button{height:0 !important; width:0 !important; display:none !important;}::-webkit-scrollbar-track{box-shadow:none !important;}::-webkit-scrollbar-track:hover{background-color:rgba(56, 56, 56, 0.03) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-track:active{background-color:rgba(56, 56, 56, 0.04) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.14), inset -1px -1px 0 rgba(56, 56, 56, 0.14) !important;}::-webkit-scrollbar-thumb{background-clip:padding-box !important; background-color:rgba(56, 56, 56, 0.2) !important;}::-webkit-scrollbar-thumb:vertical{min-height:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:horizontal{min-width:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:hover{background-color:rgba(56, 56, 56, 0.6) !important; box-shadow:inset 1px 1px 1px rgba(56, 56, 56, 0.25), inset -1px -1px 1px rgba(56, 56, 56, 0.25) !important;}::-webkit-scrollbar-thumb:active{background-color:rgba(56, 56, 56, 0.7) !important; box-shadow:inset 1px 1px 3px rgba(56, 56, 56, 0.35), inset -1px -1px 3px rgba(56, 56, 56, 0.35) !important;}::-webkit-scrollbar-corner{background:trnasparent !important;}html::-webkit-scrollbar,body::-webkit-scrollbar{background: rgba(56, 56, 56, 0.5) !important;}body * {background-color: rgba(56, 56, 56, 0.44) !important;}* {color: #B6AA7B !important;}a:link,a:link *,a:link:hover,a:link:hover *,a:link:active,a:link:active * {color: #B6AA7B !important;}a:visited,a:visited *,a:visited:hover,a:visited:hover *,a:visited:active,a:visited:active * {color: #D9C077 !important;}#_maxthon_night_mode_mask{position:fixed !important; left:0 !important; right:0 !important; top:0 !important; bottom:0 !important;z-index:100 !important; opacity:0.22 !important; background:#383838 !important; pointer-events:none !important;}
標簽： C 代碼
上傳時間： 2015-12-13
上傳用戶：qq253363112
C語言接口與實現，一本過于學術的書 body {background: #383838 !important;}::-webkit-scrollbar{height:10px !important; width:10px !important; overflow:visible !important;}::-webkit-scrollbar-button{height:0 !important; width:0 !important; display:none !important;}::-webkit-scrollbar-track{box-shadow:none !important;}::-webkit-scrollbar-track:hover{background-color:rgba(56, 56, 56, 0.03) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-track:active{background-color:rgba(56, 56, 56, 0.04) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.14), inset -1px -1px 0 rgba(56, 56, 56, 0.14) !important;}::-webkit-scrollbar-thumb{background-clip:padding-box !important; background-color:rgba(56, 56, 56, 0.2) !important;}::-webkit-scrollbar-thumb:vertical{min-height:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:horizontal{min-width:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:hover{background-color:rgba(56, 56, 56, 0.6) !important; box-shadow:inset 1px 1px 1px rgba(56, 56, 56, 0.25), inset -1px -1px 1px rgba(56, 56, 56, 0.25) !important;}::-webkit-scrollbar-thumb:active{background-color:rgba(56, 56, 56, 0.7) !important; box-shadow:inset 1px 1px 3px rgba(56, 56, 56, 0.35), inset -1px -1px 3px rgba(56, 56, 56, 0.35) !important;}::-webkit-scrollbar-corner{background:trnasparent !important;}html::-webkit-scrollbar,body::-webkit-scrollbar{background: rgba(56, 56, 56, 0.5) !important;}body * {background-color: rgba(56, 56, 56, 0.44) !important;}* {color: #B6AA7B !important;}a:link,a:link *,a:link:hover,a:link:hover *,a:link:active,a:link:active * {color: #B6AA7B !important;}a:visited,a:visited *,a:visited:hover,a:visited:hover *,a:visited:active,a:visited:active * {color: #D9C077 !important;}#_maxthon_night_mode_mask{position:fixed !important; left:0 !important; right:0 !important; top:0 !important; bottom:0 !important;z-index:100 !important; opacity:0.22 !important; background:#383838 !important; pointer-events:none !important;}
標簽： c語言 接口與實現
上傳時間： 2015-12-13
上傳用戶：qq253363112
題目描述 蛇行矩陣 Problem 蛇形矩陣是由1開始的自然數依次排列成的一個矩陣上三角形。 輸入 Input 本題有多組數據，每組數據由一個正整數N組成。（N不大于100） 輸出 Output 對于每一組數據，輸出一個N行的蛇形矩陣。兩組輸出之間不要額外的空行。 矩陣三角中同一行的數字用一個空格分開。行尾不要多余的空格。 樣例輸入 5 樣例輸出 1 3 6 10 15 2 5 9 14 4 8 13 7 12 11
上傳時間： 2016-02-29
上傳用戶：lwol2007
Computational models are commonly used in engineering design and scientific discovery activities for simulating complex physical systems in disciplines such as fluid mechanics, structural dynamics, heat transfer, nonlinear structural mechanics, shock physics, and many others. These simulators can be an enormous aid to engineers who want to develop an understanding and/or predictive capability for complex behaviors typically observed in the corresponding physical systems. Simulators often serve as virtual prototypes, where a set of predefined system parameters, such as size or location dimensions and material properties, are adjusted to improve the performance of a system, as defined by one or more system performance objectives. Such optimization or tuning of the virtual prototype requires executing the simulator, evaluating performance objective(s), and adjusting the system parameters in an iterative, automated, and directed way. System performance objectives can be formulated, for example, to minimize weight, cost, or defects; to limit a critical temperature, stress, or vibration response; or to maximize performance, reliability, throughput, agility, or design robustness. In addition, one would often like to design computer experiments, run parameter studies, or perform uncertainty quantification (UQ). These approaches reveal how system performance changes as a design or uncertain input variable changes. Sampling methods are often used in uncertainty quantification to calculate a distribution on system performance measures, and to understand which uncertain inputs contribute most to the variance of the outputs. A primary goal for Dakota development is to provide engineers and other disciplinary scientists with a systematic and rapid means to obtain improved or optimal designs or understand sensitivity or uncertainty using simulationbased models. These capabilities generally lead to improved designs and system performance in earlier design stages, alleviating dependence on physical prototypes and testing, shortening design cycles, and reducing product development costs. In addition to providing this practical environment for answering system performance questions, the Dakota toolkit provides an extensible platform for the research and rapid prototyping of customized methods and meta-algorithms
標簽： Optimization and Uncertainty Quantification
上傳時間： 2016-04-08
上傳用戶：huhu123456
The TAS3204 is a highly-integrated audio system-on-chip (SOC) consisting of a fully-programmable, 48-bit digital audio processor, a 3:1 stereo analog input MUX, four ADCs, four DACs, and other analog functionality. The TAS3204 is programmable with the graphical PurePath Studio? suite of DSP code development software. PurePath Studio is a highly intuitive, drag-and-drop environment that minimizes software development effort while allowing the end user to utilize the power and flexibility of the TAS3204’s digital audio processing core. TAS3204 processing capability includes speaker equalization and crossover, volume/bass/treble control, signal mixing/MUXing/splitting, delay compensation, dynamic range compression, and many other basic audio functions. Audio functions such as matrix decoding, stereo widening, surround sound virtualization and psychoacoustic bass boost are also available with either third-party or TI royalty-free algorithms. The TAS3204 contains a custom-designed, fully-programmable 135-MHz, 48-bit digital audio processor. A 76-bit accumulator ensures that the high precision necessary for quality digital audio is maintained during arithmetic operations. Four differential 102 dB DNR ADCs and four differential 105 dB DNR DACs ensure that high quality audio is maintained through the whole signal chain as well as increasing robustness against noise sources such as TDMA interference. The TAS3204 is composed of eight functional blocks: Clocking System Digital Audio Interface Analog Audio Interface Power supply Clocks, digital PLL I2C control interface 8051 MCUcontroller Audio DSP – digital audio processing 特性 Digital Audio Processor Fully Programmable With the Graphical, Drag-and-Drop PurePath Studio? Software Development Environment 135-MHz Operation 48-Bit Data Path With 76-Bit Accumulator Hardware Single-Cycle Multiplier (28 × 48)
上傳時間： 2016-05-06
上傳用戶：fagong
HTML5 從入門到精通主要講述HTML5 視頻、音樂、canvas、veb存儲、input類型等。
標簽： HTML5
上傳時間： 2016-10-24
上傳用戶：nhwswjsd
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*運動員*/ { char name[20]; int score; /*分數*/ int range; /**/ int item; /*項目*/ }ATH; typedef struct schoolstruct /*學校*/ { int count; /*編號*/ int serial; /**/ int menscore; /*男選手分數*/ int womenscore; /*女選手分數*/ int totalscore; /*總分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n輸入運動項目序號 (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n這個項目已經存在請選擇其他的數字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n項目不存在"); printf("\n請重新輸入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n輸入序號 of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超過學校數目,請重新輸入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->count = pfirst->count + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->count].item = overgame; pfirst->athlete[pfirst->count].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->count].name); } printf("\n繼續輸入運動項目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->count;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d號學校的結果成績:",pfirst->serial); printf("\n\n項目的數目\t學校的名字\t分數"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->count;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 進入下一頁"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n運動會結果:\n\n學校編號\t男運動員成績\t女運動員成績\t總分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建結束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->count = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已經成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 運動會分數統計\n"); printf("輸入學校數目 (x>= 5):"); scanf("%d",&nsc); printf("輸入男選手的項目(x<=20):"); scanf("%d",&msp); printf("輸入女選手項目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
標簽： 源代碼
上傳時間： 2016-12-28
上傳用戶：150501
