Abstract: Detecting fine-grained similarity in image includes determining a core area of a search image by generating an image salient map from a plurality of layers of the search image and determining a connected area based on the image salient map. Feature descriptors are generated from the core area of the search image. A plurality of capsule vectors are generated from different ones of a plurality of keypoints of the feature descriptors. Capsule vectors of the search image are compared with capsule vectors of each image of the dataset to generate a top-K matrix. Similarity scores for the top-K matrix are calculated. One or more image of the dataset having fine-grained similarity with the search image are selected based a bundled similarity score for each image of the dataset. The bundled similarity score is a summation of the similarity scores of the image.

Abstract: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to detecting a closed ring in a three-dimensional (3D) point cloud via cycle basis. A system can comprise a memory configured to store computer executable components; and a processor configured to execute the computer executable components stored in the memory, wherein the computer executable components can comprise a filtering component that can filter a first undirected graph of a three-dimensional (3D) point cloud, by eliminating one or more edges of the first undirected graph that are longer than an adaptive threshold, wherein filtering the first undirected graph can produce a second undirected graph; and a detection component that can detect a minimum cycle basis of the second undirected graph to determine a cycle path that can traverse an irregular annular shape that is represented by the 3D point cloud.

Abstract: Disclosed are a Nested Named Entity Recognition method based on part-of-speech awareness, system, device and storage medium therefor. The method uses a BiLSTM model to extract a feature of text word data in order to obtain a text word depth feature, and each text word of text to be recognized is initialized into a corresponding graph node, and a text heterogeneous graph of the text to be recognized is constructed according to a preset part-of-speech path, the text word data of the graph nodes is updated by an attention mechanism, and the features of all graph nodes of the text heterogeneous graph are extracted using the BiLSTM model, and a nested named entity recognition result is obtained after decoding and annotating. The present disclosure can recognize ordinary entities and nested entities accurately and effectively, and enhance the performance and advantages of the nested named entity recognition model.

Abstract: Processes for producing reduced coenzyme Q10 (CoQ10) are provided. The processes may include preparing a reaction mixture, which includes oxidized CoQ10, a reductase, a supplement coenzyme, a coenzyme regeneration enzyme, and a substrate of the coenzyme regeneration enzyme, and providing a condition so that components of the reaction mixture react to produce the reduced CoQ10.

Abstract: Embodiments of this application disclose a FlexE information automatic configuration method, and the method may be implemented by a first communication apparatus. The first communication apparatus may receive first FlexE configuration information sent by a second communication apparatus. After receiving the first FlexE configuration information, the first communication apparatus may perform local FlexE configuration based on the first FlexE configuration information, so that FlexE configuration information of the first communication apparatus is consistent with FlexE configuration information of the second communication apparatus, to establish a FlexE connection. The second FlexE configuration information is used to perform FlexE configuration on a first physical interface on the first communication apparatus.

Abstract: A designated forwarder election method includes a first provider edge (PE) receiving a bandwidth notification message sent by another PE, where the first PE and the other PE are connected to a first customer edge (CE), and where the bandwidth notification message includes bandwidth information of a link between the other PE and the first CE. The first PE elects a DF from the first PE and the other PE based on the bandwidth information of the other PE and bandwidth information of a link between the first PE and the first CE.

Abstract: A method for generating a search result includes: receiving, by an information search system, a search request; obtaining, by searching, a plurality of pieces of matching information that match the search request; obtaining a respective amount of user response associated with each of the plurality of pieces of matching information and further obtaining a total amount of user response associated with a respective categories to which each of the plurality of pieces of matching information belongs; and ranking the plurality of pieces of information to generate a search result based on the total amount of user response associated with the respective category to which each of the plurality of pieces of matching information belongs. By using the above technical scheme, a result of more rational ranking of matching information can be displayed to a user when the user performs a search, thus improving experience of the user.

Abstract: A search method is disclosed. In the method, a data rewriting system obtains, from a database, one or more search term candidates that are relevant to a present search term. The data rewriting system retrieves properties of the present search term and the one or more search term candidates, where the properties describe respective matching results of the present search term and the one or more search term candidates. Based on the matching results, the data rewriting system determines whether the present search term needs to be rewritten, and rewrites the present search term based on the matching results to provide a rewritten present search term in response to determining that the present search term needs to be rewritten. A search engine performs a search based on the rewritten present search term.

Abstract: A method for determining an attitude of a star sensor based on a rolling shutter imaging is provided. The method comprises: optimizing a relation among an exposure time, a line readout time, an interline integral interval time and a frame processing time of an image for the rolling shutter imaging by using a rolling shutter model of an image sensor in the star sensor based on a line; predicting and extracting locations of M navigation stars comprised in a star map in the star sensor according to the optimized relation among the exposure time, the line readout time, the interline integral interval time and the frame processing time; and transferring an updated the attitude matrix and an updated angular velocity of the star sensor sequentially until a final attitude matrix and a final angular velocity of the star sensor are obtained.

Abstract: Generating ranked search results includes receiving a plurality of matching information items that match a search request, ranking at least some of the plurality of matching information items using a linear ranking model that linearly combines a first plurality of feature values to obtain a first set of ranked results, ranking at least some of the first set of ranked results using a nonlinear ranking model that nonlinearly combines a second plurality of feature values to obtain a second set of ranked results, and provide a search response based on the second set of ranked results.

Abstract: Ranking search results, comprises retrieving search results that include target strings that relate to a query string; segmenting the query string and each of the target strings; pairing segments in the query string with respective segments in the target strings to form combinations; retrieving weights that correspond to the combinations; and determining a weighted word length based on the weights corresponding to each of the target strings; and ranking the target strings based on their respective weighted word lengths. Alternatively, ranking search results includes determining a minimum weight of each inserted word with respect to segments in the query string; determining a minimum weight of each deleted word with respect to segments in the target strings; determining a total edit distance for each target string; and ranking the target strings based on the total edit distances.

Abstract: A method and an apparatus for identifying synonym and utilizing such synonym to conduct search is disclosed. The disclosed method includes: obtaining arbitrary two words to be identified; determining whether a shortest edit distance between the two words less than or equal to an edit distance threshold; determining whether the two words to be identified exist in a preset knowledge database, and if an answer is yes then searching a smallest granularity type with highest weight value for each word in the knowledge database; and if the two word have the same smallest granularity type with highest weight value, then determining such two words are synonyms, or non-synonym otherwise. The disclosed techniques greatly improve accuracy of synonym identification and guarantee effect of synonym identification.

Abstract: A system and method for notification management includes collecting information for a number of objects within a management tool for security assets. The display of the information is displayed on a window of a graphical user interface of the management tool. In response to user interaction with the graphical user interface, a notification tool window of a notification tool is displayed. The notification tool window is layered over at least a portion of the window of the graphical user interface. In response to user interaction with the notification tool window, notification instructions are created for at least one of the number of objects based on a portion of the information of the window of the graphical user interface. The notification instructions are operable to cause the notification tool to communicate at least one notification communication to at least one recipient concerning at least one object.

Abstract: Ranking search results, comprises retrieving search results that include target strings that relate to a query string; segmenting the query string and each of the target strings; pairing segments in the query string with respective segments in the target strings to form combinations; retrieving weights that correspond to the combinations; and determining a weighted word length based on the weights corresponding to each of the target strings; and ranking the target strings based on their respective weighted word lengths. Alternatively, ranking search results includes determining a minimum weight of each inserted word with respect to segments in the query string; determining a minimum weight of each deleted word with respect to segments in the target strings; determining a total edit distance for each target string; and ranking the target strings based on the total edit distances.

Abstract: The present disclosure describes a search method, a search apparatus and a search system. The method includes: a data rewriting system that obtains, from a database, one or more search term candidates that are relevant to a present search term. The data rewriting system retrieves properties of the present search term and the one or more search term candidates, where the properties describe respective matching results of the present search term and the one or more search term candidates. Based on the matching results, the data rewriting system determines whether or not the present search term needs to be rewritten, and rewrites the present search term based on the matching results to provide a rewritten present search term if it is determined that the present search term needs to be rewritten. A search engine performs a search based on the rewritten present search term.

Abstract: The present disclosure discloses a method for generating a search result and an information search system. The method for generating a search result includes: receiving, by an information search system, a search request; obtaining, by searching, a plurality of pieces of matching information that match the search request; obtaining a respective amount of user response associated with each of the plurality of pieces of matching information and further obtaining a total amount of user response associated with a respective categories to which each of the plurality of pieces of matching information belongs; and ranking the plurality of pieces of information to generate a search result based on the total amount of user response associated with the respective category to which each of the plurality of pieces of matching information belongs.

Abstract: Generating ranked search results includes receiving a plurality of matching information items that match a search request, ranking at least some of the plurality of matching information items using a linear ranking model that linearly combines a first plurality of feature values to obtain a first set of ranked results, ranking at least some of the first set of ranked results using a nonlinear ranking model that nonlinearly combines a second plurality of feature values to obtain a second set of ranked results, and provide a search response based on the second set of ranked results.

Abstract: A search system includes: a data rewriting system that obtains, from a database, one or more search term candidates that are relevant to a present search query. The data rewriting system retrieves properties of the present search query and the one or more search term candidates, where the properties describe respective matching results of the present search query and the one or more search term candidates. Based at least in part on the matching results, the data rewriting system determines whether or not the present search query needs to be rewritten, and rewrites the present search query based at least in part on the matching results to provide a rewritten present search query if it is determined that the present search query needs to be rewritten. A search engine performs a search based at least in part on the rewritten present search query.

Abstract: Ranking search results, comprises retrieving search results that include target strings that relate to a query string; segmenting the query string and each of the target strings; pairing segments in the query string with respective segments in the target strings to form combinations; retrieving weights that correspond to the combinations; and determining a weighted word length based on the weights corresponding to each of the target strings; and ranking the target strings based on their respective weighted word lengths. Alternatively, ranking search results includes determining a minimum weight of each inserted word with respect to segments in the query string; determining a minimum weight of each deleted word with respect to segments in the target strings; determining a total edit distance for each target string; and ranking the target strings based on the total edit distances.

Abstract: The present disclosure discloses a method for generating a search result and an information search system. The method for generating a search result includes: receiving, by an information search system, a search request; obtaining, by searching, a plurality of pieces of matching information that match the search request; obtaining a respective amount of user response associated with each of the plurality of pieces of matching information and further obtaining a total amount of user response associated with a respective categories to which each of the plurality of pieces of matching information belongs; and ranking the plurality of pieces of information to generate a search result based on the total amount of user response associated with the respective category to which each of the plurality of pieces of matching information belongs.