Abstract: Methods, systems, apparatuses, and computer-readable storage mediums described herein are configured to automatically allocate or deallocate computing resources based on a prediction of performance metrics behavior. For instance, the historical behavior of compute metrics (or a time series obtained therefor) is analyzed to detect a seasonality (i.e., a seasonal pattern) and a trend therefor. A prediction of the metrics' behavior for a future time frame is determined based on the seasonality and the trend. Based on the prediction, computing resources are allocated or deallocated at or prior to the future time frame occurring. For example, if a prediction is made that a particular metric will increase, additional compute resources are allocated to handle the increase ahead of the predicted metric increase. If a prediction is made that a particular metric will decrease, compute resources are deallocated at the time the metric is predicted to decrease.

Abstract: Dominant sequences that are representative of logged events can be artificially created. Initially, a graph comprising multiple nodes and edges between pairs of nodes is generated from logged information. The weights, or values, associated with edges are incremented as the log data reveals a temporal relationship between two nodes. Subsequently, a set of candidate trajectories, with each candidate trajectory representing a sequence of events, are generated by repeatedly traversing the generated graph in a random manner by commencing at randomly selected nodes and then proceeding in a random manner to subsequent nodes in accordance with the edge values, for a random quantity of steps. The candidate trajectories are filtered to eliminate those that are impossible or improbable based on a comparison between individual candidate trajectories and the quantity of occurrences within the logs. Scoring is based both on a quantity of occurrences as well as a quantity of steps.

Abstract: Embodiments relate to efficiently performing an inner join on segments from a data source, where the segments have wildcards in join columns. An algorithm for an inner segment join operator may build a location map that describes locations, by segment and column, of values in the join columns of rows in the segments. A map of wildcard locations, by segment and column, may also be constructed. The location map may be supplemented with information from the wildcard map. The data source is scanned and contents of rows in the data source are queried against the location map to join rows with segments that match due to either matching values or wildcard presence. A user interface may be provided to facilitate construction of joins using the inner segment join operator.

Abstract: Embodiments are configured to provide dynamic thresholds for alerting users of anomalous resource usage of computing resources. The dynamic thresholds may be based on the historical behavior of compute metrics (or a time series obtained therefor) associated with the computing resources and a detected seasonality in that time series. The seasonality is detected based on an analysis of several, different time series combinations that are based on the original time series, which advantageously increases the probability of successful seasonality detection. Based on characteristics of the time series, a model for generating dynamic thresholds may be determined. The dynamic thresholds track the detected seasonality of the computing metrics, rather than being a static threshold. As utilization of the computing resources continues, the determined thresholds are applied to the compute metrics. If the determined thresholds are exceeded, an alert indicating an anomalous resource usage may be provided to a user.

Abstract: Dominant sequences that are representative of logged events can be artificially created. Initially, a graph comprising multiple nodes and edges between pairs of nodes is generated from logged information. The weights, or values, associated with edges are incremented as the log data reveals a temporal relationship between two nodes. Subsequently, a set of candidate trajectories, with each candidate trajectory representing a sequence of events, are generated by repeatedly traversing the generated graph in a random manner by commencing at randomly selected nodes and then proceeding in a random manner to subsequent nodes in accordance with the edge values, for a random quantity of steps. The candidate trajectories are filtered to eliminate those that are impossible or improbable based on a comparison between individual candidate trajectories and the quantity of occurrences within the logs. Scoring is based both on a quantity of occurrences as well as a quantity of steps.

Abstract: Dominant sequences that are representative of logged events can be artificially created. Initially, a graph comprising multiple nodes and edges between pairs of nodes is generated from logged information. The weights, or values, associated with edges are incremented as the log data reveals a temporal relationship between two nodes. Subsequently, a set of candidate trajectories, with each candidate trajectory representing a sequence of events, are generated by repeatedly traversing the generated graph in a random manner by commencing at randomly selected nodes and then proceeding in a random manner to subsequent nodes in accordance with the edge values, for a random quantity of steps. The candidate trajectories are filtered to eliminate those that are impossible or improbable based on a comparison between individual candidate trajectories and the quantity of occurrences within the logs. Scoring is based both on a quantity of occurrences as well as a quantity of steps.

Abstract: Embodiments relate to efficiently performing an inner join on segments from a data source, where the segments have wildcards in join columns. An algorithm for an inner segment join operator may build a location map that describes locations, by segment and column, of values in the join columns of rows in the segments. A map of wildcard locations, by segment and column, may also be constructed. The location map may be supplemented with information from the wildcard map. The data source is scanned and contents of rows in the data source are queried against the location map to join rows with segments that match due to either matching values or wildcard presence. A user interface may be provided to facilitate construction of joins using the inner segment join operator.

Abstract: Dominant sequences that are representative of logged events can be artificially created. Initially, a graph comprising multiple nodes and edges between pairs of nodes is generated from logged information. The weights, or values, associated with edges are incremented as the log data reveals a temporal relationship between two nodes. Subsequently, a set of candidate trajectories, with each candidate trajectory representing a sequence of events, are generated by repeatedly traversing the generated graph in a random manner by commencing at randomly selected nodes and then proceeding in a random manner to subsequent nodes in accordance with the edge values, for a random quantity of steps. The candidate trajectories are filtered to eliminate those that are impossible or improbable based on a comparison between individual candidate trajectories and the quantity of occurrences within the logs. Scoring is based both on a quantity of occurrences as well as a quantity of steps.

Abstract: Embodiments disclosed herein are related to determining patterns of related attributes in accessed or received data. Data that is associated with attributes that describe information corresponding to the data is accessed or received. The data is grouped into one or more subsets that include data having matching combinations of the attributes. For each of the subsets, attributes of the combination of attributes associated with the subset are iteratively removed to thereby increase the amount of data included in each subset. After iteratively removing the attributes, each subset is scored to determine one or more patterns related to the combination of attributes.

Abstract: A device for sensing lung sounds, comprising: a piezoelectric sensor comprising an electrical conductive plate attached to a piezoelectric material, said sensor encased in a body structure; a first electric wire connected to the piezoelectric material on the opposite side of said plate; a second electric wire connected to said plate; a connector connected to the other ends of said first and second electric wires; and an adhesive layer connected to the surface of said plate on the side opposite to the piezoelectric material, said adhesive layer facing away from said plate; said device adapted to provide electrical signals representing vibrations present on the surface of a object when it is attached to said object surface with said adhesive layer; said electrical signals resulting from vibrations on the object surface, wherein stress applied on the piezoelectric material generates electrical voltage-difference on both sides of the piezoelectric material, creating voltage build-up on said first and second elect

Abstract: A device for orienting a bone cutting tool with respect to a locking screw hole of an intramedullary nail inserted within a bone is provided. The device includes a device body which is configured with a cutting path for a cutting device and a distal end portion which is adapted for positioning against a surface of the bone. The device also includes an ultrasound probe holder which serves for aligning the cutting path with the screw locking feature using at least one ultrasound signal of at least one ultrasound probe attached to the device.

Abstract: To monitor the execution path of executable code, only non-deterministic jump instructions of the executable code are instrumented by replacing them with respective recording instructions that record the results of executions of the non-deterministic jump instructions and then emulate those executions, thereby providing instrumented code, and the instrumented code is executed. Preferably, the recording instructions are one byte long and invoke an interrupt service routine that does the recording and the emulating. Optionally, selected instructions of the executable code are replaced with trigger instructions for turning the recording on and off. Preferably, after the instrumented code is executed, the addresses of the instrumented instructions and the results of their executions are played back either forward or backward. Optionally, the instrumented code is executed a second time and the results of the executions of the instrumented instructions in the two executions of the instrumented code are compared.

Abstract: An image publishing system provides a distribution mechanism whereby images are forwarded automatically to users in accordance with a set of publication rules. The rules determine which images are to be sent to which users. The images are forwarded to users as they become available on an image archive storage device. This overcomes the requirement of users having to manually request the transmission of each individual image they would like to view. Progressive image streaming techniques employing compression are used to transmit images in encoded layers of increasing accuracy and quality. Means is also provided permitting users to view any image queued for transmission at a publication server, regardless of how much of the image has been received by a client computer. This allows images whose data transmission has not even begun yet to be viewed by a user. A user interrupts the normal background process at any time and requests to view a particular image.

Abstract: An image publishing system provides a distribution mechanism whereby images are forwarded automatically to users in accordance with a set of publication rules. The rules determine which images are to be sent to which users. The images are forwarded to users as they become available on an image archive storage device. This overcomes the requirement of users having to manually request the transmission of each individual image they would like to view. Progressive image streaming techniques employing compression are used to transmit images in encoded layers of increasing accuracy and quality. Means is also provided permitting users to view any image that is queued for transmission at a publication server, regardless of how much of the image has been received by a client computer. Thus, even images whose data transmission has not even begun yet may be viewed by a user. A user interrupts the normal background process at any time and requests to view a particular image.