Growing pseudo-eigenmodes and positive logarithmic norms in rotating shear flows

Rotating shear flows, when angular momentum increases and angular velocity decreases as functions of radiation coordinate, are hydrodynamically stable under linear perturbation. The Keplerian flow is an example of such a system, which appears in an astrophysical context. Although decaying eigenmodes exhibit large transient energy growth of perturbation which could govern nonlinearity in the system, the feedback of inherent instability to generate turbulence seems questionable. We show that such systems exhibiting growing pseudo-eigenmodes easily reach an upper bound of growth rate in terms of the logarithmic norm of the involved non-normal operators, thus exhibiting feedback of inherent instability. This supports the existence of turbulence of hydrodynamic origin in the Keplerian accretion disc in astrophysics. Hence, this answers the question of the mismatch between the linear theory and experimental/observed data and helps in resolving the outstanding question of the origin of turbulence therein.

Seismic horizontal pullout capacity of vertical anchors in sands

The problem of finding the horizontal pullout capacity of vertical anchors embedded in sands with the inclusion of pseudostatic horizontal earthquake body forces, was tackled in this note. The analysis was carried out using an upper bound limit analysis, with the consideration of two different collapse mechanisms: bilinear and composite logarithmic spiral rupture surfaces. The results are presented in nondimensional form to find the pullout resistance with changes in earthquake acceleration for different combinations of embedment ratio of the anchor (lambda), friction angle of the soil (phi), and the anchor-soil interface wall friction angle (delta). The pullout resistance decreases quite substantially with increases in the magnitude of the earthquake acceleration. For values of delta up to about 0.25-0.5phi, the bilinear and composite logarithmic spiral rupture surfaces gave almost identical answers, whereas for higher values of delta, the choice of the logarithmic spiral provides significantly smaller pullout resistance. The results compare favorably with the existing theoretical data.

Volume Change behaviour in Calcitic Soil influenced with Sulphuric Acid using Artificial Neural Networks

This paper elucidates the methodology of applying artificial neural network model (ANNM) to predict the percent swell of calcitic soil in sulphuric acid solutions, a complex phenomenon involving many parameters. Swell data required for modelling is experimentally obtained using conventional oedometer tests under nominal surcharge. The phases in ANN include optimal design of architecture, operation and training of architecture. The designed optimal neural model (3-5-1) is a fully connected three layer feed forward network with symmetric sigmoid activation function and trained by the back propagation algorithm to minimize a quadratic error criterion.The used model requires parameters such as duration of interaction, calcite mineral content and acid concentration for prediction of swell. The observed strong correlation coefficient (R2 = 0.9979) between the values determined by the experiment and predicted using the developed model demonstrates that the network can provide answers to complex problems in geotechnical engineering.

Efficient external memory structures for range-aggregate queries

We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R-d, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The aggregates we consider in this paper include COUNT, sum, and MAX. First, we develop a structure for answering two-dimensional range-COUNT queries that uses O(N/B) disk blocks and answers a query in O(log(B) N) I/Os, where N is the number of input points and B is the disk block size. The structure can be extended to obtain a near-linear-size structure for answering range-sum queries using O(log(B) N) I/Os, and a linear-size structure for answering range-MAX queries in O(log(B)(2) N) I/Os. Our structures can be made dynamic and extended to higher dimensions. (C) 2012 Elsevier B.V. All rights reserved.

The projective plane, J-holomorphic curves and Desargues' theorem

By a theorem of Gromov, for an almost complex structure J on CP2 tamed by the standard symplectic structure, the J-holomorphic curves representing the positive generator of homology form a projective plane. We show that this satisfies the Theorem of Desargues if and only if J is isomorphic to the standard complex structure. This answers a question of Ghys. (C) 2013 Published by Elsevier Masson SAS on behalf of Academie des sciences.

A questioning based method to automatically acquire expert assembly diagnostic knowledge

In the domain of manual mechanical assembly, expert knowledge is an important means of supporting assembly planning that leads to fewer issues during actual assembly. Knowledge based systems can be used to provide assembly planners with expert knowledge as advice. However, acquisition of knowledge remains a difficult task to automate, while manual acquisition is tedious, time-consuming, and requires engagement of knowledge engineers with specialist knowledge to understand and translate expert knowledge. This paper describes the development, implementation and preliminary evaluation of a method that asks a series of questions to an expert, so as to automatically acquire necessary diagnostic and remedial knowledge as rules for use in a knowledge based system for advising assembly planners diagnose and resolve issues. The method, called a questioning procedure, organizes its questions around an assembly situation which it presents to the expert as the context, and adapts its questions based on the answers it receives from the expert. (C) 2014 Elsevier Ltd. All rights reserved.

UNO Gets Easier for a Single Player

This work is a follow up to 2, FUN 2010], which initiated a detailed analysis of the popular game of UNO (R). We consider the solitaire version of the game, which was shown to be NP-complete. In 2], the authors also demonstrate a (O)(n)(c(2)) algorithm, where c is the number of colors across all the cards, which implies, in particular that the problem is polynomial time when the number of colors is a constant. In this work, we propose a kernelization algorithm, a consequence of which is that the problem is fixed-parameter tractable when the number of colors is treated as a parameter. This removes the exponential dependence on c and answers the question stated in 2] in the affirmative. We also introduce a natural and possibly more challenging version of UNO that we call ``All Or None UNO''. For this variant, we prove that even the single-player version is NP-complete, and we show a single-exponential FPT algorithm, along with a cubic kernel.

Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis

Counter systems are a well-known and powerful modeling notation for specifying infinite-state systems. In this paper we target the problem of checking liveness properties in counter systems. We propose two semi decision techniques towards this, both of which return a formula that encodes the set of reachable states of the system that satisfy a given liveness property. A novel aspect of our techniques is that they use reachability analysis techniques, which are well studied in the literature, as black boxes, and are hence able to compute precise answers on a much wider class of systems than previous approaches for the same problem. Secondly, they compute their results by iterative expansion or contraction, and hence permit an approximate solution to be obtained at any point. We state the formal properties of our techniques, and also provide experimental results using standard benchmarks to show the usefulness of our approaches. Finally, we sketch an extension of our liveness checking approach to check general CTL properties.

An Algorithmic Characterization of Polynomial Functions over Z(pn)

In this paper we consider polynomial representability of functions defined over , where p is a prime and n is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to determine whether a given function over is polynomially representable or not, and (ii) finds the polynomial if it is polynomially representable. The previous characterizations given by Kempner (Trans. Am. Math. Soc. 22(2):240-266, 1921) and Carlitz (Acta Arith. 9(1), 67-78, 1964) are existential in nature and only lead to an exhaustive search method, i.e. algorithm with complexity exponential in size of the input. Our characterization leads to an algorithm whose running time is linear in size of input. We also extend our result to the multivariate case.

Modified Einstein's gravity as a possible missing link between sub- and super-Chandrasekhar type Ia supernovae

We explore the effect of modification to Einstein's gravity in white dwarfs for the first time in the literature, to the best of our knowledge. This leads to significantly sub- and super-Chandrasekhar limiting masses of white dwarfs, determined by a single model parameter. On the other hand, type Ia supernovae (SNeIa), a key to unravel the evolutionary history of the universe, are believed to be triggered in white dwarfs having mass close to the Chandrasekhar limit. However, observations of several peculiar, under- and over-luminous SNeIa argue for exploding masses widely different from this limit. We argue that explosions of the modified gravity induced sub- and super-Chandrasekhar limiting mass white dwarfs result in under- and over-luminous SNeIa respectively, thus unifying these two apparently disjoint sub-classes and, hence, serving as a missing link. Our discovery raises two fundamental questions. Is the Chandrasekhar limit unique? Is Einstein's gravity the ultimate theory for understanding astronomical phenomena? Both the answers appear to be no!

Active learning in keyword search-based data integration

The problem of scaling up data integration, such that new sources can be quickly utilized as they are discovered, remains elusive: Global schemas for integrated data are difficult to develop and expand, and schema and record matching techniques are limited by the fact that data and metadata are often under-specified and must be disambiguated by data experts. One promising approach is to avoid using a global schema, and instead to develop keyword search-based data integration-where the system lazily discovers associations enabling it to join together matches to keywords, and return ranked results. The user is expected to understand the data domain and provide feedback about answers' quality. The system generalizes such feedback to learn how to correctly integrate data. A major open challenge is that under this model, the user only sees and offers feedback on a few ``top-'' results: This result set must be carefully selected to include answers of high relevance and answers that are highly informative when feedback is given on them. Existing systems merely focus on predicting relevance, by composing the scores of various schema and record matching algorithms. In this paper, we show how to predict the uncertainty associated with a query result's score, as well as how informative feedback is on a given result. We build upon these foundations to develop an active learning approach to keyword search-based data integration, and we validate the effectiveness of our solution over real data from several very different domains.

Capability approach-based evaluation of a biomass cook-stove design

What is the scope and responsibilities of design? This work partially answers this by employing a normative approach to design of a biomass cook stove. This study debates on the sufficiency of existing design methodologies in the light of a capability approach. A case study of a biomass cook stove Astra Ole has elaborated the theoretical constructs of capability approach, which, in turn, has structured insights from field to evaluate the product. Capability approach based methodology is also prescriptively used to design the mould for rapid dissemination of the Astra Ole.

Error exponent analysis of energy-based Bayesian decentralized spectrum sensing under fading

This paper considers decentralized spectrum sensing, i.e., detection of occupancy of the primary users' spectrum by a set of Cognitive Radio (CR) nodes, under a Bayesian set-up. The nodes use energy detection to make their individual decisions, which are combined at a Fusion Center (FC) using the K-out-of-N fusion rule. The channel from the primary transmitter to the CR nodes is assumed to undergo fading, while that from the nodes to the FC is assumed to be error-free. In this scenario, a novel concept termed as the Error Exponent with a Confidence Level (EECL) is introduced to evaluate and compare the performance of different detection schemes. Expressions for the EECL under general fading conditions are derived. As a special case, it is shown that the conventional error exponent both at individual sensors, and at the FC is zero. Further, closed-form lower bounds on the EECL are derived under Rayleigh fading and lognormal shadowing. As an example application, it answers the question of whether to use pilot-signal based narrowband sensing, where the signal undergoes Rayleigh fading, or to sense over the entire bandwidth of a wideband signal, where the signal undergoes lognormal shadowing. Theoretical results are validated using Monte Carlo simulations. (C) 2015 Elsevier B.V. All rights reserved.

El Concilio Vaticano II : remembranza y actualización

Resumen: Retomando la propuesta de su libro del año 2002, Vaticano II: Remembranza y Actualización y poniendo la mirada sobre el tema del Congreso del Centenario, que es abordar la cuestión del Concilio desde la memoria, el presente y las perspectivas que se abren para el futuro de la Iglesia, el profesor Madrigal nos propone en esta conferencia un ejercicio de memoria, un intento de respuesta a los temas que se deben actualizar y, a la vez, una mirada sobre el desafío a la pregunta del papa Francisco “¿cómo seguir adelante?”. En cuatro momentos desplegará esas cuestiones: 1) la realidad teológica de la institución conciliar; 2) una sistematización o lectura esencial de la doctrina conciliar; 3) el significado histórico del Vaticano II como movimiento de renovación; 4) líneas de actualización para un relanzamiento de la recepción del Vaticano II

El espacio memorial de los/as desaparecidos/as : algunas perspectivas epistemológicas

Resumen: La pregunta que guía este trabajo está referida a la posibilidad de extraer algunas perspectivas epistemológicas de la producción de un espacio memorial. Su tema está relacionado con los modos de reelaboración del trauma social. El tiempo histórico al que se refiere es el de la última dictadura cívico-militar (marzo 1976-diciembre 1983). El recorrido de este aporte tiene tres partes. En la primera, se consideran las nociones de cuerpo y narración; la segunda presenta esbozos de respuestas a la pregunta planteada y la tercera, está referida brevemente a dos mujeres europeas y cristianas: Alice Domon (Francia, 1937- Argentina, 1977) y Elisabeth Käsemann (Alemania, 1947- Argentina 1977). Ambas vivieron en América Latina y pueden ser consideradas verdaderos espacios humanitarios de paz.