Local power properties of some asymptotic tests in symmetric linear regression models

In this paper we obtain asymptotic expansions, up to order n(-1/2) and under a sequence of Pitman alternatives, for the nonnull distribution functions of the likelihood ratio, Wald, score and gradient test statistics in the class of symmetric linear regression models. This is a wide class of models which encompasses the t model and several other symmetric distributions with longer-than normal tails. The asymptotic distributions of all four statistics are obtained for testing a subset of regression parameters. Furthermore, in order to compare the finite-sample performance of these tests in this class of models, Monte Carlo simulations are presented. An empirical application to a real data set is considered for illustrative purposes. (C) 2011 Elsevier B.V. All rights reserved.

Design-based random permutation models with auxiliary information

We extend the random permutation model to obtain the best linear unbiased estimator of a finite population mean accounting for auxiliary variables under simple random sampling without replacement (SRS) or stratified SRS. The proposed method provides a systematic design-based justification for well-known results involving common estimators derived under minimal assumptions that do not require specification of a functional relationship between the response and the auxiliary variables.

The discriminants associated to isotropy representations of symmetric spaces

We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum number of squares required to represent the discrimininant is developed and applied in examples.

A Single Statistic for Monitoring the Covariance Matrix of Bivariate Processes

In this article, we present a new control chart for monitoring the covariance matrix in a bivariate process. In this method, n observations of the two variables were considered as if they came from a single variable (as a sample of 2n observations), and a sample variance was calculated. This statistic was used to build a new control chart specifically as a VMIX chart. The performance of the new control chart was compared with its main competitors: the generalized sampled variance chart, the likelihood ratio test, Nagao's test, probability integral transformation (v(t)), and the recently proposed VMAX chart. Among these statistics, only the VMAX chart was competitive with the VMIX chart. For shifts in both variances, the VMIX chart outperformed VMAX; however, VMAX showed better performance for large shifts (higher than 10%) in one variance.

Mixed-valence state of symmetric diruthenium complexes: synthesis, characterization, and electron transfer investigation

Complexes of the type {[(pyS)Ru(NH3)(4)](2)-mu-L}(n), where pyS = 4-mercaptopyridine, L = 4,4'-dithiodipyridine (pySSpy), pyrazine (pz) and 1,4-dicyanobenzene (DCB), and n = +4 and +5 for fully reduced and mixed-valence complexes, respectively, were synthesized and characterized. Electrochemical data showed that there is electron communication between the metal centers with comproportionation constants of 33.2, 1.30 x 10(8) and 5.56 x 10(5) for L = pySSpy, pz and DCB, respectively. It was also observed that the electronic coupling between the metal centers is affected by the p-back-bonding interaction toward the pyS ligand. Raman spectroscopy showed a dependence of the intensity of the vibrational modes on the exciting radiations giving support to the assignments of the electronic transitions. The degree of electron communication between the metal centers through the bridging ligands suggests that these systems can be molecular wire materials.

Width of buccal and posterior corridors: differences between cases treated with asymmetric and symmetric extractions

OBJECTIVE: To verify if there is difference in the buccal and posterior corridor width in cases treated with extraction of one and four premolars. METHODS: Through posed smile photographs of 23 Class II patients, subdivision, treated with extraction of one premolar and 25 Class I and Class II patients, subdivision, treated with extraction of four premolars, the percentage of buccal and posterior corridor width was calculated. The two protocols of extractions were compared regarding the buccal and posterior corridor width by independent t tests. RESULTS: There was no statistically significant difference on the buccal and posterior corridor widths between patients treated with symmetric and asymmetric extraction. CONCLUSION: The buccal and posterior corridor did not differ between the evaluated protocols of extractions.

Matrix-vector multiplication and triangular linear solver using GPGPU for symmetric positive definite matrices derived from elliptic equations

The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.

Near-Optimum Coding for q-ary Symmetric Channel with Application to Space Communications

Questa Tesi aspira a mostrare un codice a livello di pacchetto, che abbia performance molto vicine a quello ottimo, per progetti di comunicazioni Satellitari. L’altro scopo di questa Tesi è quello di capire se rimane ancora molto più difficile maneggiare direttamente gli errori piuttosto che le erasures. Le applicazioni per comunicazioni satellitari ora come ora usano tutte packet erasure coding per codificare e decodificare l’informazione. La struttura dell’erasure decoding è molto semplice, perché abbiamo solamente bisogno di un Cyclic Redundancy Check (CRC) per realizzarla. Il problema nasce quando abbiamo pacchetti di dimensioni medie o piccole (per esempio più piccole di 100 bits) perché in queste situazioni il costo del CRC risulta essere troppo dispendioso. La soluzione la possiamo trovare utilizzando il Vector Symbol Decoding (VSD) per raggiungere le stesse performance degli erasure codes, ma senza la necessità di usare il CRC. Per prima cosa viene fatta una breve introduzione su come è nata e su come si è evoluta la codifica a livello di pacchetto. In seguito è stato introdotto il canale q-ary Symmetric Channel (qSC), con sia la derivazione della sua capacità che quella del suo Random Coding Bound (RCB). VSD è stato poi proposto con la speranza di superare in prestazioni il Verification Based Decoding (VBD) su il canale qSC. Infine, le effettive performance del VSD sono state stimate via simulazioni numeriche. I possibili miglioramenti delle performance, per quanto riguarda il VBD sono state discusse, come anche le possibili applicazioni future. Inoltre abbiamo anche risposto alla domande se è ancora così tanto più difficile maneggiare gli errori piuttosto che le erasure.

C 3-symmetric discotic liquid crystalline materials for molecular electronics: versatile synthesis and self-organization

This thesis presents the versatile synthesis and self-organization of C3-symmetric discotic nanographene molecules as well as their potential applications as materials in molecular electronics. The details can be described as follows: 1) A novel synthetic strategy towards properly designed C3 symmetric 1,3,5-tris-2’arylbenzene precursors has been developed. After the final planarization by treatment with FeCl3 under mild conditions, for the first time, it became possible to access a variety of new C3-symmetric hexa-peri-hexabenzocoronenes (HBCs) and a series of triangle-shaped nanographenes. D3 symmetric HBC with three alkyl substituents and C2 symmetric HBC with two alkyl substituents were synthesized and found to show the surprising decrease of isotropic points., the self-assembly at the liquid-solid interface displayed a unique zigzag and flower patterns. 2) Triangle-shaped discotics revealed a unique self-assembly behavior in solution, solid state as well as at the solution-substrate interface. A mesophase stability over the broad temperature range with helical supramoelcular arrangement were observed in the bulk state. The honeycomb pattern as the result of novel self-assembly was presented. Triangle-shaped discotics with swallow alkyl tails were fabricated into photovoltaic devices, the supramolecular arrangement upon thermal treatment was found to play a key role in the improvement of solar efficiency. 3) A novel class of C3 symmetric HBCs with alternating polar/apolar substituents was synthesized. Their peculiar self-assembly in solution, in the bulk and on the surface were investigated by NMR techniques, X-ray diffraction as well as different electron microscope techniques. 4) A novel concept for manipulating the intracolumnar stacking of discotics and thus for controlling the helical pitch was presented. A unique staggered stacking in the column was achieved for the first time. Theoretical simulations confirmed this self-organization and predicted that this packing should show the highest charge carrier mobility for all discotics.

On the identification of bridge decks aeroelastic coefficients: the covariance block hankel matrix method

Il seguente elaborato si concentra sull'identifi�cazione strutturale di sistemi soggetti a sollecitazioni aeroelastiche e nello speci�fico l'attenzione viene rivolta ad impalcati da ponte. Si analizzano i concetti principali caratterizzanti il campo dell'aeroelasticità indagando i fattori dominanti che entrano in gioco sul piano teorico. In seguito, si considera il metodo di identifi�cazione strutturale chiamato Covariance Block Hankel Matrix (CBHM) utilizzato come strumento di derivazione dei coeffi�cienti aeroelastici propri della struttura. Infi�ne, si indaga il comportamento di questo metodo di identi�ficazione al variare di una serie di parametri chiave e all'interno di diversi scenari, visionando risultati ottenuti tramite una serie di test eff�ettuati per provare l'a�dattabilità del metodo stesso al variare delle condizioni che caratterizzano il sistema.

Permutation classes, sorting algorithms, and lattice paths

A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomorphic to it. Donald Knuth, in the first volume of his celebrated book "The art of Computer Programming", observed that the permutations that can be computed (or, equivalently, sorted) by some particular data structures can be characterized in terms of pattern avoidance. In more recent years, the topic was reopened several times, while often in terms of sortable permutations rather than computable ones. The idea to sort permutations by using one of Knuth’s devices suggests to look for a deterministic procedure that decides, in linear time, if there exists a sequence of operations which is able to convert a given permutation into the identical one. In this thesis we show that, for the stack and the restricted deques, there exists an unique way to implement such a procedure. Moreover, we use these sorting procedures to create new sorting algorithms, and we prove some unexpected commutation properties between these procedures and the base step of bubblesort. We also show that the permutations that can be sorted by a combination of the base steps of bubblesort and its dual can be expressed, once again, in terms of pattern avoidance. In the final chapter we give an alternative proof of some enumerative results, in particular for the classes of permutations that can be sorted by the two restricted deques. It is well-known that the permutations that can be sorted through a restricted deque are counted by the Schrӧder numbers. In the thesis, we show how the deterministic sorting procedures yield a bijection between sortable permutations and Schrӧder paths.

Permutation-based stochastic ordering using pairwise comparisons

The topic of this work concerns nonparametric permutation-based methods aiming to find a ranking (stochastic ordering) of a given set of groups (populations), gathering together information from multiple variables under more than one experimental designs. The problem of ranking populations arises in several fields of science from the need of comparing G>2 given groups or treatments when the main goal is to find an order while taking into account several aspects. As it can be imagined, this problem is not only of theoretical interest but it also has a recognised relevance in several fields, such as industrial experiments or behavioural sciences, and this is reflected by the vast literature on the topic, although sometimes the problem is associated with different keywords such as: "stochastic ordering", "ranking", "construction of composite indices" etc., or even "ranking probabilities" outside of the strictly-speaking statistical literature. The properties of the proposed method are empirically evaluated by means of an extensive simulation study, where several aspects of interest are let to vary within a reasonable practical range. These aspects comprise: sample size, number of variables, number of groups, and distribution of noise/error. The flexibility of the approach lies mainly in the several available choices for the test-statistic and in the different types of experimental design that can be analysed. This render the method able to be tailored to the specific problem and the to nature of the data at hand. To perform the analyses an R package called SOUP (Stochastic Ordering Using Permutations) has been written and it is available on CRAN.

Chargaff symmetric stochastic processes

Scopo della modellizzazione delle stringhe di DNA è la formulazione di modelli matematici che generano sequenze di basi azotate compatibili con il genoma esistente. In questa tesi si prendono in esame quei modelli matematici che conservano un'importante proprietà, scoperta nel 1952 dal biochimico Erwin Chargaff, chiamata oggi "seconda regola di Chargaff". I modelli matematici che tengono conto delle simmetrie di Chargaff si dividono principalmente in due filoni: uno la ritiene un risultato dell'evoluzione sul genoma, mentre l'altro la ipotizza peculiare di un genoma primitivo e non intaccata dalle modifiche apportate dall'evoluzione. Questa tesi si propone di analizzare un modello del secondo tipo. In particolare ci siamo ispirati al modello definito da da Sobottka e Hart. Dopo un'analisi critica e lo studio del lavoro degli autori, abbiamo esteso il modello ad un più ampio insieme di casi. Abbiamo utilizzato processi stocastici come Bernoulli-scheme e catene di Markov per costruire una possibile generalizzazione della struttura proposta nell'articolo, analizzando le condizioni che implicano la validità della regola di Chargaff. I modelli esaminati sono costituiti da semplici processi stazionari o concatenazioni di processi stazionari. Nel primo capitolo vengono introdotte alcune nozioni di biologia. Nel secondo si fa una descrizione critica e prospettica del modello proposto da Sobottka e Hart, introducendo le definizioni formali per il caso generale presentato nel terzo capitolo, dove si sviluppa l'apparato teorico del modello generale.

Multifrequency VLBA observations of two compact symmetric objects

In this thesis the results of the multifrequency VLBA observations of the GPS 1944+5448 and the HFP J0111+3906 are presented. They are compact objects smaller than about 100 pc, completely embedded in the host galaxy. The availability of multi-epoch VLBI observations spanning more than 10 years, allowed us to compute the hot spot advance speed in order to obtain the kinematic age of both sources. Both radio sources are young, in agreement with the idea that they are in an early evolutionary stage. The spectral analysis of each source component, such as the lobes, the hot spots, the core and the jets, making a comparison with the theoretical ones is described. In addition the physical parameters derived from VLBA images as the magnetic field, the luminosity, the energy and the ambient medium density of both sources are discussed.

Synthesis and metal complexes of C2 symmetric ligands obtained from (R)-(+)-Betti and dialdehydes for asymmetric induction reactions

The aim of this master’s research thesis was the employment of an enantiopure 1,3-aminoalcohol, the 1-(α-aminobenzyl)-2-naphthol, known as Betti base, for the synthesis of some novel compounds which show a C2 symmetry. Some of these compounds, after derivatization, were used as ligands in association with transition metals to prepare some catalysts for enantioselective catalytic reactions. Some aminoalcohol (Salan-type) derivatives of these compounds were obtained upon reduction and in some cases it was possible to obtain complexes with transition metals such as Mn, Ni, Co and Cu. Furthermore a novel 6-membered analogue bisoxazoline ligand, 2,6-bis((R)-1-Phenyl-1H-naphtho[1,2-e][1,3]oxazin-3-yl)pyridine, was obtained and from it two Cu-complexes were prepared. The metal complexes were employed in some reactions to test the asymmetric induction, which was in some cases up to discrete values.