Developers use algorithms and data structures every day of their working lives. Having a good under-standing of these algorithms and knowledge of when to apply them is essential to producing softwarethat not only works correctly, but also performs efficiently. This book aims to explain those algorithms and data structures most commonly encountered in day-to-day software development, while remaining at all times practical, concise, and to the point, with little orno verbiage to distract from the core concepts and examples.
標(biāo)簽： Developers algorithms structures working
上傳時(shí)間： 2015-11-03
上傳用戶(hù)：wyc199288
This paper presents an interactive technique that produces static hairstyles by generating individual hair strands of the desired shape and color, subject to the presence of gravity and collisions. A variety of hairstyles can be generated by adjusting the wisp parameters, while the deformation is solved efficiently, accounting for the effects of gravity and collisions. Wisps are generated employing statistical approaches. As for hair deformation, we propose a method which is based on physical simulation concepts but is simplified to efficiently solve the static shape of hair. On top of the statistical wisp model and the deformation solver, a constraint-based styler is proposed to model artificial features that oppose the natural flow of hair under gravity and hair elasticity, such as a hairpin. Our technique spans a wider range of human hairstyles than previously proposed methods, and the styles generated by this technique are fairly realistic.
標(biāo)簽： interactive hairstyles generating technique
上傳時(shí)間： 2013-12-20
上傳用戶(hù)：sssl
本書(shū)由知名的C++專(zhuān)家Matthew H．Austern執(zhí)筆，引導(dǎo)你進(jìn)入泛型編程思維模型，并將你帶往此一模型的最重要成品：C++ Standard Template Library(STL)。本書(shū)揭示STL的奧秘，告訴你STL不僅僅是一組方便運(yùn)用的容器類(lèi)(container classes)。對(duì)于泛型組件和可交互作用的組件而言，STL是一個(gè)具備擴(kuò)充能力的框架(framework)、 《泛型編程與STL》闡述了泛型編程的中心思想：concepts、modeling、refinement，并為你展示這些思想如何導(dǎo)出STL的基礎(chǔ)概念：iterators、containers、function objects。循此路線(xiàn)，你可以把STL想像為一個(gè)由concepts(而非明確之functions或classes)組成的程序庫(kù)：、你將學(xué)習(xí)其正式結(jié)構(gòu)并因此獲得其潛在威力所帶來(lái)的完整優(yōu)勢(shì)。本書(shū)使你能夠： ●以你自己的“可移植組件”及“可交互作用之泛型組件”擴(kuò)充STL； ●產(chǎn)生一些算法，讓它們和它們所處理之型別(types)及數(shù)據(jù)結(jié)構(gòu)徹底劃清界線(xiàn)； ●撰寫(xiě)更精致、更高效、更有效力的代碼，可跨平臺(tái)重復(fù)使用。
上傳時(shí)間： 2014-01-06
上傳用戶(hù)：Avoid98
if—else語(yǔ)句，switch語(yǔ)句，循環(huán)結(jié)構(gòu)，do-while語(yǔ)句，for語(yǔ)句， 跳轉(zhuǎn)語(yǔ)句
標(biāo)簽： else
上傳時(shí)間： 2014-01-22
上傳用戶(hù)：zsjzc
數(shù)值計(jì)算方法在C語(yǔ)言中的應(yīng)用 介紹了數(shù)值計(jì)算方法與計(jì)算機(jī)程序語(yǔ)言相結(jié)合的重要性，在給出牛頓迭代公式之后，闡述了牛頓迭代法在do-while循環(huán)中的應(yīng)用，然后通過(guò)實(shí)例基于曲線(xiàn)梯形面積求解方法，論述了矩形法和梯形法在for循環(huán)中的應(yīng)用．最后指出：用正確的數(shù)值計(jì)算方法編寫(xiě)高效的計(jì)算機(jī)程序解決復(fù)雜的實(shí)際問(wèn)題應(yīng)成為當(dāng)代理工科大學(xué)生必備的基礎(chǔ)與技能
標(biāo)簽： 數(shù)值 計(jì)算方法 C語(yǔ)言 中的應(yīng)用
上傳時(shí)間： 2013-12-28
上傳用戶(hù)：qoovoop
#include<iostream> using namespace std int main() { unsigned long x,warcraft,war,l cin> x while(x) { unsigned long *p=new unsigned long[x+1] if(p==NULL) { cerr<<"error!"<<endl abort() } for(warcraft=0 warcraft<=x warcraft++) *(p+warcraft)=0 *p=1 for(warcraft=0 warcraft<x warcraft++) { cout<<*p<<" " war=*p for(l=1 x>1 l++) { if(*(p+l)==0) { cout<<endl *(p+l)=1 break } else { cout<<*(p+l)<<" " *(p+l)=war+*(p+l) war=*(p+l)-war } } } cout<<endl delete [] p cin>>x } return 0 }
標(biāo)簽： namespace iostream unsigned warcraft
上傳時(shí)間： 2015-12-12
上傳用戶(hù)：manlian
hardware文件代碼，在小車(chē)循跡程序中有著重要應(yīng)用！
上傳時(shí)間： 2015-12-18
上傳用戶(hù)：1101055045
resource文件代碼，在小車(chē)循跡程序中有著重要應(yīng)用！
上傳時(shí)間： 2014-01-04
上傳用戶(hù)：bjgaofei
Rao-Blackwellised Particle Filters (RBPFs) are a class of Particle Filters (PFs) that exploit conditional dependencies between parts of the state to estimate. By doing so, RBPFs can improve the estimation quality while also reducing the overall computational load in comparison to original PFs. However, the computational complexity is still too high for many real-time applications. In this paper, we propose a modified RBPF that requires a single Kalman Filter (KF) iteration per input sample. Comparative experiments show that while good convergence can still be obtained, computational efficiency is always drastically increased, making this algorithm an option to consider for real-time implementations.
標(biāo)簽： Particle Filters Rao-Blackwellised exploit
上傳時(shí)間： 2016-01-02
上傳用戶(hù)：refent
2.0.12 (May 13th, 2004) - Flag driver threads with PF_FREEZE to support software suspend. 2.0.11 (May 7th, 2004) - Avoid split-completion bugs in certain PCI-X chipsets by breaking up large completion entry DMAs on ADB boundaries. 2.0.10 (April 9th, 2004) - Return "command timeout" status instead of "selection timeout status" to the SCSI mid-layer in response to selection timeouts. While the latter may seem more correct, the mid-layer will not offline devices suffering from persistent selection timeouts. This leads to extremely long recovery times for devices that go missing. Returning command timeout status causes the mid-layer to enter recovery and eventually offline persistently missing devices.
標(biāo)簽： PF_FREEZE software support suspend
上傳時(shí)間： 2016-01-05
上傳用戶(hù)：亞亞娟娟123
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
