Linear response functions for a vibrational configuration interaction state

Linear response functions are implemented for a vibrational configuration interaction state allowing accurate analytical calculations of pure vibrational contributions to dynamical polarizabilities. Sample calculations are presented for the pure vibrational contributions to the polarizabilities of water and formaldehyde. We discuss the convergence of the results with respect to various details of the vibrational wave function description as well as the potential and property surfaces. We also analyze the frequency dependence of the linear response function and the effect of accounting phenomenologically for the finite lifetime of the excited vibrational states. Finally, we compare the analytical response approach to a sum-over-states approach

Variational calculation of vibrational linear and nonlinear optical properties

A variational approach for reliably calculating vibrational linear and nonlinear optical properties of molecules with large electrical and/or mechanical anharmonicity is introduced. This approach utilizes a self-consistent solution of the vibrational Schrödinger equation for the complete field-dependent potential-energy surface and, then, adds higher-level vibrational correlation corrections as desired. An initial application is made to static properties for three molecules of widely varying anharmonicity using the lowest-level vibrational correlation treatment (i.e., vibrational Møller-Plesset perturbation theory). Our results indicate when the conventional Bishop-Kirtman perturbation method can be expected to break down and when high-level vibrational correlation methods are likely to be required. Future improvements and extensions are discussed

Assembling genes from predicted exons in linear time with dynamic programming

In a number of programs for gene structure prediction in higher eukaryotic genomic sequences, exon prediction is decoupled from gene assembly: a large pool of candidate exons is predicted and scored from features located in the query DNA sequence, and candidate genes are assembled from such a pool as sequences of nonoverlapping frame-compatible exons. Genes are scored as a function of the scores of the assembled exons, and the highest scoring candidate gene is assumed to be the most likely gene encoded by the query DNA sequence. Considering additive gene scoring functions, currently available algorithms to determine such a highest scoring candidate gene run in time proportional to the square of the number of predicted exons. Here, we present an algorithm whose running time grows only linearly with the size of the set of predicted exons. Polynomial algorithms rely on the fact that, while scanning the set of predicted exons, the highest scoring gene ending in a given exon can be obtained by appending the exon to the highest scoring among the highest scoring genes ending at each compatible preceding exon. The algorithm here relies on the simple fact that such highest scoring gene can be stored and updated. This requires scanning the set of predicted exons simultaneously by increasing acceptor and donor position. On the other hand, the algorithm described here does not assume an underlying gene structure model. Indeed, the definition of valid gene structures is externally defined in the so-called Gene Model. The Gene Model specifies simply which gene features are allowed immediately upstream which other gene features in valid gene structures. This allows for great flexibility in formulating the gene identification problem. In particular it allows for multiple-gene two-strand predictions and for considering gene features other than coding exons (such as promoter elements) in valid gene structures.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

Quality of life transformations before and after kidney transplantation: A prospective qualitative study.

The aim of this IRB-approved study was to analyze prospectively quality of life (QOL) and psychological changes in 30 ESRD patients before and after kidney transplantation (KT). Semi-structured interviews were conducted after inclusion on the waiting list (A). Follow-up interviews were performed 6 months later with patients still awaiting KT (B6, n= 15), and with transplant recipients 6, 12 and 24 months after KT (C6, n=15; C12, n=15; C24, n=14). Qualitative thematic analysis was performed. A: All patients reported loss of freedom, 87% tried to maintain normality; 57% modified medical directives. All mentioned emotional fragility, negative thoughts (43%), and suicidal thoughts (20%) related to loss of QOL from dialysis (D), and professional tension (26%). B6: 40% reported no change compared to baseline, while 60% mentioned increase of illness intrusiveness, 46% D side effects, 40% communication problems, and 33% concerns about the waiting list handling. Fear of emotional breakdown (40%), couple problems (47%), and worsened professional difficulties (20%) were reported. C6: All patients reported recovery of QOL and concerns about acute rejection. 73% were anxious about laboratory results. 93% felt dependent on immunosuppressants (IS), 47% reported difficulties coping with their regimen, and 47% were concerned about side effects; 67% had resumed work, but medical constraints led 40% to professional stigmatization. C12: All enjoyed good QOL. Adherence to IS was mandatory (100%). All were aware of the limited long-term graft survival and 47% anxious about a possible return to D. 60% underlined positive life value; 47% resumed a full time job; 40% were on social security. C24: Good QOL was underlined (86%). Patients stated they would prefer re-TX to resuming D (71%). Post-TX health problems were mentioned (64%); increase of creatinine levels induced fear (36%). 79% complained about side effects. 64% reported changes in life values. This study reveals positive QOL and psychological transformations after KT, which are associated with positive changes related to graft survival and freedom from D. Psychological follow-up should be offered to patients who face relapsing ESRD or post-TX co-morbidities.

Voice Transformations for Extreme Vocal Effects

Extreme Vocal Effects (EVE) in music are so recent that few studies have been carried out about how they are physiologically produced and whether they are harmful or not for the human voice.Voice Transformations in real-time are possible nowadays thanks to new technologies and voice processing algorithms. This Master's Thesis pretends to define and classify these new singing techniques and to create a mapping between the physiological aspect of each EVE to its relative spectrumvariations.Voice Transformation Models based on these mappings are proposed and discussed for each one of these EVEs. We also discuss different transformation methods and strategies in order to obtain better results.A subjective evaluation of the results of the transformations is also presented and discussed along with further work, improvements, and working lines on this field.

Generalized linear and generalized additive models in studies of species distributions: setting the scene

An important statistical development of the last 30 years has been the advance in regression analysis provided by generalized linear models (GLMs) and generalized additive models (GAMs). Here we introduce a series of papers prepared within the framework of an international workshop entitled: Advances in GLMs/GAMs modeling: from species distribution to environmental management, held in Riederalp, Switzerland, 6-11 August 2001.We first discuss some general uses of statistical models in ecology, as well as provide a short review of several key examples of the use of GLMs and GAMs in ecological modeling efforts. We next present an overview of GLMs and GAMs, and discuss some of their related statistics used for predictor selection, model diagnostics, and evaluation. Included is a discussion of several new approaches applicable to GLMs and GAMs, such as ridge regression, an alternative to stepwise selection of predictors, and methods for the identification of interactions by a combined use of regression trees and several other approaches. We close with an overview of the papers and how we feel they advance our understanding of their application to ecological modeling.

Psychological transformations in kidney transplantation: A prospective qualitative study

The aim of this IRB-approved study was to prospectively analyze psychological transformations in ESRD patients before and after transplantation (KT). Semi-structured interviews were conducted in 30 patients (mean age = 53±10) after their inclusion on the waiting-list (Gr. A). Follow-up interviews were performed 6 months later in 15 patients still awaiting KT (Gr. B6), and in 15 patients 6 months (Gr. C6) and 12 months (Gr. C12) after KT. Qualitative analysis was performed. Gr: A:All patients underlined loss of freedom, 87% devoted much energy to maintain normality, 57% modified medical directives. All reported emotional fragility related to dialysis and loss of quality of life (QOL), negative (43%) or suicidal thoughts (20%). Professional stigma was underlined (26%). Gr: B6:40% reported no change, 60% mentioned increase of illness intrusiveness, 46% dialysis side-effects, 40% communication problems, 33% tension with medical staff and waiting list handling. Fear of emotional breakdown (40%), couple problems (47%) and worsened professional difficulties (20%) were reported. Gr: C6:All patients mentioned improved QOL and freedom recovery (87%). All expressed concerns about possible acute rejection, 73% were anxious about laboratory results, 93% experienced dependence to immunosuppressants, 47% reported difficulties in handling medication, 21% feared to forget them, 47% were concerned about side-effects, 67% had resumed work but medical constraints led to professional tension (40%). Gr: C12:All mentioned recovered QOL. Medical controls were accepted as a routine (87%) and adherence to medication was mandatory (100%). All mentioned the limited long-term graft survival and 47% were anxious about possible return to dialysis, especially younger patients (27%). Positive identity and existential changes were reported (60%). This prospective qualitative study identifies psychological modifications in the course of KT. It provides a basis to adequately address concerns, but it shows also that KT is clearly associated with positive psychological transformations.