Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively.
Learn to build applications with Jakarta Struts, the most popular JSP development framework. Struts Kick start is a "hands-on" book filled with sample applications and code snippets you can reuse, and in-depth coverage of new features in Struts 1.1. If you are looking for a practical book that "shows you how to do it", then Struts Kick start is for you. Plus, it s the first Struts book with detailed examples of the major Struts tags
Java has become a confusing world. Five years ago, there were few decisions to make once
you started programming in Java—you used AWT for graphical user interfaces, sockets for
network programming, and hacked together everything else you needed. Since then, though,
the APIs available for the Java language have grown, and grown. . . and grown. Now you can
dabble in Swing, servlets, Enterprise JavaBeans (EJB), JavaMail, and more. Additionally,
there are now packages of APIs, like the Java 2 Micro Edition (J2ME) and Java 2 Enterprise
Edition (J2EE). While these packages seem to be nicely wrapped bundles of useful APIs, they
don t help the average developer figure out how to piece together the APIs contained in these
packages. Though it s simple to find documentation on the individual APIs, getting the "big
picture" is difficult, at best. One of the most interesting, but difficult, aspects of Java today is
building Java enterprise applications using the J2EE package.
Tiny Planet is small device connected to a GSM cell phone. When the mobile receives a predefined SMS (text message), like "Activate burglar alarm" or "start backup pump", the circuit automatically recognizes it as a command, and switches the output port accordingly. Besides switching the port on or off, the user can pulse it for a short period (e.g. 鈥淩eboot remote server鈥?.
在J2ME中實現虛擬代理，然后過濾user-agent ，用于突破廣東移動等的cmwap限制使用方法，啟動后將相應軟件（如Opera）的代理設成localhost 8080，即可-J2ME virtual agents, then filter user-agent, Guangdong Mobile breakthrough for the restrictions on the use of SMS, will start corresponding software (such as the Opera), the agent set to localhost 8080 can be
Playfair Cipher
1.not even the large number of keys in a monoalphabetic cipher provides security
2.one approach to improving security was to encrypt multiple letters
3.the Playfair Cipher is an example
4.invented by Charles Wheatstone in 1854,but named after his friend Baron Playfair
Playfair Key Matrix
1.a 5X5 matrix of letters based on a keyword
2.fill in letters of keyword (sans duplicates)
3.fill rest of matrix with other letters
Encrypting and Decrypting
-plaintext is encrypted two letters at a time
1. if a pair is a repeated letter, insert filler like X’
2. if both letters fall in the same row, replace each with letter to right (wrapping back to start from end)
3. if both letters fall in the same column, replace each with the letter below it (again wrapping to top from
bottom)
4. otherwise each letter is replaced by the letter in the same row and in the column of the other letter of the pair
This book introduces the powerful programming tools provided in your Microsoft Visual C++ compiler package. These include the compiler, debugger, and various Windows 95, 98, and NT development tools. This book compliments your Microsoft reference manuals and online help to provide a quick start with each of the components in the compiler package.
The C++ Cookbook will make your path to mastery much shorter. This practical, problem-solving guide is ideal if you re an engineer, programmer, or researcher writing an application for one of the legions of platforms on which C++ runs. The algorithms provided in C++ Cookbook will jump-start your development by giving you some basic building blocks that you don t have to develop on your own.
迷宮算法（maze）
/* Maze * starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK,
* 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary.
* Each step can be made horizontally or vertically for one more grid (diagonal
* jump is not allowed).
* Your program should print a series of grid coordinates that start from m[0][0]
* and go to m[9][9]
* Hint: No need to find the shortest path, only need to find one path that gets
* you to desitination.
*/
