Chinese Academy of Sciences

Beijing Hili Technology Co. Ltd.

Shanghai 3ntv Network Technology Co. Ltd.

Peking University

Beijing Acell Technology Co., Ltd.

Beijing Vitalstar Biotechnology Co., Ltd.

Beihao Stem Cell and Regenerative Medicine Translational Research Institute

Beijing Intellix Technologies Co. Ltd.

Beijing Intellix Technology Company Limited

Jinlin Wang

Lingfang Wang

Gang Cheng

Haojiang Deng

Jiali You

Xiaozhou Ye

Jun Chen

Weining Qi

Yiqiang Sheng

Xue Ping Liu

Shoujiang Dang

Jun Xu

Peng Sun

Jiaqi Li

Yan Shi

Hongkui Deng

Feng Deng

Hao Ren

Shaowei Su

Xiangdong Qi

Wu Zhang

Yi Liao

Ming Yin

Zhentan Feng

Yuanyuan Du

Zhichuan Guo

Yanxia Li

Chengang Xiang

Jun Jia

Nan Song

Pufang Ma

Yifeng Lu

Zhongzhen Yang

Liheng Tuo

Zhaolin Liu

Linlin Hu

Ziqiang Huan

Tingyi Li

A system for providing exact communication delay guarantee of a request response for a distributed service, includes: a plurality of service provider nodes, a management node, and a plurality of proxy nodes; a set of users served by each service provider node constitutes a coverage area of the node; a communication delay between any user in the coverage area and the service provider node is less than a predetermined delay guarantee value; a physical network enables, according to division of the coverage areas of the service provider nodes, each user in the network to be located in a coverage area, and each user is served by at least one service provider node; and the coverage area includes a plurality of adjacent areas, and each service provider node has a plurality of adjacent nodes. In the system, each user can complete service request and response within a determined communication delay range.

System for providing exact communication delay guarantee of request response for distributed service

A method for propagating a movement event message of a network entity, including: step 1) a network device maintaining a historical forwarded information list, wherein a network device capable of receiving a movement event message from an external system or device maintains an uplink port information table; step 2) after receiving the message, the network device performs matching using the table to obtain a forwarding port and forwarding information of the message, and constructs a movement event forwarding message using the information and forwards through the forwarding port; and step 3) after a device receives the message, searching for a matching forwarding port and forwarding information of the message in the information list, modifying the message using the forwarding information, and forwarding the modified message through the forwarding port. The method is able to propagate a movement event message to a network device responsible for related data transmission and forwarding.

Method for propagating movement event message of network entity

A method for inducing reprogramming of a cell of a first type which is not a non-hepatocyte (non-hepatocyte cell), into a cell with functional hepatic drug metabolizing and transporting capabilities, is disclosed. The non-hepatocyte is induced to express or overexpress hepatic fate conversion and maturation factors, cultured in somatic cell culture medium, hepatocyte cell culture medium and hepatocyte maturation medium for a sufficient period of time to convert the non-hepatocyte cell into a cell with hepatocyte-like properties. The iHeps induced according to the methods disclosed herein are functional induced hepatocytes (iHeps) in that they express I and II drug-metabolizing enzymes and phase III drug transporters and show superior drug metabolizing activity compared to iHeps obtained by prior art methods. The iHeps thus provide a cell resource for pharmaceutical applications.

Methods for reprograming non-hepatocyte cells into hepatocyte cells

A programmable network technology-based multi-homed network routing and forwarding method includes a data packet performing address-to-port matching a forwarding flow table address matching method; classifying addresses to matched ports corresponding to a destination address group; selecting a link information table and a port selection function, an appropriate port and a corresponding destination address group; cropping destination address groups of the remaining ports using an address filtering function and previous hop information carried in data to further crop the remaining destination address groups and addresses in the destination address group, a single destination address can be determined using a single address selection method, taking the single destination address using a universal routing and forwarding method to forward a packet to the destination address; otherwise, packaging the destination address group, and using a single address selection method to determine the single destination address hop by hop until the destination address is reached.

Routing and forwarding method for multi-homed network based on programmable network technology

A query enhancement system for constructing an elastic field based on a time delay, including: dividing a network node to obtain a set of containers composed of several containers, wherein the containers are nested and each container includes a management node for performing node organization, neighbor maintenance and query services within the container. Further, a query enhancement method for constructing an elastic field based on a time delay includes: carrying out same-layer non-intersection full-coverage division on a network node to obtain a set of containers that are nested, and execute a query flow without a given low time delay requirement which uses an existing query technique and a nearby query flow with a given low time delay requirement which uses a distributed nearby querying method to carry out a nearby query; with an actual query time delay index Ti less than the requirement of an upper time delay limit Ts.

Query enhancement system and method for constructing elastic field based on time delay

A ICN packet forwarding method, including: step 1) maintaining, by a network forwarding device, a network entity ID association state table, which is used for recording a state of the binding relationship between a network entity ID and a network address to which the network entity is associatively bound; after a network address binding relationship of the network entity changes due to location movement thereof, adding or updating, by the network forwarding device, a record of the network entity in the network entity ID association state table according to notification information of the network entity; and step 2) upon receipt of an ICN packet, by the network forwarding device, determining whether the ICN packet needs to be processed, according to information of the current network entity ID association state table; if yes, forwarding after processing the ICN packet; otherwise, directly forwarding the packet.

ICN packet forwarding method

A method for generating a nested container with no intersection and same layer full coverage, including: giving a right undirected graph G(V, E, W) and network measurement index set {Ti} for dividing nodes in G, each network measurement index Ti corresponding to a Ci layer container set {Ci k}; deleting an edge weighing greater than Ti, and segmenting G into subgraphs, each a connected component; setting all nodes in the subgraph Gcm not in the Ci layer container as set L; selecting one node from set L as current anchor aj; starting with anchor aj, performing breadth-first search on all nodes in L and Ci+1 layer container containing aj with the path communicated therewith less than Ti forming a Ci layer container with anchor aj; setting j'=j+1, determining whether L is a null set; setting m=m+1, determining whether all subgraphs are processed; setting i=i&#x2212;1, and determining whether i=1 is satisfied.

Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium

A fast query method for a mobile network entity dynamic location information, using a distributed container hierarchical nested structure to process registration and queries for location information, includes: after a network entity connects to a network attachment point after moving and obtains a new network address assignment, determining a series of a registered container, and then registering new location information corresponding to where the network entity is currently located, the location information containing at least current network address information; when a network forwarding device learns that the network entity is currently un-reachable, querying the new location information of the network entity from the container where the network entity was located before moving; and the container where the network entity was located before moving, after receiving the query request, obtains the new location information of the network entity by searching in the container and in a peer neighboring container set.

Fast query method for dynamic location information of mobile network entity

A big data processing method based on a deep learning model satisfying K-degree sparse constraints comprises: step 1), constructing a deep learning model satisfying K-degree sparse constraints using an un-marked training sample via a gradient pruning method, wherein the K-degree sparse constraints comprise a node K-degree sparse constraint and a level K-degree sparse constraint; step 2), inputting an updated training sample into the deep learning model satisfying the K-degree sparse constraints, and optimizing a weight parameter of each layer of the model, so as to obtain an optimized deep learning model satisfying the K-degree sparse constraint; and step 3), inputting big data to be processed into the optimized deep learning model satisfying the K-degree sparse constraints for processing, and finally outputting a processing result. The method in the present invention can reduce the difficulty of big data processing and increase the speed of big data processing.

Big data processing method based on deep learning model satisfying k-degree sparse constraint

A multi-terminal interaction relation maintenance system and method, the interaction relation is states of performing instruction and data synchronization interaction by a plurality of terminals in the same service instance in a traffic service system. The system comprises an interaction service module and an interaction terminal. Terminals that have an interaction relation belong to the same bounding group, terminals in the same bounding group are served by the same service instance, the interaction service module manages the bounding group based on rules, comprising but not limited to creating, modifying and deleting the bounding group, provides a mutual addressing service for the terminals in the bounding group and also provides a service for a terminal to be bound or unbound with other terminals, and after mutually addressing by means of the interaction service module, terminals interact with each other by means of instruction and data interaction.

Multi-terminal interaction relation maintenance system and method

A distributed node intra-group task scheduling method includes: step) collecting resource state information and history service information about each node in a group; step) receiving a service request command and parsing the request command to obtain a request task; step) according to the resource state information and history service information about each node, calculating the resource utilization rate increment after each node in the group loads a task and the occupation condition of each kind of resource in the group; and according to a principle of making the resource utilization rate increment of each node in the group as low as possible and the occupation of each kind of resource in the group as balanced as possible, selecting service execution nodes in the group, and providing the request task by the selected service execution nodes.

Distributed node intra-group task scheduling method and system

The present invention relates to a method for a web service supporting synchronous hosting of multiple devices, comprising: a webpage of a web service includes a plurality of subservices corresponding to different types of terminal devices; when the web service is requested, the request is split between the subservices having synchronous relations and pushed to the terminal devices. The web server can simultaneously host and push related content to a plurality of connected devices, and can control a plurality of devices, the service logic between the pluralities of devices being determined when designed by the web service.

Method for web service supporting synchronous hosting of multiple devices

The present invention provides a communication method based on an assembled communication protocol stack. The method comprises: construct protocols to form protocol modules, and place the protocol modules into a protocol module library; extract required protocol modules from the protocol module library, and assemble the extracted protocol modules to form a communication protocol stack; install the assembled communication protocol stack into a protocol stack running device; and an application on the protocol stack running device implements data communication by using the installed protocol stack. The specific process of constructing protocol modules comprises: constructing execution codes of protocols corresponding to an operating system to form protocol modules; and defining PDUs, that is, defining a corresponding data length and a data structure when each protocol module is in a mutual input/output relationship with other protocol modules in the protocol module library.

Communication method and system based on assembled communication protocol stack

A system and method for providing an on-site service includes a plurality of nodes, each containing: a neighborhood node set generation module, for generating a neighborhood node set on the basis of the bidirectional link bandwidth between a local node and a neighboring node; a neighborhood information index table generation module, for generating a neighborhood information index table of the local node; a candidate service point selection module, for selecting according to a selection function a candidate service node from the set of neighboring nodes; the definition of the selection function being: for a current service request, computing the difference between the QoS of the neighboring node i executing the service request and the QoS of the local node executing the service request; if the computed difference is smaller than a set threshold, the neighboring node i serving as the candidate service node; a service scheduling module, for receiving status information and feedback information provided in real time by the candidate service node, and selecting, on the basis of this information, a candidate node or the local node to serve as the service-executing node.

System and method for providing an on-site service

The present invention relates to a multi-protocol routing system, comprising a route determining module and a forwarding module which are located in network layer, wherein the route determining module is used for determining, based on the related information of applications and networks, the types of routable protocols and the next-hop path which are to be selected in the current routing phase; the forwarding module, including different routable protocols and corresponding routing information, is used for periodically calculating the newest remaining network resources and the state of link during a routing process and updating the forwarding table in current state. By integrating various characteristics and states of applications as well as different routable protocols, the present invention realizes real-time protocol selection and dynamic routing. Moreover, the present invention is easy to be expanded to other protocols, thus being adaptive to the continuous development and evolution of network services.

Multi-protocol routing system and method driven by application and network in convergence

Growing community of inventors

Beijing, China

Jinlin Wang