Abstract: A data processing method is provided. In the method, a historical walk vertex adjacent to a target walk vertex is determined. An edge transition probability between the target walk vertex and each of a set of next possible vertexes in a first out-neighbor set is determined according to first out-edge information. A to-be-reached vertex of the set of next possible vertexes in the first out-neighbor set is determined according to the edge transition probabilities. Second out-edge information corresponding to the target walk vertex is generated based on the first out-neighbor set. Walking from the target walk vertex to the to-be-reached vertex is performed. The second out-edge information is transmitted to the to-be-reached vertex. Further, a random walk sequence corresponding to the target walk vertex is generated based on a walk quantity corresponding to the target walk vertex reaching a preset threshold for walk steps.

Abstract: The adhering device of the present application includes a chamber; a carrying platform having a groove formed thereon; a pressing block assembly for supporting the flexible display panel, and fitting the flexible display panel toward the curved cover plate at a preset rising speed; a clamp assembly for holding the flexible display panel, and when the flexible display panel is adhered to the curved cover plate at a preset ascending speed, the clamp assembly starts to rotate until the flexible display panel and the curved cover plate completely adhere together with the display panel separation.

Abstract: Example methods and apparatuses for file compaction in a key-value store system relating to the field of data processing technologies are described. One example method for file compaction in a key-value store (KV-Store) system includes compacting, according to a to-be-deleted log (Delete Log) that corresponds to a to-be-compacted sorted string table (SSTable), the to-be-compacted SSTable to generate a new SSTable. A key corresponding to a non-latest value in the KV-Store system and stored in the to-be-compacted SSTable is recorded in the Delete Log, and the new SSTable does not include a key-value pair that corresponds to the key in Delete Log. The to-be-compacted SSTable is then deleted.

Abstract: The adhering device of the present application includes a chamber; a carrying platform having a groove formed thereon; a pressing block assembly for supporting the flexible display panel, and fitting the flexible display panel toward the curved cover plate at a preset rising speed; a clamp assembly for holding the flexible display panel, and when the flexible display panel is adhered to the curved cover plate at a preset ascending speed, the clamp assembly starts to rotate until the flexible display panel and the curved cover plate completely adhere together with the display panel separation.

Abstract: A data processing method is provided. In the method, a historical walk vertex adjacent to a target walk vertex is determined. An edge transition probability between the target walk vertex and each of a set of next possible vertexes in a first out-neighbor set is determined according to first out-edge information. A to-be-reached vertex of the set of next possible vertexes in the first out-neighbor set is determined according to the edge transition probabilities. Second out-edge information corresponding to the target walk vertex is generated based on the first out-neighbor set. Walking from the target walk vertex to the to-be-reached vertex is performed. The second out-edge information is transmitted to the to-be-reached vertex. Further, a random walk sequence corresponding to the target walk vertex is generated based on a walk quantity corresponding to the target walk vertex reaching a preset threshold for walk steps.

Abstract: Embodiments of this disclosure include a data processing method. In the method, a training sample set that includes a plurality of graph computing task training samples is obtained. At least one performance indicator feature of each of the graph computing task training samples is extracted. The at least one performance indicator feature includes one or more of a graph data feature, a graph processing platform feature, a graph algorithm feature, and a machine hardware feature. A target performance prediction model is generated based on a mapping relationship between actual execution times of the graph computing task training samples and the performance indicator features. According to at least one performance indicator feature of an inputted graph computing task test sample, a predicted execution time of the graph computing task test sample is output based on the target performance prediction model.

Abstract: A high-temperature-resistant hard composite coating is provided, and includes a CrN transition layer and a nanocomposite layer disposed on the surface of a substrate in sequence. The nanocomposite layer comprises AlCrSiN layers and MeN layers alternately arranged on the surface of the CrN transition layer in sequence. Me comprises W, Nb, or Hf. Also provided are a method for preparing the high-temperature-resistant hard composite coating, and a coated cutter.

Abstract: The present invention provides a flexible hard composite coating, a preparation method thereof and a coated cutter. The flexible hard composite coating includes an AlCrN transition layer and a nanocomposite layer sequentially disposed on the surface of a substrate, the nanocomposite layer having CrON layers and AlON layers sequentially alternately arranged on the surface of the AlCrN transition layer. According to an embodiment, AlCrN is used as a transition layer, for strengthening the connection between the nanocomposite layer and the substrate. The nanocomposite layer constituted by the CrON layers and the AlON layers increases the toughness of the coating and the successive alternation of the CrON layers and the AlON layers reduces the stress of the coating, increasing the crystal plane structure and the grain boundary of the coating and further improves the properties of hardness and resistance to high-temperature oxidation.

Abstract: Disclosed are a glass substrate separation device and a glass substrate separation method. A plurality of first vacuum adsorption devices is adsorbed on one end of the glass substrate to separate the one end of the glass substrate and an OLED with an opening with a certain distance, and a metal wire is driven to enter the opening, and abuts a lower surface of the glass substrate to move to the other end of the glass substrate to accomplish the separation between the glass substrate and the OLED; and then, a second vacuum adsorption device is adsorbed at an intermediate position of the glass substrate to remove the glass substrate from the OLED to realize a glass substrate removal process after a LLO in an OLED module production, thereby avoiding a damage to the OLED and a PI layer disposed on a surface layer of the OLED.

Abstract: The present disclosure discloses a substrate and a method for fabricating organic light-emitting diodes. The substrate includes a first base layer, a binding layer, and a second base layer, and the binding layer is bound between the first base layer and the second base layer, and the binding layer includes an ultraviolet rays (UV) decomposition resin. A polyimide film is formed in the substrate and bound to the bottom base layer through the UV decomposition resin. After forming organic light-emitting diodes, the bottom base layer is irradiated by ultraviolet rays and then easily peeled off without an additional back plate that performs a supporting function. Thus, the cost of peeling off the substrate is greatly reduced and the fabrication yield is improved.

Abstract: Disclosed are a glass substrate separation device and a glass substrate separation method. A plurality of first vacuum adsorption devices is adsorbed on one end of the glass substrate to separate the one end of the glass substrate and an OLED with an opening with a certain distance, and a metal wire is driven to enter the opening, and abuts a lower surface of the glass substrate to move to the other end of the glass substrate to accomplish the separation between the glass substrate and the OLED; and then, a second vacuum adsorption device is adsorbed at an intermediate position of the glass substrate to remove the glass substrate from the OLED to realize a glass substrate removal process after a LLO in an OLED module production, thereby avoiding a damage to the OLED and a PI layer disposed on a surface layer of the OLED.

Abstract: An event log system and method are disclosed. The system includes a plurality of worker nodes to receive and store event log records from a plurality of log sources, and a coordinator node to maintain information about mapping from the plurality of log sources to the plurality of worker nodes. Each worker node comprises an IngestKV module to temporarily store event log records from the log sources and a TimeRangeKV module to permanently store the event log records.

Abstract: Example methods and apparatuses for file compaction in a key-value store system relating to the field of data processing technologies are described. One example method for file compaction in a key-value store (KV-Store) system includes compacting, according to a to-be-deleted log (Delete Log) that corresponds to a to-be-compacted sorted string table (SSTable), the to-be-compacted SSTable to generate a new SSTable. A key corresponding to a non-latest value in the KV-Store system and stored in the to-be-compacted SSTable is recorded in the Delete Log, and the new SSTable does not include a key-value pair that corresponds to the key in Delete Log. The to-be-compacted SSTable is then deleted.

Abstract: Information extraction from observed data may be performed. First parameter weights and second parameter weights of a joint discriminative probability distribution may be determined. The joint discriminative probability distribution may be over first variables and second variables and may be conditioned on the observed data. The second variables may be modeled by first-order logic formulas. The first variables may be based on the first parameter weights, and the second variables may be based on the second parameter weights. A first likely output of the first variables based on the first parameter weights and a second likely output of the second variables based on the second parameter weights may be determined.

Abstract: Methods and systems of generation of histograms for strings are described. In one implementation, a prefix tree having nodes representing prefixes of the strings is generated. For the prefix tree, deploy weights are assigned to the nodes based on lengths of the prefixes represented by sub-tree nodes rooted at the nodes and frequencies of the strings whose prefixes are represented by the sub-tree nodes. Each of the deploy weights of one node is indicative of a maximum weight preserved upon filling the buckets with at least one prefix represented by the sub-tree nodes rooted at that one node. A predefined number of Top-prefixes are determined for filling up the predefined number of buckets. The Top-prefixes are determined based on maximizing a total weight preserved by the prefixes in the buckets and over a maximum number of strings. A histogram is generated based on the deploy weights associated with the Top-prefixes.

Abstract: Disclosed herein are techniques for detecting questions in queries. it is determined whether a query comprises a substantially specific question. In one example, past queries related to the current query are used to validate a whether the query comprises the substantially specific question. In another example, query suggestions are used to validate whether the query comprises the substantially specific question.

Abstract: Systems and methods for keyword based searching in a database are described herein. In one implementation, the method comprises receiving a keyword based query, comprising at least one keyword, from a user. The method further comprises searching an inverted index associated with the database to detect the presence of at least one of the keywords in documents, identified by a document ID, present in the inverted index. Based on the searching, the documents in which at least one of the keywords is present are identified. The identified documents are then ranked in a descending order of relevancy.

Abstract: A technique includes receiving a user input in an array-oriented database. The user input indicates a database operation and processing a plurality of chunks of data stored by the database to perform the operation. The processing in dudes selectively distributing the processing of the plurality of chunks between a first group of at least one central processing unit and a second group of at least one co-processor.

Abstract: An event log system and method are disclosed. The system includes a plurality of worker nodes to receive and store event log records from a plurality of log sources, and a coordinator node to maintain information about mapping from the plurality of log sources to the plurality of worker nodes. Each worker node comprises an IngestKV module to temporarily store event log records from the log sources and a TimeRangeKV module to permanently store the event log records.

Abstract: A method for obtaining an approximate answer for a query on a database is provided. A query is converted into a set of sub queries with a canonical form. An approximate answer is generated for each of said sub queries, and approximate answers for the sub queries are combined to obtain an approximate answer for said query.