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

The partial list colouring conjecture due to Albertson, Grossman, and Haas [1] states that for every s-choosable graph G and every assignment of lists of size t, 1 ≤ t ≤ s, to the vertices of G there is an induced subgraph of G on at least (formula presented) vertices which can be properly coloured from these lists. In this paper, we show that the partial list colouring conjecture holds true for certain classes of graphs like claw-free graphs, graphs with chromatic number at least (formula presented), chordless graphs, and series-parallel graphs. © 2015 Australian National University. All rights reserved.

World University root node

Department of Computer Science and Engineering

Fulltext

Electronic Journal of Combinatorics

Partial list colouring of certain graphs

Graph algorithms have been shown to possess enough parallelism to keep several computing resources Busy - even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues,we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations. © 2015 ACM.

ACM Transactions on Architecture and Code Optimization

Falcon: A graph manipulation language for heterogeneous systems

arXiv preprint arXiv:1510.

Fundamental results for a generic implementation of barriers using optical interconnects

Indian Statistical Institute, Kolkata

Some Results on Combinatorial Batch Codes and Permutation Binomials over Finite Fields

This study contemplates prevailing BIM (Building Information Management) development practices at the pre-maturity. BIM stimuli set by developers have zero attention towards integrating qualitative features and induce pessimistic/optimistic information processing. Also, an archival analysis showed that the survey-based methodology, which is predominantly used to assess industry readiness, does not pay adequate attention towards externalities (procurement, policy, technical and organizational contexts) and hence is not comprehensive enough to lead BIM development towards viable strategies. The 'contextual-reflection' is used to describe the effect of externalities and their governing effect towards practitioners' attitudes and state-level BIM strategies. A preliminary study done in South Africa substantiated these arguments. Integrating the findings with the Technology Adoption Model and BIM's Levels of Development, a conceptual framework is suggested to evaluate industry readiness in a holistic manner.

Department of Civil Engineering

Procedia Engineering

Reflection on BIM Development Practices at the Pre-maturity

7th International Forum on Engineering Education (IFEE2015) Jointly with 3rd Towards Sustainable Development (3rd TSD2015) Conference

A Comparative Study Between the Structured and Adhoc Method of Student Feedback Mechanisms on the Lecturer and Course Evaluation

The transverse field Ising and XY models (the simplest quantum spin models) provide the organising principle for the rich variety of interconnected subjects which are covered in this book. From a generic introduction to in-depth discussions of the subtleties of the transverse field Ising and related models, it includes the essentials of quantum dynamics and quantum information. A wide range of relevant topics has also been provided: quantum phase transitions, various measures of quantum information, the effects of disorder and frustration, quenching dynamics and the Kibble-Zurek scaling relation, the Kitaev model, topological phases of quantum systems, and bosonisation. In addition, it also discusses the experimental studies of transverse field models (including the first experimental realisation of quantum annealing) and the recent realisation of the transverse field Ising model using tunable Josephson junctions. Further, it points to the obstacles still remaining to develop a successful quantum computer. © Amit Dutta, Gabriel Aeppli, Bikas K. Chakrabarti, Uma Divakaran, Thomas F. Rosenbaum and Diptiman Sen 2015.

Department of Physics

Quantum Phase Transitions in Transverse Field Spin Models: From Statistical Physics to Quantum Information

Quantum phase transitions in transverse field spin models: From statistical physics to quantum information

Let π: X → C be a relatively minimal non-isotrivial elliptic surface over the field of complex numbers, where g(C) ≥ 2. In this article, we demonstrate an equivalence between the category of semistable parabolic Higgs bundles on C, and the category of semistable Higgs bundles on X with vanishing second Chern class, and determinant a vertical divisor. © 2015. Published by Oxford University Press. All rights reserved.

Department of Mathematics

Quarterly Journal of Mathematics

On higgs bundles on elliptic surfaces

This paper addresses a robust tracking control of an autonomous underwater vehicle-manipulator system (UVMS) based on terminal sling mode control in task space along with a disturbance observer. The effectiveness of the proposed scheme is demonstrated using numerical simulations having a serial planar manipulator (two rotary joints) on an underwater vehicle in a horizontal plane. An inverse dynamic solution for the system is obtained using the Newton-Euler method incorporating hydrodynamic and dynamic coupling effects. Performance of the proposed scheme is compared under various control schemes and demonstrated numerically for a predefined trajectory of the end effector (in task space). © 2015 ACM.

Department of Mechanical Engineering

ACM International Conference Proceeding Series

A robust task space position tracking control of an underwater vehicle manipulator system

This paper proposes a modular lightweight three degrees of freedom (DOF) vertical planar parallel robotic manipulator with a singularity free working region and that which is partially decoupled. It also addresses the inverse dynamics of the proposed manipulator supported by a robust sliding mode control along with an active disturbance compensation which has been improvised for the proposed vertical planar parallel robotic manipulator in the presence of parameter uncertainties and external disturbances. Disturbance vector comprising of disturbances due to the system dynamic variations namely payload and parameter variations, frictional effects and other additional (unmodelled) effects have been estimated and compensated through the disturbance observer. To demonstrate the effectiveness of the proposed controller, simulations and experiments with a desired characteristic trajectory are performed and, the proposed controller performances have been compared with traditional controllers and recent developed controllers to illustrate the usefulness and efficacy of the proposed controller. © 2015 Elsevier Ltd. All rights reserved.