Abstract: How can an interface change a happy face to a sad face? Engineers have happy faces when an interface works properly.Sad faces indicate failure somewhere. Because interfaces between microprocessors and ICs are simple—even easy—they are oftenignored until interface failure causes sad faces all around. In this article, we discuss a common SPI error that can be almostimpossible to find in a large system. Links to interface tutorial information are provided for complete information. Noise as a systemissue and ICs to minimize its effects are also described.
I have written this article to capture a Windows image into a bitmap file that will support all PaintBrush tools and Thumbnail Views of Windows Explorer. I have found many programmers suffering from this problem, including me, until I wrote this article. 捕獲一個窗口圖像并存入一個支持MS畫筆的位圖文件中 我寫的這篇文章介紹了捕獲一個窗口圖像并存入一個支持所有畫筆和Windows Explorer的位圖文件中。 我發現許多程序員因這個問題而煩惱,包括我在內,直到我寫了這篇文章。 來源: http://www.codeguru.com/bitmap/WndToBmpFile.html
解決時鐘問題，acm競賽題
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
A six people s rushing replies an implement, use some s switches in toggle switch K0 ~ K5 is that ON accomplishes when rushing to reply button , nobody rush to answer, 6 numerical code circulation takes turns at demonstrating 1 ~ 6 (horse races) , who rushes to reply the numerical code stops having a ride on a horse , first, whose serial number, has simultaneous light of 6 numerical codes again afterwards the key presses down. System denies responding to, until this place is OFF batch , the wheel restoring 1 ~ 6 horse races starting time as soon as rushes to answer.
The purpose of this lab is to introduce the concept of FSMs with a datapath, and to
study the usage of more complex test benches. Also, we enforce a rudimentary design
methodology by assuming that the students are part of a bigger project, and have no
knowledge of VHDL-implementation of the datapath (made by a hypothetical other
group) other than its predefined Entity Interface until they come to the lab.
The rest of this document is structured as follows: Section 2 describes some prelimi-
nary reading and exercises that should be done before the lab. Section 3 details the
design tasks that should be carried out to pass this lab.
CORDIC (Coordinate Rotation Digital Computer) is a method for computing elementary functions using minimal hardware such as shifts, adds/subs and compares.
CORDIC works by rotating the coordinate system through constant angles until the angle is reduces to zero. The angle offsets are selected such that the operations on X and Y are only shifts and adds.
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.
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
BY USING THIS SOFTWARE, YOU ARE AGREEING TO BE BOUND BY THE TERMS OF
* THIS AGREEMENT. DO NOT USE THE SOFTWARE until YOU HAVE CAREFULLY
* READ AND AGREED TO THE FOLLOWING TERMS AND CONDITIONS.
