Abstract: The present invention provides a device and a method for preprocessing metallic magnesium. The device includes a chamber (20), a heating device (22) mounted in the chamber (20), a gas inlet port (24) mounted on the chamber (20), and a gas evacuation port (26) mounted on the chamber (20). The gas inlet port (24) is connected to and in communication with an external inert gas supply equipment for supplying an inert gas into the chamber (20). The gas evacuation port (26) is connected to and in communication with an external vacuum evacuation device to evacuate the chamber (20) to vacuum. The heating device (22) functions to heat metallic magnesium having an oxidized surface so as to sublimate a layer of magnesium oxide formed on the surface of the metallic magnesium in a vacuum environment to thereby obtain pure metallic magnesium.

Abstract: A blue fluorescent organic material is provided, which has the structure as formula (I). In the formula (I), R is C1-C20 alkyl, C1-C20 alkoxyl or C1-C20 aryl having a substituent; Ar1 is H, phenyl, polycyclic aromatic group, substituted phenyl or substituted fused ring aryl; Ar2 is a substituent as given in formula (a) or formula (b). The emission efficiency, stability, and color purity of the blue light can be improved with the blue fluorescent organic material of the present invention, so as to achieve the display effect of a full natural color.

Abstract: A blue fluorescent organic material is provided, which has the structure as formula (I). In the formula (I), R is C1-C20 alkyl, C1-C20 alkoxyl or C1-C20 aryl having a substituent; Ar1 is H, phenyl, polycyclic aromatic group, substituted phenyl or substituted fused ring aryl; Ar2 is a substituent as given in formula (a) or formula (b). The emission efficiency, stability, and color purity of the blue light can be improved with the blue fluorescent organic material of the present invention, so as to achieve the display effect of a full natural color.

Abstract: The present disclosure relates to an evaporation device, including an evaporation device body, within which a plurality of thermal conductors that are contacted with one another for thermal conduction is disposed, wherein several holes are provided in each of the thermal conductors, and coating material for evaporation are provided within the holes of the thermal conductors, the spaces formed between the thermal conductors and the evaporation device body, and/or the spaces formed among the thermal conductors. With this evaporation device, better heat transfer can be achieved so that the overall heating temperature can be reduced, thus minimizing decomposition of organic material.

Abstract: The present invention provides a crucible of a coating machine The crucible includes a heat conduction device installed inside the crucible. The heat conduction device includes one or multiple radial metal wires or metal strips disposed along a radial direction of the crucible, and one or multiple axial metal wires or metal strips disposed along an axial direction of the crucible. By the heat conduction device formed by metal wires or metal strips, it can achieve a better heat conduction such that the heating temperature of the organic material placed in the crucible is uniform to achieve the steady state of thermal equilibrium. And the crucible can fill more material, increase evaporation rate, decrease the number of refilling the material, and improve production efficiency.

Abstract: The present invention provides a heat conduction device included crucible, which includes: a crucible body and a heat conduction device arranged in the crucible body. The heat conduction device has a tree-like configuration, which includes a heat-dissipative trunk and multiple levels of heat dissipative branches mounted to the heat-dissipative trunk. Each level of the heat dissipative branches includes a plurality of branch units and the branch units are arranged to project out from an outer surface of the heat-dissipative trunk.

Abstract: The present invention provides a sulfonyl group-contained compound, organic electroluminescent device using the same, and a preparation method thereof. The sulfonyl group-contained compound is presented by the following formula: in which R1, R2, and R3 are alkyl groups, aromatic ring groups, —CN or —OCH3 and R1, R2, and R3 are linked in position 2 or 3 of benzene ring. The sulfonyl group-contained compound of the present invention combines three thiofluorenes to form a novel sulfonyl group-contained compound with dendrimer structure, which combines properties of electron affinity and electron transportation of thiofluorene and also combines dimension property of dendrimer structure. When the sulfonyl group-contained compound is used in a light-emitting layer or an electron transport layer of an organic electroluminescent device, the efficiency and the lifespan of the organic electroluminescent device can be increased.

Abstract: A game set for education and amusement includes a plurality of large cylindrical game pieces of nine different colors and a plurality of small game pieces of nine different colors preferably corresponding to the nine colors of the large game pieces. Pieces of a given color are also provided with a corresponding number selected from one through nine on one side. All pieces of a given color share the same numerical indicia. Large game pieces also include either a white or a black mark on a second side. A game board includes eighty-one depressions formed therein having a cylindrical shape corresponding to that of the eighty-one large pieces. A customized tray allows for holding all game pieces. An instruction manual containing written instructions for playing Sudoku, Checkers and Go using the large and small pieces and the game board is also provided.

Abstract: A search engine system is described herein that provides an alternative data path for collecting results provided by index servers. The alternative data path collects the results in a direct and asynchronous manner; this is in contrast to a synchronous path used to deliver search results to end users via one or more aggregator modules. An analysis system can use the alternative data path to collect a large amount of richly descriptive information regarding the performance of the search engine system, circumventing bottlenecks and other constraints that would otherwise be imposed by the synchronous data path. The analysis system can analyze the information collected from the index servers to improve the performance of the search engine system.

Abstract: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

Abstract: A search engine system is described herein that provides an alternative data path for collecting results provided by index servers. The alternative data path collects the results in a direct and asynchronous manner; this is in contrast to a synchronous path used to deliver search results to end users via one or more aggregator modules. An analysis system can use the alternative data path to collect a large amount of richly descriptive information regarding the performance of the search engine system, circumventing bottlenecks and other constraints that would otherwise be imposed by the synchronous data path. The analysis system can analyze the information collected from the index servers to improve the performance of the search engine system.

Abstract: A method for conversion between a decimal floating-point number and an order-preserving format has been disclosed. The method encodes numbers in the decimal floating-point format into a format which preserves value ordering. This encoding allows for fast and direct string comparison of two values. Such an encoding provides normalized representations for decimal floating-point numbers and supports type-insensitive comparisons. Type-insensitive comparisons are often used in database management systems, where the data type is not specified for values to compare. In addition, the original decimal floating-point format can be recovered from the order-preserving format.

Abstract: The claimed subject matter relates to a computer-implemented architecture that can, at a high level, store query results in a location-independent manner in order to facilitate caching of local results. To store query results in a location-independent manner such that cached results to location-based queries can be useful, the architecture can further include a mechanism for encoding a surface or area (e.g., the earth) based upon document density rather than geography. The encoding mechanism can also organize an inverted index so that no join operation is required to return valid results to a location-based query. The architecture can also include a mechanism for determining when previously cached results are adequate to satisfy a query.

Abstract: A system and method for automatically extracting relevant key concepts from a free-text document and indexing the document using the extracted key concepts. The indexing mechanism applies syntactic and semantic filters to filter out irrelevant terms. The remaining terms are deemed to be key concepts for the free-text document. An input search query is compared against the key concepts extracted for the free-text document for determining whether the document satisfies the query. Prior to applying the search query, additional scenario-specific terms are added to the search query in order to improve retrieval performance. The query expansion mechanism generates a list of candidate expansion concepts, filters the list of candidate expansion concepts based on a user-entered scenario concept, and expands the input query based on the candidate expansion concepts remaining after the filtering process.

Abstract: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

Abstract: A new sub-document versioning method for record storages of XML documents which uses virtual cutting points to ensure that a search tree is able to support multiple versions of sub-documents and provide efficient mechanisms for XML updating. Record boundaries and virtual cut points divide the two-dimensional space, the horizontal axis representing node identifiers in document order and vertical axis representing version numbers, into rectangles. The bottom corner of the rectangle is used to represent the rectangles and the corresponding information of the corner is added to the search tree index.

Abstract: A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

Abstract: A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

Abstract: A method and system for evaluating a path query are disclosed. The path query corresponds to a query tree including a plurality of query nodes. At least one query node corresponds to at least one predicate and is at a level. The predicate(s) are evaluated for previous query node(s). The method and system include scanning data nodes of a document and determining if the data nodes match the query nodes. The method and system also include placing data related to the data node in match stacks corresponding to matched query nodes. The data for the query node(s) include attribute(s) corresponding to the predicate(s). The method and system further include propagating a matching of the at least one query node backward to a matching of the at least one previous query node.

Abstract: The claimed subject matter relates to a computer-implemented architecture that can, at a high level, store query results in a location-independent manner in order to facilitate caching of local results. To store query results in a location-independent manner such that cached results to location-based queries can be useful, the architecture can further include a mechanism for encoding a surface or area (e.g., the earth) based upon document density rather than geography. The encoding mechanism can also organize an inverted index so that no join operation is required to return valid results to a location-based query. The architecture can also include a mechanism for determining when previously cached results are adequate to satisfy a query.