Using Terrestrial LiDAR to Monitor Erosion within the Gold Basin Landslide Complex, Verlot, WA

In 2014 the United States Forest Service closed the Gold Basin Campground of western Washington in an effort to protect the public from unstable hillslopes directly adjacent to the campground. The Gold Basin Landslide Complex (GBLC) is actively eroding via block fall, dry ravel, and debris flows, which contribute sediment into the South Fork of the Stillaguamish River. This sediment diminishes the salmonid population within the South Fork of the Stillaguamish River by reducing habitable spawning grounds, which is a big concern to the Stillaguamish Tribe of Indians. In this investigation, I quantified patterns of degradation and total volume of sediment erosion from the middle lobe of the GBLC over the period of July 2015 through January 2016 using terrestrial (ground-based) LiDAR (TLS). I characterized site specific stratigraphy and geomorphic processes, and laid the groundwork for future, long-term monitoring of this site. Results of this investigation determined that ~ 4,800m3 of sediment was eroded from the middle lobe of the GBLC during the 6 month study period (July 2015 – January 2016). This erosion likely occurred from debris flows, raveling of poorly sorted sand and gravel deposits and block failures of high plasticity silts and clays, and/or other mass wasting mechanisms. The generalized stratigraphic sequence in the GBLC consists of alternating massive beds of sand and gravel with silts and clays. The low permeability of these silts and clays provide a perfect venue for groundwater to percolate, as I observed during field investigations, which likely contributes to the active instability of the hillslopes. Continued monitoring and mapping of this complex will lead to viable information that could help both the United States Forest Service and the Stillaguamish Tribe.

Applicazioni tecnologiche e nuovi metodi di valutazione della performance negli sport acquatici

Nello sport di alto livello l’uso della tecnologia ha raggiunto un ruolo di notevole importanza per l’analisi e la valutazione della prestazione. Negli ultimi anni sono emerse nuove tecnologie e sono migliorate quelle pre-esistenti (i.e. accelerometri, giroscopi e software per l’analisi video) in termini di campionamento, acquisizione dati, dimensione dei sensori che ha permesso la loro “indossabilità” e l’inserimento degli stessi all’interno degli attrezzi sportivi. La tecnologia è sempre stata al servizio degli atleti come strumento di supporto per raggiungere l’apice dei risultati sportivi. Per questo motivo la valutazione funzionale dell’atleta associata all’uso di tecnologie si pone lo scopo di valutare i miglioramenti degli atleti misurando la condizione fisica e/o la competenza tecnica di una determinata disciplina sportiva. L’obiettivo di questa tesi è studiare l’utilizzo delle applicazioni tecnologiche e individuare nuovi metodi di valutazione della performance in alcuni sport acquatici. La prima parte (capitoli 1-5), si concentra sulla tecnologia prototipale chiamata E-kayak e le varie applicazioni nel kayak di velocità. In questi lavori è stata verificata l’attendibilità dei dati forniti dal sistema E-kayak con i sistemi presenti in letteratura. Inoltre, sono stati indagati nuovi parametri utili a comprendere il modello di prestazione del paddler. La seconda parte (capitolo 6), si riferisce all’analisi cinematica della spinta verticale del pallanuotista, attraverso l’utilizzo della video analisi 2D, per l’individuazione delle relazioni Forza-velocità e Potenza-velocità direttamente in acqua. Questo studio pilota, potrà fornire indicazioni utili al monitoraggio e condizionamento di forza e potenza da svolgere direttamente in acqua. Infine la terza parte (capitoli 7-8), si focalizza sull’individuazione della sequenza di Fibonacci (sequenza divina) nel nuoto a stile libero e a farfalla. I risultati di questi studi suggeriscono che il ritmo di nuotata tenuto durante le medie/lunghe distanze gioca un ruolo chiave. Inoltre, il livello di autosomiglianza (self-similarity) aumenta con la tecnica del nuoto.

On Cooperative solutions of a generalized assignment game: limit theorems to the set of competitive equilibria

We study two cooperative solutions of a market with indivisible goods modeled as a generalized assignment game: Set-wise stability and Core. We first establish that the Set-wise stable set is contained in the Core and it contains the non-empty set of competitive equilibrium payoffs. We then state and prove three limit results for replicated markets. First, the sequence of Cores of replicated markets converges to the set of competitive equilibrium payoffs when the number of replicas tends to infinity. Second, the Set-wise stable set of a two-fold replicated market already coincides with the set of competitive equilibrium payoffs. Third, for any number of replicas there is a market with a Core payoff that is not a competitive equilibrium payoff.

When should clinicians search for GLUT1 deficiency syndrome in childhood generalized epilepsies?

UNLABELLED: GLUT1 deficiency (GLUT1D) has recently been identified as an important cause of generalized epilepsies in childhood. As it is a treatable condition, it is crucial to determine which patients should be investigated. METHODS: We analyzed SLC2A1 for mutations in a group of 93 unrelated children with generalized epilepsies. Fasting lumbar puncture was performed following the identification of a mutation. We compared our results with a systematic review of 7 publications of series of patients with generalized epilepsies screened for SLC2A1 mutations. RESULTS: We found 2/93 (2.1%) patients with a SLC2A1 mutation. One, carrying a novel de novo deletion had epilepsy with myoclonic-atonic seizures (MAE), mild slowing of head growth, choreiform movements and developmental delay. The other, with a paternally inherited missense mutation, had childhood absence epilepsy with atypical EEG features and paroxysmal exercise-induced dyskinesia (PED) initially misdiagnosed as myoclonic seizures. Out of a total of 1110 screened patients with generalized epilepsies from 7 studies, 2.4% (29/1110) had GLUT1D. This rate was higher (5.6%) among 303 patients with early onset absence epilepsy (EOAE) from 4 studies. About 50% of GLUT1D patients had abnormal movements and 41% a family history of seizures, abnormal movements or both. CONCLUSION: GLUT1D is most likely to be found in MAE and in EOAE. The probability of finding GLUT1D in the classical idiopathic generalized epilepsies is very low. Pointers to GLUT1D include an increase in seizures before meals, cognitive impairment, or PED which can easily be overlooked.

A generalized mechanistic codon model.

Models of codon evolution have attracted particular interest because of their unique capabilities to detect selection forces and their high fit when applied to sequence evolution. We described here a novel approach for modeling codon evolution, which is based on Kronecker product of matrices. The 61 × 61 codon substitution rate matrix is created using Kronecker product of three 4 × 4 nucleotide substitution matrices, the equilibrium frequency of codons, and the selection rate parameter. The entities of the nucleotide substitution matrices and selection rate are considered as parameters of the model, which are optimized by maximum likelihood. Our fully mechanistic model allows the instantaneous substitution matrix between codons to be fully estimated with only 19 parameters instead of 3,721, by using the biological interdependence existing between positions within codons. We illustrate the properties of our models using computer simulations and assessed its relevance by comparing the AICc measures of our model and other models of codon evolution on simulations and a large range of empirical data sets. We show that our model fits most biological data better compared with the current codon models. Furthermore, the parameters in our model can be interpreted in a similar way as the exchangeability rates found in empirical codon models.

Improving the sensitivity of the sequence profile method.

The sequence profile method (Gribskov M, McLachlan AD, Eisenberg D, 1987, Proc Natl Acad Sci USA 84:4355-4358) is a powerful tool to detect distant relationships between amino acid sequences. A profile is a table of position-specific scores and gap penalties, providing a generalized description of a protein motif, which can be used for sequence alignments and database searches instead of an individual sequence. A sequence profile is derived from a multiple sequence alignment. We have found 2 ways to improve the sensitivity of sequence profiles: (1) Sequence weights: Usage of individual weights for each sequence avoids bias toward closely related sequences. These weights are automatically assigned based on the distance of the sequences using a published procedure (Sibbald PR, Argos P, 1990, J Mol Biol 216:813-818). (2) Amino acid substitution table: In addition to the alignment, the construction of a profile also needs an amino acid substitution table. We have found that in some cases a new table, the BLOSUM45 table (Henikoff S, Henikoff JG, 1992, Proc Natl Acad Sci USA 89:10915-10919), is more sensitive than the original Dayhoff table or the modified Dayhoff table used in the current implementation. Profiles derived by the improved method are more sensitive and selective in a number of cases where previous methods have failed to completely separate true members from false positives.

Nonlinear models and small sample performance of the generalized method of moments

In this paper I explore the issue of nonlinearity (both in the datageneration process and in the functional form that establishes therelationship between the parameters and the data) regarding the poorperformance of the Generalized Method of Moments (GMM) in small samples.To this purpose I build a sequence of models starting with a simple linearmodel and enlarging it progressively until I approximate a standard (nonlinear)neoclassical growth model. I then use simulation techniques to find the smallsample distribution of the GMM estimators in each of the models.

Parallel characterizations of a generalized shapley value and a generalized banzhaf value for cooperative games with level structure of cooperation

We present parallel characterizations of two different values in the framework of restricted cooperation games. The restrictions are introduced as a finite sequence of partitions defined on the player set, each of them being coarser than the previous one, hence forming a structure of different levels of a priori unions. On the one hand, we consider a value first introduced in Ref. [18], which extends the Shapley value to games with different levels of a priori unions. On the other hand, we introduce another solution for the same type of games, which extends the Banzhaf value in the same manner. We characterize these two values using logically comparable properties.

Anomaly Detection Using System Call Sequence Sets.

This paper discusses our research in developing a generalized and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that concise and accurate classifiers can be constructed to detect anomalies. An overview of the approach that we have implemented is provided.

The full infinite dimensional moment problem on semi-algebraic sets of generalized functions

We consider a generic basic semi-algebraic subset S of the space of generalized functions, that is a set given by (not necessarily countably many) polynomial constraints. We derive necessary and sufficient conditions for an infinite sequence of generalized functions to be realizable on S, namely to be the moment sequence of a finite measure concentrated on S. Our approach combines the classical results about the moment problem on nuclear spaces with the techniques recently developed to treat the moment problem on basic semi-algebraic sets of Rd. In this way, we determine realizability conditions that can be more easily verified than the well-known Haviland type conditions. Our result completely characterizes the support of the realizing measure in terms of its moments. As concrete examples of semi-algebraic sets of generalized functions, we consider the set of all Radon measures and the set of all the measures having bounded Radon–Nikodym density w.r.t. the Lebesgue measure.

Fibonacci bimodal maps

We introduce the Fibonacci bimodal maps on the interval and show that their two turning points are both in the same minimal invariant Cantor set. Two of these maps with the same orientation have the same kneading sequences and, among bimodal maps without central returns, they exhibit turning points with the strongest recurrence as possible.

Aplicações da q-Álgebra em física da matéria condensada

We address the generalization of thermodynamic quantity q-deformed by q-algebra that describes a general algebra for bosons and fermions . The motivation for our study stems from an interest to strengthen our initial ideas, and a possible experimental application. On our journey, we met a generalization of the recently proposed formalism of the q-calculus, which is the application of a generalized sequence described by two parameters deformation positive real independent and q1 and q2, known for Fibonacci oscillators . We apply the wellknown problem of Landau diamagnetism immersed in a space D-dimensional, which still generates good discussions by its nature, and dependence with the number of dimensions D, enables us future extend its application to systems extra-dimensional, such as Modern Cosmology, Particle Physics and String Theory. We compare our results with some experimentally obtained performing major equity. We also use the formalism of the oscillators to Einstein and Debye solid, strengthening the interpretation of the q-deformation acting as a factor of disturbance or impurity in a given system, modifying the properties of the same. Our results show that the insertion of two parameters of disorder, allowed a wider range of adjustment , i.e., enabling change only the desired property, e.g., the thermal conductivity of a same element without the waste essence

COMPARISON OF THE ANOMALOUS AND NONANOMALOUS GENERALIZED SCHWINGER MODELS VIA THE FUNCTIONAL FORMALISM

We calculate the Green functions of the two versions of the generalized Schwinger model, the anomalous and the nonanomalous one, in their higher order Lagrangian density form. Furthermore, it is shown through a sequence of transformations that the bosonized Lagrangian density is equivalent to the former, at least for the bosonic correlation functions. The introduction of the sources from the beginning, leading to a gauge-invariant source term, is also considered. It is verified that the two models have the same correlation functions only if the gauge-invariant sector is taken into account. Finally, there is presented a generalization of the Wess-Zumino term, and its physical consequences are studied, in particular the appearance of gauge-dependent massive excitations.

Chain sequences and symmetric generalized orthogonal polynomials

in this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K-n((lambda.,M,k)) associated with the probability measure dphi(lambda,M,k;x), which is the Gegenbauer measure of parameter lambda + 1 with two additional mass points at +/-k. When k = 1 we obtain information on the polynomials K-n((lambda.,M)) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K-n((lambda,M,k)) in relation to M and k are also given. (C) 2002 Elsevier B.V. B.V. All rights reserved.

A BCH code and a sequence of cyclic codes

This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.