Abstract: 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-1, and determining whether i=1 is satisfied.

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

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

Abstract: The invention relates to a transmitter of a through bit dipole acoustic logging device and the logging device, and the transmitter includes a substrate and 2 piezoelectric ceramic plates respectively at either sides of the substrate; wherein the piezoelectric ceramic plate is composed of at least one block of piezoelectric ceramic units; wherein the lengthwise direction of the piezoelectric ceramic elements is along the width direction of the piezoelectric ceramic plates, the width direction of the piezoelectric ceramic units is along the thickness direction of the piezoelectric ceramic plates, and the thickness direction of the piezoelectric ceramic units is along the lengthwise direction of the piezoelectric ceramic plates; the polarization directions of the piezoelectric ceramic units are along the thickness direction of the piezoelectric ceramic units; when electric excitation is applied along the length of the piezoelectric ceramic plate, the piezoelectric ceramic plate on one side of the substrate is ex

Abstract: A distributed node intra-group task scheduling method includes: step 101) collecting resource state information and history service information about each node in a group; step 102) receiving a service request command and parsing the request command to obtain a request task; step 103) 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.

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 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: The present invention relates to a device for managing a linkage control privilege, comprising: a linkage service system and multiple linkage terminals; in one service instance, one linkage terminal can only play one role, i.e., a control terminal or a controlled terminal, within a period of time; the control terminal obtains a privilege token of the controlled terminal so as to perform linkage control on the controlled terminal; the linkage service system is configured to maintain the roles of the linkage terminals and the states of the privilege tokens, process or transfer application for the privilege tokens, and initiate or transfer recycling of the privilege tokens. The present invention enables multiple control terminals to sequentially perform linkage operations on one controlled terminal, including sequential distribution, allocation, recycling, and transfer of privilege tokens.

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

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 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 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: A streaming data reading method based on an embedded file system, including: receiving a request for reading streaming data, when the requested streaming data exists in a disk, creating a new reading task for the request, allocating a storage space to the newly created reading task, and initializing relevant parameters; decomposing the reading task into a plurality of sub-tasks, each sub-task being responsible for reading a piece of physically continuous data, and caching same; extracting the data from the sub-task cache, packaging same according to a streaming data format, submitting the data to a caller of this reading task once one block of data is packaged, and releasing this sub-task and triggering the next sub-task after submission; and when all sub-tasks are successfully completed, reporting the normal completion of the task to the task caller, and waiting for the task caller to end the current reading task.

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: The present invention relates to an antibubble generator and a preparation method. The antibubble preparation method includes: generating a jet flow or droplets in a discrete phase from a first fluid through a gas phase; and under the action of an external force, the jet flow or droplets passing through a liquid membrane and moving towards a second fluid in a continuous phase, to form antibubbles. The present invention can generate a large number of antibubbles in a simple and convenient way, and can meet the needs of large-scale industrial 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: 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