Modellbildung in der algebraischen Kryptoanalyse

In der algebraischen Kryptoanalyse werden moderne Kryptosysteme als polynomielle, nichtlineare Gleichungssysteme dargestellt. Das Lösen solcher Gleichungssysteme ist NP-hart. Es gibt also keinen Algorithmus, der in polynomieller Zeit ein beliebiges nichtlineares Gleichungssystem löst. Dennoch kann man aus modernen Kryptosystemen Gleichungssysteme mit viel Struktur generieren. So sind diese Gleichungssysteme bei geeigneter Modellierung quadratisch und dünn besetzt, damit nicht beliebig. Dafür gibt es spezielle Algorithmen, die eine Lösung solcher Gleichungssysteme finden. Ein Beispiel dafür ist der ElimLin-Algorithmus, der mit Hilfe von linearen Gleichungen das Gleichungssystem iterativ vereinfacht. In der Dissertation wird auf Basis dieses Algorithmus ein neuer Solver für quadratische, dünn besetzte Gleichungssysteme vorgestellt und damit zwei symmetrische Kryptosysteme angegriffen. Dabei sind die Techniken zur Modellierung der Chiffren von entscheidender Bedeutung, so das neue Techniken entwickelt werden, um Kryptosysteme darzustellen. Die Idee für das Modell kommt von Cube-Angriffen. Diese Angriffe sind besonders wirksam gegen Stromchiffren. In der Arbeit werden unterschiedliche Varianten klassifiziert und mögliche Erweiterungen vorgestellt. Das entstandene Modell hingegen, lässt sich auch erfolgreich auf Blockchiffren und auch auf andere Szenarien erweitern. Bei diesen Änderungen muss das Modell nur geringfügig geändert werden.

2D-3D Rigid-Body Registration of X-Ray Fluoroscopy and CT Images

The registration of pre-operative volumetric datasets to intra- operative two-dimensional images provides an improved way of verifying patient position and medical instrument loca- tion. In applications from orthopedics to neurosurgery, it has a great value in maintaining up-to-date information about changes due to intervention. We propose a mutual information- based registration algorithm to establish the proper align- ment. For optimization purposes, we compare the perfor- mance of the non-gradient Powell method and two slightly di erent versions of a stochastic gradient ascent strategy: one using a sparsely sampled histogramming approach and the other Parzen windowing to carry out probability density approximation. Our main contribution lies in adopting the stochastic ap- proximation scheme successfully applied in 3D-3D registra- tion problems to the 2D-3D scenario, which obviates the need for the generation of full DRRs at each iteration of pose op- timization. This facilitates a considerable savings in compu- tation expense. We also introduce a new probability density estimator for image intensities via sparse histogramming, de- rive gradient estimates for the density measures required by the maximization procedure and introduce the framework for a multiresolution strategy to the problem. Registration results are presented on uoroscopy and CT datasets of a plastic pelvis and a real skull, and on a high-resolution CT- derived simulated dataset of a real skull, a plastic skull, a plastic pelvis and a plastic lumbar spine segment.

Learning-Based Approach to Real Time Tracking and Analysis of Faces

This paper describes a trainable system capable of tracking faces and facialsfeatures like eyes and nostrils and estimating basic mouth features such as sdegrees of openness and smile in real time. In developing this system, we have addressed the twin issues of image representation and algorithms for learning. We have used the invariance properties of image representations based on Haar wavelets to robustly capture various facial features. Similarly, unlike previous approaches this system is entirely trained using examples and does not rely on a priori (hand-crafted) models of facial features based on optical flow or facial musculature. The system works in several stages that begin with face detection, followed by localization of facial features and estimation of mouth parameters. Each of these stages is formulated as a problem in supervised learning from examples. We apply the new and robust technique of support vector machines (SVM) for classification in the stage of skin segmentation, face detection and eye detection. Estimation of mouth parameters is modeled as a regression from a sparse subset of coefficients (basis functions) of an overcomplete dictionary of Haar wavelets.

Observations on Cortical Mechanisms for Object Recognition andsLearning

This paper sketches a hypothetical cortical architecture for visual 3D object recognition based on a recent computational model. The view-centered scheme relies on modules for learning from examples, such as Hyperbf-like networks. Such models capture a class of explanations we call Memory-Based Models (MBM) that contains sparse population coding, memory-based recognition, and codebooks of prototypes. Unlike the sigmoidal units of some artificial neural networks, the units of MBMs are consistent with the description of cortical neurons. We describe how an example of MBM may be realized in terms of cortical circuitry and biophysical mechanisms, consistent with psychophysical and physiological data.

The Individual is Nothing, the Class Everything: Psychophysics and Modeling of Recognition in Obect Classes

Most psychophysical studies of object recognition have focussed on the recognition and representation of individual objects subjects had previously explicitely been trained on. Correspondingly, modeling studies have often employed a 'grandmother'-type representation where the objects to be recognized were represented by individual units. However, objects in the natural world are commonly members of a class containing a number of visually similar objects, such as faces, for which physiology studies have provided support for a representation based on a sparse population code, which permits generalization from the learned exemplars to novel objects of that class. In this paper, we present results from psychophysical and modeling studies intended to investigate object recognition in natural ('continuous') object classes. In two experiments, subjects were trained to perform subordinate level discrimination in a continuous object class - images of computer-rendered cars - created using a 3D morphing system. By comparing the recognition performance of trained and untrained subjects we could estimate the effects of viewpoint-specific training and infer properties of the object class-specific representation learned as a result of training. We then compared the experimental findings to simulations, building on our recently presented HMAX model of object recognition in cortex, to investigate the computational properties of a population-based object class representation as outlined above. We find experimental evidence, supported by modeling results, that training builds a viewpoint- and class-specific representation that supplements a pre-existing repre-sentation with lower shape discriminability but possibly greater viewpoint invariance.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EMand the Minimum Spanning Tree algorithm to find the ML and MAP mixtureof trees for a variety of priors, including the Dirichlet and the MDL priors.

Notes on PCA, Regularization, Sparsity and Support Vector Machines

We derive a new representation for a function as a linear combination of local correlation kernels at optimal sparse locations and discuss its relation to PCA, regularization, sparsity principles and Support Vector Machines. We first review previous results for the approximation of a function from discrete data (Girosi, 1998) in the context of Vapnik"s feature space and dual representation (Vapnik, 1995). We apply them to show 1) that a standard regularization functional with a stabilizer defined in terms of the correlation function induces a regression function in the span of the feature space of classical Principal Components and 2) that there exist a dual representations of the regression function in terms of a regularization network with a kernel equal to a generalized correlation function. We then describe the main observation of the paper: the dual representation in terms of the correlation function can be sparsified using the Support Vector Machines (Vapnik, 1982) technique and this operation is equivalent to sparsify a large dictionary of basis functions adapted to the task, using a variation of Basis Pursuit De-Noising (Chen, Donoho and Saunders, 1995; see also related work by Donahue and Geiger, 1994; Olshausen and Field, 1995; Lewicki and Sejnowski, 1998). In addition to extending the close relations between regularization, Support Vector Machines and sparsity, our work also illuminates and formalizes the LFA concept of Penev and Atick (1996). We discuss the relation between our results, which are about regression, and the different problem of pattern classification.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning Tree algorithm to find the ML and MAP mixture of trees for a variety of priors, including the Dirichlet and the MDL priors. We also show that the single tree classifier acts like an implicit feature selector, thus making the classification performance insensitive to irrelevant attributes. Experimental results demonstrate the excellent performance of the new model both in density estimation and in classification.

A Unified Framework for Regularization Networks and Support Vector Machines

Regularization Networks and Support Vector Machines are techniques for solving certain problems of learning from examples -- in particular the regression problem of approximating a multivariate function from sparse data. We present both formulations in a unified framework, namely in the context of Vapnik's theory of statistical learning which provides a general foundation for the learning problem, combining functional analysis and statistics.

Selecting Relevant Genes with a Spectral Approach

Array technologies have made it possible to record simultaneously the expression pattern of thousands of genes. A fundamental problem in the analysis of gene expression data is the identification of highly relevant genes that either discriminate between phenotypic labels or are important with respect to the cellular process studied in the experiment: for example cell cycle or heat shock in yeast experiments, chemical or genetic perturbations of mammalian cell lines, and genes involved in class discovery for human tumors. In this paper we focus on the task of unsupervised gene selection. The problem of selecting a small subset of genes is particularly challenging as the datasets involved are typically characterized by a very small sample size ?? the order of few tens of tissue samples ??d by a very large feature space as the number of genes tend to be in the high thousands. We propose a model independent approach which scores candidate gene selections using spectral properties of the candidate affinity matrix. The algorithm is very straightforward to implement yet contains a number of remarkable properties which guarantee consistent sparse selections. To illustrate the value of our approach we applied our algorithm on five different datasets. The first consists of time course data from four well studied Hematopoietic cell lines (HL-60, Jurkat, NB4, and U937). The other four datasets include three well studied treatment outcomes (large cell lymphoma, childhood medulloblastomas, breast tumors) and one unpublished dataset (lymph status). We compared our approach both with other unsupervised methods (SOM,PCA,GS) and with supervised methods (SNR,RMB,RFE). The results clearly show that our approach considerably outperforms all the other unsupervised approaches in our study, is competitive with supervised methods and in some case even outperforms supervised approaches.

Las Juntas Neogranadinas y el constitucionalismo criollo pregaditano (Debates)

Este artículo plantea cómo las juntas de gobierno establecidas en el Nuevo Reino de Granada (Colombia), desengañadas por la posición de las Cortes de Cádiz frente a la representación y las aspiraciones criollas, y al mismo tiempo recelosas de las pretensiones hegemónicas de la capital virreinal, optaron por desarrollar un temprano y disperso proceso constituyente que dio origen a varias constituciones que antecedieron en el tiempo, y en más de una ocasión superaron en su concepción de la ciudadanía, el Estado y la sociedad a la Constitución de Cádiz en marzo de 1812.

Identification of Summer Origins of Songbirds Migrating through Southern Canada in Autumn

Stable hydrogen isotopes (δD) in flight feathers were measured to investigate the summer origins of five species of boreal-breeding warblers captured during fall migration at Canadian Migration Monitoring Network (CMMN) stations spread across southern Canada. Mean δD varied among stations and species within stations, but there was broad overlap in δD values. Although isotope ratios indicate that migrants at each station come from a wide range of latitudes, they are unable to provide much longitudinal discrimination. Band recoveries are sparse, but indicate that in general western Canadian warblers move southeast in fall, eastern birds move southwest, and there is a transition zone in the Great Lakes region. Combining knowledge of migratory direction with isotope results increases discrimination of breeding areas. Isotope results support fall migratory movements by Blackpoll Warbler (Dendroica striata) and Northern Waterthrush (Seiurus novaboracensis) that are more easterly than for other species, and in all study species, birds from more northern regions passed through southern Canada later in the season. Migration monitoring stations capture birds from broad areas of latitude, and migrants passing through each province appear to come from largely different portions of the Canadian breeding range, so a few stations placed in each province should suffice collectively to sample birds from most of the boreal forest. Migration monitoring in southern Canada, therefore, has the potential to monitor status of boreal forest birds in Canada that are unsampled by other monitoring programs.

Mallard Use of Hen HousesTM in Eastern Ontario

Nesting structures for ground-nesting waterfowl may be an effective technique for increasing nesting success in regions in which nest success is below the 15% threshold needed to maintain a stable population. We studied the occupancy rate of artificial nesting structures called hen housesTM by Mallards (Anas platyrhynchos) nesting in two different wetland habitats, beaver ponds and sewage lagoons, in eastern Ontario during 1999–2001. We hypothesized that, because natural cover was sparse on sewage lagoons, Mallards would occupy hen houses at a higher rate on sewage lagoons than on beaver ponds. However, of the 248 hen houses distributed between beaver ponds and sewage lagoons, none was occupied by waterfowl. Common Grackles (Quiscalus quiscula) were the only avian species that nested in hen houses. However, Mallards successfully nested directly under several structures (n = 6) when water levels were low enough to expose the ground beneath them. Mayfield daily nest survival estimates for Mallards nesting in natural cover were similar on sewage lagoons and beaver ponds for all years (mean = 0.99) and were higher than most published estimates. Factors such as nesting cover, predation pressures, and structure design and material may influence the use of artificial hen houses and should be considered when planning a hen house program outside of the Prairie Pothole Region.

Influence of vegetation on the nocturnal foraging behaviors and vertebrate prey capture by endangered Burrowing Owls

Restrictions in technology have limited past habitat selection studies for many species to the home-range level, as a finer-scale understanding was often not possible. Consequently, these studies may not identify the true mechanism driving habitat selection patterns, which may influence how such results are applied in conservation. We used GPS dataloggers with digital video recorders to identify foraging modes and locations in which endangered Burrowing Owls (Athene cunicularia) captured prey. We measured the coarse and fine-scale characteristics of vegetation at locations in which owls searched for, versus where they caught, vertebrate prey. Most prey items were caught using hover-hunting. Burrowing Owls searched for, and caught, vertebrate prey in all cover types, but were more likely to kill prey in areas with sparse and less dense vegetative cover. Management strategies designed to increase Burrowing Owl foraging success in the Canadian prairies should try to ensure a mosaic of vegetation heights across cover types.

Evaluation of reanalysis rainfall estimates over Ethiopia

There is a pressing need for good rainfall data for the African continent both for humanitarian and climatological purposes. Given the sparseness of ground-based observations, one source of rainfall information is Numerical Weather Prediction (NWP) model outputs. The aim of this article is to investigate the quality of two NWP products using Ethiopia as a test case. The two products evaluated are the ERA-40 and NCEP reanalysis rainfall products. Spatial, seasonal and interannual variability of rainfall have been evaluated for Kiremt (JJAS) and Belg (FMAM) seasons at a spatial scale that reflects the local variability of the rainfall climate using a method which makes optimum use of sparse gauge validation data. We found that the spatial pattern of the rainfall climatology is captured well by both models especially for the main rainy season Kiremt. However, both models tend to overestimate the mean rainfall in the northwest, west and central regions but underestimate in the south and east. The overestimation is greater for NCEP in Belg season and greater for ERA-40 in Kiremt Season. ERA-40 captures the annual cycle over most of the country better than NCEP, but strongly exaggerates the Kiremt peak in the northwest and west. The overestimation in Kiremt appears to have been reduced since the assimilation of satellite data increased around 1990. For both models the interannual variability is less well captured than the spatial and seasonal variability. Copyright © 2008 Royal Meteorological Society