Abstract: A click-to-script service enables developers of big-data job scripts to quickly see the underlying script operations from optimized execution plans. Once a big-data job is received, the disclosed examples compile it and generate tokens that are associated with each operation of the big-data job. These tokens include may include the file name of the job, the line number of the operation, and/or an Abstract Syntax Tree (AST) node for the given operations. An original execution plan is optimized into an optimized execution plan, and the tokens for the original operations of the job script are assigned to the optimized operations of the optimized execution plan. The optimized execution plan is graphically displayed in an interactive manner such that users may view the optimized execution plan and click on its optimized operations to find the original operations of the job script.

Abstract: An apparatus includes an introducer defining an inner volume, a catheter, and a guide member. The having a proximal end portion and a distal end portion, with the catheter defining a lumen extending through the proximal end portion and the distal end portion of the catheter, and with the catheter configured to move between a first position, in which the catheter is disposed within the introducer, and a second position, in which at least the distal end portion of the catheter is distal to the introducer. The guide member is coupled to the introducer, with the guide member defining a lumen. A portion of the catheter is received within the lumen of the guide member when the catheter is in the first position, and the distal end portion of the catheter is distal to the guide member when the catheter is in the second position.

Abstract: A track system includes an attachment assembly including at least one of a first pivot defining a roll pivot axis, a second pivot defining a pitch pivot axis, and a third pivot defining a yaw pivot axis of the track system. A frame assembly is disposed laterally outwardly from the attachment assembly and connected to the attachment assembly. The track system further includes at least one actuator for pivoting the frame assembly about at least one of the roll and yaw pivot axes, and at least one monitoring for determining, at least indirectly, at least one of a state of the track system and a ground surface condition. The at least one monitoring sensor is communicating with a track system controller to control the operation of the at least one actuator based on the at least one of the state of the track system and the ground surface condition.

Abstract: In a set of data analytics queries, at least a one of the queries comprising more than one operator, and each query being at least one of i) a producer of data for an other query in the set, and ii) a consumer of data from an other query in the set. In such examples, one or more computing devices identify each producer/consumer relationship between the queries. The one or more computing devices identify one or more optimizations among the queries based on the identified relationships. The one or more computing devices then apply at least one identified optimization to at least one of the queries.

Abstract: In a set of data analytics queries, at least a one of the queries comprising more than one operator, and each query being at least one of i) a producer of data for an other query in the set, and ii) a consumer of data from an other query in the set. In such examples, one or more computing devices identify each producer/consumer relationship between the queries. The one or more computing devices identify one or more optimizations among the queries based on the identified relationships. The one or more computing devices then apply at least one identified optimization to at least one of the queries.

Abstract: Example aspects include techniques for clustering delete targets for vectorized deletion including retrieving, from a set of delete targets in a distributed database system, a file to be deleted, scanning existing clusters of files marked for deletion to identify at least one existing cluster of files having constraints corresponding to the file, based on identifying the at least one existing cluster of files, adding the file to the at least one existing cluster of files to create a new cluster of files, based on failing to identify the at least one existing cluster of files, creating the new cluster of files including the file, and generating, for each file in the new cluster of files and based on a deletion signal, a delta array including multiple bits representing data items in each file and indicating, based on bit value, target data items to be deleted from each file.

Abstract: Example aspects include techniques for performing vectorized delete operations in a distributed database system including clustering multiple files stored in the distributed database system, and generating, for each of the multiple files and based on a deletion signal, a delta array including multiple bits representing the data items in the file and indicating, based on bit value, the target data items to be deleted from the file. Generating, for each of the multiple files, the delta array can include reading at least one second file shard of multiple second file shards before performing a join operation on at least one first file shard of multiple first file shards is completed.

Abstract: A system, apparatus, and method for thread synchronization is provided. In one embodiment, a network system receives a signal from a first computing machine, and determines whether one or more processes are waiting for the signal. The network system also transmits the signal to one of the one or more processes on the first computing machine or a second computing machine to execute a thread of the process.

Abstract: Solutions for optimizing job runtimes via prediction-based token allocation includes receiving training data comprising historical run data, the historical run data comprising job characteristics, runtime results, and a token count for each of a plurality of prior jobs, and the job characteristics comprising an intermediate representation and job graph data; based at least on the training data, training a token estimator, the token estimator comprising a machine learning (ML) model; receiving job characteristics for a user-submitted job; based at least on the received job characteristics, generating, with the token estimator, token prediction data for the user-submitted job; selecting a token count for the user-submitted job, based at least on the token prediction data; identifying the selected token count to an execution environment; and executing, with the execution environment, the user-submitted job in accordance with the selected token count.

Abstract: A video display system generally includes a computerized media processing unit configured to receive a plurality of content from a plurality of content sources and configured to combine the plurality of content from the plurality of content sources to generate and output a video signal receivable by at least one display device. The video signal includes an interactive multilayer stream, with a plurality of video layers all displayable on the at least one display device simultaneously with independently variable size and position under the control of a user. The content of one of the video layers may be determined based on the content of a different video layer.

Abstract: Shuffling of into partitions by first grouping input vertices of a limited number. Each group of input vertices may then be simply shuffled into a corresponding group of intermediate vertices, such as by broadcasting. A second grouping occurs in which the intermediate vertices are grouped by partition. The intermediate vertices then shuffle into corresponding output vertices for the respective partitions of that group. If the intermediate vertices are still too large, then this shuffling may involve recursively performing the shuffling just described, until ultimately the number of intermediate vertices shuffling into the output vertices is likewise limited. Thus, the final shuffling into the output vertices might also be simply performed by broadcasting.

Abstract: A system, apparatus, and method for thread synchronization is provided. In one embodiment, a network system receives a signal from a first computing machine, and determines whether one or more processes are waiting for the signal. The network system also transmits the signal to one of the one or more processes on the first computing machine or a second computing machine to execute a thread of the process.

Abstract: Systems and methods for content display are disclosed. An example system may include an authentication system configured to receive a request from an application to authenticate the application, and to send an instruction to a content delivery system to provide an application programming interface (API) to the application based on authenticating the application. The content delivery system may be configured to provide the API to the application based on receiving the instruction from the authentication system, to receive a call from the application to the API to display content, and to cause the content to be displayed on a display device based on the call to the API.

Abstract: Systems and methods for gesture recognition and interactive video assisted gambling are disclosed. An example system may include a content layering and mixing system for processing a set of received content streams to produce an interactive, multi-layer content session for display on a device of a user, wherein the set of received content streams includes a gambling content stream. The system may further include an artificial intelligence system to receive input of the user from a camera and to recognize a user gesture. The content layering and mixing system may also take an action relating to the gambling content stream based on the recognized user gesture.

Abstract: Constructing a heavy hitter summary for query optimization. The heavy hitter summary is constructed by sampling each of multiple partitions of a dataset using a uniformed sampling rate. For each partition, performing a two-stage heavy hitter estimation process to determine whether an estimated frequency of a key of the sampled data units may be included in a partition-level heavy hitter summary. Constructing a partition-level heavy hitter summary for each partition of the dataset based on the keys determined via the two-stage process, and constructing a dataset-level heavy hitter summary based on the partition-level heavy hitter summary. The dataset-level heavy hitter summary may be used to optimize query trees.

Abstract: Query optimization using of a query that is compiled into a query tree. The optimization is efficiently performed by using a distinct value estimation data structure (e.g., a KMV synopsis) that represents within an interval distinctness of values that are generated based on data within an interval, even if the resultant data from a subinterval is considered. Various candidate query trees are evaluated, with distinct value generation data structures being propagated for parent nodes based on the distinct value generation data structures of its child node(s). Propagation operations correlate to the operation represented by the parent node in the query tree. The optimizer uses the propagated distinct value estimation structure in order to evaluate the number of distinct values of data that would result from execution of the candidate query tree at least at the corresponding operations (and not just based on the distinct values of the input data).

Abstract: Certain aspects of the present disclosure relate to a technique to configure a data source name (DSN) for use during a data source access. A driver is selected. An identifier is provided that identifies a class, and a library or an application that implements a driver interface for accessing the data source. A connection string is forwarded with the identifier from an implementation of the driver interface to the driver. The connection string is forwarded from the driver to a driver manager managing a client.

Abstract: A system, apparatus, and method for thread synchronization is provided. In one embodiment, a network system receives a signal from a first computing machine, and determines whether one or more processes are waiting for the signal. The network system also transmits the signal to one of the one or more processes on the first computing machine or a second computing machine to execute a thread of the process.

Abstract: Disclosed herein are virtual reality systems and methods. An exemplary video display system includes a computerized media processor configured to receive real time video, initialize a centering mode in response to actions by a user of a virtual reality headset, display on a display screen that a centering mode is initialized, and determine a centered orientation of the user. A portion of video may be extracted from the video based on the centered orientation and combined with an informational overlay for display on the display screen.

Abstract: Constructing a heavy hitter summary for query optimization. The heavy hitter summary is constructed by sampling each of multiple partitions of a dataset using a uniformed sampling rate. For each partition, performing a two-stage heavy hitter estimation process to determine whether an estimated frequency of a key of the sampled data units may be included in a partition-level heavy hitter summary. Constructing a partition-level heavy hitter summary for each partition of the dataset based on the keys determined via the two-stage process, and constructing a dataset-level heavy hitter summary based on the partition-level heavy hitter summary. The dataset-level heavy hitter summary may be used to optimize query trees.