We have collection of more than 1 Million open source products ranging from Enterprise product to
small libraries in all platforms. We aggregate information from all open source repositories.
Search and find the best for your needs. Check out projects section.
quot;Final Empirequot; is a turn-based strategy-game in the tradition of quot;empirequot;, quot;empire deluxequot;, quot;civilisationquot;, etc. The player's task is to explore the world and conquer cities with different units like armys, airplanes and ships.
Final Fantasy TitaniumAfter a long and devastating civil war, the Bourine Empire has flourished under the protection of the Imperial Guard and Emperor Sabourin Depalma. But after 100 years of peace, a new foe emerges that threatens the Empire and it's fledgling democracy. The Emperor has called upon the elite warriors of the Guard, known as the Imperial Triarii, to once again stand and defend the Empire against this new menace. As a child of the Triarii, you have been trained in the ways of comb
I will give a talk about hammurabi during the next Devoxx - Don't miss it! "Any fool can write code that a computer can understand. Good programmers write code that humans can understand" - Martin Fowler "Domain users shouldn't be writing code in our DSL but it must be designed for them to understand and validate" - Debasish Ghosh OverviewOne of the most common reason why software projects fail, or suffer unbearable delays, is the misunderstandings between the analysts who define the business ru
In China, from about the first century C.E. through the seventeenth century, anonymous and most likely illiterate adepts practiced an arcane art termed fangcheng æ–¹ç¨‹ (often translated into English as â€œrectangular arraysâ€�). This art provided procedures for manipulating counting rods on a counting board, which enabled practitioners to produce answers to seemingly insoluble riddles. This art seems to have been closely aligned with other mathematical arts, including various forms of calculati
C.U.R.E. is an FPS, currently being developed with the Unity game engine.20 years into the future, America is at war with it's neighbors. The government is corrupt and power hungry, seeking to rule an empire so they will have no enemies to stand against them. Five scientists were selected to develop a secret weapon to wipe out opposing countries. It is 2050. The disease has run uncontrolled for decades, finally dissolving into the atmosphere. But it's creations remain in the world. They devour h
EPEPT: A web service for enhanced P-value estimation in permutation testsMotivation In computational biology, permutation tests have become a widely used tool to assess the statistical significance of an event under investigation. However, the common way of computing the P-value, which expresses the statistical significance, requires a very large number of permutations when small (and thus interesting) P-values are to be accurately estimated. This is computationally expensive and often infeasibl
IntroductionSketchSort(1) is a software for all pairs similarity search. It takes as an input data points and outputs approximate neighbor pairs within a distance (1.0 - cosine similarity). First, the input data points are mapped to binary strings (sketches) by locality sensitive hashing, and then neighbor pairs of strings within a Hamming distance are enumerated by the multiple sorting method (2). Finally, the cosine distances for such neighbor pairs are calculated. If the cosine distance for a
IntroductionSketchSortE(1) is a software for all pairs similarity search. It takes as an input data points and outputs approximate neighbor pairs within a Euclidean distance threshold. First, the input data points are mapped to binary bit strings (sketches) by sift-invaliant kernel based hashing (3), and then neighbor pairs of strings within a Hamming distance are enumerated by the multiple sorting method (2). Finally, the Euclidean distances for such neighbor pairs are calculated. If the Euclid
IntroductionSketchSortJ(1,2) is a software for all pairs similarity search. It takes as an input data points and outputs approximate neighbor pairs within a Jaccard distance (1.0 - Jaccard-similarity). First, the input data points are mapped to sketches by minwise independent permutations, also called minhash, and then neighbor pairs of sketches within a Hamming distance are enumerated by the multiple sorting method (3). Finally, the Jaccard distances for such neighbor pairs are calculated. If t
Effect of PRG Quality on Hash Tableshe common problem of having the ability to maintain a set of elements from a large universal space that may change over time has bred a solid offering of hashing algorithms. However, some of the best of these algorithms need random number generators. Since purely random functions cannot be implemented, the best we have is pseudo-random number generators. Of course, not all algorithms are created equal, and so some will produce numbers that are "more random" th
he proposal develops and presents new statistical anomaly detection methods for detecting conditional outliers and applies them to the identification of unusual outcomes and patient management decisions. Our hypothesis is that patient-management decisions that are unusual with respect to past patients may be due to errors and that it is worthwhile to raise an alert if such a condition is encountered. Conditional anomaly detection extends standard unconditional anomaly framework but also faces ne