58 results about "Column generation" patented technology

Database Management Systems (DBMS) manage data stored in tables and process database queries against that stored data. The database queries typically specify search conditions (that is, ‘predicates’) for qualifying database search results to be output by the DBMS. When a database table definition or query includes a given predicate having an expression that operates on a column of a table, it is useful to know whether the expression is monotonic. If the expression is determined to be monotonic, the present invention provides operations for deriving a new predicate from the given predicate for use in a new database query. Advantageously, the use of a new or derived predicate improves operational efficiency of the DBMS. Operation is provided for detecting a type of monotonicity related to the expression, and uses the detected type of monotonicity for generating the derived predicate.

Conventional C2 coding and interleaving for multi-track data tape in LTO-¾ do not support recording data onto a number of concurrent tracks which is not a power of two. Higher-rate longer C2 codes, which do not degrade error rate performance, are provided. An adjustable format and interleaving scheme accommodates future tape drives in which the number of concurrent tracks is not necessarily a power of two. A data set is segmented into a plurality of unencoded subdata sets and parity bytes are generated for each row and column. The parameters of the C2 code include N₂ as the least common multiple of the number of possible tracks to which codeword objects are to be written. COs are formed from N₂ C1 codewords, mapped onto a logical data track according to information within headers of the CO and modulation encoded into synchronized COs which are written to the tape.

An automated method optimally designs plates to satisfy an order book at a steel plant so as to maximize the yield of the plates designed while using capacity fully to reduce the production of surplus slabs or plates, and satisfy order deadlines. Our method consists of four main components: (1) mother plate design, (2) slab design, (3) cast design, and (4) material allocation. A column generation framework for mother plate design is used where the problem is decomposed into a master problem and a subproblem. The master problem is used to evaluate packing patterns that should be used to fulfill the order book and the subproblem generates potential one-dimensional and two-dimensional feasible packing patterns as candidates to be evaluated by the master problem. The solution to the master problem produces a list of mother plates that need to be produced. These mother plates are transformed into candidate slabs, which are represented via an interval graph. The maximal cliques in the interval graph—maximal subsets of slabs which can be grouped together to form casts—are enumerated to generate candidate casts, from which redesign information is sent to the plate/slab design processes. The cast design process is integrated with the plate design/slab design processes in the sense that information is passed from the plate/slab design processes to the cast design process and vice versa. Finally, our method has a material allocation component to assign order plates to inventory mother-plates and slabs.

Provided are techniques for generating a Graphical User Interface (GUI) based on relationships between tables identified in a data model and displaying the GUI to enable selection of the tables and columns in the tables. Via the GUI, a selection of at least one of the tables and a selection of at least one of the columns in the at least one of the selected tables are received. A statement is generated based on the selected tables and the selected columns. The statement is executed to obtain results. The results are processed to create a data object having a hierarchical structure that indicates the relationships between the tables.

An improved system and method for scheduling online keyword auctions over multiple time periods subject to budget constraints is provided. A linear programming model of slates of advertisements may be created for predicting the volume and order in which queries may appear throughout multiple time periods for use in allocating bidders to auctions to optimize revenue of an auctioneer. Each slate of advertisements may represent a candidate set of advertisements in order of optimal revenue to an auctioneer. Linear programming using column generation with the keyword as a constraint and a bidder's budget as a constraint may be applied for each time period to generate a column that may be added to a linear programming model of slates of advertisements. Upon receiving a query request, a slate of advertisements for the time period may be output for sending to a web browser for display.

The invention provides an associated field query device which comprises an acquisition unit, a calculated column generation unit, a digest generation unit and a query unit, wherein the acquisition unit acquires associated fields between data sheets in a relational database; the calculated column generation unit combines the associated fields to form a calculated column; the digest generation unit performs calculation according to the calculated column to obtain a unique message digest; and the query unit creates a calculated column index according to the unique message digest, and queries target data according to the calculated column index. According to the technical scheme of the invention, field quantity of data query can be reduced, field length can be packed, the limitation of data base index key value length and index column quantity is broken through, the index is effectively used, and data query efficiency is improved. The invention also provides an associated field query method.

An improved system and method for scheduling online keyword auctions subject to budget constraints is provided. A linear programming model of slates of advertisements may be created for predicting the volume and order in which queries may appear throughout the day for use in allocating bidders to auctions to optimize revenue of an auctioneer. Each slate of advertisements may represent a candidate set of advertisements in order of optimal revenue to an auctioneer. Linear programming using column generation with the keyword as a constraint and a bidder's budget as a constraint may be applied to generate a column that may be added to a linear programming model of slates of advertisements to determine optimal revenue to an auctioneer. Upon receiving a query request, a slate of advertisements that may provide optimal revenue to the auctioneer may be output for sending to a web browser for display.

An improved system and method for scheduling online keyword auctions subject to budget constraints is provided. A linear programming model of slates of advertisements may be created for predicting the volume and order in which queries may appear throughout the day for use in allocating bidders to auctions to optimize revenue of an auctioneer. Each slate of advertisements may represent a candidate set of advertisements in order of optimal revenue to an auctioneer. Linear programming using column generation with the keyword as a constraint and a bidder's budget as a constraint may be applied to generate a column that may be added to a linear programming model of slates of advertisements to determine optimal revenue to an auctioneer. Upon receiving a query request, a slate of advertisements that may provide optimal revenue to the auctioneer may be output for sending to a web browser for display.

The invention discloses a large-scale indium column generation method for an infrared focal plane detector. The large-scale indium column generation method comprises the following steps of: step 1, coating photoresist for a set thickness on a chip of the infrared focal plane detector; step 2, carrying out blanket exposure treatment on the coated photoresist; step 3, continuously coating the photoresist for the set thickness on the exposed photoresist; step 4, photoetching the coated photoresist by using a photoetching machine; and step 5, depositing indium on the chip of the infrared focal plane detector after photoetching and then stripping the photoresist, so as to obtain the generated indium column. According to the method provided by the invention, the indium column is stripped by using two layers of the photoresist, so that the indium column has no residues at the bottom and has good appearance consistency. Furthermore, the communication rate of reverse welding of the chip of the detector and a read-out circuit can be effectively improved, and the blind pixel rate of the detector is effectively reduced.

Tools that can be used to enhance visibility into various business processes, using named calculations and/or configured columns to produce customized display grids for displaying data from a database. Such tools may provide the ability to develop, within a business application (and/or in conjunction with a business application) visibility solutions that are customized to that end user's business, without the need for expensive redevelopment and/or extensive customization of the business application itself.

The embodiment of the invention discloses a method, a system and a device for scheduling sensor nodes in a wireless sensor network. The method comprises the following steps: acquiring a network connection relationship and a target coverage relationship of each sensor node; acquiring an output result by a column generating method according to the network connection relationship, the target coveragerelationship and a coverage requirement, wherein the output result comprises the number of time slices required by different working modes; acquiring a schedule table according to the output result;and broadcasting the schedule table in the wireless sensor network to schedule each sensor node. The method, the system and the device implement the scheduling of the sensor nodes in the wireless sensor network by the column-based generating method, and reduce power consumption required by the wireless sensor network to monitor target nodes.

A dataset and some user selected columns of the dataset are received by a statistical analysis module for analysis. The statistical analysis module generates a score for each unselected column of the dataset based on statistical analysis of the unselected columns and all or a subset of the selected columns. A ranking of the unselected columns is presented to the user for selection of one additional column of the dataset, after which the remaining unselected columns are re-ranked according to their associated scores and once again displayed to the user. The user may continue selecting from among the ranked columns until a threshold number of columns has been selected, at which point the user may deselect a selected column in order to continue selecting additional columns. A visualization suggestion application program interface then matches the selected columns with compatible visualization configurations and presents some of these visualizations to the user.

A cross-layer optimization framework for designing of multi-radio/multi-channel wireless mesh networks with network coding to support multiple unicast applications is used. A column-generation-based primal-dual method is used to solve the optimization problem. For network-layer formation, a code construction scheme based on linear programming is used. Delay constraints are imposed on the network code construction so the possible impact of the extra decoding delay to the upper-layer Transmission Control Protocol/Internet Protocol (TCP/IP) performance may be reduced without changing the upper-layer protocols.

Systems and methods for automated vehicle routing using column generation optimization are provided. The system receives capacitated vehicle routing problem (CVRP) input data and generates a minimum weight set cover problem formulation for a CVRP for performing column generation optimization over the input data. The system determines smooth-dual optimal inequalities (S-DOI) and flexible-dual optimal inequalities (F-DOI) for the CVRP for performing the column generation optimization over a valid subset of the input data. Then, the system adapts the S-DOI and the F-DOI to generate smooth and flexible dual optimal inequalities (SF-DOI) for the CVRP for performing the column generation optimization over a relaxed subset of the input data. The system utilizes the SF-DOI to accelerate column generation optimization over the relaxed subset of the input data.

The invention discloses a news column generation method and device and computer equipment. The news column generation method comprises the following steps of: obtaining a keyword input by a user and obtaining articles matched with the keyword according to the keyword; obtaining a screening strategy selected from a strategy library by the user; screening and sorting the articles matched with the keyword according to the screening strategy; and generating a content list of a news column according to the sorting result. According to the method, the time required for creating a new news column canbe remarkably shortened, so that rapid verification online can be realized when hot columns need to be created as certain hot events occur.

The invention relates to a shared electric vehicle operation optimization method and system based on column generation and ant colony algorithm fusion. The method comprises the steps of S1 obtaining a shared electric vehicle reservation order and prediction information; S2 according to the shared electric vehicle reservation order and the prediction information, determining targets and constraint conditions of fleet configuration and path optimization of the shared electric vehicles; S3 establishing a mixed integer linear programming model according to the targets and the constraint conditions, so that the total profit of the shared electric vehicle system is maximized; s4 performing decomposition and reconstruction on the mixed integer linear programming model by using D-W decomposition to obtain a reconstructed programming model; and S5 solving the reconstructed planning model by adopting a mixed algorithm consisting of column generation and an ant colony algorithm, and calculating a fleet composition and path planning scheme. According to the method, the operation optimization problem in the shared electric vehicle system is solved, the profitability of an operating enterprise is improved, the decision reliability is high, and the calculation stability is high.

The invention relates to a robust equivalent modeling method of electrolytic aluminum and a self-provided generator set for power system control, and belongs to the technical field of power system running and control. The method comprises the following steps of firstly, modeling a self-provided generator set running constraint and an electrolytic aluminum device constraint in a high energy-loaded enterprise containing an electrolytic aluminum device and the self-provided generator set; secondly, modeling a parameter variable of a high energy-loaded enterprise equivalent model, and further modeling an exchange power constraint of the equivalent model; and finally, forming a two-stage robust optimization model for figuring out the parameter variable of the equivalent model of the high energy-loaded enterprise containing the electrolytic aluminum device and the self-provided generator set, and figuring out by using an improved column generation method. By the method, the problem of privacy protection when the high energy-loaded enterprise containing the electrolytic aluminum device and the self-provided generator set participates in power system dispatching and absorbs new energy is solved, and a foundation is provided for the high energy-loaded enterprise containing the electrolytic aluminum device and the self-provided generator set to participate in new energy absorption.

The embodiment of the invention provides a memory allocation method of an application program, a mobile terminal, a server and a storage medium, which relate to the computer technical field. The method comprises the following steps of obtaining the memory allocation request of the application program, sending the memory allocation request to the server, enabling the server to judge whether the application program is a target application program or not according to the identification of the application program carried by the memory allocation request and the pre-stored target application program list; receiving the judgment result returned by the server, determining the memory allocation strategy according to the judgment result, and allocating the memory for the application program according to the memory allocation strategy, wherein when the application program is the target application program, the memory allocation strategy is to set a specific area in the memory of the mobile terminal, and generate the memory data of the application program according to the column generation mode in the specific area. The embodiment of the invention can improve the generation speed of the memory data, the addressing and recovery speed of the memory, and greatly improves the fluency of the application.

The present invention discloses a system and method for constructing a large prime number periodic table by using an N-level prime number periodic table theorem. The method comprises: calculating n basic order prime numbers by using a prime number general formula; then calculating and generating an original order prime number column by means of a prime number column generation module and storing the original order prime number column into a prime number generation area; calculating and generating a composite number column by means of a continuous composite number area determination module; forming a continuous composite number area by using continuous combinations of generated infinite composite number columns, and storing the continuous combinations into the continuous composite number area; performing validation on the generated prime number column by means of a linear congruence equation calculation module; searching for prime factors of the composite numbers in all directions, performing screening to obtain prime factor composite numbers that are all greater than mn, and completely separating the composite numbers from the prime numbers to reduce a probability of erroneous determination; and the more and larger searched modulus prime factors become, the closer distribution density of sector prime factor composite numbers approaches to zero, so as to obtain a super large prime number table that approaches closer and closer to 100%, and implement the goal of acquiring infinite large prime numbers in all directions in a whole of natural numbers.