Abstract: Embodiments relate to switching a neural processor circuit between non-secure and secure modes. A security controller of the neural processor circuit indicates that a transition from the non-secure mode to the secure mode is to occur. The security controller waits for a neural task manager of the neural processor circuit to clear out any existing non-secure tasks in queues. After the existing non-secure mode tasks are cleared, the security controller switches the neural processor circuit to the secure mode. While in the secure mode, secure tasks are added to one or more queues and executed, and data for processing in the neural processor circuit is received from a secure source. The neural processor circuit may to transition back to the non-secure mode when all secure mode tasks are completed.

Abstract: Embodiments described herein enable the generation of cryptographic material for ranging operations in a manner that reduces and obfuscates potential correlations between leaked and secret information. One embodiment provides for an apparatus including a ranging module having one or more ranging sensors. The ranging module is coupled to a secure processing system through a hardware interface to receive at least one encrypted ranging session key, the ranging module to decrypt the at least one encrypted ranging session key to generate a ranging session key, generate a sparse ranging input, derive a message session key based on the ranging session key, and derive a derived ranging key via a key derivation cascade applied to the message session key and the sparse ranging input, the derived ranging key to encrypt data transmitted during a ranging session.

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 method for forging a niobium-tungsten alloy forged ring, including: (S1) subjecting an alloy ingot to turning, chamfering, spraying with an anti-oxidation coating, stainless-steel sheathing, heating and upsetting to obtain a primary pancake with a flat-die hammer, rapid-forging press or hydraulic press; (S2) subjecting an inner pole to wire electrical discharge machining to obtain a ring blank followed by machining to remove the stainless-steel sheath and oxide scale and defects; and subjecting the ring blank to fluorescent/dye penetrant inspection followed by vacuum stress-relief annealing; (S3) subjecting the ring blank to core shaft/saddle forging on the flat-die hammer or rapid-forging press to obtain a crude forged ring; and (S4) subjecting the crude forged ring to vacuum recrystallization annealing to obtain a desired forged ring.

Abstract: A method for forming a QCr0.8 alloy tapered cylindrical ring, including: heating a standard QCr0.8 alloy cylindrical part followed by upsetting and stretching at least twice to obtain a primary blank; heating the primary blank followed by upsetting and chamfering to obtain a secondary blank, where a diameter of a top end is greater than that of a bottom end; subjecting the secondary blank to backward extrusion to form a preform; machining the preform to remove a flash and a bottom residue; subjecting a bottom end of the preform to local bulging to enable a shape and a size thereof to match that of a drive roller in a forming tooling, so as to form a profiled ring blank; and rolling the profiled ring blank by a radial-axial ring rolling machine with the forming tooling to form the tapered cylindrical ring.

Abstract: A pneumatic engine, comprising: a rotating outer ring (1), an intermediate shaft (2), a direct drive power core (3), and left and right baffles (4) and (5) where the rotating outer ring (1), the direct drive power core (3), and the left and right baffles (4) and (5) are coaxially provided on the intermediate shaft (2), the rotating outer ring (1) is integrally connected to the left and right baffles (4) and (5) to engage with the intermediate shaft (2) via a bearing, and a closed space is formed, the intermediate shaft (2) is provided with a master air inlet (21) and a master air outlet (22), the direct drive power core (3) is provided with a logarithmic spiral line runner, multiple drive grooves (11) are provided on an inner ring surface of the rotating outer ring (1). The pneumatic engine has a simple structure, high transmission efficiency and strong endurance.

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: Provided is a detachable endoscopic clamp, related to medical apparatuses, which aims to solve the problem that the existing endoscopic clips are hard to remove and can only provide a weak clipping force. The detachable endoscopic clip includes at least two engagement members and at least two resilient members. Ends of the engagement members and ends of the resilient members from conjugates, and at least one of the conjugates is detachable. The endoscopic clip can be easily detached and removed after a surgery.

Abstract: Embodiments relate to switching a neural processor circuit between non-secure and secure modes. A security controller of the neural processor circuit indicates that a transition from the non-secure mode to the secure mode is to occur. The security controller waits for a neural task manager of the neural processor circuit to clear out any existing non-secure tasks in queues. After the existing non-secure mode tasks are cleared, the security controller switches the neural processor circuit to the secure mode. While in the secure mode, secure tasks are added to one or more queues and executed, and data for processing in the neural processor circuit is received from a secure source. The neural processor circuit may to transition back to the non-secure mode when all secure mode tasks are completed.

Abstract: Provided is a detachable endoscopic clamp, related to medical apparatuses, which aims to solve the problem that the existing endoscopic clips are hard to remove and can only provide a weak clipping force. The detachable endoscopic clip includes at least two engagement members and at least two resilient members. Ends of the engagement members and ends of the resilient members from conjugates, and at least one of the conjugates is detachable. The endoscopic clip can be easily detached and removed after a surgery.

Abstract: A method for verifying program flow during execution of a software program in a computer system is disclosed. Program code of the software program includes multiple program instructions and checkpoint data structures, where a given checkpoint data structure is associated with a given program instruction and is linked to at least one other checkpoint data structure. A fault monitor circuit may receive a particular checkpoint data structure and compare the particular checkpoint data structure to a previously received checkpoint data structure that is associated with another program instruction. Based on results of the comparison, the software fault monitor circuit may signal a program flow error.

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 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: Embodiments described herein enable the generation of cryptographic material for ranging operations in a manner that reduces and obfuscates potential correlations between leaked and secret information. One embodiment provides for an apparatus including a ranging module having one or more ranging sensors. The ranging module is coupled to a secure processing system through a hardware interface to receive at least one encrypted ranging session key, the ranging module to decrypt the at least one encrypted ranging session key to generate a ranging session key, generate a sparse ranging input, derive a message session key based on the ranging session key, and derive a derived ranging key via a key derivation cascade applied to the message session key and the sparse ranging input, the derived ranging key to encrypt data transmitted during a ranging session.

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: Various technologies that facilitate performance of a data finding data (DFD) search are described herein. A user specifies entities, for example, by entering the entities into a query field, selecting the entities from a computer-executable application, or the like. The user further specifies an attribute of the entities that is of interest. A query is constructed based upon the entities and the attribute, and a search for tables is performed based upon the entities and the attribute. Values of the attribute for the selected entities are identified in a table, and the values of the attribute are returned.

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: A pneumatic engine, comprising: a rotating outer ring (1), an intermediate shaft (2), a direct drive power core (3), and left and right baffles (4) and (5) where the rotating outer ring (1), the direct drive power core (3), and the left and right baffles (4) and (5) are coaxially provided on the intermediate shaft (2), the rotating outer ring (1) is integrally connected to the left and right baffles (4) and (5) to engage with the intermediate shaft (2) via a bearing, and a closed space is formed, the intermediate shaft (2) is provided with a master air inlet (21) and a master air outlet (22), the direct drive power core (3) is provided with a logarithmic spiral line runner, multiple drive grooves (11) are provided on an inner ring surface of the rotating outer ring (1). The pneumatic engine has a simple structure, high transmission efficiency and strong endurance.

Abstract: A method for verifying program flow during execution of a software program in a computer system is disclosed. Program code of the software program includes multiple program instructions and checkpoint data structures, where a given checkpoint data structure is associated with a given program instruction and is linked to at least one other checkpoint data structure. A fault monitor circuit may receive a particular checkpoint data structure and compare the particular checkpoint data structure to a previously received checkpoint data structure that is associated with another program instruction. Based on results of the comparison, the software fault monitor circuit may signal a program flow error.