Abstract: A connected fitness platform can determine members are recognized during a live class or other live event, and seamlessly perform actions in response to or along with the recognition. The platform may determine a user or member is being recognized by an instructor or leader of the class/event, such as by tokenizing usernames and utilizing a semantic database to match or identify members represented by the usernames. The platform may then perform actions for the identified members.

Abstract: A connected fitness platform can determine members are recognized during a live class or other live event, and seamlessly perform actions in response to or along with the recognition. The platform may determine a user or member is being recognized by an instructor or leader of the class/event, such as by tokenizing usernames and utilizing a semantic database to match or identify members represented by the usernames. The platform may then perform actions for the identified members.

Abstract: Systems and methods for secure updating of allocations to user accounts are provided. In one aspect, a system includes one or more computer readable storage mediums having program instructions embodied therewith, and one or more processors configured to cause the system to identify an external institution associated with the future transfers, and initiate, based on the identified external institution, a proxy instance of a software application of the external institution to determine a set of endpoints and a set of the future transfers to the endpoints. The system is further configured to receive a request from a user to change at least one of the set of the endpoints and the set of the further transfers to the endpoints, and use the proxy instance, executing the requested change to at least one of the set of the endpoints or the set of the future transfers to the endpoints.

Abstract: Systems and methods for secure updating of allocations to user accounts are provided. In one aspect, a system includes one or more computer readable storage mediums having program instructions embodied therewith, and one or more processors configured to cause the system to identify an external institution associated with the future transfers, and initiate, based on the identified external institution, a proxy instance of a software application of the external institution to determine a set of endpoints and a set of the future transfers to the endpoints. The system is further configured to receive a request from a user to change at least one of the set of the endpoints and the set of the further transfers to the endpoints, and use the proxy instance, executing the requested change to at least one of the set of the endpoints or the set of the future transfers to the endpoints.

Abstract: A method for compacting data includes storing a first plurality of files at a first datacenter and storing a second plurality of files at a second datacenter. The method also includes generating a parity file that includes parity calculations of the first plurality of files and the second plurality of files. The method includes storing the parity file at a third datacenter. The method also includes receiving a request to delete a first file of the first plurality of files stored at the first datacenter and, in response to the request to delete the first file, compacting the parity file stored at the third datacenter. After compacting the parity file, the method includes determining whether a data compaction cost threshold is satisfied. When the data compaction cost threshold is satisfied, the method includes compacting the first plurality of files stored at the first datacenter.

Abstract: Systems and methods for secure updating of allocations to user accounts are provided. In one aspect, a system includes one or more computer readable storage mediums having program instructions embodied therewith, and one or more processors configured to cause the system to identify an external institution associated with the future transfers, and initiate, based on the identified external institution, a proxy instance of a software application of the external institution to determine a set of endpoints and a set of the future transfers to the endpoints. The system is further configured to receive a request from a user to change at least one of the set of the endpoints and the set of the further transfers to the endpoints, and use the proxy instance, executing the requested change to at least one of the set of the endpoints or the set of the future transfers to the endpoints.

Abstract: The present invention relates to an arrangement for fastening a capacitor cup within which a capacitor is accommodated. The arrangement is for fastening a capacitor cup onto an opening of a mid-plate, wherein the capacitor cup comprises a cylindrical body having an opening end and an opposite end. The arrangement comprises: a collar provided on an outer surface of the cylindrical body, closely around the opening end; at least one first engagement feature formed at the outer surface of the cylindrical body and adjacent to the collar; and, at least one second engagement feature, corresponding to the first engagement feature, formed at an edge of the opening of the mid-plate; wherein, an engagement between the first and second engagement features fastens the capacitor cup onto the opening of the mid-plate.

Abstract: Embodiments described herein are generally directed towards systems and methods relating to a crowd-sourced digital assistant system and related methods. In particular, embodiments facilitate techniques to crowdsource the training of a language model of the crowd-sourced digital assistant system. The digital assistant device can generate new action datasets based on manual inputs detected by the digital assistant device. The manual inputs can be recorded as a set of instructions, which can be interpreted by another digital assistant device to reproduce the detected manual inputs based on a command received by the other digital assistant device. The digital assistant server can receive action datasets, maintain action datasets, and distribute action datasets to one or more digital assistant devices. In various embodiments, the digital assistant device or server can also determine whether received action datasets are related.

Abstract: The present invention relates to an arrangement for fastening a capacitor cup within which a capacitor is accommodated. The arrangement is for fastening a capacitor cup onto an opening of a mid-plate, wherein the capacitor cup comprises a cylindrical body having an opening end and an opposite end. The arrangement comprises: a collar provided on an outer surface of the cylindrical body, closely around the opening end; at least one first engagement feature formed at the outer surface of the cylindrical body and adjacent to the collar; and, at least one second engagement feature, corresponding to the first engagement feature, formed at an edge of the opening of the mid-plate; wherein, an engagement between the first and second engagement features fastens the capacitor cup onto the opening of the mid-plate.

Abstract: A system and method for optimizing multiple invocations of a graphics processing unit (GPU) program in Java. In one embodiment, the system includes: (1) a frontend component in a computer system and configured to compile Java bytecode associated with the a class object that implements a functional interface into Intermediate Representation (IR) code and store the IR code with the associated jogArray and (2) a collector/composer component in the computer system, associated with the frontend and configured to traverse a tree containing the multiple invocations from the result to collect the IR code and compose the IR code collected in the traversing into aggregate IR code when a result of the GPU program is explicitly requested to be transferred to a host.

Abstract: Embodiments described herein are generally directed towards systems and methods relating to a crowd-sourced digital assistant system and related methods. In particular, embodiments facilitate techniques to crowdsource the training of a language model of the crowd-sourced digital assistant system. The digital assistant device can generate new action datasets based on manual inputs detected by the digital assistant device. The manual inputs can be recorded as a set of instructions, which can be interpreted by another digital assistant device to reproduce the detected manual inputs based on a command received by the other digital assistant device. The digital assistant server can receive action datasets, maintain action datasets, and distribute action datasets to one or more digital assistant devices. In various embodiments, the digital assistant device or server can also determine whether received action datasets are related.

Abstract: A system for and method of retrieving values of captured local variables for a lambda function in Java. In one embodiment, the system includes: (1) a Java virtual machine and (2) a captured variable retriever that interacts with the Java virtual machine and configured to retrieve a signature of the lambda function from a classfile of a Java class containing the lambda function, compare the signature with a declaration of the lambda function to identify arguments corresponding to the captured local variables, modify the lambda function and cause the Java virtual machine to execute the modified lambda function.

Abstract: A system for and method of retrieving values of captured local variables for a lambda function in Java. In one embodiment, the system includes: (1) a Java virtual machine and (2) a captured variable retriever that interacts with the Java virtual machine and configured to retrieve a signature of the lambda function from a classfile of a Java class containing the lambda function, compare the signature with a declaration of the lambda function to identify arguments corresponding to the captured local variables, modify the lambda function and cause the Java virtual machine to execute the modified lambda function.

Abstract: A system and method for optimizing multiple invocations of a graphics processing unit (GPU) program in Java. In one embodiment, the system includes: (1) a frontend component in a computer system and configured to compile Java bytecode associated with the a class object that implements a functional interface into Intermediate Representation (IR) code and store the IR code with the associated jogArray and (2) a collector/composer component in the computer system, associated with the frontend and configured to traverse a tree containing the multiple invocations from the result to collect the IR code and compose the IR code collected in the traversing into aggregate IR code when a result of the GPU program is explicitly requested to be transferred to a host.

Abstract: A system and method for optimization of code with non-adjacent loops. A compiler builds a node tree, which is not a control flow graph, that represents parent-child relationships of nodes of a computer program. Each node represents a control flow statement or a straight-line block of statements of the computer program. If a non-adjacent loop pair of nodes satisfy predetermined conditions, the compiler may perform legal code transformations on the computer program and corresponding node transformations on the node tree. These transformations may make adjacent this pair of loop nodes. The compiler may be configured to perform legal code transformations, such as head and tail duplication, code motion, and if-merging, in order to make adjacent these two loop nodes. Then loop fusion may be performed on this loop pair in order to increase instruction level parallelism (ILP) within an optimized version of the original source code.

Abstract: More effective compiler optimizations provide improved cache utilization. The compiler optimizations include a structure layout optimization that leaves the physical layout of the structure fields intact and instead changes the access order to these fields. The compiler optimizations apply to arrays using array remappings analogous to structure layout optimizations in which the array is considered as a structure and the physical layout of the array remains intact and instead the access order to the array changes.

Abstract: Method and system to configure a common set of electronic components using software in order to simulate different electronic, mechanical and/or electro-mechanical instruments or instrument functions. For each instrument function or traditional mode of operation to be simulated, software models are created which when directed to the electronic components, cause the electronic components to respond to input in the same manner that the actual, traditional physical instrument would respond to satisfy the same test requirement input. The software models are preferably stored in a model repository which is searchable to enable a user to select the instrument function or traditional mode of operation to be simulated with the corresponding model being provided to the electronic components. Once the model, i.e., a function for each synthetic element, is downloaded and the electronic components configured according to the model functions, testing of the assemblies or other UUTs can begin.

Abstract: More effective compiler optimizations provide improved cache utilization. The compiler optimizations include a structure layout optimization that leaves the physical layout of the structure fields intact and instead changes the access order to these fields. The compiler optimizations apply to arrays using array remappings analogous to structure layout optimizations in which the array is considered as a structure and the physical layout of the array remains intact and instead the access order to the array changes.

Abstract: Method and system to configure a common set of electronic components using software in order to simulate different electronic, mechanical and/or electro-mechanical instruments or instrument functions. For each instrument function or traditional mode of operation to be simulated, software models are created which when directed to the electronic components, cause the electronic components to respond to input in the same manner that the actual, traditional physical instrument would respond to satisfy the same test requirement input. The software models are preferably stored in a model repository which is searchable to enable a user to select the instrument function or traditional mode of operation to be simulated with the corresponding model being provided to the electronic components. Once the model, i.e., a function for each synthetic element, is downloaded and the electronic components configured according to the model functions, testing of the assemblies or other UUTs can begin.

Abstract: A system and method for optimization of code with non-adjacent loops. A compiler builds a node tree, which is not a control flow graph, that represents parent-child relationships of nodes of a computer program. Each node represents a control flow statement or a straight-line block of statements of the computer program. If a non-adjacent loop pair of nodes satisfy predetermined conditions, the compiler may perform legal code transformations on the computer program and corresponding node transformations on the node tree. These transformations may make adjacent this pair of loop nodes. The compiler may be configured to perform legal code transformations, such as head and tail duplication, code motion, and if-merging, in order to make adjacent these two loop nodes. Then loop fusion may be performed on this loop pair in order to increase instruction level parallelism (ILP) within an optimized version of the original source code.