LemonSMS is a component developed in Java that provides a turnkey solution for application developers to incorporate into their Java applications the functionality of sending and processing of incoming SMS messages. LemonSMS acts as a middleware BETWEEN a Java application and a GSM Modem or Data enabled phone. Because LemonSMS only provides an interface to the added SMS functionality, your application still handles access to data and business logic tier. With the easy-to-use LemonSMS API, developers can easily utilize SMS functionalities provided by LemonSMS.
标签： application component developed developer
上传时间： 2013-12-29
上传用户：大融融rr
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
JDiff is a Javadoc doclet which generates an HTML report of all the packages, classes, constructors, methods, and fields which have been removed, added or changed in any way, including their documentation, when two APIs are compared. This is very useful for describing exactly what has changed BETWEEN two releases of a product. Only the API (Application Programming Interface) of each version is compared. It does not compare what the source code does when executed.
标签： constructors generates packages Javadoc
上传时间： 2015-09-06
上传用户：lijianyu172
* This a software code module for a time-of-day clock object. * The clock may be fixed 12-hour, fixed 24-hour, or dynamically * configurable BETWEEN these two types. Clock data can be accessed * as a binary number representing the number of minutes since midnight * or a BCD number formatted according to the time-of-day description * in the TIME module 0404x. The functions work with time-of-day values * which conform to normally accepted clock values of 1:00 to * 12:59 BCD / 0 to 719 binary for a 12-hour clock or clock values * 00:00 to 23:59 BCD / 0 to 1439 binary for a 24-hour clock. On power-up * the clock is 12:00 BCD / 0 binary for a 12-hour or dynamically * configurable clock, or 00:00 BCD / 0 binary for a 24-hour clock.
标签： clock time-of-day software module
上传时间： 2013-12-07
上传用户：llandlu
In order to thoroughly understand what makes Linux tick and why it works so well on a wide variety of systems, you need to delve deep into the heart of the kernel. The kernel handles all interactions BETWEEN the CPU and the external world, and determines which programs will share processor time, in what order. It manages limited memory so well that hundreds of processes can share the system efficiently, and expertly organizes data transfers so that the CPU isn t kept waiting any longer than necessary for the relatively slow disks.
标签： thoroughly understand variety order
上传时间： 2014-12-07
上传用户：PresidentHuang
Problem Statement You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input. Definition Class: ReverseSubstring Method: findReversed Parameters: string Returns: string Method signature: string findReversed(string input) (be sure your method is public) Notes The substring and its reversal may overlap partially or completely. The entire original string is itself a valid substring (see example 4). Constraints input will contain BETWEEN 1 and 50 characters, inclusive. Each character of input will be an uppercase letter ( A - Z ). Examples 0) "XBCDEFYWFEDCBZ" Returns: "BCDEF" We see that the reverse of BCDEF is FEDCB, which appears later in the string. 1)
上传时间： 2015-09-21
上传用户：sunjet
This directory contains an example ADSP-BF535 subroutine that demonstrates the initialization of the AC 97 communication link BETWEEN SPORT0 on the ADSP-BF535 and the AD1885 stereo Codec.
标签： initialization demonstrates subroutine directory
上传时间： 2014-11-29
上传用户：colinal
Distribution generator Here is a simple generator which can build some distributions with given properties. Distributions generator (compile with -lm) Typical use might be: ./distributions -u -m 1 -M 10 -n 100 -s 500 Generates a distribution of 100 uniform random numbers BETWEEN 1 and 10, such that the sum of numbers is 500. ./distributions -p -2.2 -m 1 -M 100 -n 200 -s 500 Idem with 200 numbers BETWEEN 1 and 100 following a power law with exponent -
标签： generator distributions Distribution simple
上传时间： 2014-01-27
上传用户：sammi
American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strength this is done via a series of 1-on-1 matches BETWEEN contestants and gladiators. If the contestant is stronger than the gladiator, then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength, then they are “perfect equals” and a tie is declared. We assume that each contestant is the perfect equal of exactly one gladiator, and each gladiator is the perfect equal of exactly one contestant. However, as the gladiators sometimes change from one show to another, we do not know the ordering of strength among the gladiators.
标签： contestants consulting Gladiator are
上传时间： 2013-12-18
上传用户：windwolf2000
We often get questions about how the deflate() and inflate() functions should be used. Users wonder when they should provide more input, when they should use more output, what to do with a Z_BUF_ERROR, how to make sure the process terminates properly, and so on. So for those who have read zlib.h (a few times), and would like further edification, below is an annotated example in C of simple routines to compress and decompress from an input file to an output file using deflate() and inflate() respectively. The annotations are interspersed BETWEEN lines of the code. So please read BETWEEN the lines. We hope this helps explain some of the intricacies of zlib.
标签： functions questions deflate inflate
上传时间： 2014-01-02
上传用户：zhuyibin
