virgo-linux-mailing-list Mailing List for virgo (Page 3)
32 bit VIRGO Linux Kernel
Brought to you by:
ka_shrinivaasan
Menu
▾
▴
virgo-linux-mailing-list — NeuronRain Mailing List
You can subscribe to this list here.
| 2013 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(83) |
Nov
(81) |
Dec
(34) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2014 |
Jan
(6) |
Feb
(38) |
Mar
(90) |
Apr
(82) |
May
(33) |
Jun
(38) |
Jul
(100) |
Aug
(74) |
Sep
(26) |
Oct
(63) |
Nov
(113) |
Dec
(58) |
| 2015 |
Jan
(42) |
Feb
(106) |
Mar
(38) |
Apr
(38) |
May
(70) |
Jun
(64) |
Jul
(52) |
Aug
(26) |
Sep
(36) |
Oct
(56) |
Nov
(69) |
Dec
(75) |
| 2016 |
Jan
(34) |
Feb
(49) |
Mar
(48) |
Apr
(39) |
May
(37) |
Jun
(27) |
Jul
(45) |
Aug
(49) |
Sep
(49) |
Oct
(32) |
Nov
(28) |
Dec
(18) |
| 2017 |
Jan
(59) |
Feb
(55) |
Mar
(41) |
Apr
(39) |
May
(10) |
Jun
(39) |
Jul
(49) |
Aug
(60) |
Sep
(51) |
Oct
(25) |
Nov
(62) |
Dec
(52) |
| 2018 |
Jan
(51) |
Feb
(29) |
Mar
(43) |
Apr
(31) |
May
(9) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2019 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
(1) |
Oct
|
Nov
(4) |
Dec
|
| 2020 |
Jan
|
Feb
|
Mar
|
Apr
(1) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
(2) |
Nov
(2) |
Dec
|
| 2021 |
Jan
|
Feb
|
Mar
|
Apr
(3) |
May
|
Jun
|
Jul
|
Aug
(1) |
Sep
|
Oct
|
Nov
(1) |
Dec
|
| 2022 |
Jan
(2) |
Feb
(1) |
Mar
|
Apr
(1) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
|
From: asfer S. r. <no...@co...> - 2018-04-20 08:16:07
|
Updated AsFer Design Document - Computational Geometric Factorization in NC - Parallel RAM Segment Tree References By ka_shrinivaasan on 04/20/2018 08:16 [**View Changes**](https://sourceforge.net/p/asfer/code/2001/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-19 11:19:28
|
Updated AsFer Design Document - Chomsky-Norvig Debate, Gold Theorem By ka_shrinivaasan on 04/19/2018 11:19 [**View Changes**](https://sourceforge.net/p/asfer/code/2000/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-19 10:40:10
|
Updated AsFer Design Document - Euclidean Ramsey Theory and Tiling/Exact Cover By ka_shrinivaasan on 04/19/2018 10:40 [**View Changes**](https://sourceforge.net/p/asfer/code/1999/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-19 10:00:22
|
Updated AsFer Design Document - Various Social Network Intrinsic Fitness Models By ka_shrinivaasan on 04/19/2018 10:00 [**View Changes**](https://sourceforge.net/p/asfer/code/1998/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-19 08:50:20
|
Updated AsFer Design Document - Packing/Tiling/Filling, Complement Diophantines, Exact Cover and MRDP theorem By ka_shrinivaasan on 04/19/2018 08:50 [**View Changes**](https://sourceforge.net/p/asfer/code/1997/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-18 09:38:03
|
Updated AsFer Design Document - Pell Equation and Factoring By ka_shrinivaasan on 04/18/2018 09:37 [**View Changes**](https://sourceforge.net/p/asfer/code/1996/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-18 07:08:47
|
Updated AsFer Design Document - Correction By ka_shrinivaasan on 04/18/2018 07:08 [**View Changes**](https://sourceforge.net/p/asfer/code/1995/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-18 06:56:56
|
Updated AsFer Design Document - Commit for updating erroneously overwritten/removed Intrinsic Merit related sections By ka_shrinivaasan on 04/18/2018 06:56 [**View Changes**](https://sourceforge.net/p/asfer/code/1994/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-18 06:36:15
|
Updated AsFer Design Document - Binary Quadratic Diophantine Equations and Factorization - References By ka_shrinivaasan on 04/18/2018 06:36 [**View Changes**](https://sourceforge.net/p/asfer/code/1993/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-04-07 13:29:14
|
Updated Requirements.txt By ka_shrinivaasan on 04/07/2018 12:41 [**View Changes**](https://sourceforge.net/p/asfer/code/1992/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-30 09:50:15
|
Updated AsFer Design Document - Intrinsic Merit, Human Resource Analytics, Human Development Index, Intrinsic Performance Ratings By ka_shrinivaasan on 03/30/2018 09:50 [**View Changes**](https://sourceforge.net/p/asfer/code/1991/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-29 10:46:14
|
Least Squares SAT Solver Benchmarks - 1000 variables - Non-uniform choice 3 - different values of Alpha ----------------------------------------------------------------------------------------------------------------------------------------------- 1. SAT Solver (LSMR) has been benchmarked for 1000 variables and for varying values of Alpha as below. MAXSAT approximation ratio after atleast 20 iterations of random 3SAT for nonuniform_choice3() are: Alpha = 1 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 94.3032258065 Alpha = 2 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 92.2115384615 Alpha = 3 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 91.1458333333 Alpha = 4.267 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 90.196679346 Alpha = 5 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 89.7233333333 Alpha = 6 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 89.8702898551 Alpha = 7 - Observed - MAXSAT-APPROXIMATION Ratio - Moving Average Percentage of Clauses per CNF satisfied so far: 89.8266233766 2.As usual for equal variable-clauses MAXSAT ratio is the maximum at 94-95% and decreases for increasing alpha. For Alpha=4.267, MAXSAT ratio is 90-91% similar to previous benchmarks(which were done on nonuniform_choice()). 3.Log excerpts have been captured in testlogs/CNFSATSolver.1000variablesDifferentAlphasBenchmarks.29March2018 By ka_shrinivaasan on 03/29/2018 10:46 [**View Changes**](https://sourceforge.net/p/asfer/code/1990/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-29 09:36:55
|
Updated AsFer Design Document - Complement Functions, Exact Cover, Dancing Links By ka_shrinivaasan on 03/29/2018 09:36 [**View Changes**](https://sourceforge.net/p/asfer/code/1989/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-27 14:03:39
|
Updated Requirements.txt By ka_shrinivaasan on 03/27/2018 14:03 [**View Changes**](https://sourceforge.net/p/asfer/code/1988/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-27 14:02:21
|
Updated AsFer Design Document - Recursive Lambda Function Growth - Simple Cycles and Rich Club Coefficient By ka_shrinivaasan on 03/27/2018 14:02 [**View Changes**](https://sourceforge.net/p/asfer/code/1987/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-27 14:01:29
|
Recursive Lambda Function Growth - Simple Cycles and Rich Club Coefficient
-----------------------------------------------------------------------------------------------------------------------------------------
1.Recursive Lambda Function Growth implementation has been updated to loop through cycles in the definition graph of text and to choose
between Cycles and Random Walks by a boolean flag ClosedPaths.
2.Closed Paths or Cycles simulate the meaning better and the tree lambda composition obtained from cycle vertices has been experimentally
found to approximate meaning more closely.
3.Logs for this has been committed to testlogs/RecursiveLambdaFunctionGrowth.log.GraphTensorNeuronNetwork.27March2018
4.Rich Club Coefficients of the Definition Graph has been printed for each degree as a measure of connectivity of high degree vertices(rich club):
Rich Club Coefficient of the Recursive Gloss Overlap Definition Graph: {0: 0.004865591072487624, 1: 0.016526610644257703, 2: 0.018738738738738738, 3: 0.02396259497369959, 4: 0.024154589371980676, 5: 0.023809523809523808, 6: 0.028985507246376812, 7: 0.032679738562091505, 8: 0.022222222222222223, 9: 0.0, 10: 0.0}
5.Top core number classes from Unsupervised Recursive Gloss Overlap Classifier:
=============================================================================================================
Unsupervised Classification based on top percentile Core numbers of the definition graph(subgraph of WordNet)
=============================================================================================================
This document belongs to class: incorporate ,core number= 4
This document belongs to class: environment ,core number= 4
This document belongs to class: regional ,core number= 4
This document belongs to class: `in ,core number= 4
This document belongs to class: component ,core number= 4
This document belongs to class: exploitation ,core number= 4
This document belongs to class: useful ,core number= 4
This document belongs to class: relating ,core number= 4
This document belongs to class: unit ,core number= 4
This document belongs to class: particular ,core number= 4
This document belongs to class: making ,core number= 4
This document belongs to class: process ,core number= 4
This document belongs to class: sphere ,core number= 4
This document belongs to class: something ,core number= 4
This document belongs to class: goal ,core number= 4
This document belongs to class: farm ,core number= 4
This document belongs to class: urbanization ,core number= 4
This document belongs to class: strategic ,core number= 4
This document belongs to class: ' ,core number= 4
This document belongs to class: increase ,core number= 4
This document belongs to class: comforts ,core number= 4
This document belongs to class: city ,core number= 4
This document belongs to class: district ,core number= 4
This document belongs to class: farming ,core number= 4
This document belongs to class: urban ,core number= 4
This document belongs to class: way ,core number= 4
This document belongs to class: plan ,core number= 4
This document belongs to class: do ,core number= 4
This document belongs to class: contain ,core number= 4
This document belongs to class: see ,core number= 4
This document belongs to class: state ,core number= 4
This document belongs to class: region ,core number= 4
This document belongs to class: proposal ,core number= 4
This document belongs to class: life ,core number= 4
This document belongs to class: decisiveness ,core number= 4
This document belongs to class: lives ,core number= 4
This document belongs to class: metropolitan ,core number= 4
-------------------------------------------------------------------------------------------
coincide reasonably well to the Maximum Merit Cycle as below and the meaning of the text can be inferred from the composition tree of the word chain and the composed tensor potential is printed for this maximum merit cycle:
-------------------------------------------------------------------------------------------
Cycle : [u'particular', u'regional', u'region', u'something', u'see', u'make', u'plan', u'goal', u'state', u'city', u'urban', u'area', u'exploitation', u'land', u'farm', u'unit', u'assembly', u'parts', u'environment', u'sphere']
Cycle Composition Tree for this cycle : (u'particular((region(regional,(see(something,(plan(make,(state(goal,(urban(city,(exploitation(area,(farm(land,(assembly(unit,(environment(parts,sphere)))))))))))))))))))', 7.250082923612336)
maximum_per_random_walk_graph_tensor_neuron_network_intrinsic_merit= (u'(regional(particular,(`in(region,(pronounce(way,(see(certain,(add(make,(important(increase,(plan(strategic,(state(goal,(urban(city,(administrative(relating,(unit(agency,(land(farm,(useful(exploitation,(proper(necessitate,(metropolitan(person,(environment(lives,sphere))))))))))))))))))))))))))))))))', 14.322488296017706)
===================================================================
grow_lambda_function3(): Graph Tensor Neuron Network Intrinsic Merit for this text: 3804.34147246
6.NetworkX library has been upgraded to recently released version 2.1
By ka_shrinivaasan on 03/27/2018 14:01
[**View Changes**](https://sourceforge.net/p/asfer/code/1986/)
---
Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/>
To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-27 11:51:58
|
Updated AsFer Design Document - Graph Tensor Neuron Network - Word Chains and Chomsky Deep Structure By ka_shrinivaasan on 03/27/2018 11:51 [**View Changes**](https://sourceforge.net/p/asfer/code/1985/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-27 09:23:01
|
Updated AsFer Design Document - MARA based Intrinsic Merit Ranking of Websites By ka_shrinivaasan on 03/27/2018 09:22 [**View Changes**](https://sourceforge.net/p/asfer/code/1984/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-26 12:01:51
|
Updated AsFer Design Document - Recursive Lambda Function Growth - Graph Tensor Neuron Network Intrinsic Merit for Random Walks - Analysis for different text By ka_shrinivaasan on 03/26/2018 12:01 [**View Changes**](https://sourceforge.net/p/asfer/code/1983/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-26 11:51:23
|
Recursive Lambda Function Growth - Graph Tensor Neuron Network Intrinsic Merit for Random Walks - Analysis for different text
--------------------------------------------------------------------------------------------------------------------------
1. Text input for Recursive Lambda Function Growth has been updated
2. Graph Tensor Neuron Network Intrinsic Merit for Lambda Function Composition of Random Walks of Definition Graph have been captured in
log testlogs/RecursiveLambdaFunctionGrowth.log.GraphTensorNeuronNetwork.26March2018
3. Maximum Graph Tensor Neuron Network Intrinsic Merit occurs for Random Walk Composition:
grow_lambda_function3(): Maximum Per Random Walk Graph Tensor Neuron Network Intrinsic Merit :
(u'(housing(protective,(certain(zone,(something(target,(part(include,(urban(area,(Chennai(city,formerly))))))))))))', 6.023684210526316)
4.Top percentile Unsupervised Classes of this text by Dense Subgraph Discovery (Core Numbers) are:
=============================================================================================================
Unsupervised Classification based on top percentile Core numbers of the definition graph(subgraph of WordNet)
=============================================================================================================
This document belongs to class: arsenic ,core number= 16
This document belongs to class: Greenwich_Village ,core number= 14
This document belongs to class: state_of_matter ,core number= 14
This document belongs to class: order ,core number= 14
This document belongs to class: include ,core number= 10
This document belongs to class: part ,core number= 10
This document belongs to class: exploitation ,core number= 9
This document belongs to class: area ,core number= 9
This document belongs to class: three ,core number= 9
This document belongs to class: collector ,core number= 8
This document belongs to class: housing ,core number= 8
This document belongs to class: January ,core number= 8
This document belongs to class: trey ,core number= 8
This document belongs to class: Chennai ,core number= 7
This document belongs to class: urban ,core number= 7
This document belongs to class: planning ,core number= 6
This document belongs to class: zone ,core number= 6
This document belongs to class: free-base ,core number= 6
This document belongs to class: travel ,core number= 6
This document belongs to class: one ,core number= 6
This document belongs to class: target ,core number= 6
This document belongs to class: something ,core number= 6
This document belongs to class: republic ,core number= 6
This document belongs to class: government ,core number= 5
This document belongs to class: legal_power ,core number= 5
----------------------------------------------------------------------
which reasonably coincide with the vertices of the maximum intrinsic merit random walk and capture the Legal/Gubernatorial/Urban planning nature
of the text(though there are WordNet anomalies printing 'arsenic' etc., as classes. These anomalies are caused because usually Urban planning is related to
exploitation and Solid Waste Management which in turn are connected to Toxic substances and Pollutants. WordNet contains all these relations.
Some other Net like ConceptNet5 might probably do better which are word2vec based.
Essence:
--------
Meaning of a text is approximated as:
- Create a Definition Graph Representation of Text from some Ontology
- Do random walks/Hamiltonian on the graph to simulate the human text comprehension
- Get classes of the text from Recursive Gloss Overlap Unsupervised Classifier
- Compute Lambda Composition Trees for all random walks in definition graph
- These random walk lambda composition trees are approximations of all possible meanings of the text
- Compute Graph Tensor Neuron Network Intrinsic Merit for all random walk lambda composition trees
- Lambda Composition Tree of Maximum Graph Tensor Neuron Network Intrinsic Merit is the most likely approximate meaning of the text
- This is obvious because this maximum merit tree has Neuron Tensor Network Relations of maximum similarity/truth value and
these similarities are composed and belief propagated
By ka_shrinivaasan on 03/26/2018 11:51
[**View Changes**](https://sourceforge.net/p/asfer/code/1982/)
---
Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/>
To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-26 09:31:16
|
Updated AsFer Design Document - Multiple Agent Resource Allocation(MARA) and Intrinsic Merit By ka_shrinivaasan on 03/26/2018 09:31 [**View Changes**](https://sourceforge.net/p/asfer/code/1981/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-23 08:41:10
|
Updated AsFer Design Document - Unsorted Search By ka_shrinivaasan on 03/23/2018 08:41 [**View Changes**](https://sourceforge.net/p/asfer/code/1980/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-23 08:38:31
|
Unsorted Search Update - Streaming Abstract Generator File Datasource Support, Prefix-Suffix substrings hashtables ----------------------------------------------------------------------------------------------------------------------------- 1. Hardcoded File name in Streaming Abstract Generator has been replaced by a file name variable and file contents are tokenized and stripped of leading and trailing whitespaces and yielded. 2. Padding of '#' in Unsorted Search has been replaced by '0'. Revised Unsorted Search Algorithm in https://github.com/shrinivaasanka/Grafit/blob/master/course_material/ComputerScienceMiscellaneous/ComputerScienceMiscellaneous_CourseNotes.txt has been implemented by creating hash tables for all integer-string prefixes and suffixes (though not for all substrings) than just for single digits. 3.New function to print contents of all hashtables has been added. 4.Function create_prefix_suffix_hashtables() initializes prefix and suffix hashtables for strings from Streaming Abstract Generator 5.search_number() function has been rewritten to search for all prefixes and suffixes hashtables and match True/False is written 6.New input file First100Primes.txt has been created. 7.Primes and Non-Primes are lookedup and logs has been committed to testlogs/UnsortedSearch.log.23March2018 By ka_shrinivaasan on 03/23/2018 08:38 [**View Changes**](https://sourceforge.net/p/asfer/code/1979/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-21 11:25:52
|
Hardy-Ramanujan Approximate Ray Shooting Queries for Factors - Optimization in Computational Geometric Factorization
----------------------------------------------------------------------------------------------------------------------
1. Ray Shooting Queries based on Hardy-Ramanujan Theorem for Normal Order of number of factors of an integer has been implemented as a
new function.
2. Each approximate factor is queried by a ray from origin of slope tan(m*pi/(2*k*loglogN)) intersecting hyperbolic arc bow and approximate factors are:
sqrt(N/[tan(m*pi/(2*k*loglogN))])-1 for m=1,2,3,...,kloglogN
3. Two integers have been factorized using local tile search and comparison between approximate factors and actual factors have been logged in:
python-src/testlogs/DiscreteHyperbolicFactorizationUpperbound_TileSearch_Optimized.HardyRamanujanRayShootingQueries.log.21March2018
python-src/testlogs/DiscreteHyperbolicFactorizationUpperbound_TileSearch_Optimized.HardyRamanujanRayShootingQueries2.log.21March2018
4. Approximate Ray Shooting could be useful for integers having large value of factor multiplicity BigOmega (sum of prime factor powers)
5. Constant k has been hardcoded presently and has to be heuristically found.
6. Approximate Factors are helpful for sieving huge integers and binary search can be localized based on these approximate factors as beacons.It is
not necessary to search the entire pixelated hyperbolic arc.
By ka_shrinivaasan on 03/21/2018 11:11
[**View Changes**](https://sourceforge.net/p/asfer/code/1976/)
---
Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/>
To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
|
From: asfer S. r. <no...@co...> - 2018-03-21 11:25:02
|
Hardy-Ramanujan Approximate Ray Shooting Queries for Factors - Optimization in Computational Geometric Factorization By ka_shrinivaasan on 03/21/2018 11:16 [**View Changes**](https://sourceforge.net/p/asfer/code/1977/) --- Sent from sourceforge.net because you indicated interest in <https://sourceforge.net/p/asfer/code/> To unsubscribe from further messages, please visit <https://sourceforge.net/auth/subscriptions/> |
2044 messages has been excluded from this view by a project administrator.
