83 resultados para Elementary Science
Resumo:
We illustrate the potential of using higher order critical points in the deeper understanding of several interesting problems of condensed matter science, e.g. critical adsorption, finite size effects, morphology of critical fluctuations, reversible aggregation of colloids, dynamics of the ordering process, etc.
Resumo:
Complexity theory is an important and growing area in computer science that has caught the imagination of many researchers in mathematics, physics and biology. In order to reach out to a large section of scientists and engineers, the paper introduces elementary concepts in complexity theory in a informal manner, motivating the reader with many examples.
Resumo:
For the most part, my research career has involved prying into the life of the locally abundant primitively eusocial paper wasp, Ropalidia marginata, with the aim of understanding the origin and evolution of social life in insects. My interest in this wasp species began as a hobby, but I was privileged to soon convert my hobby into my profession. Here I describe how this conversion came about, what it meant to pursue my hobby as a full-time activity, describe some examples from my research and end with some reflections about the process of doing modern science, especially in India.
Resumo:
An attempt is made to present some challenging problems (mainly to the technically minded researchers) in the development of computational models for certain (visual) processes which are executed with, apparently, deceptive ease by the human visual system. However, in the interest of simplicity (and with a nonmathematical audience in mind), the presentation is almost completely devoid of mathematical formalism. Some of the findings in biological vision are presented in order to provoke some approaches to their computational models, The development of ideas is not complete, and the vast literature on biological and computational vision cannot be reviewed here. A related but rather specific aspect of computational vision (namely, detection of edges) has been discussed by Zucker, who brings out some of the difficulties experienced in the classical approaches.Space limitations here preclude any detailed analysis of even the elementary aspects of information processing in biological vision, However, the main purpose of the present paper is to highlight some of the fascinating problems in the frontier area of modelling mathematically the human vision system.
Resumo:
In this paper cognitive science is defined as the study of intelligence as a computational process. The several disciplines which contribute to the study of cognitive science are briefly described so as to glean a birds-eye view of the subject of cognitive science.
Resumo:
The Indian Institute of Science at Bangalore is probably the oldest institute in India, established with a donation from the great industrial visionary Jamsetji Tata over eight decades ago. It has gradually become a key centre of scientific and engineering research and higher education. From its very inception the institute had an interdisciplinary approach to research and teaching.
Resumo:
For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex-links are stacked (d - 1)-spheres. Kalai showed that for d >= 4, all connected members of K (d) are obtained from stacked d-spheres by finitely many elementary handle additions. According to a result of Walkup, the face vector of any triangulated 4-manifold X with Euler characteristic chi satisfies f(1) >= 5f(0) - 15/2 chi, with equality only for X is an element of K(4). Kuhnel observed that this implies f(0)(f(0) - 11) >= -15 chi, with equality only for 2-neighborly members of K(4). Kuhnel also asked if there is a triangulated 4-manifold with f(0) = 15, chi = -4 (attaining equality in his lower bound). In this paper, guided by Kalai's theorem, we show that indeed there is such a triangulation. It triangulates the connected sum of three copies of the twisted sphere product S-3 (sic) S-1. Because of Kuhnel's inequality, the given triangulation of this manifold is a vertex-minimal triangulation. By a recent result of Effenberger, the triangulation constructed here is tight. Apart from the neighborly 2-manifolds and the infinite family of (2d + 3)-vertex sphere products Sd-1 X S-1 (twisted for d odd), only fourteen tight triangulated manifolds were known so far. The present construction yields a new member of this sporadic family. We also present a self-contained proof of Kalai's result. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
ASICs offer the best realization of DSP algorithms in terms of performance, but the cost is prohibitive, especially when the volumes involved are low. However, if the architecture synthesis trajectory for such algorithms is such that the target architecture can be identified as an interconnection of elementary parameterized computational structures, then it is possible to attain a close match, both in terms of performance and power with respect to an ASIC, for any algorithmic parameters of the given algorithm. Such an architecture is weakly programmable (configurable) and can be viewed as an application specific integrated processor (ASIP). In this work, we present a methodology to synthesize ASIPs for DSP algorithms. (C) 1999 Elsevier Science B.V. All rights reserved.
Resumo:
This is a review of the measurement of I If noise in certain classes of materials which have a wide range of potential applications. This includes metal films, semi-conductors, metallic oxides and inhomogeneous systems such as composites. The review contains a basic introduction to this field, the theories and models and follows it up with a discussion on measurement methods. There are discussions on specific examples of the application of noise spectroscopy in the field of materials science. (C) 2002 Elsevier Science Ltd. All rights reserved.