Duration of cell cycle, onset of S phase and induced mitotic synchronisation in seeds of opium poppy, Papaver somniferum L

Primary brain tumors in two dogs were surgically removed followed by postoperative radiation therapy. The two tumors were confirmed histologically to be astrocytoma and meningioma, respectively. After the surgery, the neurological status of each dog improved dramatically and a total dose of 40 Gy was delivered to the surgical site to treat residual tumor tissue. Although the dog with astrocytoma died 6 months after surgery due to unknown causes, the dog with meningioma has lived for over 24 months with a degree of neurological disorder less severe than that before treatment. These results suggested the effectiveness of this type of therapy on brain tumor in dogs and therapeutic modality should be positively planned to treat canine brain tumors.     

A second-generation system for unbiased reading frame selection

Reading frame selection of nucleic acids has important implications for protein engineering and genomics. Current methods are limited because selection of the gene of interest inevitably depends on the solubility of its translated product. Here we report the construction of the pInSALect vector, which provides strict reading frame selection without concomitant selection for protein solubility or folding. This plasmid incorporates the cis-splicing VMA intein sequence from Saccharomyces cerevisiae to facilitate the post-translational self-excision of the protein of interest, thereby eliminating potential aggregation problems. Results from two libraries of chimeric glycinamide ribonucleotide formyltransferases confirm the superior performance of pInSALect over existing reading frame selection systems.     

Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model

We study the problem of sparse-matrix dense-vector multiplication (SpMV) in external memory. The task of SpMV is to compute y:=Ax, where A is a sparse N×N matrix and x is a vector. We express sparsity by a parameter k, and for each choice of k consider the class of matrices where the number of nonzero entries is kN, i.e., where the average number of nonzero entries per column is k.     

On Space Efficient Two Dimensional Range Minimum Data Structures

The two dimensional range minimum query problem is to preprocess a static m by n matrix (two dimensional array) A of size N=m⋅n, such that subsequent queries, asking for the position of the minimum element in a rectangular range within A, can be answered efficiently. We study the trade-off between the space and query time of the problem. We show that every algorithm enabled to access A during the query and using a data structure of size O(N/c) bits requires Ω(c) query time, for any c where 1≤c≤N. This lower bound holds for arrays of any dimension. In particular, for the one dimensional version of the problem, the lower bound is tight up to a constant factor. In two dimensions, we complement the lower bound with an indexing data structure of size O(N/c) bits which can be preprocessed in O(N) time to support O(clog ² c) query time. For c=O(1), this is the first O(1) query time algorithm using a data structure of optimal size O(N) bits. For the case where queries can not probe A, we give a data structure of size O(N⋅min {m,log n}) bits with O(1) query time, assuming m≤n. This leaves a gap to the space lower bound of Ω(Nlog m) bits for this version of the problem.     

External Memory Planar Point Location with Logarithmic Updates

Point location is an extremely well-studied problem both in internal memory models and recently also in the external memory model. In this paper, we present an I/O-efficient dynamic data structure for point location in general planar subdivisions. Our structure uses linear space to store a subdivision with N segments. Insertions and deletions of segments can be performed in amortized O(log? _B N) I/Os and queries can be answered in $O(\log_{B}^{2} N)$ I/Os in the worst-case. The previous best known linear space dynamic structure also answers queries in $O(\log_{B}^{2} N)$ I/Os, but only supports insertions in amortized $O(\log_{B}^{2} N)$ I/Os. Our structure is also considerably simpler than previous structures.     

The Future IS Organization in a Flat World

ABSTRACT

The business world is becoming increasingly “flat” with regard to access to global markets and a global workforce. New operational priorities are emerging that require new IS capabilities. The linkage between these operational shifts and the changes required by an IS organization to develop new IS capabilities for a flattening world are identified and discussed.     

Fast fluid-attenuated inversion-recovery imaging: first experience with a 3D version in epilepsy

Breast reconstruction has been the subject of many controversies. It now seems generally agreed however that the operation has no deleterious influence on the follow up of breast cancer patients and that it has favorable psychologic effects. Breast reconstruction can be performed either by using prostheses or analogous tissues. These two different modalities have each their own advantages and limitations. Deep knowledge of the techniques and their indications allows to select the most appropriate approach in the individual patient and, thus, to improve long term results.     

Evidence of transmission of hepatitis B virus to spouses from sequence analysis of the viral genome

Despite advances in postnatal care, patients born with a congenital diaphragmatic hernia (CDH) suffer substantial morbidity and mortality. The present study was undertaken to determine the prognostic influence of prenatally-diagnosed liver herniation in the hemithorax in fetuses with CDH. The medical records of 48 patients evaluated for a prenatally-diagnosed left CDH were retrospectively reviewed. Patients were analysed according to the position of the liver by prenatal ultrasound; 32 fetuses had a major portion of the liver herniated into the left hemithorax ('liver up') and 16 had an intra-abdominal liver ('liver down'). Liver position was determined using colour-flow Doppler ultrasonography. There were two fetal deaths in the liver-up group and one in the liver-down group. The liver-up group more frequently required extracorporeal membrane oxygenation (ECMO) support (53 per cent) compared with the liver-down group (19 per cent). Postnatal survival was significantly less in the liver-up group (43 per cent) vs. the liver-down group (93 per cent). Fetuses with congenital diaphragmatic hernia and liver herniated into the hemithorax have a much worse prognosis than similarly afflicted fetuses without liver herniation. Prenatal ultrasonographic diagnosis of congenital diaphragmatic hernia allows for preparation for a critically ill newborn and aids in prenatal family counselling.