Abstract: In the method, an access point AP receives action information separately reported by N stations STAs, where N pieces of action information are used to determine a training result of a first neural network of each STA, and N is a positive integer. The AP determines the training result of the first neural network of each STA based on the N pieces of action information, and sends the training result of the first neural network of each STA to the corresponding STA. The training result of the first neural network of each STA is determined based on the action information reported by the N STAs, instead of only the action information of the STA. This can improve a prediction capability of the first neural network, help improve a capability of each STA to predict channel access behavior of another STA, and improve a system throughput and reduce a communication latency.

Abstract: Provided are a method and apparatus for displaying active friend information, an electronic device, and a storage medium. The method for displaying the active friend information includes receiving an activity information checking instruction, where the activity information checking instruction is generated when a user triggers an entry control on a message page; and displaying an active friend list, where the active friend list displays activity information of an active friend of the user, and the active friend is a friend who is online in a recent preset time period. In this manner, a process of checking the active friend information is simplified and the time spent on checking the active friend information is shortened.

Abstract: This disclosure relates to phase tracking reference signal (PTRS) resource pattern configuration and signaling. Multiple PTRS resource pattern types may be predefined. Various manners in which a PTRS resource pattern configuration of a particular PTRS resource pattern type is communicated and signaled are disclosed. The disclosed PTRS resource pattern configuration and signaling may facilitate more efficient and flexible PTRS implementations for phase noise compensation at high frequency radio bands.

Abstract: The present disclosure provides an intracranial artery stenosis detection method and system. The present disclosure obtains artery stenosis detection results based on a first maximum intensity projection (MIP) image and a second MIP image obtained by preprocessing a medical image by adopting a detection model based on an adaptive triplet attention module and generates an auxiliary report and visualization results according to target category information in the artery stenosis detection results. Therefore, the problem that existing manual interpretation methods are easily affected by the subjective experience of doctors and are time-consuming and laborious can be solved, thus improving accuracy and efficiency of intracranial artery stenosis detection.

Abstract: The present invention relates to a method for improving a muscle force and a physical function, comprising combined use of an ingestion of a composition comprising one or more components selected from the group consisting of astaxanthin and its ester and a physical exercise.

Abstract: In order to ingest data from an arbitrary source in a set of sources, a computer system accesses predefined configuration instructions. Then, the computer system generates a dynamic data-ingestion pipeline that is compatible with a Hadoop file system based on the predefined configuration instructions. This dynamic data-ingestion pipeline includes a modular arrangement of operators from a set of operators that includes: an extraction operator for extracting the data of interest from the source, a converter operator for transforming the data, and a quality-checker operator for checking the transformed data. Moreover, the computer system receives the data from the source. Next, the computer system processes the data using the dynamic data-ingestion pipeline as the data is received without storing the data in memory for the purpose of subsequent ingestion processing.

Abstract: A process for preparing a catalytic cracking catalyst, which process comprises: a molecular sieve is introduced into a gas-phase ultra-stabilization reactor, the molecular sieve is moved without the conveying of carrier gas from a molecular sieve inlet of the gas-phase ultra-stabilization reactor to a molecular sieve outlet of the gas-phase ultra-stabilization reactor, and the molecular sieve is contacted and reacted with a gaseous SiCl4 in the gas-phase ultra-stabilization reactor, the molecular sieve resulting from the contacting and the reacting is optionally washed, then mixed with a matrix and water into slurry, and shaped into particles.

Abstract: The present invention discloses a method, an apparatus and a computer program for resource contention in device-to-device communication links. The method partitions the time-frequency radio resource grid with a resource block set forming the resource unit in the grid, for all available, used and unusable frequency bands around a given virtual central frequency. Each resource block set is partitioned into a common control channel and a data channel. With a given procedure of control data transmission between transmitting and receiving user terminals, the resources are competed and shared. Frequency shifting with short distance frequency change or frequency transference with a larger frequency hopping into a free radio resource is available. The competition procedure is done in order to fairly share the frequency bands as a function of time between different device-to-device communication links in a localized manner.

Abstract: Systems and methods are disclosed for query processing in a big data analytics platform by enumerating plans for a current query using a processor; building a dominance graph for the current query; for each plan, determining a regret value and a score for the plan based on the regret value and cost; and selecting query plans in an online fashion for query processing in big data analytics platforms where intermediate results are materialized and can be reused later.

Abstract: In order to ingest data from an arbitrary source in a set of sources, a computer system accesses predefined configuration instructions. Then, the computer system generates a dynamic data-ingestion pipeline that is compatible with a Hadoop file system based on the predefined configuration instructions. This dynamic data-ingestion pipeline includes a modular arrangement of operators from a set of operators that includes: an extraction operator for extracting the data of interest from the source, a converter operator for transforming the data, and a quality-checker operator for checking the transformed data. Moreover, the computer system receives the data from the source. Next, the computer system processes the data using the dynamic data-ingestion pipeline as the data is received without storing the data in memory for the purpose of subsequent ingestion processing.

Abstract: A process for preparing a catalytic cracking catalyst, which process comprises: a molecular sieve is introduced into a gas-phase ultra-stabilization reactor, the molecular sieve is moved without the conveying of carrier gas from a molecular sieve inlet of the gas-phase ultra-stabilization reactor to a molecular sieve outlet of the gas-phase ultra-stabilization reactor, and the molecular sieve is contacted and reacted with a gaseous SiCl4 in the gas-phase ultra-stabilization reactor, the molecular sieve resulting from the contacting and the reacting is optionally washed, then mixed with a matrix and water into slurry, and shaped into particles.

Abstract: A method for database consolidation includes generating a model for expected penalty estimation; determining a tenant's value as a function of query arrival rate and SLA penalty; placing a tenant to minimize a total expected cost in the order of the tenant value; and progressively using additional servers to prevent any server from being saturated to guarantee a tenant placement that costs no more than four times the cost of any other placement.

Abstract: A system for fair costing of dynamic data sharing in a cloud market is disclosed. The system uses an online method for sharing plan selection, as well as a set of fair costing criteria and a method that maximizes fairness.

Abstract: Systems and methods are disclosed for query processing in a big data analytics platform by enumerating plans for a current query using a processor; building a dominance graph for the current query; for each plan, determining a regret value and a score for the plan based on the regret value and cost; and selecting query plans in an online fashion for query processing in big data analytics platforms where intermediate results are materialized and can be reused later.

Abstract: An apparatus and method for interference-avoidance in a hybrid communications network is provided. The method includes obtaining related information for interfering cellular user equipment in the hybrid network, reporting the related information for the interfering cellular user equipment to an evolved Node B (eNB), receiving a list of component carriers and competition related information for the component carriers, and selecting one or more proper component carriers from the list of component carriers according to certain rules.

Abstract: A method for tenant placement in a multi-tenant system is shown that includes creating a weighted graph of tenants and sharing relationships between tenants, where a weight for each tenant and each sharing relationship represents an associated degree of resource consumption; and adding one or more tenants to a database using a processor based on said weighted graph and a database capacity, such that the combined weight of the added tenants and the sharing relationships belonging to the added tenants are within the database capacity. If a tenant cannot be added to the database without exceeding the database capacity, a new database is created and the one or more tenants are added to the new database, subject to a new database capacity. The adding and creating steps are repeated until all tenants have been added to a database.

Abstract: The present invention discloses a method, an apparatus and a computer program for resource contention in device-to-device communication links. The method partitions the time-frequency radio resource grid with a resource block set forming the resource unit in the grid, for all available, used and unusable frequency bands around a given virtual central frequency. Each resource block set is partitioned into a common control channel and a data channel. With a given procedure of control data transmission between transmitting and receiving user terminals, the resources are competed and shared. Frequency shifting with short distance frequency change or frequency transference with a larger frequency hopping into a free radio resource is available. The competition procedure is done in order to fairly share the frequency bands as a function of time between different device-to-device communication links in a localized manner.

Abstract: Methods for generating a data fetching plan in a multi-tenant system include placing tenants in consecutively allocated databases according to a weighted graph of tenants and sharing relationships between tenants, where at least one sharing relationship includes multiple accessing tenants accessing a given set of data from a provider tenant. For each sharing relationship, if a current database has one or more accessing tenants and does not have the provider tenant, data is fetched from the latest-allocated database prior to the current database that has accessing tenants, if such a database exists; if a current database has the provider tenant, data is provided to the earliest-allocated database after the current database that has accessing tenants if such a database exists. The fetching and providing steps are repeated for each allocated database.

Abstract: Systems and methods are disclosed for placing tenants in a cloud based database server, by estimating with a processor a cost of placing a set of tenants on a server using a simulator; estimating a relative importance of different tenant's queries; and selecting an optimal server for each tenant based with a cost-based schedular to maximize profit using the simulator.