Abstract: The present disclosure discloses a method and device for sampling a pulse signal, and a computer program medium.

Abstract: A multi-subgraph matching method and apparatus, and a device are provided. After receiving a plurality of query graphs, the multi-subgraph matching apparatus groups the plurality of query graphs based on a hash value of each query graph, to generate a plurality of groups of query graphs. A plurality of query graphs whose hash values fall within a same value range belong to a same group. Then, the multi-subgraph matching apparatus respectively matches the plurality of groups of query graphs with a data graph in parallel, to obtain matching results. The matching results are matching results between the plurality of query graphs and the data graph. According to the multi-subgraph matching method in this application, grouping efficiency can be increased, and subgraph matching efficiency can be effectively increased.

Abstract: Embodiments of this disclosure provide a data search method and apparatus, and an electronic device. The method includes obtaining a search request, where the search request includes a query graph formed by a plurality of nodes and a plurality of edges between the plurality of nodes, each node represents an object, and each edge represents an association relationship between objects; determining a plurality of query subgraphs based on the query graph, where each query subgraph includes a group of nodes in the plurality of nodes and edges between the group of nodes, and the plurality of query subgraphs have at least one same node in the plurality of nodes; searching a target data graph in parallel for data subgraphs that respectively match the plurality of query subgraphs; and merging the data subgraphs that respectively match the plurality of query subgraphs, to determine a search result that matches the query graph.

Abstract: A battery pole piece forming apparatus includes a conveying mechanism configured to convey a substrate; a feeding mechanism; and a press roller mechanism. The press roller mechanism includes a first press roller, a second press roller, a third press roller, and a fourth press roller arranged side by side in sequence. The first press roller and the second press roller are configured to roll-press active substance particles conveyed by the feeding mechanism to form a first membrane. The third press roller and the fourth press roller are configured to roll-press active substance particles conveyed by the feeding mechanism to form a second membrane. The second press roller and the third press roller are configured to roll-press the first membrane and the second membrane onto one side of the substrate (and another side of the substrate respectively.

Abstract: The present disclosure provides a method for automatic modeling of an architecture based on an architectural drawing, comprising steps of: reading parameter information of the architectural drawing, identifying a category to which any architectural object belongs by acquiring line segments constituting the architectural object and coordinate data of endpoints of the line segments; generating a binary file or a preset number of binary files based on the coordinate data and elevation data of the endpoints of all the line segments of architectural objects belonging to the same category for all storeys of the architectural drawing; optimizing the binary file or the binary files corresponding to the architectural objects belonging to the same category for all the storeys of the architectural drawing; and generating a three-dimensional model of the architecture. The modeling precision and modeling efficiency of the architecture can be improved by adopting the technical solution of the present disclosure.

Abstract: A method includes receiving an execution request, where the execution request is used to request to execute a task including at least two stored procedures, requesting at least two threads, and dispatching each stored procedure in the task to one of the at least two threads for execution, receiving Structured Query Language (SQL) statements sent by the at least two threads when the at least two threads execute the stored procedures included in the task, and grouping and caching the received SQL statements based on a same access characteristic, and for an SQL statement cache group that satisfies a preset trigger condition, calling an SQL statement execution engine to execute an SQL statement in the SQL statement cache group.

Abstract: A surgical instrument has a first modular assembly and a second modular assembly. The first modular assembly has a body, an ultrasonic waveguide, an ultrasonic blade connected to a distal end of the ultrasonic waveguide, and a coupling member that movably couples with the body. The second modular assembly has a clamp arm assembly with a first pivot coupling, a clamp pad assembly with a second pivot coupling, and a distal outer sheath that selectively couples to the body of the first modular assembly via the coupling member. The distal outer sheath has an interior surface that houses a portion of the ultrasonic waveguide, and this interior surface also houses the first pivot coupling and the second pivot coupling.

Abstract: The present disclosure relates to a brake cylinder, a brake caliper unit and a rail vehicle. The brake cylinder includes a cylinder block and a cylinder head fixedly sleeved over one end of the cylinder block, the cylinder block being provided therein with a piston, a guide spring, a guide nut, a taper sleeve, an adjusting shaft assembly, a thrust sleeve and a gap adjusting nut assembly; wherein the gap adjusting nut assembly includes a gap adjusting nut, a gap adjusting sleeve and a gap adjusting spring, and a groove extending along an axial direction of the gap adjusting sleeve is formed on an outer circumferential surface of the gap adjusting sleeve, in which groove a release gap adjusting unit is provided. The thrust sleeve spring of the brake cylinder of the present disclosure can recognize excessive elastic deformation of the external lever to prevent the gap adjustment triggered by the excessive elastic deformation of the external lever, ensuring that the release gap of the disc is constant.

Abstract: A database replication method and apparatus for a distributed system are provided and relate to the database field. The method includes: receiving by a coordination server, a timestamp of a multi-partition transaction newly added to a first partition of a secondary cluster; determining, by the coordination server, a target timestamp for the first partition based on the received timestamp of the newly added multi-partition transaction and a stored multi-partition transaction timestamp of each partition of the secondary cluster; and sending, by the coordination server, the target timestamp to the first partition, so that the first partition executes a replication log in the first partition based on the target timestamp. In this way, the corresponding partition can execute, without waiting, a multi-partition transaction that is present in all the partitions but has not been executed, thereby avoiding data inconsistency and increasing replication efficiency.

Abstract: A data query method and apparatus, and a database system, where the method includes receiving a data query request, generating an original query plan according to the data query request, obtaining a candidate query plan set according to the original query plan, restructuring a join predicate in the original query plan, determining basic information of a restructured join predicate in the original query plan, determining a constraint condition of the restructured join predicate in the original query plan, determining an equal-cost query plan for the original query plan according to the basic information of the restructured join predicate in the original query plan and the constraint condition of the restructured join predicate in the original query plan, and performing querying according to the equal-cost query plan for the original query plan. Hence, data query performance can be improved.

Abstract: A Bloom filter generation method and apparatus is presented, where the method includes acquiring to-be-combined files, when a quantity of deletion records in the to-be-combined files falls within a false positive permission range, acquiring a Bloom filter of each to-be-combined file, where capacities of Bloom filters of different to-be-combined files are the same, and performing a bitwise OR operation on bit values at same locations in Bloom filters of the different to-be-combined files, in order to obtain a target Bloom filter and use the target Bloom filter as a Bloom filter of a combined file obtained by combining the different to-be-combined files, and hence an amount of calculation processing in Bloom filter generation is reduced, a system resource is reduced, and resource overheads are reduced.

Abstract: In a transaction processing method performed by a database server, the server receives a transaction request to perform an operation on multiple data partitions of the database. The server obtains data snapshots of the multiple data partitions, and confirms that the data snapshots meet a consistency requirement. The Server performs the operation of the first transaction on the data snapshots, and then write the data of the data snapshots after the operation to the multiple data partitions.

Abstract: A method for scheduling a data flow task and an apparatus. The method includes: preprocessing a data flow task to obtain at least one subtask; classifying the subtask into a central processing unit (CPU) task group, a graphics processing unit (GPU) task group, or a to-be-determined task group; allocating the subtask to a working node; when the subtask belongs to the CPU task group, determining that a CPU executes the subtask; when the subtask belongs to the GPU task group, determining that a GPU executes the subtask; or when the subtask belongs to the to-be-determined task group, determining, according to costs of executing the subtask by a CPU and a GPU, a running platform (e.g., the CPU or the GPU) executes the subtask, where the cost includes duration of executing the subtask.

Abstract: A resource management method and apparatus are provided. The resource management method includes: selecting, by a resource manager RM, according to a type and a quantity of application masters AMs that need to be started in advance, resources from resources registered by a node manager, encapsulating the resources into multiple containers matching the AMs, and starting the AMs in the matching containers; and when the RM receives a job submitted by a client, checking, in the AMs according to information about the job, whether there is a matching AM to be used to execute the job, and if there is a matching AM, submitting the job to the matching AM for execution. Such that, when a client submits a job, the job can be submitted to an AM that has been started in advance for execution, thereby reducing latency resulting from resource allocation and AM startup.

Abstract: A stored-procedure execution method includes receiving an execution request, where the execution request is used to request to execute a task including at least two stored procedures, requesting at least two threads, and dispatching each stored procedure in the task to one of the at least two threads for execution, receiving Structured Query Language (SQL) statements sent by the at least two threads when the at least two threads execute the stored procedures included in the task, and grouping and caching the received SQL statements based on a same access characteristic, and for an SQL statement cache group that satisfies a preset trigger condition, calling an SQL statement execution engine to execute an SQL statement in the SQL statement cache group.

Abstract: The present disclosure relates to a brake cylinder, a brake caliper unit and a rail vehicle. The brake cylinder includes a cylinder block and a cylinder head fixedly sleeved over one end of the cylinder block, the cylinder block being provided therein with a piston, a guide spring, a guide nut, a taper sleeve, an adjusting shaft assembly, a thrust sleeve and a gap adjusting nut assembly; wherein the gap adjusting nut assembly includes a gap adjusting nut, a gap adjusting sleeve and a gap adjusting spring, and a groove extending along an axial direction of the gap adjusting sleeve is formed on an outer circumferential surface of the gap adjusting sleeve, in which groove a release gap adjusting unit is provided. The thrust sleeve spring of the brake cylinder of the present disclosure can recognize excessive elastic deformation of the external lever to prevent the gap adjustment triggered by the excessive elastic deformation of the external lever, ensuring that the release gap of the disc is constant.

Abstract: The present disclosure provides a method for automatic modeling of an architecture based on an architectural drawing, comprising steps of: reading parameter information of the architectural drawing, identifying a category to which any architectural object belongs by acquiring line segments constituting the architectural object and coordinate data of endpoints of the line segments; generating a binary file or a preset number of binary files based on the coordinate data and elevation data of the endpoints of all the line segments of architectural objects belonging to the same category for all storeys of the architectural drawing; optimizing the binary file or the binary files corresponding to the architectural objects belonging to the same category for all the storeys of the architectural drawing; and generating a three-dimensional model of the architecture. The modeling precision and modeling efficiency of the architecture can be improved by adopting the technical solution of the present disclosure.

Abstract: Embodiments of the present invention provide a data object processing method and apparatus, which can divide a data object into one or more blocks; calculate a sample compression ratio of each block, aggregate neighboring consecutive blocks with a same sample compression ratio characteristic into one data segment, and obtain the sample compression ratio of each of the data segments; and select, according to a length range to which a length of each of the data segments belongs and a compression ratio range to which the sample compression ratio of each of the data segments belongs, an expected length to divide the data segment into data chunks, where the sample compression ratio of each of the data segments uniquely belongs to one of the compression ratio ranges, and the length of each of the data segments uniquely belongs to one of the length ranges.

Abstract: A database replication method and apparatus for a distributed system are provided and relate to the database field. The method includes: receiving by a coordination server, a timestamp of a multi-partition transaction newly added to a first partition of a secondary cluster; determining, by the coordination server, a target timestamp for the first partition based on the received timestamp of the newly added multi-partition transaction and a stored multi-partition transaction timestamp of each partition of the secondary cluster; and sending, by the coordination server, the target timestamp to the first partition, so that the first partition executes a replication log in the first partition based on the target timestamp. In this way, the corresponding partition can execute, without waiting, a multi-partition transaction that is present in all the partitions but has not been executed, thereby avoiding data inconsistency and increasing replication efficiency.

Abstract: A data query method and apparatus, and a database system, where the method includes receiving a data query request, generating an original query plan according to the data query request, obtaining a candidate query plan set according to the original query plan, restructuring a join predicate in the original query plan, determining basic information of a restructured join predicate in the original query plan, determining a constraint condition of the restructured join predicate in the original query plan, determining an equal-cost query plan for the original query plan according to the basic information of the restructured join predicate in the original query plan and the constraint condition of the restructured join predicate in the original query plan, and performing querying according to the equal-cost query plan for the original query plan. Hence, data query performance can be improved.