This article presents GISCoordinate.java - a class that allows you to represent a GIS coordinate in your JAVA code in decimal degrees (38.4443, e.g. 122.33433) , minute degrees (33 44 22E, 122 33 44N), or radian degrees. Also, you can use this class to manipulate the coordinate, moving it around the globe by giving it distances in feet and direction of travel. You can then extract the new coordinate that is calculated after the travel.
標簽： GISCoordinate coordinate represent presents
上傳時間： 2013-12-02
上傳用戶：wangchong
LBreakout a breakout-style arcade game for Linux Requirements: X11, SDL[1.0 or better] Installation: 1. type ./configure options: --disable-sound [no sound] --disable-install [no installation play from source directory] [e.g. ./configure --disable-sound --disable-install ] 2. type make 3. become root 4. type make install [only if install is not disabled] 5. type lbreakout to play
標簽： breakout-style Requirements LBreakout arcade
上傳時間： 2017-03-13
上傳用戶：xz85592677
數據庫學生成績管理系統 VC源碼 ①輸出： a 學生分類查詢課程成績 b 學生查詢全部課程成績 ②輸入： c 管理員錄入學生成績 d 管理員刪除學生成績 e 管理員修改學生成績
上傳時間： 2017-03-16
上傳用戶：yxgi5
3G Mobile Open Wide Door For E-commerce The 3G mobile Internet business in 3G era will obtain rapid development, but it still cannot become the ma in 3G era. In the age of 3G speech business, but is still a subject of value-added business will have great development, the 3G mobile Internet business.
標簽： E-commerce 3G Internet business
上傳時間： 2017-03-23
上傳用戶：zjf3110
c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
標簽： fault-tolerant algorithms redundant underlyin
上傳時間： 2013-12-18
上傳用戶：jkhjkh1982
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
標簽： Multiplicative undirected Shortest measured
上傳時間： 2017-04-08
上傳用戶：邶刖
this is a digital intercom projects using ADC PWM and UART interrupt. you take the value from mic enter it to ADC and then send serially to the other microcontroller which receives the data and transform the digital data into analog data by PWM which is connected to speaker
標簽： interrupt intercom projects digital
上傳時間： 2017-04-19
上傳用戶：亞亞娟娟123
Each exploration in this book is a mixture of text and interactive exercises. The exercises are unlike anything you鈥檝e seen in other books. Instead of multiple choice, fill-in-the-blank, or simple Q&A exercises, lessons are interactive explorations of key C++ features.
標簽： exercises exploration interactive mixture
上傳時間： 2017-05-14
上傳用戶：whenfly
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鈥?.
標簽： predefined connected receives Planet
上傳時間： 2017-05-17
上傳用戶：fanboynet
Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate different sequences of numbers each time the program executes
標簽： Generate Possion between random
上傳時間： 2017-05-25
上傳用戶：bibirnovis
