No description available.

No description available.

No description available.

No / A two-tiered architecture with resource-rich master nodes at the upper tier and resource-poor sensor nodes at the lower tier is expected to be adopted in large scale sensor networks. In a hostile environment, adversaries are more motivated to compromise the master nodes to break the authenticity and completeness of query results, whereas it is lack of light and secure query processing protocol in tiered sensor networks at present. In this paper, we study the problem of verifiable fine-grained top- queries in two-tiered sensor networks, and propose a novel verification scheme, which is named Verification Scheme for Fine-grained Top- Queries (VSFTQ). To make top- query results verifiable, VSFTQ establishes relationships among data items of each sensor node using their orders, which are encrypted together with the scores of the data items and the interested time epoch number using distinct symmetric keys kept by each sensor node and the network owner. Both theoretical analysis and simulation results show that VSFTQ can not only ensure high probability of detecting forged and/or incomplete query results, but also significantly decrease the amount of verification information when compared with existing schemes.

In this dissertation, we introduce combinatorial interpretations for three types of HallLittlewood polynomials (denoted Rλ, Pλ, and Qλ) by using weighted combinatorial objects called abacus-tournaments. We then apply these models to give combinatorial proofs of properties of Hall-Littlewood polynomials. For example, we show why various specializations of Hall-Littlewood polynomials produce the Schur symmetric polynomials, the elementary symmetric polynomials, or the t-analogue of factorials. With the abacus-tournament model, we give a bijective proof of a Pieri rule for Hall-Littlewood polynomials that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with an elementary symmetric polynomial ek. We also give a bijective proof of certain cases of a second Pieri rule that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with another Hall-Littlewood polynomial Q(r) . In general, proofs using abacus-tournaments focus on canceling abacus-tournaments and then finding weight-preserving bijections between the sets of uncanceled abacus-tournaments. / Ph. D.

Effective image compression requires a non-expansive discrete wavelet transform (DWT) be employed; consequently, image border extension is a critical issue. Ideally, the image border extension method should not introduce distortion under compression. It has been shown in literature that symmetric extension performs better than periodic extension. However, the non-expansive, symmetric extension using fast Fourier transform and circular convolution DWT methods require symmetric filters. This precludes orthogonal wavelets for image compression since they cannot simultaneously possess the desirable properties of orthogonality and symmetry. Thus, biorthogonal wavelets have been the de facto standard for image compression applications. The viability of symmetric extension with biorthogonal wavelets is the primary reason cited for their superior performance. Recent matrix-based techniques for computing a non-expansive DWT have suggested the possibility of implementing symmetric extension with orthogonal wavelets. For the first time, this thesis analyzes and compares orthogonal and biorthogonal wavelets with symmetric extension. Our results indicate a significant performance improvement for orthogonal wavelets when they employ symmetric extension. Furthermore, our analysis also identifies that linear (or near-linear) phase filters are critical to compression performance---an issue that has not been recognized to date. We also demonstrate that biorthogonal and orthogonal wavelets generate similar compression performance when they have similar filter properties and both employ symmetric extension. The biorthogonal wavelets indicate a slight performance advantage for low frequency images; however, this advantage is significantly smaller than recently published results and is explained in terms of wavelet properties not previously considered. / Master of Science

The variety of principal minors of nxn symmetric matrices, denoted Zn, can be described naturally as a projection from the Lagrangian Grassmannian. Moreover, Zn is invariant under the action of a group G C GL(2n) isomorphic to (SL(2)xn) x Sn. One may use this symmetry to study the defining ideal of Zn as a G-module via a coupling of classical representation theory and geometry. The need for the equations in the defining ideal comes from applications in matrix theory, probability theory, spectral graph theory and statistical physics. I describe an irreducible G-module of degree 4 polynomials called the hyperdeterminantal module (which is constructed as the span of the G-orbit of Cayley's hyperdeterminant of format 2 x 2 x 2) and show that it that cuts out Zn set theoretically. This result solves the set-theoretic version of a conjecture of Holtz and Sturmfels and gives a collection of necessary and sufficient conditions for when it is possible for a given vector of length 2n to be the principal minors of a symmetric n x n matrix. In addition to solving the Holtz and Sturmfels conjecture, I study Zn as a prototypical G-variety. As a result, I exhibit the use of and further develop techniques from classical representation theory and geometry for studying G-varieties.

No description available.

Neste trabalho foi proposto o modelo linear parcial generalizado simétrico, com base nos modelos lineares parciais generalizados e nos modelos lineares simétricos, em que a variável resposta segue uma distribuição que pertence à família de distribuições simétricas, considerando um preditor linear que possui uma parte paramétrica e uma não paramétrica. Algumas distribuições que pertencem a essa classe são as distribuições: Normal, t-Student, Exponencial potência, Slash e Hiperbólica, dentre outras. Uma breve revisão dos conceitos utilizados ao longo do trabalho foram apresentados, a saber: análise residual, influência local, parâmetro de suavização, spline, spline cúbico, spline cúbico natural e algoritmo backfitting, dentre outros. Além disso, é apresentada uma breve teoria dos modelos GAMLSS (modelos aditivos generalizados para posição, escala e forma). Os modelos foram ajustados utilizando o pacote gamlss disponível no software livre R. A seleção de modelos foi baseada no critério de Akaike (AIC). Finalmente, uma aplicação é apresentada com base em um conjunto de dados reais da área financeira do Chile. / In this work we propose the symmetric generalized partial linear model, based on the generalized partial linear models and symmetric linear models, that is, the response variable follows a distribution that belongs to the symmetric distribution family, considering a linear predictor that has a parametric and a non-parametric component. Some distributions that belong to this class are distributions: Normal, t-Student, Power Exponential, Slash and Hyperbolic among others. A brief review of the concepts used throughout the work was presented, namely: residual analysis, local influence, smoothing parameter, spline, cubic spline, natural cubic spline and backfitting algorithm, among others. In addition, a brief theory of GAMLSS models is presented (generalized additive models for position, scale and shape). The models were adjusted using the package gamlss available in the free R software. The model selection was based on the Akaike criterion (AIC). Finally, an application is presented based on a set of real data from Chile\'s financial area.

The Aldous order is an ordering of representations of the symmetric group motivated by the Aldous Conjecture, a conjecture about random processes proved in 2009. In general, the Aldous order is very difficult to compute, and the proper relations have yet to be determined even for small cases. However, by restricting the problem down to Young-Jucys-Murphy elements, the problem becomes explicitly combinatorial. This approach has led to many novel insights, whose proofs are simple and elegant. However, there remain many open questions related to the Aldous Order, both in general and for the Young-Jucys-Murphy elements.