Ink Blotting One method for escaping from a maze is via ‘ink-blotting’. In this method your starting square is marked with the number ‘1’. All free, valid squares north, south, east and west around the number ‘1‘ are marked with a number ‘2’. In the next step, all free, valid squares around the two are marked with a ‘3’ and the process is repeated iteratively until : The exit is found (a free square other than the starting position is reached on the very edge of the maze), or, No more free squares are available, and hence no exit is possible.
標(biāo)簽： method ink-blotting Blotting escaping
上傳時(shí)間： 2014-12-03
上傳用戶：123啊
A new cable fault location method based on wavelet reconstruction is proposed. In this method the difference between the currents of faulty phase and sound phase under the high voltage pulse excitation is used as the measured signal and is decomposed in multi-scale by wavelet transform, then reconstructed in single scale. Comparing with traditional fault location method by travelling wave, the presented method will not be interfered by the reflected wave from the branch joint of cables or from other positions where the impedances are not matched and not be influenced by fault types, otherwise, the reflected waves can be recognized even the faulty position is near to the measuring terminal, at the same time, the influence of the wave speed uncertainty can be reduced. The correctness of the proposed method is proved by simulation results.
標(biāo)簽： method reconstruction location proposed
上傳時(shí)間： 2016-02-04
上傳用戶：maizezhen
This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.
標(biāo)簽： implements and min binomial
上傳時(shí)間： 2014-11-27
上傳用戶：2467478207
Using Jacobi method and Gauss-Seidel iterative methods to solve the following system The required precision is =0.00001, and the maximum iteration number N=25. Compare the number of iterations and the convergence of these two methods
標(biāo)簽： Gauss-Seidel iterative following methods
上傳時(shí)間： 2016-02-06
上傳用戶：zmy123
Synthesizable FIFO Model This example describes a synthesizable implementation of a FIFO. The FIFO depth and FIFO width in bits can be modified by simply changing the value of two parameters, `FWIDTH and `FDEPTH. For this example, the FIFO depth is 4 and the FIFO width is 32 bits.
標(biāo)簽： FIFO implementation Synthesizable synthesizable
上傳時(shí)間： 2016-02-12
上傳用戶：源弋弋
this procedure is a game of basketball or subsystems time, the competition will record the entire time, and can amend the Competition time suspended contest time, the two can be set at any time during the competition process of the match, the two teams exchanged scores midfielder position, Competition can end report issued directives
標(biāo)簽： competition basketball subsystems procedure
上傳時(shí)間： 2016-02-14
上傳用戶：cuibaigao
The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And what is the most likely sequence of rainy/sunny days that would explain these observations? The first question is answered by the forward algorithm the second question is answered by the Viterbi algorithm. These two algorithms are structurally so similar (in fact, they are both instances of the same abstract algorithm) that they can be implemented in a single function:
標(biāo)簽： discover viterbi algorm friend
上傳時(shí)間： 2016-02-16
上傳用戶：xc216
ASP開發(fā)指南,里面的西很不錯(cuò)的喲.This book is for anyone who wants to learn about using .NET for web interface design. Beginner or hobbyist .NET developers can certainly get a good foundation of .NET web interface design by going through this book from cover to cover. However, more seasoned .NET professionals, especially if they tend to steer away from the GUI of their projects, can also pick up a thing or two by focusing on certain chapters that appeal to them. This book is meant to take a reader from the beginning of a project to the completion of the interface design. Along the way, concepts are illustrated to show how the different pieces play together. So, anyone who really wants to understand the concepts presented in this book will be able to do so by reading the entire thing. However, this book should also serve as a good reference after you have read it or, in some cases, in place of reading it.
標(biāo)簽： for interface anyone about
上傳時(shí)間： 2016-02-16
上傳用戶：sjyy1001
MIDlet通過藍(lán)牙與電腦通信的案例,This resource demonstrates how to create Java™ applications that use Bluetooth communication between a PC and a mobile device. The document focuses, from Java programming point of view, on how to configure and use two alternative PC-side solutions: COM-based and JSR-82-based solutions. The package includes several code examples both for PC and mobile devices.
標(biāo)簽： demonstrates applications resource Bluetoo
上傳時(shí)間： 2014-01-18
上傳用戶：xiaoyunyun
兩種解決方案 Richard just finished building his new house. Now the only thing the house misses is a cute little wooden fence. He had no idea how to make a wooden fence, so he decided to order one. Somehow he got his hands on the ACME Fence Catalogue 2002, the ultimate resource on cute little wooden fences. After reading its preface he already knew, what makes a little wooden fence cute. A wooden fence consists of N wooden planks, placed vertically in a row next to each other. A fence looks cute if and only if the following conditions are met: ?The planks have different lengths, namely 1, 2, . . . , N plank length units. ?Each plank with two neighbors is either larger than each of its neighbors or smaller than each of them. (Note that this makes the top of the fence alternately rise and fall.)
標(biāo)簽： house the finished building
上傳時(shí)間： 2014-01-26
上傳用戶：541657925
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
