Abstract: Systems and methods for an efficient and robust multiprocessor-coprocessor interface that may be used between a streaming multiprocessor and an acceleration coprocessor in a GPU are provided. According to an example implementation, in order to perform an acceleration of a particular operation using the coprocessor, the multiprocessor: issues a series of write instructions to write input data for the operation into coprocessor-accessible storage locations, issues an operation instruction to cause the coprocessor to execute the particular operation; and then issues a series of read instructions to read result data of the operation from coprocessor-accessible storage locations to multiprocessor-accessible storage locations.

Abstract: In an embodiment, a computer-implemented method comprises receiving at a server computer via a data communication network, a plurality of raw sensor data and a plurality of self-report score values from a plurality of mobile computing devices; using the server computer, for a particular mobile computing device from among the plurality of mobile computing devices; calculating a plurality of inference data based upon transformations of the raw sensor data and the plurality of self-report score values; the server computer accessing via the network a patient electronic health record that is associated with a user of the particular mobile computing device; inputting the raw sensor data and the electronic health record to a plurality of trained machine learning models; operating the plurality of trained machine learning models in an inference phase to generate outputs specifying probabilities that a user of the particular mobile computing device would respond above a particular threshold for each item of the patien

Abstract: Techniques are disclosed for improving the throughput of ray intersection or visibility queries performed by a ray tracing hardware accelerator. Throughput is improved, for example, by releasing allocated resources before ray visibility query results are reported by the hardware accelerator. The allocated resources are released when the ray visibility query results can be stored in a compressed format outside of the allocated resources. When reporting the ray visibility query results, the results are reconstructed based on the results stored in the compressed format. The compressed format storage can be used for ray visibility queries that return no intersections or terminate on any hit ray visibility query. One or more individual components of allocated resources can also be independently deallocated based on the type of data to be returned and/or results of the ray visibility query.

Abstract: Techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure with reduced false positive ray intersections are disclosed. The reduction of false positives may be based upon one or more of selectively performing a secondary higher precision intersection test for a bounding volume, identifying and culling bounding volumes that degenerate to a point, and parametrically clipping rays that exceed certain configured distance thresholds.

Abstract: Techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure with reduced false positive ray intersections are disclosed. The reduction of false positives may be based upon one or more of selectively performing a secondary higher precision intersection test for a bounding volume, identifying and culling bounding volumes that degenerate to a point, and parametrically clipping rays that exceed certain configured distance thresholds.

Abstract: To improve the efficiency of bounding volumes in a hardware based ray tracer, we employ a sheared axis-aligned bounding box to approximate an oriented bounding box typically defined by rotations. To achieve this, the bounding volume hierarchy builder shears an axis-aligned box to fit tightly around its enclosed oriented geometry in top level or bottom level space, then computes the inverse shear transform. The bounds are still stored as axis-aligned boxes in memory, now defined in the new sheared coordinate system, along with the derived parameters to transform a ray into the sheared coordinate system before testing intersection with the boxes. The ray-bounding volume intersection test is performed as usual, just in the new sheared coordinate system.

Abstract: Techniques applicable to a ray tracing hardware accelerator for traversing a hierarchical acceleration structure with reduced false positive ray intersections are disclosed. The reduction of false positives may be based upon one or more of selectively performing a secondary higher precision intersection test for a bounding volume, identifying and culling bounding volumes that degenerate to a point, and parametrically clipping rays that exceed certain configured distance thresholds.

Abstract: Systems and methods are disclosed for gesture-initiated actions in videoconferences. In one implementation, a processing device receives content streams during a communication session, identifies a request for feedback within one of the content streams, based on an identification of the request for feedback, processes the content streams to identify one or more gestures within at least one of the content streams, and based on a determination that a first gesture of the one or more gestures is relatively more prevalent across the content streams than one or more other gestures, initiates an action with respect to the communication session.

Abstract: A scheduler for a compute cluster that allocates computing resources to jobs to achieve a balanced distribution. The balanced distribution maximizes the number of executing jobs to provide fast response times for all jobs by, to the extent possible, assigning a designated minimum for each job. If necessary to achieve this minimum distribution, resources in excess of a minimum previously allocated to a job may be de-allocated, if those resources can be used to meet the minimum requirements of other jobs. Resources above those used to meet the minimum requirements of executing jobs are allocated based on a computed desired allocation, which may be developed based on respective job priorities. To meet the desired allocation, resources may be de-allocated from jobs having more than their desired allocation and re-allocated to jobs having less than their desired allocation of resources.

Abstract: A solar mirror panel (10) has a first sheet-like stiffening member (12) having a reflective surface, a second sheet-like stiffening member (18), and a spacer member (16) of resin bonded wood composite located between the first and second members (12, 16).

Abstract: A scheduler for a compute cluster that allocates computing resources to jobs to achieve a balanced distribution. The balanced distribution maximizes the number of executing jobs to provide fast response times for all jobs by, to the extent possible, assigning a designated minimum for each job. If necessary to achieve this minimum distribution, resources in excess of a minimum previously allocated to a job may be de-allocated, if those resources can be used to meet the minimum requirements of other jobs. Resources above those used to meet the minimum requirements of executing jobs are allocated based on a computed desired allocation, which may be developed based on respective job priorities. To meet the desired allocation, resources may be de-allocated from jobs having more than their desired allocation and re-allocated to jobs having less than their desired allocation of resources.

Abstract: A method for conditioning a superabrasive grinding tool having a cutting surface includes truing the grinding tool by moving the cutting surface against a truing device to shape the cutting surface into a preselected profile, and subsequently moving the cutting surface against a sacrificial member so that the binder of the grinding tool is worn down, creating a plurality of spaces between the superabrasive particles. The spaces provide a flowpath for coolant and cutting chips during a subsequent machining process on a workpiece. Localized overheating or “burning” of the workpiece is thus avoided.

Abstract: Described is a system and method for filtering messages received by a message-handling program, that leverage the existing message-handling architecture of computer devices to trigger events and perform other actions instead of (or in addition to) displaying the messages to users. One or more rule clients, e.g., COM objects, register for processing messages. When an appropriate message is received, the message-handling mechanism passes the message to a rule client. Depending on how that rule client responds, the message-handling mechanism determines what to do with the message, e.g., discontinue the message. Messages that are not discontinued are passed to another rule client, if any, or displayed in the user interface, if not. Rule clients may be read only, or may have write access, to modify messages. Messages may be hidden from a user by a rule client, modified before being display to a user, or left intact.