北邮传感网络 The research of sensory networks in BUPT, Beijing, China!
CGL(C Generic Library) is a stl-like library written in pure C.It implements iterators, memory management,generic containers such as list,map, generic algorithms such as sort() and search(),and it can manipulate any types of data.
Large Integer factorization using GNFS method
Large Integer factorization using general number field Sieve. This is inspired on the project NFSNET. Our future goals is to implement the algorithm, and in the future use Scala to run in a multicore distribute environment
"Open Source Book Collector" The main purpose of this utility is to provide a complete solution for organizing and accessing data of eBooks.
Double Order Data Structure
This project will includes some common data structures which implemented in C# languages.
This a experimental proyect for a Universal PATCH of all products of Xilisoft & ImTOO. This proyect is for educational purposes only and its 100% experimental. Support me and rate the proyect for better please!!!
The solution to all your problems
The Jsolution package is a collection of programs, scripts,libraries and documents that i have written and use in my daily life.
SHOBHIT-Advance String Search is a pattern search Algorithm
In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst its space complexity is O(1). This algorithm checks two characters at a time. In best case where the substring is at the start of the text, we can check all the character of substring in only m/2 time. In worst case where the substring is at the last of the text, we need to iterate till n – m For more information please visit the following link:- http://learandexperiment.blogspot.in
My algorithm which solves The Salesman Problem with neighborhoods written in C# with visualisation.
The graph fragment matching project.
A .NET Library written in C# 2.0 for doing some mathematic operations as evaluating functions, plotting or finding roots. Visit the Project Web site at http://math-net.sourceforge.net.
This project intents to provide various C++ facilities. It is a framework that intents to join many common utilities in a single point. Things like Exception Handling, Logging, Concurrency, Audio, Fuzzy Logic will be the first utilities.
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.