Risk factors of postictal generalized EEG suppression in generalized convulsive seizures.

OBJECTIVE: To identify the clinical determinants of occurrence of postictal generalized EEG suppression (PGES) after generalized convulsive seizures (GCS). METHODS: We reviewed the video-EEG recordings of 417 patients included in the REPO2MSE study, a multicenter prospective cohort study of patients with drug-resistant focal epilepsy. According to ictal semiology, we classified GCS into 3 types: tonic-clonic GCS with bilateral and symmetric tonic arm extension (type 1), clonic GCS without tonic arm extension or flexion (type 2), and GCS with unilateral or asymmetric tonic arm extension or flexion (type 3). Association between PGES and person-specific or seizure-specific variables was analyzed after correction for individual effects and the varying number of seizures. RESULTS: A total of 99 GCS in 69 patients were included. Occurrence of PGES was independently associated with GCS type (p < 0.001) and lack of early administration of oxygen (p < 0.001). Odds ratio (OR) for GCS type 1 in comparison with GCS type 2 was 66.0 (95% confidence interval [CI 5.4-801.6]). In GCS type 1, risk of PGES was significantly increased when the seizure occurred during sleep (OR 5.0, 95% CI 1.2-20.9) and when oxygen was not administered early (OR 13.4, 95% CI 3.2-55.9). CONCLUSION: The risk of PGES dramatically varied as a function of GCS semiologic characteristics. Whatever the type of GCS, occurrence of PGES was prevented by early administration of oxygen.

Conflicting claims problem associated with cost sharing of a network

A minimum cost spanning tree (mcst) problem analyzes the way to efficiently connect individuals to a source when they are located at different places. Once the efficient tree is obtained, the question on how allocating the total cost among the involved agents defines, in a natural way, a confliicting claims situation. For instance, we may consider the endowment as the total cost of the network, whereas for each individual her claim is the maximum amount she will be allocated, that is, her connection cost to the source. Obviously, we have a confliicting claims problem, so we can apply claims rules in order to obtain an allocation of the total cost. Nevertheless, the allocation obtained by using claims rules might not satisfy some appealing properties (in particular, it does not belong to the core of the associated cooperative game). We will define other natural claims problems that appear if we analyze the maximum and minimum amount that an individual should pay in order to support the minimum cost tree. Keywords: Minimum cost spanning tree problem, Claims problem, Core JEL classification: C71, D63, D71.

Geographic assignment of seabirds to their origin: combining morphology, genetics and biogeochemical analyses

Longline fisheries, oil spills, and offshore wind farms are some of the major threats increasing seabird mortality at sea, but the impact of these threats on specific populations has been difficult to determine so far. We tested the use of molecular markers, morphometric measures, and stable isotope (δ15N and δ13C) and trace element concentrations in the first primary feather (grown at the end of the breeding period) to assign the geographic origin of Calonectris shearwaters. Overall, we sampled birds from three taxa: 13 Mediterranean Cory's Shearwater (Calonectris diomedea diomedea) breeding sites, 10 Atlantic Cory's Shearwater (Calonectris diomedea borealis) breeding sites, and one Cape Verde Shearwater (C. edwardsii) breeding site. Assignment rates were investigated at three spatial scales: breeding colony, breeding archipelago, and taxa levels. Genetic analyses based on the mitochondrial control region (198 birds from 21 breeding colonies) correctly assigned 100% of birds to the three main taxa but failed in detecting geographic structuring at lower scales. Discriminant analyses based on trace elements composition achieved the best rate of correct assignment to colony (77.5%). Body measurements or stable isotopes mainly succeeded in assigning individuals among taxa (87.9% and 89.9%, respectively) but failed at the colony level (27.1% and 38.0%, respectively). Combining all three approaches (morphometrics, isotopes, and trace elements on 186 birds from 15 breeding colonies) substantially improved correct classifications (86.0%, 90.7%, and 100% among colonies, archipelagos, and taxa, respectively). Validations using two independent data sets and jackknife cross-validation confirmed the robustness of the combined approach in the colony assignment (62.5%, 58.8%, and 69.8% for each validation test, respectively). A preliminary application of the discriminant model based on stable isotope δ15N and δ13C values and trace elements (219 birds from 17 breeding sites) showed that 41 Cory's Shearwaters caught by western Mediterranean long-liners came mainly from breeding colonies in Menorca (48.8%), Ibiza (14.6%), and Crete (31.7%). Our findings show that combining analyses of trace elements and stable isotopes on feathers can achieve high rates of correct geographic assignment of birds in the marine environment, opening new prospects for the study of seabird mortality at sea.

Separação de espectros simulados e de luminescência total através do método generalizado de anulação do posto (GRAM)

A multivariate curve resolution method, "GENERALIZED RANK ANNIHILATION METHOD (GRAM)", is discussed and tested with simulated and experimental data. The analysis of simulated data provides general guidelines concerning the condition for uniqueness of a solution for a given problem. The second-order emission-excitation spectra of human and animal dental calculus deposits were used as an experimental data to estimate the performance of the above method. Three porphyrinic spectral profiles, for both human and cat, were obtained by the use of GRAM.

Lautakuntien toiminnan arviointi Case: Lappeenrannan kaupunki

Pro gradu- tutkielma tehdään Lappeenrannan kaupungin tarkastuslautakunnan toimeksiannosta. Tutkimuksen kohteena on Lappeenrannan kaupungin neljä lautakuntaa. Tutkimuksen tarkoituksena on arvioida näiden lautakuntien toimintaa. Tutkimuksessa selvitetään, tekevätkö lautakunnat sitä työtä mitä niiden tulisi tehdä ja mitä niiden odotetaan tekevän. Varsinainen tutkimusongelma on: kuinka hyvin lautakunnan ja virkamiesjohdon väliset odotukset lautakuntien toiminnasta kohtaavat? Kyseessä on kvalitatiivinen casetutkimus. Haastatteluissa käytetään tutkimusmenetelmänä teemahaastattelua ja lautakuntien jäsenille tehdään kirjallinen kysely puolistrukturoidun kyselyn muodossa. Aineisto analysoidaan teemoittelemalla. Tutkimuksen johtopäätöksenä esitetään, että virkamiesjohdon, lautakuntien puheenjohtajien ja lautakunnan odotukset lautakuntien toimintaa kohtaan eivät aina kohtaa. Lautakunnan puheenjohtaja ja toimialajohtaja voivat olla odotuksissaan hyvin samoilla linjoilla, mutta lautakunnan jäsenet voivatkin odottaa aivan eri asioita.

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.

Harjoitustöiden vertaisarviointi opetusvälineenä

Harjoitustöiden vertaisarvioinnissa opiskelijat tarkastavat toistensa töitä ja antavat niistä palautteen annettujen ohjeiden mukaan. Yleensä opiskelijoille annetaan tätä tehtävää tukemaan tietty joukko arviointikriteereitä, joiden osalta työtä ainakin on kommentoitava. Vertaisarviointi voi antaa opiskelijoille monipuolisempaa palautetta kuin ilman sitä olisi mahdollista, mahdollisuuden tehtävien vaihtoehtoisiin ratkaisuihin tutustumiseen sekä kokemusta ongelmanratkaisun analyyttisestä ja kriittisestä tarkastelusta. Lisäksi vertaisarviointi voi tukea opettajien työtä helpottamalla riittävän palautteen antamista opiskelijoille ja antamalla jonkinlaista kuvaa opiskelijoiden näkemyksistä tehtävän aihealueeseen liittyen. Tämän työn tavoitteena on selvittää, mitä mainituista vertaisarviointiin liitetyistä hyödyistä voidaan todellisuudessa saavuttaa ohjelmointipainotteisilla kursseilla. Ohjelmointikurssin opiskelijat arvioivat kurssiin kuuluvien harjoitustöiden yhteydessä toistensa ratkaisuja yhteen tehtävistä. Opiskelijoille suunnatulla kyselyllä pyritään kartoittamaan, kuinka hyvin vertaisarvioinnille asetetut tavoitteet toteutuvat. Kokemuksia opettajan näkökulmasta selvitetään haastattelujen avulla. Testauksen toteutuksessa käytetään verkkosovellusta, johon opiskelijat tallentavat omat työnsä, josta he lataavat itselleen määrätyt työt arvioitavaksi, johon he tallentavat arvionsa ja jonka kautta he lopulta saavat palautteen omasta työstään.

Knapsack sets for cryptography

The basic goal of this study is to extend old and propose new ways to generate knapsack sets suitable for use in public key cryptography. The knapsack problem and its cryptographic use are reviewed in the introductory chapter. Terminology is based on common cryptographic vocabulary. For example, solving the knapsack problem (which is here a subset sum problem) is termed decipherment. Chapter 1 also reviews the most famous knapsack cryptosystem, the Merkle Hellman system. It is based on a superincreasing knapsack and uses modular multiplication as a trapdoor transformation. The insecurity caused by these two properties exemplifies the two general categories of attacks against knapsack systems. These categories provide the motivation for Chapters 2 and 4. Chapter 2 discusses the density of a knapsack and the dangers of having a low density. Chapter 3 interrupts for a while the more abstract treatment by showing examples of small injective knapsacks and extrapolating conjectures on some characteristics of knapsacks of larger size, especially their density and number. The most common trapdoor technique, modular multiplication, is likely to cause insecurity, but as argued in Chapter 4, it is difficult to find any other simple trapdoor techniques. This discussion also provides a basis for the introduction of various categories of non injectivity in Chapter 5. Besides general ideas of non injectivity of knapsack systems, Chapter 5 introduces and evaluates several ways to construct such systems, most notably the "exceptional blocks" in superincreasing knapsacks and the usage of "too small" a modulus in the modular multiplication as a trapdoor technique. The author believes that non injectivity is the most promising direction for development of knapsack cryptosystema. Chapter 6 modifies two well known knapsack schemes, the Merkle Hellman multiplicative trapdoor knapsack and the Graham Shamir knapsack. The main interest is in aspects other than non injectivity, although that is also exploited. In the end of the chapter, constructions proposed by Desmedt et. al. are presented to serve as a comparison for the developments of the subsequent three chapters. Chapter 7 provides a general framework for the iterative construction of injective knapsacks from smaller knapsacks, together with a simple example, the "three elements" system. In Chapters 8 and 9 the general framework is put into practice in two different ways. Modularly injective small knapsacks are used in Chapter 9 to construct a large knapsack, which is called the congruential knapsack. The addends of a subset sum can be found by decrementing the sum iteratively by using each of the small knapsacks and their moduli in turn. The construction is also generalized to the non injective case, which can lead to especially good results in the density, without complicating the deciphering process too much. Chapter 9 presents three related ways to realize the general framework of Chapter 7. The main idea is to join iteratively small knapsacks, each element of which would satisfy the superincreasing condition. As a whole, none of these systems need become superincreasing, though the development of density is not better than that. The new knapsack systems are injective but they can be deciphered with the same searching method as the non injective knapsacks with the "exceptional blocks" in Chapter 5. The final Chapter 10 first reviews the Chor Rivest knapsack system, which has withstood all cryptanalytic attacks. A couple of modifications to the use of this system are presented in order to further increase the security or make the construction easier. The latter goal is attempted by reducing the size of the Chor Rivest knapsack embedded in the modified system. '

G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours

In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named "lighttours" since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a "tour" over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named "enhanced grooming" (G+). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named lambda-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an integer linear programming (ILP) model is proposed for the well-known multilayer problem: traffic grooming, routing and wavelength assignment The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of optical-electro-optical conversions used. Experiments show that G+ can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time

The Problem of Invasive Species in River Ecosystems

Invasive nonnative species are a major problem in river ecosystems, and have large ecological and economic costs. Few ecosystems can resist invasions. The species that tend to invade most readily are those that humans. Introduce the most, and the ecosystems they invade are those with the most human activity. Most invasions are irreversible, and control is expensive, so efforts should be focused on prevention of future invasions

Random walk radiosity with generalized absorption probabilities

The author studies random walk estimators for radiosity with generalized absorption probabilities. That is, a path will either die or survive on a patch according to an arbitrary probability. The estimators studied so far, the infinite path length estimator and finite path length one, can be considered as particular cases. Practical applications of the random walks with generalized probabilities are given. A necessary and sufficient condition for the existence of the variance is given, together with heuristics to be used in practical cases. The optimal probabilities are also found for the case when one is interested in the whole scene, and are equal to the reflectivities

Families of periodic horseshoe orbits in the restricted three-body problem

We compute families of symmetric periodic horseshoe orbits in the restricted three-body problem. Both the planar and three-dimensional cases are considered and several families are found.We describe how these families are organized as well as the behavior along and among the families of parameters such as the Jacobi constant or the eccentricity. We also determine the stability properties of individual orbits along the families. Interestingly, we find stable horseshoe-shaped orbit up to the quite high inclination of 17◦