A comparative study of multiple attribute tree and inverted file structures for large bibliographic files

A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree, range tree, polygon tree, quintary tree, multidimensional tries, segment tree, doubly chained tree, the grid file, d-fold tree. super B-tree, Multiple Attribute Tree (MAT), etc. have been studied for multidimensional searching and related problems. Physical data base organization, which is an important application of multidimensional searching, is traditionally and mostly handled by employing inverted file. This study proposes MAT data structure for bibliographic file systems, by illustrating the superiority of MAT data structure over inverted file. Both the methods are compared in terms of preprocessing, storage and query costs. Worst-case complexity analysis of both the methods, for a partial match query, is carried out in two cases: (a) when directory resides in main memory, (b) when directory resides in secondary memory. In both cases, MAT data structure is shown to be more efficient than the inverted file method. Arguments are given to illustrate the superiority of MAT data structure in an average case also. An efficient adaptation of MAT data structure, that exploits the special features of MAT structure and bibliographic files, is proposed for bibliographic file systems. In this adaptation, suitable techniques for fixing and ranking of the attributes for MAT data structure are proposed. Conclusions and proposals for future research are presented.

Optimal simultaneous maximum a posterioriestimation of states, noise statistics and parameters II. Numerical performance

A very general and numerically quite robust algorithm has been proposed by Sastry and Gauvrit (1980) for system identification. The present paper takes it up and examines its performance on a real test example. The example considered is the lateral dynamics of an aircraft. This is used as a vehicle for demonstrating the performance of various aspects of the algorithm in several possible modes.

Huffman Binary Coding of WLN Symbols for File-Compression

Construction of Huffman binary codes for WLN symbols is described for the compression of a WLN file. Here, a parenthesized representation of the tree structure is used for computer encoding.

Implementation of placement and routing algorithms for computer aided design of printed circuit boards

The Printed Circuit Board (PCB) layout design is one of the most important and time consuming phases during equipment design process in all electronic industries. This paper is concerned with the development and implementation of a computer aided PCB design package. A set of programs which operate on a description of the circuit supplied by the user in the form of a data file and subsequently design the layout of a double-sided PCB has been developed. The algorithms used for the design of the PCB optimise the board area and the length of copper tracks used for the interconnections. The output of the package is the layout drawing of the PCB, drawn on a CALCOMP hard copy plotter and a Tektronix 4012 storage graphics display terminal. The routing density (the board area required for one component) achieved by this package is typically 0.8 sq. inch per IC. The package is implemented on a DEC 1090 system in Pascal and FORTRAN and SIGN(1) graphics package is used for display generation.

Studies in biogas technology. Part II. Optimisation of plant dimensions

In this paper, the design basis of the conventional Khadi and Village Industries Commission biogas plants has been elucidated. It has been shown that minimisation of the cost of the gas holder alone leads to the narrow and deep digesters of conventional plants. If instead, the total capital cost of the gas holder plus digester is minimised, the optimisation leads to wide and shallow digesters, which are less expensive. To test this alternative, two prototype plants have been designed, constructed and operated. These plants are not only 25–40% cheaper, but their performance is actually slightly better than the conventional plants.

Bis(acetylacetonato-kappa 2 O,O')(pyridine-kappa N)zinc(II)

In the title compound, Zn(C5H7O2)(2)(C5H5N)], the metal atom has square-pyramidal coordination geometry with the basal plane defined by the four O atoms of the chelating acetylacetonate ligands and with the axial position occupied by the pyridine N atom. The crystal packing is characterized by a C-H...O hydrogen-bonded ribbon structure approximately parallel to 10 <file type=''gif'' name=''AYE_ng5159_mu1.gif''/> ].

Discovery of Application Workloads from Network File Traces

An understanding of application I/O access patterns is useful in several situations. First, gaining insight into what applications are doing with their data at a semantic level helps in designing efficient storage systems. Second, it helps create benchmarks that mimic realistic application behavior closely. Third, it enables autonomic systems as the information obtained can be used to adapt the system in a closed loop.All these use cases require the ability to extract the application-level semantics of I/O operations. Methods such as modifying application code to associate I/O operations with semantic tags are intrusive. It is well known that network file system traces are an important source of information that can be obtained non-intrusively and analyzed either online or offline. These traces are a sequence of primitive file system operations and their parameters. Simple counting, statistical analysis or deterministic search techniques are inadequate for discovering application-level semantics in the general case, because of the inherent variation and noise in realistic traces.In this paper, we describe a trace analysis methodology based on Profile Hidden Markov Models. We show that the methodology has powerful discriminatory capabilities that enable it to recognize applications based on the patterns in the traces, and to mark out regions in a long trace that encapsulate sets of primitive operations that represent higher-level application actions. It is robust enough that it can work around discrepancies between training and target traces such as in length and interleaving with other operations. We demonstrate the feasibility of recognizing patterns based on a small sampling of the trace, enabling faster trace analysis. Preliminary experiments show that the method is capable of learning accurate profile models on live traces in an online setting. We present a detailed evaluation of this methodology in a UNIX environment using NFS traces of selected commonly used applications such as compilations as well as on industrial strength benchmarks such as TPC-C and Postmark, and discuss its capabilities and limitations in the context of the use cases mentioned above.

Register File Energy Optimization for Snooping Based Clustered VLIW Architectures

Frequent accesses to the register file make it one of the major sources of energy consumption in ILP architectures. The large number of functional units connected to a large unified register file in VLIW architectures make power dissipation in the register file even worse because of the need for a large number of ports. High power dissipation in a relatively smaller area occupied by a register file leads to a high power density in the register file and makes it one of the prime hot-spots. This makes it highly susceptible to the possibility of a catastrophic heatstroke. This in turn impacts the performance and cost because of the need for periodic cool down and sophisticated packaging and cooling techniques respectively. Clustered VLIW architectures partition the register file among clusters of functional units and reduce the number of ports required thereby reducing the power dissipation. However, we observe that the aggregate accesses to register files in clustered VLIW architectures (and associated energy consumption) become very high compared to the centralized VLIW architectures and this can be attributed to a large number of explicit inter-cluster communications. Snooping based clustered VLIW architectures provide very limited but very fast way of inter-cluster communication by allowing some of the functional units to directly read some of the operands from the register file of some of the other clusters. In this paper, we propose instruction scheduling algorithms that exploit the limited snooping capability to reduce the register file energy consumption on an average by 12% and 18% and improve the overall performance by 5% and 11% for a 2-clustered and a 4-clustered machine respectively, over an earlier state-of-the-art clustered scheduling algorithm when evaluated in the context of snooping based clustered VLIW architectures.

Improving Superscalar Instruction Dispatch And Issue By Exploiting Dynamic Code Sequences

Superscalar processors currently have the potential to fetch multiple basic blocks per cycle by employing one of several recently proposed instruction fetch mechanisms. However, this increased fetch bandwidth cannot be exploited unless pipeline stages further downstream correspondingly improve. In particular,register renaming a large number of instructions per cycle is diDcult. A large instruction window, needed to receive multiple basic blocks per cycle, will slow down dependence resolution and instruction issue. This paper addresses these and related issues by proposing (i) partitioning of the instruction window into multiple blocks, each holding a dynamic code sequence; (ii) logical partitioning of the registerjle into a global file and several local jles, the latter holding registers local to a dynamic code sequence; (iii) the dynamic recording and reuse of register renaming information for registers local to a dynamic code sequence. Performance studies show these mechanisms improve performance over traditional superscalar processors by factors ranging from 1.5 to a little over 3 for the SPEC Integer programs. Next, it is observed that several of the loops in the benchmarks display vector-like behavior during execution, even if the static loop bodies are likely complex for compile-time vectorization. A dynamic loop vectorization mechanism that builds on top of the above mechanisms is briefly outlined. The mechanism vectorizes up to 60% of the dynamic instructions for some programs, albeit the average number of iterations per loop is quite small.

A Perspective on Computer Assisted Assessment Techniques for Short Free-Text Answers

Computer Assisted Assessment (CAA) has been existing for several years now. While some forms of CAA do not require sophisticated text understanding (e.g., multiple choice questions), there are also student answers that consist of free text and require analysis of text in the answer. Research towards the latter till date has concentrated on two main sub-tasks: (i) grading of essays, which is done mainly by checking the style, correctness of grammar, and coherence of the essay and (ii) assessment of short free-text answers. In this paper, we present a structured view of relevant research in automated assessment techniques for short free-text answers. We review papers spanning the last 15 years of research with emphasis on recent papers. Our main objectives are two folds. First we present the survey in a structured way by segregating information on dataset, problem formulation, techniques, and evaluation measures. Second we present a discussion on some of the potential future directions in this domain which we hope would be helpful for researchers.

Synthesis of some copper(II)-chelating (dialkylamino)pyridine amphiphiles and evaluation of their esterolytic capacities in cationic micellar media

Three new (dialkylamino)pyridine (DAAP)-based ligand amphiphiles 3-5 have been synthesized. All of the compounds possess a metal ion binding subunit in the form of a 2,6-disubstituted DAAP moiety. In addition, at least one ortho-CH2OH substituent is present in all the ligands. Complex formation by these ligands with various metal ions were examined under micellar conditions, but only complexes with Cu(II) ions showed kinetically potent esterolytic capacities under micellar conditions. Complexes with Cu(II) were prepared in host comicellar cetyltrimethylammonium bromide (CTABr) media at pH 7.6. Individual complexes were characterized by UV-visible absorption spectroscopy and electron paramagnetic resonance spectroscopy. These metallomicelles speed the cleavage of the substrates p-nitrophenyl hexanoate or p-nitrophenyl diphenyl phosphate. To ascertain the nature of the active esterolytic species, the stoichiometries of the respective Cu(II) complexes were determined from the kinetic version of Job's plot. In all the instances, 2:1 complex ligand/Cu(II) ion are the most kinetically competent species. The apparent pK(a) values of the Cu(II)-coordinated hydroxyl groups of the ligands 3, 4, and 5, in the comicellar aggregate, are 7.8, 8.0, and 8.0, respectively, as estimated from the rate constant vs pH: profiles of the ester cleavage reactions. The nucleophilic metallomicellar reagents and the second-order "catalytic" rate constants toward esterolysis of the substrate p-nitrophenyl hexanoate (at 25 degrees C, pH 7.6) are 37.5 for 3, 11.4 for 4, and 13.8 for 5. All catalytic systems comprising the coaggregates of 3, 4, or 5 and CTABr demonstrate turnover behavior in the presence of excess substrate.

The effect of pH on the unfolding pathway and stability of ribosome-inactivating protein abrin-II

The effect of pH on the unfolding pathway acid the stability of the toxic protein abrin-II have been studied by increasing denaturant concentrations of guanidine hydrochloride and by monitoring the change in 8,1-anilino naphthalene sulfonic acid (ANS) fluorescence upon binding to the hydrophobic sites of the protein. Intrinsic protein fluorescence, far and near UV-circular dichroism (CD) spectroscopy and ANS binding studies reveal that the unfolding of abrin-II occurs through two intermediates at pH 7.2 and one intermediate at pH 4.5. At pH 7.2, the two subunits A and B of abrin-II unfold sequentially. The native protein is more stable at pH 4.5 than at pH 7.2. However, the stability of the abrin-II A-subunit is not affected by a change in pH. These observations may assist in an understanding of the physiologically relevant transmembrane translocation of the toxin.

Dynamics of a dilute sheared inelastic fluid. II. The effect of correlations

The effect of correlations on the viscosity of a dilute sheared inelastic fluid is analyzed using the ring-kinetic equation for the two-particle correlation function. The leading-order contribution to the stress in an expansion in epsilon=(1-e)(1/2) is calculated, and it is shown that the leading-order viscosity is identical to that obtained from the Green-Kubo formula, provided the stress autocorrelation function in a sheared steady state is used in the Green-Kubo formula. A systemmatic extension of this to higher orders is also formulated, and the higher-order contributions to the stress from the ring-kinetic equation are determined in terms of the terms in the Chapman-Enskog solution for the Boltzmann equation. The series is resummed analytically to obtain a renormalized stress equation. The most dominant contributions to the two-particle correlation function are products of the eigenvectors of the conserved hydrodynamic modes of the two correlated particles. In Part I, it was shown that the long-time tails of the velocity autocorrelation function are not present in a sheared fluid. Using those results, we show that correlations do not cause a divergence in the transport coefficients; the viscosity is not divergent in two dimensions, and the Burnett coefficients are not divergent in three dimensions. The equations for three-particle and higher correlations are analyzed diagrammatically. It is found that the contributions due to the three-particle and higher correlation functions to the renormalized viscosity are smaller than those due to the two-particle distribution function in the limit epsilon -> 0. This implies that the most dominant correlation effects are due to the two-particle correlations.

Synthesis, crystal structure and DNA cleavage activity of (aqua)bis(dipyridophenazine)copper(II) complex

A copper(II) complex of dipyridophenazine, viz., [Cu(dppz)(2)(H2O)](ClO4)(2) (I), has been prepared and structurally characterized by X-ray crystallography. The crystal structure of the complex shows a five-coordinate structure in which two N,N-donor dipyridophenazine (dppz) and one aqua ligand bind to the copper(II) center giving Cu-O and Cu-N bond distances in the range of 1.981(6) to 2.043(6) angstrom. The ESI-MS spectrum of 1 in MeCN shows a peak at m/z value of 313 (100%) indicating the dissociation of the aqua ligand in the solution phase. The complex is one-electron paramagnetic (mu(eff), 1.86 mu(B)). It displays a quasi-reversible Cu(II)/Cu(I) redox process at 0.096 V. The complex is an avid binder to CT DNA giving a binding constant value of 3.5 x 10(5) M-1. It shows significant hydrolytic cleavage of supercoiled pUC19 DNA in dark ill the absence of any external agents. The complex exhibits chemical nuclease activity oil treatment with 3-mercaptopropionic acid as a reducing agent forming hydroxyl radicals. Complex 1 is a model synthetic nuclease and hydrolase showing both modes of DNA cleavage under different reaction conditions. The DNA cleavage activity of 1 is significantly better than its phen analogue but similar to that of the bis-dpq complex.