Abstract: This application provides a method for secure multi-terminal cooperative working, applied to a network on which a plurality of terminal devices perform cooperative playing and/or cooperative recording, where the plurality of terminal devices include a first terminal device. The method includes: determining, by the first terminal device, a security mechanism; obtaining, by the first terminal device, cooperative working information, where the cooperative working information is information played and/or recorded by the plurality of terminal devices; and performing, by the first terminal device, security processing on the cooperative working information based on the security mechanism.

Abstract: Various embodiment provide a multi-terminal cooperative working method, a terminal device, and a multi-terminal cooperative system. In those embodiments, a primary device can send networking information to a plurality of secondary devices, and the primary device has a permission to manage the cooperative network. The primary device can receive networking confirmation information sent by the plurality of secondary devices; and send configuration information to the plurality of secondary devices separately. The configuration information can be used to instruct to switch, based on a preset management permission switching mechanism when the primary device becomes abnormal or the primary device exits from the cooperative network, the permission to manage the cooperative network. The primary device can clear the secondary device from the cooperative network the secondary device becomes abnormal. In this way, robustness of the cooperative network can be improved.

Abstract: A pricing policy to be applied to token population changes at a token bucket used for admission control during burst-mode operations at a work target is determined. Over a time period, changes to the token population of that bucket are recorded. An amount to be charged to a client is determined, based on the recorded changes in token population and an associated pricing amount indicated in the policy.

Abstract: A distributed database management system may comprise a plurality of computing nodes. A request to update an item maintained by the system may be acknowledged as durable and committed once an entry corresponding to the request has been written to a log file and quorum among the computing nodes has been achieved. Improved consistency may be achieved by maintaining snapshots of committed item states within queryable in-memory snapshot data structures. Range queries may be performed by merging a secondary index with the snapshots and applying filters. Projections may be completed by retrieving additional data from an item collection maintain on one or more storage devices.

Abstract: A radar data processing method is provided. The method includes dividing to-be-compressed radar data into groups, determining encoding parameters of each group according to at least one radar data in each group, and encoding each radar data in each group according to the encoding parameters of each group, to obtain encoded radar data.

Abstract: A data storage system may implement implicit checkpoint for generating a secondary of a table. Indexing updates may be replicated and maintained across a replica group storing a table for a data store. Upon detection of a restart event for generating a secondary index, a replica in the replica group may evaluate the indexing updates to determine an index creation restart point according to an order for indexing the table. The generation of the secondary index may be resumed at the index creation restart point. In this way, secondary index generation may continue whether or not a previously indexing replica in the replica group, such as a master replica, is available to continue generating the secondary index.

Abstract: Techniques for asynchronously indexing database tables are described herein. An update to data in a database table causes an update to an index table of the database. The update to the index table is made first to the index table and then to a replica of the index table. A first copy of the update is stored in a first replica of the index table and then a second copy of the update is provided to an asynchronous process that stores the second copy of the update in a second replica of the index table.

Abstract: A system that implements a scalable data storage service may maintain tables in a data store on behalf of storage service clients. The service may maintain table data in multiple replicas of partitions that are stored on respective computing nodes in the system. In response to detecting an anomaly in the system, detecting a change in data volume on a partition or service request traffic directed to a partition, or receiving a service request from a client to split a partition, the data storage service may create additional copies of a partition replica using a physical copy mechanism. The data storage service may issue a split command defined in an API for the data store to divide the original and additional replicas into multiple replica groups, and to configure each replica group to maintain a respective portion of the table data that was stored in the partition before the split.

Abstract: A repository of key-value data may store a first object value having an internal structure of a hierarchy of sub-objects. The repository may receive a request to modify the first object, expressed as a function, without side effects, of one or more parameters. Values may be assigned to the one or more parameters by mapping from the parameters to locations in the hierarchy of sub-objects. A second object may be formed based on the return value of the function. The first object may be replaced in the repository by the second object.

Abstract: Scanning and rescanning detect state inconsistencies between data entities in repositories or other components of a distributed computing environment. First, entities are scanned based on a cutoff time TO. Entities for which state comparison is undesired are placed in a skipped entity list. Any inconsistencies found in other entities is reported. Then subsequent rescanning fetches state and attempts to pare down the skipped entity list. Rescanning may be capped. Inconsistencies may be detected without requiring downtime from services that update data entity state, and false reports of inconsistency may be avoided.

Abstract: A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. Attribute values may be scalars or sets of numbers or strings. The system may provide an API usable to request that values of one or more of an item's attributes be updated. An update request may be conditional on expected values of one or more item attributes (e.g., the same or different item attributes). In response to a request to update the values of one or more item attributes, the previous values and/or updated values may be optionally returned for the updated item attributes or for all attributes of an item targeted by an update request. Items stored in tables may be indexed using a simple or composite primary key.

Abstract: A voice quality evaluation method includes obtaining a time envelope of a voice signal. The method includes performing time-to-frequency conversion on the time envelope to obtain an envelope spectrum. The method includes performing feature extraction on the envelope spectrum to obtain a feature parameter. The method includes performing voice quality evaluation in voice communications according to the feature parameter to obtain a first voice quality parameter of the voice signal. The method includes calculating a second voice quality parameter of the voice signal by using a network parameter evaluation model. The method includes performing a comprehensive analysis according to the first voice quality parameter and the second voice quality parameter to obtain a quality evaluation parameter of the voice signal that is input in the band.

Abstract: A signal enhancer is provided and comprises an input configured to receive an audio signal that has a wanted component and an unwanted component, and a perception analyser that is configured to split the audio signal into a plurality of spectral components. The perception analyser is configured to, for each spectral component, designate that spectral component as belonging to the wanted component or the unwanted component in dependence on a power estimate associated with that spectral component. If a spectral component is designated as belonging to the unwanted component, the perception analyser is configured to adjust its power by applying an adaptive gain to that spectral component, wherein the adaptive gain is selected in dependence on how perceptible the spectral component is expected to be to a user. The signal enhancer improves the intelligibility of the wanted component.

Abstract: Methods and apparatus for configurable-capacity time-series tables are disclosed. A schedule of database table management operations, including at least an operation to change a throughput constraint associated with a table in response to a triggering event, is generated. The table is instantiated with an initial throughput constraint in accordance with the schedule. Work requests directed to the table are accepted based on the initial throughput constraint. The throughput constraint is modified in response to the triggering event. Subsequent work requests are accepted based on the modified throughput constraint.

Abstract: A computer-implemented method includes receiving a feedback message including feedback information from a receiver of image data, obtaining a current frame to be encoded, encoding the current frame based at least in part on the feedback information, and transmitting the encoded current frame to the receiver.

Abstract: A client application may interact with a database service using a data interchange format with limited support for database data types or query representations. A map may be supported in the interchange format as a collection of name-value pairs. A database query may be parsed to form an abstract syntax tree. From the abstract syntax tree, a hierarchy of nested maps may be formed to represent the query, based on schemas mapping from regions of the abstract syntax tree to maps in the interchange format.

Abstract: A repository of key-value data may store a first object value having an internal structure of a hierarchy of sub-objects. The repository may receive a request to modify the first object, expressed as a projection of locations in the object to be updated and a function that, upon evaluation, returns values to be used to update the projected locations of the object. The repository may determine that the locations specified by the projections correspond to non-overlapping regions of the object and, based on the determination, update the object using the results of evaluating the function.

Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. The system may determine whether it is operating in an overloaded or underloaded state based on a current work throughput rate, a target work throughput rate, a maximum request rate, or an actual request rate, and may dynamically adjust the maximum request rate in response. For example, if the maximum request rate is being exceeded, the maximum request rate may be raised or lowered, dependent on the current work throughput rate. If the target or committed work throughput rate is being exceeded, but the maximum request rate is not being exceeded, a lower maximum request rate may be proposed. Adjustments to the maximum request rate may be made using multiple incremental adjustments. Service request tokens may be added to a leaky token bucket at the maximum request rate.

Abstract: A data center cabinet includes a cabinet body, an oil distribution device and a plurality of liquid distributors. The cabinet body includes a number of mounting racks. The cabinet body is sequentially mounted with a number of server housings from high to low. A server is placed in the server housing. A liquid distributor is provided above each of the server housings. The oil distribution device is connected to the liquid distributor via an oil intake device. Cooling liquid oil is pumped into the oil distribution device by a pump, the oil distribution device distributes oil flow to the liquid distributor under the pressure of the pump, and the liquid distributor sprays the cooling liquid oil to the server for cooling. The present invention also relates to a pressure spray system.

Abstract: A data center cabinet includes a cabinet body, an oil distributor and a plurality of liquid distributors. The cabinet body is sequentially mounted with a plurality of server housings from high to low. A liquid distributor is provided above each of the plurality of server housings. The present invention also relates to a gravity spray system. On the one hand, as cooling liquid oil is concentrated in an oil distributor tank disposed above, the oil automatically flows along an oil passage under gravity, and there is no need to provide pressure in the oil passage, thus reducing the power consumption of an oil pump, improving the coefficient of performance (COP) of a heat dissipation system and reducing the overall PUE of a data center. An oil quantity regulator in an oil distribution unit is used to ensure consistent flow rate distributed to each layer of server.