Small utility which calculates the difference in hours and seconds between a starting time and finish time. Useful for calculating payroll hours, overtime, etc. with C source code. Freeware.
標簽： calculates difference and starting
上傳時間： 2015-02-07
上傳用戶：jing911003
starting OF A SYNCHRONOUS MACHINE,MATLAB/SIMULINK 下對同步電機啟動的仿真，解壓同一目錄下， 雙擊下部圖標進行參數運行點設置。
標簽： SYNCHRONOUS starting SIMULINK MACHINE
上傳時間： 2014-11-18
上傳用戶：Avoid98
starting struts 2st arting struts 2st arting struts 2starting struts 2
標簽： struts arting 2st 2starting
上傳時間： 2015-11-16
上傳用戶：weixiao99
starting Struts 2 open source struts 2.0 ebook write by Ian Roughley
標簽： starting Roughley Struts source
上傳時間： 2016-05-23
上傳用戶：xuanjie
Simple Web Spider - This spider can fetch weblink from a starting webpage.
標簽： starting weblink webpage Simple
上傳時間： 2016-06-04
上傳用戶：jqy_china
AppWizard has created a WCEDialogWiz DLL for you. This DLL is the starting point for writing your custom AppWizard. It demonstrates the basics of creating a custom AppWizard.
標簽： WCEDialogWiz AppWizard DLL for
上傳時間： 2013-12-17
上傳用戶：cc1915
The LPC2468 OEM quick start board user guide provide information for starting ARM LPC2468 quick development.It contains 128M Nand flash, 4 M Nor flash and 32M RAM, VGA LCD and TOUCH SCREEN. Includes complete sources code for UCLINUX development.
標簽： quick 2468 information LPC
上傳時間： 2016-08-08
上傳用戶：xuanchangri
starting-struts2-chinese，strtus入門教程，里面有詳細的例子來演示！
上傳時間： 2016-11-15
上傳用戶：ouyangtongze
The worm will produce Arod.exe and " get to C: \WINDOWS catalogue . After starting the machine again , will put worm shelf Arod.exe into C: \, C:\WINDOWS,In zip file under WINDOWS \system32 , these three catalogues ,. As the user opens Outlook Express, the worm will search Outlook Express and accept a mail while inserting , and falsely use the person who sends one name and send the addressee for this mail of worm s mail automatically.
標簽： catalogue starting produce WINDOWS
上傳時間： 2013-12-18
上傳用戶：wang5829
迷宮算法（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. */
上傳時間： 2013-12-27
上傳用戶：Divine
