Abstract: Disclosed is an adjustment mechanism for an electric power-driven shoe, the mechanism comprising a shoe sole (1), wherein a plurality of rolling wheels (2) are arranged below the shoe sole (1); a foot-positioning mechanism is arranged above the shoe sole (1) and is provided with an angle-adjusting mechanism for adjusting an angle between the foot-positioning mechanism and a lengthwise direction of the shoe sole (1).

Abstract: In embodiments of the present disclosure, there is provided a solution for establishing queues between threads in a user space. After creating a first thread on a first application and creating a second thread and a third thread on a second application, a socket connection between the first application and the second application is established in the user space of the operating system. Then, a first queue is established between the first thread and the second thread, while a second different queue is established between the first thread and the third thread. Embodiments of the present disclosure can avoid lock-based queue sharing by setting a separate queue for each pair of threads. Thus, the luckless queue mechanism according to embodiments of the present disclosure can improve the performance of the operating system significantly.

Abstract: This application provides an antenna module and a base station system. The antenna module may transmit an electromagnetic wave of a specific frequency band. The base station system includes: a signal tower, a first antenna module, and a second antenna module. The first antenna module and the second antenna module are separately fixed at the signal tower, and share a same antenna installation platform on the signal tower; a distance between a center point of the first antenna module and the signal tower is less than a distance between a center point of the second antenna module and the signal tower. The solutions in this application can enable the base station system to implement multi-band coverage. The antenna module in the system can operate independently without affecting each other, and can be mounted and disassembled separately.

Abstract: A technique provides a solution for establishing a socket connection in a user space. After receiving a request for establishing a socket connection from a first application, the monitor sends the connection request to a second application, wherein the first application and the second application run on the same computing device. Then, the monitor coordinates establishing, in user space of the operating system, a peer-to-peer socket connection between the first application and the second application. By establishing a socket connection in the user space of the operating system, embodiments of the present disclosure can achieve a user space socket connection between different applications within a single computing device, thereby improving the performance of the operating system. In addition, embodiments of the present disclosure use the monitor (or controller) to coordinate inter-application connection establishment and resource allocation, thereby ensuring security of the operating system.

Abstract: A compressed memory is divided into a plurality of segments, each segment is divided into a plurality of sub-segments, and each sub-segment in an uncompressed data space is compressed into block (s) in a compressed data space. Upon a read request to a sub-segment in a segment in compressed memory is received, the corresponding entry is firstly determined based on a first level address mapping between the sub-segment and the entry, and then the corresponding block (s) is determined based on a second level address mapping between the entry and the block (s). By use of two-level address mappings, the size of entry can be reduced, thereby achieving low metadata overhead. Moreover, the proposed data layout for compressed memory.

Abstract: In embodiments of the present disclosure, there is provided a solution for establishing queues between threads in a user space. After creating a first thread on a first application and creating a second thread and a third thread on a second application, a socket connection between the first application and the second application is established in the user space of the operating system. Then, a first queue is established between the first thread and the second thread, while a second different queue is established between the first thread and the third thread. Embodiments of the present disclosure can avoid lock-based queue sharing by setting a separate queue for each pair of threads. Thus, the lockless queue mechanism according to embodiments of the present disclosure can improve the performance of the operating system significantly.

Abstract: In embodiments of the present disclosure, there is provided a solution for establishing a socket connection in a user space. After receiving a request for establishing a socket connection from a first application, the monitor sends the connection request to a second application, wherein the first application and the second application run on the same computing device. Then, the monitor coordinates establishing, in user space of the operating system, a peer-to-peer socket connection between the first application and the second application. By establishing a socket connection in the user space of the operating system, embodiments of the present disclosure can achieve a user space socket connection between different applications within a single computing device, thereby improving the performance of the operating system.

Abstract: The present disclosure provide a data transmission method, including: receiving, by a central processing node, downlink user data from a first gateway GW; sending, by the central processing node, the downlink user data to a corresponding base station; and when it is determined that an interface between the central processing node and the first GW is congested, sending, by the central processing node, a first bearer switching request message to the first GW, where the first bearer switching request message is used to instruct the first GW to bypass the central processing node when transmitting data. In the embodiments of the present invention, when determining that an interface between a central processing node and a first GW is congested, the central processing node sends a first bearer switching request message to the first GW, so that the first GW transmits downlink user data with the central processing node bypassed.

Abstract: An embodiment includes a method. The method includes determining, by a first node device in a network, a first master clock according to a first clock data set of the first node device and a first clock data set of another node device in the network, and synchronizing to the first master clock, where the first clock data set includes a first clock domain selection parameter of a node device. The method also includes determining, by the first node device, a second master clock according to a second clock data set of the first node device and a second clock data set of another node device that belongs to a same first node clock domain as the first node device does, and synchronizing to the second master clock, where the second clock data set includes a second clock domain selection parameter of a node device.

Abstract: The present patent application provides a method, an apparatus, and a system for generating a timestamp. The method includes: receiving, by a data packet processing unit, a data packet sent by a physical layer transceiver unit or an upper layer, and identifying whether the data packet is a precise time synchronization protocol PTP data packet, and if the data packet is a PTP data packet, generating, according to a physical layer delay provided by a physical layer delay acquiring unit and a non-physical layer delay provided by a non-physical layer delay acquiring unit, a precise timestamp and rewriting a timestamp field in the data packet.

Abstract: The present disclosure provide a data transmission method, including: receiving, by a central processing node, downlink user data from a first gateway GW; sending, by the central processing node, the downlink user data to a corresponding base station; and when it is determined that an interface between the central processing node and the first GW is congested, sending, by the central processing node, a first bearer switching request message to the first GW, where the first bearer switching request message is used to instruct the first GW to bypass the central processing node when transmitting data. In the embodiments of the present invention, when determining that an interface between a central processing node and a first GW is congested, the central processing node sends a first bearer switching request message to the first GW, so that the first GW transmits downlink user data with the central processing node bypassed.

Abstract: A baseband processing apparatus in a radio communication system, a radio communication system, and a baseband processing method. The apparatus includes a first unit and a second unit that implement different baseband processing functions, where the second unit is configured to generate a precoding matrix of a downlink coordinated multipoint transmission and reception (CoMP) user, generate precoding control information according to the precoding matrix, and send the precoding control information to the first unit; and the first unit is configured to receive the precoding control information sent by the second unit, and perform downlink joint baseband processing on downlink CoMP user data in downlink user data according to the precoding control information, so as to generate jointly sent baseband data for radio sending. The technical solutions can reduce transmission bandwidth between baseband processing units and obtain a system capacity gain at the same time.

Abstract: An embodiment includes a method. The method includes determining, by a first node device in a network, a first master clock according to a first clock data set of the first node device and a first clock data set of another node device in the network, and synchronizing to the first master clock, where the first clock data set includes a first clock domain selection parameter of a node device. The method also includes determining, by the first node device, a second master clock according to a second clock data set of the first node device and a second clock data set of another node device that belongs to a same first node clock domain as the first node device does, and synchronizing to the second master clock, where the second clock data set includes a second clock domain selection parameter of a node device.

Abstract: The embodiments of the present invention provide a method, apparatus, and system. The method comprises: sending, by a centralized processing node, control information containing address information of a service ERRU and the transmission mode of ERRUs to the ERRUs in a COMP set; receiving the compressed uplink COMP frequency domain data sent by the service ERRU according to the transmission mode, wherein the compressed uplink COMP frequency domain data are data obtained by the service ERRU by compressing the original uplink COMP frequency domain data sent by the non-service ERRUs and the original uplink COMP frequency domain data of the service ERRU, and receiving the original uplink COMP frequency domain data sent by at least one ERRU according to the transmission mode. In the present invention, the data are compressed to reduce the uplink transmission flow between the ERRUs in the COMP set and the centralized processing node.

Abstract: A feedback method and system for an uplink hybrid automatic repeat request, and a related device are provided. The method comprises: determining a first transmission and processing time period, wherein the first transmission and processing time period comprises a transmission and processing time period from a time when uplink data is received by a remote radio unit (RRU) to a time when the RRU sends feedback information of the uplink data; and sending, in a case that the first transmission and processing time period is longer than a predetermined feedback delay and before a decoding result of the uplink data is obtained, virtual feedback information of the uplink data and/or scheduling information of the uplink data to the RRU, which in turn sends the virtual feedback information of the uplink data and/or the scheduling information of the uplink data to a user terminal in a predetermined subframe.

Abstract: The present invention discloses a method, a system, a Push client, and a user equipment for service communication. The method disclosed in the present invention includes that: A source Push client generates a Push message, where the Push message carries a destination user Push identifier for identifying a destination user; the source Push client sends the Push message to a destination Push server to which the destination user belongs; the destination Push server obtains, according to the destination user Push identifier, a network address for reaching a destination Push client; and the destination Push server sends, based on the network address, the Push message to the destination Push client. With the present invention, communication of various services can be established without relying on a third party application server, which can reduce power consumption of a terminal and save network resources.

Abstract: The present invention provides a synchronization method, an intermediate node, and a slave node. An intermediate node obtains, according to a local clock frequency of the intermediate node and an obtained clock frequency of a previous node, a frequency offset of the intermediate node relative to the previous node; the intermediate node obtains, according to the frequency offset of the intermediate node relative to the previous node and an obtained frequency offset of the previous node relative to a master clock, a frequency offset of the intermediate node relative to the master clock; the intermediate node transmits the frequency offset of the intermediate node relative to the master clock to a next node, so that a slave node corrects, according to the frequency offset of the intermediate node relative to the master clock, a clock frequency of the slave node or a clock frequency and time of the slave node.

Abstract: The present patent application provides a method, an apparatus, and a system for generating a timestamp. The method includes: receiving, by a data packet processing unit, a data packet sent by a physical layer transceiver unit or an upper layer, and identifying whether the data packet is a precise time synchronization protocol PTP data packet, and if the data packet is a PTP data packet, generating, according to a physical layer delay provided by a physical layer delay acquiring unit and a non-physical layer delay provided by a non-physical layer delay acquiring unit, a precise timestamp and rewriting a timestamp field in the data packet.

Abstract: A method and an apparatus for cooperation between push devices to improve the validity and reachability of Internet Protocol (IP) connections. The method for cooperation between push devices includes: obtaining, by a Push proxy, a Push identifier and an address of a Push client; storing, by the Push proxy, a mapping between the Push identifier and the address of the Push client; and if the address of the Push client changes, updating, by the Push proxy, the corresponding address in the mapping. With the embodiments of the present invention, validity and reachability of IP connections can be improved, and the real-time performance and reliability of Push messages can be improved.

Abstract: The present invention provides a new Push method, apparatus, and system. The Push method includes: receiving a Push message delivered by an application server; obtaining a private IP address of a UE according to a user identifier, where the user identifier is obtained from the Push message; and obtaining, according to the private IP address of the UE, a PS domain node currently connected to the UE, sending the Push message to the PS domain node, and sending the Push message to the UE through the PS domain node.