Abstract: Computer systems and software methods can be configured to automatically correlate novice actor preferences of subject matter items (e.g., goods and services) and provider data across multiple platforms, guided by item displayers. The displayers can use novice actor preferences, available items with third-party evaluations, and generative Artificial Intelligence (AI) to guide toward stated goals. The system can automatically generate a list of items, associated with displayer-provided workflow steps, to be matched with preferences. These items can be listed in order based on the AI-determined probability of each meeting novice actor goals. Providers who interact with the system operator can ensure that their goods and services are included within the system.

Abstract: Computer systems and software methods configured to automatically correlate subject matter items and provider data across multiple platforms. These platforms can include newsfeeds, websites, social websites, apps and networks, internet and social network posts, online reviews, online queries, and the like. The system automatically generates a targeted list of relevant subject matter items, associated with entity-provided workflow steps, to be matched with enhanced preferences, and generating a list of options to be presented to the subject matter users or clients. Subject matter items can be listed in order based on third-party reviews, if any, and the best fit for client preferences, with or without associated providers. Subject matter item providers who interact with the system operator can ensure that their goods and services are included within the system.

Abstract: An EMS medical record acquisition system is provided. The system is configured to provide medical record information to an EMS rescuer in a mobile EMS environment. The system includes a user device, a patient identification data source, and a medical record digest system. The digest system is coupled to the user device and to the patient identification source. The digest system receives identification data from the patient identification source, queries a medical record repository using the identification data, receives a medical record for the patient from the medical record repository, generates a reference code based on the identification data, stores the medical record with the reference code, transmits the reference code to the user device, receives a query including the reference code from the user device, generates a digest at least a portion of the medical record, and provides the digest to the user device.

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: The system and methods of the present invention use sensor hardware, software, and connectivity, both between sensors and with occupants of the commercial, private, or public building, for building service utilization and capacity optimization and for personal and mass safety. One or more clusters of different sensor types are deployed in an indoor setting and can be used to nurture, protect, and assist occupants of that indoor setting. The human-centric concepts herein are also shown to be applicable to both medical triage and transportation settings.

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 and methods are presented that automatically construct a directed acyclic graph (DAG) workflow used to control and manage algorithms on multiple, disparate, cloud-based development and deployment platforms. DAG workflows are comprised of a set of simplified, fixed time-affecting linear pathways (STALPs). Algorithms are constructed using no-code/low-code methods that are then automatically decomposed into a set of markup or scripting language time-affecting linear pathways (M-S TALPs). Prediction polynomials that approximate advanced time and space complexity functions are created using M-S TALPs and are used for M-S TALP identification, optimization, efficiency, and performance enhancement on selected computing platforms.

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 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: 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: 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.