Search academic resources

This book is the first of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. It concentrates on the theory and application of generating fu...

PURPOSE: The Compendium of Physical Activities was developed to enhance the comparability of results across studies using self-report physical activity (PA) and is used to quantify the energy cost of a wide variety of PA...

Recently, a number of researchers have investigated a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to const...

Abstract Two fuzzy versions of the k-means optimal, least squared error partitioning problem are formulated for finite subsets X of a general inner product space. In both cases, the extremizing solutions are shown to be ...

A NEW MEASURE OF RANK CORRELATION M. G. KENDALL M. G. KENDALL Search for other works by this author on: Oxford Academic Google Scholar Biometrika, Volume 30, Issue 1-2, June 1938, Pages 81–93, https://doi.org/10.1093/b...

A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n + 1) vertices of a general simplex, followed by the replacement of the vertex with the...

Abstract. This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a r...

Let $M(x)$ denote the expected value at level $x$ of the response to a certain experiment. $M(x)$ is assumed to be a monotone function of $x$ but is unknown to the experimenter, and it is desired to find the solution $x ...

A method for identifying clusters of points in a multidimensional Euclidean space is described and its application to taxonomy considered. It reconciles, in a sense, two different approaches to the investigation of the s...

We propose a simple analytic representation of the correlation energy ${\mathrm{\ensuremath{\varepsilon}}}_{\mathit{c}}$ for a uniform electron gas, as a function of density parameter ${\mathit{r}}_{\mathit{s}}$ and rela...

We discuss the following problem: given a random sample $\mathbf{X} = (X_1, X_2, \cdots, X_n)$ from an unknown probability distribution $F$, estimate the sampling distribution of some prespecified random variable $R(\mat...

Abstract This article describes the latest development of a generic approach to detecting and visualizing emerging trends and transient patterns in scientific literature. The work makes substantial theoretical and method...

Subjects / keywords: Mathematics; Normalization (sociology); Bounded function; Measure (data warehouse); Probabilistic logic; Cluster analysis; Partition (number theory); Combinatorics; Discrete mathematics; Statistics; Computer science; Dat...

Subjects / keywords: Toolbox; Computer science; Centrality; Functional connectivity; Complex network; Network analysis; Resilience (materials science); Artificial intelligence; Neuroscience; Machine learning; Psychology; Combinatorics

Suppose x is an unknown vector in Ropf m (a digital image or signal); we plan to measure n general linear functionals of x and then reconstruct. If x is known to be compressible by transform coding with a known transform...

Subjects / keywords: Polygon mesh; Vertex (graph theory); Skeleton (computer programming); Computer science; Lying; Extraction (chemistry); Combinatorics; Mathematics; Theoretical computer science; Computer graphics (images); Graph; Radiolog...

Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretica...

The partition function of a two-dimensional "ferromagnetic" with scalar "spins" (Ising model) is computed rigorously for the case of vanishing field. The eigenwert problem involved in the corresponding computation for a ...

Donoho and Johnstone (1994) proposed a method for reconstructing an unknown function f on [0,1] from noisy data d/sub i/=f(t/sub i/)+/spl sigma/z/sub i/, i=0, ..., n-1,t/sub i/=i/n, where the z/sub i/ are independent and...

This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e. Here, A is an m by n (coding) matrix and e...

Abstract. The value of depth-first search or "bacltracking " as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected co...

Abstract Let n observations Y 1, Y 2, ···, Y n be generated by the model Y t = pY t−1 + e t , where Y 0 is a fixed constant and {e t } t-1 n is a sequence of independent normal random variables with mean 0 and varia...

A simple way has been discovered to put model pseudopotentials, $V(\stackrel{\ensuremath{\rightarrow}}{\mathrm{r}})={\ensuremath{\Sigma}}_{\mathrm{lm}}|{Y}_{\mathrm{lm}}〉{V}_{l}(r)\ifmmode\times\else\texttimes\fi{}〈{...

Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law ...