Mesh Simplification Using the Edge Attributes

The problem of simulating light scattering patterns of polymerization induced phase separation processes by the mechanism of nucleation and growth is addressed with the objective of reducing the number of computations required to carry out the simulation. A method, based on the Fast Fourier Transform (FFT), that takes advantage of the spherical nature of the phase separated domains, is proposed. Contrary to the case in which the spherical particles are randomly placed in arbitrary locations in the scattering volume, the proposed computational scheme requires the locations not to be arbitrary but to belong to a previously defined equally spaced grid. This last constraint determines levels of resolution in which the simulation can be performed. The FFT based method is tested with a morphology previously generated with a model of the phase separation process. The light scattering pattern corresponding to this morphology, mainly represented through the particle size distribution of the spherical separated domains, has been simulated at different levels of resolution of the grid placed in the scattering domain and of the sizes of the domains. It has been found that the original morphology represented by a distribution with 17 different sizes can be approximated by a smaller number, while keeping the total volume of particles the same, without a noticeable loss of precision. This, together with the fact that the computations can be performed at different levels of resolution, gives the chance to explore an important number of approximations to the problem, many of which produce, using the proposed method, results that are comparable to those obtained at higher levels of resolution, with the advantage of requiring a smaller number of computations.

The minor expressiveness of text with respect to visual features doesn't allow to fully exploit capabilities of human memory. For this reason retrieval based on visual contents has been identified as the means to provide an effective retrieval. The relative relevance of visual elements depends on user's subjectivity (which is not known in advance) and on the context of application. To cope with this problem, the description of image visual contents should exploit different levels of detail in image representation. In the following we present the PICASSO system, which supports image indexing and retrieval based on shapes, colors, and spatial relationships. The system exploits a pyramidal representation of the images which are analyzed at different levels of resolution. Multiple descriptions of image properties are created at different levels of resolution thus allowing effective retrieval through specific queries as well as imprecise ones. Retrieval results for a sample database of pictorial images are reported, with efficiency and effectiveness measures.

The goal of this paper is to present a quantitative study about Telco churn analysis and the inherent problems of its application and computer processing. An independent customer characterizes the approach and the pre-processing step uses the wavelet transform concept; the pattern classification problem is solved by an artificial neural network (RBFRadial Basis Function). The signal representation considers different levels of resolution (multi-resolution). This idea is frequently used in image/video processing where general image versions with a low resolution are stored in different levels of resolution. The concepts of multi-resolution have been implemented by a digital filter bank, Hi-pass and Low-pass. Each sub-band will give the best resolution, for each spectral region. The idea is to look for a spectral transient. A scalable Daubechies’ function db 2 and db 3 were tested for this study and the results were used as input for the RBF neural network. Daubechies’ function has shown important properties as for instance, orthogonality and scalability, which are not presented by Morlet’s function. Some results of the experiment were presented to point out the performance of the wavelet pre-processing approach.

The properties of water at physiological conditions can be modelled at different levels of resolution: (1) sub-atomic models that take into account electronic degrees of freedom, (2) atomic models that only account for atomic degrees of freedom and (3) supra-molecular models that only involve some supra-molecular degrees of freedom. To enhance the computational efficiency of molecular simulation, models at different levels of resolution should be simultaneously usable for different parts of a system for which the level of detail of interest is different. This requires these different types of models to be compatible with each other. In the present study, the compatibility of two polarisable models for liquid water, COS/G2 and COS/D, with a non-polarisable model for liquid water, SPC, is investigated. It is shown that these models are compatible. The polarisable models can thus be used to solvate biomolecules described by a biomolecular force field that is compatible with the SPC water model.

Avian communities living in a complex environment were studied by censuses of singing males, using several levels of resolution which focussed on different properties of the community. Within each level of resolution, various community parameters in two grassland habitat types were calculated over the entire breeding season, and for census intervals within the breeding season. The community level of resolution focussed on community—wide patterns, such as total density and total biomass, in order to reveal constraints operating on all species in each habitat. An intermediate level of resolution focussed on relative properties of species such as relative abundances, species richness, and dominance concentration. At the individual species level of resolution, densities and identities of species were the properties upon which the analysis focussed. These techniques allowed characterization of responses of the avian communities to complex changes in the system in which they were embedded. Long—term averages in monthly rainfall on the sites used for this study indicated a bimodal distribution of rainfall. The first peak occurred in December and the second in July and August. During the two years of study, summer rainfall was similar, but winter rainfall in 1983 was °2—3 times as great as in 1982. Avian communities in habitats with mesquite trees (mesquite savannah) responded differently than communities in grassland habitats, and these responses could be seen at different levels of resolution. Peak densities and biomass occurred during May—June in mesquite savannah habitats, while grassland communities achieved highest densities and biomass during July and August. Average density per individual showed little seasonal pattern, but was lower for mesquite savannah communities than for grassland communities. Species richness increased in mesquite savannah habitats in 1983, but decreased in grassland habitats that year. Patterns of evenness and dominance concentration suggested that in 1983, rare species of large body size were added to the community in mesquite savannah, while in grassland habitats, species already present during 1982 increased in density. A community ordination revealed that mesquite savannah habitats were dominated numerically by small—bodied insectivorous species during the early part of the breeding season but became similar to grassland communities in July and August. Grassland communities were dominated by large—bodied emberizine finches. These characteristics of the avian communities corresponded closely to the phenology of important primary producers. Mesquite produces leaves high in nutritional value and produces flowers during April—June; thereafter older leaves decline in nutrient content and flowers disappear. These changes in mesquite productivity undoubtedly produce corresponding changes in insect communities exploitable by small—bodied insectivores. Perennial grasses concentrate aboveground productivity to July—August and insect communities associated with grasses increased in biomass during this period, thus increasing resources available for breeding. These results suggest that avian community responses to complex changes in their environments can be identified and related to outside inputs into the environment, such as rainfall. Identification of community responses is facilitated by emphasis on several observational scales. Communities appear individualistic to observers because (1) adaptational units of species are probably much larger than study areas; (2) species ability to adapt to local conditions might be diluted by gene flow among populations; and (3) if most evolutionary change occurs during speciation, then species adaptations will reflect a relatively narrow range of selection pressures that operated briefly on the species during the past.

The conversion of coarse-grained to atomistic models is an important step in obtaining insight about atomistic scale processes from coarse-grained simulations. For this process, called backmapping or reverse transformation, several tools are available, but these commonly require libraries of molecule fragments or they are linked to a specific software package. In addition, the methods are usually restricted to specific molecules and to a specific force field. Here, we present an alternative method, consisting of geometric projection and subsequent force-field based relaxation. This method is designed to be simple and flexible, and offers a generic solution for resolution transformation. For simple systems, the conversion only requires a list of particle correspondences on the two levels of resolution. For special cases, such as nondefault protonation states of amino acids and virtual sites, a target particle list can be specified. The mapping uses simple building blocks, which list the particles on the different levels of resolution. For conversion to higher resolution, the initial model is relaxed with several short cycles of energy minimization and position-restrained MD. The reconstruction of an atomistic backbone from a coarse-grained model is done using a new dedicated algorithm. The method is generic and can be used to map between any two particle based representations, provided that a mapping can be written. The focus of this work is on the coarse-grained MARTINI force field, for which mapping definitions are written to allow conversion to and from the higher-resolution force fields GROMOS, CHARMM, and AMBER, and to and from a simplified three-bead lipid model. Together, these offer the possibility to simulate mesoscopic membrane structures, to be transformed to MARTINI and subsequently to an atomistic model for investigation of detailed interactions. The method was tested on a set of systems ranging from a simple, single-component bilayer to a large protein-membrane-solvent complex. The results demonstrate the efficiency and the efficacy of the new approach.

Multi-level coarse-grain model of the DEM

<p style='text-indent:20px;'>The multilevel Monte Carlo path simulation method introduced by Giles (<i>Operations Research</i>, 56(3):607-617, 2008) exploits strong convergence properties to improve the computational complexity by combining simulations with different levels of resolution. In this paper we analyse its efficiency when using the Milstein discretisation; this has an improved order of strong convergence compared to the standard Euler-Maruyama method, and it is proved that this leads to an improved order of convergence of the variance of the multilevel estimator. Numerical results are also given for basket options to illustrate the relevance of the analysis.

With the widespread availability of personal computers and the staggering amount of digital imagery available, recent investigation has focused on the storage, query and retrieval of images from large image databases. Methods, which are employed presently, precompute image indices, which are deemed to be statistical representations of image information. Queries of colour, shape, texture, etc., are then performed directly on these indices to find valid images. The authors propose a new indexing technique which calculates the multidimensional histogram of the directional detail in a given image. They apply wavelet theory and multiresolution analysis to extract the directional information from an image and then map this information into 3-dimensional vectors. Histograms of these vectors are then calculated at different levels of resolution, allowing progressive image query using colour histogram techniques to be directly applied. The technique is capable of querying and searching a database for images based on attributes such as smoothness, randomness and horizontal, vertical and diagonal edges at varying resolutions.

In this work, the authors have proposed a method for improving the visual quality of color images suffering from low illumination. In this pyramid based multiscale technique, the input image is decomposed into four different levels of resolutions. Starting from the coarsest resolution, each image is converted to HSV space, and the illumination is computed from the V component employing multiscale Gaussian function. At this stage, Weber-Fechner law is used to construct two enhanced versions of the illumination component corresponding to two different values of a parameter. These two images are fused using PCA to construct a new V image, which is subsequently super-sampled to its next higher level of resolution. The V images of the next higher level of resolution are subjected to the same treatment until we reach the base level of the pyramid. Finally, all the V component images at the base level are fused employing PCA to construct the final resultant V component, which in turn is combined with the H and S components to construct the final result. The method has been implemented and tested on a set of real 2D color images, and the results are found satisfactory. The experimental results have been compared with those of other methods based on some objective measures.

This paper describes a document image analysis system using multiple agents working on a pyramid structure to separate text from graphics in the image. Text strings appear as different groupings of connected components at different image resolutions. As such, the pyramid structure, which is a multi-resolution image representation, provides a natural means of identifying and grouping of character strings in the document at different levels of resolution. The pyramid structure is also amenable to parallel processing, where multiple agents in the system can individually and concurrently look for groups of connected components at appropriate levels. The agent-based pyramid operations do not require expensive feature analysis among different connected components to detect text strings as found in other existing works.

This article examines the differences in combat outcomes predicted by models of different resolution applied to identical combat situations. First, hypothetical combat situations are posed; then several models of varying degrees of resolution in the spatial representation, aggregation of forces, and time step are used to predict losses and battle winners. Both stochastic and deterministic simulations are used. The comparisons of outcomes provide important insights into the problems of aggregation. Some observations from this set of experiments are that intuition regarding outcomes, causes, and effects are frequently wrong, leading to bad approximations in the aggregate. Scaling for different levels of resolution is possible, but a method of predicting the appropriate scaling technique and factors in advance has not been found. The differences in outcomes between stochastic and deterministic models are most pronounced in the “fair fight” regime in which the force balance (accounting for situational factors) is nearly even. Because defense analysis frequently operates in this regime (getting “just enough” force to a theater or because constrained defense budget allocations may not permit overwhelming odds) this result implies that great care should be taken to understand the possible variance in outcomes. © 1995 John Wiley & Sons, Inc.

Multirate, multiresolution, recursive Kalman filter

Cortical circuitry dysfunction in schizophrenia has been studied at many different levels of resolution, but not at the most basic unit of network organization--synaptic inputs. Multi-label electron or confocal light microscopy is required to examine specific types of synaptic inputs, and application of these methods to quantitatively study disease-related changes in human postmortem tissue has not been feasible for technical reasons. We recently developed a multi-label confocal light microscopic approach that makes possible the systematic identification and quantification of synaptic inputs, and of the relative levels of proteins localized to these inputs, in human postmortem tissue. We applied this approach to quantify parvalbumin basket cell (PVBC) inputs in area 9 of the dorsolateral prefrontal cortex from schizophrenia and matched comparison subjects. Tissue sections were triple-labeled for the 65 kD isoform of glutamic acid decarboxylase (GAD65), PV and the GABA(A) receptor α1 subunit. PVBC axonal boutons were defined as PV/GAD65 dual-labeled puncta, and PVBC inputs were defined as a PVBC bouton that overlapped a GABA(A) receptor α1 subunit punctum. The density of PVBC inputs was unchanged in subjects with schizophrenia, but levels of PV protein were lower in PVBC boutons. In concert with prior reports, these findings indicate that PVBC dysfunction in schizophrenia reflects molecular and not structural alterations in these cells and their axon terminals.

This paper presents a new interpolatory Loop scheme and an unified and mixed interpolatory and approximation subdivision scheme for triangular meshes. The former which is C1 continuous as same as the modified Butterfly scheme has better effect in some complex models. The latter can be used to solve the “popping effect” problem when switching between meshes at different levels of resolution. The scheme generates surfaces coincident with the Loop subdivision scheme in the limit condition having the coefficient k equal 0. When k equal 1, it will be changed into a new interpolatory subdivision scheme. Eigen‐structure analysis demonstrates that subdivision surfaces generated using the new scheme are C1 continuous. All these are achieved only by changing the value of a parameter k. The method is a completely simple one without constructing and solving equations. It can achieve local interpolation and solve the “popping effect” problem which are the method's advantages over the modified Butterfly scheme.