See Appendix B for a description of the programs included on this companion disk. RESOURCE.WRI identifies other books and resources for Internet programming. WEBHELP.HLP contains an introduction to the World Wide Web. TCPMAN.HLP provides detailed instructions to help you use the Trumpet Winsock included on this disk. Use the Program Manager s File menu Run option to execute the SETUP.EXE program found on this disk. SETUP.EXE will install the programs on your hard drive and create an Internet Programming group window. Internet編程技術(shù) [配套程序] [涉及平臺(tái)] VC [作者] void [文件大小] 1032K
標(biāo)簽： description companion Appendix RESOURCE
上傳時(shí)間： 2013-12-04
上傳用戶：asasasas
經(jīng)典英文原著圖書之a(chǎn) b c’s of science(簡(jiǎn)易科學(xué))，感覺不錯(cuò)，推薦一睹！
上傳時(shí)間： 2014-01-12
上傳用戶：kelimu
The Design and Evolution of C++ 國(guó)外經(jīng)典C++原版書庫(kù)《C++語(yǔ)言的設(shè)計(jì)和演化》/(美)斯特郎斯特魯普(Stroustrup,B)著；裘宗燕等譯 十分經(jīng)典、難得！
標(biāo)簽： Stroustrup Evolution Design The
上傳時(shí)間： 2016-08-17
上傳用戶：chenlong
Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8).
標(biāo)簽： Subsequence sequence Problem Longest
上傳時(shí)間： 2016-12-08
上傳用戶：busterman
數(shù)值分析高斯——列主元消去法主程序 說(shuō)明如下： ％ a----input,matrix of coefficient ％ b----input,right vector ％ sol----output,returns the solution of linear equation
標(biāo)簽： input coefficient matrix vector
上傳時(shí)間： 2017-01-01
上傳用戶：dancnc
A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put a "rubber band" around all the points, and let it wrap as tight as it can. The resultant polygon is a convex hull.
標(biāo)簽： polygon S. the contains
上傳時(shí)間： 2013-12-23
上傳用戶：it男一枚
this is a Implementation of a B* tree,not yet completed, because I need help for this task.
標(biāo)簽： this Implementation completed because
上傳時(shí)間： 2013-11-27
上傳用戶：xinyuzhiqiwuwu
ALGORITHMIC AND MATHEMATICAL PRINCIPLES OF AUTOMATIC NUMBER PLATE RECOGNITION SYSTEMS B.SC.
標(biāo)簽： MATHEMATICAL ALGORITHMIC RECOGNITION PRINCIPLES
上傳時(shí)間： 2017-06-07
上傳用戶：熊少鋒
Matrix operations solution of AX=B Jordan and newton Methods
標(biāo)簽： operations solution Methods Matrix
上傳時(shí)間： 2013-12-01
上傳用戶：小鵬
From the partial fraction expansion of H(z) we can find a, b
標(biāo)簽： expansion fraction partial From
上傳時(shí)間： 2013-12-26
上傳用戶：ainimao
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
