2-(1,4-Dioxo-1,4-dihydro-2-naphthyl)-2-methylpropanoic acid

The sterically crowded title compound, C₁₄H₁₂O₄, crystallizes as centrosymmetric hydrogen-bonded dimers involving the carboxyl groups. The naphthoquinone ring system is folded by 11.5 (1)° about a vector joining the 1,4-C atoms, and the quinone O atoms are displaced from the ring plane, presumably because of steric interactions with the bulky substituent

Intergranular diffusion rates from the analysis of garnet surfaces: implications for metamorphic equilibration

Novel approaches to garnet analysis have been used to assess rates of intergranular diffusion between different matrix phases and garnet porphyroblasts in a regionally metamorphosed staurolite-mica-schist from the Barrovian-type area in Scotland. X-ray maps and chemical traverses of planar porphyroblast surfaces reveal chemical heterogeneity of the garnet grain boundary linked to the nature of the adjacent matrix phase. The garnet preserves evidence of low temperature retrograde exchange with matrix minerals and diffusion profiles documenting cation movement along the garnet boundaries. Garnet–quartz and garnet–plagioclase boundaries preserve evidence of sluggish Mg, Mn and Fe diffusion at comparable rates to volume diffusion in garnet, whereas diffusion along garnet–biotite interfaces is much more effective. Evidence of particularly slow Al transport, probably coupled to Fe3+ exchange, is locally preserved on garnet surfaces adjacent to Fe-oxide phases. The Ca distribution on the garnet surface shows the most complex behaviour, with long-wavelength heterogeneities apparently unrelated to the matrix grain boundaries. This implies that the Ca content of garnet is controlled by local availability and is thought likely to reflect disequilibrium established during garnet growth. Geochemical anomalies on the garnet surfaces are also linked to the location of triple junctions between the porphyroblasts and the matrix phases, and imply enhanced transport along these channels. The slow rates of intergranular diffusion and the characteristics of different boundary types may explain many features associated with the prograde growth of garnet porphyroblasts. Thus, minerals such as quartz, Fe-oxides and plagioclase whose boundaries with garnet are characterized by slow intergranular diffusion rates appear to be preferentially trapped as inclusions within porphyroblasts. As such grain boundary diffusion rates may be a significant kinetic impediment to metamorphic equilibrium and garnet may struggle to maintain chemical and textural equilibrium during growth in pelites

Designing a Belief Function-Based Accessibility Indicator to Improve Web Browsing for Disabled People

The purpose of this study is to provide an accessibility measure of web-pages, in order to draw disabled users to the pages that have been designed to be ac-cessible to them. Our approach is based on the theory of belief functions, using data which are supplied by reports produced by automatic web content assessors that test the validity of criteria defined by the WCAG 2.0 guidelines proposed by the World Wide Web Consortium (W3C) organization. These tools detect errors with gradual degrees of certainty and their results do not always converge. For these reasons, to fuse information coming from the reports, we choose to use an information fusion framework which can take into account the uncertainty and imprecision of infor-mation as well as divergences between sources. Our accessibility indicator covers four categories of deficiencies. To validate the theoretical approach in this context, we propose an evaluation completed on a corpus of 100 most visited French news websites, and 2 evaluation tools. The results obtained illustrate the interest of our accessibility indicator

Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting

In this paper we establish links between, and new results for, three problems that are not usually considered together. The first is a matrix decomposition problem that arises in areas such as statistical modeling and signal processing: given a matrix $X$ formed as the sum of an unknown diagonal matrix and an unknown low rank positive semidefinite matrix, decompose $X$ into these constituents. The second problem we consider is to determine the facial structure of the set of correlation matrices, a convex set also known as the elliptope. This convex body, and particularly its facial structure, plays a role in applications from combinatorial optimization to mathematical finance. The third problem is a basic geometric question: given points $v_1,v_2,...,v_n\in \R^k$ (where $n > k$) determine whether there is a centered ellipsoid passing \emph{exactly} through all of the points. We show that in a precise sense these three problems are equivalent. Furthermore we establish a simple sufficient condition on a subspace $U$ that ensures any positive semidefinite matrix $L$ with column space $U$ can be recovered from $D+L$ for any diagonal matrix $D$ using a convex optimization-based heuristic known as minimum trace factor analysis. This result leads to a new understanding of the structure of rank-deficient correlation matrices and a simple condition on a set of points that ensures there is a centered ellipsoid passing through them.Comment: 20 page

A Quantile Variant of the EM Algorithm and Its Applications to Parameter Estimation with Interval Data

The expectation-maximization (EM) algorithm is a powerful computational technique for finding the maximum likelihood estimates for parametric models when the data are not fully observed. The EM is best suited for situations where the expectation in each E-step and the maximization in each M-step are straightforward. A difficulty with the implementation of the EM algorithm is that each E-step requires the integration of the log-likelihood function in closed form. The explicit integration can be avoided by using what is known as the Monte Carlo EM (MCEM) algorithm. The MCEM uses a random sample to estimate the integral at each E-step. However, the problem with the MCEM is that it often converges to the integral quite slowly and the convergence behavior can also be unstable, which causes a computational burden. In this paper, we propose what we refer to as the quantile variant of the EM (QEM) algorithm. We prove that the proposed QEM method has an accuracy of $O(1/K^2)$ while the MCEM method has an accuracy of $O_p(1/\sqrt{K})$. Thus, the proposed QEM method possesses faster and more stable convergence properties when compared with the MCEM algorithm. The improved performance is illustrated through the numerical studies. Several practical examples illustrating its use in interval-censored data problems are also provided

Statistical significance of communities in networks

Nodes in real-world networks are usually organized in local modules. These groups, called communities, are intuitively defined as sub-graphs with a larger density of internal connections than of external links. In this work, we introduce a new measure aimed at quantifying the statistical significance of single communities. Extreme and Order Statistics are used to predict the statistics associated with individual clusters in random graphs. These distributions allows us to define one community significance as the probability that a generic clustering algorithm finds such a group in a random graph. The method is successfully applied in the case of real-world networks for the evaluation of the significance of their communities.Comment: 9 pages, 8 figures, 2 tables. The software to calculate the C-score can be found at http://filrad.homelinux.org/cscor

Classification of Message Spreading in a Heterogeneous Social Network

Nowadays, social networks such as Twitter, Facebook and LinkedIn become increasingly popular. In fact, they introduced new habits, new ways of communication and they collect every day several information that have different sources. Most existing research works fo-cus on the analysis of homogeneous social networks, i.e. we have a single type of node and link in the network. However, in the real world, social networks offer several types of nodes and links. Hence, with a view to preserve as much information as possible, it is important to consider so-cial networks as heterogeneous and uncertain. The goal of our paper is to classify the social message based on its spreading in the network and the theory of belief functions. The proposed classifier interprets the spread of messages on the network, crossed paths and types of links. We tested our classifier on a real word network that we collected from Twitter, and our experiments show the performance of our belief classifier

The Weibull-Geometric distribution

In this paper we introduce, for the first time, the Weibull-Geometric distribution which generalizes the exponential-geometric distribution proposed by Adamidis and Loukas (1998). The hazard function of the last distribution is monotone decreasing but the hazard function of the new distribution can take more general forms. Unlike the Weibull distribution, the proposed distribution is useful for modeling unimodal failure rates. We derive the cumulative distribution and hazard functions, the density of the order statistics and calculate expressions for its moments and for the moments of the order statistics. We give expressions for the R\'enyi and Shannon entropies. The maximum likelihood estimation procedure is discussed and an algorithm EM (Dempster et al., 1977; McLachlan and Krishnan, 1997) is provided for estimating the parameters. We obtain the information matrix and discuss inference. Applications to real data sets are given to show the flexibility and potentiality of the proposed distribution