Abstract: A big data processing method for a segment-based two-grade deep learning model. The method includes: step (1), constructing and training a segment-based two-grade deep learning model, wherein the model is divided into two grades in a longitudinal level: a first grade and a second grade, each layer of the first grade is divided into M segments in a horizontal direction, and the weight between neuron nodes of adjacent layers in different segments of the first grade is zero; step (2), dividing big data to be processed into M sub-sets according to the type of the data and respectively inputting same into M segments of a first layer of the segment-based two-grade deep learning model for processing; and step (3), outputting a big data processing result. The method of the present invention can increase the big data processing speed and shorten the processing time.

Abstract: 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.

Abstract: 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 t

Abstract: An SSH protocol-based session parsing method and system. The method includes: step 101) receiving an SSH protocol-based session data packet and respectively preprocessing the received data packet as follows: when one data packet contains several complete messages, extracting each complete message from the data packet; when the data packet contains an incomplete message, firstly caching the incomplete message contained in the current data packet, then receiving the subsequent data packet, and finally splicing the message contained in the subsequent data packet with content of the cached message until a complete message is spliced; and step 102) extracting a content associated with log generation from each obtained complete message, packaging the content associated with the log according to a set format, and then obtaining a parsed log and finishing the session parsing.

Abstract: The present invention relates to a method for accessing a switch external memory from a control plane and a data plane. A control module issues information about an authorized entity and an authorized operation to a switch, and the switch receives and stores the authorized information; the switch receives a file I/O operation instruction and determines whether an operation entity has the authority of the file I/O operation instruction according to the instruction and the authorized information; and for the operation entity having the authority of the file I/O operation instruction, the switch extracts an instruction index and parameter from the file I/O operation instruction and executes a file I/O operation.

Abstract: The present invention relates to a content-centric network on-demand distance vector route method, comprising: a request source node of a required request route broadcasts a route request packet CCN_RREQ to other nodes in a network, and starts a route discovery process; after a target node receives the route request packet CCN_RREQ, replying with a route reply packet CCN_RREP; after the request source node receives the route reply packet CCN_RREP returned by the target node, establishing a path between the request source node and the target node according to the content of the route reply packet CCN_RREP.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A system includes a named data networking and a content delivery network, and a joint processing gateway. The named data networking is used for providing data content to a node in the content delivery network or sending a content request command to the content delivery network. The named data networking is a network formed by devices supporting a named data networking protocol. The content delivery network is used for providing data content to a node in the named data networking network or sending a content request command to the named data networking network. The content delivery network is a content delivery network set up over an IP network. The joint processing gateway is used for converting content data and transmitting the converted data from the named data networking to the content delivery network; and used for converting content data and transmitting the converted content data from the content delivery network to the named data networking.

Abstract: The present invention relates to a Layer 2 adapter selecting system, including a Layer 3 packet requirements extracting module, a destination Layer 2 address acquiring module, a Layer 2 adapter metric acquiring module, an appropriate Layer 2 adapter identifier selecting module, a packet caching module and a packet scheduling module; wherein the packet caching module is configured to cache a received Layer 3 packet; the Layer 3 packet requirements extracting module is configured to read the Layer 3 packet and extract the type and a parameter value of the requirements; the Layer 2 adapter metric acquiring module is configured to acquire instant metric parameter values of each of the adapters; the appropriate Layer 2 adapter identifier selecting module calculates an adapter identifier and a Layer 3 packet metric; the destination Layer 2 address acquiring module is configured to acquire a Layer 2 address of each of the adapters associated with a destination Layer 3 address; and the packet scheduling module calls

Abstract: The present invention provides a system and method for virtualizing network cards on a network processing platform.

Abstract: 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 t

Abstract: 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.

Abstract: The present invention relates to an intelligent television operation system, comprising an application frame layer combining and repackaging each component interface and logic of component layer to simplify reusing mechanism of application for components of the component layer; an application execution environment layer providing execution explaining environment of application codes; a component layer comprising a digital television-associated component for supporting an intelligent television application, wherein each component provides a standard universal component interface for the application frame layer; a hardware abstraction layer performing abstraction on hardware functions of Linux core layer, hiding hardware interface details and providing virtual hardware platform to provide unified interface for the component layer, whereby the component layer is hardware-irrelevant and transplanting on multiple platforms is facilitated; and a Linux core layer managing process, managing memory, realizing network

Abstract: The present invention relates to a Layer 2 adapter selecting system, including a Layer 3 packet requirements extracting module, a destination Layer 2 address acquiring module, a Layer 2 adapter metric acquiring module, an appropriate Layer 2 adapter identifier selecting module, a packet caching module and a packet scheduling module; wherein the packet caching module is configured to cache a received Layer 3 packet; the Layer 3 packet requirements extracting module is configured to read the Layer 3 packet and extract the type and a parameter value of the requirements; the Layer 2 adapter metric acquiring module is configured to acquire instant metric parameter values of each of the adapters; the appropriate Layer 2 adapter identifier selecting module calculates an adapter identifier and a Layer 3 packet metric; the destination Layer 2 address acquiring module is configured to acquire a Layer 2 address of each of the adapters associated with a destination Layer 3 address; and the packet scheduling module calls

Abstract: 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.

Abstract: The present invention relates to a method based on the combination of UPnP and STUN for NAT traversal. The method of the present invention effectively takes the advantages of UPnP and STUN. In particularly, when UpnP fails to traverse NAT, STUN is applied to perform the NAT traversal for the second time, so that the efficiency of the successful traversal is effectively improved. For the symmetric NAT traversal, a Port-Adding Sample Estimation method based on NAT adding port mapping is provided for port estimation, to avoid the defects resulted from the third-party agent and the blindness of the speculation approach. And, where both of the communication peers in the P2P streaming media system are behind NAT, the method that the part of the ordinary outer peers with the sufficient bandwidth acts as the Auxiliary-Relay peers is provided to release the pressure of the relay server so that the bottle-neck of the communication is broken through.

Abstract: A data storing method of a (d, k) Moore graph-based network storage structure is provided. The method arranges a number of formula(I) storing nodes in a wide area network (WAN) environment in accordance with a (d, k) Moore graph to form a strongly regular network structure, and utilizes implementation methods of different separate redundant array of independent disks (RAID) techniques of multiple degrees of reliability, thereby enabling data storing supported by network-RAIDs (NRAID) of multiple degrees of reliability in a network environment; said network structure of a strongly regular graph makes an arbitrarily accessed storing node as a controlling node, and uses other d+d(d?1) storing nodes as neighboring nodes of the controlling node, wherein d is the number of one-hop neighboring nodes; and d(d?1) are the number of two-hop neighboring nodes; the controlling node stores metadata of stored data, and sends information of accessing data; the neighboring nodes provide data storing services.

Abstract: A storage network structure comprises a primary distributed storage network (a cluster distributed storage network or a DHT (Distributed Hash Table)-based peer-to-peer storage network) and a Peterson graph-based storage network. The storage network structure provides different reliability classes for applications and combines the advantages of a peer-to-peer based distributed network storage with Peterson graph-based network storage, solve the problem of a large quantity of data migrating by utilizing the better media data migrating non-movable property from the Peterson graph-based network storage, and screen the single failure of the cluster storage structure and avoid performance degradation of peer-to-peer wide area storage by combining with the availability and robustness of Distributed Hash Table.