Abstract: Systems and methods are disclosed for generating one or more hardware reference keys (HRK) on a computing device, and for attesting to the validity of the hardware reference keys. An initial hardware reference key can be a silicon attestation key (SIK) generated during manufacture of a computing system, such as a system-on-a-chip. The SIK can comprise an asymmetric key pair based at least in part on an identifier of the processing system type and a unique identifier of the processing system. The SIK can be signed by the computing system and stored thereon. The SIK can be used to generate further HRKs on the computing device that can attest to the processing system type of the computing device and an operating system version that was running when the HRK was generated. The computing device can generate an HRK attestation (HRKA) for each HRK generated on the computing system.

Abstract: An online system receives information describing a target group of online system users from a third party system that includes one or more user properties, which may identify an action performed by a an online user within a time interval to include the user in the target group. When an opportunity to present advertisement requests to a user is identified, the online system retrieves actions associated with the user and times associated with the actions. If an action associated with the user matches the action identified by the user properties and occurred within the time interval identified by the user properties, and other characteristics of the user satisfy at least a threshold number of the user properties, the online system includes the user in the target group. Advertisement requests having targeting criteria, including the target group, satisfied by characteristics of the user are evaluated for presentation to the user.

Abstract: A system and method for detecting replay attacks on secure data are disclosed. A system on a chip (SOC) includes a security processor. Blocks of data corresponding to sensitive information are stored in off-chip memory. The security processor uses an integrity data structure, such as an integrity tree, for the blocks. The intermediate nodes of the integrity tree use nonces which have been generated independent of any value within a corresponding block. By using only the nonces to generate tags in the root at the top layer stored in on-chip memory and the nodes of the intermediate layers stored in off-chip memory, an amount of storage used is reduced for supporting the integrity tree. When the security processor detects events which create access requests for one or more blocks, the security processor uses the integrity tree to verify a replay attack has not occurred and corrupted data.

Abstract: A flow sensor for pulmonary function testing is provided, and the flow sensor is capable of preventing cross-infection and has a hollow tubular structure. The flow sensor includes a main breather tube and a pressure tapping hole arranged on a tube wall of the main breather tube. An outer wall of the main breather tube is provided with a pressure tapping stub in air communication with the pressure tapping hole. The volume of an inner cavity of the pressure tapping stub satisfies following condition: during the pulmonary function testing, air exhaled or inhaled by a tester enters the pressure tapping stub through the pressure tapping hole and is kept within the pressure tapping stub without contacting a connection pipeline outside of the flow sensor. The flow sensor can isolate contaminants, i.e., bacteria or viruses and prevent the contaminants from entering other connection pipelines or cavities of a pulmonary function instrument.

Abstract: A system and method for detecting replay attacks on secure data are disclosed. A system on a chip (SOC) includes a security processor. Blocks of data corresponding to sensitive information are stored in off-chip memory. The security processor uses an integrity data structure, such as an integrity tree, for the blocks. The intermediate nodes of the integrity tree use nonces which have been generated independent of any value within a corresponding block. By using only the nonces to generate tags in the root at the top layer stored in on-chip memory and the nodes of the intermediate layers stored in off-chip memory, an amount of storage used is reduced for supporting the integrity tree. When the security processor detects events which create access requests for one or more blocks, the security processor uses the integrity tree to verify a replay attack has not occurred and corrupted data.

Abstract: The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).

Abstract: The present invention extends to methods, systems, and computer program products for computing features of structured data. Aspects of the invention include computing features of table components (e.g., of rows, columns, cells, etc.). Computed features can be used for ranking the table components. When aggregated, features for different components of a table can be used for ranking the table (e.g., a web table).

Abstract: The present invention extends to methods, systems, and computer program products for refining structured data indexes. Aspects of the invention include associating structured data, such as, for example, tables, with additional content. Additional content can include content outside the <table> and </table> tags of a web table. Indexes for structured data (e.g., table indexes) can be refined based on the additional content to improve the relevance of providing parts of the structured data (e.g., parts of the table) in search results.

Abstract: A data service system is described herein which processes raw data assets from at least one network-accessible system (such as a search system), to produce processed data assets. Enterprise applications can then leverage the processed data assets to perform various environment-specific tasks. In one implementation, the data service system can generate any of: synonym resources for use by an enterprise application in providing synonyms for specified terms associated with entities; augmentation resources for use by an enterprise application in providing supplemental information for specified seed information; and spelling-correction resources for use by an enterprise application in providing spelling information for specified terms, and so on.

Abstract: The present invention extends to methods, systems, and computer program products for annotating structured data for search. Aspects of the invention include associating structured data, such as, for example, tables, with additional content to improve indexing of the structured data for search and/or provide improved search results for structured data. Web pages can include tables as well as other content. The other content in a web page, such as, for example, content outside the <table> and </table> tags of a web table, can be useful in supporting searches for web tables. Content in one web page can also be useful in supporting searches for a table in another web page.

Abstract: The present invention extends to methods, systems, and computer program products for ranking tables for keyword search. Aspects of the invention include generating lists of candidate tables for inclusion in a search query response, computing table hit matrices, retrieving content from fields of candidate tables having keyword hits, generating ranking features of tables, and computing ranking scores for tables. Aspects of the invention can be used to match keywords against column names, to match keywords against values in subject and non-subject columns, and to match keywords against table descriptions like page titles, table captions, cell values, nearest headings and surrounding text. Which keywords are matched against which fields can depend on the table and/or the query (referred to as “late binding”).

Abstract: The present invention extends to methods, systems, and computer program products for understanding tables for search. Aspects of the invention include identifying a subject tuple (e.g., a subject column) for a table, detecting a tuple header (e.g., a column header) using other tables, and detecting a tuple header (e.g., a column header) using a knowledge base. Implementations can be utilized in a structured data search system (SDSS) that indexes structured information, such as, tables in a relational database or html tables extracted from web pages. The SDSS allows users to search over the structured information (tables) using different mechanisms including keyword search and data finding data.

Abstract: The present invention extends to methods, systems, and computer program products for understanding tables for search. Aspects of the invention include identifying a subject column for a table, detecting a column header using other tables, and detecting a column header using a knowledge base. Implementations can be utilized in a structured data search system (SDSS) that indexes structured information, such as, tables in a relational database or html tables extracted from web pages. The SDSS allows users to search over the structured information (tables) using different mechanisms including keyword search and data finding data.

Abstract: A set expansion system is described herein that improves precision, recall, and performance of prior set expansion methods for large sets of data. The system maintains high precision and recall by 1) identifying the quality of particular lists and applying that quality through a weight, 2) allowing for the specification or negative examples in a set of seeds to reduce the introduction of bad entities into the set, and 3) applying a cutoff to eliminate lists that include a low number of positive matches. The system may perform multiple passes to first generate a good candidate result set and then refine the set to find a set with highest quality. The system may also apply Map Reduce or other distributed processing techniques to allow calculation in parallel. Thus, the system efficiently expands large concept sets from a potentially small set of initial seeds from readily available web data.

Abstract: A set expansion system is described herein that improves precision, recall, and performance of prior set expansion methods for large sets of data. The system maintains high precision and recall by 1) identifying the qualify of particular lists and applying that quality through a weight, 2) allowing for the specification or negative examples in a set of seeds to reduce the introduction of bad entities into the set, and 3) applying a cutoff to eliminate lists that include a low number of positive matches. The system may perform multiple passes to first generate a good candidate result set and then refine the set to find a set with highest quality. The system may also apply Map Reduce or other distributed processing techniques to allow calculation in parallel. Thus, the system efficiently expands large concept sets from a potentially small set of initial seeds from readily available web data.

Abstract: Concept expansion using tables, such as web tables, can return entities belonging to a concept based on an input of the concept and at least one seed entity that belongs to the concept. A concept expansion frontend can receive the concept and seed entity and provide them to a concept expansion framework. The concept expansion framework can expand the coverage of entities for concepts, including tail concepts, using tables by leveraging rich content signals corresponding to concept names. Such content signals can include content matching the concept that appear in captions, early headings, page titles, surrounding text, anchor text, and queries for which the page has been clicked. The concept expansion framework can use the structured entities in tables to infer exclusive tables. Such inference differs from previous label propagation methods and involves modeling a table-entity relationship. The table-entity relationship reduces semantic drift without using a reference ontology.

Abstract: The present invention discloses a method and device for detecting broken plastic strands of plastic extruder by heat. In this method, a detection strip is placed below the die exit of plastic extruder. The detection strip is made of a material that is the same as the product being produced by the plastic extruder or a material with similar melting performance as the product being produced. In the event of a broken strand during production, the broken strand will hang down and fall on said detection strip, where the residual heat in the strand can heat the detection strip to over its glass transition temperature and change it from glassy state to elastomeric state until it is pulled or molten to break. Once the break of the detection strip is detected, the alarm will be turned on. The detection device comprises a detection strip, a strip support, a contact detector(s) and a sound-light alarming device. One end of the strip support applies a pre-load upward or downward on the detection strip.

Abstract: An online system receives information describing a target group of online system users from a third party system that includes one or more user properties, which may identify an action performed by a an online user within a time interval to include the user in the target group. When an opportunity to present advertisement requests to a user is identified, the online system retrieves actions associated with the user and times associated with the actions. If an action associated with the user matches the action identified by the user properties and occurred within the time interval identified by the user properties, and other characteristics of the user satisfy at least a threshold number of the user properties, the online system includes the user in the target group. Advertisement requests having targeting criteria, including the target group, satisfied by characteristics of the user are evaluated for presentation to the user.

Abstract: An online system receives information describing a target group of online system users from a third party system that includes one or more user properties, which may identify actions to be performed by an online system user for inclusion in the target group. Additionally, information describing the target group includes metadata associated with the user properties identifying access to the user properties by additional third party systems. If an additional third party system requests access to the target group or to the user properties describing the target group, the online system determines whether the additional third party system is authorized to access the target group or the user properties based on the metadata. Further, the online system determines an amount of compensation the third party system is to receive if the additional third party system is authorized to access the target group or the user properties based on the metadata.

Abstract: Methods and systems for automatically synthesizing product information from multiple data sources into an on-line catalog are disclosed, and in particular, for automatically synthesizing the product information based on attribute-value pairs. Information for a product may be obtained, via entity extraction, feed ingestion, and other mechanisms, from a plurality of structured and unstructured data sources having different taxonomies and schemas. Product information may additionally or alternatively be obtained or derived based on popularity data. The product information may be cleansed, segmented and normalized. The product information may be clustered so closest products, attribute names and attribute values are associated. A representative value for an attribute name may be determined, and the on-line catalog may be updated so that entries are comprehensive, meaningful and useful to a catalog user.