Patent application number | Description | Published |
20080277779 | Microelectronic package and method of manufacturing same - A microelectronic package comprises a substrate ( | 11-13-2008 |
20090001557 | Forming a semiconductor package including a thermal interface material - In one embodiment, the present invention includes a method for placing a thermal interface material (TIM) between a die including a backside metallic (BSM) layer including copper (Cu) and a heat spreader having a contact surface including Cu, where the TIM is formed of an alloy including indium (In) and tin (Sn), and bonding the TIM to the die and the heat spreader to form at least one quaternary intermetallic compound (IMC) layer. Other embodiments are described and claimed. | 01-01-2009 |
20100065246 | Methods of fabricating robust integrated heat spreader designs and structures formed thereby - Methods and associated structures of forming an indium containing solder material directly on an active region of a copper HIS is enabled. A copper indium containing solder intermetallic is formed on the active region of the IHS. The solder intermetallic improves the solder-TIM integration process for microelectronic packaging applications. | 03-18-2010 |
20110312131 | Forming A Semiconductor Package Including A Thermal Interface Material - In one embodiment, the present invention includes a method for placing a thermal interface material (TIM) between a die including a backside metallic (BSM) layer including copper (Cu) and a heat spreader having a contact surface including Cu, where the TIM is formed of an alloy including indium (In) and tin (Sn), and bonding the TIM to the die and the heat spreader to form at least one quaternary intermetallic compound (IMC) layer. Other embodiments are described and claimed. | 12-22-2011 |
Patent application number | Description | Published |
20090327105 | Managing Consistent Interfaces for Business Objects Across Heterogeneous Systems - A business object model, which reflects data that is used during a given business transaction, is utilized to generate interfaces. This business object model facilitates commercial transactions by providing consistent interfaces that are suitable for use across industries, across businesses, and across different departments within a business during a business transaction. In some operations, software creates, updates, or otherwise processes information related to a freight order, a maintenance plan, a maintenance task list, a request for supplier freight quote, and/or a supplier freight quote business object. | 12-31-2009 |
20120109841 | MANAGING CONSISTENT INTERFACES FOR BUSINESS OBJECTS ACROSS HETEROGENEOUS SYSTEMS - A business object model, which reflects data that is used during a given business transaction, is utilized to generate interfaces. This business object model facilitates commercial transactions by providing consistent interfaces that are suitable for use across industries, across businesses, and across different departments within a business during a business transaction. In some operations, software creates, updates, or otherwise processes information related to a freight order, a maintenance plan, a maintenance task list, a request for supplier freight quote, and/or a supplier freight quote business object. | 05-03-2012 |
Patent application number | Description | Published |
20120131025 | SCALABLE CHUNK STORE FOR DATA DEDUPLICATION - 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. | 05-24-2012 |
20120158675 | Partial Recall of Deduplicated Files - The subject disclosure is directed towards changing a file from a fully deduplicated state to a partially deduplicated state in which some of the file data is deduplicated in a chunk store, and some is recalled into the file, that is, in the file's storage volume. A partial recall mechanism such as in a file system filter tracks (e.g., via a bitmap in a file reparse point) whether file data is maintained in the chunk store or has been recalled to the file. Data is recalled from the chunk store as needed, and committed (e.g., flushed) to the file. Also described is efficiently returning the file to a fully deduplicated state by using the tracking information to determine which parts of the file are already deduplicated into the chunk store so as to avoid their further deduplication processing. | 06-21-2012 |
20130060739 | Optimization of a Partially Deduplicated File - The subject disclosure is directed towards transforming a file having at least one undeduplicated portion into a fully deduplicated file. For each of the at least one undeduplicated portion, a deduplication mechanism defines at least one chunk between file offsets associated with the at least one undeduplicated portion. Chunk boundaries associated with the at least one chunk are stored within deduplication metadata. The deduplication mechanism aligns the at least one chunk with chunk boundaries of at least one deduplicated portion of the file. Then, the at least one chunk is committed to a chunk store. | 03-07-2013 |
20140244601 | GRANULAR PARTIAL RECALL OF DEDUPLICATED FILES - The subject disclosure is directed towards partially recalling file ranges of deduplicated files based on tracking dirty (write modified) ranges (user writes) in a way that eliminates or minimizes reading and writing already-optimized adjacent data. The granularity of the ranges does not depend on any file-system granularity for tracking ranges. In one aspect, lazy flushing of tracking data that preserves data-integrity and crash-consistency is provided. In one aspect, also described is supporting granular partial recall on an open file while a data deduplication system is optimizing that file. | 08-28-2014 |
20140280664 | CACHING CONTENT ADDRESSABLE DATA CHUNKS FOR STORAGE VIRTUALIZATION - The subject disclosure is directed towards using primary data deduplication concepts for more efficient access of data via content addressable caches. Chunks of data, such as deduplicated data chunks, are maintained in a fast access client-side cache, such as containing chunks based upon access patterns. The chunked content is content addressable via a hash or other unique identifier of that content in the system. When a chunk is needed, the client-side cache (or caches) is checked for the chunk before going to a file server for the chunk. The file server may likewise maintain content addressable (chunk) caches. Also described are cache maintenance, management and organization, including pre-populating caches with chunks, as well as using RAM and/or solid-state storage device caches. | 09-18-2014 |
Patent application number | Description | Published |
20120197733 | SKILL CUSTOMIZATION SYSTEM - Disclosed herein are methods and systems for customizing content for presentation via a social or business networking service. In some examples, a method may involve an automated mechanism for identifying a plurality of members (e.g., member profiles) to indicate a particular skill possessed by the respective members. Next, the method may involve ranking the plurality of tagged members relative to one another based on a calculated skill level of the particular skill using a computer processor and generating customization information based upon member profile information in the member profiles of the plurality of members with the particular skill and the rankings of the members who possess the particular skill and causing the customization information to be delivered to one of the plurality of members with a particular skill. | 08-02-2012 |
20120197863 | SKILL EXTRACTION SYSTEM - 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. | 08-02-2012 |
20120197993 | SKILL RANKING SYSTEM - In an example disclosed is a method of ranking social networking service member skills by retrieving from non-volatile storage a plurality of member profiles created by a plurality of members of a social networking service, running a text classification algorithm to determine which of the plurality of members possesses a skill that matches any of a plurality of provided skills and associated skill attributes; and for at least one skill of the plurality of provided skills, identifying the plurality of members that possess the skill and ranking the plurality of members relative to one another using a ranking algorithm, the ranking algorithm being based in part upon weighted interactions among the plurality of members that possess the given skill, the weighted interactions comprising endorsements between a first member who possesses the given skill and a second member who possesses the given skill. | 08-02-2012 |
20130031090 | METHODS AND SYSTEMS FOR IDENTIFYING SIMILAR PEOPLE VIA A BUSINESS NETWORKING SERVICE - Techniques for identifying and presenting member profiles similar to a source member profile are described. With some embodiments, a general recommendation engine is used to extract features from member profiles, and then store the extracted features, including any computed, derived or retrieved profile features, in an enhanced member profile. In real-time, the general recommendation engine processes client requests to identify member profiles similar to a source member profile by comparing select profile features stored in the enhanced member profile with corresponding profile features of the source member profile, where the comparison results in several similarity sub-scores that are then combined in accordance with directives set forth in a configuration file. Finally, the member profiles with the highest similarity scores corresponding with the user-selected member profile are selected, and in some instances, presented to a user. | 01-31-2013 |
20130159293 | GENERATING A SUPPLEMENTAL DESCRIPTION OF AN ENTITY - A statistically overrepresented token in the descriptions of users associated with a target entity may be descriptive of the target entity. This may be true regardless of whether a primary description of the entity includes the overrepresented token. Accordingly, the entity description machine may access multiple descriptions of multiple users associated with the target entity. A portion of the multiple descriptions may each include a token descriptive of the target entity and of a subset of the multiple users. The entity description machine may determine that the token is overrepresented among the tokens within the multiple descriptions and generate a supplemental description of the target entity, where the supplemental description includes the overrepresented token. Once the supplemental description is generated, the entity description machine may use the supplemental description in referencing the target entity. | 06-20-2013 |
Patent application number | Description | Published |
20140081928 | SKILL EXTRACTION SYSTEM - 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. | 03-20-2014 |
20140156675 | PRESENTING A USER PROFILE - A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user. | 06-05-2014 |
20140195549 | SUGGESTED OUT OF NETWORK COMMUNICATION RECIPIENTS - 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. | 07-10-2014 |
20140351259 | GENERATING RECOMMENDATION CLUSTERS IN A SOCIAL NETWORK - 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. | 11-27-2014 |
20150081576 | GENERATING A SUPPLEMENTAL DESCRIPTION OF AN ENTITY - A statistically overrepresented token in the descriptions of users associated with a target entity may be descriptive of the target entity. This may be true regardless of whether a primary description of the entity includes the overrepresented token. Accordingly, the entity description machine may access multiple descriptions of multiple users associated with the target entity. A portion of the multiple descriptions may each include a token descriptive of the target entity and of a subset of the multiple users. The entity description machine may determine that the token is overrepresented among the tokens within the multiple descriptions and generate a supplemental description of the target entity, where the supplemental description includes the overrepresented token. Once the supplemental description is generated, the entity description machine may use the supplemental description in referencing the target entity. | 03-19-2015 |
20150120714 | TEMPORAL-BASED PROFESSIONAL SIMILARITY - A system and method for temporal-based professional similarity are provided. In example embodiments, a request to identify, from among a plurality of member profiles of a social network service, a profile that is similar to a source profile, is received. Profile data of the source profile and a candidate profile are accessed from the social network service. Profile features are extracted from the profile data. The profile features include source features extracted from the profile data of the source profile and candidate features extracted from the profile data of the candidate profile. Respective profile features correspond to temporal data included in the profile data. Data structures are generated by structuring the profile features according to the temporal data. The data structures include a source data structure generated using the source features and a candidate data structure generated using the candidate features. A profile similarity score is determined by comparing the candidate data structure with the source data structure. The profile similarity score indicates the similarity between the candidate profile and the source profile. | 04-30-2015 |
20150134745 | METHODS AND SYSTEMS FOR IDENTIFYING MEMBER PROFILES SIMILAR TO A SOURCE MEMBER PROFILE - Techniques for identifying and presenting member profiles similar to a source member profile are described. With some embodiments, a general recommendation engine is used to extract features from member profiles, and then store the extracted features, including any computed, derived or retrieved profile features, in an enhanced member profile. In real-time, the general recommendation engine processes client requests to identify member profiles similar to a source member profile by comparing select profile features stored in the enhanced member profile with corresponding profile features of the source member profile, where the comparison results in several similarity sub-scores that are then combined in accordance with directives set forth in a configuration file. Finally, the member profiles with the highest similarity scores corresponding with the user-selected member profile are selected, and in some instances, presented to a user. | 05-14-2015 |
20150163190 | SUGGESTED OUT OF NETWORK COMMUNICATION RECIPIENTS - 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. | 06-11-2015 |