Tuesday, December 7, 2021
Why Make Code Live
Tuesday, January 15, 2008
For the Love of Good Code
In ALPHA pre-release proto-essence.
Wednesday, December 5, 2007
Code Analysis In Algorithmic Keyword Vector Space
Currently in between alpha, vaporware and minimal release, CodeDub is a beautiful idea with important rapid development and reuse applications.
Thursday, October 18, 2007
CodeDub.Graph
A graph is an abstract representation of data by means of nodes and edges. A node is some point of data, an edge connects two nodes.
- Abstract Graphs and Graph Paths to Genetic Strings
- Sort Genetic Strings By Common Subsequences
- Sort Genetic Strings By Length
- Sort Genetic Strings By Outcome (Cover Same Endpoints)
- Compare Traversal Techniques
It may be useful at this point to consider graphs of more advanced components, pontentially looking at some applied graph instances.
- A phonebook is a graph
- A telephone system is a graph
- State diagrams and parsers are graphs
- driving directions are graphs--maps are graphs
- a recipe is a graph
Graphs are abstract in the degree to which a graph may contain other graphs. A graph may be created with nodes representing unique point pairs in another graph. Yet another graph may consist of nodes representing unique paths between endpoints in the preceeding graph.
Indexing or compressing text or binary information often results in a more graph using edges to connect repeated nodes rather than the linear string representation.
Trees, filesystems, flow charts, networks, databases, communications, AI, security, debugging, computer science use graph traversal algorithms to access nodes and paths, and efficiency analysis to choose or adjust these structures.
Is a node a node and an edge an edge? It so happens that in simple cases, graphs of structured assortments of defined and similar data, nodes and edges may be closely defined. In graphs of more complex objects, in which between nodes a relationship of one kind may describe something different than another, edges should take on characters. For example, consider two node objects A and B. Let us say that A contains a flag bit and also B contains a flag bit. Let us say that each also contain a scalar value. Nodes connecting these of objects could compare flag truth values, greater than/equality of the scalar values, a true logical statement of the flag bits in A relating to the value of B...
A graph may represent a function in source code. A higher order graph may represent a sequence of function calls. Yet another graph may represent allowable or suspicious program states.
Neural networks, markov models, probabilistic counting all rely on graph analysis.
Binary numbers are graph representations of larger unary counts, by means of positional exponential sums.
Many corporate procedures follow rules of order, with specific descriptions of if/then resolution actions.
Medical diagnostics, mechanical troubleshooting, preflight checklists, personal care, all follow a systematic approach to handling problem-solving in domains of inclomplete information.
Saturday, October 13, 2007
Code Dub
CodeDub is code as in the coder, coding, open-source codebase sense. CodeDub is dub code, dubbed CodeDub, because and only because, it is dub Code. Code dub is free to try and priceless. Codedub simply cannot be bought at any price. You may think CodeDub sells for $999.00 per workstation. It does not, but then what is CodeDub if not a workstation ready software package. CodeDub is not for everybody.