Computer Science and Engineering

<p>Shiv Nadar University is a comprehensive, multidisciplinary, research-focused, and student-centric University offering a full range of academic programs at the undergraduate, postgraduate and doctoral level. With state-of-the-art infrastructure, the University comprises of academic wings, sophisticated labs, international standard sports facilities, amphitheaters, auditorium, conference rooms and smart classrooms. The University&rsquo;s goal is to become internationally recognized for the quality of its research and creative endeavors and their applicability to improving quality of life, generating new insights and expanding the boundaries of human knowledge creativity. Committed to excellence in teaching, research and service, the University aims to serve the higher education needs of India and the world beyond.</p>

Shiv Nadar University

The paper presents an information extraction system that takes input from Hindi texts and improves the information content retrieved by using anaphor/pronoun resolution mechanism. The information extraction system developed consists of three major modules: The language Parser, Resolution System and Information Extractor. The language parser used is HPSG (Head-Driven Phrase Structure Grammar) based that provides both syntactic and semantic information to the anaphor resolution system. HPSG was chosen because it provides a set of constraint on the co-referential structures in the language, which bounds the search for an antecedent to a more precise location in the discourse. The semantic information included in its parsing may be helpful for removing ambiguity in anaphor/pronoun resolution. The anaphor resolution system uses few heuristic rules to resolve intrasentential references while centering theory is used for intersentential resolution.

World University root node

(SoE) School of Engineering

Proceedings of the 4th International Conference on Language Resources and Evaluation, LREC 2004

Information extraction from Hindi texts

The advent of e-commerce has brought about a radical change in the process of auctions. There is a trend towards automation in the process of auctions. Agents are widely used in this automation process. Case-based reasoning is a process which provides a user a method to automate the process of bidding. This process has an inherent learning component. CBR combined with a bidding agent for strategizing the bidding functionality provides a flexible solution for automating the bidding process for any type of auction in any domain. This paper proposes a generic bidding agent which can participate in the auction. The proposed solution is based on CBR learning technique and software agents.

Proceedings of the IASTED International Conference. Applied Informatics

CBR based automatic bidding in auctions

In this paper a study on the references is performed. An algorithm has been developed to find the referent of implicit anaphora. A representation of noun storage in knowledgebase is devised. The algorithm is designed to identify the presence of implicit anaphora, and is implemented in C++. A prototype lexicon has been designed. The algorithm worked well for test inputs. The results are presented. © 2003 Taylor & Francis Group, LLC.

IETE Journal of Research

Pronominal referent interpretation system for english text

An algorithm, implementable in parallel, for sign detection in nonredundant residue number systems is presented. The new approach in this paper completely avoids the expensive process of the mixed radix conversion (MRC), yielding a significant saving in the process time. An advancement in LSI technology supports the possible parallel realization of the algorithm. © 1986.

Computers and Electrical Engineering

Sign detection in residue code

A new approach for correcting multiple errors and detecting an additive overflow in the Residue Number System (RNS) is suggested. It works with the code whose redundancy is in the form of magnitude indices. The residue representation of a number with magnitude index is reconsidered. The RNS with magnitude index were first studied by Sasaki16 and Rao15 and then by Barsi and Maestrini5, 6. The range of a given RNS is divided into intervals of equal width and the magnitude of a number X is defined as a integer locating X into one of such intervals. We have proposed algorithm which detects and corrects multiple errors in residue number. The algorithms for special cases viz., single burst residue error and single residue error are also suggested. Some of the advantages are pointed out over the existing approaches. © 1985 IEEE.

Proceedings - Symposium on Computer Arithmetic

Multiple error correction and additive overflow detection with magnitude indices in residue code

This paper describes the general schemes for implementing the basic modular operations of addition, subtraction and multiplication in the Residue Number System (RNS). We use semiconductor logic gates in the proposed implementations. A comparative study has been carried out between the proposed schemes and the schemes known hitherto. © 1984.

Implementation schemes for basic modular operations

SIGN DETECTION IN NON-REDUNDANT RESIDUE NUMBER SYSTEM WITH REDUCED INFORMATION.

In this paper, an implementation scheme involving decoders and residue adders has been suggested to convert input data in fixed radix representation to residue representation. A method dealing with the reverse process is also demonstrated. A comparison has been made with the methods known hitherto. © 1982.

Conversion schemes in residue code

The algebraic sign detection of a number in the Symmetric Residue Number System is considered. A new approach has been suggested which completely avoids the time consuming process of the Symmetric Mixed Radix Conversion (SMRC). An algorithm based on the above approach implementable in parallel for sign detection is also presented. The hardware representation of the above algorithm is shown. The time and hardware complexity required for the process have also been computed.

Conference Proceedings - Annual Symposium on Computer Architecture

SIGN DETECTION IN THE SYMMETRIC RESIDUE NUMBER SYSTEM.

<p>Tweakable block ciphers are important primitives for designing cryptographic schemes with high security. In the absence of a standardized tweakable block cipher, constructions built from classical block ciphers remain an interesting research topic in both theory and practice. Motivated by Mennink's F[2] publication from 2015, Wang et al. proposed 32 optimally secure constructions at ASIACRYPT'16, all of which employ two calls to a classical block cipher each. Yet, those constructions were still limited to n-bit keys and n-bit tweaks. Thus, applications with more general key or tweak lengths still lack support. This work proposes the XHX family of tweakable block ciphers from a classical block cipher and a family of universal hash functions, which generalizes the constructions by Wang et al. First, we detail the generic XHX construction with three independently keyed calls to the hash function. Second, we show that we can derive the hash keys in efficient manner from the block cipher, where we generalize the constructions by Wang et al.; finally, we propose efficient instantiations for the used hash functions.</p>