Hemoptysis caused by pulmonary arterial aneurysm, disclosing Beh?et disease. Apropos of 2 cases]

MCF7 and ZR75-1 breast cancer cells grow as adherent monolayers in tissue culture. Treatment with the serum serine protease plasmin causes them to detach and to grow as floating multicellular spheroids. Two plasmin activators, urokinase plasminogen activator and streptokinase, induce the same growth pattern changes in the presence of plasminogen. Serum contains also plasminogen activator inhibitors. Aged serum, deficient in plasminogen activator inhibitors, converts spontaneously monolayer breast cancer cells into multicellular spheroids which readily revert to monolayer growth after addition of fresh serum. Urokinase blocks the reversion. The formation of multicellular spheroids does not affect the proliferative rate of breast tumor cells but endows tumor cells with increased resistance to the chemotherapeutic drugs, doxorubicin and paclitaxel.     

Analytic computation of the photocurrent density in a n-6H-SiC/p-Si/n-Si/p-Si0.8Ge0.2 multilayer solar cell

In this work we conceived a model of a multilayer solar cell composed by four layers of opposite conductivities: an n-type 6H-SiC used as a frontal layer to absorb high energy photons (energy gap equals 2.9 eV), a p-type Si layer, an n-type Si layer and a p-type SiGe back layer to absorb low energy photons (Si_0.8Ge_0.2 with an energy gap equal to 0.8 eV). The impurity concentration in every layer of the model is taken equal to 10¹⁷ cm⁻³ to ensure abrupt junctions inside the cell. The optical properties of the separate layers have been fitted and tabulated to be used for thin films devices numerical simulation. We developed the equations giving the minority carrier concentration and the photocurrent density in each abscissa of the model. We used Matlab software to simulate and optimize the layers thicknesses to achieve the maximum photocurrent generated under AM0 solar spectrum. The results of simulation showed that the optimized structure could deliver, assuming 10⁵ cm/s surface recombination velocity, a photocurrent density of more than 53 mA/cm², which represents 88.3% of the ideal photocurrent (59.99 mA/cm²) that can be generated under AM0 solar spectrum.     

PGRP-LB: An Inside View into the Mechanism of the Amidase Reaction

Peptidoglycan recognition proteins (PGRPs) are ubiquitous among animals and play pivotal functions in insect immunity. Non-catalytic PGRPs are involved in the activation of immune pathways by binding to the peptidoglycan (PGN), whereas amidase PGRPs are capable of cleaving the PGN into non-immunogenic compounds. Drosophila PGRP-LB belongs to the amidase PGRPs and downregulates the immune deficiency (IMD) pathway by cleaving meso-2,6-diaminopimelic (meso-DAP or DAP)-type PGN. While the recognition process is well analyzed for the non-catalytic PGRPs, little is known about the enzymatic mechanism for the amidase PGRPs, despite their essential function in immune homeostasis. Here, we analyzed the specific activity of different isoforms of Drosophila PGRP-LB towards various PGN substrates to understand their specificity and role in Drosophila immunity. We show that these isoforms have similar activity towards the different compounds. To analyze the mechanism of the amidase activity, we performed site directed mutagenesis and solved the X-ray structures of wild-type Drosophila PGRP-LB and its mutants, with one of these structures presenting a protein complexed with the tracheal cytotoxin (TCT), a muropeptide derived from the PGN. Only the Y78F mutation abolished the PGN cleavage while other mutations reduced the activity solely. Together, our findings suggest the dynamic role of the residue Y78 in the amidase mechanism by nucleophilic attack through a water molecule to the carbonyl group of the amide function destabilized by Zn²⁺.     

The Impact of Metastable Intermolrecular Nanocomposite Particles on Kinetic Decomposition of Heterocyclic Nitramines Using Advanced Solid‐Phase Decomposition Models

Journal of Inorganic and Organometallic Polymers and Materials - Surface oxygen of oxide catalyst has low coordination number; they are negatively charged. Surface oxygen can act active site for...     

A frame-based approach for capturing semantics from Arabic text for text-to-sign language MT

This paper describes the design and implementation of a computational model for Arabic natural language semantics, a semantic parser for capturing the deep semantic representation of Arabic text. The parser represents a major part of an Interlingua-based machine translation system for translating Arabic text into Sign Language. The parser follows a frame-based analysis to capture the overall meaning of Arabic text into a formal representation suitable for NLP applications that need for deep semantics representation, such as language generation and machine translation. We will show the representational power of this theory for the semantic analysis of texts in Arabic, a language which differs substantially from English in several ways. We will also show that the integration of WordNet and FrameNet in a single unified knowledge resource can improve disambiguation accuracy. Furthermore, we will propose a rule based algorithm to generate an equivalent Arabic FrameNet, using a lexical resource alignment of FrameNet1.3 LUs and WordNet3.0 synsets for English Language. A pilot study of motion and location verbs was carried out in order to test our system. Our corpus is made up of more than 2000 Arabic sentences in the domain of motion events collected from Algerian first level educational Arabic books and other relevant Arabic corpora.     

A large vocabulary system for Arabic online handwriting recognition

The success of using Hidden Markov Models (HMMs) for speech recognition application has motivated the adoption of these models for handwriting recognition especially the online handwriting that has large similarity with the speech signal as a sequential process. Some languages such as Arabic, Farsi and Urdo include large number of delayed strokes that are written above or below most letters and usually written delayed in time. These delayed strokes represent a modeling challenge for the conventional left-right HMM that is commonly used for Automatic Speech Recognition (ASR) systems. In this paper, we introduce a new approach for handling delayed strokes in Arabic online handwriting recognition using HMMs. We also show that several modeling approaches such as context based tri-grapheme models, speaker adaptive training and discriminative training that are currently used in most state-of-the-art ASR systems can provide similar performance improvement for Hand Writing Recognition (HWR) systems. Finally, we show that using a multi-pass decoder that use the computationally less expensive models in the early passes can provide an Arabic large vocabulary HWR system with practical decoding time. We evaluated the performance of our proposed Arabic HWR system using two databases of small and large lexicons. For the small lexicon data set, our system achieved competing results compared to the best reported state-of-the-art Arabic HWR systems. For the large lexicon, our system achieved promising results (accuracy and time) for a vocabulary size of 64k words with the possibility of adapting the models for specific writers to get even better results.     

Adaptive type-2 fuzzy sliding mode controller for SISO nonlinear systems subject to actuator faults

In this paper, an adaptive type-2 fuzzy sliding mode control to tolerate actuator faults of unknown nonlinear systems with external disturbances is presented. Based on a redundant actuation structure, a novel type-2 adaptive fuzzy fault tolerant control scheme is proposed using sliding mode control. Two adaptive type-2 fuzzy logic systems are used to approximate the unknown functions, whose adaptation laws are deduced from the stability analysis. The proposed approach allows to ensure good tracking performance despite the presence of actuator failures and external disturbances, as illustrated through a simulation example.     

Adaptive fuzzy sliding mode power system stabilizer using Nussbaum gain

Power system stability is enhanced through a novel stabilizer developed around an adaptive fuzzy sliding mode approach which applies the Nussbaum gain to a nonlinear model of a single-machine infinite-bus （SMIB） and multi-machine power system stabilizer subjected to a three phase fault. The Nussbaum gain is used to avoid the positive sign constraint and the problem of controllability of the system. A comparative simulation study is presented to evaluate the achieved performance.     

Optimal Packet Loss Protection of Progressively Compressed 3-D Meshes

We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D meshes over lossy packet networks. Given a transmission bit budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission bit budget is large. We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the compressed progressive meshes (CPM) mesh compression technique.     

A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop

In this paper we address a hybrid flow shop scheduling problem considering the minimization of the sum of the total earliness and tardiness penalties. This problem is proven to be NP-hard, and consequently the development of heuristic and meta-heuristic approaches to solve it is well justified. So, we propose an ant colony optimization method to deal with this problem. Our proposed method has several features, including some heuristics that specifically take into account both earliness and tardiness penalties to compute the heuristic information values. The performance of our algorithm is tested by numerical experiments on a large number of randomly generated problems. A comparison with solutions performance obtained by some constructive heuristics is presented. The results show that the proposed approach performs well for this problem.