Abstract: System and method for determining gain characteristics of a circularly-polarized antenna. The method includes receiving a measured first amplitude of a forward gain between a circularly-polarized antenna probe of a first type and a linearly-polarized standard-gain antenna, a measured second amplitude of a forward gain between a circularly-polarized antenna probe of a first type and a circularly-polarized antenna under test, and a measured third amplitude of a forward gain between a circularly-polarized antenna probe of a second type and the circularly-polarized antenna under test. The method also includes determining a left-hand circularly-polarized gain and a right-hand circularly-polarized gain of the circularly-polarized antenna under test based on the measured first amplitude, the measured second amplitude, the measured third amplitude, and a cross-polarization level of the circularly-polarized antenna probes of the first and second types. The determination may be performed using one or more processors.

Abstract: A technique for providing search results may include determining a first entity type, a second entity type, and a relationship type based on a compositional query. The technique may also include identifying nodes of a knowledge graph corresponding to entity references of the first entity type and entity references of the second entity type. The technique may also include determining from the knowledge graph an attribute value corresponding to the relationship type for each entity reference of the first entity type and for each entity reference of the second entity type. The technique may also include comparing the attribute value of each entity reference of the first entity type with the attribute value of each entity reference of the second entity type. The technique may also include determining one or more resultant entity references from the entity references of the first entity type based on the comparing.

Abstract: A technique for providing search results may include determining a first entity type, a second entity type, and a relationship type based on a compositional query. The technique may also include identifying nodes of a knowledge graph corresponding to entity references of the first entity type and entity references of the second entity type. The technique may also include determining from the knowledge graph an attribute value corresponding to the relationship type for each entity reference of the first entity type and for each entity reference of the second entity type. The technique may also include comparing the attribute value of each entity reference of the first entity type with the attribute value of each entity reference of the second entity type. The technique may also include determining one or more resultant entity references from the entity references of the first entity type based on the comparing.

Abstract: This application provides a data backup method. The method includes: obtaining, by a first node, an identifier of a backup execution node from a storage device; and backing up data of the first node in the storage device responsive to determining that an ID of the first node is the same as the ID of the backup execution node. The embodiments of this application can improve reliability of the data stored by the first node, and prevent a plurality of nodes from redundantly backing up duplicate data in the storage device. The techniques disclosed herein reduce resource consumption.

Abstract: A processor includes at least one core and an instruction set logic including a plurality of lease cache memory instructions. At least one cache memory is operatively coupled to the at least one core. The at least one cache memory has a plurality of lease registers. A lease cache memory method and a software lease cache product are also described.

Abstract: Implementations provide an enhanced search result to improve the user search experience. For example, the result may include insightful information relevant to the search query that was not specifically requested but that the user may find interesting, such as relationships shared between the two entities related to the query, a relationship between the two entities that does not commonly occur with another relationship shared by the entities, or strong secondary connections for an entity related to the query. In some implementations, insightful connections may also be unique facts for a particular entity. Unique facts may represent a superlative attribute of an entity such as, for example, the tallest actor, the oldest president, the most expensive stock, etc. Such shared relationships, rare relationships, and/or unique facts may be provided as part of the search results presented to the query requestor and may provide insight to the requestor about the entity.

Abstract: The present invention discloses a method for preparing inverse opal photonic crystal fibers. In this method, by means of vertical deposition of colloidal spheres (micron scale or nanoscale), of polystyrene shell-core structured spheres and silica particles, the inverse opal colloidal crystal fiber stripes having a length of about 3.5 cm as well as an adjustable width and thickness is obtained. The invention provides a convenient method and achieves inverse opal photonic crystal fiber stripes with a high yield and a controllable size, and there is no crack on the surface of the fibers or inside the fibers. Furthermore, the inverse opal photonic crystal stripes of the invention can be peeled off from the surface of a glass slide and used conveniently.

Abstract: Methods and systems are provided for ranking search results and generating a presentation. In some implementations, a search system generates a presentation based on a search query. In some implementations, a search system ranks search results based on data stored in a knowledge graph. In some implementations, a search system identifies a modifying concept such as a superlative in a received search query, and determines ranking properties based on the modifying concept.

Abstract: Methods and systems are provided for ranking search results and generating a presentation. In some implementations, a search system generates a presentation based on a search query. In some implementations, a search system ranks search results based on data stored in a knowledge graph. In some implementations, a search system identifies a modifying concept such as a superlative in a received search query, and determines ranking properties based on the modifying concept.

Abstract: The present invention discloses a method for preparing inverse opal photonic crystal fibers. In this method, by means of vertical deposition of colloidal spheres (micron scale or nanoscale), of polystyrene shell-core structured spheres and silica particles, the inverse opal colloidal crystal fiber stripes having a length of about 3.5 cm as well as an adjustable width and thickness is obtained. The invention provides a convenient method and achieves inverse opal photonic crystal fiber stripes with a high yield and a controllable size, and there is no crack on the surface of the fibers or inside the fibers. Furthermore, the inverse opal photonic crystal stripes of the invention can be peeled off from the surface of a glass slide and used conveniently.

Abstract: A liveness-based memory allocation module operating so that a program thread invoking the memory allocation module is provided with an allocation of memory including a reserve of free heap slots beyond the immediate requirements of the invoking thread. The module receives a parameter representing a thread execution window from an invoking thread; calculates a liveness metric based upon the parameter; calculates a reserve of memory to be passed to the invoking thread based upon the parameter; returns a block of memory corresponding to the calculated reserve of memory. Equations, algorithms, and sampling strategies for calculating liveness metrics are disclosed, as well as a method for adaptive control of the module to achieve a balance between memory efficiency and potential contention as specified by a single control parameter.

Abstract: Methods and systems are provided for providing search results while maintaining search context. A search system may display a plurality of links related to a received search query, wherein the links are all of the same entity type. The system may display sets of search results related to the plurality of links, while continuing to display the plurality of links.

Abstract: Systems and methods are disclosed for creating a contact list and pre-populated user accounts. An existing contact list associated with a first user is imported at a computer system. A second contact list is created for the first user for a user account associated with a social network service wherein the second contact list comprises members from the existing contact list. Members of the existing contact list whom already have a user account with the social network service are filtered into a first category. Members of the existing contact list whom do not have a user account with the social network service are filtered into a second category. Pre-populated user accounts associated with the social network service are created for the members in the second category.

Abstract: A liveness-based memory allocation module operating so that a program thread invoking the memory allocation module is provided with an allocation of memory including a reserve of free heap slots beyond the immediate requirements of the invoking thread. The module receives a parameter representing a thread execution window from an invoking thread; calculates a liveness metric based upon the parameter; calculates a reserve of memory to be passed to the invoking thread based upon the parameter; returns a block of memory corresponding to the calculated reserve of memory. Equations, algorithms, and sampling strategies for calculating liveness metrics are disclosed, as well as a method for adaptive control of the module to achieve a balance between memory efficiency and potential contention as specified by a single control parameter.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for augmenting clusters of news articles with translated news articles. In one aspect, a method includes obtaining data characterizing a first cluster of electronically published news articles in a presentation language, wherein the data characterizing the first cluster of news articles comprises one or more terms in the presentation language and region data identifying a first geographical region associated with the first cluster; generating translated terms by translating one or more of the terms from the presentation language to a first language, wherein the first language corresponds to the first geographical region; and obtaining one or more news articles in the first language in response to a search query derived from the one or more translated terms.

Abstract: A method to quantify a plurality of digital data sharing in a multi-threaded execution includes the steps of: providing at least one processor; providing a computer readable non-transitory storage medium including a computer readable multi-threaded executable code and a computer readable executable code to calculate a plurality of shared footprint values and an average shared footprint value; running the multi-threaded executable code on the at least one computer processor; running the computer readable executable code configured to calculate a plurality of shared footprint values and an average shared footprint value; calculating a plurality of shared footprint values by use of a linear-time process for a corresponding plurality of executable windows in time; and calculating and saving an average shared footprint value based on the plurality of shared footprint values to quantify by a metric the data sharing by the multi-threaded execution. A system to perform the method is also described.

Abstract: Methods and systems are provided for ranking search results and generating a presentation. In some implementations, a search system generates a presentation based on a search query. In some implementations, a search system ranks search results based on data stored in a knowledge graph. In some implementations, a search system identifies a modifying concept such as a superlative in a received search query, and determines ranking properties based on the modifying concept.

Abstract: The present invention discloses a method for purification of bacterial capsular polysaccharide at low temperature (<20° C.) by salt-induced two-phase aqueous micellar system with TritonX-114 and can significantly reduce the endotoxins. Impurity proteins and the endotoxins need to be removed as many as possible in the preparation process of bacterial capsular polysaccharide vaccine to reduce the side reaction of the vaccines. Currently, the phenol extraction method, column chromatography and ethanol precipitation method all have a number of drawbacks. As compared with the phenol, the nonionic detergent has the advantages such as non-corrosiveness and non-carcinogenicity, and does not cause harm to the environment. As compared with the column chromatography, the method of the present invention is large in throughput, time-saving, economical, and easily expanding the scale production, which is a safe, environment-friendly and efficient.

Abstract: A “code splitting tool” provides various techniques for automatically analyzing and rewriting existing browser-based applications to introduce dynamic code loading into those applications thereby improving perceived application responsiveness. Structural elements of application code (including functions, classes, etc.) are broken into small “stubs” with corresponding bodies. Rewritten applications then initially transfer only the portion of the code (including some combination of stubs and bodies) to the client as necessary for initial application execution. Additional stubs and/or bodies are then transferred either on-demand at runtime or in the background. Automated code rewriting proceeds without requiring any application-specific knowledge or changes to existing code prior to code rewriting. Further, the code splitting tool can tailor code rewriting to specific computing devices (computers, PDA's, cell phones, etc.

Abstract: Methods and systems are provided for ranking search results and generating a presentation. In some implementations, a search system generates a presentation based on a search query. In some implementations, a search system ranks search results based on data stored in a knowledge graph. In some implementations, a search system identifies a modifying concept such as a superlative in a received search query, and determines ranking properties based on the modifying concept.