We show that if X is a uniformly perfect complete metric space satisfying
the finite doubling property, then there exists a fully supported measure with lower regularity
dimension as close to the lower dimension of X as we wish. Furthermore, we show that, under
the condensation open set condition, the lower dimension of an inhomogeneous self-similar set EC
coincides with the lower dimension of the condensation set C, while the Assouad dimension of
EC is the maximum of the Assouad dimensions of the corresponding self-similar set E and the
condensation set C. If the Assouad dimension of C is strictly smaller than the Assouad dimension
of E, then the upper regularity dimension of any measure supported on EC is strictly larger than
the Assouad dimension of EC. Surprisingly, the corresponding statement for the lower regularity
We give an overview of our philosophy of pictures in mathematics. We emphasize a bidirectional process between picture lan- guage and mathematical concepts: abstraction and simulation. This motivates a program to understand different subjects, using virtual and real mathematical concepts simulated by pictures.
Numerical encoding plays an important role in DNA sequence analysis via computational methods, in which numerical values are associated with corresponding symbolic characters. After numerical representation, digital signal processing methods can be exploited to analyze DNA sequences. To reflect the biological properties of the original sequence, it is vital that the representation is one-to-one. Chaos Game Representation (CGR) is an iterative mapping technique that assigns each nucleotide in a DNA sequence to a respective position on the plane that allows the depiction of the DNA sequence in the form of image. Using CGR, a biological sequence can be transformed one-to-one to a numerical sequence that preserves the main features of the original sequence. In this research, we propose to encode DNA sequences by considering 2D CGR coordinates as complex numbers, and apply digital signal processing methods to analyze their evolutionary relationship. Computational experiments indicate that this approach gives comparable results to the state-of-the-art multiple sequence alignment method, Clustal Omega, and is significantly faster. The MATLAB code for our method can be accessed from: www.mathworks.com/matlabcentral/fileexchange/57152
We propose a fast local level set method for the inverse problem of gravimetry. The theoretical foundation for our approach is based on the following uniqueness result: if an open set D is star-shaped or x<sub>3</sub>-convex with respect to its center of gravity, then its exterior potential uniquely determines the open set D. To achieve this purpose constructively, the first challenge is how to parametrize this open set D as its boundary may have a variety of possible shapes. To describe those different shapes we propose to use a level-set function to parametrize the unknown boundary of this open set. The second challenge is how to deal with the issue of partial data as gravimetric measurements are only made on a part of a given reference domain . To overcome this difficulty we propose a linear numerical continuation approach based on the single layer representation to find potentials on the boundary of some artificial domain
Recent understandings of molecular evolution, together with the fossil records, have established that there are both linear and nonlinear processes in the creation of novel species, which is strikingly similar to the generation of prime numbers and human creativity. Each creation of a more complex species is like a prime number, unpredictable, discontinuous, and yet can be modeled by a smooth curve in relation to time. The mystery behind the complexity increases in nature and human civilizations might well turn out to be similar to that behind the appearances of prime numbers. Here we show that an algorithm for the creative process of humans can create prime numbers in a lawful and yet unpredictable fashion. The essence of primes is the duality of uniqueness and uniformity together with the creation algorithm. The algorithm consists of the non-linear process of uniformity selection to create the unique and the linear process of uniqueness selection to form the uniformity. The iterations of this algorithm can create an infinite number of primes. The algorithm appears to have been hardwired in the human brain as shown by recent experimental studies. This new understanding can deduce some of the best-known properties of primes and may explain the nearly constant and yet seemingly random creation of novelty in relation to time.
We propose the backward phase flow method to implement the FourierBrosIagolnitzer (FBI)-transform-based Eulerian Gaussian beam method for solving the Schrdinger equation in the semi-classical regime. The idea of Eulerian Gaussian beams has been first proposed in . In this paper we aim at two crucial computational issues of the Eulerian Gaussian beam method: how to carry out long-time beam propagation and how to compute beam ingredients rapidly in phase space. By virtue of the FBI transform, we address the first issue by introducing the reinitialization strategy into the Eulerian Gaussian beam framework. Essentially we reinitialize beam propagation by applying the FBI transform to wavefields at intermediate time steps when the beams become too wide. To address the second issue, inspired by the original phase flow method, we propose the backward phase flow method which allows us to
The entanglement quantification and classification of multipartite quantum states is an important research area in quantum information. In this paper, in terms of the reduced density matrices corresponding to all possible partitions of the entire system, a bounded entanglement measure is constructed for arbitrary-dimensional multipartite quantum states. In particular, for three-qubit quantum systems, we prove that our entanglement measure satisfies the relation of monogamy. Furthermore, we present a necessary condition for characterizing maximally entangled states using our entanglement measure.
Recent consumer interest in controlling and preventing chronic diseases through improved diet has promoted research on the bioactive components of agricultural products. Wheat is an important agricultural and dietary commodity worldwide with known antioxidant properties concentrated mostly in the bran fraction. The objective of this study was to determine the relative contributions of genotype (G) and growing environment (E) to hard winter wheat bran antioxidant properties, as well as correlations of these properties to growing conditions. Bran samples of 20 hard winter wheat varieties grown in two locations were examined for their free radical scavenging capacities against DPPH, ABTS cation, peroxyl (ORAC), and superoxide anion radicals and chelating properties, as well as their total phenolics and phenolic acid compositions. Results showed significant differences for all antioxidant properties tested and multiple significant correlations between these properties. A factorial designed analysis of variance for these data and pooled previously published data showed similar results for four of the six antioxidant properties, indicating that G effects were considerably larger than E effects for chelating capacity and DPPH radical scavenging properties, whereas E was much stronger than G for ABTS cation radical scavenging capacity and total phenolics, although small interaction effects (G × E) were significant for all antioxidant properties analyzed. Results also showed significant correlations between temperature stress or solar radiation and some antioxidant properties. These results indicate that each antioxidant property of hard winter wheat bran is influenced differently by genotype and growing conditions.
JEFFREY MOOREUniversity of MarylandZHIHONG CHENGUniversity of MarylandJUNJIE HAOUniversity of MarylandGANG GUOThe Mennel Milling CompanyJian-Guo LiuUniversity of MarylandCHUNJIAN LINUniversity of MarylandLIANGLI (LUCY) YUUniversity of Maryland
Journal of Agricultural and Food Chemistry, 55, (25), 10173-10182, 2007.12
The bran fraction of wheat grain is known to contain significant quantities of bioactive components. This study evaluated the potential of solid-state yeast fermentation to improve the health beneficial properties of wheat bran, including extractable antioxidant properties, protein contents, and soluble and insoluble fiber compositions. Three commercial food grade yeast preparations were evaluated in the study along with the effects of yeast dose, treatment time, and their interaction with the beneficial components. Solid-state yeast treatments were able to significantly increase releasable antioxidant properties ranging from 28 to 65, from 0 to 20, from 13 to 19, from 0 to 25, from 50 to 100, and from 3 to 333% for scavenging capacities against peroxyl (ORAC), ABTS cation, DPPH and hydroxyl radicals, total phenolic contents (TPC), and phenolic acids, respectively. Yeast treatment increased protein content 11-12% but did not significantly alter the fiber composition of wheat bran. Effects of solid-state yeast treatment on both ORAC and TPC of wheat bran were altered by yeast dose, treatment time, and their interaction. Results suggest that solid-state yeast treatment may be a commercially viable postharvest procedure for improving the health beneficial properties of wheat bran and other wheat-based food ingredients.
Jianlian CuiDepartment of Mathematics, Tsinghua University,Chi-KwongLiDepartment of Mathematics, College of William and MaryNung-SingSzeDepartment of Applied Mathematics, The Hong Kong Polytechnic University
It is known that every complex square matrix with nonnega-tive determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product. However, the characterizations of matrices that require three or four positive semi-definite matrices in the product are lacking. In this paper, we give a complete characterization of these two types of matrices. With these results, we give an algorithm to determine whether a square matrix can be expressed as the product of kpositive semi-definite matrices but not fewer, for k=1, 2, 3, 4, 5.