Abstract: A logical group of data blocks stored in a first node is migrated to a second node according to a method that includes determining a first metric for each logical group of data blocks stored in the first node, the first metric representing a total size of the data blocks in the logical group, determining a second metric for each logical group of data blocks stored in the first node, the second metric representing a total size of the data blocks in the logical group that are uniquely stored in the first node, and selecting a logical group of data blocks for migration from the first node to the second node based on the first metric and the second metric.

Abstract: System and techniques for facet expansion are described herein. A user interface element may be presented on facet selection portion of a search result display including search results. Here, the user interface element is arranged to accept user input of a facet. Partial user input for a facet may be received. A peer entity to an entity corresponding to the facet may be obtained. A peer facet may be presented in a suggestion element in the facet selection portion in response to receiving the partial user input.

Abstract: Data streams may be stored in a chunk store in the form of stream maps and data chunks. Data chunks corresponding to a data stream may be stored in a chunk container, and a stream map corresponding to the data stream may point to the data chunks in the chunk container. Multiple stream maps may be stored in a stream container, and may point to the data chunks in the chunk container in a manner that duplicate data chunks are not present. Techniques are provided herein for localizing the storage of related data chunks in such chunk containers, for locating data chunks stored in chunk containers, for storing data streams in chunk stores in localized manners that enhance locality and decrease defragmentation, and for reorganizing stored data streams in chunks stores.

Abstract: A memory includes error correction circuitry that receives a data packet, outputs a correctable error flag indicating presence or absence of a correctable error in the data packet, and outputs an uncorrectable error flag indicating presence or absence of an uncorrectable error in the data packet. A response manager, operating in availability mode, generates output indicating that a correctable error was present if the correctable error flag indicates presence thereof, and generates an output indicating that an uncorrectable error was present if the uncorrectable error flag indicates presence thereof. In a coverage mode, the response manager generates an output indicating that a correctable error was potentially present but should be treated as an uncorrectable error if the correctable error flag indicates presence of the correctable error, and generates an output indicating that an uncorrectable error was present if the uncorrectable error flag indicates presence thereof.

Abstract: In an example embodiment, a query for search results is received, the query including at least one value for one facet, a facet defining a categorical dimension for the search results. It is then determined that the facet in the query is exclusive. In response to the determination that the facet is exclusive: for each potential facet different from the facet in the query: for each potential value in the potential facet: conditional entropy gain of the value in the query and the potential value is determined. The potential value in the potential facet that has the highest conditional entropy gain is determined, as is the potential facet with the minimum maximum conditional entropy gain. Then the potential facet with the minimum maximum is input into a machine learning model, causing the machine learning model to output one or more suggested facets to add to the query.

Abstract: Data storage system and method for managing transaction requests in the data storage system utilizes prepare requests for a transaction request for multiple data storage operations. The prepare requests are sent to selected destination storage nodes of the data storage system to handle the multiple data storage operations. Each prepare request includes at least one of the multiple data storage operations to be handled by a particular destination data store node and a list of the destination storage nodes involved in the transaction request.

Abstract: A logical group of data blocks stored in a first node is migrated to a second node according to a method that includes determining a first metric for each logical group of data blocks stored in the first node, the first metric representing a total size of the data blocks in the logical group, determining a second metric for each logical group of data blocks stored in the first node, the second metric representing a total size of the data blocks in the logical group that are uniquely stored in the first node, and selecting a logical group of data blocks for migration from the first node to the second node based on the first metric and the second metric.

Abstract: Disclosed in some examples are methods, systems and machine readable medium for recommending an out-of-network communication by determining a set of potential recommended members of a social networking service based upon one or more recommendation criteria. In some examples the recommendation criteria may include: a profile similarity to a previous target of an out-of-network communication, a degree of correspondence between an interest and intent of the sending member, and a likelihood of response.

Abstract: In an example, disclosed is a machine automated method of identifying a set of skills. In some examples, the method includes extracting a plurality of skill seed phrases from a plurality of member profiles of a social networking site, creating a plurality of disambiguated skill seed phrases by disambiguating the plurality of skill seed phrases using one or more computer processors, and de-duplicating the plurality of disambiguated skill seed phrases to create a plurality of de-duplicated skill seed phrases.

Abstract: A method and system for providing account recommendations is disclosed. A server system stores sales data for a first member, wherein sales data includes profile information for one or more individual customers. The server system analyzes the profile information for one or more of the individual customers to identify one attributes associated with the customers. The server system determines one or more additional members with member profiles that include the one or more identified attributes. For a respective additional member in the at least one of the determined additional members the server system determines, based on stored information about the respective additional member, an respective organization associated with the at least one determined additional member; and selects the respective organization as an account recommendation.

Abstract: A method and system for providing lead recommendations are disclosed. A server system stores profile information for a plurality of members of a server system. The server system then analyzes the stored profile information to identify one or more potential sales lead recommendations for a first member of the server system. The server system then ranks the one or more identified potential sales lead recommendations. The server system selects one or more of the identified sales lead recommendations and transmits the selected one or more identified sales lead recommendations to a client device associated with the first member of the server system.

Abstract: Techniques for generating recommendation cluster within a social network service are described. Consistent with some embodiments, sample members in a social network service are identified. The sample members may be associated with prior member activity involving a source member. A cluster category this then selected based on a member attribute shared by a plurality of the sample members. In turn, a recommendation cluster is generated based on the selected cluster category. Generating the recommendation duster may involve selecting member profiles that match the cluster category. The member profiles selected in this way form the recommendation cluster. One or more of the member profiles of the recommendation cluster are then surfaced to a client device operated by the source member.

Abstract: Systems and methods for displaying position sensitive datalink messages on avionics displays are provided. In one embodiment, a flight deck instrument display system for an aircraft comprises: a flight plan display screen that displays a graphical representation of at least a part of an aircraft's planned flight path together with symbology representing a position of the aircraft with respect to the aircraft's planned flight path; wherein the flight plan display screen further displays at least one symbol positioned along the graphical representation of at least a part of the aircraft's planned flight path that indicates a point of applicability for a received uplink datalink message.

Abstract: The present invention provides for a multinucleus yarn manufactured with uniform or substantially uniform distribution of packing density throughout the cross-section of the yarn. The present invention also provides for Terry fabrics (e.g.) towels produced from the manufactured yarn which exhibits enhanced stability of loop structures formed in the towel. Further, the yarn manufactured in accordance with various embodiments of the present invention may also be used for other fabrics for apparels, denims, bed sheets and other end uses as a superior yarn is produced in terms of strength, evenness, hairiness and imperfections.

Abstract: The subject matter described herein is generally directed towards tracking and recovering a disk allocation state. An on-disk log of operations is maintained to describe operations performed to an in-memory partial reference count map. Upon a crash of a host computing device during a checkpoint operation to an on-disk complete reference count map, the on-disk log of operations is used to undo and then redo the operations, or just redo the operations. In this manner, a disk allocation state prior to the crash is recreated in the on-disk complete reference count map with atomicity and crash consistency.

Abstract: Data storage system and method for managing transaction requests to the data storage system utilizes an active write ahead log and a standby write ahead log to apply the transaction requests to a storage data structure stored in a storage system of the data storage system.

Abstract: Embodiments of a method for detection of plurality of three-dimensional cephalometric landmarks in volumetric data are disclosed. In some embodiments, a three-dimensional matrix is developed by stacking of volumetric data and the bony structure is segmented through thresholding. Initially a seed point is searched for initializing the process of landmark detection. Two three-dimensional distance vectors are used to define and obtain the Volume of Interest (VOI). First 3-D distance vector helps to identify Empirical Point and consecutively second gives dimensions of the VOI. Three-dimensional contours of anatomical structure are traced in the estimated VOI. Cephalometric landmarks are identified on the boundaries of traced anatomical geometry, based on corresponding Mathematical Entities. Detected landmark can be used as a Reference Point for further detection of landmarks. Estimating the VOI and detection of points continues till all desired landmarks are detected.

Abstract: Implementations for resilient scheduling of broker jobs for asynchronous tasks in a multi-tenant Platform-as-a-Service (PaaS) system are disclosed. A method of the disclosure includes receiving, by the processing device of a broker of a multi-tenant PaaS system from a user of the multi-tenant PaaS system, a request to complete a job, adding, by the processing device, an entry corresponding to the requested job in a data store of the broker, adding, by the processing device, another entry corresponding to the requested job in a scheduler communicably coupled to the broker, and sending, by the processing device to the user, an acknowledgment of the request and an identifier (ID) of the job, wherein the job is processed asynchronous to the sending of the acknowledgment.

Abstract: Techniques for improving search using generalized linear mixed models are disclosed herein. In some embodiments, a computer-implemented method comprises: receiving a search query comprising at least one search term and being associated with a user; extracting features from corresponding profiles of a plurality of candidates; for each one of the candidates, generating a corresponding score based on a generalized linear mixed model comprising a generalized linear query-based model and a random effects user-based model; selecting a subset of candidates from the plurality of candidates based on the corresponding scores; and causing the selected subset of candidates to be displayed to the user in a search results page for the search query.

Abstract: Provided is a communication method of a node, including receiving a first interest requesting content from a previous node in a content centric network (CCN), generating a first acknowledgment (ACK) message indicating reception of the first interest in response to receiving the first interest, and sending the first ACK message to the previous node. Provided also is a node that includes structure that is suitable to perform such a communication method.