Abstract

This paper talks over an efficient VLSI realization of the simplified arithmetic radix-2 Decimation In Time (DIT) Fast Fourier Transform (FFT) technique. High performance FFT processors are used in several types of signal processing, and in order to fulfil these performance demands, the processor must be parallel and pipelined. This enhanced radix-2 method is used to create an improved ASIC design that implements a fully pipelined and parallel architecture for the hardware realization of a 64 point FFT. This scheme uses lesser multipliers by reducing bit-width of twiddle representation for improved power, area and speed with a considerable Signal to Noise Ratio (SNR). A reduction of 32.8% is obtained in the area occupied, 25.08% reduction in power consumption and 20.8% improvement in speed in comparison to the Cooley–Tukey FFT realization. Compared with serial implementation an improvement of 90

Abstract

One of the widely used peak reduction methods in smart grids is demand response, where one analyzes the shift in customers’ (agents’) usage patterns in response to the signal from the dis- tribution company. Often, these signals are in the form of incentives offered to agents. This work studies the effect of incentives on the prob- abilities of accepting such offers in a real-world smart grid simulator, PowerTAC. We first show that there exists a function that depicts the prob- ability of an agent reducing its load as a func- tion of the discounts offered to them. We call it reduction probability (RP). RP function is fur- ther parametrized by the rate of reduction (RR), which can differ for each agent. We provide an optimal algorithm, MJS–EXPRESPONSE, that outputs the discounts to each agent by maximiz- ing the expected reduction under a budget con- straint. When RRs are unknown, we propose a Multi-Armed Bandit (MAB) based online algo- rithm, namely MJSUCB–EXPRESPONSE, to learn RRs. Experimentally we show that it exhibits sub- linear regret. Finally, we showcase the efficacy of the proposed algorithm in mitigating demand peaks in a real-world smart grid system using the Power- TAC simulator as a test bed.

Abstract

Climate classification simplifies the representation of expected climate conditions by eliminating the need to describe each climatic parameter. Climate classification is frequently used as a basis for recommendations through codes and standards for buildings because a given climate has nearly similar design conditions. Furthermore, building energy efficiency programmes are designed based on the climatic classification to determine appropriate design strategies to eliminate the under-design or over-design of buildings for similar climatic regions. This necessitates the use of realistic and reliable climate classifications. Over the past two decades, numerous research studies have proposed climate classification methods. However, there is a lack of universal acceptance of climate classification methodology to balance complexity and accuracy. This research provides an overview of various climate classification …

Abstract

This work proposes a resource efficient robust control scheme for missile-target engagement scenarios subjected to external disturbances. The robustness is achieved by using an annular event-triggered artificial time-delayed control (ET-TDC) methodology with input saturation. The ET-TDC philosophy uses the TDC strategy through a dynamic predefined triggering mechanism which overcomes the requirement to update the control periodically for every sampling instant, unlike conventional TDC and other robust control schemes. Thus, the proposed methodology, can tackle uncertainties with minimal a priori knowledge while significantly reducing the over-utilization of system resources. In addition, the adopted event triggered mechanism facilitates further conservation of energy which might be crucial for mid-to-long range engagement scenarios. The closed-loop stability is derived analytically and the simulation

Abstract

In this paper we show an effective means of integrating data driven frameworks to sampling based optimal control to vastly reduce the compute time for easy adoption and adaptation to real time applications such as on-road autonomous driving in the presence of dynamic actors. Presented with training examples, a spatio-temporal CNN learns to predict the optimal mean control over a finite horizon that precludes further resampling, an iterative process that makes sampling based optimal control formulations difficult to adopt in real time settings. Generating control samples around the network-predicted optimal mean retains the advantage of sample diversity while enabling real time rollout of trajectories that avoids multiple dynamic obstacles in an on-road navigation setting. Further the 3D CNN architecture implicitly learns the future trajectories of the dynamic agents in the scene resulting in successful collision free …

Abstract

Universal Semantic Representation (USR) captures how the speaker intends to view a situation. The representation is aimed at being language-independent. The theoretical model, Universal Semantic Grammar (USG), that has been adopted for the task is based on Indian Grammatical Tradition (IGT henceforth) and Pāṇini's grammatical model. USR is not limited to just presenting “who is doing what to whom and when and where” in a sentence. It is about capturing a speaker’s vivakṣā, how the speaker views a situation. The way the speaker views a situation or an event, accordingly he/she selects kāraka roles for the participants of an event, tense-aspect-modility features on the verb, sentence structure by foregrounding and backgrounding information, also various discourse elements such as particles, connectives, co-referencing and so on. USR is a text-based data structure that is close to the Attribute Value matrix (AVM) representation. It is easier to read and write manually, as well as process computationally. This document describes the theoretical foundation of USR and the strategies that have been adopted for USR annotation

Abstract

Embodiments herein provide a system and a method for automatically generating at least one synthetic talking head video using a machine learning model. The method includes (i) extracting features from each frame of a video that is extracted from data sources,(ii) analyzing, using a face-detection model, the video to determine a driving face video if a number of identities, and faces of speakers are equal to one in all frames of the video,(iii) generating, using a text to speech model, synthetic speech utterances by automatically selecting a vocabulary of words and sentences from the data sources,(iv) modifying lip movements that are originally present in the driving face video corresponding to the synthetic speech utterances, and (v) generating, using machine learning model, synthetic talking head video based on the lip movements that are modified corresponding to the synthetic speech utterances.

Abstract

Although current deep models for face tasks surpass human performance on some benchmarks, we do not understand how they work. Thus, we cannot predict how it will react to novel inputs, resulting in catastrophic failures and unwanted biases in the algorithms. Explainable AI helps bridge the gap, but currently, there are very few visualization algorithms designed for faces. This work undertakes a first-of-its-kind meta-analysis of explainability algorithms in the face domain. We explore the nuances and caveats of adapting general-purpose visualization algorithms to the face domain, illustrated by computing visualizations on popular face models. We review existing face explainability works and reveal valuable insights into the structure and hierarchy of face networks. We also determine the design considerations for practical face visualizations accessible to AI practitioners by conducting a user study on the utility of various explainability algorithms.

Abstract

Despite rapid advances, modeling a variety of instructional designs to support variations in teaching and learning during the design of educational technologies is still an open challenge. In this paper, we propose a patterns based approach for the design of educational technologies to address this challenge. This is in contrast with existing literature that focuses either on patterns in education or in software, and not both. The core idea of our approach is to leverage patterns for modeling instructional design knowledge and to connect it with patterns in software architecture. We discuss different categories of patterns in instructional design. We then present the notion of Pattern-Oriented Instructional Design (POID) as a way to model instructional design as a connection of patterns (ProcessPattern, ContentPattern) and integrate it with Pattern-Oriented Software Architecture (POSA) based on fundamental principles in software engineering. We demonstrate our approach through adult literacy case study (287 million learners, 22 Indian Languages and a variety of instructional designs). The results of our approach (both web and mobile versions) are available at http://rice.iiit.ac.in and were transferred to

Abstract

River valley projects have a lot of promise in the seismically active Himalayan orogenic region. Some hydroelectric projects are now operational, some are in the planning stages, and a few more will be built shortly. Knowing the nature of ground motion at these locations is critical. The present study uses a probabilistic seismic hazard analysis (PSHA) technique to estimate Peak Ground Acceleration (PGA) for the three hydropower projects in Uttarakhand, Himachal Pradesh, and Jammu and Kashmir (India). Given all potential earthquakes, the aim of probabilistic seismic hazard analysis (PSHA) is to quantify the rate of surpassing certain ground motion levels at the project site. Hazard curves may be used to determine the seismic design input for a location, and they can also be used to analyze the tunnel seismic reaction.