Abstract: This application describes examples of a grid-tied inverter apparatus and a grid-tied control method. In one example, the grid-tied inverter apparatus includes an inverter circuit, a controller, and a filter circuit. The controller is configured to adjust switching frequencies of a plurality of power switching transistors based on an output current value of the inverter apparatus, to adjust a resonance frequency of the filter circuit through different resonant branches, so that the resonance frequency meets a grid-tied requirement.

Abstract: A mobile phone camera extension-and-retraction device (100) and a mobile phone, wherein, the mobile phone camera extension-and-retraction device (100) comprises a driving unit (1), a reversing gear mechanism (2), a connecting drive mechanism (3), a control module and a shell (4), the driving unit (1) is controlled to rotate forwardly or reversely by the control module, thereby driving the first planetary pinion (22) or the second planetary pinion (23) of the reversing gear mechanism (2) to mesh with the second drive gear (31) of the connecting drive mechanism (3), and driving the rack member (32) for straightly reciprocating movement, such that the mobile phone camera fixedly connected to the rack member (32) extends or retracts automatically.

Abstract: A mobile phone camera extension-and-retraction device (100) and a mobile phone, wherein, the mobile phone camera extension-and-retraction device (100) comprises a driving unit (1), a reversing gear mechanism (2), a connecting drive mechanism (3), a control module and a shell (4), the driving unit (1) is controlled to rotate forwardly or reversely by the control module, thereby driving the first planetary pinion (22) or the second planetary pinion (23) of the reversing gear mechanism (2) to mesh with the second drive gear (31) of the connecting drive mechanism (3), and driving the rack member (32) for straightly reciprocating movement, such that the mobile phone camera fixedly connected to the rack member (32) extends or retracts automatically.

Abstract: A transmission device and a rack corner steering mechanism, the rack corner steering mechanism comprises an input gear (10) and a rack steering assembly (20), the rack steering assembly (20) comprises a plunger (21) and a plurality of rack units (22), the plunger (21) is a straight bar and is moved along a straight trajectory, and the plunger (21) adjacent to the rack unit (22) is obliquely connected to an end of the plunger (21), each of the other rack units (22) is successively connected to the end of the front rack unit (22), when each rack unit (22) is engaged with the input gear (10), the rack unit (22) is rotated and is in line with the plunger (21). The rack unit (22) can be rotated to ensure the flexible steering of the steering mechanism, the reciprocating motion of the input gear (10) is converted into the reciprocating motion of the plunger (21), which has the advantages of smooth operation, good continuity, low noise, high bearing capacity, reliable, compact structure, and small volume.

Abstract: Embodiments for identifying an entity synonym of an entity are described. A query log is stored in a database located on at least one computing device. A candidate generation module can select a candidate query in the query log that shares a click on a URL with the entity. A correlated tag module can generate a set of phrase-tag pairs for the entity and the candidate query and measure a mutual information value for each phrase-tag pair. A candidate filtering module can determine a click similarity value between the candidate query and the entity based on a set of URLs selected in the search engine results and a tag similarity value based on the mutual information values. A candidate query is selected as an entity synonym if the click similarity value and the tag similarity value are greater than predetermined thresholds respectively.

Abstract: A personalized page rank computation system is described herein that provides a fast MapReduce method for Monte Carlo approximation of personalized PageRank vectors of all the nodes in a graph. The method presented is both faster and less computationally intensive than existing methods, allowing a broader scope of problems to be solved by existing computing hardware. The system adopts the Monte Carlo approach and provides a method to compute single random walks of a given length for all nodes in a graph that it is superior in terms of the number of map-reduce iterations among a broad class of methods. The resulting solution reduces the I/O cost and outperforms the state-of-the-art FPPR approximation methods, in terms of efficiency and approximation error. Thus, the system can very efficiently perform single random walks of a given length starting at each node in the graph and can very efficiently approximate all the personalized PageRank vectors.

Abstract: A similarity analysis framework is described herein which leverages two or more similarity analysis functions to generate synonyms for an entity reference string re. The functions are selected such that the synonyms that are generated by the framework satisfy a core set of synonym-related properties. The functions operate by leveraging query log data. One similarity analysis function takes into consideration the strength of similarity between a particular candidate string se and an entity reference string re even in the presence of sparse query log data, while another function takes into account the classes of se and re. The framework also provides indexing mechanisms that expedite its computations. The framework also provides a reduction module for converting long entity reference strings into shorter strings, where each shorter string (if found) contains a subset of the terms in its longer counterpart.

Abstract: A set expansion system is described herein that uses general-purpose web data to expand a set of seed entities. The system includes a simple yet effective quality metric to measure the expanded set, and includes two iterative thresholding processes to rank candidate entities. The system models web data sources and integrates relevance and coherence measurements to evaluate potential set candidates using an iterative process. The system uses general-purpose web data that is not specific to the given seeds. The system defines quality of the result set as the sum of two component scores: the relevance of a set of entities that measures their similarity with the given seeds, and the coherence of the set of entities produced which is how closely the entities in the set are related to each other. Based on this quality measure, the system develops a class of iterative set expansion processes.

Abstract: Identifying synonyms of entities using a collection of documents is disclosed herein. In some aspects, a document from a collection of documents may be analyzed to identify hit sequences that include one or more tokens (e.g., words, number, etc.). The hit sequences may then be used to generate discriminating token sets (DTS's) that are subsets of both the hit sequences and the entity names. The DTS's are matched with corresponding entity names, and then used to create DTS phrases by selecting adjacent text in the document that is proximate to the DTS. The DTS phrases may be analyzed to determine whether the corresponding DTS is synonyms of the entity name. In various aspects, the tokens of an associated entity name that are present in the DTS phrases are used to generate a score for the DTS. When the score at least reaches a threshold, the DTS may be designated as a synonym. A list of synonyms may be generated for each entity name.

Abstract: A similarity analysis framework is described herein which leverages two or more similarity analysis functions to generate synonyms for an entity reference string re. The functions are selected such that the synonyms that are generated by the framework satisfy a core set of synonym-related properties. The functions operate by leveraging query log data. One similarity analysis function takes into consideration the strength of similarity between a particular candidate string se and an entity reference string re even in the presence of sparse query log data, while another function takes into account the classes of se and re. The framework also provides indexing mechanisms that expedite its computations. The framework also provides a reduction module for converting long entity reference strings into shorter strings, where each shorter string (if found) contains a subset of the terms in its longer counterpart.

Abstract: A personalized page rank computation system is described herein that provides a fast MapReduce method for Monte Carlo approximation of personalized PageRank vectors of all the nodes in a graph. The method presented is both faster and less computationally intensive than existing methods, allowing a broader scope of problems to be solved by existing computing hardware. The system adopts the Monte Carlo approach and provides a method to compute single random walks of a given length for all nodes in a graph that it is superior in terms of the number of map-reduce iterations among a broad class of methods. The resulting solution reduces the I/O cost and outperforms the state-of-the-art FPPR approximation methods, in terms of efficiency and approximation error. Thus, the system can very efficiently perform single random walks of a given length starting at each node in the graph and can very efficiently approximate all the personalized PageRank vectors.

Abstract: A set expansion system is described herein that uses general-purpose web data to expand a set of seed entities. The system includes a simple yet effective quality metric to measure the expanded set, and includes two iterative thresholding processes to rank candidate entities. The system models web data sources and integrates relevance and coherence measurements to evaluate potential set candidates using an iterative process. The system uses general-purpose web data that is not specific to the given seeds. The system defines quality of the result set as the sum of two component scores: the relevance of a set of entities that measures their similarity with the given seeds, and the coherence of the set of entities produced which is how closely the entities in the set are related to each other. Based on this quality measure, the system develops a class of iterative set expansion processes.

Abstract: A query comprising a set of keywords may be applied to a data set having various attributes, but it may be difficult to determine the query predicates intended for each keyword (e.g., the attributes targeted by each keyword, and the values of those attributes satisfying the keyword.) The meaning of a keyword of interest may be inferred from a set of query pairs, comprising a background query (comprising a set of keywords excluding the keyword of interest) and a foreground query (comprising the same set of keywords but also including the keyword of interest.) Differences in the query results for the foreground query and the background query of many query pairs may identify a query predicate intended by the keyword and a confidence score. These results may be associated with the keyword in a keyword map, useful for translating queries into query predicates that may yield relevant query results.

Abstract: Embodiments for identifying an entity synonym of an entity are described. A query log is stored in a database located on at least one computing device. A candidate generation module can select a candidate query in the query log that shares a click on a URL with the entity. A correlated tag module can generate a set of phrase-tag pairs for the entity and the candidate query and measure a mutual information value for each phrase-tag pair. A candidate filtering module can determine a click similarity value between the candidate query and the entity based on a set of URLs selected in the search engine results and a tag similarity value based on the mutual information values. A candidate query is selected as an entity synonym if the click similarity value and the tag similarity value are greater than predetermined thresholds respectively.

Abstract: The described implementations relate to data analysis, such as membership checking. One technique identifies candidate matches between document sub-strings and database members utilizing signatures. The technique further verifies that the candidate matches are true matches.

Abstract: Identifying synonyms of entities using a collection of documents is disclosed herein. In some aspects, a document from a collection of documents may be analyzed to identify hit sequences that include one or more tokens (e.g., words, number, etc.). The hit sequences may then be used to generate discriminating token sets (DTS's) that are subsets of both the hit sequences and the entity names. The DTS's are matched with corresponding entity names, and then used to create DTS phrases by selecting adjacent text in the document that is proximate to the DTS. The DTS phrases may be analyzed to determine whether the corresponding DTS is synonyms of the entity name. In various aspects, the tokens of an associated entity name that are present in the DTS phrases are used to generate a score for the DTS. When the score at least reaches a threshold, the DTS may be designated as a synonym. A list of synonyms may be generated for each entity name.

Abstract: Identifying synonyms of entities using web search results is disclosed herein. In some aspects, a candidate string of tokens of an entity name is selected as a search term. The search term is transmitted by a server to a search engine, which in turn, transmits search results back to the server after performing a search. The server analyzes the search results, generates a score based on the search results, and then determines a status (synonym or not a synonym) of the candidate string based on the score. In further aspects, additional candidate strings are designated as synonyms or not synonyms based on status of the searched candidate string by using relationships of a lattice formed from all possible candidate strings of the entity name.

Abstract: The subject disclosure pertains to a class of object finder queries that return the best target objects that match a set of given keywords. Mechanisms are provided that facilitate identification of target objects related to search objects that match a set of query keywords. Scoring mechanisms/functions are also disclosed that compute relevance scores of target objects. Further, efficient early termination techniques are provided to compute the top K target objects based on a scoring function.

Abstract: The described implementations relate to query portals. One technique analyzes search results generated by a web search engine responsive to a user search query. The technique also dynamically generates a query portal that lists the search results as well as entities identified from the search results.

Abstract: The described implementations relate to data analysis, such as membership checking. One technique identifies candidate matches between document sub-strings and database members utilizing signatures. The technique further verifies that the candidate matches are true matches.