Настройки

Укажите год
-

Небесная энциклопедия

Космические корабли и станции, автоматические КА и методы их проектирования, бортовые комплексы управления, системы и средства жизнеобеспечения, особенности технологии производства ракетно-космических систем

Подробнее
-

Мониторинг СМИ

Мониторинг СМИ и социальных сетей. Сканирование интернета, новостных сайтов, специализированных контентных площадок на базе мессенджеров. Гибкие настройки фильтров и первоначальных источников.

Подробнее

Форма поиска

Поддерживает ввод нескольких поисковых фраз (по одной на строку). При поиске обеспечивает поддержку морфологии русского и английского языка
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Ведите корректный номера.
Укажите год
Укажите год
Применить Всего найдено 35. Отображено 35.
26-03-2015 дата публикации

Statistical Analysis using a graphics processing unit

Номер: US20150088936A1
Автор: Lei Wang, Min Wang, Liu Keyan, Shimin Chen, Xing-Xing Ju, WANG LEI, WANG MIN, KEYAN LIU, CHEN SHIMIN, JU XING-XING
Принадлежит:

A data structure having plural elements may be divided into plural sections, each section including a portion of the plural elements. The data structure may include information related statistical analysis. Instructions may be generated to execute a function on the data structure on a section-by-section basis. These instructions may be executed by a graphics processing unit. 1. A method , comprising:dividing a data structure into plural sections, the data structure having plural elements, wherein each section comprises a portion of the plural elements, and wherein the data structure contains information related to statistical analysis;generating instructions to execute a function on the data structure on a section-by-section basis; andexecuting the instructions on a graphics processing unit (GPU).2. The method of claim 1 , wherein the data structure includes a matrix.3. The method of further comprising storing the matrix into a table claim 2 , wherein a particular row in the table corresponds to a particular section of the matrix.4. The method of further comprising storing the matrix in column-major form in a memory associated with the GPU.5. The method of claim 1 , wherein the function comprises algebraic matrix operations.6. The method of claim 5 , wherein the function is created by a user to extend a database programming language.7. The method of claim 6 , wherein the database programming language is PostgreSQL.8. The method of claim 1 , wherein executing the instructions comprises invoking GPU libraries associated with the GPU.9. A system claim 1 , comprising:a processor;a graphics processing unit (GPU); and divide a data structure into plural sections, the data structure having plural elements, wherein each section comprises a portion of the plural elements, and wherein the data structure contains information related to statistical analysis;', 'generate particular instructions to execute a function on the data structure on a section-by-section basis; and', ' ...

Подробнее
Номер записи: 1
31-05-2018 дата публикации

METHOD AND APPARATUS FOR FILE COMPACTION IN KEY-VALUE STORE SYSTEM

Номер: US20180150472A1
Автор: Shimin Chen, Liangchang Zhu, Jun Zhang
Принадлежит: Huawei Technologies Co Ltd

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.

Подробнее
Номер записи: 2
03-05-2022 дата публикации

Adhering device and adhering method

Номер: US0011318664B2
Автор: Shimin Chen
Принадлежит: Wuhan China Star Optoelectronics Semiconductor Display Technology Co., Ltd.

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.

Подробнее
Номер записи: 3
10-07-2018 дата публикации

Event log system

Номер: US0010019471B2
Автор: Zhao Cao, Shimin Chen, Feifei Li, Min Wang, Xiaoyang Wang, CAO ZHAO, CHEN SHIMIN, LI FEIFEI, WANG MIN, WANG XIAOYANG, Cao, Zhao, Chen, Shimin, Li, Feifei, Wang, Min, Wang, Xiaoyang
Принадлежит: Hewlett Packard Enterprise Development LP, HEWLETT PACKARD DEVELOPMENT CO, CAO ZHAO, CHEN SHIMIN, LI FEIFEI, WANG MIN, WANG XIAOYANG, HEWLETT PACKARD ENTPR DEV LP, Hewlett-Packard Development Company, L.P., Cao Zhao, Chen Shimin, Li Feifei, Wang Min, Wang Xiaoyang

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.

Подробнее
Номер записи: 4
03-08-2004 дата публикации

System and method for improving index performance through prefetching

Номер: US0006772179B2
Автор: Shimin Chen, Phillip B. Gibbons, Todd C. Mowry, CHEN SHIMIN, GIBBONS PHILLIP B, MOWRY TODD C, GIBBONS PHILLIP B., MOWRY TODD C.
Принадлежит: Lucent Technologies Inc., LUCENT TECHNOLOGIES INC, LUCENT TECHNOLOGIES INC.

The present invention provides a prefetch system for use with a cache memory associated with a database employing indices. In one embodiment, the prefetch system includes a search subsystem configured to prefetch cache lines containing an index of a node of a tree structure associated with the database. Additionally, the prefetch system also includes a scan subsystem configured to prefetch cache lines based on an index prefetch distance between first and second leaf nodes of the tree structure.

Подробнее
Номер записи: 5
25-01-2022 дата публикации

Method and apparatus for file compaction in key-value store system

Номер: US0011232073B2
Автор: Shimin Chen, Liangchang Zhu, Jun Zhang
Принадлежит: HUAWEI TECHNOLOGIES CO., LTD.

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.

Подробнее
Номер записи: 6
17-03-2016 дата публикации

QUERY FEATURES AND QUESTIONS

Номер: US20160078087A1
Автор: Lei Wang, Ye Pan, Shimin Chen, Hui Fang, Shicong Feng
Принадлежит:

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. 1. A system comprising:a first classifier which, if executed, instructs at least one processor to determine whether a current query comprises a substantially specific question based at least partially on whether the current query comprises a predefined feature;a second classifier which, if executed, instructs at least one processor to validate a determination of whether the current query comprises the substantially specific question based at least partially on an analysis of past queries that are related to the current query; anda third classifier which, if executed, instructs at least one processor to validate the determination of whether the current query comprises the substantially specific question based at least partially on an analysis of query suggestions generated by a search engine for the current query.2. The system of claim 1 , wherein the predefined feature comprises a syntax feature claim 1 , a semantic feature claim 1 , or a speech pattern feature.3. The system of claim 1 , wherein the related past queries have at least one word in common with the current query.4. The system of claim 3 , wherein if the determination indicates that the current query does not comprise the substantially specific question claim 3 , the second classifier claim 3 , if executed claim 3 , instructs at least one processor to:assemble a duster of related past queries such that an intent of each query in the duster is substantially similar to that of the current query;analyze features of queries in the duster; andif the features indicate that a predetermined number of ...

Подробнее
Номер записи: 7
14-05-2015 дата публикации

Concept Categorization

Номер: US20150134667A1
Автор: Hui-Man Hou, Lijiang Chen, Shimin Chen, Peng Jiang, HOU HUI-MAN, CHEN LIJIANG, CHEN SHIMIN, JIANG PENG
Принадлежит:

Systems, methods, and computer-readable and executable instructions are provided for categorizing a concept. Categorizing a concept can include selecting a target concept with a number of surrounding textual contexts. Categorizing a concept can also include determining a number of candidate categories for the target concept based on the number of surrounding textual contexts. Categorizing a concept can also include selecting a predefined number of articles, each with a desired relatedness to the number of candidate categories. Furthermore, categorizing a concept can include calculating a relatedness score for each of the number of candidate categories based on a relatedness with the number of articles. 1. A method for categorizing concepts , comprising:selecting a target concept with a number of surrounding textual contexts from an article;determining a number of candidate categories for the target concept based on the number of surrounding textual contexts;selecting a number of additional articles, each with a desired relatedness to the number of candidate categories; andcalculating a relatedness score for each of the number of candidate categories based on a relatedness with the number of articles.2. The method of claim 1 , wherein selecting the number of additional articles includes eliminating a number of articles with a number of links below a predetermined threshold.3. The method of claim 1 , wherein selecting the number of additional articles includes eliminating a number of articles exceeding a predetermined threshold.4. The method of claim 3 , wherein eliminating articles exceeding the predetermined threshold includes calculating the relatedness between each article and a number of other articles in the number of candidate categories.5. The method of claim 1 , wherein calculating the relatedness score includes supplementing a number of numerical values for a candidate category if the number of articles are below a predetermined threshold.6. The method of ...

Подробнее
Номер записи: 8
13-11-2014 дата публикации

Similarity Score Lookup and Representation

Номер: US20140337337A1
Автор: Lijiang Chen, Hui-Man Hou, Shimin Chen, CHEN LIJIANG, HOU HUI-MAN, CHEN SHIMIN
Принадлежит:

Facilitating information retrieval and improving similarity score computations among objects, via a compactor component that interacts with a layered memory structure. Data structures (e.g., tuples) that are associated with objects can be compacted into a condensed format, via employing a layered memory structure. The system further includes a sorting component that is operatively coupled with the “compactor component”, to reduce memory space that is required to store and retrieve similarity scores related to various objects. 2. The system of further comprising a sorting component that sorts tuples associated with objects in an ascending order.3. The system of claim 1 , wherein objects are representable as a three-tuple of claim 1 , wherein i an j represent integers that indicate object identifications claim 1 , and score represents a floating number that ranges from 0 to 1.4. The system of claim 2 , wherein the sorting component and the divider component are part of the compactor component.5. The system of further comprising an inference component that facilitates compacting a data structure associated with the similarity score lookup in to the layered memory structure.6. The system of further comprising a pointer that one of connects the first layer to the second layer claim 3 , or the second layer to the third layer.7. The system of claim 2 , wherein the similarity among objects computed in context of a database content.8. A system that facilitates a similarity-score-lookup between objects comprising:at least one memory that stores computer-executable instructions; sort tuples of objects associated with the similarity-score-lookup;', 'divide identification for an object to a basic segment and a delta differentiation segment;', 'store the basic segment in a layer of a three layered memory structure and the delta differentiation segment in another layer of the three layered memory structure., 'at least one processor that facilitates ...

Подробнее
Номер записи: 9
04-02-2016 дата публикации

CO-PROCESSOR-BASED ARRAY-ORIENTED DATABASE PROCESSING

Номер: US20160034528A1
Автор: Indrajit Roy, Feng Liu, Vanish Talwar, Shimin Chen, Jichuan Chang, Parthasarathy Ranganathan
Принадлежит:

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. 1. A method comprising:receiving a user input in an array-oriented database, the user input indicating a database operation; andprocessing a plurality of chunks of data stored by the database to perform the database operation, the processing comprising 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.2. The method of claim 1 , further comprising selectively partitioning at least one chunk of a subset of the chunks based at least in part on whether the subset is being processed by the first group of at least central processing unit or by the second group of at least one co-processor.3. The method of claim 2 , wherein selectively partitioning the at least one chunk of the subset comprises partitioning the at least one chunk if the subset is allocated to a central processing unit of the first group.4. The method of claim 1 , further comprising selectively merging at least two chunks of a subset of the chunks based at least in part on whether the subset is being processed by the first group of at least central processing unit or by the second group of at least one co-processor.5. The method of claim 4 , wherein selectively merging the at least two chunks of the subset comprises merging the at least two chunks if the subset is allocated to a co-processor of the second group.6. The method of claim 1 , further comprising formatting at least one chunk of a subset of the chunks based at least in part on whether the subset is being processed ...

Подробнее
Номер записи: 10
28-07-2016 дата публикации

INFORMATION EXTRACTION

Номер: US20160217393A1
Автор: Xiaofeng Yu, Shimin Chen, YU XIAOFENG, CHEN SHIMIN, Yu Xiaofeng, Chen Shimin
Принадлежит: Hewlett-Packard Development Company, L.P.

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.

Подробнее
Номер записи: 11
03-07-2003 дата публикации

System and method for improving index performance through prefetching

Номер: US20030126116A1
Автор: Shimin Chen, Phillip Gibbons, Todd Mowry
Принадлежит: Lucent Technologies Inc.

The present invention provides a prefetch system for use with a cache memory associated with a database employing indices. In one embodiment, the prefetch system includes a search subsystem configured to prefetch cache lines containing an index of a node of a tree structure associated with the database. Additionally, the prefetch system also includes a scan subsystem configured to prefetch cache lines based on an index prefetch distance between first and second leaf nodes of the tree structure.

Подробнее
Номер записи: 12
06-08-2019 дата публикации

Glass substrate separation method and glass substrate separation device

Номер: US0010374161B2
Автор: Shimin Chen, CHEN SHIMIN, Chen, Shimin
Принадлежит: WUHAN CHINA STAR OPTOELECTRONICS SEMICONDUCTOR DISPLAY TECHNOLOGY CO., LTD., WUHAN CHINA STAR OPTOELECTRONICS SEMICONDUCTOR DISPLAY TECH CO LTD, Wuhan China Star Optoelectronics Semiconductor Display Technology Co., Ltd.

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.

Подробнее
Номер записи: 13
07-01-2016 дата публикации

EVENT LOG SYSTEM

Номер: US20160004733A1
Автор: Cao Zhao, Chen Shimin, LI Feifei, Wang Min, Wang Xiaoyang
Принадлежит:

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. 1. An event log system , comprising:a plurality of worker nodes to receive and store event log records from a plurality of log sources; and 'wherein each of said worker nodes comprises an IngestKV module to temporarily store event log records from the plurality of log sources and a TimeRangeKV module to permanently store said event log records.', 'a coordinator node to maintain information about mapping from said plurality of log sources to said plurality of worker nodes,'}2. The event log system of claim 1 , wherein said TimeRangeKV module stores event log records based on a time range unit (TRU).3. The event log system of claim 2 , wherein all the event log records within the same TRU are stored on the same worker node.4. The event log system of claim 1 , wherein said IngestKV module is further to parse a received event log record into key-value pairs claim 1 , and said TimeRangeKV module is to store the event log record in a form of timestamp and key-value pairs.5. The event log system of claim 2 , wherein said IngestKV module is to cache a number of event log records and then shuffle the cached event log records to said TimeRangeKV module on a corresponding worker node in rounds for storage.6. The event log system of claim 2 , wherein the size of said TRU is dependent upon workload.7. The event log system of claim 5 , wherein during shuffling claim 5 , a number of worker nodes simultaneously receive shuffled event log records.8. The event log system of claim 7 , wherein the number of worker nodes that ...

Подробнее
Номер записи: 14
21-02-2019 дата публикации

GLASS SUBSTRATE SEPARATION METHOD AND GLASS SUBSTRATE SEPARATION DEVICE

Номер: US20190058122A1
Автор: Chen Shimin
Принадлежит:

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. 1. A glass substrate separation device , separating a glass substrate from an organic light emitting diode (OLED) , wherein the glass substrate separation device comprises a lifting off platform , a plurality of first vacuum adsorption devices , a separation wire and a second vacuum adsorption device , wherein the OLED is adsorbed and fixed on the lifting off platform , and the plurality of first vacuum adsorption devices is adsorbed on a first position of the glass substrate and separates the glass substrate from the OLED to form an opening , wherein a diameter of the opening is larger than a diameter of the separation wire , and the separation wire is moved from the opening at one end of the glass substrate to the other end of the glass substrate against a lower surface of the glass substrate to separate the glass substrate from the OLED , and the second vacuum adsorption device is adsorbed on a second position of the glass substrate to remove the glass substrate from the OLED.2. The glass substrate separation device according to claim 1 , wherein the lifting off platform is provided with a plurality of vacuum holes claim 1 , and the OLED is ...

Подробнее
Номер записи: 15
10-03-2016 дата публикации

Keyword search on databases

Номер: US20160070707A1
Автор: Lei Wang, Meng Guo, Shimin Chen, Yi Gong
Принадлежит: Hewlett Packard Development Co LP

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.

Подробнее
Номер записи: 16
02-06-2016 дата публикации

TOP-K Prefix Histogram Construction for String Data

Номер: US20160154854A1
Автор: Cao Zhao, Chen Shimin, GUO Weng, Jiao Li-Mei, Luo Ge
Принадлежит: Hewlett-Packard Development Company, L.P.

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. 1. A method of generation of a histogram for string data having strings , the method comprising:generating, by a computing device, a prefix tree having nodes representing prefixes of the strings, the nodes comprising leaf nodes representing longest prefixes of the strings and branch nodes representing longest common prefixes of prefixes represented by child-nodes branching out from the respective branch nodes;assigning, by the computing device, deploy weights to the nodes based on lengths of prefixes represented by sub-tree nodes rooted at the nodes and frequencies of the strings whose prefixes are represented by the sub-tree nodes, wherein 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;determining, by the computing device, a predefined number of Top-prefixes of the strings for filling up the predefined number of buckets, wherein the Top-prefixes are determined from the prefixes represented by the nodes based on ...

Подробнее
Номер записи: 17
16-07-2020 дата публикации

FLEXIBLE HARD COMPOSITE COATING, PREPARATION METHOD THEREOF, AND COATED CUTTER

Номер: US20200224319A1
Автор: Chen Shimin, Liang Feng, ZOU Changwei
Принадлежит:

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. 1. A flexible hard composite coating , comprising an AlCrN transition layer and a nanocomposite layer sequentially disposed on the surface of a substrate , the nanocomposite layer comprising CrON layers and AlON layers sequentially alternately arranged on the surface of the AlCrN transition layer.2. The flexible hard composite coating according to claim 1 , wherein a thickness of each CrON layer and a thickness of each AlON layer are independently 3˜20 nm respectively.3. The flexible hard composite coating according to claim 1 , wherein a quantity of the CrON layers is 10˜50.4. The flexible hard composite coating according to claim 1 , wherein the CrON layer contains 34˜45 at. % of chromium claim 1 , 12˜18 at. % of oxygen and 40˜50 at. % of nitrogen according to atomic percent.5. The flexible hard composite coating according to claim 4 , wherein the CrON layer comprises a CrN nanocrystalline and Cr2O3 amorphous nanocomposite structure.6. The flexible hard composite coating according to claim 1 , wherein the AlON layer contains 35˜43 at. % ...

Подробнее
Номер записи: 18
25-07-2019 дата публикации

SUBSTRATE AND METHOD FOR FABRICATING ORGANIC LIGHT-EMITTING DIODES

Номер: US20190229296A1
Автор: Chen Shimin
Принадлежит:

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. 1. A substrate comprising a first base layer , a binding layer , and a second base layer , wherein 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.2. The substrate according to claim 1 , wherein a thickness of the first base layer is larger than that of the second base layer.3. The substrate according to claim 2 , wherein the first base layer includes glass and the second base layer includes polyethylene terephthalate (PET).4. A method for fabricating organic light-emitting diodes comprising:providing a substrate including a first base layer, a binding layer, and a second base layer, wherein 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;forming a polyimide (PI) film on the second base layer;sequentially forming a first electrode layer, a function layer, a second electrode layer, and a package layer on the PI film;using ultraviolet rays to irradiate the first base layer of the substrate, thereby decomposing the binding layer; andpeeling off the first base layer to form organic light-emitting ...

Подробнее
Номер записи: 19
23-09-2021 дата публикации

DATA PROCESSING METHOD AND APPARATUS, ELECTRONIC DEVICE, AND STORAGE MEDIUM

Номер: US20210295100A1
Автор: Chen Shimin, NIU Songjie, Sun Shijie, YU Donghai, ZHOU Dongyan
Принадлежит: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED

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. 1. A data processing method comprising:obtaining a training sample set that includes a plurality of graph computing task training samples;extracting at least one performance indicator feature of each of the graph computing task training samples, the at least one performance indicator feature including one or more of a graph data feature, a graph processing platform feature, a graph algorithm feature, and a machine hardware feature;generating a target performance prediction model based on a mapping relationship between actual execution times of the graph computing task training samples and the performance indicator features; andoutputting, by processing circuitry 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 based on the target performance prediction model.2. The method according to claim 1 , wherein when the at least one performance indicator feature includes the graph data feature claim 1 , the extracting comprises:extracting a degree of each ...

Подробнее
Номер записи: 20
28-10-2021 дата публикации

DATA PROCESSING METHOD AND APPARATUS, ELECTRONIC DEVICE, AND STORAGE MEDIUM

Номер: US20210335025A1
Автор: Chen Shimin, NIU Songjie, Sun Shijie, YU Donghai, ZHOU Dongyan
Принадлежит: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED

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. 1. A data processing method , the method comprising:specifying a target walk vertex in a target graph;determining a historical walk vertex adjacent to the target walk vertex;obtaining first out-edge information transmitted from the historical walk vertex to the target walk vertex;obtaining a first out-neighbor set, the first out-neighbor set referring to a set of next possible vertexes to be walked to from the target walk vertex;determining an edge transition probability between the target walk vertex and each of the set of next possible vertexes in the first out-neighbor set according to the first out-edge information;determining a to-be-reached vertex of the set of next possible vertexes in the first out-neighbor set according to the edge transition probabilities;generating second out-edge information corresponding to the target walk vertex based on the first out-neighbor set;walking from the target walk vertex to the to-be-reached vertex;transmitting the second out-edge information to the to-be-reached vertex;determining the to-be-reached vertex as ...

Подробнее
Номер записи: 21
10-12-2015 дата публикации

GENERATING A HINT FOR A QUERY

Номер: US20150356143A1
Автор: Cao Zhao, Chen Shimin, Jiao Li-Mei, Wang Min
Принадлежит:

A method, system, and non-transitory computer readable medium for generating a hint for a query are disclosed. A model which represents relevance between attributes in a dataset is constructed based on historical data associated with the dataset. According to said model, statistics about the attributes are computed. And in response to a query input by a user, a hint is generated for the query based on the model and statistics. 1. A method for generating a hint for a query , comprising:based on historical data associated with a dataset, constructing a model which represents relevance between attributes in said dataset;according to said model, computing statistics about said attributes; andin response to a query input by a user, generating a hint for said query based on said model and said statistics.2. The method of claim 1 , wherein said model is a junction tree and wherein a node of said junction tree represents a set of attributes that are determined to be relevant and an edge of said junction tree represents a common attribute between two nodes connected by said edge.3. The method of claim 2 , wherein constructing a model which represents relevance between attributes based on historical data further comprises:building an undirected connected graph based on mutual information or chi-square between said attributes, wherein a node of said undirected connected graph represents an attribute and an edge between any two nodes in said connected graph represents said mutual information or chi-square;selecting from said connected graph a sub-graph which includes all the nodes in the junction tree; andconverting said sub-graph into said junction tree.4. The method of claim 1 , wherein said statistics include a histogram for each of said attributes and a joint histogram for each set of attributes that are determined to be relevant in said model.5. The method of claim 4 , wherein computing a histogram for each attribute further includes using at least one of top-k distinct ...

Подробнее
Номер записи: 22
10-12-2015 дата публикации

Generating a social circle for a user

Номер: US20150356167A1
Автор: Chen Lijiang, Chen Shimin
Принадлежит:

A technique for generating a social circle for a user of a social network is provided. A personalized circle-user graph (PCUG) model may be constructed based on friends of the user and social circles joined by the friends. At least partly based on connections between the friends and social circles in the PCUG model, the social circles may be ranked. A candidate social circle may be generated based on rankings of the social circles. 1. A method for generating a social circle for a user of a social network , comprising:constructing, by executing a module stored on a non-transitory computer-readable storage medium, a personalized circle-user graph (PCUG) model based on friends of the user and social circles joined by the friends;ranking the social circles at least partly based on connections between the friends and the social circles in the PCUG model; andgenerating a candidate social circle based on rankings of the social circles.2. The method of claim 1 , wherein before constructing the PCUG model claim 1 , the method further comprises:merging social circles according to similarity of names of the social circles.3. The method of claim 2 , wherein merging social circles according to similarity of names of the social circles comprises:processing names of social circles by applying word stemming to the names;clustering social circles based on a distance between the stemmed names of the social circles; andmerging social circles in a cluster into a single social circle.4. The method of claim 3 , further comprising:for each member of a merged social circle, assigning a weight to a connection between the merged social circle and the member, wherein the weight is a function of the number of constituent social circles containing the member in the merged social circle.5. The method of claim 1 , further comprising:identifying a friend of the user as a member of the candidate social circle if the friend is in the candidate social circle.6. The method of claim 5 , wherein after ...

Подробнее
Номер записи: 23
17-12-2015 дата публикации

PERFORMING AN INDEX OPERATION IN A MAPREDUCE ENVIRONMENT

Номер: US20150363467A1
Автор: Cao Zhao, Chen Shimin, MA Dongzhe, Wang Min
Принадлежит:

A method for performing an index operation in a MapReduce environment is provided. An execution plan is generated based on a conceptual job input by a user, wherein said conceptual job comprises an index operator, a mapper and a reducer and said execution plan is generated to minimize an execution cost based on characteristics of the index operator. The execution plan is converted to MapReduce jobs and the MapReduce jobs are provided to a runtime component for execution. 1. A method for performing an index operation in a MapReduce environment , comprising:generating an execution plan based on a conceptual job input by a user, wherein said conceptual job comprises an index operator, a mapper and a reducer and said execution plan is generated to minimize an execution cost based on characteristics of the index operator;converting said execution plan to MapReduce jobs; andproviding said MapReduce jobs to a runtime component for execution.2. The method of claim 1 , further comprising:during execution of said MapReduce jobs by said runtime component, collecting statistics about said index operator and indexes.3. The method of claim 1 , wherein the characteristics of the index operator comprise index locality claim 1 , repartitioning of input of said index operator claim 1 , and caching of index.4. The method of claim 1 , wherein said index operator can be located before a mapper claim 1 , between a mapper and a reducer claim 1 , or after a reducer.5. The method of claim 1 , wherein minimizing the execution cost is based on input locality.6. The method of claim 2 , further comprising:based on the collected statistics, reevaluating and dynamically adjusting the execution plan so that the execution cost of the adjusted execution plan is less than the execution cost of the current execution plan.7. The method of claim 1 , wherein a standard interface based on a primitive function is provided for said index operator so that a result of said index operator can be fed to a ...

Подробнее
Номер записи: 24
24-12-2015 дата публикации

APPROXIMATE QUERY PROCESSING

Номер: US20150370854A1
Автор: Cao Zhao, Chen Shimin, Guo Meng, Jiao Li-Mei, Wang Min
Принадлежит:

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. 1. A method for obtaining an approximate answer for a query on a database , comprising:converting said query into a set of sub queries with a canonical form;generating an approximate answer for each of said sub queries; andcombining approximate answers for said sub queries to obtain an approximate answer for said query.2. The method recited in claim 1 , wherein said canonical form is a disjunctive normal form (DNF).3. The method recited in claim 1 , wherein generating an approximate answer for each of said sub queries comprises utilizing either sampling in said database or a top-k histogram associated with said database to generate an approximate answer for each of said sub queries.4. The method recited in claim 2 , wherein said sub queries are connected by an operator OR claim 2 , and said combining is based on the law of addition.5. The method recited in claim 3 , wherein utilizing either sampling in said database or a top-k histogram associated with said database to generate an approximate answer for each of said sub queries further comprises:if an approximate answer for a sub query can be obtained directly according to the top-k histogram, then using the top-k histogram to get a preliminary approximate answer for said sub query, and using sampling to modify said preliminary approximate answer in order to obtain an modified approximate answer for said sub query; andif an approximate answer for a sub query cannot be obtained directly according to the top-k histogram, then using sampling to obtain a preliminary approximate answer for said sub query, and using the top-k histogram to modify said preliminary approximate answer in order to obtain an ...

Подробнее
Номер записи: 25
14-01-2015 дата публикации

Statistical Analysis Using Graphics Processing Unit

Номер: GB2516192A
Автор: Keyan Liu, Lei Wang, Min Wang, Shimin Chen, Xingxing Ju
Принадлежит: Hewlett Packard Development Co LP

A data structure having plural elements may be divided into plural sections, each section including a portion of the plural elements. The data structure may include information related statistical analysis. Instructions may be generated to execute a function on the data structure on a section-by-section basis. These instructions may be executed by a graphics processing unit.

Подробнее
Номер записи: 26
02-10-2014 дата публикации

Query features and questions

Номер: WO2014153776A1
Автор: Hui Fang, Lei Wang, Shicong Feng, Shimin Chen, Ye Pan
Принадлежит: Hewlett-Packard Development Company, L.P.

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.

Подробнее
Номер записи: 27
18-12-2014 дата публикации

Statistical analysis using a graphics processing unit

Номер: DE112012006119T5
Автор: Keyan Liu, Lei Wang, Min Wang, Shimin Chen, Xingxing Ju
Принадлежит: Hewlett Packard Development Co LP

Eine Datenstruktur mit einer Mehrzahl von Elementen kann in mehrere Abschnitte geteilt werden, wobei jeder Abschnitt einen Teil der mehreren Elemente enthält. Die Datenstruktur kann Informationen enthalten, die sich auf statistische Analyse beziehen. Anweisungen können erzeugt werden, um eine Funktion auf der Datenstruktur auf einer abschnittweisen Basis auszuführen. Diese Anweisungen können durch eine Grafikverarbeitungseinheit ausgeführt werden. A data structure with a plurality of elements can be divided into several sections, each section containing a part of the several elements. The data structure can contain information related to statistical analysis. Instructions can be generated to perform a function on the data structure on a section-by-section basis. These instructions can be carried out by a graphics processing unit.

Подробнее
Номер записи: 28
07-08-2014 дата публикации

Event log system

Номер: WO2014117298A1
Автор: Feifei Li, Min Wang, Shimin Chen, Xiaoyang Wang, Zhao Cao
Принадлежит: Hewlett-Packard Development Company, L.P.

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.

Подробнее
Номер записи: 29
07-02-2024 дата публикации

Bacillus natto for producing menaquinone-7 and use thereof

Номер: EP4317415A1
Автор: Chao Wang, Lei Shi, Linghui ZHENG, Min Zhang, QIONG Sun, Shimin Chen, XIANG Gao, Xiangping PENG
Принадлежит: Hubei Magic Health Technology Co Ltd

The present invention provides Bacillus natto for producing menaquinone-7. Bacillus natto is deposited at the China General Microbiological Culture Collection Center, the accession number being CGMCC No. 21799. The strain has few requirements for nutrients, has a high yield, has mild metabolism, is easy to regulate and control, and is suitable for industrial scale-up.

Подробнее
Номер записи: 30
20-07-2016 дата публикации

Information extraction

Номер: EP3044699A1
Автор: Shimin Chen, Xiaofeng Yu
Принадлежит: Hewlett Packard Development Co LP

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.

Подробнее
Номер записи: 31
19-03-2015 дата публикации

Information extraction

Номер: WO2015035593A1
Автор: Shimin Chen, Xiaofeng Yu
Принадлежит: Hewlett-Packard Development Company, L.P.

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.

Подробнее
Номер записи: 32
06-02-2014 дата публикации

Context-aware category ranking for wikipedia concepts

Номер: WO2014019126A1
Автор: Huiman Hou, Lijiang Chen, Peng Jiang, Shimin Chen
Принадлежит: Hewlett-Packard Development Company, L. P.

Systems, methods, and computer-readable and executable instructions are provided for categorizing a concept. Categorizing a concept can include selecting a target concept with a number of surrounding textual contexts. Categorizing a concept can also include determining a number of candidate categories for the target concept based on the number of surrounding textual contexts. Categorizing a concept can also include selecting a predefined number of articles, each with a desired relatedness to the number of candidate categories. Furthermore, categorizing a concept can include calculating a relatedness score for each of the number of candidate categories based on a relatedness with the number of articles.

Подробнее
Номер записи: 33
18-06-2024 дата публикации

Data processing method and apparatus, electronic device, and storage medium

Номер: US12014282B2
Автор: Donghai Yu, Dongyan Zhou, Shijie Sun, Shimin Chen, Songjie NIU
Принадлежит: Tencent Technology Shenzhen Co Ltd

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.

Подробнее
Номер записи: 34
18-07-2024 дата публикации

Bacillus natto for producing menaquinone-7 and use thereof

Номер: US20240240213A1
Автор: Chao Wang, Lei Shi, Linghui ZHENG, Min Zhang, QIONG Sun, Shimin Chen, XIANG Gao, Xiangping PENG
Принадлежит: Hubei Magic Health Technology Co Ltd

The present invention provides Bacillus natto for producing menaquinone-7. Bacillus natto is deposited at the China General Microbiological Culture Collection Center, the accession number being CGMCC No. 21799. The strain has few requirements for nutrients, has a high yield, has mild metabolism, is easy to regulate and control, and is suitable for industrial scale-up.

Подробнее
Номер записи: 35

©DocSearch.ru 2020-2024