Abstract: In an approach for updating instructions of machine repairs to a user interface, a processor populates a quantity of machine components used to construct a machine model. A processor receives the machine model constructed from the quantity of machine components. A processor couples the machine model with a set of vital product data. A processor associates a set of instructions for a repair procedure with the machine model and the vital product data file. A processor generates a visual representation of the repair procedure specific to the machine model.

Abstract: The application relates to systems and methods for managing funds. The system is programmed to receive an instruction about a first exchange-traded fund (ETF) in a first exchange system, identify a second ETF according to the instruction in a second exchange system, determine a first underlying currency for the first ETF and a second underlying currency for the second ETF and a currency exchange rate between the first underlying currency and the second underlying currency, obtain an exchange ratio between the first ETF and the second ETF based on the currency exchange rate and components of the first and second ETFs, and exchange a first number of shares of the first ETF to a second number of shares of the second ETF according to the exchange ratio. Thus, the systems and methods allow investors to exchange shares of one ETF to those of another ETF instantly.

Abstract: Methods, systems, and computer-readable media are provided for related entity search. In some implementations, a search system identifies a collection of entities associated with a search query. The search system identifies entities related to those entities, and determines the relationships between them. The search system provides access to one or more collections of related results identifying entities based on the determined relationships.

Abstract: A technique for providing search results may include determining a first entity type, a second entity types 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 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 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.

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: An approach to determine whether errors associated with transmitted data are associated with a transmitting device, a receiving device, and/or a connecting device that connects the transmitting device to the receiving device. The approach includes a method that includes receiving transmitted data with a buffer. The approach further includes analyzing the transmitted data which includes an error correcting process to detect errors and determine that the transmitted data has an error that requires additional analysis. The approach further includes determining that the error is associated with a receiving device, the transmitting device, or a connecting device that connects the receiving device and the transmitting device.

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: Described is predicting cache locality in a multicore/multithreaded processing environment including when threads share cache data in a non-uniform interleaving manner. Thread execution traces are analyzed to compute a set of per-thread parameters that can then be used to predict cache miss rates for other cache sizes. In one aspect, a model is based upon a probability that the cache reuse distance will increase because of accesses by other threads, and another probability that the reuse distance will decrease because of intercept accesses by other threads to shared data blocks. Estimates of the number of shared data blocks, possibly shared data blocks and private data blocks are used in the computations.

Abstract: The present invention provides a method for enrichment and isolation of endogenous transcription factors and their complexes. Also, this invention provides corresponding tandem arrays of concatenated transcription factor response elements (catTFRE). The method employs the property of transcription factors binding to sequence-specific DNA elements during regulation of gene expression. The catTFREs are designed and synthesized as concatenate dual copies of DNA response elements for various transcription factors. The DNA sequence of synthesized catTFRE is cloned to a target vector. Biotinylated catTFRE with 200 bp arms is prepared by PCR strategy. For enrichment and isolation of endogenous transcription factors and their complexes, the biotinylated catTFRE is immobilized to streptavidin-coated magnetic beads and then incubated with nuclear extract. Thereby endogenous transcription factors and their complexes are isolated from nuclear extract.

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: 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: A method of dynamic parallelization for programs in systems having at least two processors includes examining computer code of a program to be performed by the system, determining a largest possible parallel region in the computer code, classifying data to be used by the program based on a usage pattern and initiating multiple, concurrent processes to perform the program. The multiple, concurrent processes ensure a baseline performance that is at least as efficient as a sequential performance of the computer code.

Abstract: Computer implemented method, system and computer usable program code for cache management. A cache is provided, wherein the cache is viewed as a sorted array of data elements, wherein a top position of the array is a most recently used position of the array and a bottom position of the array is a least recently used position of the array. A memory access sequence is provided, and a training operation is performed with respect to a memory access of the memory access sequence to determine a type of memory access operation to be performed with respect to the memory access. Responsive to a result of the training operation, a cache replacement operation is performed using the determined memory access operation with respect to the memory access.

Abstract: A computer-implemented method for providing a definition or a translation is disclosed according to an aspect of the subject technology. The method comprises receiving an input indicating a word selected by a user, sending a definition request for the word to a definition server, receiving a response to the definition request from the definition server, sending a translation request for the word to a translation server, and receiving a response to the translation request from the translation server. The method also comprises determining whether to provide the user with a definition or a translation of the word based on the responses from the definition server and the translation server, and providing the user with the definition or the translation of the word based on the determination.

Abstract: Described is predicting cache locality in a multicore/multithreaded processing environment including when threads share cache data in a non-uniform interleaving manner. Thread execution traces are analyzed to compute a set of per-thread parameters that can then be used to predict cache miss rates for other cache sizes. In one aspect, a model is based upon a probability that the cache reuse distance will increase because of accesses by other threads, and another probability that the reuse distance will decrease because of intercept accesses by other threads to shared data blocks. Estimates of the number of shared data blocks, possibly shared data blocks and private data blocks are used in the computations.

Abstract: Computer implemented method, system and computer usable program code for cache management. A cache is provided, wherein the cache is viewed as a sorted array of data elements, wherein a top position of the array is a most recently used position of the array and a bottom position of the array is a least recently used position of the array. A memory access sequence is provided, and a training operation is performed with respect to a memory access of the memory access sequence to determine a type of memory access operation to be performed with respect to the memory access. Responsive to a result of the training operation, a cache replacement operation is performed using the determined memory access operation with respect to the memory access.

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.