Abstract: Various embodiments disclosed relate to methods of predicting neutral detergent fiber digestibility (NDFD) properties of a feedstuff sample. A method of predicting neutral detergent fiber digestibility (NDFD) properties of a feedstuff sample includes collecting a near-infrared spectrum of the feedstuff sample to provide NIR data of the feedstuff sample. The method also includes predicting NDFD of the sample at an elapsed time, NDFD rate of the sample, and/or NDFD extent of the sample from the NIR data using a NIR/NDFD calibration model. Various embodiments provide a method of developing the NIR/NDFD calibration model using in vitro gas production (IVGP). Various embodiments provide a method of predicting digestibility of the feedstuff sample for an animal at a rumen passage rate (eNDF).

Abstract: A pixel structure, a driving method thereof, a display panel, and a display apparatus are provided. The pixel structure includes: a plurality of pixel rows and a plurality of pixel columns. Each pixel row includes: sub-pixels of four different colors. The plurality of pixel columns include: a plurality of first pixel columns and a plurality of second pixel columns arranged alternately. Each of the first pixel columns includes: sub-pixels of three of the four different colors. Each of the second pixel columns includes: sub-pixels of another color other than the three of the four different colors.

Abstract: A neural network training method and a related apparatus are provided. The method includes: a first device receives first channel sample information from a second device. The first device determines a first neural network. The first neural network is obtained through training based on the first channel sample information, and is used to perform inference based on the first channel sample information to obtain second channel sample information. According to this method, air interface signaling overheads can be effectively reduced, adaptability to a channel environment is achieved, and communication performance is improved.

Abstract: Database log writing is based on log pipeline contention. A determination is made as to whether contention in writing data to a log pipeline, which is used in writing data from memory to storage, is at a prespecified level. Based on determining that the contention in writing the data to the log pipeline is at the prespecified level, a split operation is automatically performed to create a new log pipeline.

Abstract: Embodiments of this application provide a method for configuring a reference signal, to increase a rate of data transmission between an access network device and a terminal device. The method includes: An access network device determines a first reference signal pool, where the first reference signal pool includes one or more reference signals. The access network device sends first information to a first terminal device, where the first information indicates a first reference signal allocated to the first terminal device, the first reference signal is included in the first reference signal pool, and the first reference signal pool is obtained by the access network device by training a first neural network, or the first reference signal pool is obtained by another network-side node by training a first neural network and sent to the access network device.

Abstract: A processor receives an optimization target for a first cluster in a distributed computing environment. A processor trains a neural network based on the optimization target. A processor generates a decision tree based on the neural network. A processor selects a workload executing in the first cluster of the distributed computing environment. A processor identifies a second cluster to relocate the workload. A processor determines a current optimization of the distributed computing environment based on the workload being retained in the first cluster. A processor determines a migration optimization of the distributed computing environment based on the workload being migrated to the second cluster. A processor, in response to the migration optimization improving the current optimization of the distributed computing environment, migrates the workload to the second cluster.

Abstract: A supervised similarity measure machine learning method, system, and computer program product that includes generating embeddings by training a supervised deep neural network (DNN) on a feature data to determine which nodes correspond to which clustered learning group of clustered learning groups, performing half-distributed learning by distributing data in a time-series database to the clustered learning groups, and evaluating, based on the embeddings, new tenant data in the clustered learning groups with an upward bow pose.

Abstract: A computer-implemented method selects an access path for high cost and/or complex queries. The method includes building a classification model configured to identify a lowest cost access path. The method further includes receiving a query, where the query is configured to retrieve a set of data from a database. The method also includes generating an access map for the query, where the access map includes one or more potential access paths to execute the query. The method includes collecting, for the query, a set of data for each potential access path. The method further includes classifying, by the classification model, the query. The method also includes selecting a first access path of the one or more potential access paths and executing the query.

Abstract: A computer-implemented method includes: collecting, by a computing device, database activities and database structure information of a database; identifying, by the computing device, related columns in the database; determining, by the computing device, one or more data types for column transference of the identified related columns; generating, by the computing device, a super union column based on the column transference and the identified related columns; and updating, by the computing device, the database with the super union column.

Abstract: An embodiment includes generating a partition schema for a distributed database based on historical usage data indicative of usage of the distributed database, where the generating of the partition schema comprises determining a partition range of a partition of the partition schema. The embodiment also includes generating a node identifier for the partition using a hash function and a first weight value assigned to the partition. The embodiment also includes monitoring performance data indicative of a performance of the distributed database, the monitoring comprising detecting a failure of the performance to satisfy a performance threshold. The embodiment also includes initiating, responsive to detecting the failure, a redistribution procedure by changing the node identifier of the partition by replacing the first weight value with a second weight value.

Abstract: A system collects statistical data for a data page, divides the data page into parts, analyzes the data page and the statistical data, based on compression efficiency of one or more compression methods for each part of each page, to determine a compression method for each part of page, and compresses, based on the analyzing, the parts of the data page.

Abstract: Disclosed are techniques for relational database locks based on columns. Database transactions may be targeted to specific columns of one or more records, instead of the entire row for those records, using primary keys. Column locks on specific keys are stored separately than column locks on ranges of keys, which are both checked when requesting a new column lock for either a single key or a range of keys. When a threshold number of columns for a given record, or range of records/keys, have been locked, the column locks for that record, or range of records, can be combined into a single row level lock to reduce resource costs for maintaining multiple concurrent locks.

Abstract: The present disclosure is suitable for the technical field of grain seed sowing, and provides a precision grain seed sowing device capable of uniformly discharging grain seeds. The sowing device comprises a grain seed supplying mechanism, a grain seed conveying mechanism and a grain seed discharging mechanism, wherein the grain seed supplying mechanism is used for providing grain seeds to the grain seed conveying mechanism for sowing, and the grain seed discharging mechanism is used for discharging the grain seeds uniformly provided by the grain seed conveying mechanism; the grain seed conveying mechanism comprises a grain seed conveying assembly and a grain seed replenishing assembly, the grain seed conveying assembly is used for uniformly providing the grain seeds for the grain seed discharging mechanism, and when an empty groove condition appears in the process that the grain seed conveying assembly provides the grain seeds for the grain seed discharging mechanism.

Abstract: A computer-implemented method that includes managing a buffer pool of pages into a ring sub-chain comprising pages linked in a ring, and a linear sub-chain comprising pages linked in a line from a header, and moving a page between the linear sub-chain and the ring sub-chain based on a moving schema evaluating a chain management characteristic.

Abstract: Embodiments of the present disclosure relate to an approach for database query. According to the approach, a query for a group of data records is received. At least one index is created on at least one field of the data records and comprises index entries for storing and sorting respective values of the at least one field of the data records. It is determined if the query satisfies a predetermined condition. In response to the query satisfying the predetermined condition, a result of the query is determined by skipping at least a part of operations required by the query based on the at least one index.

Abstract: In a computer-implemented method for improving performance of a database, a processor receives batch jobs for a relational database. The batch jobs may include a first member with a first buffer pool, and a second member with a second buffer pool. The processor may also identify a first actual object and an isolation level for the batch jobs, generate related queries based on the first actual object and the isolation level, calculate a cost for the first member and the second member to run the batch jobs based on the related queries, and assign the batch jobs to the first member based on a lower calculated cost.

Abstract: An approach is provided in which the approach segments each one of multiple components corresponding to multiple component levels in an SQL database system into multiple functions. The approach combines a first one of the multiple functions with a second one of the multiple functions into an image, and invokes the image to process an SQL query using the first function and the second function.

Abstract: The method of this disclosure includes identifying a hot area in an index tree where an index split of the index tree has occurred due to a previous data insertion into a database based on historical statistic information on the index split. The method of this disclosure may further include predicting boundary key values of one or more new index pages to be inserted into the index tree for a next data insertion into the database based on a distribution of the hot area in the index tree. The method of this disclosure may further include inserting the one or more new index pages into the index tree based on the predicted boundary key values prior to the next data insertion.

Abstract: A method of managing time series data workload requests includes receiving a workload job request from a user in a multi-tenant network, the request specifying a plurality of workloads, each workload including time series data configured to be stored in a time series database (TSDB), inputting workload information to a workload model that is specific to the user, and classifying each workload according to the workload model, the workload model configured to classify each workload based on a plurality of parameters, the plurality of parameters including at least a workload type and an amount of storage associated with each workload. The method also includes assigning each workload of the plurality of workloads into one or more workload groups based on the classifying, and executing each workload according to the workload type and the storage size.

Abstract: A computer-implemented method to estimate an execution time for large query batches. The method includes identifying a batch of queries, where the batch of queries where each query is configured to retrieve data from a database. Selecting a first query and generating an access path for the first query including one or more mini plans. Building a learning model for the one or more mini plans. Estimating an estimated execution time for each of the one or more mini plans. Adding each of the estimated execution times for each of the one or more mini plans to determine a first total estimated time for the first query. Displaying the first total estimated time.