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 mechanism and the role of KOtBu in an enantioselective NHC-catalyzed Stetter reaction between p-chlorobenzaldehyde and N-acylamido acrylate is established using DFT(M06-2X) methods. The Gibbs free energies are found to be significantly lower for transition states with explicit bound KOtBu as compared to the conventional pathways without the counterions. An intermolecular proton transfer from HOtBu to the prochiral carbon is identified as the stereocontrolling step. The computed enantioselectivities are in excellent agreement with the experimental results. © 2013 American Chemical Society.

Department of Chemistry

World University root node

Organic Letters

N-heterocyclic carbene catalyzed asymmetric intermolecular stetter reaction: Origin of enantioselectivity and role of counterions

In this document, we are primarily interested in computing the probabilities of various types of dependencies that can occur in a multi-cell infrastructure network.

Department of Computer Science and Engineering

arXiv preprint arXiv:1304.

An Analysis on the Inter-Cell Station Dependency Probability in an IEEE 802.11 Infrastructure WLANs

This work reports the results of a study envisaged to benchmark a novel technique for simultaneously estimating the principal thermal conductivities (kx, ky and kz) of an anisotropic composite medium. The technique essentially involves solving a formulated Inverse Heat Conduction Problem (IHCP) using measured temperature data as input to simultaneously estimate the constant thermal conductivities along the three directions of an anisotropic composite. The IHCP is solved using a hybrid optimization algorithm where the forward simulations are driven by a carefully chosen ANN and the optimization part is accomplished by employing GA. Before accomplishing estimation with actual \measurements"synthetically generated \surrogate temperatures are used to ascertain the adequacy and robustness of the methodology. An indigenously designed anisotropic material whose effective thermal conductivities in the principal directions are determined using a full scale computational heat transfer analysis is used as a benchmark for validating the technique.

Department of Mechanical Engineering

44th AIAA Thermophysics Conference

Benchmarking a novel technique for estimating principal thermal conductivities of an anisotropic composite medium

Department of Civil Engineering

13th World Conference on Transportation Research (WCTR 13)

Modelling network degradation using game theory-Optimal strategies at Nash equilibrium

While link capacities of urban transportation networks possess inherent randomness due to varying reasons, conventional models assume that the designed link capacities prevail. The recent developments in reliable network design require the link capacities to be treated as stochastic. It is, however, laborious to collect data to explicitly model stochastic nature of link capacities. It is also hard to relate the link-level randomness and system-level performance. A smarter alternative is to treat link capacities as random variables and search for probability distributions over such random variables which would effect in a worst case scenario. One can then assess the performance of the network at this worst case and comment on the reliability of the network. This paper formulates and solves a worst case stochastic link capacity degradation problem. The randomness involved has been modeled as the mixed strategy profile of a player in a fictitious game. The players of the game – a friend who plays for the network and a foe who plays against the network – compete each other to minimize and maximize the expected system travel time (ESTT). The foe has been modeled as an intelligent player, who knows that the network users would settle to probabilistic user equilibrium (PUE). The foe is also cautious of the friend's presence who would try to assign flows system-optimally, thereby minimizing the ESTT. The game has been formulated as a multi-level optimization equation. Different algorithms which can use the results from this methodology as inputs to establish most probable worst case states of the network have been discussed. A planner can input the results from this problem into some of the existing algorithms to identify the most probable worst case states and the probabilities associated with these states, thus defining the reliability of the network.

Procedia - Social and Behavioral Sciences

Analysis of Worst Case Stochastic Link Capacity Degradation to Aid Assessment of Transportation Network Reliability

With increased urbanization, deep foundation (bridges, signage, walls, etc.) selection is moving toward the minimization of disturbance and installation time, as well as addressing quality control and assurance issues. Unfortunately, many types of deep foundations involve noise and vibration during installation (e.g., driven piles) or integrity and reduced resistance issues (e.g., drilled shafts, both conventional and post grouted tip, continuous flight auger piles). This paper presents a new foundation type, a jetted and grouted precast pile, which uses the advantages of several proven deep foundation installation techniques. The installation of the new pile is comprised of three distinct phases: (1) pressurized water-jetting of a precast pile into the ground; (2) side grouting of the pile; and (3) tip grouting. The pile has two separate side grouting zones, each with its own grout delivery system. Each grout zone is covered with a semirigid membrane, which results in radial expansion of the soil during side grouting and horizontal orientation of the major principal stress. Small-scale testing revealed excellent bonding between the pile and the grout, as well as improved mobilized pile-soil skin and tip resistance. Both experimental and FEM modeling of the grouting and axial loading were performed on various sized jetted and grouted precast piles in cohesionless soil. On the basis of this study, a methodology that predicts expected grout pressures during grouting, unit side and tip resistance, and the load-displacement response of a pile in cohesionless soil is proposed. Further testing and research is required to validate the proposed methodology before it can be implemented in practical situations. © 2013 American Society of Civil Engineers.

Journal of Geotechnical and Geoenvironmental Engineering

Measured and predicted response of a new jetted and grouted precast pile with membranes in cohesionless soils

Leakage Temperature Dependency Aware Real-Time Scheduling for Power and Thermal Optimization

With exponentially increased transistor density on multi-core platforms, the power explosion and consequently soaring chip temperature have become critical challenges for system designers. Moreover, the increasing chip temperature results in higher leakage power, hence further aggravates the increment of the overall power consumption [1]. Thus, the dramatically growing power/energy consumption and chip temperature severely affect the cost, reliability and performance of the systems [4].

ACM SIGBED Review

Thermal-aware energy minimization for real-time scheduling on multi-core systems

Given a connected outerplanar graph G with pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). As a consequence, we get a constant factor approximation algorithm to compute a straight line planar drawing of any outerplanar graph, with its vertices placed on a two dimensional grid of minimum height. This settles an open problem raised by Biedl [3]. © 2013 Springer-Verlag Berlin Heidelberg.