Tax day again, the IRS wants one more form and I have bureaucraphobia. The dreaded tax form looms, Egad!
I fear loss of productive time. Soon I start developing systems to make tax forms productive, set dis directory for pdf forms, set up naming conventions, build equivalent spreadsheets. I should be working on join instead. Pareto efficient, another few days with high speed memory testing then everyone is better off, Join is the prototype to escape the giggles and must be widely disseminated.
Monday, October 22, 2018
Sunday, October 21, 2018
Autotraders
The trading bots wants access to the market structure, queue lengths really. Trader bot issues a search graph, pit boss lets it run. Finite, protected, countable, like a byte code for traders. True JSON is a candidate for this search graph. Trader bot brinds its own matching function. Make buy and sell bids right there, inside the instruction cache. Protection is key, calls in and out of join only to trusted miners.
Trade graph preview, by preview bot, will proof read the search graphs then clear them for use. The proof is automatic, an exploration of all possible exits prior to releasing the graph onto a join with market structured queues. All of this, sandbox compatible.
Neural nets
Consider a set of homomorphic, even identically shaped, directed graphs. Each of the graphs distribute results from a feature detector, distributing the results onto their homomorphic cousins. We get a do loop of do loops, all the weightings set properly in the Hopfield net. Most of AI, even the "if/then? networks, can be modeled as a join.
Took a software break and tested the MEM module in a full integration. It seems to be working. I actually did five minutes of tax work, then froze.
Trade graph preview, by preview bot, will proof read the search graphs then clear them for use. The proof is automatic, an exploration of all possible exits prior to releasing the graph onto a join with market structured queues. All of this, sandbox compatible.
Neural nets
Consider a set of homomorphic, even identically shaped, directed graphs. Each of the graphs distribute results from a feature detector, distributing the results onto their homomorphic cousins. We get a do loop of do loops, all the weightings set properly in the Hopfield net. Most of AI, even the "if/then? networks, can be modeled as a join.
Took a software break and tested the MEM module in a full integration. It seems to be working. I actually did five minutes of tax work, then froze.
Imagine a huge dictionary
Organized by category and sub-category, often containing duplicates. Word lists everywhere. Organize them into the massive memory mapped graph. The load this monster into memory, ;lert the users make use of it to read documents, they get the dictionary path collected, the thing has read the words.
Now run raw text against the dictionary. Collect many resultant sets, all of them, possibly overlapping, possibilities. This thing will read, narrow it down to the main point.
Market analysis
Join lets you collect and aggregate large listings, available for multi-level matches. The match function can compute on financials As they refine their searches, they are appending and differentiating on their mast graph. Join at he ready, at the finger tip.
Now run raw text against the dictionary. Collect many resultant sets, all of them, possibly overlapping, possibilities. This thing will read, narrow it down to the main point.
Market analysis
Join lets you collect and aggregate large listings, available for multi-level matches. The match function can compute on financials As they refine their searches, they are appending and differentiating on their mast graph. Join at he ready, at the finger tip.
My memory attachment is as usual
Nested block,m the top of each sequence holds an offset to the end of sequence, and the end point of an open sequence is null, and null maintains a pointer basic to top of sequence. So, intelligent traversal of the graph is simple increment or add (Step or Skip) to get to the next node. The memory attachment designed for high speed matching,. It is the part of the machine we want in the AI chip.
The work flow become:
A join B -> MEM
MEM join C ->MEM
MEM . CONSOLE -> CONSOLE
Unlike normal programming, each of the above lines define a slot in their instance list, each instance a triplet. They can execute independently in any order, or dependently using the pause request.
Combinations of the above with intelligent handlers at the match key function driving the skips and steps. Anywhere in the chain one could introduce the modifier function., and loop. Any of the input may have asynchronous arrivals, using pause, or not/.
Memory preserved, it can do input and output simultaneously, the Null rulekeeps the one from over taking. All sequences in in a valid null, which returns a Done to the join. Attachment can then handle a pause request and let a dependent run. Only the attachment knows that this is only temporary, needs o distinguish the true Done..
The Intelligent Message Router
The device takes an arbitrary stream of test messages, using high speed, multi level word
list matching, it can route the unexpected message to the proper department in a company. The company managers always up to date on the latest. Make the NSA's day with one of these text analyzers.
The work flow become:
A join B -> MEM
MEM join C ->MEM
MEM . CONSOLE -> CONSOLE
Unlike normal programming, each of the above lines define a slot in their instance list, each instance a triplet. They can execute independently in any order, or dependently using the pause request.
Combinations of the above with intelligent handlers at the match key function driving the skips and steps. Anywhere in the chain one could introduce the modifier function., and loop. Any of the input may have asynchronous arrivals, using pause, or not/.
Memory preserved, it can do input and output simultaneously, the Null rulekeeps the one from over taking. All sequences in in a valid null, which returns a Done to the join. Attachment can then handle a pause request and let a dependent run. Only the attachment knows that this is only temporary, needs o distinguish the true Done..
The Intelligent Message Router
The device takes an arbitrary stream of test messages, using high speed, multi level word
list matching, it can route the unexpected message to the proper department in a company. The company managers always up to date on the latest. Make the NSA's day with one of these text analyzers.
My join machine is almost useful
I have it compiling and running under linux environment, I can join an arbitrary list of words against a raw text file.
This is relatively new for a linux utility. It means that I can check raw tect against many word lists and determine the classification of the text, determine what the text is talking about. I do this all from command line and the console, run various word lists against some raw text. Next up, memory graphs and stacking joins.
My method.
I create the following batch file:
set LAZYJ 0 science.txt 1000
set TEXT 1 grammar.txt 10000
set CONSOLE 2
mode 2 All
join
set LAZYJ 0 food.txt 1000
join
set LAZYJ 0 generalwords.txt 1000
join
In this batch file I set the left (slot 0) to LazyJ, which are comma separated list of words. The right is the raw text being searched. The console is set as output so it appears on the screen. The join will spew out any words from the three words list that match words in the raw trest. The output is LazyJ compatible, and in a day or so I will be feeding that into the MEM, memory attachment, and doing further search.
Noticer I set the mode to All, meaning collect all matches. This is a simple batch filer an a crude command interface, but it hjas utility already, the ability to cross reference lists of words against raw text with little set up, from the keyboars even. This is set intersection, just the beginning.
Word lists
For elementary school, the word list is what we use to teach reading. The word lists are all over the web, the join machine can cross reference those list with raw text, and learn to read just like humans. Just like IBM Watson, the core principle.
The join machine will be everywhere, on all the serves. So search bots can take their words list with them, do complicated searches right there, on the server. Everyone needs it.
A quick point about word files
I can create a file manager attachment. It will open a lazy J graph of files, as directed by the match process. When join asks for a fetch, it will open up the file name given in the keyvale and pass the words there is. I can make this automation if I have the 'file' opcoder in lazy J, as in:
(file1:,file2:,...)
I use colon in the example. Or I make a simple attachment. Or I can make a smart attachment, one that reads its own out[put from the cross, and determines which path to select on its graph of word lists, each node expanding into another join.
I am best getting version 1.0 done, with the basic attachments, just enough to manually run recursive search losts. Like the MEM attachment, works fine in standalone, and in pass through, but it ids not really been final tested. That one is key because we want to pass through a million if graphs per session.
Development:
I am now using notepad++ and gcc under minGW for final test and adjust. My development is still on the free Virtual c system, which I find easy for plain c.
This is relatively new for a linux utility. It means that I can check raw tect against many word lists and determine the classification of the text, determine what the text is talking about. I do this all from command line and the console, run various word lists against some raw text. Next up, memory graphs and stacking joins.
My method.
I create the following batch file:
set LAZYJ 0 science.txt 1000
set TEXT 1 grammar.txt 10000
set CONSOLE 2
mode 2 All
join
set LAZYJ 0 food.txt 1000
join
set LAZYJ 0 generalwords.txt 1000
join
In this batch file I set the left (slot 0) to LazyJ, which are comma separated list of words. The right is the raw text being searched. The console is set as output so it appears on the screen. The join will spew out any words from the three words list that match words in the raw trest. The output is LazyJ compatible, and in a day or so I will be feeding that into the MEM, memory attachment, and doing further search.
Noticer I set the mode to All, meaning collect all matches. This is a simple batch filer an a crude command interface, but it hjas utility already, the ability to cross reference lists of words against raw text with little set up, from the keyboars even. This is set intersection, just the beginning.
Word lists
For elementary school, the word list is what we use to teach reading. The word lists are all over the web, the join machine can cross reference those list with raw text, and learn to read just like humans. Just like IBM Watson, the core principle.
The join machine will be everywhere, on all the serves. So search bots can take their words list with them, do complicated searches right there, on the server. Everyone needs it.
A quick point about word files
I can create a file manager attachment. It will open a lazy J graph of files, as directed by the match process. When join asks for a fetch, it will open up the file name given in the keyvale and pass the words there is. I can make this automation if I have the 'file' opcoder in lazy J, as in:
(file1:,file2:,...)
I use colon in the example. Or I make a simple attachment. Or I can make a smart attachment, one that reads its own out[put from the cross, and determines which path to select on its graph of word lists, each node expanding into another join.
I am best getting version 1.0 done, with the basic attachments, just enough to manually run recursive search losts. Like the MEM attachment, works fine in standalone, and in pass through, but it ids not really been final tested. That one is key because we want to pass through a million if graphs per session.
Development:
I am now using notepad++ and gcc under minGW for final test and adjust. My development is still on the free Virtual c system, which I find easy for plain c.
Whoops!
Making fuel from corn produces only 30 percent more energy than it takes to produce the fuel itself, according to the government and corn industry sources (some are even more optimistic, claiming up to 67 percent net energy gain). But a study published in 2005 by Dr. Walter Youngquist, Ph.D., Emeritus Chair of the Department of Geology at the University of Oregon at Portland, said that “Ethanol is a net energy loss — it takes 70 percent more energy to produce than is obtained from the product itself.”Inefficient. This needs to be a pilot project until we get energy inputs down. Algae is the likely efficient source of biofuel, but we are behind in the technology.
Compilers!
gcc was always too strict for me, but I adapt and got all of the compiler warnings out, gone.
Now I can run two compilers, my sloppy one and the strict one, depending upon my mood.
But join now compiles on gcc with no warnings. I will testing it on the minGW linux compatible system under windows.
Saturday, October 20, 2018
My console works!
I can join the console input with another console input, making it easy to test:
console = console join console
The system will just do a read from the keyboard on a fetch, and write on an append. Manually operated databases, makes it easy to test.
console = console join console
The system will just do a read from the keyboard on a fetch, and write on an append. Manually operated databases, makes it easy to test.
More socialism from an NRA gun nut
During a visit to the White House in February, Pollack said, “It is not about gun laws. That is another fight, another battle. Let’s fix the schools and then you guys can battle it out whatever you want. But we need our children safe.”
Sorry for losing your daughter, but why would we prefer more police socialism?
The problem since the beginning was Florida Repubs violating the 'regulated militia' clause, that is violating the Second Amendment. Florida Repubs hand out AR15s to the mentally ill.
The federal government is not going to provide police service for every school. Parents have to decide. If they live in a state that hands out guns to the mentally ill, then put your children in private school. Don't come and tax me because politicians want mass shootings at schools, go talk to the Florida and Texas Repubs who cause the problem.
Subscribe to:
Posts (Atom)