On the complexity of binary samples

Consider a class of binary functions h: X→{ − 1, + 1} on an interval . Define the sample width of h on a finite subset (a sample) S ⊂ X as ω _S (h) =  min _x ∈ S |ω _h (x)| where ω _h (x) = h(x) max {a ≥ 0: h(z) = h(x), x − a ≤ z ≤ x + a}. Let be the space of all samples in X of cardinality ℓ and consider sets of wide samples, i.e., hypersets which are defined as Through an application of the Sauer-Shelah result on the density of sets an upper estimate is obtained on the growth function (or trace) of the class , β > 0, i.e., on the number of possible dichotomies obtained by intersecting all hypersets with a fixed collection of samples of cardinality m. The estimate is .      

Reconstruction of cellular biological structures from optical microscopy data

Developments in optical microscopy imaging have generated large high-resolution data sets that have spurred medical researchers to conduct investigations into mechanisms of disease, including cancer at cellular and subcellular levels. The work reported here demonstrates that a suitable methodology can be conceived that isolates modality-dependent effects from the larger segmentation task and that 3D reconstructions can be cognizant of shapes as evident in the available 2D planar images. In the current realization, a method based on active geodesic contours is first deployed to counter the ambiguity that exists in separating overlapping cells on the image plane. Later, another segmentation effort based on a variant of Voronoi tessellations improves the delineation of the cell boundaries using a Bayesian formulation. In the next stage, the cells are interpolated across the third dimension thereby mitigating the poor structural correlation that exists in that dimension. We deploy our methods on three separate data sets obtained from light, confocal, and phase-contrast microscopy and validate the results appropriately.     

Computer program for automated sleep depth estimation

In this article, we present a new implementation of an amplitude-independent method for continuous-scale sleep depth estimation. Having been implemented as an add-on analysis module under commercially available biosignal recording and analysis software, it can be easily applied in clinical routine. The software gives the user full freedom to change all the analysis parameters inside theoretical limits. Computational sleep depth profiles produced by the presented software compare favourably with visual classifications. Future work will concentrate on systematic optimization of analysis parameters, further evaluation of the method with disturbed sleep and application of the method for automated adaptive sleep analysis.     

A theory of mode of action of azolylalkylquinolines as DNA binding agents using automated flexible ligand docking

Azolylalkylquinolines (AAQs) are a family of quinolines with varying degrees of cytotoxic activity (comparable or moderately superior to adriamycin in some cases) developed in the past decade in our group where their exact mode of action is still unclear. In this study the most probable DNA binding mode of AAQs was investigated employing a novel flexible ligand docking approach by using AutoDock 3.0. Forty-nine AAQs with known experimental inhibitory activity were docked onto d(CGCAAATTTGCG)(2), d(CGATCG)(2) and d(CGCG)(2) oligonucleotides retrieved from the Protein Data Bank (PDB IDs: 102D, 1D12 and 1D32, respectively) as the representatives of the three plausible models of interactions between chemotherapeutic agents and DNA (groove binding, groove binding plus intercalation and bisintercalation, respectively). Good correlation (r(2)=0.64) between calculated binding energies and experimental inhibitory activities was obtained using groove binding plus intercalation model for phenyl-azolylalkylquinoline (PAAQ) series. Our findings show that the most probable mode of action of PAAQs as DNA binding agents is via intercalation of quinolinic moiety between CG base pairs with linker chain and azole moiety binding to the minor groove.     

Fluorescence in situ hybridization of three oncogenes on a leiomyoma

Using fluorescence in situ hybridization technique, expression of three oncogenes, C-myc, RARa, and cyclin-D was tested on a uterine leiomyoma. C-myc and RARa were amplified in approximately 30% and 90% of the cells, respectively. Numerous small signals of C-myc were indicative of the presence of double minutes. Amplification of RARa is being reported for the first time in a leiomyoma. Cyclin-D was normal in diploid cells while it was highly amplified in polyploid cells. Low levels of amplified C-myc and cyclin-D cells seem to be the reason for this tumor to be benign, while RARa could not be effective without the association of some other gene such as PML. Information presented here are significant toward developing new curative strategies such as gene-specific drugs and molecular manipulation to stop the activity of cancer gene. Further study may elucidate that how fibroids grow and maintain their rare benign nature.     

Macsyma: A personal history

The Macsyma system arose out of research on mathematical software in the AI group at MIT in the 1960s. Algorithm development in symbolic integration and simplification arose out of the interest of people, such as the author, who were also mathematics students. The later development of algorithms for the GCD of sparse polynomials, for example, arose out of the needs of our user community. During various times in the 1970s the computer on which Macsyma ran was one of the most popular nodes on the ARPANET. We discuss the attempts in the late 70s and the 80s to develop Macsyma systems that ran on popular computer architectures. Finally, we discuss the impact of the fundamental ideas in Macsyma on the author’s current research on large scale engineering and socio-technical systems.     

Characteristics of Metal Droplets in Slag Tapped from the Blast Furnace

Slag samples, hot‐metal samples and hot‐metal temperatures were obtained during tapping of two blast furnaces. Sampling was carried out at different time points during tapping of three separate heats. The size distribution and composition of metal droplets found in the slag were determined using scanning electron microscopy. Only metal droplets above 0.75 μm could be counted and analysed. All droplets were below 8 μm in diameter and the great majority of these droplets were found to be between 0.75 and 2 μm. The size distribution did not differ significantly for different slag samples. Iron was the main droplet component. Electron probe microanalysis showed that the droplets contained small amounts of carbon. The percentage of the area in a studied cross‐section that was covered with metal droplets varied between 0.01 and 0.07%. Calculations based on Stoke's law showed that the distance droplets travel in the slag is in the micron range. Slag samples taken in the beginning of slag tapping contained more droplets than those taken in the middle of slag tapping, an indication that most droplets can be found in the area near the furnace wall. Some droplets were determined to have magnesium enrichment at the external surface.     

Optimal decoder for block-transform based video coders

In this paper, we introduce a new decoding algorithm for DCT-based video encoders, such as Motion JPEG (M-JPEG), H26x, or MPEG. This algorithm considers not only the compression artifacts but also the ones due to transmission, acquisition or storage of the video. The novelty of our approach is to jointly tackle these two problems, using a variational approach. The resulting decoder is object-based, allowing independent and adaptive processing of objects and backgrounds, and considers available information provided by the bitstream, such as quantization steps, and motion vectors. Several experiments demonstrate the efficiency of the proposed method. Objective and subjective quality assessment methods are used to evaluate the improvement upon standard algorithms, such as the deblocking and deringing filters included in MPEG-4 postprocessing.     

Distributed Job Scheduling in Rings

We give a distributed approximation algorithm for job scheduling in a ring architecture. In contrast to many other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those two processors in the network. As a result, our algorithm must balance computational load and communication time. The algorithm is simple, requires no global control, and yields schedules of length at most 4.22 times optimal. We also give a lower bound on the performance of any distributed algorithm and the results of simulation experiments which suggest better performance than does our worst-case analysis.