Projects tagged ‘chain’

Samooha is a networked Business Environment being developed for the small and medium business community to adopt as an entry level Collaborative ERP, CRM and peer-to-peer Supply Chain solution with ... [More] collaborative features such as Instant Messaging and WorkSpace sharing. [Less]

Control your chain in 3d cube using wasd & arrow keys

In emerging economies such as China, many successful traditional business plan to use franchise to expand their business quickly. Lack of real-time information of chain stores will not only slow down ... [More] their expansion but also hurt the brand name. Most of chain stores can not afford dedicated IT staff. Therefor a web based system provides easy of use and maintenance. But the reliability of network connection in those economies is still questionable. The offline support will provide the business continuity which is crucial to those business that often run 24 by 7. [Less]

chaincover finds the minimum chain cover of a graph and is written in C. Simple chain: Set of vertices i, Vi + 1, Vi + 2, ..., Vi + k> such that the degree of the vertices Vi and Vi + k is not 2 ... [More] while the degree of every other vertex is 2, with k being greater than or equal to 1. What: The program finds the minimum set of vertices in the given graph so that every simple chain in the graph at least one vertex in common with the chosen vertex set. This set is called the minimum chain cover for the given graph. Includes a graph data structure implemented using adjacency lists and parameter based random graph generation to generate test cases. How: It considers every possible k subset of vertices to see if it is possible to reach all the simple chains from the chosen set of vertices and spits out the smallest subset that satisfies this condition. Also plan to make use of other heuristic methods to improve the performance of this exact solver(See TODO). It is implemented in C and is fairly fast. Why: The problem, being reducible to and generalized from the well known Vertex Cover problem, is NP-Complete. Hence this problem is currently intractable. Proving the existence of an exact solver that can run in polynomial time amounts to proving P = NP. TODO Include a linear time approximation algorithm that does no worse than twice the size of the minimum chain cover. Use this approximation algorithm to eliminate all k subsets of size less than b/2 upfront, b being the size of the approximate minimum chain cover in the best run of the approximation algorithm on the given graph. Make changes to to allow solving the vertex cover problem as well. (Mostly easy because the chain cover problem is a generalization of the vertex cover problem) Post a graph of its performance on varied input sizes. Screenshot: [Less]

For QSR Chain Business

This small library performs powerful check of dates with useful 'ruby-style' chained notation

Ich versuche Netzwerke via Datenbankabfrage zu zeichnen

Welcome to Whitetask projectWhitetask is a framework which helps you write readable code when you need to express complex or long business flow. Current developing version, 0.2-SNAPSHOT provides DSL ... [More] Style as following. // Retry new Flow() {{ execute(task); ifLastResultIs(FAILURE).retryUntil(2); }}.flow(); // Parallel execution new Flow() {{ executeParallelly(someTask, someTask, someTask); }}.flow();QA, more infomrationPlease, join to our mailing list. (Korea user mailing) (Global devloper mailing) NewsRobust-Task has renamed to Whitetask and project has also moved to this place. -2009/06/23 Robust-Task 0.1 concept version has just been released! - 2009/03/12 [Download 0.1 concept] [Introduction] [Apache Chain vs Whitetask] [Less]

a few patterns in Java, Groovy and Ruby that my friends and I hacked together in our spare time

This is a simple xor chain encryption program that will encrypt a file, the filename of which must be provided as a command line argument, using a simple CBC encryption algorithm. Upon execution of ... [More] the program, the user is prompted to enter a password. If the file is not encrypted, the file will be overwritten with the encrypted file, and a hash of the password will be prepended to the begining of the file. If the file is encrypted, the password is checked against this embedded hash value before decrypting and overwriting the file. The target file is cached in RAM; the amount of RAM necessary is double the size of the file. This program is written in c. [Less]