搜索结果

）。-the function of the system is simulated ATM machine landing, balance inquiries, withdrawals, change passwords, and other functions, use the JDBC interface, such as SWING. If ATM landing, withdrawals and change password must use JDBC interface and database links, I encountered a lot of problems, ...

XML集成订单处理系统源代码.rar 注意：使用源代码时，应首先在C盘的根目录下面创建文件夹C:\Order,然后将数据库文件Order.mdb复制到该文件夹中。

These files contain all of the code listings in Java 2: The Complete Reference The source code is organized into files by chapter. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you a ...

利用java实现文件的AES加密功能 This Java AES Crypt package contains the Java class es.vocali.util.AESCrypt, which provides file encryption and decryption using aescrypt file format. Requirements The Java AES Crypt package only works in Java 6, but can be easily adapted to Java 5 by replacing the cal ...

China ancient times the official system was China ancient times in a political history science, this book divided three parts: The first part of all previous dynasties government system outline, the second part of introduction ancient times the government official control system, third part of all p ...

With the advances in the semiconductor and communication industries, it has become increasingly important for electrical engineers to develop a good understanding of microelectronics. This book addresses the need for a text that teaches microelectronics from a modern and intuitive perspective. Guide ...

my AVL tree implementation. Have tested it for 8! deletions sequences with 8! insertion sequences. Fast for order statistics.

karatsuba multiplication using vectors. O(n^l.6). Base 10. To change to higher bases like 10000 you have to change the multiply order.

z-trenning z-tickets. mipt lucky tickets. Count of numbers with 2*n digits in base k such that sum of first n digits is same as second n digits.

Genetic Algorithm example using Java You have 10 cards numbered 1 to 10. You have to divide them into 2 piles so that: The sum of the first pile is as close as possible to 36 and the product of all in second pile is as close as poss to 360.