Microsoft Technology Licensing, LLC

Alibaba Group Holding Limited

Lenovo (beijing) Limited

Beijing Lenovo Software Ltd.

Microsoft Corporation

China Building Materials Academy Co., Ltd.

Hua Cai

Jiang Tao Li

Jian-guang Lou

Shipeng Li

Qi Zhou

Tingtao Sun

Jianguang Lou

Guobin Shen

Jian Tang

Chong Luo

Yusuo Hu

Jian Wang

Heung-Yeung Shum

Yan Wang

Regis J Crinon

Hui Liu

Jing Yan Ma

Chang Liu

Xu Han

Jia Qu

Ang Li

Zixiang Xiong

Guangping Gao

Jinsheng Jia

Bing Zeng

Hong-Hui Sun

Baogang Yao

Yonggang Huang

Yaojiang Du

Yihua Xu

Long Meng

Wenjing Qin

Hao Lin

Jiao Lian

Tiezhu Bo

Shiyong Xie

Shuaiqi Li

Ze-wen Zhang

A capillary array includes a capillary region, including capillaries of a first glass, which are disposed in an axis-parallel manner. A low refractive index layer is disposed on an inner wall of each of the capillaries, the refractive index of each low refractive index layer being less than a refractive index of a liquid scintillator. A second glass material is disposed between adjacent capillaries. A softening point of the first glass is T, a softening point of second glass is T, and a value of Tminus Tis in a range from 30° C. to 50° C. A thermal expansion coefficient of the first glass is α. An edge covering region is disposed on an outer side of the capillary region and makes contact with an outer side face of the capillary region, wherein a material of the edge covering region is a third glass.

Capillary array and preparation method and application therefor

A job scheduling method including notifying, by a first control node scheduling a first task, a second control node scheduling a second task to obtain execution data generated by at least one task instance of the first task when the at least one task instance of the first task completes execution; obtaining, by the second control node, the execution data generated by the at least one task instance of the first task and assigning the execution data to each task instance of the second task; and scheduling, by the second control node, an execution of at least one task instance of the second task and processing the execution data. The techniques of the present disclosure improve scheduling efficiency and resource utilization rate.

Job scheduling method, device, and distributed system

Semi-structured source data is preprocessed to obtain text partitions to be stored into a data table with a first combined primary key including a structure thread primary key and a sequence value primary key. The structure thread primary key identifies a structure thread that is segmented into several consecutive intervals according to a determined or predetermined sequence. An inverted index table, created for the preprocessed text partitions, includes a second combined primary key including the structure thread primary key and a keyword primary key. Corresponding to values of the primary keys in the second combined primary key, related text partition sequence IDs are recorded as index values of the inverted index table. Index values having a same keyword primary key value but different structure thread primary key values are located in different rows in the inverted index table. The present techniques improve query efficiency of database index and facilitate updating.

Creating NoSQL database index for semi-structured data

An information processing method and an electronic device are provided in the present disclosure. The method includes: acquiring an adjustment instruction to an icon object in a display content, where the adjustment instruction includes parameter information, a display mode of at least one of the icon object of a first type and the icon object of a second type is determined according to the parameter information, the icon object of a first type is configured to carry the icon object of a second type; adjusting the icon object in the display content based on the parameter information in response to the adjustment instruction to make the icon object present an adjusted display effect via the display unit.

Information processing method and electronic device

Display screen or portion thereof with graphical user interface

Embodiments of the present application relate to a method, a system and a computer program product for monitoring execution of a user request on a distributed system. A method for monitoring execution of user requests on a distributed system is provided. The method includes sampling a user request received by a plurality of servers, generating an identifier corresponding to the user request sampled by the plurality of servers, injecting tracking interfaces in advance into processes executed by the plurality of servers, determining whether the current process contain the identifier corresponding to the user request, in the event that the current process contains the identifier corresponding to the user request when the process has executed the tracking interface, recording information corresponding to the identifier relating to the function indicated by the tracking interface and generating a log, and individually collecting the generated log according to the corresponding identifier.

Method and system for monitoring execution of user request in distributed system

Embodiments of the present application relate to a code coverage rate determination method, a code coverage rate determination system, and a computer program product for determining code coverage rate. A code coverage rate determination method is provided. The method includes retrieving source code of a program, determining theoretical number of log file output points included in the source code and location information of the log file output points, retrieving log files actually outputted during the execution of the program, determining an actual number of log file output points of the actual outputted log files based on the location information of the corresponding log file output points recorded in each log file, and determining a code coverage rate of the program based on the theoretical number of log file output points and the actual number of the log file output points of the actual outputted log files.

Code coverage rate determination method and system

Described herein is technology for, among other things, multiview coding with geometry-based disparity prediction. The geometry-based disparity prediction involves determining corresponding block pairs in a number of reconstructed images for an image being coded. The reconstructed images and the image represent different views of a scene at a point in time. Each corresponding block pair is projected on the image. This enables determination of disparity vector candidates. For each coding block of the image, a predicted disparity vector is determined based on the disparity vector candidates. Then, the predicted disparity vector may be utilized to obtain the bits to be encoded. The geometry-based disparity prediction reduces the number of encoded bits.

Multiview coding with geometry-based disparity prediction

A streaming media codec may include a collection of media stream processing modules arranged into a processing graph. One or more of the modules may perform a Fourier-related transform, and a significant fraction of media stream processing may occur post-transform. The media stream may be considered as a sequence of processing blocks, and post-transform processing blocks contain transform coefficients. Such transform coefficients are amenable to classification into processing classes. Some processing classes may require significantly less processing effort than others by post-transform processing modules. Such transform coefficient classes may be efficiently specified, for example, with coefficient bounding rectangles, and the specification provided to one or more post-transform streaming media processing modules to enable the modules to allocate their processing resources more effectively. Streaming media processing modules making effective use of the transform coefficient class information, and streaming media codecs that incorporate them, are called transform coefficient bounding (TCB) enhanced.

Streaming media codec with transform coefficient bounding

Disclosed herein are one or more embodiments that facilitate compression of a source file having a fixed-length record therein. One or more of the disclosed embodiments detect the fixed-length records and determine a reordering plan for the source file, including determining a plurality of column groupings within the detected fixed-length records.

Detecting and reordering fixed-length records to facilitate compression

Video data from an upload client is received at a hosting node. A request from a download client is received at a bootstrapping node to receive the video data. The download client to receive the video data directly from the hosting node when the hosting node is below a threshold, wherein the threshold is based at least in part on the maximum number of download clients the hosting node can stream to simultaneously. The download client to receive the video data from peers in a peer-to-peer overlay when the hosting node above the threshold.

Peer-to-peer aided live video sharing system

Described is an image compression technology by which a coefficient representative of a chrominance component corresponding to an (x, y) coordinate pair is coded into a symbol, along with plurality of context events associated with that symbol, to facilitate more efficient context-based arithmetic coding. For example, four context events may be generated, including one context event based on the corresponding (x, y) coefficient value in the luminance component, and three context events based on other luminance coefficients that have adjacent horizontal, vertical and diagonal relationships with the corresponding luminance component's coefficient, respectively. In one example implementation, coding the chrominance coefficient and computing the plurality of context events occurs in a zero coding pass of an entropy coder. A sign coding pass and a magnitude refinement pass may be performed to obtain further symbols for the context-based arithmetic coding.

Color image coding using inter-color correlation

Motion-compensated video coding that employs fine-granular computational complexity scalable motion estimation is described. The scalable motion estimation technique adapts to varying computational limitations of the device performing the video coding technique. The scalable motion estimation technique calculates a predicted priority for each macroblock in a frame and identifies a set of macroblocks based on the predicted priority. A pass is then performed on each macroblock within the set. The pass checks a set of candidate motion vectors for each macroblock in the set and determines a new starting point for the next pass of the macroblocks during processing of the same frame. The predicted priority for each macroblock within the set of macroblocks is re-calculated and the process repeats by identifying another set of macroblocks and performing a pass on them. These repeats until a computation limit associated with the device performing the passes has been reached.

Framework for fine-granular computational-complexity scalable motion estimation

Described is fast motion estimation based upon epipolar geometry, which can be used in compressing multi-view video. An epipolar line is computed based on a point (e.g., a centroid point) in a macroblock to be predicted, and a temporary starting point in an image is determined, such as a median predicted search center. A search starting point is further determined based on the temporary starting point and the epipolar line, e.g., a point on the epipolar line corresponding to an intersecting line that is projected orthogonally from the temporary point to the epipolar line. A motion estimation mechanism searches the search space to produce a motion vector. The search may be conducted starting at the search starting point in a reduced search area located around the epipolar line, e.g., a local diamond search and/or rotated unsymmetrical rood-pattern search.

Epipolar geometry-based motion estimation for multi-view image and video coding

Growing community of inventors

Beijing, China

Hua Cai