Abstract: An application mapping procedure obtains and aggregates application mapping information from a plurality of machines in a distributed system. An application dependency map, including first layer of application mapping information, is initialized, and then a first query is sent to one or more of the machines. In response, information identifying entities that have participated in predefined communications with entities identified in an existing layer of application mapping information in the application dependency map are received, and a second layer of application mapping information is added to the application dependency map, based at least in part on the information received in response to the first query. After adding the second layer of application mapping information to the application dependency map, a second query is sent to one or more of the of the endpoint machines, the second query being based at least in part on the application dependency map.

Abstract: In a distributed system that includes a collection of machines, a server system generates a global dictionary from sampling responses received from machines in the collection of machine, at least a subject of the sampling responses including information indicating one or more terms in a corpus of information stored at a respective machine in the collection of machines. The global dictionary includes global document frequency values corresponding to the document frequencies of terms in the corpora of information stored in the collection of machines. The server system generates a similarity search query for a target document, the similarity search query including identifiers of terms in the target document and optionally document frequency information for those terms, obtained from the global dictionary, and sends, through one or more linear communication orbits, the similarity search query to one or more respective machines in the collection of machines.

Abstract: An application mapping procedure obtains and aggregates application mapping information from a plurality of machines in a distributed system. A first layer of application mapping information is generated, identifying application entry points, each comprising a machine and a process executed by the identified machine. An application map is initialized with the first layer of application mapping information. A plurality of iterations of a predefined map gathering operation are performed, each iteration adding a layer of application mapping information to the application map, thereby producing an application map of the distributed processing of one or more respective applications. Each iteration sends queries, via one or more linear communication orbits, to machines in the distributed system, and obtains from the machines information identifying entities that have participated in predefined communications with entities identified in a most recently generated or added layer of application mapping information.

Abstract: In a distributed system, each of N machines receives a similarity search query through a linear communication orbit. The similarity search query includes token identifiers corresponding to tokens in a target document. Each machine, in response, identifies files that meet predefined similarity criteria with respect to the target document. Subsequent to receiving the similarity search query, the machine generates a first report, including a count of files stored at the machine that meet the predefined similarity criteria with respect to the target document, and/or information identifying a set of files that meet the predefined similarity criteria with respect to the target document; and sends the first report to a server through the linear communication orbit. The server produces a merged report presenting information with respect to files at a set of machines, including the N machines, that meet the predefined similarity criteria with respect to the target document.

Abstract: Apparatus and method for indoor localization involving sampling illumination in a location such as a room of a building, producing a frequency domain analysis of the illumination, comparing the frequency domain analysis to a reference frequency domain analysis associated with a reference location, and providing a notification indicating a result of the comparison such as whether the location of the sampling is the reference location.

Abstract: A smart wearable apparatus (102) includes a processor and a memory having a set of instructions that when executed by the processor causes the smart wearable apparatus to receive activity sensor data of an activity performed by a user. Further, the smart wearable apparatus is caused to send the activity sensor data to a content selection device (103) that selects content that is matched to the activity performed by the user so that the content is played in synchronization with the activity. Further, a process receives activity sensor data performed by a user. The process also sends the activity sensor data to a content selection device (103) that selects content that is matched to the activity performed by the user so that the content is played in synchronization with the activity.

Abstract: The present principles generally relate to video processing and viewing, and particularly, to concurrent viewing of a video with other users and processing of user-added, real-time content. The present principles provide capabilities to create a shared video viewing experience which merge concurrent video watching with u user-provided real-time commenting and content. Users watching the same content at the same time may overlay graphical elements on the shared video to communicate with other concurrent viewers of the video. These graphical elements are annotations used to communicate with another viewer, or among a group of viewers, and are overlaid onto the video itself in real time during an interactive session as though the users are in concurrent conversations.

Abstract: In a distributed system, each of N machines receives a similarity search query through a linear communication orbit. The similarity search query includes token identifiers corresponding to tokens in a target document. Each machine, in response, identifies files that meet predefined similarity criteria with respect to the target document. Subsequent to receiving the similarity search query, the machine generates a first report, including a count of files stored at the machine that meet the predefined similarity criteria with respect to the target document, and/or information identifying a set of files that meet the predefined similarity criteria with respect to the target document; and sends the first report to a server through the linear communication orbit. The server produces a merged report presenting information with respect to files at a set of machines, including the N machines, that meet the predefined similarity criteria with respect to the target document.

Abstract: An apparatus comprises a processor configured to play back a first media content segment; determine if a first source media content segment exists in a transition history, which is one of the first media content segment and a segment similar to the first media content segment, the transition history including transitions from at least one source media content segment to at least one destination media content segment; and if the first source media content segment exists, play back a first destination media content segment transitioned from the first source media content segment in the transition history.

Abstract: An apparatus comprises a processor configured to receive first and second ratings of a first segment of a media content respectively from second and third users; assign first and second weights respectively to the first and second ratings according to relationship in a social network between the first and second users and between the first and third users respectively; adjust the first and second ratings using the first and second weights, respectively; combine the adjusted first and second ratings to form the customized rating data of the first segment for the first user; and deliver the customized rating data of the first segment to the first user; and a memory storing the customized rating data.

Abstract: Methods, systems, and devices are described for wireless communications at a wireless device. A wireless device may adaptively select a parity check matrix to increase the reliability of signal transmission by adapting to different channel statistics and channel types (e.g., erasure channels, channels with additive white Gaussian noise, and channels with discrete or continuous alphabets). For example, polarization codes (i.e., codes based on rows of a polarization matrix) may be used to construct parity check matrices “on-the-fly” given an estimation of dynamic channel conditions or diverse channel structures. The channel may be decomposed into polarized sub-channels corresponding to the polarization codes, and mutual information profiles may be determined for each of the polarized sub-channels. The parity check matrix corresponding to the polarization codes may be constructed based on the mutual information profile of all polarized sub-channels.

Abstract: Methods, systems, and devices are described for wireless communications at a wireless device. A wireless device may adaptively select a parity check matrix to increase the reliability of signal transmission by adapting to different channel statistics and channel types (e.g., erasure channels, channels with additive white Gaussian noise, and channels with discrete or continuous alphabets). For example, polarization codes (i.e., codes based on rows of a polarization matrix) may be used to construct parity check matrices “on-the-fly” given an estimation of dynamic channel conditions or diverse channel structures. The channel may be decomposed into polarized sub-channels corresponding to the polarization codes, and mutual information profiles may be determined for each of the polarized sub-channels. The parity check matrix corresponding to the polarization codes may be constructed based on the mutual information profile of all polarized sub-channels.

Abstract: A method segments a video. Audio frames of the video are classified with labels. Dominant labels are assigned to successive time intervals of consecutive labels. A semantic description is constructed for sliding time windows of the successive time intervals, in which the sliding time windows overlap in time, and the semantic description for each time window is a transition matrix determined from the dominant labels of the time intervals. A marker is determined from the transition matrices, in which a frequency of occurrence of the marker is between a low frequency threshold and a high frequency threshold. Then, the video is segmented at the locations of the markers.

Abstract: A computer implemented method detects scene boundaries in videos by first extracting feature vectors from videos of different genres. The feature vectors are then classified as scene boundaries using a support vector machine. The support vector machine is trained to be independent of the different genres of the videos.

Abstract: A computer implemented method detects scene boundaries in videos by first extracting feature vectors from videos of different genres. The feature vectors are then classified as scene boundaries using a support vector machine. The support vector machine is trained to be independent of the different genres of the videos.

Abstract: A method segments a video. Audio frames of the video are classified with labels. Dominant labels are assigned to successive time intervals of consecutive labels. A semantic description is constructed for sliding time windows of the successive time intervals, in which the sliding time windows overlap in time, and the semantic description for each time window is a transition matrix determined from the dominant labels of the time intervals. A marker is determined from the transition matrices, in which a frequency of occurrence of the marker is between a low frequency threshold and a high frequency threshold. Then, the video is segmented at the locations of the markers.