Indian Institute of Technology Palakkad&nbsp;(IIT Palakkad or IIT PKD) is a public autonomous&nbsp;engineering&nbsp;and&nbsp;research&nbsp;institute located in&nbsp;Palakkad,&nbsp;Kerala. It was&nbsp;one of the five new&nbsp;IITs&nbsp;proposed in the&nbsp;2014 Union budget of India. The campus was inaugurated on 3 August 2015. The institute has 94 faculty, 978 students, and 63 non-teaching staffs.

IT Palakkad currently offers four-year Bachelor of Technology (B.Tech) and two years MS programmes in 8 different engineering disciplines including&nbsp;Computer Science, Electrical, Mechanical, Civil among others.

&nbsp;

IIT Palakkad

In this paper, we prove that the second eigenfunctions of the p- Laplacian, p &gt; 1, are not radial on the unit ball in RN, for any N ≥ 2. Our proof relies on the variational characterization of the second eigenvalue and a variant of the deformation lemma. We also construct an infinite sequence of eigenpairs {τn,Ψn} such that Ψn is nonradial and has exactly 2n nodal domains. A few related open problems are also stated. © 2015 American Mathematical Society.

World University root node

Department of Mathematics

Fulltext

Proceedings of the American Mathematical Society

On the structure of the second eigenfunctions of the p-laplacian on a ball

arXiv preprint arXiv:1607.

Global nilpotent cone is isotropic : parahoric torsors on curves

We have investigated the temperature and magnetic field dependence of magnetization (M), specific heat (Cp), and relative sample length change (ΔL/L0) for understanding the field-induced metamagnetic transitions in quasi-one-dimensional monoclinic (α phase) and triclinic (γ phase) CoV2O6 spin chains. With the application of external magnetic field, a sharp peak emerges in Cp(T) below TN=15K in α phase and a hump-like feature appears above TN=6.5K in γ phase due to the field-induced ferrimagnetic and ferromagnetic transitions, respectively. Strong field dependence of linear thermal expansion and large positive magnetostriction have been observed in α phase. Though magnetization data indicate strong spin-orbit coupling for both phases, other measurements show that this effect is very weak for the γ phase. © 2015 Elsevier B.V.

Department of Physics

Journal of Magnetism and Magnetic Materials

Field induced metamagnetic transitions in quasi-one-dimensional Ising spin chain CoV2O6

IC Engine valve components are generally made from Nickel based (Nimonic-80A) super alloys and these components are exposed to severe operating conditions while the engine is running. Interface fretting combined with impact wear causes major wear related failures to the valve and seat components. There is a need to predict wear of such interfaces so that their life and residual life (i.e. inspection) can be assessed. This paper focusses on a fretting wear of Nimonic-80A material line contact (cylinder-on-flat) at both room temperature and at high temperature conditions. The objective of this study is also to be able to understand the effect of interface fretting displacement, which is the key parameter that controls wear. Tests were performed at three different displacement amplitudes at room temperature (RT) and at high temperature (620°C) for 25,000 cycles. Experimental constants such as wear coefficient (k) and friction coefficient (µ) were derived from the test results. The wear and friction coefficients were then used in the wear-model to predict the wear depth. Further, this model was used to predict wear at 100,000 cycles. Predicted results are compared then with results from tests which have been run beyond 25,000 cycles (i.e. 100,000 cycles). © 2016 Elsevier Ltd

Department of Mechanical Engineering

Tribology International

High temperature fretting wear prediction of exhaust valve material

Department of Civil Engineering

Journal of Automation and Control Engineering

Development of a New Algorithm to Control Excitation of Particular Mode of a Building

A linear ordering of the vertices of a graph G separates two edges of G if both the endpoints of one precede both the endpoints of the other in the order. We call two edges {a, b} and {c, d} of G strongly independent if the set of endpoints {a, b, c, d} induces a 2K2 in G. The induced separation dimension of a graph G is the smallest cardinality of a family L of linear orders of V (G) such that every pair of strongly independent edges in G are separated in at least one of the linear orders in L. For each k ∈ ℕ, the family of graphs with induced separation dimension at most k is denoted by ISD(k). In this article, we initiate a study of this new dimensional parameter. The class ISD(1) or, equivalently, the family of graphs which can be embedded on a line so that every pair of strongly independent edges are disjoint line segments, is already an interesting case. On the positive side, we give characterizations for chordal graphs in ISD(1) which immediately lead to a polynomial time algorithm which determines the induced separation dimension of chordal graphs. On the negative side, we show that the recognition problem for ISD(1) is NP-complete for general graphs. We then briefly study ISD(2) and show that it contains many important graph classes like outerplanar graphs, chordal graphs, circular arc graphs and polygon-circle graphs. Finally, we describe two techniques to construct graphs with large induced separation dimension. The first one is used to show that the maximum induced separation dimension of a graph on n vertices is Θ(lg n) and the second one is used to construct AT-free graphs with arbitrarily large induced separation dimension. © Springer-Verlag GmbH Germany 2016.

Department of Computer Science and Engineering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Induced separation dimension

Separation dimension of a hypergraph H, denoted by π( H) , is the smallest natural number k so that the vertices of H can be embedded in Rk such that any two disjoint edges of H can be separated by a hyperplane normal to one of the axes. We show that the separation dimension of a hypergraph H is equal to the boxicity of the line graph of H. This connection helps us in borrowing results and techniques from the extensive literature on boxicity to study the concept of separation dimension. In this paper, we study the separation dimension of hypergraphs and graphs. © 2015, Springer Science+Business Media New York.

Algorithmica

Separation Dimension of Graphs and Hypergraphs

Using the theory of monoids and monoid actions, we give a unified framework that handles three common pointer manipulation tasks, namely, data serialisation, deserialisation, and memory allocation. Our main theoretical contribution is the formulation of the notion of a twisted functor, a generalisation of the semi-direct product construction for monoids. We show that semi-direct products and twisted functors are particularly well suited as an abstraction for many pointer manipulation tasks. We describe the implementation of these abstractions in the context of a cryptographic library for Haskell. Twisted functors allow us to abstract all pointer arithmetic and size calculations into a few lines of code, significantly reducing the opportunities for buffer overflows. Copyright is held by the owner/author(s).

Haskell 2016 - Proceedings of the 9th International Symposium on Haskell, co-located with ICFP 2016

How to twist pointers without breaking them

Department of Data Science

Datenbank-Spektrum

Mining Entity Rankings

We consider the problem of similarity search in a set of topk lists under the generalized Kendall's Tau distance. This distance describes how related two rankings are in terms of discordantly ordered items. We consider pair and tripletsbased indices to counter the shortcomings of naive inverted indices and derive efficient query schemes by relating the proposed index structures to the concept of locality sensitive hashing (LSH). Specifically, we devise four different LSH schemes for Kendall's Tau using two generic hash families over individual elements or pairs of them. We show that each of these functions has the desired property of being locality sensitive. Further, we discuss the selection of hash functions for the proposed LSH schemes for a given query ranking, called query-driven LSH and derive bounds for the required number of hash functions to use in order to achieve a predefined recall goal. Experimental results, using two realworld datasets, show that the devised methods outperform the SimJoin method the state of the art method to query for similar sets and are far superior to a plain inverted index-based approach.