A transgenic mouse model of hereditary motor and sensory neuropathy

Congenital Hypomyelination (CH) IS the most severe demyelinating form of Hereditary Motor and Sensory Neuropathies and manifests at birth in human. Some subtypes of CH are due to dominant mutations in the gene coding for PO glycoprotein, which functions as a homophilic adhesion protein, responsible for compaction of opposing myelin lamellae. By homologous recombination in ES cells, we have generated a mouse containing a nonsense mutation in the intracellular portion of PO (Q215X) that, in the heterozygous state, is associated with CH neuropathy in humans. This mutation is predicted to encode a truncated PO protein, lacking part of the cytoplasmic domain. Expression analysis demonstrated that Q215X heterozygous mice produce both wildtype PO and a smaller, truncated PO glycoprotein; furthermore, the levels of mRNA and protein produced by the mutated allele are less abundant, relative to the wildtype. We demonstrated then that this reduction in mRNA and protein levels could be paIiially explained by inefficient transcription of the mutated allele, due to the presence of a LoxP site with intron 5. Behavioral analysis of the Q215X1+ mice revealed reduced motor performance at 11 days after birth. Morphological analysis performed on sciatic nerves of mice between PI and P 14 revealed defects in the process of axonal sorting by Schwann cells, with the presence of bundles of mixed large and small calibre axons surrounded, but not ensheathed, by single Schwann cells. These morphogical defects are rescued after the second week of life: sciatic nerves from adult mice, in fact, show only mild hypomyelination, which is much less severe than the morphology reported in patients. From these preliminary data, we conclude that the Q215X mutation results in a truncated PO protein; since the phenotype of Q215X1+ mice and PO +1- mice differs, Q215X probably produces a gain of function. Finally, we studied in vivo the intracellular location of the truncated protein, in order to clarify aspects of the pathogenetic mechanism of the Q215X PO mutation: we found that the mutated protein is not properly trafficked within Schwann cells, being partially retained in the ER compartment. The phenotype we have observed in the mutant mice presents similarities to other hypomyelinating mice that carry mutations in different genes, that are all involved in the laminin pathway: this suggests that mutant PO may interfere with laminin signaling, required for the correct timing of axonal sorting by Schwann cells. Thus, from these data we conclude that the Q215X mouse is a partial model of Congenital Hypomyelination, less severely affected, if compared to human patients. This difference in disease severity could be partially explained by the inefficient transcription of the Q215X allele. Thus, we believe that the mechanism of this hypomyelination is likely to be related to the mechanism of the more severe neuropathy in human. This mouse will be useful to reveal the pathogenesis of the mutation

Medical Image Set Compression Using Wavelet and Lifting Combined With New Scanning Techniques.

Today, hospitals are desirous of better methods for replacing their traditional film-based medical imaging. A major problem associated with a film-less hospital is the amount of digital image data that is generated and stored. Image compression must be used to reduce the storage size. This dissertation presents several techniques involving wavelet analysis, lifting, image prediction and image scanning to achieve an efficient diagnostically lossless compression for sets of medical images. This dissertation experimentally determines the optimal wavelet basis for medical images. Then, presents a new wavelet based prediction method for prediction of the intermediate images in a similar set of medical images. The technique uses the correlation between coefficients in the wavelet transforms of the image set to produce a better image prediction compared to direct image prediction. New methods for scanning similar sets of medical images are introduced in this dissertation. These methods significantly reduce the image edges needed for compression with wavelet lifting. Lifting plus new scanning methods have the following advantages: (a) images in the set do not have to be the same size, (b) additional compression is obtained from the continuous image background, and (c) lifting produces better compression. The scanning techniques, introduced in this dissertation, reduce the number of edges. These scanning techniques separate the diagnostic foreground from the continuous background of each image in the set. A theoretical approach for determining an optimal orthogonal wavelet basis with compact support is presented and then demonstrated on medical images. Orthogonal wavelet bases were constructed with this theoretical approach and then another algorithm was used to determine the optimal wavelet basis for each medical image set. One result of this research is that the new image scanning techniques plus lifting and standard compression methods resulted in improved and better compression of medical image sets than achieved by the standard compression alone

Future benefits and applications of intelligent on-board processing to VSAT services

The trends and roles of VSAT services in the year 2010 time frame are examined based on an overall network and service model for that period. An estimate of the VSAT traffic is then made and the service and general network requirements are identified. In order to accommodate these traffic needs, four satellite VSAT architectures based on the use of fixed or scanning multibeam antennas in conjunction with IF switching or onboard regeneration and baseband processing are suggested. The performance of each of these architectures is assessed and the key enabling technologies are identified

Novel channel sensing and access strategies in opportunistic spectrum access networks

textTraditionally radio spectrum was considered a commodity to be allocated in a fixed and centralized manner, but now the technical community and the regulators approach it as a shared resource that can be flexibly and intelligently shared between competing entities. In this thesis we focus on novel strategies to sense and access the radio spectrum within the framework of Opportunistic Spectrum Access via Cognitive Radio Networks (CRNs). In the first part we develop novel transmit opportunity detection methods that effectively exploit the gray space present in packet based networks. Our methods proactively detect the maximum safe transmit power that does not significantly affect the primary network nodes via an implicit feedback mechanism from the Primary network to the Secondary network. A novel use of packet interarrival duration is developed to robustly perform change detection in the primary network's Quality of Service. The methods are validated on real world IEEE 802.11 WLANs. In the second part we study the inferential use of Goodness-of-Fit tests for spectrum sensing applications. We provide the first comprehensive framework for decision fusion of an ensemble of goodness-of-fit tests through use of p-values. Also, we introduce a generalized Phi-divergence statistic to formulate goodness-of-fit tests that are tunable via a single parameter. We show that under uncertainty in the noise statistics or non-Gaussianity in the noise, the performance of such non-parametric tests is significantly superior to that of conventional spectrum sensing methods. Additionally, we describe a collaborative spatially separated version of the test for robust combining of tests in a distributed spectrum sensing setting. In the third part we develop the sequential energy detection problem for spectrum sensing and formulate a novel Sequential Energy Detector. Through extensive simulations we demonstrate that our doubly hierarchical sequential testing architecture delivers a significant throughput improvement of 2 to 6 times over the fixed sample size test while maintaining equivalent operating characteristics as measured by the Probabilities of Detection and False Alarm. We also demonstrate the throughput gains for a case study of sensing ATSC television signals in IEEE 802.22 systems.Electrical and Computer Engineerin

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters

Thematic mapper flight model preshipment review data package. Volume 3, part C: System data

Failure reports for flight model-1 of the thematic mapper are summarized showing the symptom and cause of failure as well as the corrective action taken. Each report is keyed to the major subsystem against which the failure occurred. Requests for deviation/waiver are listed by number, description, and current status. Copies of engineering proposals are included

High efficiency block coding techniques for image data.

by Lo Kwok-tung.Thesis (Ph.D.)--Chinese University of Hong Kong, 1992.Includes bibliographical references.ABSTRACT --- p.iACKNOWLEDGEMENTS --- p.iiiLIST OF PRINCIPLE SYMBOLS AND ABBREVIATIONS --- p.ivLIST OF FIGURES --- p.viiLIST OF TABLES --- p.ixTABLE OF CONTENTS --- p.xChapter CHAPTER 1 --- IntroductionChapter 1.1 --- Background - The Need for Image Compression --- p.1-1Chapter 1.2 --- Image Compression - An Overview --- p.1-2Chapter 1.2.1 --- Predictive Coding - DPCM --- p.1-3Chapter 1.2.2 --- Sub-band Coding --- p.1-5Chapter 1.2.3 --- Transform Coding --- p.1-6Chapter 1.2.4 --- Vector Quantization --- p.1-8Chapter 1.2.5 --- Block Truncation Coding --- p.1-10Chapter 1.3 --- Block Based Image Coding Techniques --- p.1-11Chapter 1.4 --- Goal of the Work --- p.1-13Chapter 1.5 --- Organization of the Thesis --- p.1-14Chapter CHAPTER 2 --- Block-Based Image Coding TechniquesChapter 2.1 --- Statistical Model of Image --- p.2-1Chapter 2.1.1 --- One-Dimensional Model --- p.2-1Chapter 2.1.2 --- Two-Dimensional Model --- p.2-2Chapter 2.2 --- Image Fidelity Criteria --- p.2-3Chapter 2.2.1 --- Objective Fidelity --- p.2-3Chapter 2.2.2 --- Subjective Fidelity --- p.2-5Chapter 2.3 --- Transform Coding Theroy --- p.2-6Chapter 2.3.1 --- Transformation --- p.2-6Chapter 2.3.2 --- Quantization --- p.2-10Chapter 2.3.3 --- Coding --- p.2-12Chapter 2.3.4 --- JPEG International Standard --- p.2-14Chapter 2.4 --- Vector Quantization Theory --- p.2-18Chapter 2.4.1 --- Codebook Design and the LBG Clustering Algorithm --- p.2-20Chapter 2.5 --- Block Truncation Coding Theory --- p.2-22Chapter 2.5.1 --- Optimal MSE Block Truncation Coding --- p.2-24Chapter CHAPTER 3 --- Development of New Orthogonal TransformsChapter 3.1 --- Introduction --- p.3-1Chapter 3.2 --- Weighted Cosine Transform --- p.3-4Chapter 3.2.1 --- Development of the WCT --- p.3-6Chapter 3.2.2 --- Determination of a and β --- p.3-9Chapter 3.3 --- Simplified Cosine Transform --- p.3-10Chapter 3.3.1 --- Development of the SCT --- p.3-11Chapter 3.4 --- Fast Computational Algorithms --- p.3-14Chapter 3.4.1 --- Weighted Cosine Transform --- p.3-14Chapter 3.4.2 --- Simplified Cosine Transform --- p.3-18Chapter 3.4.3 --- Computational Requirement --- p.3-19Chapter 3.5 --- Performance Evaluation --- p.3-21Chapter 3.5.1 --- Evaluation using Statistical Model --- p.3-21Chapter 3.5.2 --- Evaluation using Real Images --- p.3-28Chapter 3.6 --- Concluding Remarks --- p.3-31Chapter 3.7 --- Note on Publications --- p.3-32Chapter CHAPTER 4 --- Pruning in Transform Coding of ImagesChapter 4.1 --- Introduction --- p.4-1Chapter 4.2 --- "Direct Fast Algorithms for DCT, WCT and SCT" --- p.4-3Chapter 4.2.1 --- Discrete Cosine Transform --- p.4-3Chapter 4.2.2 --- Weighted Cosine Transform --- p.4-7Chapter 4.2.3 --- Simplified Cosine Transform --- p.4-9Chapter 4.3 --- Pruning in Direct Fast Algorithms --- p.4-10Chapter 4.3.1 --- Discrete Cosine Transform --- p.4-10Chapter 4.3.2 --- Weighted Cosine Transform --- p.4-13Chapter 4.3.3 --- Simplified Cosine Transform --- p.4-15Chapter 4.4 --- Operations Saved by Using Pruning --- p.4-17Chapter 4.4.1 --- Discrete Cosine Transform --- p.4-17Chapter 4.4.2 --- Weighted Cosine Transform --- p.4-21Chapter 4.4.3 --- Simplified Cosine Transform --- p.4-23Chapter 4.4.4 --- Generalization Pruning Algorithm for DCT --- p.4-25Chapter 4.5 --- Concluding Remarks --- p.4-26Chapter 4.6 --- Note on Publications --- p.4-27Chapter CHAPTER 5 --- Efficient Encoding of DC Coefficient in Transform Coding SystemsChapter 5.1 --- Introduction --- p.5-1Chapter 5.2 --- Minimum Edge Difference (MED) Predictor --- p.5-3Chapter 5.3 --- Performance Evaluation --- p.5-6Chapter 5.4 --- Simulation Results --- p.5-9Chapter 5.5 --- Concluding Remarks --- p.5-14Chapter 5.6 --- Note on Publications --- p.5-14Chapter CHAPTER 6 --- Efficient Encoding Algorithms for Vector Quantization of ImagesChapter 6.1 --- Introduction --- p.6-1Chapter 6.2 --- Sub-Codebook Searching Algorithm (SCS) --- p.6-4Chapter 6.2.1 --- Formation of the Sub-codebook --- p.6-6Chapter 6.2.2 --- Premature Exit Conditions in the Searching Process --- p.6-8Chapter 6.2.3 --- Sub-Codebook Searching Algorithm --- p.6-11Chapter 6.3 --- Predictive Sub-Codebook Searching Algorithm (PSCS) --- p.6-13Chapter 6.4 --- Simulation Results --- p.6-17Chapter 6.5 --- Concluding Remarks --- p.5-20Chapter 6.6 --- Note on Publications --- p.6-21Chapter CHAPTER 7 --- Predictive Classified Address Vector Quantization of ImagesChapter 7.1 --- Introduction --- p.7-1Chapter 7.2 --- Optimal Three-Level Block Truncation Coding --- p.7-3Chapter 7.3 --- Predictive Classified Address Vector Quantization --- p.7-5Chapter 7.3.1 --- Classification of Images using Three-level BTC --- p.7-6Chapter 7.3.2 --- Predictive Mean Removal Technique --- p.7-8Chapter 7.3.3 --- Simplified Address VQ Technique --- p.7-9Chapter 7.3.4 --- Encoding Process of PCAVQ --- p.7-13Chapter 7.4 --- Simulation Results --- p.7-14Chapter 7.5 --- Concluding Remarks --- p.7-18Chapter 7.6 --- Note on Publications --- p.7-18Chapter CHAPTER 8 --- Recapitulation and Topics for Future InvestigationChapter 8.1 --- Recapitulation --- p.8-1Chapter 8.2 --- Topics for Future Investigation --- p.8-3REFERENCES --- p.R-1APPENDICESChapter A. --- Statistics of Monochrome Test Images --- p.A-lChapter B. --- Statistics of Color Test Images --- p.A-2Chapter C. --- Fortran Program Listing for the Pruned Fast DCT Algorithm --- p.A-3Chapter D. --- Training Set Images for Building the Codebook of Standard VQ Scheme --- p.A-5Chapter E. --- List of Publications --- p.A-

Structural basis of translational recycling and bacterial ribosome rescue

In the last step of gene expression, a messenger RNA (mRNA) sequence is translated into a polypeptide. This highly regulated and dynamic process is carried out by the ribosome, a ribonucleoprotein complex composed of two unequal subunits. The translation cycle is initiated when the small ribosomal subunit (SSU) binds to an mRNA and recognizes the start codon of the open reading frame (ORF). Then the large ribosomal subunit (LSU) joins and the ribosome starts moving along the mRNA. A protein is synthesized until the ribosome reaches a stop codon. A cell needs thousands (prokaryotes) or millions (eukaryotes) of ribosomes for protein production and spends enormous amounts of energy on the assembly of this macromolecular machinery. Therefore, it is crucial to recycle the machinery after each successful round of translation. The recycling step allows release of mRNA, transfer RNA (tRNA) and the synthesized polypeptide from ribosomal subunits and subsequent binding of the next mRNA for protein synthesis. The first part of this dissertation includes studies of the highly conserved and essential ribosome recycling factor ATP binding cassette (ABC) Subfamily E Member 1 (ABCE1). In eukaryotes and archaea, ABCE1 binds the ribosome and in concert with an A-site factor and splits the ribosome into large and small subunits. ABCE1 harbors two nucleotide binding sites (NBSs), which are formed at the interface of two nucleotide binding domains (NBDs). Prior to this work, the ABCE1-bound pre-splitting complex, as well as the ABCE1-bound post-splitting complex, had been visualized by cryo-electron microscopy (cryo-EM) at medium resolution. This structural analysis combined with functional studies led to a model for the mechanism of the splitting event. ATP-binding and the closure of the NBSs lead to repositioning of the iron-sulfur cluster domain, which results in collision with the A-site factor and ribosome splitting. Yet, how conformational changes during the splitting event are triggered and communicated to the NBSs of ABCE1, was not understood. To gain molecular insights into this process, a structure of a fully nucleotide-occluded (closed) state of ABCE1 bound to the archaeal 30S post-splitting complex was solved by cryo-EM. At a resolution of 2.8 Å a detailed molecular analysis of ABCE1 was performed and confirmed by a combination of mutational and functional studies. This allowed to propose a refined model of how the ATPase cycle is linked to ribosome splitting and which role the different domains of ABCE1 play. In eukaryotes, the recycling phase is directly linked to translation initiation via the SSU. After being released from the mRNA 3’ end, the SSU can engage with another or even the same mRNA at the 5’ end. The recycling factor ABCE1 was found to be associated with initiation complexes, but whether it plays a role in initiation was not clear. Using cryo-EM, structures of native ABCE1-containing initiation complexes were solved and intensive 3D classification allowed to distinguish different stages of initiation, during which ABCE1 may play a role. Surprisingly, ABCE1 adopted a previously unknown state for ABC-type ATPases that was termed “hybrid state”. Here, the NBSI is in a half open state with ADP bound and the NBSII is in a closed state with ATP bound. Further, eukaryotic initiation factor 3j (eIF3j) was found to stabilize this hybrid conformation via its N-terminus. Since eIF3j had already been described to assist ABCE1 in ribosome dissociation, in vitro splitting assays were performed demonstrating that eiF3j indeed actively enhances the splitting reaction. On top of this, the high-resolution structure allowed to describe the interaction network of eIF3j with the ribosome, initiation factors (IFs), and ABCE1. Independent of ABCE1, the structures presented here allowed to provide an improved molecular model of the human 43S pre-initiation complex (PIC) and to analyze its sophisticated interaction network. In particular, new molecular insights into the large eIF3 complex encircling the 43S PIC, and the eIF2 ternary complex delivering the initiator tRNA are provided. Equally important as canonical recycling is the recognition and recycling of ribosomes that result from translational failure. Aberrant translation elongation and ribosome stalling can be caused by a plethora of different stresses. In bacterial cells, multiple rescue systems are known such as trans-translation or alternative ribosome rescue factor-mediated termination, which act on ribosome nascent chain complexes with an empty A-site (non-stop complexes). It has been a long standing question how ribosomes that are stalled in the middle of an ORF (no-go complexes) are recognized and recycled. The second part of this dissertation reports a new bacterial rescue system that acts on no-go complexes. In eukaryotes, the concept of ribosome collisions as a trigger for ribosome rescue has been studied extensively. Here, it was found that a similar mechanism exists in bacteria and thus a structural analysis of collided disomes in E. coli and B. subtilis was conducted. In a genetic screen, the endonuclease SmrB was identified as one candidate for a collision sensor. Structural analysis of SmrB-bound disomes elucidated how this rescue factor is recruited to collided ribosomes. Its SMR domain binds to the disome interface between the stalled and the collided ribosome in close proximity to the mRNA and in a position ideal to perform endonucleolytic cleavage. Such cleavage then results in non-stop complexes that can be recycled by the pathways mentioned above. In conclusion, this work provides mechanistic insights into how a cell distinguishes stalled ribosomes from actively translating ribosomes and characterizes a novel ribosome rescue pathway

Recent Developments in Video Surveillance

With surveillance cameras installed everywhere and continuously streaming thousands of hours of video, how can that huge amount of data be analyzed or even be useful? Is it possible to search those countless hours of videos for subjects or events of interest? Shouldn’t the presence of a car stopped at a railroad crossing trigger an alarm system to prevent a potential accident? In the chapters selected for this book, experts in video surveillance provide answers to these questions and other interesting problems, skillfully blending research experience with practical real life applications. Academic researchers will find a reliable compilation of relevant literature in addition to pointers to current advances in the field. Industry practitioners will find useful hints about state-of-the-art applications. The book also provides directions for open problems where further advances can be pursued