La dysménorrhée: un problème pour le pédiatre [Dysmenorrhea: a problem for the pediatrician?].

Dysmenorrhea is common in adolescent years, especially after the onset of ovulatory cycles, usually 2 to 3 years after menarche. Pain and symptoms are responsible for school absenteeism and interruption of sports and social activities. OBJECTIVES: This study aims to measure the prevalence of severe dysmenorrhea and its consequences on adolescent girls in Switzerland. Treatment of dysmenorrhea is discussed and recommendations for clinical practice are given. STUDY DESIGN: Cross sectional survey (SMASH 02) on a nationally representative sample of adolescents (n=7548; 3340 females), aged 16 to 20 years who attended post-mandatory education. A self-administered questionnaire was used to assess the severity of dysmenorrhea and its consequences on daily life pursuit of medical help and medications used. RESULTS: Among 3340 girls, 86.6% suffered from dysmenorrhea-related symptoms: 12.4% described having severe dysmenorrhea and 74.2% moderate dysmenorrhea. Girls with severe dysmenorrhea described heavier consequences on daily activities compared with girls without dysmenorrhea: 47.8% of girls with severe dysmenorrhea reported staying at home and 66.5% declared reducing their sportive activities. Yet, fewer than half have consulted a physician for this complaint and even fewer were treated properly. RECOMMENDATION: The pediatrician has a pivotal role in screening young patients for dysmenorrhea, as well as, educating and effectively treating adolescent girls with menstruation-associated symptoms. Non-steroidal anti-inflammatory drugs are considered the first-line of treatment for dysmenorrhea, and adolescents with symptoms that do not respond to this treatment for 3 menstrual periods should be offered combined oestroprogestative contraception and must be followed up, as non-responders may have an underlying organic pathology. CONCLUSION: Dysmenorrhea is a frequent health problem in adolescent years and adolescent care providers should be able to care for these patients in an efficient way.

Multiuser detection in a dynamic environment — Part II: Joint user identification and parameter estimation

The problem of jointly estimating the number, the identities, and the data of active users in a time-varying multiuser environment was examined in a companion paper (IEEE Trans. Information Theory, vol. 53, no. 9, September 2007), at whose core was the use of the theory of finite random sets on countable spaces. Here we extend that theory to encompass the more general problem of estimating unknown continuous parameters of the active-user signals. This problem is solved here by applying the theory of random finite sets constructed on hybrid spaces. We doso deriving Bayesian recursions that describe the evolution withtime of a posteriori densities of the unknown parameters and data.Unlike in the above cited paper, wherein one could evaluate theexact multiuser set posterior density, here the continuous-parameter Bayesian recursions do not admit closed-form expressions. To circumvent this difficulty, we develop numerical approximationsfor the receivers that are based on Sequential Monte Carlo (SMC)methods (“particle filtering”). Simulation results, referring to acode-divisin multiple-access (CDMA) system, are presented toillustrate the theory.

Neonatal Minimally Invasive Surgery for Congenital Diaphragmatic Hernias: a multicenter study using thoracoscopy or laparoscopy.

BACKGROUND: Minimally invasive surgery (MIS) for late-presenting congenital diaphragmatic hernia (CDH) has been described previously, but few neonatal cases of CDH have been reported. This study aimed to report the multicenter experience of these rare cases and to compare the laparoscopic and thoracoscopic approaches. METHODS: Using MIS procedures, 30 patients (16 boys and 14 girls) from nine centers underwent surgery for CDH within the first month of life, 26 before day 5. Only one patient had associated malformations. There were 10 preterm patients (32-36 weeks of gestational age). Their weight at birth ranged from 1,800 to 3,800 g, with three patients weighing less than 2,600 g. Of the 30 patients, 18 were intubated at birth. RESULTS: The MIS procedures were performed in 18 cases by a thoracoscopic approach and in 12 cases by a laparoscopic approach. No severe complication was observed. For 20 patients, reduction of the intrathoracic contents was achieved easily with 15 thoracoscopies and 5 laparoscopies. In six cases, the reduction was difficult, proving to be impossible for the four remaining patients: one treated with thoracoscopy and three with laparoscopy. The reasons for the inability to reduce the thoracic contents were difficulty of liver mobilization (1 left CDH and 2 right CDH) and the presence of a dilated stomach in the thorax. Reductions were easier for cases of wide diaphragmatic defects using thoracoscopy. There were 10 conversions (5 laparoscopies and 5 thoracoscopies). The reported reasons for conversion were inability to reduce (n = 4), need for a patch (n = 5), lack of adequate vision (n = 4), narrow working space (n = 1), associated bowel malrotation (n = 1), and an anesthetic problem (n = 1). Five defects were too large for direct closure and had to be closed with a patch. Four required conversion, with one performed through video-assisted thoracic surgery. The recurrences were detected after two primer thoracoscopic closures, one of which was managed by successful reoperation using thoracoscopy. CONCLUSIONS: In the neonatal period, CDH can be safely closed using MIS procedures. The overall success rate in this study was 67%. The indication for MIS is not related to weeks of gestational age, to weight at birth (if >2,600 g), or to the extent of the immediate neonatal care. Patients with no associated anomaly who are hemodynamically stabilized can benefit from MIS procedures. Reduction of the herniated organs is easier using thoracoscopy. Right CDH, liver lobe herniation, and the need for a patch closure are the most frequent reasons for conversion.

Evolving from inferences to decisions in the interpretation of scientific evidence

Le travail d'un(e) expert(e) en science forensique exige que ce dernier (cette dernière) prenne une série de décisions. Ces décisions sont difficiles parce qu'elles doivent être prises dans l'inévitable présence d'incertitude, dans le contexte unique des circonstances qui entourent la décision, et, parfois, parce qu'elles sont complexes suite à de nombreuse variables aléatoires et dépendantes les unes des autres. Etant donné que ces décisions peuvent aboutir à des conséquences sérieuses dans l'administration de la justice, la prise de décisions en science forensique devrait être soutenue par un cadre robuste qui fait des inférences en présence d'incertitudes et des décisions sur la base de ces inférences. L'objectif de cette thèse est de répondre à ce besoin en présentant un cadre théorique pour faire des choix rationnels dans des problèmes de décisions rencontrés par les experts dans un laboratoire de science forensique. L'inférence et la théorie de la décision bayésienne satisfont les conditions nécessaires pour un tel cadre théorique. Pour atteindre son objectif, cette thèse consiste de trois propositions, recommandant l'utilisation (1) de la théorie de la décision, (2) des réseaux bayésiens, et (3) des réseaux bayésiens de décision pour gérer des problèmes d'inférence et de décision forensiques. Les résultats présentent un cadre uniforme et cohérent pour faire des inférences et des décisions en science forensique qui utilise les concepts théoriques ci-dessus. Ils décrivent comment organiser chaque type de problème en le décomposant dans ses différents éléments, et comment trouver le meilleur plan d'action en faisant la distinction entre des problèmes de décision en une étape et des problèmes de décision en deux étapes et en y appliquant le principe de la maximisation de l'utilité espérée. Pour illustrer l'application de ce cadre à des problèmes rencontrés par les experts dans un laboratoire de science forensique, des études de cas théoriques appliquent la théorie de la décision, les réseaux bayésiens et les réseaux bayésiens de décision à une sélection de différents types de problèmes d'inférence et de décision impliquant différentes catégories de traces. Deux études du problème des deux traces illustrent comment la construction de réseaux bayésiens permet de gérer des problèmes d'inférence complexes, et ainsi surmonter l'obstacle de la complexité qui peut être présent dans des problèmes de décision. Trois études-une sur ce qu'il faut conclure d'une recherche dans une banque de données qui fournit exactement une correspondance, une sur quel génotype il faut rechercher dans une banque de données sur la base des observations faites sur des résultats de profilage d'ADN, et une sur s'il faut soumettre une trace digitale à un processus qui compare la trace avec des empreintes de sources potentielles-expliquent l'application de la théorie de la décision et des réseaux bayésiens de décision à chacune de ces décisions. Les résultats des études des cas théoriques soutiennent les trois propositions avancées dans cette thèse. Ainsi, cette thèse présente un cadre uniforme pour organiser et trouver le plan d'action le plus rationnel dans des problèmes de décisions rencontrés par les experts dans un laboratoire de science forensique. Le cadre proposé est un outil interactif et exploratoire qui permet de mieux comprendre un problème de décision afin que cette compréhension puisse aboutir à des choix qui sont mieux informés. - Forensic science casework involves making a sériés of choices. The difficulty in making these choices lies in the inévitable presence of uncertainty, the unique context of circumstances surrounding each décision and, in some cases, the complexity due to numerous, interrelated random variables. Given that these décisions can lead to serious conséquences in the admin-istration of justice, forensic décision making should be supported by a robust framework that makes inferences under uncertainty and décisions based on these inferences. The objective of this thesis is to respond to this need by presenting a framework for making rational choices in décision problems encountered by scientists in forensic science laboratories. Bayesian inference and décision theory meets the requirements for such a framework. To attain its objective, this thesis consists of three propositions, advocating the use of (1) décision theory, (2) Bayesian networks, and (3) influence diagrams for handling forensic inference and décision problems. The results present a uniform and coherent framework for making inferences and décisions in forensic science using the above theoretical concepts. They describe how to organize each type of problem by breaking it down into its différent elements, and how to find the most rational course of action by distinguishing between one-stage and two-stage décision problems and applying the principle of expected utility maximization. To illustrate the framework's application to the problems encountered by scientists in forensic science laboratories, theoretical case studies apply décision theory, Bayesian net-works and influence diagrams to a selection of différent types of inference and décision problems dealing with différent catégories of trace evidence. Two studies of the two-trace problem illustrate how the construction of Bayesian networks can handle complex inference problems, and thus overcome the hurdle of complexity that can be present in décision prob-lems. Three studies-one on what to conclude when a database search provides exactly one hit, one on what genotype to search for in a database based on the observations made on DNA typing results, and one on whether to submit a fingermark to the process of comparing it with prints of its potential sources-explain the application of décision theory and influ¬ence diagrams to each of these décisions. The results of the theoretical case studies support the thesis's three propositions. Hence, this thesis présents a uniform framework for organizing and finding the most rational course of action in décision problems encountered by scientists in forensic science laboratories. The proposed framework is an interactive and exploratory tool for better understanding a décision problem so that this understanding may lead to better informed choices.

ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

Injuries Resulted From Breastfeeding: A New Approach To A Known Problem

This study aimed at analyzing nipple trauma resulted from breastfeeding based on dermatological approach. Two integrative reviews of literature were conducted, the first related to definitions, classification and evaluation methods of nipple trauma and another about validation studies related to this theme. In the first part were included 20 studies and only one third defined nipple trauma, more than half did not defined the nipple’s injuries reported, and each author showed a particular way to assess the injuries, without consensus. In the second integrative review, no validation study or algorithm related to nipple trauma resulted from breastfeeding was found. This fact demonstrated that the nipple’s injuries mentioned in the first review did not go through validation studies, justifying the lack of consensus identified as far as definition, classification and assessment methods of nipple trauma.


Gestão Documental: Gestão de Processos de Aposentação usando a Plataforma IBM FileNet na Direcção Geral de Administração Pública

Ainda, nos nossos dias, o papel como sendo base de suporte das informações, é o maior problema operacional na maioria das empresas, órgãos governamentais e instituições. A administração pública cabo-verdiana lida anualmente com um grande volume de documentos e, a dificuldade de se lidar cada vez mais com os documentos produzidos é crescente. Daí, a necessidade de estabelecer princípios de racionalidade administrativa, a partir da intervenção nas etapas do ciclo de produção, utilização, conservação e destinação dos documentos de arquivo - a Gestão Documental. Com a evolução das Tecnologias da Informação e Comunicação (TIC) é contínua, igualmente a gestão da informação precisa adaptar-se a cada nova onda de mudança. A utilização de sistemas de gestão de conteúdos e de processos constituem ferramentas indispensáveis para o desenvolvimento de modernos sistemas de informação, agilizando assim os processos críticos nas instituições, de forma a optimizar o binómio produtividade - qualidade. Este trabalho faz referência à utilização da IBM FileNet, para modelação do processo de pedido de aposentação na Administração Pública. Ficou comprovado que o sistema de gestão de Workflow - Bussiness Process Management (BPM) da IBM, é capaz de automatizar o procedimento dos processos, gerir a sequência de actividades de trabalho e chamar (ou invocar) os recursos humanos e electrónicos apropriados, associados aos vários passos de actividades numa instituição. As evidências da plataforma FileNet como solução de Gestão de Conteúdos, e Gestão de Processos na nossa Administração Pública, demonstram vantagens consideráveis em todos os níveis. Para além de dinamizar e automatizar os processos críticos, o FileNet BPM pode permitir a optimização das operações e melhorar a capacidade de tomar decisões rápidas e acertadas, capacitando a instituição, para tomar decisões atempadas, baseadas na mais rigorosa informação disponível.

Approaches and Strategies to Improve Writing Skills

I believe and, I hope others believe that writing well is not only a personal accomplishment but also a valuable form of social participation and leadership. After reviewing the literature, this work tries to identify the problem and to identify the key issues to EFL writing so as to suggest a remedial procedure that may help the learners to express themselves better in English. It aims at finding areas of difficulty in the writing skill among the students and to work out remedial procedures to help them overcome their weakness. A survey carried out on 12th grade students, regarding their comprehension, shows that organizing idea on paper is one of the factors which influences their ability to write. It also shows that students feel the need to be instructed on strategies of writing success and consequently improving their writing. There are a lot systematic approaches and methods for discerning which skills and type of writing teacher should focus on and meaningful classroom activities and strategies that teacher can use to help students improving their writing.

Lack of Discipline in Cape Verdean Secondary Schools: The Need to Better Define the Problem and Develop Strategies to Prevent or Manage the Situation

This research paper has been written with the intention to discuss the problem of discipline in Cape Verdean secondary schools. While many of us discuss the effects that student misbehavior has on the student misbehavior has on the student, school and society as a whole, very few of us seek solutions which would impact on the prevention and management of this problem that each day becomes more complicated and harder to handle. This paper will discuss the need to better define discipline at the school level; identify the causes and factors that aggravate the problem, in addition, to provide what I hope to be useful strategies to better manage the problem as we make the effort to reclaim our schools and better educate our students. My research included surveys completed by teachers and student alike as they baffled over the question: what is discipline and how can we better manage discipline problems at our schools?

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

A mathematical excursion: From the three-door problem to a Cantor-type perfect set

We start with a generalization of the well-known three-door problem:the n-door problem. The solution of this new problem leads us toa beautiful representation system for real numbers in (0,1] as alternated series, known in the literature as Pierce expansions. A closer look to Pierce expansions will take us to some metrical properties of sets defined through the Pierce expansions of its elements. Finally, these metrical properties will enable us to present 'strange' sets, similar to the classical Cantor set.