Abstract: This disclosure involves neighboring node discovery in a network. For instance, a neighboring node discovery method includes receiving, at a first node, a neighbor solicitation message. The neighbor solicitation message includes an indication that a second node is a low power device and a first scheduled response time. The method also includes transmitting at the scheduled response time, by the first node, a first neighbor advertisement message. The first neighbor advertisement message includes an indication of no availability in a neighbor cache of the first node and a second scheduled respond time. Further, the method includes removing one or more nodes from the neighbor cache, and receiving, at the first node at the second scheduled response time, a second neighbor solicitation message from the second node indicating availability in the neighbor cache. Additionally, the method includes linking the first node and the second node.

Abstract: Systems for processing requests to use virtual computing resources in communicatively isolated computing environments apply a multi-tier framework for limiting the amount of virtual computing resources that can be allocated to a user in a computing environment. A bottom tier is associated with a user account that has not been analyzed for security risks, a top tier is associated with a user account that has been validated to use a corresponding computing environment; an intermediate tier, having limits between the bottom and top tiers, is applied to computing environments where the user has not requested resources. Initially, all computing environments are on the bottom tier. In response to a valid request for resources, validated computing environments are moved to the top tier and all other computing environments are moved to the intermediate tier. Requests in an intermediate-tier computing environment trigger validity review; the computing environment can move to top tier.

Abstract: Presented herein are traffic pruning techniques that define the pruning at the group level. A software defined network (SDN) controller determines first and second endpoint groups (EPGs) of an SDN associated with the SDN controller. The SDN runs on a plurality of networking devices that interconnect a plurality of endpoints that are each attached to one or more host devices. The SDN controller determines a host-EPG mapping for the SDN, as well as a networking device-host mapping for the SDN. The SDN controller then uses the host-EPG mapping, the networking device-host mapping, and one or more group-based policies associated with traffic sent from the first EPG to the second EPG to compute hardware pruning policies defining how to prune multi-destination traffic sent from the first EPG to the second EPG. The hardware pruning policies are then installed in one or more of the networking devices or the host devices.

Abstract: A system and method for implementing a Quality of Service based upon data deduplication is provided. The method may include deduplicating data and receiving a corresponding I/O request; wherein the data includes an associated dedupe count. The method may further include performing the I/O request based upon the dedupe count. For example, where no deduplication exists as indicated by a dedupe count of zero, the I/O request may be scheduled for processing when the sum of the current clock tick and the tag ratio are less than or equal to the next clock tick. In the alternative, where deduplication exists as indicated by a dedupe count that is greater than zero, the I/O request may be scheduled for processing, when the sum of the current clock tick, a negative value of the dedupe ratio, and the tag ratio are less than or equal to the next clock tick.

Abstract: Disclosed herein are representative embodiments of methods, apparatus, and systems for performing formal verification of circuit descriptions. In certain example embodiments, the disclosed technology involves the formal verification of a register-transfer-level (“RTL”) circuit description produced from a high level synthesis tool (e.g., a C++ or SystemC synthesis tool) relative to the original high level code from which the RTL description was synthesized (e.g., the original C++ or SystemC description) using sub-functional-call-level transactions.

Abstract: The techniques presented herein use dynamic endpoint group (EPG) binding changes to facilitate cross-tenant resource sharing. A first node of a multi-tenant software defined network determines that an application on a first endpoint has initiated operation and needs temporary access to resources located at a second endpoint. The first and second endpoints are associated with first and second tenants, respectively, that are logically segregated from one another by the software defined network. The first node dynamically changes an initial EPG binding associated with the first endpoint to a second EPG binding that enables the first endpoint to temporarily directly access the resources at the second endpoint. The first node subsequently determines that the application on the first endpoint no longer needs access to the resources located at a second endpoint and, as such, changes the second EPG binding associated with the first endpoint back to the initial EPG binding.

Abstract: A network using a routing protocol for low-power and lossy networks (“RPL”) can provide timing information for a next destination oriented directed acyclic graph (“DODAG”) information object (“DIO”) packet by including DIO timing information in an RPL packet or a beacon. When a low energy node receives the RPL packet, it may use the DIO timing information to determine a wake time which corresponds to the timing of the next DIO packet. The low energy node may enter a sleep state after determining the wake time and remain in the sleep state until the wake time when it enters an active state and listens for the next DIO packet. Alternatively, DIO slots in a DIO slot frame may be allocated for communicating DIO packets.

Abstract: Method, system, and program product for measuring audio video synchronization. This is done by first acquiring audio video information into an audio video synchronization system. The step of data acquisition is followed by analyzing the audio information, and analyzing the video information. Next, the audio information is analyzed to locate the presence of sounds therein related to a speaker's personal voice characteristics. In Analysis Phase Audio and Video MuEv-s are calculated from the audio and video information, and the audio and video information is classified into vowel sounds including AA, EE, OO, B, V, TH, F, silence, other sounds, and unclassified phonemes. The inner space between the lips are also identified and determined. This information is used to determine and associate a dominant audio class in a video frame. Matching locations are determined, and the offset of video and audio is determined.

Abstract: A computer implemented method for reducing the Turn around time (TAT) for transcription of audio source file, comprises steps of receiving source audio file and passing the source audio file through integrated Automatic Speech Recognition (ASR) engine and silent node detector for converting the source audio file to output text, improving the output text by machine learning, segmenting the output text file to text chunks at silent nodes, filtering and classifying the segmented text chunks to high confidence score chunks and low confidence score chunks, on basis of predetermined threshold confidence score, distributing the text chunks with low confidence score and corresponding audio chunks to multiple users for correction and merging the corrected text with the text chunks having the high confidence score to obtain a final single text output file that is synchronous with source audio file.

Abstract: The present disclosure provides a method that allows user to select an object on a first device, select a modification in order to modify the object and transferring information so that the modified object may be displayed on another device.

Abstract: A network using a routing protocol for low-power and lossy networks (“RPL”) can provide timing information for a next destination oriented directed acyclic graph (“DODAG”) information object (“DIO”) packet by including DIO timing information in an RPL packet or a beacon. When a low energy node receives the RPL packet, it may use the DIO timing information to determine a wake time which corresponds to the timing of the next DIO packet. The low energy node may enter a sleep state after determining the wake time and remain in the sleep state until the wake time when it enters an active state and listens for the next DIO packet. Alternatively, DIO slots in a DIO slot frame may be allocated for communicating DIO packets.

Abstract: A method and system for conducting meetings, e.g. making it easy for the user to connect his device to the meeting or come to a common shared view of the meeting content. In the method and system, all devices participating in the meeting are located within one physical meeting room. Alternatively, at least some devices are located outside the meeting room. In principle there is no meeting room necessary, but all devices can be distributed anywhere in a region or in the world, and after connection, the meeting content is shared to all physical meeting rooms and remote devices of the system.

Abstract: Systems and methods are provided to aid in planning at least a portion of a total knee arthroplasty procedure. The system and method automatically aligns the implant components and the bones according to a desired clinical alignment goal with minimum user input. The system and method further allows the user to adjust the position and orientation of the femur, tibia, or implant in a clinical direction regardless of a pre-adjusted position and orientation of the femur, tibia, or implant. The graphical user interface is provided that includes a three-dimensional (3-D) view window, a view options window, a patient information window, an implant family window, a workflow-specific tasks window, and a limb and knee alignment measures window.

Abstract: A method of analyzing image data comprises: obtaining a first image of a first part of an object; obtaining a second image of a second part of the object having overlap with the first part; obtaining a mapping between the first and second images; segmenting the second image to obtain a segmentation; detecting outliers in the first image by identifying extreme intensity values of elements within one or more classes of elements on the basis of the segmentation; replacing elements of the second image that correspond to at least some outliers of the first image, with replacement values, to obtain a corrected second image; and updating the segmentation by performing the segmenting on the corrected second image. The detecting outliers, the replacing, and the updating are performed iteratively until a predetermined convergence criterion is met, which represents a point where there is no significant change in the tissue and lesion segmentations.

Abstract: Microsegmentation in a heterogeneous software-defined network can be performed by classifying endpoints associated with a first virtualized environment into respective endpoint groups based on respective attributes, and classifying endpoints associated with a second virtualized environment into respective security groups based on respective attributes. Each respective endpoint group can correspond to a respective security group having the same attribute. Each respective endpoint group and corresponding security group can be associated with a respective policy model defining rules for processing associated traffic. Each of the respective security groups can be used to generate a respective network attribute endpoint group, which can include the network addresses of those endpoints in the respective security group. Each respective network attribute endpoint group can inherit the policy model of the respective endpoint group corresponding to the respective security group.

Abstract: Systems and methods are disclosed for prioritized associations between parent nodes operating on a time-slotted channel hopping (TSCH) network and child nodes installed in one or more home area networks. Upon initialization and bootup, a child node scans for one or more available parent nodes on the TSCH network. If there are less than a threshold number of available parent nodes within communication range of the child node, the child node transmits a prioritized association request to the parent node. The parent node supports prioritized association requests by reserving at least one connection slot for child nodes requesting prioritized association.

Abstract: The disclosed computer-implemented method for modifying track logs during restore processes may include (1) identifying a backup application that maintains a track log used to identify changed blocks during backup operations, (2) detecting a restore process launched by the backup application to restore at least one block backed up in a backup image, (3) retrieving, from the backup image, block information about the block being restored by the restore process, and then (4) recording the block information to the track log during the restore process such that the backup application does not identify the block as changed during a subsequent backup operation due at least in part to the block already being backed up in the backup image. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Systems and methods are disclosed for prioritized associations between parent nodes operating on a time-slotted channel hopping (TSCH) network and child nodes installed in one or more home area networks. Upon initialization and bootup, a child node scans for one or more available parent nodes on the TSCH network. If there are less than a threshold number of available parent nodes within communication range of the child node, the child node transmits a prioritized association request to the parent node. The parent node supports prioritized association requests by reserving at least one connection slot for child nodes requesting prioritized association.

Abstract: Presented herein are traffic pruning techniques that define the pruning at the group level. A software defined network (SDN) controller determines first and second endpoint groups (EPGs) of an SDN associated with the SDN controller. The SDN runs on a plurality of networking devices that interconnect a plurality of endpoints that are each attached to one or more host devices. The SDN controller determines a host-EPG mapping for the SDN, as well as a networking device-host mapping for the SDN. The SDN controller then uses the host-EPG mapping, the networking device-host mapping, and one or more group-based policies associated with traffic sent from the first EPG to the second EPG to compute hardware pruning policies defining how to prune multi-destination traffic sent from the first EPG to the second EPG. The hardware pruning policies are then installed in one or more of the networking devices or the host devices.

Abstract: The disclosed computer-implemented method for restoring data from opaque data backup streams may include (1) initiating a virtual restore of an opaque data backup stream that is designed to be parsed exclusively by a data backup application that created the stream, (2) determining, for each block of data, an original header and tail of the block based on a restored version of the block on the client, (3) sending the original header and tail of the block to a server, (4) creating, at the server, a mapping between a location of the block of data in the stream on the server and the original header and tail of the block, and (5) restoring, without using the data backup application, data in the stream by using the mapping to restore the original headers and tails of the blocks. Various other methods, systems, and computer-readable media are also disclosed.