32 resultados para ANSWER
Resumo:
Instruction reuse is a microarchitectural technique that improves the execution time of a program by removing redundant computations at run-time. Although this is the job of an optimizing compiler, they do not succeed many a time due to limited knowledge of run-time data. In this paper we examine instruction reuse of integer ALU and load instructions in network processing applications. Specifically, this paper attempts to answer the following questions: (1) How much of instruction reuse is inherent in network processing applications?, (2) Can reuse be improved by reducing interference in the reuse buffer?, (3) What characteristics of network applications can be exploited to improve reuse?, and (4) What is the effect of reuse on resource contention and memory accesses? We propose an aggregation scheme that combines the high-level concept of network traffic i.e. "flows" with a low level microarchitectural feature of programs i.e. repetition of instructions and data along with an architecture that exploits temporal locality in incoming packet data to improve reuse. We find that for the benchmarks considered, 1% to 50% of instructions are reused while the speedup achieved varies between 1% and 24%. As a side effect, instruction reuse reduces memory traffic and can therefore be considered as a scheme for low power.
Resumo:
Let G be a Kahler group admitting a short exact sequence 1 -> N -> G -> Q -> 1 where N is finitely generated. (i) Then Q cannot be non-nilpotent solvable. (ii) Suppose in addition that Q satisfies one of the following: (a) Q admits a discrete faithful non-elementary action on H-n for some n >= 2. (b) Q admits a discrete faithful non-elementary minimal action on a simplicial tree with more than two ends. (c) Q admits a (strong-stable) cut R such that the intersection of all conjugates of R is trivial. Then G is virtually a surface group. It follows that if Q is infinite, not virtually cyclic, and is the fundamental group of some closed 3-manifold, then Q contains as a finite index subgroup either a finite index subgroup of the three-dimensional Heisenberg group or the fundamental group of the Cartesian product of a closed oriented surface of positive genus and the circle. As a corollary, we obtain a new proof of a theorem of Dimca and Suciu in Which 3-manifold groups are Kahler groups? J. Eur. Math. Soc. 11 (2009) 521-528] by taking N to be the trivial group. If instead, G is the fundamental group of a compact complex surface, and N is finitely presented, then we show that Q must contain the fundamental group of a Seifert-fibered 3-manifold as a finite index subgroup, and G contains as a finite index subgroup the fundamental group of an elliptic fibration. We also give an example showing that the relation of quasi-isometry does not preserve Kahler groups. This gives a negative answer to a question of Gromov which asks whether Kahler groups can be characterized by their asymptotic geometry.
Resumo:
Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.
Resumo:
A necessary step for the recognition of scanned documents is binarization, which is essentially the segmentation of the document. In order to binarize a scanned document, we can find several algorithms in the literature. What is the best binarization result for a given document image? To answer this question, a user needs to check different binarization algorithms for suitability, since different algorithms may work better for different type of documents. Manually choosing the best from a set of binarized documents is time consuming. To automate the selection of the best segmented document, either we need to use ground-truth of the document or propose an evaluation metric. If ground-truth is available, then precision and recall can be used to choose the best binarized document. What is the case, when ground-truth is not available? Can we come up with a metric which evaluates these binarized documents? Hence, we propose a metric to evaluate binarized document images using eigen value decomposition. We have evaluated this measure on DIBCO and H-DIBCO datasets. The proposed method chooses the best binarized document that is close to the ground-truth of the document.
Resumo:
We consider four-dimensional CFTs which admit a large-N expansion, and whose spectrum contains states whose conformal dimensions do not scale with N. We explicitly reorganise the partition function obtained by exponentiating the one-particle partition function of these states into a heat kernel form for the dual string spectrum on AdS(5). On very general grounds, the heat kernel answer can be expressed in terms of a convolution of the one-particle partition function of the light states in the four-dimensional CFT. (C) 2013 Elsevier B.V. All rights reserved.
Resumo:
Is the Chandrasekhar mass limit for white dwarfs (WDs) set in stone? Not anymore, recent observations of over-luminous, peculiar type Ia supernovae can be explained if significantly super-Chandrasekhar WDs exist as their progenitors, thus barring them to be used as cosmic distance indicators. However, there is no estimate of a mass limit for these super-Chandrasekhar WD candidates yet. Can they be arbitrarily large? In fact, the answer is no! We arrive at this revelation by exploiting the flux freezing theorem in observed, accreting, magnetized WDs, which brings in Landau quantization of the underlying electron degenerate gas. This essay presents the calculations which pave the way for the ultimate (significantly super-Chandrasekhar) mass limit of WDs, heralding a paradigm shift 80 years after Chandrasekhar's discovery.
Resumo:
We introduce k-stellated spheres and consider the class W-k(d) of triangulated d-manifolds, all of whose vertex links are k-stellated, and its subclass W-k*; (d), consisting of the (k + 1)-neighbourly members of W-k(d). We introduce the mu-vector of any simplicial complex and show that, in the case of 2-neighbourly simplicial complexes, the mu-vector dominates the vector of Betti numbers componentwise; the two vectors are equal precisely for tight simplicial complexes. We are able to estimate/compute certain alternating sums of the components of the mu-vector of any 2-neighbourly member of W-k(d) for d >= 2k. As a consequence of this theory, we prove a lower bound theorem for such triangulated manifolds, and we determine the integral homology type of members of W-k*(d) for d >= 2k + 2. As another application, we prove that, when d not equal 2k + 1, all members of W-k*(d) are tight. We also characterize the tight members of W-k*(2k + 1) in terms of their kth Betti numbers. These results more or less answer a recent question of Effenberger, and also provide a uniform and conceptual tightness proof for all except two of the known tight triangulated manifolds. We also prove a lower bound theorem for homology manifolds in which the members of W-1(d) provide the equality case. This generalizes a result (the d = 4 case) due to Walkup and Kuhnel. As a consequence, it is shown that every tight member of W-1 (d) is strongly minimal, thus providing substantial evidence in favour of a conjecture of Kuhnel and Lutz asserting that tight homology manifolds should be strongly minimal. (C) 2013 Elsevier Ltd. All rights reserved.
Resumo:
How does the presence of plastic active dendrites in a pyramidal neuron alter its spike initiation dynamics? To answer this question, we measured the spike-triggered average (STA) from experimentally constrained, conductance-based hippocampal neuronal models of various morphological complexities. We transformed the STA computed from these models to the spectral and the spectrotemporal domains and found that the spike initiation dynamics exhibited temporally localized selectivity to a characteristic frequency. In the presence of the hyperpolarization-activated cyclic nucleotide-gated (HCN) channels, the STA characteristic frequency strongly correlated with the subthreshold resonance frequency in the theta frequency range. Increases in HCN channel density or in input variance increased the STA characteristic frequency and its selectivity strength. In the absence of HCN channels, the STA exhibited weak delta frequency selectivity and the characteristic frequency was related to the repolarization dynamics of the action potentials and the recovery kinetics of sodium channels from inactivation. Comparison of STA obtained with inputs at various dendritic locations revealed that nonspiking and spiking dendrites increased and reduced the spectrotemporal integration window of the STA with increasing distance from the soma as direct consequences of passive filtering and dendritic spike initiation, respectively. Finally, the presence of HCN channels set the STA characteristic frequency in the theta range across the somatodendritic arbor and specific STA measurements were strongly related to equivalent transfer-impedance-related measurements. Our results identify explicit roles for plastic active dendrites in neural coding and strongly recommend a dynamically reconfigurable multi-STA model to characterize location-dependent input feature selectivity in pyramidal neurons.
Resumo:
We compute the leading corrections to the Bekenstein-Hawking entropy of the Flat Space Cosmological (FSC) solutions in 3D flat spacetimes, which are the flat analogues of the BTZ black holes in AdS(3). The analysis is done by a computation of density of states in the dual 2D Galilean Conformal Field Theory and the answer obtained by this matches with the limiting value of the expected result for the BTZ inner horizon entropy as well as what is expected for a generic thermodynamic system. Along the way, we also develop other aspects of holography of 3D flat spacetimes.
Resumo:
For a domain Omega in C and an operator T in B-n(Omega), Cowen and Douglas construct a Hermitian holomorphic vector bundle E-T over Omega corresponding to T. The Hermitian holomorphic vector bundle E-T is obtained as a pull-back of the tautological bundle S(n, H) defined over by Gr(n, H) a nondegenerate holomorphic map z bar right arrow ker(T - z), z is an element of Omega. To find the answer to the converse, Cowen and Douglas studied the jet bundle in their foundational paper. The computations in this paper for the curvature of the jet bundle are rather intricate. They have given a set of invariants to determine if two rank n Hermitian holomorphic vector bundle are equivalent. These invariants are complicated and not easy to compute. It is natural to expect that the equivalence of Hermitian holomorphic jet bundles should be easier to characterize. In fact, in the case of the Hermitian holomorphic jet bundle J(k)(L-f), we have shown that the curvature of the line bundle L-f completely determines the class of J(k)(L-f). In case of rank Hermitian holomorphic vector bundle E-f, We have calculated the curvature of jet bundle J(k)(E-f) and also obtained a trace formula for jet bundle J(k)(E-f).
Resumo:
We affirmatively answer a question due to S. Bocherer concerning the feasibility of removing one differential operator from the standard collection of m + 1 of them used to embed the space of Jacobi forms of weight 2 and index m into several pieces of elliptic modular forms. (C) 2014 Elsevier Inc. All rights reserved.
Resumo:
We derive a multiplicity one result for quasimodular eigenforms on SL2(Z) by completing the description of all quasimodular eigenforms. As applications of our results, we complete the answer to the question of finding all quasimodular eigenforms arising as a product of two eigenforms and also give an estimate for the size of the maximum gap in the sequence of the Fourier coefficients of a quasimodular form.
Resumo:
How do we assess the capability of a compliant mechanism of given topology and shape? The kinetoelastostatic maps proposed in this paper help answer this question. These maps are drawn in 2D using two non-dimensional quantities, one capturing the nonlinear static response and the other the geometry, material, and applied forces. Geometrically nonlinear finite element analysis is used to create the maps for compliant mechanisms consisting of slender beams. In addition to the topology and shape, the overall proportions and the proportions of the cross-sections of the beam segments are kept fixed for a map. The finite region of the map is parameterized using a non-dimensional quantity defined as the slenderness ratio. The shape and size of the map and the parameterized curves inside it indicate the complete kinetoelastostatic capability of the corresponding compliant mechanism of given topology, shape, and fixed proportions. Static responses considered in this paper include input/output displacement, geometric amplification, mechanical advantage, maximum stress, etc. The maps can be used to compare mechanisms, to choose a suitable mechanism for an application, or re-design as may be needed. The usefulness of the non-dimensional maps is presented with multiple applications of different variety. Non-dimensional portrayal of snap-through mechanisms is one such example. The effect of the shape of the cross-section of the beam segments and the role of different segments in the mechanism as well as extension to 3D compliant mechanisms, the cases of multiple inputs and outputs, and moment loads are also explained. The effects of disproportionate changes on the maps are also analyzed.
Resumo:
Quantifying and characterising atomic defects in nanocrystals is difficult and low-throughput using the existing methods such as high resolution transmission electron microscopy (HRTEM). In this article, using a defocused wide-field optical imaging technique, we demonstrate that a single ultrahigh-piezoelectric ZnO nanorod contains a single defect site. We model the observed dipole-emission patterns from optical imaging with a multi-dimensional dipole and find that the experimentally observed dipole pattern and model-calculated patterns are in excellent agreement. This agreement suggests the presence of vertically oriented degenerate-transition-dipoles in vertically aligned ZnO nanorods. The HRTEM of the ZnO nanorod shows the presence of a stacking fault, which generates a localised quantum well induced degenerate-transition-dipole. Finally, we elucidate that defocused wide-field imaging can be widely used to characterise defects in nanomaterials to answer many difficult questions concerning the performance of low-dimensional devices, such as in energy harvesting, advanced metal-oxide-semiconductor storage, and nanoelectromechanical and nanophotonic devices.
Resumo:
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.