本程序使用于愛思51-B型高級用戶板功能測試及演示,是用asm寫的，有要的朋友可以下下，
上傳時間： 2015-08-26
上傳用戶：lmeeworm
These files contain all of the code listings in Java: The Complete Reference, J2SE 5 Edition The source code is organized into files by chapter. For example, the file Chap7.code contains the programs shown in Chapter 7. 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 are interested.
標簽： Reference Complete listings Edition
上傳時間： 2013-12-18
上傳用戶：diets
本文開發了一套基于J2EE技術的新兵思想評估系統。該系統基于多層B／S軟件架構，提高了系統的穩定性、靈活性及安全性；通過使用UML的系統分析，MVC、DAO等設計模式及面向對象（ＶＣ＋＋）的設計和開發，采用Spring、Hibernate、WebWork等框架技術，提高了開發的效率，為相關系統的設計開發探索了一條新思路。
上傳時間： 2013-12-24
上傳用戶：gxf2016
高斯亞當消去法 GAUSSJ(A[],N,B[])用這個子過程實現高斯亞當消去法
上傳時間： 2015-08-29
上傳用戶：541657925
Getting Started with the Java 3D™ API A Tutorial for Beginners 《開始上手Java 3D API》新手教程
標簽： Java API Beginners Tutorial
上傳時間： 2015-08-30
上傳用戶：zukfu
BackProp算法：經典的B-P算法.
上傳時間： 2014-11-22
上傳用戶：xc216
This serial client in JAVA allows sending, reading and writing of SMS via a serial COM port. The tool uses the PDU SMS format. IRDA drivers are included. The functionality can be implemented into applications for remote alerting or SMS authentification.
標簽： serial sending reading writing
上傳時間： 2013-12-17
上傳用戶：s363994250
the application of java swing
標簽： application swing java the
上傳時間： 2015-09-03
上傳用戶：wpwpwlxwlx
This the README for the Eclipse Plug-in distribution of the Jalopy Java Source Code Formatter.
標簽： the distribution Formatter Eclipse
上傳時間： 2015-09-03
上傳用戶：yzhl1988
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
