Abstract: Systems, methods, and machine-readable and executable instructions are provided for error developer association. Error developer association can include identifying a number of portions of the source code associated with a message, wherein the message is associated with an error. Error developer association can also include associating a developer with a portion of the source code of the number of portions of the source code. Error developer association can also include identifying a developer of the number of developers to resolve the error.

Abstract: Examples herein involve generating a spiral visualization of items of a dataset. Dimensions of item indicators corresponding to items of a dataset are analyzed. Starting coordinates for a spiral path for a spiral visualization of the items are determined based on the dimensions of the item indicators and a display area of a display device. A spiral path may be calculated based on the starting coordinates and the dimensions of the item indicators. The spiral visualization may be generated by rendering the item indicators on the spiral path to present a first item indicator of the item indicators from a corresponding first item of the list at the starting coordinates and a last item indicator of the item indicators of a corresponding last item on the list on the spiral path toward the center of the spiral.

Abstract: A test-centric model of an application is constructed. Each resource specified by each test governing an application is added to the test-centric model. The test or tests specifying an resource are linked to the resource within the test-centric model. A composition of the application is defined using the one or more tests, as the resources specified by the one or more tests, within the test-centric model of the application.

Abstract: Examples for graph database management comprise a graph database system including a graph processor engine to receive a graph database update from an application, a graph navigation query engine to access a real-time graph and process the graph database update on the real-time graph, and a synchronization engine to extract changes from the real-time graph and process the changes to a derived graph view and to a historical graph. Examples for managing a graph database also include receiving a graph query, determining a graph query type, and in the event that the graph query type is a navigational short query type, accessing a real-time graph on a graph navigation query engine and processing the navigation short query, and in the event that the graph query type is an analytical long query type, accessing a historical graph on a graph analytic query engine and processing the analytical long query.

Abstract: According to an example, dynamic build pipeline execution may include extracting a pipeline flow related to build jobs, and generating, by using the extracted pipeline flow, a pipeline model that includes a plurality of pipelines related to the pipeline flow. Each pipeline of the plurality of pipelines may represent a set of related build jobs, and include an entry point to access the set of related build jobs. Dynamic build pipeline execution may further include generating another model related to the pipeline model to execute a build job of the set of related build jobs for a pipeline of the plurality of pipelines based on a parameter specified for the another model.

Abstract: Visualizing conditions of information technology environment includes creating a visual with an initial unit set and an interactive section, each unit in the initial unit set depicting at least two types of information about at least one current condition in the information technology environment and changing the visual in response to commands from the interactive section to reveal data about the information technology environment.

Abstract: Evaluating documentation coverage can include identifying, from a testing tool having exercised an application, interface elements of the application's user interface. The identified interface elements are filtered to identify documentable interface objects. For each identified documentable interface object, it is determined if documentation exists for that documentable interface object. A value, indicative of the determined existence or non-existence of documentation, is assigned to each documentable interface object. Documentation coverage data is reported for the application interface. The coverage data is reflective of the values assigned to the documentable interface objects.

Abstract: Extending a feature includes receiving a feature extension request from a first device identifying a feature not natively available to the first device. From a pool of registered devices, a second device offering the requested feature is identified. A communication link via which the requested feature can be extended to the first device is initiated. The extending of the requested feature from the second device to the first device is facilitated.

Abstract: A method performed by a processing system includes reconstructing a metadata tree of a patient from a metadata tree journal, the metadata tree including a plurality of references to a corresponding plurality of encrypted electronic health records of the patient in an encrypted data store, and validating the metadata tree by comparing first integrity information of the metadata tree to second integrity information corresponding to the metadata tree journal provided by a metadata integrity validator.

Abstract: Pattern discovery performed on event data may include selecting an initial set of parameters for the pattern discovery. The parameters may specify conditions for identifying a pattern in the event data. A pattern discovery run is executed on the event data based on the initial set of parameters, and a parameter may be adjusted based on the output of the pattern discovery run.

Abstract: An object may be identified, if each measured value of a characteristic of the object is within a corresponding range of a set of characteristics. The object may then be classified as a true alarm or false alarm by a user. Next, the measured values of the object may be added as a data point to a set of data points. Each of data points is along a plurality of dimensions and each of the dimensions corresponds to one of the set of characteristics. Further, each of the data points has been classified as a true alarm or false alarm. The range of the set of characteristics may be updated to reduce a weighted score based on a number of the true alarms that are outside a region along the plurality of dimensions and a number of the false alarms inside the region for the set of data points. The region is defined based on numerical analysis of the set of data points. The weighted score may provide separate weights to the true alarms outside the region and the missed alarms inside the region.

Abstract: A method for encrypting a message is described in which a public key and a private key are generated. The public key is encrypted using a shared symmetric key shared with an agent. The private key is encrypted using a private symmetric key. The encrypted public key is sent to the agent and decrypted by the agent with the shared symmetric key. A message encrypted with the shared symmetric key is received from the agent, and is decrypted using the shared symmetric key.

Abstract: Methods and apparatus are disclosed to generate software test script from video. Example methods disclosed herein include determining a user action in a frame of a video comprising recorded testing of software. The example method also includes identifying an action parameter corresponding to the user action. The example method also includes based on the action parameter, generating without user intervention a script to execute on the software.

Abstract: Examples relate to providing distributed compilation of statically typed languages. In some examples, first order dependencies of a target module are identified, where each of the first order dependencies is associated with one of a number of dependent modules. Next, each first order dependency of is traversed to remove code references from source code of a corresponding module of the plurality of dependent modules, where each of the code references refers to a type defined in an indirect dependency of the target module, and compile the source code of the corresponding module to generate a module stub of a number of module stubs. At this stage, source code of the target module is compiled using the module stubs to generate a target program.

Abstract: According to an example, a master node is to divide an event field in events into partitions including ordered contiguous blocks of values for the event field. Each partition may be assigned to a pair of cluster nodes. A partition map is determined from the partitions and may identify for each partition, the block of the event field values for the partition, a primary cluster node, and a failover cluster node for the primary cluster node.

Abstract: One embodiment is a method for injecting data into a software application. The method displays a plurality of different controls of a software application and receives a single selection of data stored in a data source. In response to this selection, the method injects the data from the data source into the plurality of different controls of the software application.

Abstract: An automatic physical-layout designer for a database-management system determines the database's physical layout from a set of training queries, the database's logical design, and a parameter k that indicates how many storage nodes can be lost without losing access to any of the data. The designer lays the database out as a column store such that the stored columns constitute redundant projections on the system's different storage nodes. It repeatedly identifies a projection, whose addition to the design will result in the greatest performance improvement for the training queries. In doing so, it takes into account the different compression formats to which the different projections lend themselves. When a projection has been identified as one to be added, it is added on one node, and k projections having the same columns are added to other nodes. The designer continues thus adding projections until a space budget has been reached.

Abstract: Example implementations relate to updating an inference graph absent node locking. For example, a processor executing a first thread may receive a first task for updating a node of an inference graph stored by a storage device accessible to a second thread, the first task being assigned during a first iteration of a graph update loop. Absent locking the node from access by the second thread, the processor may generate a value for the node and update the node with the value. Based on detecting that each node of the inference graph has been updated, the processor may continue with a second iteration of the graph update loop.

Abstract: In one implementation, a system for user action duration includes a monitor engine to monitor a number of async operations to be loaded on a user interface, a detection engine to determine a repeating async operation from the number of async operations that has a pattern of repeating timeouts, a removal engine to remove the repeating async operation from the number of async operations, and a calculation engine to calculate a total time for the remaining number of async operations based on a total timeout of each of the remaining number of async operations.

Abstract: A method and a system of generating a non-deterministic model of an artifact system for a received goal are provided. A description of artifacts and services associated with an original version of a process is received. Component automata represent the artifacts and services that are automatically generated. There is one component automaton for each attribute of an artifact. States of a particular component automaton represents potential values of a particular attribute and transitions between the states represent services that operate on the values. A non-deterministic model of the process is generated by automatically generating a composite automaton, which includes the component automata, based on the received goal. The composite automaton provides the non-deterministic model of the process.