Open Hub
Open Hub

 Settings |  Report Duplicate

0
I Use This!
Very Low Activity

Commits : Listings

Analyzed about 7 hours ago. based on code collected 1 day ago.
Nov 05, 2025 — Nov 05, 2026
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Updated complement diophantine function to print sorted tuples and parameters
Srinivasan Kannan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
(#) Factorization benchmarks for Tile binary search optimization have been redone on dual core (local[2]) after removing some print statements in python spark code which were CPU intensive. (#) Following are the durations for factoring same 24 bit integer factorized previously after removing print statements - an improvement of more than 3X: -------------------------------------------------------------- Factorization of 9333123 (24-bit) - without print statements -------------------------------------------------------------- real 35m56.196s (Spark Duration = 1839.146seconds) user 3m2.836s sys 4m56.668s ----------------------------------------------------------------- Factorization of 9333123 (24-bit) - with print statements earlier ----------------------------------------------------------------- real 112m24.101s (Spark duration 12:21 to 14:02 = 101minutes = 6060seconds) user 0m0.000s sys 0m0.004s ================================================= Factors of 9333123 are (excerpt from logs): ================================================= ... Factor is = 219 Factor is = 1387 Factor is = 2243 Factor is = 4161 Factor is = 6729 Factor is = 6729 Factor is = 42617 Factor is = 127851 Factor is = 163739 Factor is = 491217 Factor is = 3111041 Factor is = 9333123 ================================================= (#) Compressed Spark log for this factorization has been committed to python-src/testlogs/ (#) General Number Field Sieve algorithm is sequential, exponential in number of bits and requires O(2^(c(logN)^0.33*(loglogN)^0.67)) where c=1.901883 (for atleast one factor). For 24-bit (=logN) this is approximately k*128 time units for some constant k. But Computational Geometric Factorization Sieve finds all factors in O(logN*logN) time on multicore(PRAMs).
Srinivasan Kannan
More... almost 9 years ago
Updated Requirements.txt for SymPy
Srinivasan Kannan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 9 years ago
---------------------------------------------------------------------------------------------------------------- Complement Function Map Construction - Diophantine Representation - Lagrange's Four Square Theorem SymPy solver (Draft updates to: https://arxiv.org/abs/1106.4102) ---------------------------------------------------------------------------------------------------------------- (#) This commit implements diophantine representation of an enumerable recursive set by Sum of Four squares solver in SymPy. (#) New function that enumerates each element x of the complement set and applies it as a parameter to Sum of Squares Diophantine solver to obtain the quadruple (a,b,c,d) such that a^2 + b^2 + c^2 + d^2 = x (#) This is mostly partial recursive function and not necessarily a total recursive function(defined for all possible quadruples). (#) logs for this have been committed to testlogs/ (#) SymPy has other diophantine solvers too which require more than one parameters. (#) SymPy does not have exponential diophantine support yet which if available could construct an exponential diophantine for almost every recursively enumerable set ('almost' because of MRDP theorem - there are diophantine equations for recursively enumerable non-recursive sets and undecidable)
Srinivasan Kannan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
------------------------------------------------------------------------------------------------------------------------------ All pairs of encoded strings - Sum of Distances - algorithm mentioned in Grafit course notes implemented ------------------------------------------------------------------------------------------------------------------------------ (#) For pairwise pattern mining, sum of distances between binary encoded strings algorithm mentioned in Grafit course notes has been implemented which is better than bruteforce. (#) asfer.conf has been updated (#) asferencodestr.cpp and asferencodestr.h have been updated for new class member functions (factorial and combinations) (#) logs have been committed to testlogs/ (#) This is only in GitHub (NeuronRain Enterprise) repo which has binary encoded strings. NeuronRain Research repo in SourceForge has astronomically encoded unicode strings which requires a variant of this implementation (must be sum of 10 combination terms for each character - each term is per symbol).
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document - Typo
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
-------------------------------------------------------------------------------------------------- AsFer-KingCobra Neuro Electronic Currency - Rvalue NonPrimitive Perfect Forward -------------------------------------------------------------------------------------------------- (#) New constructor for cloudmove which takes const char* uuid has been defined. This enables assigning a string literal rvalue to cloudmove<currency::Currency> objects. (#) New move operator= which takes const char* uuid has been defined. This internally instantiates a currency::Currency object (#) New move operator= which takes cloudmove<T>& lvalue has been defined. (#) New value and a clause for move semantics, "nonprimitiveforward" has been defined. This clause does std::forward() of an rvalue cloudmove<currency::Currency> and then invokes std::move() of the currency over network. (#) This differs from move semantics "std::forward" which is specific to std::string uuid only, and thus solves the generic currency::Currency object rvalue forward and move. (#) client and server logs for this network move have been committed to testlogs.
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated Requirements.txt
Srinivasan Kannan
as K.Srinivasan
More... almost 9 years ago
Updated AsFer Design Document
Srinivasan Kannan
More... almost 9 years ago