Abstract: Systems and methods for obtaining product information via a conversational user interface. The communication channel receives communication from a user, the intent and entities of which are deduced by the NLP. These are communicated by the fulfillment API to the knowledge engine which retrieves information that fulfills the intent. The information is communicated to the fulfillment API, which converts the intent into a response, which in turn is forwarded by the NLP to the communication channel, and back to the user.

Abstract: A method to store a data value onto a cache of a storage hierarchy. A range of a collection of values that resides on a first tier of the hierarchy is initialized. The range is partitioned into disjointed range partitions; a first subset of which is designated as cached; a second subset is designated as uncached. The collection is partitioned into a subset of uncached data and cached data and placed into respective portions. The range partition to which the data value belongs (i.e. the target range partition) is identified as being cached. If the cache is full, the target range partition is divided into two partitions, the partition that excludes the data value is designated as uncached; the values therein are evicted. If the cache has space, the data value is copied onto the cache; otherwise the division/eviction are repeated until the cache has space.

Abstract: Systems and methods for computer memory management by a memory coordinator and a plurality of memory consumers. An urgency and memory quota of each memory consumer is initialized by the memory coordinator, which then adjusts the memory quota of each memory consumer such that the sum of the memory quota of each memory consumer does not exceed a finite amount of computer memory. Each memory consumer adjusts its memory usage in response to the quota input and urgency input from the memory coordinator.

Abstract: A method to store a data value onto a cache of a storage hierarchy. A range of a collection of values that resides on a first tier of the hierarchy is initialized. The range is partitioned into disjointed range partitions; a first subset of which is designated as cached; a second subset is designated as uncached. The collection is partitioned into a subset of uncached data and cached data and placed into respective partitions. The range partition to which the data value belongs (i.e. the target range partition) is identified as being cached. If the cache is full all cached range partitions that do not contain the data value are designated as uncached. All values that lie in the cached range partitions designated as uncached are evicted. The data value is then inserted into the target range partition, and copied to the first tier.

Abstract: Systems and methods for features engineering, in which internal and external signals are received and fused. The fusing is based on meta-data of each of the one or more internal signals and each of the one or more external signals. A set of features is generated based on one or more valid combinations that match a transformation input, the transformation forming part of library of transformations. Finally, a set of one or more features is selected from the plurality of features, based on a predictive strength of each feature. The set of selected features can be used to train and select a machine learning model.

Abstract: Systems and methods for dynamic demand sensing in a supply chain in which constantly-updated data is used to select a machine learning model or retrain a pre-selected machine learning model, for forecasting sales of a product at a specific location. The updated data includes product information and geographic information.

Abstract: Methods and systems that provide one or more recommended configurations to planners using large data sets in an efficient manner. These methods and systems provide optimization of objectives using a genetic algorithm that can provide parameter recommendations that optimize one or more objectives in an efficient and timely manner. The methods and systems disclosed herein are flexible enough to satisfy diverse use cases.

Abstract: A query-based isolator comprising an observer, a collator and an extractor. The isolator reduces the database on which the query is run, to a new smaller, database on which the query can be performed, with the same result obtained on the smaller database, as that obtained on the original database.

Abstract: A business analytics conversational tool comprising: a device comprising a communication channel, a natural language processor (NLP), a fulfillment application program interface (F-API), a database application program interface (D-API), and a business management database; wherein: the NLP receives a user-input from a user through the communication channel; the NLP deduces an intent of the user-input; the NLP communicates the intent to the F-API; the F-API communicates a request for data associated with the intent to the database via the D-API; the D-API communicates the data associated with the intent to the F-API; the F-API converts the data associated with the intent to conversational form and sends the conversational form for voice output through the communication channel.

Abstract: A dynamic supply chain planning system for analysis of historical lead time data that uses machine learning algorithms to forecast future lead times based on historical lead time data, weather data and financial data related to locations and dates within the supply chain.

Abstract: A method and system for persisting data are provided. Batch data is periodically extracted via a computer system from at least one primary data source. Batch data is transformed via the computer system. The batch data is loaded, via the computer system, into a database. Real-time data is continuously received from at least one secondary data source. The received real-time data is indexed in an index. Business intelligence reports are generated from both the real-time data in the index and the batch data in the database.

Abstract: Systems and methods for computer memory management by a memory coordinator and a plurality of memory consumers. An urgency and memory quota of each memory consumer is initialized by the memory coordinator, which then adjusts the memory quota of each memory consumer such that the sum of the memory quota of each memory consumer does not exceed a finite amount of computer memory. Each memory consumer adjusts its memory usage in response to the quota input and urgency input from the memory coordinator.

Abstract: A method and system for a machine learning cluster analysis of historical lead time data, which is augmented by one or more features. The data can also be divided into groups, based on time-density of the data, with clustering performed on each group. Furthermore, clustering can also be projected onto two dimensions. In addition, the historical lead time data is separated into a plurality of tolerance zones based on tolerance criteria. The clusters are separated in accordance with a tolerance zone of each group; and further separated according to one or more lead time identifiers to provide one or more separated clusters.

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector hash vector, or “vhash” vector, wherein each element of the vhash vector contains a unique identifier of a data vector, based on a cryptographic hash of the data vector. A header table can store associations between labels and “vhash” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vhash vectors needing that vector, thus saving space.

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector id vector, or “vid” vector, wherein each element of the vid vector contains a reference to the memory location of a data vector. A header table can store associations between labels and “vid” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vid vectors needing that vector, thus saving space.

Abstract: A method to determine if a value is present in a storage hierarchy which comprises initialization of a range of the collection that resides on a first storage device that is in a tier slower than a fastest tier of a storage hierarchy; partitioning the range into disjointed range partitions such that a first subset of the range partitions is designated as cached and a second subset is designated as uncached; partitioning the collection into a subset of uncached data and cached data; copying, the subset of the collection which lies in the one or more cached range partitions into a cache, wherein the cache resides on a second storage device that is in a tier faster than the first storage device; determination of a target range partition to which the value belongs, and determining if the target range partition is cached or uncached.

Abstract: A system and method for flexible pipeline generation. The method includes: generating two or more tasks, the two or more tasks define at least a portion of the pipeline; generating a reconfigurable workflow for defining associations for the two or more tasks, the workflow includes: mapping the output of at least one of the tasks with a culminating output; mapping the input of at least one of the tasks with the output of at least one of the other tasks; and mapping the input of at least one of the tasks with an originating input; and executing the pipeline using the workflow for order of execution of the two or more tasks.

Abstract: A dynamic supply chain planning system for analysis of historical lead time data that uses machine learning algorithms to forecast future lead times based on historical lead time data, weather data and financial data related to locations and dates within the supply chain.

Abstract: A dynamic supply chain planning system for analysis of historical lead time data that uses machine learning algorithms to forecast future lead times based on historical lead time data, and to divide historical lead time data into clusters based on seasonality and linearity. The machine learning results are further processed to adjust future planned lead times and to identify sources in the supply chain that contribute to large deviations between historical planned lead times and actual lead times.

Abstract: A system for memory management that comprises: a computing system having a finite amount of memory and a physical computer readable storage memory readable by a processing circuit and storing instructions for execution by the circuit to: set, by a memory coordinator, the urgency of each memory consumer; adjust, by the memory coordinator, the memory quota of each memory consumer—such that the sum of the memory quota of each memory consumer does not exceed the memory; and adjust, by each memory consumer, its memory usage in response to a quota input and an urgency input from the memory coordinator to the memory consumer. The memory is managed by a memory coordinator and memory consumers; and consumed by the memory consumers. Each memory consumer has: a memory quota, an urgency and a memory usage. Also, the urgency of each memory consumer increases as the sum of the memory usage of the plurality of memory consumers approaches the finite amount of memory.