Contents at a Glance Introduction 1 PART I INSTALLATION AND CONFIGURATION 5 Hour 1 Preparing to Install Linux 7 2 Installing Linux 23 3 Post-Installation Issues 41 PART II LEARNING LINUX BASICS 67 Hour 4 Reading and Navigation Commands 69 5 Manipulation and SEARCHing Commands 93 6 Using the Shell 117 7 Using the X Window System 143 8 Exploring the K Desktop Environment 177 PART III CONNECTING TO THE OUTSIDE WORLD 197 Hour 9 Using Communications Programs 199 10 Connecting to the Internet 223 11 Configuring Internet Email 249 12 Configuring Internet News 269 13 Internet Downloading and Browsing 289
標簽： CONFIGURATION Introduction INSTALLATION Preparing
上傳時間： 2013-12-27
上傳用戶：qiao8960
This sample provides an implementation of simple Bluetooth device discovery via the Winsock 2 API. It provides a listbox control which, when SEARCHing is complete, lists the discovered Bluetooth devices. Only names of the devices are displayed, but the addresses of the devices are also retrieved, and can be used to query the devices for more information (not implemented)
標簽： implementation Bluetooth discovery provides
上傳時間： 2014-10-31
上傳用戶：hewenzhi
Input : A set S of planar points Output : A convex hull for S Step 1: If S contains no more than five points, use exhaustive SEARCHing to find the convex hull and return. Step 2: Find a median line perpendicular to the X-axis which divides S into SL and SR SL lies to the left of SR . Step 3: Recursively construct convex hulls for SL and SR. Denote these convex hulls by Hull(SL) and Hull(SR) respectively. Step 4: Apply the merging procedure to merge Hull(SL) and Hull(SR) together to form a convex hull. Time complexity: T(n) = 2T(n/2) + O(n) = O(n log n)
標簽： contains Output convex planar
上傳時間： 2017-02-19
上傳用戶：wyc199288
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for SEARCHing. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
標簽： implementation double-array representing structure
上傳時間： 2013-12-10
上傳用戶：shinesyh
I was trying to develope a programme to make a slide show of all the pictures of a folder using vb.net. I have spent lot of time in net for SEARCHing this but all in vain, I didn t get a simple programme to solve the same and lastly I gave myself a try for the same and developed the code, I have used there a folderbrowserdialogue and a timer with a picture box control and in coding I have used IO name spaces to get the pathe and folder info here is the code. Enjoy Subhankar
標簽： programme develope pictures trying
上傳時間： 2017-04-24
上傳用戶：a3318966
Traveling Salesperson Problem Our branch-and-strategy splits a branch and bound solution into two groups: one group including a particular arc and the other excluding this arc. 1.Each splitting incurs a lower bound and we shall traverse the SEARCHing tree with the "lower" lower bound. 2.If a constant subtracted from any row or any column of the cost matrix, an optimal solution does not change.
標簽： branch-and-strategy Salesperson Traveling solution
上傳時間： 2013-12-29
上傳用戶：璇珠官人
I upload Suffix Array Pdf file. This is a really good tutorial for guys who are curious about suffix array. It described the meaning of suffix array and also how to built it. Hope this really help guys improving skills about string SEARCHing, string matching, etc
標簽： tutorial curious upload Suffix
上傳時間： 2013-12-11
上傳用戶：清風冷雨
Datastructure: Linked Lists Stack and Queue Multi-lists Linked Structures Trees Binary Tree SEARCHing and Sorting AVL Tree Red-Black Tree
標簽： Linked Datastructure Multi-lists Structures
上傳時間： 2014-05-31
上傳用戶：xmsmh
Like many of my colleagues in this industry, I learned Windows programming from Charles Petzold s Programming Windows—a classic programming text that is the bible to an entire generation of Windows programmers. When I set out to become an MFC programmer in 1994, I went shopping for an MFC equivalent to Programming Windows. After SEARCHing in vain for such a book and spending a year learning MFC the old-fashioned way, I decided to write one myself. It s the book you hold in your hands. And it s the book I would like to have had when I was learning to program Windows the MFC way.
標簽： programming colleagues industry Charles
上傳時間： 2014-01-10
上傳用戶：曹云鵬
