Total Unduplicated Reach and Frequency Optimization at Procter & Gamble

Author(s):  
Jeffrey D. Camm ◽  
Jeremy Christman ◽  
A. Narayanan

The Procter & Gamble Company (P&G) is a consumer goods corporation that employs over 90,000 people and has operations in roughly 80 countries worldwide. Products in P&G’s 10-category portfolio of products are sold in over 180 countries. The Consumer Research Analytics group at P&G empowers internal clients by using analytics to ensure that the products in P&G’s portfolio of products are not just well received by consumers but become the products of choice for the maximum number of consumers, thereby maximizing P&G’s market share. One of the most frequently used analytical approaches for managing a product line is Total Unduplicated Reach and Frequency analysis. We replaced the previous enumerative approach with integer programming coupled with cuts to the unit hypercube to dramatically speed up the analysis. As a result, P&G achieved higher utilization of its system, improvements to existing products, and more thorough analyses for product line planning and other applications.

2017 ◽  
Vol 55 (13) ◽  
pp. 3808-3831 ◽  
Author(s):  
Chenlu Miao ◽  
Gang Du ◽  
Roger J. Jiao ◽  
Tiebin Zhang

2008 ◽  
Vol 81 (6) ◽  
pp. 868-882 ◽  
Author(s):  
Muhammad A. Noor ◽  
Rick Rabiser ◽  
Paul Grünbacher

2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-27
Author(s):  
Mohamad Barbar ◽  
Yulei Sui

Inclusion-based set constraint solving is the most popular technique for whole-program points-to analysis whereby an analysis is typically formulated as repeatedly resolving constraints between points-to sets of program variables. The set union operation is central to this process. The number of points-to sets can grow as analyses become more precise and input programs become larger, resulting in more time spent performing unions and more space used storing these points-to sets. Most existing approaches focus on improving scalability of precise points-to analyses from an algorithmic perspective and there has been less research into improving the data structures behind the analyses. Bit-vectors as one of the more popular data structures have been used in several mainstream analysis frameworks to represent points-to sets. To store memory objects in bit-vectors, objects need to mapped to integral identifiers. We observe that this object-to-identifier mapping is critical for a compact points-to set representation and the set union operation. If objects in the same points-to sets (co-pointees) are not given numerically close identifiers, points-to resolution can cost significantly more space and time. Without data on the unpredictable points-to relations which would be discovered by the analysis, an ideal mapping is extremely challenging. In this paper, we present a new approach to inclusion-based analysis by compacting points-to sets through object clustering. Inspired by recent staged analysis where an auxiliary analysis produces results approximating a more precise main analysis, we formulate points-to set compaction as an optimisation problem solved by integer programming using constraints generated from the auxiliary analysis’s results in order to produce an effective mapping. We then develop a more approximate mapping, yet much more efficiently, using hierarchical clustering to compact bit-vectors. We also develop an improved representation of bit-vectors (called core bit-vectors) to fully take advantage of the newly produced mapping. Our approach requires no algorithmic change to the points-to analysis. We evaluate our object clustering on flow sensitive points-to analysis using 8 open-source programs (>3.1 million lines of LLVM instructions) and our results show that our approach can successfully improve the analysis with an up to 1.83× speed up and an up to 4.05× reduction in memory usage.


Author(s):  
Fahiem Bacchus ◽  
Antti Hyttinen ◽  
Matti Järvisalo ◽  
Paul Saikko

Maximum satisfiability (MaxSAT) offers a competitive approach to solving NP-hard real-world optimization problems. While state-of-the-art MaxSAT solvers rely heavily on Boolean satisfiability (SAT) solvers, a recent trend, brought on by MaxSAT solvers implementing the so-called implicit hitting set (IHS) approach, is to integrate techniques from the realm of integer programming (IP) into the solving process. This allows for making use of additional IP solving techniques to further speed up MaxSAT solving. In this line of work, we investigate the integration of the technique of reduced cost fixing from the IP realm into IHS solvers, and empirically show that reduced cost fixing considerable speeds up a state-of-the-art MaxSAT solver implementing the IHS approach.


Genes ◽  
2021 ◽  
Vol 12 (5) ◽  
pp. 783
Author(s):  
Andrés J. Cortés ◽  
Felipe López-Hernández

Warming and drought are reducing global crop production with a potential to substantially worsen global malnutrition. As with the green revolution in the last century, plant genetics may offer concrete opportunities to increase yield and crop adaptability. However, the rate at which the threat is happening requires powering new strategies in order to meet the global food demand. In this review, we highlight major recent ‘big data’ developments from both empirical and theoretical genomics that may speed up the identification, conservation, and breeding of exotic and elite crop varieties with the potential to feed humans. We first emphasize the major bottlenecks to capture and utilize novel sources of variation in abiotic stress (i.e., heat and drought) tolerance. We argue that adaptation of crop wild relatives to dry environments could be informative on how plant phenotypes may react to a drier climate because natural selection has already tested more options than humans ever will. Because isolated pockets of cryptic diversity may still persist in remote semi-arid regions, we encourage new habitat-based population-guided collections for genebanks. We continue discussing how to systematically study abiotic stress tolerance in these crop collections of wild and landraces using geo-referencing and extensive environmental data. By uncovering the genes that underlie the tolerance adaptive trait, natural variation has the potential to be introgressed into elite cultivars. However, unlocking adaptive genetic variation hidden in related wild species and early landraces remains a major challenge for complex traits that, as abiotic stress tolerance, are polygenic (i.e., regulated by many low-effect genes). Therefore, we finish prospecting modern analytical approaches that will serve to overcome this issue. Concretely, genomic prediction, machine learning, and multi-trait gene editing, all offer innovative alternatives to speed up more accurate pre- and breeding efforts toward the increase in crop adaptability and yield, while matching future global food demands in the face of increased heat and drought. In order for these ‘big data’ approaches to succeed, we advocate for a trans-disciplinary approach with open-source data and long-term funding. The recent developments and perspectives discussed throughout this review ultimately aim to contribute to increased crop adaptability and yield in the face of heat waves and drought events.


2020 ◽  
Vol 17 ◽  
Author(s):  
Natalia Miękus ◽  
Martyna Ceraficka ◽  
Marta Chyła ◽  
Aleksandra Durska ◽  
Tomasz Bączek

Abstract:: The review aims to present the importance of implementing microextraction-, capillary electrophoresis- and ionic liquid-based approaches in biomedical research. These analytical strategies could improve the biochemical diagnosis of various life-threatening diseases, aid in the search for therapeutic agents and the discovery of drug targets and could be used when designing newer, safer medicinal products. All the proposed analytical approaches meet the requirements of “green chemistry”-based methods, which is relevant nowadays in view of the pollution of the Earth becoming a serious problem. The review is divided into three main sections, and biomedical examples of the application of each presented approach are discussed. It is assumed that the undoubted advantages of ionic liquid-, microextraction- and capillary electrophoresis-based methods will speed up their use in the study of various clinically important analytes from different biological fluids and tissue samples.


2019 ◽  
Vol 8 (4) ◽  
pp. 6018-6021

Multiplier is a hardware component which usually covers an important chip area and must be reduced to create lots of functions in which multiplier frames shape an essential structure, including digital signal processing (DSP) systems and analytical approaches. The benefit of floating point representation across a fixed point (and integer) view is that a wider range of values can be represented. Since floating point numbers are stored in sign-magnitude type, the multiplier also requires unwritten integer numbers and standardization. The multiplier with the algorithm Revised Booth and save adder is one way to speed up the multiplier. The algorithm of Revised Booth reduces the number of incomplete products to create and is regarded as the quickest algorithm of propagation.


Sign in / Sign up

Export Citation Format

Share Document