High Throughput, Low Latency, Memory Optimized 64K Point FFT Architecture using Novel Radix-4 Butterfly Unit

In this paper we propose a fully parallel 64K point radix-4(4) FFT processor. The radix-4(4) parallel unrolled architecture uses a novel radix-4 butterfly unit which takes all four inputs in parallel and can selectively produce one out of the four outputs. The radix-4(4) block can take all 256 inputs in parallel and can use the select control signals to generate one out of the 256 outputs. The resultant 64K point FFT processor shows significant reduction in intermediate memory but with increased hardware complexity. Compared to the state-of-art implementation 5], our architecture shows reduced latency with comparable throughput and area. The 64K point FFT architecture was synthesized using a 130nm CMOS technology which resulted in a throughput of 1.4 GSPS and latency of 47.7 mu s with a maximum clock frequency of 350MHz. When compared to 5], the latency is reduced by 303 mu s with 50.8% reduction in area.

Fault-tolerant characteristics and topological properties of a hierarchical network of hypercubes

We analyse the fault-tolerant parameters and topological properties of a hierarchical network of hypercubes. We take a close look at the Extended Hypercube (EH) and the Hyperweave (HW) architectures and also compare them with other popular architectures. These two architectures have low diameter and constant degree of connectivity making it possible to expand these networks without affecting the existing configuration. A scheme for incrementally expanding this network is also presented. We also look at the performance of the ASCEND/DESCEND class of algorithms on these architectures.

Hierarchical modelling of acclimatory processesstar, open

The term acclimation has been used with several connotations in the field of acclimatory physiology. An attempt has been made, in this paper, to define precisely the term “acclimation” for effective modelling of acclimatory processes. Acclimation is defined with respect to a specific variable, as cumulative experience gained by the organism when subjected to a step change in the environment. Experimental observations on a large number of variables in animals exposed to sustained stress, show that after initial deviation from the basal value (defined as “growth”), the variables tend to return to basal levels (defined as “decay”). This forms the basis for modelling biological responses in terms of their growth and decay. Hierarchical systems theory as presented by Mesarovic, Macko & Takahara (1970) facilitates modelling of complex and partially characterized systems. This theory, in conjunction with “growth-decay” analysis of biological variables, is used to model temperature regulating system in animals exposed to cold. This approach appears to be applicable at all levels of biological organization. Regulation of hormonal activity which forms a part of the temperature regulating system, and the relationship of the latter with the “energy” system of the animal of which it forms a part, are also effectively modelled by this approach. It is believed that this systematic approach would eliminate much of the current circular thinking in the area of acclimatory physiology.

Computing complete test graphs for hierarchical systems

Conformance testing focuses on checking whether an implementation. under test (IUT) behaves according to its specification. Typically, testers are interested it? performing targeted tests that exercise certain features of the IUT This intention is formalized as a test purpose. The tester needs a "strategy" to reach the goal specified by the test purpose. Also, for a particular test case, the strategy should tell the tester whether the IUT has passed, failed. or deviated front the test purpose. In [8] Jeron and Morel show how to compute, for a given finite state machine specification and a test purpose automaton, a complete test graph (CTG) which represents all test strategies. In this paper; we consider the case when the specification is a hierarchical state machine and show how to compute a hierarchical CTG which preserves the hierarchical structure of the specification. We also propose an algorithm for an online test oracle which avoids a space overhead associated with the CTG.

Synthesis and structural characterization of two-dimensional hierarchical covellite nano-structures

We report a simple, template free and low-temperature hydrothermal reaction pathway using Cu(II) - thiourea complex (prepared in situ from copper (II) chloride and thiourea as precursors) and citric acid as complexing agent to synthesize two-dimensional hierarchical nano-structures of covellite (CuS). The product was characterized with the help of X-ray powder diffraction (XRD), scanning electron microscopy (SEM), energy dispersive analysis of X-ray spectroscopy (EDAX) and X-ray photoelectron spectroscopy (XPS). The concentration of citric acid in the hydrothermal precursor solution was seen to have a profound effect on the nanostructure of the product generated. Based on the outcoming product nano-architecture at different concentration of the ionic surfactant in the hydrothermal precursor solution a possible mechanism suited for reaction and further nucleation is also discussed. (C) 2012 Elsevier B.V. All rights reserved.

Growth and Characterization of Vertically Aligned ZnO Hierarchical Nanostructures

Vertically aligned zinc oxide (ZnO) hierarchical nanostructures were developed by homo-epitaxial growth method using nickel as catalyst, and their physical properties were investigated and reported. ZnO nanorods grown by vapor-liquid-solid method are single crystalline and grown along the < 001 > direction, whereas the second order nano-branches are grown along the < 110 > direction. The homo-epitaxial relation between nano-branches (ZnOb) and ZnO cores (ZnOc) is found to be (110)ZnOb//(110)ZnOc and (002)ZnOb//(002)ZnOc. The simple and hierarchical nanostructures exhibited ultra-violet emission peak at 380 nm as near band edge emission of ZnO and have very weak defects related peak at 492 nm. (C) 2013 The Electrochemical Society. All rights reserved.

Compositional hierarchical monitoring automaton construction for LTL

In this paper we give a compositional (or inductive) construction of monitoring automata for LTL formulas. Our construction is similar in spirit to the compositional construction of Kesten and Pnueli [5]. We introduce the notion of hierarchical Büchi automata and phrase our constructions in the framework of these automata. We give detailed constructions for all the principal LTL operators including past operators, along with proofs of correctness of the constructions.

Microspherical, hierarchical structures of blue-green-emitting Dy:GdOOH and Dy:Gd2O3

Dy-doped GdOOH microspherical structures were prepared in minutes without using any structure-directing agents, through the microwave irradiation route. The as-prepared product consists of nearly monodisperse sphere-like entities with each one representing a three-level hierarchy in its formation. Dy:GdOOH powder samples show a bright blue-green luminescence under UV excitation, making these structures potentially important in the field of optical and luminescent devices. Finally, thermal conversion to the corresponding oxide structures occurs at modest temperatures, spherical morphology intact and with enhanced luminescence behaviour. (C) 2014 Elsevier B.V. All rights reserved.

Deciphering complex patterns of class-I HLA-peptide cross-reactivity via hierarchical grouping

T-cell responses in humans are initiated by the binding of a peptide antigen to a human leukocyte antigen (HLA) molecule. The peptide-HLA complex then recruits an appropriate T cell, leading to cell-mediated immunity. More than 2000 HLA class-I alleles are known in humans, and they vary only in their peptide-binding grooves. The polymorphism they exhibit enables them to bind a wide range of peptide antigens from diverse sources. HLA molecules and peptides present a complex molecular recognition pattern, as many peptides bind to a given allele and a given peptide can be recognized by many alleles. A powerful grouping scheme that not only provides an insightful classification, but is also capable of dissecting the physicochemical basis of recognition specificity is necessary to address this complexity. We present a hierarchical classification of 2010 class-I alleles by using a systematic divisive clustering method. All-pair distances of alleles were obtained by comparing binding pockets in the structural models. By varying the similarity thresholds, a multilevel classification was obtained, with 7 supergroups, each further subclassifying to yield 72 groups. An independent clustering performed based only on similarities in their epitope pools correlated highly with pocket-based clustering. Physicochemical feature combinations that best explain the basis of clustering are identified. Mutual information calculated for the set of peptide ligands enables identification of binding site residues contributing to peptide specificity. The grouping of HLA molecules achieved here will be useful for rational vaccine design, understanding disease susceptibilities and predicting risk of organ transplants.

Kernelization complexity of possible winner and coalitional manipulation problems in voting

In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.

Social optimum in social groups with give-and-take criterion

We consider a Social Group' of networked nodes, seeking a universe' of segments. Each node has a subset of the universe and access to an expensive resource for downloading data. Nodes can also acquire the universe by exchanging copies of segments among themselves, at low cost, using inter-node links. While exchanges over inter-node links ensure minimum cost, some nodes in the group try to exploit the system. We term such nodes as non-reciprocating nodes' and prohibit such behavior by proposing the give-and-take' criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the problem of maximizing the number of nodes with the universe at the end of local exchanges. First, we present a randomized algorithm that is shown to be optimal in the asymptotic regime. Then, we present greedy links algorithm, which performs well for most of the scenarios and yields an optimal result when the number of nodes is four. The polygon algorithm is proposed, which yields an optimal result when each of the nodes has a unique segment. After presenting some intuitive algorithms (e.g., greedy incremental algorithm and rarest first algorithm), we compare the performances of all proposed algorithms with the optimal. Copyright (c) 2015 John Wiley & Sons, Ltd.

Time-Resolved Resonance Raman Spectroscopic Studies on the Radical Anions of Menaquinone and Naphthoquinone

Quinones and their radical ion intermediates have been much studied by vibrational spectroscopy to understand their structure-function relationships in various biological processes. In this paper, we present a comprehensive analysis of vibrational spectra in the structure-sensitive region of both the naphthoquinone (NQ) and 2-methyl-1,4-naphthoquinone (MQ, menaquinone) radical anions using time-resolved resonance Raman and ab initio studies. Specific vibrational mode assignments have been made to all the vibrational frequencies recorded in the experiment. It is observed that the carbonyl and C-C stretching frequencies show considerable coupling in NQ and MQ radical anions. Further, the asymmetric substitution present in MQ with respect to NQ shows important signatures in the radical anion spectrum. It is concluded that assignments of vibrational frequencies of asymmetrically substituted quinones must take into consideration the influence of asymmetry on structure and reactivity.

Regolith mass balance inferred from combined mineralogical, geochemical and geophysical studies: Mule Hole gneissic watershed, South India

The aim of this study is to propose a method to assess the long-term chemical weathering mass balance for a regolith developed on a heterogeneous silicate substratum at the small experimental watershed scale by adopting a combined approach of geophysics, geochemistry and mineralogy. We initiated in 2003 a study of the steep climatic gradient and associated geomorphologic features of the edge of the rifted continental passive margin of the Karnataka Plateau, Peninsular India. In the transition sub-humid zone of this climatic gradient we have studied the pristine forested small watershed of Mule Hole (4.3 km(2)) mainly developed on gneissic substratum. Mineralogical, geochemical and geophysical investigations were carried out (i) in characteristic red soil profiles and (ii) in boreholes up to 60 m deep in order to take into account the effect of the weathering mantle roots. In addition, 12 Electrical Resistivity Tomography profiles (ERT), with an investigation depth of 30 m, were generated at the watershed scale to spatially characterize the information gathered in boreholes and soil profiles. The location of the ERT profiles is based on a previous electromagnetic survey, with an investigation depth of about 6 m. The soil cover thickness was inferred from the electromagnetic survey combined with a geological/pedological survey. Taking into account the parent rock heterogeneity, the degree of weathering of each of the regolith samples has been defined using both the mineralogical composition and the geochemical indices (Loss on Ignition, Weathering Index of Parker, Chemical Index of Alteration). Comparing these indices with electrical resistivity logs, it has been found that a value of 400 Ohm m delineates clearly the parent rocks and the weathered materials, Then the 12 inverted ERT profiles were constrained with this value after verifying the uncertainty due to the inversion procedure. Synthetic models based on the field data were used for this purpose. The estimated average regolith thickness at the watershed scale is 17.2 m, including 15.2 m of saprolite and 2 m of soil cover. Finally, using these estimations of the thicknesses, the long-term mass balance is calculated for the average gneiss-derived saprolite and red soil. In the saprolite, the open-system mass-transport function T indicates that all the major elements except Ca are depleted. The chlorite and biotite crystals, the chief sources for Mg (95%), Fe (84%), Mn (86%) and K (57%, biotite only), are the first to undergo weathering and the oligoclase crystals are relatively intact within the saprolite with a loss of only 18%. The Ca accumulation can be attributed to the precipitation of CaCO3 from the percolating solution due to the current and/or the paleoclimatic conditions. Overall, the most important losses occur for Si, Mg and Na with -286 x 10(6) mol/ha (62% of the total mass loss), -67 x 10(6) mol/ha (15% of the total mass loss) and -39 x 10(6) mol/ha (9% of the total mass loss), respectively. Al, Fe and K account for 7%, 4% and 3% of the total mass loss, respectively. In the red soil profiles, the open-system mass-transport functions point out that all major elements except Mn are depleted. Most of the oligoclase crystals have broken down with a loss of 90%. The most important losses occur for Si, Na and Mg with -55 x 10(6) mol/ha (47% of the total mass loss), -22 x 10(6) mol/ha (19% of the total mass loss) and -16 x 10(6) mol/ha (14% of the total mass loss), respectively. Ca, Al, K and Fe account for 8%, 6%, 4% and 2% of the total mass loss, respectively. Overall these findings confirm the immaturity of the saprolite at the watershed scale. The soil profiles are more evolved than saprolite but still contain primary minerals that can further undergo weathering and hence consume atmospheric CO2.

Co-ordinate Interleaved Distributed Space-Time Coding for Two-Antenna-Relays Networks

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different antennas of the same relay are processed and designed independently, even though the antennas are colocated. In this paper, a wireless relay network with single antenna at the source and the destination and two antennas at each of the R relays is considered. A new class of distributed space time block codes called Co-ordinate Interleaved Distributed Space-Time Codes (CIDSTC) are introduced where, in the first phase, the source transmits a T-length complex vector to all the relays;and in the second phase, at each relay, the in-phase and quadrature component vectors of the received complex vectors at the two antennas are interleaved and processed before forwarding them to the destination. Compared to the scheme proposed by Jing-Hassibi, for T >= 4R, while providing the same asymptotic diversity order of 2R, CIDSTC scheme is shown to provide asymptotic coding gain with the cost of negligible increase in the processing complexity at the relays. However, for moderate and large values of P, CIDSTC scheme is shown to provide more diversity than that of the scheme proposed by Jing-Hassibi. CIDSTCs are shown to be fully diverse provided the information symbols take value from an appropriate multidimensional signal set.

A Survey Of Software Dependability

This paper presents on overview of the issues in precisely defining, specifying and evaluating the dependability of software, particularly in the context of computer controlled process systems. Dependability is intended to be a generic term embodying various quality factors and is useful for both software and hardware. While the developments in quality assurance and reliability theories have proceeded mostly in independent directions for hardware and software systems, we present here the case for developing a unified framework of dependability—a facet of operational effectiveness of modern technological systems, and develop a hierarchical systems model helpful in clarifying this view. In the second half of the paper, we survey the models and methods available for measuring and improving software reliability. The nature of software “bugs”, the failure history of the software system in the various phases of its lifecycle, the reliability growth in the development phase, estimation of the number of errors remaining in the operational phase, and the complexity of the debugging process have all been considered to varying degrees of detail. We also discuss the notion of software fault-tolerance, methods of achieving the same, and the status of other measures of software dependability such as maintainability, availability and safety.