Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques

Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This paper presents efficient algorithms for listing maximum cliques in networks, providing the first sublinear-space bounds with guaranteed delay per enumerated clique, thus comparing favorably with the known literature

Packaging of Wine in Aluminum Cans – A Review

Background and goals - Aluminum cans represent an alternative wine packaging, offering a wide range of styles. Despite the fast-growing nature of the product category and the great market forecast, there is valid concern about the quality of wines in a can. Unfortunately, this leads to the consumer perception that these wines are low-quality products, which must be addressed by the wine industry. Methods and key findings - Canned wines have a limited shelf life, as they often display unpleasant reductive characteristics (e.g., rotten egg and cooked vegetable off-flavors). Aluminum corrodes in the acidic pH of wine and reacts with sulfur dioxide to yield hydrogen sulfide. Conclusions and significance - Preparing wine for canned packaging requires extra effort to understand the implications of wine redox chemistry. The wine’s chemical parameters at bottling (in particular, the levels of sulfur and metals) must be managed, and the degradation of the can lining must be limited

Listing Subgraphs by Cartesian Decomposition

We investigate a decomposition technique for listing problems in graphs and set systems. It is based on the Cartesian product of some iterators, which list the solutions of simpler problems. Our ideas applies to several problems, and we illustrate one of them in depth, namely, listing all minimum spanning trees of a weighted graph G. Here iterators over the spanning trees for unweighted graphs can be obtained by a suitable modification of the listing algorithm by [Shioura et al., SICOMP 1997], and the decomposition of G is obtained by suitably partitioning its edges according to their weights. By combining these iterators in a Cartesian product scheme that employs Gray coding, we give the first algorithm which lists all minimum spanning trees of G in constant delay, where the delay is the time elapsed between any two consecutive outputs. Our solution requires polynomial preprocessing time and uses polynomial space

Rapid screening method to assess tannin antioxidant activity in food-grade botanical extract

Fourier transform infrared (FTIR) spectroscopy measurements were used for the prediction of commercial tannins antioxidant capacity, i.e. DPPH, through Partial-least squares (PLS) regression. Plot of the leave-one-out full cross-validated PLS predicted scavenging activity values (DPPH %) with a good correlation (r= 0.82), proving FTIR succeeded to rapidly provide information on commercial tannins antioxidant capacit

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs

International audienceGiven a connected graph G of m edges and n vertices, we consider the basic problem of listing all the choices of k vertex-disjoint st-paths, for any two input vertices s, t of G and a positive integer k. Our algorithm takes O(m) time per solution, using O(m) space and requiring O(F k (G)) setup time, where $F k (G) = O(m min{k, n 2/3 log n, √ m log n})$ is the cost of running a max-flow algorithm on G to compute a flow of size k. The proposed techniques are simple and apply to other related listing problems discussed in the paper

Preliminary Study of the Effects of Pulsed Electric Field (PEF) Treatments in Wines Obtained from Early-Harvested Sangiovese Grapes.

In this experiment, the effect of pulsed electric field (PEF) technology on the extractability of anthocyanins and polyphenols in early-harvested Sangiovese red grapes (16.9\ub0Bx sugar, 3.26 pH, and 10.4 g/L titratable acidity) from Emilia Romagna (Italy) was investigated. Electric field strengths were in the range of 0.9\u20133 kV/cm, generated by the application of short, high-voltage pulses, and the grapes were subjected to specific energies from 10.4 to 32.5 kJ/kg immediately after crushing and destemming to produce a pre-fermentative pulsed electric field treatment on a pilot scale. Grape musts and wines were analyzed for color components and polyphenols content from pressing of juices up to 3 months from the end of the fermentation of wines. Furthermore, the freshly-fermented wines were subjected to accelerated aging conditions (i.e., warming under 40\ub0C for 32 days) to simulate the evolution of color parameters with time. The color intensity was generally higher in treated musts and wines compared to the control, further increased by raising the intensity of the electric field. Results suggested the potentialities of pulsed electric fields (PEFs) as a mild pre-fermentative process to assist maceration and to increase the polyphenolic content of musts obtained by early-harvested Sangiovese grapes