Nutrient contents and in vitro digestibility of different parts of corn plant

AbstractThe objective of this study was to assess the nutrient contents and in vitro true digestibility (IVTD) of parts of the corn plant. The corn used in the study was P2088, a variety that is grown widely in Turkey. It had matured and was harvested 140 days after planting. Four replicate plants were separated into nine parts, namely lower stalk, central stalk, upper stalk, corn ear stalk, corn ear shuck, kernels, corn cob, leaf, tassel, plus the entire plant. The samples were dried and ground for analysis. Nutritional values were determined in the laboratory and in vitro digestibility was assessed. Significant differences in nutrient content were observed among parts of the corn plant. The highest crude protein (CP) content was found in the leaf (12.41%), followed by the grain (12.37%). Dry matter (DM) varied from 91.25% to 96.07%. The highest ether extract (EE) was in the grain (2.84%), and the upper stalk contained the least EE (0.29%). The parts also differed in their contents of crude cellulose (CS) and crude ash (CA) (P <0.001). Most organic matter (OM) was found in the corn cup (94.27%). The highest in vitro dry matter digestibility (IVDMD) was in the kernels (79.06%) and the lowest was in the lower stalk (38.13%). In terms of in vitro true organic matter digestibility (OMD) values of the corn plant and its 9 parts, the highest values were found in the kernels and the lowest in the lower stalk.Keywords: crude nutrients, in vitro true digestibility, parts of corn plan

A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously

Intelligent partitioning models are commonly used for efficient parallelization of irregular applications on distributed systems. These models usually aim to minimize a single communication cost metric, which is either related to communication volume or message count. However, both volume- and message-related metrics should be taken into account during partitioning for a more efficient parallelization. There are only a few works that consider both of them and they usually address each in separate phases of a two-phase approach. In this work, we propose a recursive hypergraph bipartitioning framework that reduces the total volume and total message count in a single phase. In this framework, the standard hypergraph models, nets of which already capture the bandwidth cost, are augmented with message nets. The message nets encode the message count so that minimizing conventional cutsize captures the minimization of bandwidth and latency costs together. Our model provides a more accurate representation of the overall communication cost by incorporating both the bandwidth and the latency components into the partitioning objective. The use of the widely-adopted successful recursive bipartitioning framework provides the flexibility of using any existing hypergraph partitioner. The experiments on instances from different domains show that our model on the average achieves up to 52 percent reduction in total message count and hence results in 29 percent reduction in parallel running time compared to the model that considers only the total volume. © 2016 IEEE

Addressing volume and latency overheads in 1d-parallel sparse matrix-vector multiplication

The scalability of sparse matrix-vector multiplication (SpMV) on distributed memory systems depends on multiple factors that involve different communication cost metrics. The irregular sparsity pattern of the coefficient matrix manifests itself as high bandwidth (total and/or maximum volume) and/or high latency (total and/or maximum message count) overhead. In this work, we propose a hypergraph partitioning model which combines two earlier models for one-dimensional partitioning, one addressing total and maximum volume, and the other one addressing total volume and total message count. Our model relies on the recursive bipartitioning paradigm and simultaneously addresses three cost metrics in a single partitioning phase in order to reduce volume and latency overheads. We demonstrate the validity of our model on a large dataset that contains more than 300 matrices. The results indicate that compared to the earlier models, our model significantly improves the scalability of SpMV. © 2017, Springer International Publishing AG

Incorporating the surfing behavior of web users into PageRank

In large-scale commercial web search engines, estimating the importance of a web page is a crucial ingredient in ranking web search results. So far, to assess the importance of web pages, two different types of feedback have been taken into account, independent of each other: the feedback obtained from the hyperlink structure among the web pages (e.g., PageRank) or the web browsing patterns of users (e.g., BrowseRank). Unfortunately, both types of feedback have certain drawbacks. While the former lacks the user preferences and is vulnerable to malicious intent, the latter suffers from sparsity and hence low web coverage. In this work, we combine these two types of feedback under a hybrid page ranking model in order to alleviate the above-mentioned drawbacks. Our empirical results indicate that the proposed model leads to better estimation of page importance according to an evaluation metric that relies on user click feedback obtained from web search query logs. We conduct all of our experiments in a realistic setting, using a very large scale web page collection (around 6.5 billion web pages) and web browsing data (around two billion web page visits). Copyright is held by the owner/author(s)

Improving performance of sparse matrix dense matrix multiplication on large-scale parallel systems

We propose a comprehensive and generic framework to minimize multiple and different volume-based communication cost metrics for sparse matrix dense matrix multiplication (SpMM). SpMM is an important kernel that finds application in computational linear algebra and big data analytics. On distributed memory systems, this kernel is usually characterized with its high communication volume requirements. Our approach targets irregularly sparse matrices and is based on both graph and hypergraph partitioning models that rely on the widely adopted recursive bipartitioning paradigm. The proposed models are lightweight, portable (can be realized using any graph and hypergraph partitioning tool) and can simultaneously optimize different cost metrics besides total volume, such as maximum send/receive volume, maximum sum of send and receive volumes, etc., in a single partitioning phase. They allow one to define and optimize as many custom volume-based metrics as desired through a flexible formulation. The experiments on a wide range of about thousand matrices show that the proposed models drastically reduce the maximum communication volume compared to the standard partitioning models that only address the minimization of total volume. The improvements obtained on volume-based partition quality metrics using our models are validated with parallel SpMM as well as parallel multi-source BFS experiments on two large-scale systems. For parallel SpMM, compared to the standard partitioning models, our graph and hypergraph partitioning models respectively achieve reductions of 14% and 22% in runtime, on average. Compared to the state-of-the-art partitioner UMPa, our graph model is overall 14.5 � faster and achieves an average improvement of 19% in the partition quality on instances that are bounded by maximum volume. For parallel BFS, we show on graphs with more than a billion edges that the scalability can significantly be improved with our models compared to a recently proposed two-dimensional partitioning model. � 2016 Elsevier B.V

Investigation of load balancing scalability in space plasma simulations

In this study we report the load-balancing performance issues that are observed during the petascaling of a space plasma simulation code developed at the Finnish Meteorological Institute (FMI). The code models the communication pattern as a hypergraph, and partitions the computational grid using the parallel hypergraph partitioning scheme (PHG) of the Zoltan partitioning framework. The result of partitioning determines the distribution of grid cells to processors. It is observed that the initial partitioning and data distribution phases take a substantial percentage of the overall computation time. Alternative (graph-partitioning-based) schemes that provide better balance are investigated. Comparisons in terms of effect on running time and load-balancing quality are presented. Test results on Juelich BlueGene/P cluster are reported. © 2013 Springer-Verlag

Analyzing and enhancing OSKI for sparse matrix-vector multiplication

Sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate single- and multiple-SpMxV frameworks for exploiting cache locality in SpMxV computations. For the single-SpMxV framework, we propose two cache-size-aware top-down row/column-reordering methods based on 1D and 2D sparse matrix partitioning by utilizing the column-net and enhancing the row-column-net hypergraph models of sparse matrices. The multiple-SpMxV framework depends on splitting a given matrix into a sum of multiple nonzero-disjoint matrices so that the SpMxV operation is performed as a sequence of multiple input- and output-dependent SpMxV operations. For an effective matrix splitting required in this framework, we propose a cache-size-aware top-down approach based on 2D sparse matrix partitioning by utilizing the row-column-net hypergraph model. The primary objective in all of the three methods is to maximize the exploitation of temporal locality. We evaluate the validity of our models and methods on a wide range of sparse matrices by performing actual runs through using OSKI. Experimental results show that proposed methods and models outperform state-of-the-art schemes.Comment: arXiv admin note: substantial text overlap with arXiv:1202.385

Recent Advances in Graph Partitioning

We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions

Risk Factors Associated with Adverse Fetal Outcomes in Pregnancies Affected by Coronavirus Disease 2019 (COVID-19): A Secondary Analysis of the WAPM study on COVID-19

To evaluate the strength of association between maternal and pregnancy characteristics and the risk of adverse perinatal outcomes in pregnancies with laboratory confirmed COVID-19. Secondary analysis of a multinational, cohort study on all consecutive pregnant women with laboratory-confirmed COVID-19 from February 1, 2020 to April 30, 2020 from 73 centers from 22 different countries. A confirmed case of COVID-19 was defined as a positive result on real-time reverse-transcriptase-polymerase-chain-reaction (RT-PCR) assay of nasal and pharyngeal swab specimens. The primary outcome was a composite adverse fetal outcome, defined as the presence of either abortion (pregnancy loss before 22 weeks of gestations), stillbirth (intrauterine fetal death after 22 weeks of gestation), neonatal death (death of a live-born infant within the first 28 days of life), and perinatal death (either stillbirth or neonatal death). Logistic regression analysis was performed to evaluate parameters independently associated with the primary outcome. Logistic regression was reported as odds ratio (OR) with 95% confidence interval (CI). Mean gestational age at diagnosis was 30.6\ub19.5 weeks, with 8.0% of women being diagnosed in the first, 22.2% in the second and 69.8% in the third trimester of pregnancy. There were six miscarriage (2.3%), six intrauterine device (IUD) (2.3) and 5 (2.0%) neonatal deaths, with an overall rate of perinatal death of 4.2% (11/265), thus resulting into 17 cases experiencing and 226 not experiencing composite adverse fetal outcome. Neither stillbirths nor neonatal deaths had congenital anomalies found at antenatal or postnatal evaluation. Furthermore, none of the cases experiencing IUD had signs of impending demise at arterial or venous Doppler. Neonatal deaths were all considered as prematurity-related adverse events. Of the 250 live-born neonates, one (0.4%) was found positive at RT-PCR pharyngeal swabs performed after delivery. The mother was tested positive during the third trimester of pregnancy. The newborn was asymptomatic and had negative RT-PCR test after 14 days of life. At logistic regression analysis, gestational age at diagnosis (OR: 0.85, 95% CI 0.8-0.9 per week increase; p<0.001), birthweight (OR: 1.17, 95% CI 1.09-1.12.7 per 100 g decrease; p=0.012) and maternal ventilatory support, including either need for oxygen or CPAP (OR: 4.12, 95% CI 2.3-7.9; p=0.001) were independently associated with composite adverse fetal outcome. Early gestational age at infection, maternal ventilatory supports and low birthweight are the main determinants of adverse perinatal outcomes in fetuses with maternal COVID-19 infection. Conversely, the risk of vertical transmission seems negligible

Risk factors associated with adverse fetal outcomes in pregnancies affected by Coronavirus disease 2019 (COVID-19): a secondary analysis of the WAPM study on COVID-19.

Objectives To evaluate the strength of association between maternal and pregnancy characteristics and the risk of adverse perinatal outcomes in pregnancies with laboratory confirmed COVID-19. Methods Secondary analysis of a multinational, cohort study on all consecutive pregnant women with laboratory-confirmed COVID-19 from February 1, 2020 to April 30, 2020 from 73 centers from 22 different countries. A confirmed case of COVID-19 was defined as a positive result on real-time reverse-transcriptase-polymerase-chain-reaction (RT-PCR) assay of nasal and pharyngeal swab specimens. The primary outcome was a composite adverse fetal outcome, defined as the presence of either abortion (pregnancy loss before 22 weeks of gestations), stillbirth (intrauterine fetal death after 22 weeks of gestation), neonatal death (death of a live-born infant within the first 28 days of life), and perinatal death (either stillbirth or neonatal death). Logistic regression analysis was performed to evaluate parameters independently associated with the primary outcome. Logistic regression was reported as odds ratio (OR) with 95% confidence interval (CI). Results Mean gestational age at diagnosis was 30.6+/-9.5 weeks, with 8.0% of women being diagnosed in the first, 22.2% in the second and 69.8% in the third trimester of pregnancy. There were six miscarriage (2.3%), six intrauterine device (IUD) (2.3) and 5 (2.0%) neonatal deaths, with an overall rate of perinatal death of 4.2% (11/265), thus resulting into 17 cases experiencing and 226 not experiencing composite adverse fetal outcome. Neither stillbirths nor neonatal deaths had congenital anomalies found at antenatal or postnatal evaluation. Furthermore, none of the cases experiencing IUD had signs of impending demise at arterial or venous Doppler. Neonatal deaths were all considered as prematurity-related adverse events. Of the 250 live-born neonates, one (0.4%) was found positive at RT-PCR pharyngeal swabs performed after delivery. The mother was tested positive during the third trimester of pregnancy. The newborn was asymptomatic and had negative RT-PCR test after 14 days of life. At logistic regression analysis, gestational age at diagnosis (OR: 0.85, 95% CI 0.8-0.9 per week increase; pPeer reviewe