Neuronal sodium-channel alpha 1-subunit mutations in generalized epilepsy with febrile seizures plus

Generalized epilepsy with febrile seizures plus (GEFS+) is a familial epilepsy syndrome characterized by the presence of febrile and afebrile seizures. The first gene, GEFS1, was mapped to chromosome 19q and was identified as the sodium-channel beta1-subunit, SCN1B. A second locus on chromosome 2q, GEFS2, was recently identified as the sodium-channel alpha1-subunit, SCN1A. Single-stranded conformation analysis (SSCA) of SCN1A was performed in 53 unrelated index cases to estimate the frequency of mutations in patients with GEFS+. No mutations were found in 17 isolated cases of GEFS+. Three novel SCN1A mutations-D188V, V1353L, and I1656M-were found in 36 familial cases; of the remaining 33 families, 3 had mutations in SCN1B. On the basis of SSCA, the combined frequency of SCN1A and SCN1B mutations in familial cases of GEFS+ was found to be 17%.

Cross-linking studies and membrane localization and assembly of radiolabelled large mechanosensitive ion channel (MscL) of Escherichia coli

The gene encoding the large conductance mechanosensitive ion channel (MscL) of Escherichia coli and several deletion mutants of mscL were cloned under the control of the T7 RNA polymerase promoter. Transformation of these constructs into an E. coli strain carrying an inducible T7 RNA polymerase gene allowed the specific production and labelling of MscL with [S-35]methionine. Preparation of membrane fractions of E. coli cells by sucrose gradient centrifugation indicated that the radiolabelled MscL was present in the inner cytoplasmic membrane in agreement with results of several studies. However, treatment of the labelled cells and cell membrane vesicles with various cross-linkers resulted in the majority of labelled protein migrating as a monomer with a small proportion of molecules (approximate to 25%) migrating as dimers and higher order multimers. This result is in contrast with a finding of a study suggesting that the channel exclusively forms hexamers in the cell membrane off. coli (1) and therefore may have profound implication for the activation and/or ''multimerization'' of the channel by mechanical stress exerted to the membrane. In addition, from the specific activity of the radiolabelled protein and the amount of protein in the cytoplasmic membrane fraction we estimated the number of MscL ion channels expressed under these conditions to be approximately 50 channels per single bacterium. (C) 1997 Academic Press.

A single beta subunit M2 domain residue controls the picrotoxin sensitivity of alpha beta heteromeric glycine receptor chloride channels

This study investigated the residues responsible for the reduced picrotoxin sensitivity of the alpha beta heteromeric glycine receptor relative to the alpha homomeric receptor. By analogy with structurally related receptors, the beta subunit M2 domain residues P278 and F282 were considered the most likely candidates for mediating this effect. These residues align with G254 and T258 of the alpha subunit. The T258A, T258C and T258F mutations dramatically reduced the picrotoxin sensitivity of the alpha homomeric receptor. Furthermore, the converse F282T mutation in the beta subunit increased the picrotoxin sensitivity of the alpha beta heteromeric receptor. The P278G mutation in the beta subunit did not affect the picrotoxin sensitivity of the alpha beta heteromer. Thus, a ring of five threonines at the M2 domain depth corresponding to alpha subunit T258 is specifically required for picrotoxin sensitivity. Mutations to alpha subunit T258 also profoundly influenced the apparent glycine affinity. A substituted cysteine accessibility analysis revealed that the T258C sidechain increases its pore exposure in the channel open state. This provides further evidence for an allosteric mechanism of picrotoxin inhibition, but renders it unlikely that picrotoxin las an allosterically acting 'competitive' antagonist) binds to this residue.

Efficient time-independent wave packet scattering calculations within a Lanczos subspace: H+O-2 (J=0) state-to-state reaction probabilities

An efficient Lanczos subspace method has been devised for calculating state-to-state reaction probabilities. The method recasts the time-independent wave packet Lippmann-Schwinger equation [Kouri , Chem. Phys. Lett. 203, 166 (1993)] inside a tridiagonal (Lanczos) representation in which action of the causal Green's operator is affected easily with a QR algorithm. The method is designed to yield all state-to-state reaction probabilities from a given reactant-channel wave packet using a single Lanczos subspace; the spectral properties of the tridiagonal Hamiltonian allow calculations to be undertaken at arbitrary energies within the spectral range of the initial wave packet. The method is applied to a H+O-2 system (J=0), and the results indicate the approach is accurate and stable. (C) 2002 American Institute of Physics.

New type of dual-channel PAM chlorophyll fluorometer for highly sensitive water toxicity biotests

A new type of dual-channel PAM chlorophyll fluorometer has been developed, which is specialised in the detection of extremely small differences in photosynthetic activity in algae or thylakoids suspensions. In conjunction with standardised algae cultures or isolated thylakoids, the new device provides an ultrasensitive biotest system for detection of toxic substances in water samples. In this report, major features of the new device are outlined and examples of its performance are presented using suspensions of Phaeodactylum tricornutum (diatoms) and of freeze-dried thylakoids of Lactuca sativa (salad). Investigated and reference samples are exposed to the same actinic intensity of pulse-modulated measuring light. The quantum yields are assessed by the saturation pulse method. Clock-triggered repetitive measurements of quantum yield typically display a standard deviation of 0.1%, corresponding to the inhibition induced by 0.02 mug diuron l(-1). Hence, for diuron or compounds with similar toxicity, the detection limit is well below the 0.1 mug l(-1) defined as the limit for the presence of a single toxic substance in water by the European Commission drinking water regulation. The amounts of water and biotest material required for analysis are very small, as a single assay involves two 1 ml samples, each containing ca. 0.5 mug chlorophyll. Both with Phaeodactylum and thylakoids the relationship between inhibition and diuron concentration is strictly linear up to 10% inhibition, with very similar slopes. Apparent inhibition depends on the actinic effect of the measuring light, showing optima at 6 and 4 mumol quanta m(-2) s(-1) with Phaeodactylum and thylakoids, respectively.

IOPT Petri Net State Space Generation Algorithm with Maximal-Step Execution Semantics

This paper presents an algorithm to efficiently generate the state-space of systems specified using the IOPT Petri-net modeling formalism. IOPT nets are a non-autonomous Petri-net class, based on Place-Transition nets with an extended set of features designed to allow the rapid prototyping and synthesis of system controllers through an existing hardware-software co-design framework. To obtain coherent and deterministic operation, IOPT nets use a maximal-step execution semantics where, in a single execution step, all enabled transitions will fire simultaneously. This fact increases the resulting state-space complexity and can cause an arc "explosion" effect. Real-world applications, with several million states, will reach a higher order of magnitude number of arcs, leading to the need for high performance state-space generator algorithms. The proposed algorithm applies a compilation approach to read a PNML file containing one IOPT model and automatically generate an optimized C program to calculate the corresponding state-space.

Ant colony system based approach to single machine scheduling problems: weighted tardiness scheduling problem

The paper introduces an approach to solve the problem of generating a sequence of jobs that minimizes the total weighted tardiness for a set of jobs to be processed in a single machine. An Ant Colony System based algorithm is validated with benchmark problems available in the OR library. The obtained results were compared with the best available results and were found to be nearer to the optimal. The obtained computational results allowed concluding on their efficiency and effectiveness.

Direct Color Sensor, Optical Amplifier and Demux Device Integrated on a Single Monolithic SiC Photodetector

A pi'n/pin a-SiC:H voltage and optical bias controlled device is presented and its behavior as image and color sensor, optical amplifier and demux device is discussed. The design and the light source properties are correlated with the sensor output characteristics. Different readout techniques are used. When a low power monochromatic scanner readout the generated carriers the transducer recognizes a color pattern projected on it acting as a direct color and image sensor. Scan speeds up to 10(4) lines per second are achieved without degradation in the resolution. If the photocurrent generated by different monochromatic pulsed channels is readout directly, the information is demultiplexed. Results show that it is possible to decode the information from three simultaneous color channels without bit errors at bit rates per channel higher than 4000 bps. Finally, when triggered by light of appropriated wavelength, it can amplify or suppress the generated photocurrent working as an optical amplifier (C) 2009 Published by Elsevier Ltd.

A preliminary idea for an 8-competitive, log2 DMAX + log2 log2 1/U asymptotic-space, interface generation algorithm for two-level hierarchical scheduling of constrained-deadline sporadic tasks on a uniprocessor

Consider a single processor and a software system. The software system comprises components and interfaces where each component has an associated interface and each component comprises a set of constrained-deadline sporadic tasks. A scheduling algorithm (called global scheduler) determines at each instant which component is active. The active component uses another scheduling algorithm (called local scheduler) to determine which task is selected for execution on the processor. The interface of a component makes certain information about a component visible to other components; the interfaces of all components are used for schedulability analysis. We address the problem of generating an interface for a component based on the tasks inside the component. We desire to (i) incur only a small loss in schedulability analysis due to the interface and (ii) ensure that the amount of space (counted in bits) of the interface is small; this is because such an interface hides as much details of the component as possible. We present an algorithm for generating such an interface.

Low-power 6-bit 1-GS/s two-channel pipeline ADC with open-loop amplification using amplifiers with local-feedback

IEEE International Symposium on Circuits and Systems, pp. 2258 – 2261, Seattle, EUA

Algorithm-oriented design of efficient many-core architectures applied to dense matrix multiplication

Recent integrated circuit technologies have opened the possibility to design parallel architectures with hundreds of cores on a single chip. The design space of these parallel architectures is huge with many architectural options. Exploring the design space gets even more difficult if, beyond performance and area, we also consider extra metrics like performance and area efficiency, where the designer tries to design the architecture with the best performance per chip area and the best sustainable performance. In this paper we present an algorithm-oriented approach to design a many-core architecture. Instead of doing the design space exploration of the many core architecture based on the experimental execution results of a particular benchmark of algorithms, our approach is to make a formal analysis of the algorithms considering the main architectural aspects and to determine how each particular architectural aspect is related to the performance of the architecture when running an algorithm or set of algorithms. The architectural aspects considered include the number of cores, the local memory available in each core, the communication bandwidth between the many-core architecture and the external memory and the memory hierarchy. To exemplify the approach we did a theoretical analysis of a dense matrix multiplication algorithm and determined an equation that relates the number of execution cycles with the architectural parameters. Based on this equation a many-core architecture has been designed. The results obtained indicate that a 100 mm(2) integrated circuit design of the proposed architecture, using a 65 nm technology, is able to achieve 464 GFLOPs (double precision floating-point) for a memory bandwidth of 16 GB/s. This corresponds to a performance efficiency of 71 %. Considering a 45 nm technology, a 100 mm(2) chip attains 833 GFLOPs which corresponds to 84 % of peak performance These figures are better than those obtained by previous many-core architectures, except for the area efficiency which is limited by the lower memory bandwidth considered. The results achieved are also better than those of previous state-of-the-art many-cores architectures designed specifically to achieve high performance for matrix multiplication.

Ultrasound velocity profile (UVP) measurements in shallow open-channel flows

1st European IAHR Congress, 6-4 May, Edinburgh, Scotland

A Random Access Protocol incorporating Multi-Packet Reception, Retransmission Diversity and Successive Interference Cancellation

8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.

Energy-efficient diversity combining for different access schemes in a multi-path dispersive channel

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e Computadores

An immunity based configuration for multilayer single featured biometric authentication algorithms

Immune systems have been used in the last years to inspire approaches for several computational problems. This paper focus on behavioural biometric authentication algorithms’ accuracy enhancement by using them more than once and with different thresholds in order to first simulate the protection provided by the skin and then look for known outside entities, like lymphocytes do. The paper describes the principles that support the application of this approach to Keystroke Dynamics, an authentication biometric technology that decides on the legitimacy of a user based on his typing pattern captured on he enters the username and/or the password and, as a proof of concept, the accuracy levels of one keystroke dynamics algorithm when applied to five legitimate users of a system both in the traditional and in the immune inspired approaches are calculated and the obtained results are compared.