Learning Object-Independent Modes of Variation with Feature Flow Fields

We present a unifying framework in which "object-independent" modes of variation are learned from continuous-time data such as video sequences. These modes of variation can be used as "generators" to produce a manifold of images of a new object from a single example of that object. We develop the framework in the context of a well-known example: analyzing the modes of spatial deformations of a scene under camera movement. Our method learns a close approximation to the standard affine deformations that are expected from the geometry of the situation, and does so in a completely unsupervised (i.e. ignorant of the geometry of the situation) fashion. We stress that it is learning a "parameterization", not just the parameter values, of the data. We then demonstrate how we have used the same framework to derive a novel data-driven model of joint color change in images due to common lighting variations. The model is superior to previous models of color change in describing non-linear color changes due to lighting.

An empirical 3D model of the large-scale coronal structure based on the distribution of H? filaments on the solar disk

Morgan, H.; Habbal, S. R., An empirical 3D model of the large-scale coronal structure based on the distribution of H? filaments on the solar disk, Astronomy and Astrophysics, Volume 464, Issue 1, March II 2007, pp.357-365

The Geometry of Frequency Squares

Mavron, Vassili; Jungnickel, D.; McDonough, T.P., (2001) 'The Geometry of Frequency Squares', Journal of Combinatorial Theory, Series A 96, pp.376-387 RAE2008

Hardware design of cryptographic accelerators

With the rapid growth of the Internet and digital communications, the volume of sensitive electronic transactions being transferred and stored over and on insecure media has increased dramatically in recent years. The growing demand for cryptographic systems to secure this data, across a multitude of platforms, ranging from large servers to small mobile devices and smart cards, has necessitated research into low cost, flexible and secure solutions. As constraints on architectures such as area, speed and power become key factors in choosing a cryptosystem, methods for speeding up the development and evaluation process are necessary. This thesis investigates flexible hardware architectures for the main components of a cryptographic system. Dedicated hardware accelerators can provide significant performance improvements when compared to implementations on general purpose processors. Each of the designs proposed are analysed in terms of speed, area, power, energy and efficiency. Field Programmable Gate Arrays (FPGAs) are chosen as the development platform due to their fast development time and reconfigurable nature. Firstly, a reconfigurable architecture for performing elliptic curve point scalar multiplication on an FPGA is presented. Elliptic curve cryptography is one such method to secure data, offering similar security levels to traditional systems, such as RSA, but with smaller key sizes, translating into lower memory and bandwidth requirements. The architecture is implemented using different underlying algorithms and coordinates for dedicated Double-and-Add algorithms, twisted Edwards algorithms and SPA secure algorithms, and its power consumption and energy on an FPGA measured. Hardware implementation results for these new algorithms are compared against their software counterparts and the best choices for minimum area-time and area-energy circuits are then identified and examined for larger key and field sizes. Secondly, implementation methods for another component of a cryptographic system, namely hash functions, developed in the recently concluded SHA-3 hash competition are presented. Various designs from the three rounds of the NIST run competition are implemented on FPGA along with an interface to allow fair comparison of the different hash functions when operating in a standardised and constrained environment. Different methods of implementation for the designs and their subsequent performance is examined in terms of throughput, area and energy costs using various constraint metrics. Comparing many different implementation methods and algorithms is nontrivial. Another aim of this thesis is the development of generic interfaces used both to reduce implementation and test time and also to enable fair baseline comparisons of different algorithms when operating in a standardised and constrained environment. Finally, a hardware-software co-design cryptographic architecture is presented. This architecture is capable of supporting multiple types of cryptographic algorithms and is described through an application for performing public key cryptography, namely the Elliptic Curve Digital Signature Algorithm (ECDSA). This architecture makes use of the elliptic curve architecture and the hash functions described previously. These components, along with a random number generator, provide hardware acceleration for a Microblaze based cryptographic system. The trade-off in terms of performance for flexibility is discussed using dedicated software, and hardware-software co-design implementations of the elliptic curve point scalar multiplication block. Results are then presented in terms of the overall cryptographic system.

Gauge/gravity duality and the interplay of various fractional branes

We consider different types of fractional branes on a Z2 orbifold of the conifold and analyze in detail the corresponding gauge/gravity duality. The gauge theory possesses a rich and varied dynamics, both in the UV and in the IR. We find the dual supergravity solution, which contains both untwisted and twisted 3-form fluxes, related to what are known as deformation and N=2 fractional branes, respectively. We analyze the resulting renormalization group flow from the supergravity perspective, by developing an algorithm to easily extract it. We find hints of a generalization of the familiar cascade of Seiberg dualities due to a nontrivial interplay between the different types of fractional branes. We finally consider the IR behavior in several limits, where the dominant effective dynamics is either confining in a Coulomb phase or runaway, and discuss the resolution of singularities in the dual geometric background. © 2008 The American Physical Society.

Three parallel programming paradigms: Comparisons on an archetypal PDE computation

Three paradigms for distributed-memory parallel computation that free the application programmer from the details of message passing are compared for an archetypal structured scientific computation -- a nonlinear, structured-grid partial differential equation boundary value problem -- using the same algorithm on the same hardware. All of the paradigms -- parallel languages represented by the Portland Group's HPF, (semi-)automated serial-to-parallel source-to-source translation represented by CAP-Tools from the University of Greenwich, and parallel libraries represented by Argonne's PETSc -- are found to be easy to use for this problem class, and all are reasonably effective in exploiting concurrency after a short learning curve. The level of involvement required by the application programmer under any paradigm includes specification of the data partitioning, corresponding to a geometrically simple decomposition of the domain of the PDE. Programming in SPMD style for the PETSc library requires writing only the routines that discretize the PDE and its Jacobian, managing subdomain-to-processor mappings (affine global-to-local index mappings), and interfacing to library solver routines. Programming for HPF requires a complete sequential implementation of the same algorithm as a starting point, introduction of concurrency through subdomain blocking (a task similar to the index mapping), and modest experimentation with rewriting loops to elucidate to the compiler the latent concurrency. Programming with CAPTools involves feeding the same sequential implementation to the CAPTools interactive parallelization system, and guiding the source-to-source code transformation by responding to various queries about quantities knowable only at runtime. Results representative of "the state of the practice" for a scaled sequence of structured grid problems are given on three of the most important contemporary high-performance platforms: the IBM SP, the SGI Origin 2000, and the CRAYY T3E.

A new parameterization of Johnson's SB distribution with application to fitting forest tree diameter data

The SB distributional model of Johnson's 1949 paper was introduced by a transformation to normality, that is, z ~ N(0, 1), consisting of a linear scaling to the range (0, 1), a logit transformation, and an affine transformation, z = γ + δu. The model, in its original parameterization, has often been used in forest diameter distribution modelling. In this paper, we define the SB distribution in terms of the inverse transformation from normality, including an initial linear scaling transformation, u = γ′ + δ′z (δ′ = 1/δ and γ′ = �γ/δ). The SB model in terms of the new parameterization is derived, and maximum likelihood estimation schema are presented for both model parameterizations. The statistical properties of the two alternative parameterizations are compared empirically on 20 data sets of diameter distributions of Changbai larch (Larix olgensis Henry). The new parameterization is shown to be statistically better than Johnson's original parameterization for the data sets considered here.

Plagiomnium T. Kop. (Plagiomniaceae, Musci) en la Península Ibérica e llles Balears

Se ha realizado la revisión de ejemplares de Plagiomnium T. Kop., en la Península Ibérica, registrados en los Herbarios de España, Portugal y Francia, así como en algunas colecciones privadas. Siete taxones de Plagiomnium están representados en España: P. affine, P. cuspidatum, P. elatum, P. ellipticum, P. medium subsp. medium, P. rostratum y P. undulatum, y en Portugal cuatro taxones: P. affine, P. medium subsp. mediurn, P. rostratum y P. undulatum. En Mallorca (Illes Balears), queda excluido P. cuspidatum y P. elatum es nuevo para estas islas. P. undulatum, P. affine y P. rostratum son las especies más comunes en los bosques y zonas montañosas de la Península; P. cuspidatum y P. elatum son frecuentes en la mitad septentrional de España, siendo muy escasos en la parte meridional; los más raros son: P. ellipticum y P. medium subsp. medium, que están restringidos a los hábitats mesofíticos, suelos oligotrofos y húmedos de Pirineos, Cordillera Cantábrica y el piso supra-oromediterráneo de los Montes de Cataluña, Sistema Ibérico septentrional (Macizo de La Demanda) y Sistema Central. Se aportan fotografías de las esporas al SEM de P. affine, P. medium subsp. medium, P. rostratum y P. undulatum así como los mapas de distribución de cada taxon.

Self-assembled triple helicates with preferential helicity

The enantiomerically pure ligands LRR and LSS (N,N'-bis(-2,2'-bipyridyl-5-yl)carbonyl-(1S/R,2S/R)-(+/-)-1,2-diaminocyclohexane) have been synthesised by linking two 2,2'-bipyridine units by (R,R)- and (S,S)-1,2-diaminocyclohexane respectively. The crystal structure confirmed that the ligand had a twisted orientation between the two chelating units. The reaction of LRR and LSS with Fe(II), Co(III), Cd(II) and Zn(II) afforded dinuclear complexes confirmed by ES mass spectroscopy. CD spectroscopy indicated that the chiral diaminocyclohexane conferred helicity to the metal centre giving a dominant triple helicate diastereoisomer, with the LRR ligand giving a delta-configuration of each metal centre (P helicate) and the LSS ligand a lambda configuration (M helicate). 1H NMR spectroscopy confirmed a dominant major diastereoisomer with cadmium. The Zn(II) and Cd(II) complexes however were observed to undergo rapid ligand dissociation in solution.

Brief review of invariant texture analysis methods

This paper considers invariant texture analysis. Texture analysis approaches whose performances are not affected by translation, rotation, affine, and perspective transform are addressed. Existing invariant texture analysis algorithms are carefully studied and classified into three categories: statistical methods, model based methods, and structural methods. The importance of invariant texture analysis is presented first. Each approach is reviewed according to its classification, and its merits and drawbacks are outlined. The focus of possible future work is also suggested.

On velocity-based local model networks for nonlinear identification

This paper exposes the strengths and weaknesses of the recently proposed velocity-based local model (LM) network. The global dynamics of the velocity-based blended representation are directly related to the dynamics of the underlying local models, an important property in the design of local controller networks. Furthermore, the sub-models are continuous-time and linear providing continuity with established linear theory and methods. This is not true for the conventional LM framework, where the global dynamics are only weakly related to the affine sub-models. In this paper, a velocity-based multiple model network is identified for a highly nonlinear dynamical system. The results show excellent dynamical modelling performances, highlighting the value of the velocity-based approach for the design and analysis of LM based control. Three important practical issues are also addressed. These relate to the blending of the velocity-based local models, the use of normalised Gaussian basis functions and the requirement of an input derivative.

Constructing networks of continuous-time velocity-based models

A conventional local model (LM) network consists of a set of affine local models blended together using appropriate weighting functions. Such networks have poor interpretability since the dynamics of the blended network are only weakly related to the underlying local models. In contrast, velocity-based LM networks employ strictly linear local models to provide a transparent framework for nonlinear modelling in which the global dynamics are a simple linear combination of the local model dynamics. A novel approach for constructing continuous-time velocity-based networks from plant data is presented. Key issues including continuous-time parameter estimation, correct realisation of the velocity-based local models and avoidance of the input derivative are all addressed. Application results are reported for the highly nonlinear simulated continuous stirred tank reactor process.

Molecular systematics of Ceramium and Centroceras (Ceramiaceae, Rhodophyta) from Brazil

Morphological investigations identified 11 Ceramium Roth species, of the 18 previously reported from Brazil. Phylogenetic analyses of sequences of the chloroplast-encoded rbcL gene confirmed the presence of seven of these species. Three other species are reported from Brazil for the first time. Ceramium affine Setchell & Gardner and C. filicula Harvey ex Womersley were previously known only from the Pacific Ocean (Mexico and Australia, respectively). A new species, C. fujianum Barros-Barreto et Maggs sp. nov., is described here. Its general habit is similar to that of C. strictum sensu Harvey from Europe but it has one less periaxial cell than C. strictum; its cortical filament arrangement is closest to C. deslongchampsii Chauvin ex Duby, also from Europe, but whorled tetrasporangia partially covered by cortical cells differ strikingly from the naked protruding tetrasporangia of C. deslongchampsii. Ceramium species in which each periaxial cell cuts off transversely only a single basipetal cell formed a robust clade. The genus Ceramium as represented in Brazil is not monophyletic with respect to Centroceras Kutzing and Corallophila Weber-van Bosse; Ceramium nitens, which has axial cells completely covered by rounded cortical cells formed by acropetal and basipetal filaments, did not group with any Ceramium clade but was weakly allied to a species of Corallophila. All three Brazilian Centroceras sequences were attributed to a single species, C. clavulatum.

Crystal structures of imidazolium bis(trifluoromethanesulfonyl)imide 'ionic liquid' salts: the first organic salt with a cis-TFSI anion conformation

Crystal structures of two examples of an important class of ionic liquids, 1,3-dimethylimidazolium and 1,2,3-triethylimidazolium bis(trifluoromethanesulfonyl)imide have been characterized by single crystal X-ray diffraction. The anion in the 1,3-dimethylimidazolium example (mp 22 degreesC), adopts an unusual cis-geometry constrained by bifurcated cation-anion C-H...O hydrogen-bonds from the imidazolium cation to the anion resulting in the formation of fluorous layers within the solid-state structure. In contrast, in the 1,2,3-triethylimidazolium salt (mp 57 degreesC), the ions are discretely packed with only weak C-H...O contacts between the ions close to the van der Waals separation distances, and with the anion adopting the twisted conformation observed for all other examples from the limited set of organic bis( trifluoromethanesulfonyl) imide crystal structures. The structures are discussed in terms of the favorable physical properties that bis(trifluoromethanesulfonyl) imide anions impart in ionic liquids.

Structural changes in quasi-one-dimensional many-electron systems: From linear to zigzag and beyond

Many-electron systems confined to a quasi-one-dimensional geometry by a cylindrical distribution of positive charge have been investigated by density functional computations in the unrestricted local spin density approximation. Our investigations have been focused on the low-density regime, in which electrons are localized. The results reveal a wide variety of different charge and spin configurations, including linear and zig-zag chains, single-and double-strand helices, and twisted chains of dimers. The spin-spin coupling turns from weakly antiferromagnetic at relatively high density, to weakly ferromagnetic at the lowest densities considered in our computations. The stability of linear chains of localized charge has been investigated by analyzing the radial dependence of the self-consistent potential and by computing the dispersion relation of low-energy harmonic excitations.