Abstract: Techniques for estimated compound probability distribution are described. An apparatus may comprise a configuration component, perturbation component, sample generation controller, an aggregation component, a distribution fitting component, and statistics generation component. The configuration component may be operative to receive a compound model specification and candidate distribution definition. The perturbation component may be operative to generate a plurality of models from the compound model specification. The sample generation controller may be operative to initiate the generation of a plurality of compound model samples from each of the plurality of models. The distribution fitting component may generate parameter values for the candidate distribution definition based on the compound model samples. The statistics generation component may generate approximated aggregate statistics. Other embodiments are described and claimed.

Abstract: A method of performing a query on a cube of data is provided. A cube of data is distributed onto a plurality of computing devices with each computing device of the plurality of computing devices storing a different portion of the cube of data. A perturbation rule configured for application to the cube of data and associated with a user is received. A process space associated with the user is created. The received perturbation rule is compiled in association with the created process space. A query on the portion of the cube of data stored at the computing device is received. The received query is associated with the created process space. The query is processed while applying the compiled perturbation rule to data extracted from the portion of the cube of data stored at the computing device. A result of the processed query is sent to a requesting computing device.

Abstract: Systems and methods are provided for combining multiple segmentations into a single unique segmentation that contains attributes of the original segmentations. This new segmentation forms an ensemble or combination segmentation that has a unique set of attributes from the original segmentations without enumerating every possible set of combinations. In one example, two or more segments are combined into a single segmentation using a technique such as k-means clustering or Self-Organizing Map Neural Networks. After the first combination phase is performed, a Bayesian technique is then applied in a second phase to adjust or further alter the ensemble combination of segments.

Abstract: A computer-program product causing a processor component to identify requisite configuration information for executing an application routine by the processor component, wherein the requisite configuration information enables the application routine to communicate with another computing device via a network during execution of the application routine; generate an API that specifies the requisite configuration information to a resource device via the network when the resource device accesses the API via the network; operate a network interface that couples the processor component to the network to make the API accessible to the resource device via the network to enable the resource device to provide the requisite configuration information; and relay the requisite configuration information following provision of the requisite configuration information by the resource device to the application routine for use during execution of the application routine and to a start component to trigger a start of execution of

Abstract: This disclosure provides a computer-program product, system, method and apparatus for accessing a representation of a category or item and accessing a set of multiple transactions. The transactions are processed to identify items found amongst the transactions, and the items are ordered based on an information-gain heuristic. A depth-first search for a group of best association rules is then conducted using a best-first heuristic and constraints that make the search efficient. The best rules found during the search can then be displayed to a user, along with accompanying statistics. The user can then select rules that appear to be most relevant, and further analytics can be applied to the selected rules to obtain further information about the information provided by these rules.

Abstract: A method of determining an optimal value for a control of a drilling operation is provided. Drilling data from a drilling operation is received. The drilling data includes a plurality of values measured for each of a plurality of drilling control variables during the drilling operation. An objective function model is determined using the received drilling data. The objective function model maximizes a rate of penetration for the drilling operation. Measured drilling data is received that includes current drilling data values for a different drilling operation. An optimal value for a control of the different drilling operation is determined by executing the determined objective function model with the measured drilling data that includes the current drilling data values for the different drilling operation as an input. The determined optimal value for the control of the different drilling operation is output.

Abstract: Systems and methods are provided for analyzing unstructured time stamped data of a physical process in order to generate structured hierarchical data for a hierarchical time series analysis application. A plurality of time series analysis functions are selected from a functions repository. Distributions of time stamped unstructured data are analyzed to identify a plurality of potential hierarchical structures for the unstructured data with respect to the selected time series analysis functions.

Abstract: An apparatus includes a discovery component to identify a first application routine within a storage for execution, to identify execution of a remote application routine within a node device as a first requisite for execution of the first application routine from a first application requisites data, and to provide indications of storage of the first application routine and the first requisite to a control master; a start component to restart an earlier started execution of the first application routine in response to receipt of an indication that execution of the remote application routine within the node device has been restarted in accordance with a catalog received from the control master, the catalog including indications of the first and remote application routines and an indication of the first requisite; and a status component to provide an indication to the control master of the restart of execution of the first application routine.

Abstract: Systems and methods are included for accessing resource objects in a multi-threaded environment. A request is received from a requester to perform an operation with respect to a resource object, where the requested resource object has multiple associations with other objects. A determination as to whether an authorization cache entry corresponding to the requested resource object contains sufficient permission data for granting or denying the request for access to the requested resource object is made. A grant or deny of access to the requested resource object is returned when the authorization cache entry corresponding to the requested resource object contains sufficient permission data.

Abstract: Systems and methods are provided for evaluating performance of forecasting models. A plurality of forecasting models may be generated using a set of in-sample data. Two or more forecasting models from the plurality of forecasting models may be selected for use in generating a combined forecast. An ex-ante combined forecast may be generated for an out-of-sample period using the selected two or more forecasting models. The ex-ante combined forecast may then be compared with a set of actual out-of-sample data to evaluate performance of the combined forecast.

Abstract: Systems and methods are provided for analyzing unstructured time stamped data. A first series of user display screens are provided, where the first series of user display screens are configured to be displayed in a step-wise manner so that a user can specify a first approach through a series of predetermined steps on how the unstructured data is to be structured. A second series of user display screens are provided, where the second series of user display screens are configured to be displayed in a step-wise manner so that the user can specify a second approach through the series of predetermined steps on how the unstructured data is to be structured. Tracking data enables alternate viewing of the first and second approach to facilitate a decision whether to format the unstructured time stamped data according to the first approach or the second approach.

Abstract: A method of creating an object store is provided. Node table information reading and link table information are read. The node table information includes node information for a plurality of nodes. The link table information includes link information between pairs of nodes of the plurality of nodes. An anchored network record is created for each node of the plurality of nodes based on the node information and the link information and a defined maximum degree of separation. The anchored network record includes anchor node information associated with an anchor node of the anchored network record and a node record for each node of the plurality of nodes that is within the defined maximum degree of separation from the anchor node of the anchored network record. The created anchored network record is stored for each node of the plurality of nodes.

Abstract: A method of updating a score in a network of linked nodes is provided. Scoring information including a node identifier and a score value for a node in a network of nodes is received. The score value is determined using an analytic model and a parameter value. An anchored network record for which the node is an anchor is identified using the node identifier. A node record for the node is identified in the identified anchored network record. A network score value is computed based on the score value. The identified node record is updated with the score value and the computed network score value. A next anchored network record that includes the node is identified using the node identifier. A second node record for the node is identified in the identified next anchored network record. The second node record is updated based on the updated, identified node record.

Abstract: Various embodiments are generally directed to an apparatus, method and other techniques for receiving a request to generate a bootable image in a cloud-based computing environment, creating a block storage volume in the cloud-based computing environment in response to receiving the request, the block storage volume having one or more partitions. Further, an apparatus, method and so forth may include installing software comprising one or more files in a file system on the block storage volume in the cloud-based computing environment, creating a snapshot of the file system including the software in the cloud-based computing environment, and creating a bootable image from the snapshot of the file system in the cloud-based computing environment.

Abstract: A method of adding a link to a network of linked nodes is provided. Scoring information is received. The scoring information includes a first node identifier, a second node identifier, and a link value. The link value is determined using an analytic model. A first anchored network record for which a first node associated with the first node identifier is an anchor is identified. A first link record is added to the identified first anchored network record using the first node identifier, the second node identifier, and the link value. A first node record associated with the second node identifier is added to the identified first anchored network record. A node record is identified for the first node in the identified anchored network record. A network score value included in the identified node record is computed based on the link value. The identified node record is updated with the computed network score value.

Abstract: Systems and methods for labeling text with alphanumeric identifiers are included. A logging string that includes a block of output text may be determined during program code execution. A computing device may generate a first alphanumeric identifier for the logging string using a hashing algorithm. The computing device may remove a portion of the logging string to determine a modified string. The computing device may generate a second alphanumeric identifier for the modified string using the hashing algorithm. The first alphanumeric identifier and the second alphanumeric identifier are presented with the logging string.

Abstract: Computer-implemented systems and methods are provided for determining an overall mood score of a document. For example, the document is received from a computer-readable medium. A text segment in a document is identified to be indicative of a mood of the document. The text segment is mapped to a mood scale among a predetermined set of mood scales. A mood weight associated with the mood scale for the text segment is generated. An overall mood score of the document is determined based at least in part on the mood weight.

Abstract: Systems and methods are provided for a data processing system having multiple executable threads that is configured to generate a cross-product matrix in a single pass through data to be analyzed. An example system comprises memory for receiving the data to be analyzed, a processor having a plurality of executable threads for executing code to analyze data, and software code for generating a cross-product matrix in a single pass through data to be analyzed. The software code includes threaded variable levelization code for generating a plurality of thread specific binary trees for a plurality of classification variables, variable tree merge code for combining a plurality of the thread-specific trees into a plurality of overall trees for the plurality of classification variables, effect levelization code for generating sub-matrices using the plurality of the overall trees for the plurality of classification variables, and cross-product matrix generation code for generating the cross-product matrix.

Abstract: Various embodiments are generally directed to techniques for increasing the amount of information conveyed per graphical object in graphical presentations of data. A non-transitory machine-readable storage medium includes instructions, that when executed, cause a computing device to determine a major range of values occurring during a major period, the major period including a shorter minor period; and generate a vector graph including a graphical object and an axis indicating a scale. The graphical object may include a major period line parallel to the axis and indicating the major range; and a minor period arrow overlying and pointing in a direction parallel to the length of the major period line, the point and base of the minor period arrow overlying the major period line at locations indicating values at an end and at a start, respectively, of the minor period. Other embodiments are described and claimed.

Abstract: Techniques to search for data elements in a distributed computing environment are described. An apparatus may comprise a processor and a memory unit communicatively coupled to the processor. The memory unit may store a correlation module that when executed by the processor is operative to determine a target rank position at a target percentile rank within a total data set. The correlation module may determine a target data item at the target rank position for the total data set using candidate data items at candidate rank positions for each of multiple sorted data subsets of the total data set, and correlation values associated with each of the candidate data items. Other embodiments are described and claimed.