Abstract: An electronic file migration system has a processor. A memory is coupled to the processor, the memory storing program instructions that when executed by the processor, causes the processor to: migrate files from a first storage system to a second storage system, wherein a first set of files are copied as completed files to the second storage system and a second set of files have symbolic links written on the second storage system directed to the second set of files stored on the first storage system.

Abstract: A method of managing an interaction of a student with a class about a subject, the subject having at least one lesson having at least one topic, the topic having at least one of exposition content, demonstration content and test content, the test content having a query and a scheme for mapping a response to a result, comprising: presenting content to the student and storing the interaction of the student with the content presented.

Abstract: Methods, systems, and computer program products for exercise monitoring and coaching using audio devices are provided herein. A computer-implemented method includes processing a first set of one or more auditory prompts, wherein the first set of auditory prompts pertains to initiation of at least one activity with respect to a user; detecting, in connection with the first set of auditory prompts, one or more sets of movements being performed by the user, wherein said detecting comprises (i) emitting one or more acoustic waves towards the user and (ii) processing reflection of the one or more acoustic waves from the user; classifying, based on said detecting, the one or more sets of movements as one or more predefined exercises; and generating and outputting a second set of auditory prompts to the user, wherein the second set of auditory prompts pertains to the predefined exercises being performed by the user.

Abstract: An enterprise key management server operates in association with a location service that maintains information defining at least one physical boundary of the enterprise. Upon receipt at the key management server of a request that requires release of key material, an additional security check is performed. When the request is received from a GPS-enabled storage device, the key management server queries the location service to determine whether that device is within the boundary. If so, the key material is released. If the requesting device does not provide its location, or if the location service determines that the device is not within the boundary, the key management server fails the request so that the key material is not released. In this manner, the disclosure of the key material to a device that is no longer within the confines of the enterprise, e.g., because it has been stolen, is averted.

Abstract: An improved architecture is provided which enables significant convergence of the components of a system to implement virtualization. The infrastructure is VM-aware, and permits scaled out converged storage provisioning to allow storage on a per-VM basis, while identifying I/O coming from each VM. The current approach can scale out from a few nodes to a large number of nodes. In addition, the inventive approach has ground-up integration with all types of storage, including solid-state drives. The architecture of the invention provides high availability against any type of failure, including disk or node failures. In addition, the invention provides high performance by making I/O access local, leveraging solid-state drives and employing a series of patent-pending performance optimizations.

Abstract: Provided herein are processes for preparing 2-(4-chlorophenyl)-N-((2-(2,6-dioxopiperidin-3-yl)-1-oxoisoindolin-5-yl)methyl)-2,2-difluoroacetamide.

Abstract: Techniques are provided herein for generating PWM signals. Furthermore, a direct-drive method is disclosed in which a PWM signal is generated as a differential signal made up of OUTP and OUTN signals, where OUTP is a copy of OUTN but shifted in time by half a period. The PWM signal is generated by passing each of an input period and an input duty cycle through corresponding sigma-delta circuits to generate a refined period and a refined duty cycle, respectively. In some example cases, a threshold mapper uses a lookup table (LUT) or similar mechanism to select timing thresholds for rise times and fall times for each of the OUTP and OUTN signals, where the timing thresholds are selected based on the refined period and the refined duty cycle. In some example cases, a pulse generator generates the OUTP and OUTN signals based on the timing thresholds.

Abstract: Disclosed is an improved approach for implementing and maintaining writable snapshots. An efficient approach is provided for implementing snapshots that can be used to immediately create snapshots without incurring any detectable delays in providing access to the new snapshots. Also described are improved metadata structures that can be used to implement and maintain the writable snapshots.

Abstract: Embodiments of the present disclosure include a retrofit auxiliary nacelle yaw position control system that enables advanced nacelle yaw position control of a wind turbine by comparing a desired nacelle yaw position signal with the actual nacelle yaw position and generating a virtual relative wind direction signal that is provided to the existing turbine control unit. This method and system enable implementation of wake steering, collective yaw optimization and dynamic yaw optimization of a collection of wind turbines referred to as a wind plant. Modification of the existing turbine control unit is not required, greatly simplifying the implementation process of advanced yaw control strategies on existing wind plants.

Abstract: Systems and methods are disclosed to address inter-cell interference in a heterogeneous network. In one embodiment, a system is disclosed, comprising: a coordinating node situated between a radio access network and a core network; and a first base station in the radio access network in communication with the coordinating node, wherein: the coordinating node has a coordinating scheduler with a first scheduling period; the first base station has a first base station scheduler with a second scheduling period shorter than the first scheduling period; the coordinating scheduler is configured to send a resource reservation list and a resource restriction list to the first base station scheduler once during each first scheduling period; and the first base station is configured to receive the resource reservation list and the resource restriction list and to use the resource reservation list and the resource restriction list when performing mobile device resource scheduling.

Abstract: Techniques are disclosed for allocating shared resources to nodes in a distributed computing network system. Nodes request a lock for each instance of a computing resource (e.g., a virtual IP address associated with a service provided by the distributed computing network system) from a distributed lock manager. The distributed lock manager maintains a queue of requests for each instance of the shared resource. Upon receiving a lock from the distributed lock manager, the receiving node performs a fairness allocation protocol to determine whether to accept the lock. If so determined, the shared computing resources associated with the lock is configured.

Abstract: An electronic system for subdividing an unknown directory tree for execution of operations on directories and files therein has a plurality of computer engines. Each computer engine has a processor. A memory is coupled to the processor, the memory storing program instructions. The program instructions when executed by a processor of a first of the computer engines, causes the processor of the first computer engine to: enumerate a file system comprising directories and files into ordered lists of tasks; subdivide the lists of tasks into a number of subtasks, each of the subtasks being smaller in size than each of the tasks; and deliver the subtasks to a plurality of different computer engines.

Abstract: Transportable storage devices are communicatively coupled behind one or more dedicated “edge” data servers to take advantage of the benefits of the data servers and transportable storage devices while limiting their disadvantages. Each edge data server ingests data from one or more client devices and copies the data to one or more of the transportable storage devices for eventual transport to a cloud data center for upload to a cloud storage system. Multiple versions of a segment of data (e.g., of a file or a blob) are maintained at various points in the disclosed system and the disclosed technology ensures that the most recent version is the version ultimately stored on the cloud storage system.

Abstract: Using an authentication server to program network elements, such as a network node, in accordance with software-defined networking techniques in order to establish a traffic flow rule for a communication device or user of the communication device. After successfully authenticating a communication device or user, the authentication server and/or network node may use an identifier received at the authentication server in connection with the authentication procedure in order to obtain a traffic flow rule for the communication device. The traffic flow rule may be established at the network node or forwarded to a second network node configured to receive network packets from the communication device. The first identifier may be any one of a user identifier identifying a user, an application identifier identifying an application, and a device identifier unique to the communication device.

Abstract: Disclosed is a computer implemented method and system to dynamically adjust prefetch depth, the method comprising, identifying a first prefetch stream, wherein the first prefetch stream is identified in a prefetch request queue (PRQ), and wherein the first prefetch stream includes a first prefetch depth. The method also comprises determining a number of inflight prefetches, and comparing, a number of prefetch machines against the number of inflight prefetches, wherein each of the prefetch machines is configured to monitor one prefetch request. The method further includes adjusting, in response to the comparing, the first prefetch depth of the first prefetch stream.

Abstract: Embodiments of the present disclosure include a data processing and control augmentation system capable of identifying overloading of one or more wind turbine assemblies and providing information to a wind farm controller to reduce a power output of each overloaded turbine. The augmentation system thus reduces the power output of each overloaded turbine and, in turn, reduces loads applied to the wind turbine assembly, such as for a period of time until conditions favorably change. A described analysis of the present disclosure is able to utilize several incoming data streams from sensors so arranged to measure wind effects on blades to calculate and compare cyclic loads to threshold limits to o keep the loads within design limits. The control strategy reduces premature failure of components within the wind turbine assembly, and can be applied across an entire wind farm, even with only a subset of wind turbine assemblies being retrofitted.

Abstract: Disclosed is an improved approach to implement I/O and storage device management in a virtualization environment. According to some approaches, a Service VM is employed to control and manage any type of storage device, including directly attached storage in addition to networked and cloud storage. The Service VM implements the Storage Controller logic in the user space, and can be migrated as needed from one node to another. IP-based requests are used to send I/O request to the Service VMs. The Service VM can directly implement storage and I/O optimizations within the direct data access path, without the need for add-on products.

Abstract: A robotic assistant comprises a plurality of sensors on a mobile chassis. An occupancy map includes obstacle cost values for particular areas or cells of the map. These obstacle cost values may be based on whether an obstacle is detected and the confidence value of that detection, estimated precision of the location of the detected object, and so forth. A set of rules for preferred locations of robot movement is used to assess the occupancy map and to determine constraint cost value for the particular areas. For example, the area in a center of a hallway may be associated with a relatively high constraint cost value. An aggregate cost value may be calculated by summing the obstacle cost value and the constraint cost value for the particular area. The aggregate cost value may be used to determine a maximum permissible speed for the robot while traversing the particular area.

Abstract: Path computation systems and methods are provided herein. According to one embodiment, a method includes obtaining topological information representing a topology of at least a portion of a network. The topological information includes one or more nodes and one or more links, each link configured to connect a node with a neighboring node. Each node includes a plurality of internal components and a plurality of connections configured to interconnect the internal components. The method further includes running path computation through the topological information to determine a plurality of paths from a first internal component to a second internal component. Also, the method includes applying elimination rules during the path computation to filter out one or more paths detected as being invalid. The elimination rules are based on one or more predetermined path sequences that include at least two hops involving an unviable sequence of specific types of internal components.