Abstract: Concepts of time-affecting linear pathways (TALPs) decomposed from existing application source code, algorithms, processes, software modules, and functions, are extended. For instance, T-polynomials can be expanded to define when the interaction of high-order polynomials can be treated as if they were linear functions using a new type of T-polynomial. The number of inherent analytics that are extractable from TALPs of an algorithm or source code can be expanded to include the prediction polynomials of advanced time complexity, advanced space complexity, resource complexity, and output complexity along with their inverses. An overlay to the TALP execution pathway is defined, allowing for input variable sensitivity analysis. Further, automatic detection and quantification of context variables are provided for more accurate sensor analysis.

Abstract: Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

Abstract: Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

Abstract: System, methods, and computer programs for executing time-affecting linear pathways (TALPs) using distributed mobile applications as platforms. The systems, methods, and computer programs can use currently unused mobile device compute cycles for commercial-grade computation based on TALPs. TALPs can take the place of software functions, modules, and software applications that are provided for the analysis of customer data. TALPs can be used to perform strong parallel processing.

Abstract: Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

Abstract: Systems, methods, and computer program products are provided for automatically finding, testing, and attaching code directly to software requirements. The requirements can be used to define, find, test and attach files and input/output interface displays to create new software applications.

Abstract: Systems, methods, and computer program products are provided for automatically finding, testing, and attaching code directly to software requirements. The requirements can be used to define, find, test and attach files and input/output interface displays to create new software applications.

Abstract: Systems, methods, and computer programs for providing artificial intelligence from context, artificial emotions, predictive polynomials, and the like. The systems and methods are capable of automatic programming and compute resource allocation. The system can directly interface with humans and any set of devices or sensors that are network accessible. Context is used to decrease the amount of information required from either humans or other systems. The system can learn from other similar systems, other data-generating systems, humans, or raw sensor-detected data streams. The systems and methods use operator-provided goals, received data attributes and values, and the information context to learn and self-modify.

Abstract: Computing and software systems are provided that include one or more mobile devices and one or more system servers. The mobile devices are configured to execute mobile applications, such as direction routing, text messaging, games, mobile apps, etc. These useful mobile applications are considered attractants—attractive applications. The attractive applications can carry a payload consisting of an auto-monetizable application, a cached or hidden application, such that it becomes possible to use some of the billions of idle compute cycles while the attractive application is executing—e.g., to generate funds that are not directly associated with the attractive application.

Abstract: Systems, methods, and computer program products are provided for automatically finding, testing, and attaching code directly to software requirements. The requirements can be used to define, find, test and attach files and input/output interface displays to create new software applications.

Abstract: Computer processing and outcome prediction systems and methods used to generate algorithm time prediction polynomials, inverse algorithm time prediction polynomials, determine race conditions, determine when a non-linear algorithm can be treated as if it were linear, as well as automatically generate parallel and quantum solutions from classical software or from the relationship between monotonic attribute values.

Abstract: Systems, methods, and computer program products are provided for space-time complexity speedup for computer algorithms in terms of processing time as a function of dataset size and type, showing serial, sub-linear, linear and superlinear speedup. Serial and parallel effects can be processed and calculated from a decomposed algorithm's sequential functional components, allowing the identification and use of the parallelizable components.

Abstract: Systems, methods, and computer program products are provided for space-time complexity speedup for computer algorithms in terms of processing time as a function of dataset size and type, showing serial, sub-linear, linear and superlinear speedup. Serial and parallel effects can be processed and calculated from a decomposed algorithm's sequential functional components, allowing the identification and use of the parallelizable components.

Abstract: A multiprocessor system on a chip (MPSoC) implements parallel processing and include a plurality of cores with inter-core communication. This communication is implemented by an on-chip switch fabric in communication with each core, or by shared memory in communication with each core. In another embodiment, a parallel processing system is implemented as a Howard Cascade and uses shared memory for implementing inter-chip communication. The parallel processing system includes a plurality of chips, each formed as an MPSoC, and implements communication between the chips using shared memory.

Abstract: An encryption system and method has processors and a memory system, the memory system configured to hold at least one macroblock, an encryption key, and machine-readable instructions for encrypting the macroblock. The instructions include instructions for dividing the macroblock into subblocks by rows and encrypting the rows, for dividing the macroblock into subblocks by columns and encrypting the columns, and for performing a combining cipher of the cipher blocks to produce a final ciphertext of the macroblock. In alternative embodiments, the macroblock is divided in dimensions in addition to rows and columns. In embodiments, ciphertext is chained by using its ciphertext as part of a key for later macroblocks of a sequence, or propagated into later sequences of macroblocks.

Abstract: Systems, methods, and computer program products are provided for automatically finding, testing, and attaching code directly to software requirements. The requirements can be used to define, find, test and attach files and input/output interface displays to create new software applications.

Abstract: An encryption system and method has processors and a memory system, the memory system configured to hold at least one macroblock, an encryption key, and machine readable instructions for encrypting the macroblock. The instructions include instructions for dividing the macroblock into at subblocks by rows and encrypting the rows, for dividing the macroblock into subblocks by columns and encrypting the columns, and for performing a combining cipher of the first, second, third and fourth cipher blocks to produce a final ciphertext of the macroblock. In alternative embodiments, the macroblock is divided in a third, or fourth dimension in addition to rows and columns. In embodiments, ciphertext is chained by using it ciphertext as part of a key for later macroblocks of a sequence, or propagated into later sequences of macroblocks.

Abstract: System, methods, and software products automatically extract software design from a requirements document. A requirements hierarchical decomposition table is generated from the requirements document defining a plurality of decomposition levels. An initial hierarchical decomposition design having a plurality of decomposition levels based upon the requirements hierarchical decomposition table is generated. Input and/or output parameters for each decomposition level in the hierarchical decomposition design are identified, and a current hierarchical decomposition design is generated based upon the initial hierarchical decomposition graph and the input and/or output parameters.

Abstract: Systems, methods, and computer program products are provided for automatically finding, testing, and attaching code directly to software requirements. The requirements can be used to define, find, test and attach files and input/output interface displays to create new software applications.

Abstract: An encryption system and method has processors and a memory system, the memory system configured to hold at least one macroblock, an encryption key, and machine-readable instructions for encrypting the macroblock. The instructions include instructions for dividing the macroblock into subblocks by rows and encrypting the rows, for dividing the macroblock into subblocks by columns and encrypting the columns, and for performing a combining cipher of the cipher blocks to produce a final ciphertext of the macroblock. In alternative embodiments, the macroblock is divided in dimensions in addition to rows and columns. In embodiments, ciphertext is chained by using its ciphertext as part of a key for later macroblocks of a sequence, or propagated into later sequences of macroblocks.