DNA-condensing and chromatin-condensing properties of rat testes hla and hit compared to those of rat-liver hlbdec - hlt is a poor condenser of chromatin

Histones H1a and H1t are two major linker histone variants present at the pachytene interval of mammalian spermatogenesis. The DNA- and chromatin-condensing properties of these two variants isolated from rat testes were studied and compared with those from rat liver. For this purpose, the histone H1 subtypes were purified from the respective tissues using bath acid and salt extraction procedures, Circular dichroism studies revealed that acid exposure during isolation affects the alpha-helical structure of both the globular domain (in the presence of 1 M NaCl) and the C-terminal lambda-tail (in the presence of 60% trifluoroethanol). The condensation of rat oligonucleosomal DNA, as measured by circular dichroism spectroscopy, by the salt-extracted histone H1 was at least 10 times more efficient than condensation by the acid-extracted histone H1. A site size of 16-20 base pairs was calculated for the salt-extracted histone H1. Among the different histone H1 subtypes, somatic histone H1bdec had the highest DNA-condensing property, followed by histone H1a and histone H1t. All the salt-extracted histones condensed rat oligonucleosomal DNA more efficiently than linear pBR-322 DNA, Histones H1bdec and H1a condensed histone H1-depleted chromatin, prepared from rat liver nuclei, with relatively equal efficiency. On the other hand, there was no condensation of histone H1-depleted chromatin with the testes specific histone H1t. A comparison of the amino acid sequences of histone H1d (rat) and histone H1t (rat) revealed several interesting differences in the occurrence of DNA-binding motifs at the C-terminus. A striking observation is the presence of a direct repeat of an octapeptide motif K(A)T(S)PKKA(S)K(T)K(A) in histone H1d that is absent in histone H1t.

Block-based feature detection and matching for mosaicing of camera-captured document images

In this paper, we present a new feature-based approach for mosaicing of camera-captured document images. A novel block-based scheme is employed to ensure that corners can be reliably detected over a wide range of images. 2-D discrete cosine transform is computed for image blocks defined around each of the detected corners and a small subset of the coefficients is used as a feature vector A 2-pass feature matching is performed to establish point correspondences from which the homography relating the input images could be computed. The algorithm is tested on a number of complex document images casually taken from a hand-held camera yielding convincing results.

Immediate hypersensitivity to Parthenium hysterophorus. I. Association of HLA antigens and Parthenium rhinitis

Lymphocytes collected from rhinitis subjects with strong positive skin reactions to the pollen allergens of Parthenium hysterophorus (American feverfew) having moderate to high titres of Parthenium-specific serum IgE were analysed for association of HLA-antigens covering 13 specificities of HLA-A, 17 specificities of HLA-B and eight specificities of HLA-DR loci by the NIH two-stage microlymphocytotoxicity assay. Comparison of the phenotypic frequencies of HLA-A and B antigens between Parthenium rhinitis subjects (n= 22) and control subjects (n= 137) did not suggest any significant association when tested for these antigen specificities. A significant correlation in the association of HLA-DR3 antigen with a relative risk of 11·33, however, was observed in Parthenium rhinitis subjects (n= 30) when compared to controls (n= 50).

A Case Study in Matching Service Descriptions to Implementations in an Existing System

A number of companies are trying to migrate large monolithic software systems to Service Oriented Architectures. A common approach to do this is to first identify and describe desired services (i.e., create a model), and then to locate portions of code within the existing system that implement the described services. In this paper we describe a detailed case study we undertook to match a model to an open-source business application. We describe the systematic methodology we used, the results of the exercise, as well as several observations that throw light on the nature of this problem. We also suggest and validate heuristics that are likely to be useful in partially automating the process of matching service descriptions to implementations.

Matching sender and receiver: poikilothermy and frequency tuning in a tree cricket

Animals communicate in non-ideal and noisy conditions. The primary method they use to improve communication efficiency is sender-receiver matching: the receiver's sensory mechanism filters the impinging signal based on the expected signal. In the context of acoustic communication in crickets, such a match is made in the frequency domain. The males broadcast a mate attraction signal, the calling song, in a narrow frequency band centred on the carrier frequency (CF), and the females are most sensitive to sound close to this frequency. In tree crickets, however, the CF changes with temperature. The mechanisms used by female tree crickets to accommodate this change in CF were investigated at the behavioural and biomechanical level. At the behavioural level, female tree crickets were broadly tuned and responded equally to CFs produced within the naturally occurring range of temperatures (18 to 27 degrees C). To allow such a broad response, however, the transduction mechanisms that convert sound into mechanical and then neural signals must also have a broad response. The tympana of the female tree crickets exhibited a frequency response that was even broader than suggested by the behaviour. Their tympana vibrate with equal amplitude to frequencies spanning nearly an order of magnitude. Such a flat frequency response is unusual in biological systems and cannot be modelled as a simple mechanical system. This feature of the tree cricket auditory system not only has interesting implications for mate choice and species isolation but may also prove exciting for bio-mimetic applications such as the design of miniature low frequency microphones.

Dynamically Reconfigurable Regular Expression Matching Architecture

Regular Expressions are generic representations for a string or a collection of strings. This paper focuses on implementation of a regular expression matching architecture on reconfigurable fabric like FPGA. We present a Nondeterministic Finite Automata based implementation with extended regular expression syntax set compared to previous approaches. We also describe a dynamically reconfigurable generic block that implements the supported regular expression syntax. This enables formation of the regular expression hardware by a simple cascade of generic blocks as well as a possibility for reconfiguring the generic blocks to change the regular expression being matched. Further,we have developed an HDL code generator to obtain the VHDL description of the hardware for any regular expression set. Our optimized regular expression engine achieves a throughput of 2.45 Gbps. Our dynamically reconfigurable regular expression engine achieves a throughput of 0.8 Gbps using 12 FPGA slices per generic block on Xilinx Virtex2Pro FPGA.

HLA-B*57 and Gender Influence the Occurrence of Tuberculosis in HIV Infected People of South India

Background. Substantial evidence exists for HLA and other host genetic factors being determinants of susceptibility or resistance to infectious diseases. However, very little information is available on the role of host genetic factors in HIV-TB coinfection. Hence, a longitudinal study was undertaken to investigate HLA associations in a cohort of HIV seropositive individuals with and without TB in Bangalore, South India. Methods. A cohort of 238 HIV seropositive subjects were typed for HLA-A, B, and DR by PCR-SSP and followed up for 5 years or till manifestation of Tuberculosis. HLA data of 682 HIV Negative healthy renal donors was used as control. Results. The ratio of males and females in HIV cohort was comparable (50.4% and 49.6%). But the incidence of TB was markedly lower in females (12.6%,) than males (25.6%). Further, HLA-B* 57 frequency in HIV cohort was significantly higher among females without TB (21.6%, 19/88) than males (1.7%, 1/59); P = 0.0046; OR = 38. CD4 counts also were higher among females in this cohort. Conclusion. This study suggests that HIV positive women with HLA-B* 57 have less occurrence of TB as compared to males.

Supervised matching of comments with news article segments

Comments constitute an important part of Web 2.0. In this paper, we consider comments on news articles. To simplify the task of relating the comment content to the article content the comments are about, we propose the idea of showing comments alongside article segments and explore automatic mapping of comments to article segments. This task is challenging because of the vocabulary mismatch between the articles and the comments. We present supervised and unsupervised techniques for aligning comments to segments the of article the comments are about. More specifically, we provide a novel formulation of supervised alignment problem using the framework of structured classification. Our experimental results show that structured classification model performs better than unsupervised matching and binary classification model.

Efficient Regular Expression Pattern Matching for Network Intrusion Detection Systems using Modified Word-based Automata

Network Intrusion Detection Systems (NIDS) intercept the traffic at an organization's network periphery to thwart intrusion attempts. Signature-based NIDS compares the intercepted packets against its database of known vulnerabilities and malware signatures to detect such cyber attacks. These signatures are represented using Regular Expressions (REs) and strings. Regular Expressions, because of their higher expressive power, are preferred over simple strings to write these signatures. We present Cascaded Automata Architecture to perform memory efficient Regular Expression pattern matching using existing string matching solutions. The proposed architecture performs two stage Regular Expression pattern matching. We replace the substring and character class components of the Regular Expression with new symbols. We address the challenges involved in this approach. We augment the Word-based Automata, obtained from the re-written Regular Expressions, with counter-based states and length bound transitions to perform Regular Expression pattern matching. We evaluated our architecture on Regular Expressions taken from Snort rulesets. We were able to reduce the number of automata states between 50% to 85%. Additionally, we could reduce the number of transitions by a factor of 3 leading to further reduction in the memory requirements.

MULTI-OBJECTIVE GENETIC ALGORITHM FOR EFFICIENT POINT MATCHING IN MULTI-SENSOR SATELLITE IMAGE

This paper investigates a new approach for point matching in multi-sensor satellite images. The feature points are matched using multi-objective optimization (angle criterion and distance condition) based on Genetic Algorithm (GA). This optimization process is more efficient as it considers both the angle criterion and distance condition to incorporate multi-objective switching in the fitness function. This optimization process helps in matching three corresponding corner points detected in the reference and sensed image and thereby using the affine transformation, the sensed image is aligned with the reference image. From the results obtained, the performance of the image registration is evaluated and it is concluded that the proposed approach is efficient.

On Selection of Search Space Dimension in Compressive Sampling Matching Pursuit

Compressive Sampling Matching Pursuit (CoSaMP) is one of the popular greedy methods in the emerging field of Compressed Sensing (CS). In addition to the appealing empirical performance, CoSaMP has also splendid theoretical guarantees for convergence. In this paper, we propose a modification in CoSaMP to adaptively choose the dimension of search space in each iteration, using a threshold based approach. Using Monte Carlo simulations, we show that this modification improves the reconstruction capability of the CoSaMP algorithm in clean as well as noisy measurement cases. From empirical observations, we also propose an optimum value for the threshold to use in applications.