The Effect of Telephone Support on Postpartum Depression: A Randomized Controlled Trial

Introduction:Postpartum depression is a common disorder. Systematic reviews emphasized the need to conduct more trials about interventions to prevent postpartum depression. The aim of this study was to determine the effect of postpartum telephone support on maternal depression. Methods:366 postpartum women with no history of known depression were randomly assigned into control (244 subjects) and intervention (122 subjects) groups. The control group received only routine postpartum care. In the intervention group, telephone support was provided twice in the first week and once a week during the second to sixth week of postpartum by a trained midwife in addition to the routine care. In order to meet their unpredicted needs, the mothers could contact the consultant 24 hours a day. Postpartum depression was assessed using the self-administered Edinburgh Depression Scale at 60 to 65 days of postpartum. Mothers with scores of 13 and above were considered to have depression. Logistic regression and Student’s t-test were used for the data analysis. Results:There was no significant difference regarding frequency of depression between the intervention and control groups (29.9% vs. 31.6%; Odds ratio 0.91, 95% CI 0.56 to 1.49). Mean of depression score was not significantly different between the groups [9.2 (6.1) vs. 10.4 (5.8); mean difference -1.19, 95%CI -2.5 to 0.13]. Conclusion:This study did not provide evidence to show that telephone support of a midwife during postpartum period have a preventive effect on postpartum depression

The Selberg-Arthur trace formula: based on lectures by James Arthur

This book based on lectures given by James Arthur discusses the trace formula of Selberg and Arthur. The emphasis is laid on Arthur's trace formula for GL(r), with several examples in order to illustrate the basic concepts. The book will be useful and stimulating reading for graduate students in automorphic forms, analytic number theory, and non-commutative harmonic analysis, as well as researchers in these fields. Contents: I. Number Theory and Automorphic Representations.1.1. Some problems in classical number theory, 1.2. Modular forms and automorphic representations; II. Selberg's Trace Formula 2.1. Historical Remarks, 2.2. Orbital integrals and Selberg's trace formula, 2.3.Three examples, 2.4. A necessary condition, 2.5. Generalizations and applications; III. Kernel Functions and the Convergence Theorem, 3.1. Preliminaries on GL(r), 3.2. Combinatorics and reduction theory, 3.3. The convergence theorem; IV. The Ad lic Theory, 4.1. Basic facts; V. The Geometric Theory, 5.1. The JTO(f) and JT(f) distributions, 5.2. A geometric I- function, 5.3. The weight functions; VI. The Geometric Expansionof the Trace Formula, 6.1. Weighted orbital integrals, 6.2. The unipotent distribution; VII. The Spectral Theory, 7.1. A review of the Eisenstein series, 7.2. Cusp forms, truncation, the trace formula; VIII.The Invariant Trace Formula and its Applications, 8.1. The invariant trace formula for GL(r), 8.2. Applications and remark

Coding theory and bilinear complexity

The subject of the present book is naturally divided into three parts. The first part (Chapter 1) deals with the $\textit{theory of linear error correcting codes}$. Here one is interested in the mathematical theory of secure information transmission, e.g., satellite communication. This should not be confused with cryptology where the aim is to guard information against unauthorized access. The second part of the book (Chapters 3, 5, 6, and 7) deals with the theory of $\textit{algebraic function fields}$ and applies this theory to the so-called $\textit{modular function fields}$. These function fields- or equivalently, algebraic curves-arise from compactifications of the fundamental domain of the action of certain subgroups of SL$_{2}$(Z) on the upper half plane. Reductions of these curves modulo primes p (outside a finite set of special primes) yields series of algebraic curves over finite fields with many rational points. Finally, the last part of this book (Chapters 8-10) is devoted to a treatment of bilinear complexity theory. Here one is interested in the minimal number of multiplications necessary to compute bilinear forms. One of the most famous representatives of this class of problems is that of determining the asymptotic complexity of matrix multiplication. The first two subjects merge to the theory of "Geometric Goppa-Codes" , also known as "Algebraic-Geometric Codes" which is discussed in Chapter 3. There exists excellent literature on this subject, among which we only mention [42]. For obtaining asymptotically good linear codes from geometric Goppa codes, the main problem is the construction of sequences of curves with many rational points, as is described in Chapter 4. On the contrary to the theory of error-correcting codes or that of algebraic curves over finite fields, there does not yet exist an up to date concise treatment of the theory of bilinear complexity$^{1}$. Therefore we have decided to give a brief account of the theory which meets our demands in Chapter 8. With the tools developed there we shall see in Chapter 9 that coding theory can be applied to obtain lower bounds in complexity theory in the following sense: one can translate the complexity of a given bilinear map into the problem of determining a linear code of minimal block length when the dimension and the minimum distance are [...

Caracterização de comportamento anômalo em redes Ad Hoc

Monografia (graduação)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2008.As redes ad hoc oferecem vários desafios, como falta de infra-estrutura, recursos limitados, problemas de segurança e confiança entre os nós. Como é preciso cooperação entre os nós para o bom funcionamento da rede, pode ocorrer que alguns tenham um comportamento egoísta e busquem formas de obter vantagens. Este tipo de comportamento é prejudicial e precisa ser evitado. Existem vários sistemas de reputação que buscam detectar mau comportamento e estabelecer uma relação de confiança entre os nós. Nestes sistemas, nós com mau comportamento ao serem detectados são classificados, como não confiáveis e punidos. Entretanto, estes mecanismos consideram os eventos que ocorrem apenas na camada de rede. Alguns sistemas de detecção analisam o desvio e conduta na camada de enlace, mas não são sistemas de reputação. Por serem restritos a apenas uma camada, cada um destes sistemas é vulnerável aos nós que eventualmente decidam agir maliciosamente em outra camada. A proposta deste trabalho é estudar o mau comportamento de um nó levando em consideração que isto pode ocorrer em qualquer camada. Neste trabalho será proposto um sistema de reputação cross-layer que não está restrito a uma única camada. Entretanto, procurou-se dar maior ênfase aos problemas de mau comportamento na camada MAC, que equivale a um módulo do sistema de reputação proposto. Por meio de várias simulações, procurou-se mostrar o quanto um nó pode ganhar sendo malicioso na camada MAC e o prejuízo que este pode causar. Mostrou-se também como podemos detectar um nó malicioso e quais parâmetros devem ser utilizados para evitar falsos positivos