In this paper, we describe Transzaar - an AI powered tool that offers computer aided translation (CAT) functionality: pre-translation analysis, post-editing machine translated content, translation prediction, text aligning, extensive logging and integration with several machine translation (MT) systems. Transzaar aids a human translator to perform various language processing tasks, viz., Translation, Transliteration, Localization, and other kinds of Text Analysis tasks. Using Transzaar, human translators can post-edit the machine translated content, to improve fluency and accuracy of the translated content to match the naturalness of human translation while delivering with better turn-around time. Transzaar aids the process of post-editing, thereby increasing the productivity of human translators by 2-3 folds within couple of months of usage for certain language pairs. It collects feedback continuously, which helps the MT system to further learn and improve periodically, with the additional new generated data-set.

Sampark is machine translation system providing translations among nine pairs of Indian languages. Machine translation system is a class of natural language processing applications that is far more complex and highly compute intensive in nature. As the load on the deployed system increases, optimization becomes a challenge. Caching is one of the available options to improve the performance of a software system with increasing load which exhibit the characteristics of locality of reference. Sampark MT system being a natural language processing application exhibits this characteristic. Memcached is a well-known, simple, in-memory caching solution that has been applied to improve the performance of several distributed web applications in the past. This paper describes how memcached has been applied to improve the performance of Sampark machine translation service which is deployed on a large cluster of machines. By applying distributed caching to MT system the performance of the system has improved upto 40%.

Dashboard is an integration, validation, and visualization tool for Natural Language Processing (NLP) applications. It provides infrastructural facilities using which individual NLP modules may be evaluated and refined, and multiple NLP modules may be combined to build a large end-user NLP system. It helps the system integration team to integrate and validate the NLP system. The tool provides a visualization interface that helps the developers to profile (time and memory) each module. It helps researchers to evaluate and compare their module with the earlier versions of same module. The tool promotes reuse of existing NLP modules. Enriched Dashboard supports execution of modules on heterogeneous platforms. It supports execution of modules that are distributed i.e., located on different machines. It has a powerful notation to define the runtime properties of the NLP modules. It provides an easy-to-use graphical interface that is developed using Eclipse RCP. The user can choose a perspective (view) that allows him to perform his task better. Additionally, Eclipse RCP provides a plugin architecture, hence additional end-user functionalities can be easily added to the tool.

The author develops the concept of commutable transactions, where a user initiating a commutable transaction permits the system to commute (recorder) his transaction in relation to other concurrent transactions so that the transaction, in case it faces abortion due to conflict, can be salvaged without the user's intervention. The user specifies a limit to the commutability of his transaction. A new synchronization mechanism for distributed system, called time-pad, is developed which allows a user to express the commutability of his transaction and reduces the probability of its eventual rejection. The two-phase lock synchronization scheme and the timestamp synchronization scheme can be viewed as special cases of the time-pad synchronization scheme. It is a user-controlled synchronization mechanism which can be tuned to improve the performance of those distributed database systems where the communication delay is large and the probability of transaction conflict is high.

Article Timestamp based certification schemes for transactions in distributed database systems Share on Authors: Mukul K. Sinha National Center for Software Technology, Tata Institute of Fundamental Research, Pom Bhabha Road, Bombay National Center for Software Technology, Tata Institute of Fundamental Research, Pom Bhabha Road, BombayView Profile , P. D. Nandikar Indian Institute of Technology, Pawal, Bombay Indian Institute of Technology, Pawal, BombayView Profile , S. L. Mehndiratta Indian Institute of Technology, Pawal, Bombay Indian Institute of Technology, Pawal, BombayView Profile Authors Info & Claims SIGMOD '85: Proceedings of the 1985 ACM SIGMOD international conference on Management of dataMay 1985 Pages 402–411https://doi.org/10.1145/318898.318990Published:01 May 1985 16citation443DownloadsMetricsTotal Citations16Total Downloads443Last 12 Months4Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

The concept of atomic actions is decomposed into database-dependent atomic actions and application-dependent atomic actions. There is a broad class of application-dependent atomic actions that can have nonunique solutions. These are resource coordination problems and are classified as problems of NU class. It is argued that a transaction modeling a problem of NU class provides lower concurrency. A concept of coordination is proposed which can model a broad range of NU class problems. An object model and a protocol are sugested which utilize the nonunique character of the solution to provide higher concurrency.

Deadlock handling is an important component of transaction management in a database system. In this paper, we contribute to the development of techniques for transaction management by presenting an algorithm for detecting deadlocks in a distributed database system. The algorithm uses priorities for transactions to minimize the number of messages initiated for detecting deadlocks. It does not construct any wait-for graph but detects cycles by an edge-chasing method. It does not detect any phantom deadlock (in the absence of failures), and for the resolution of deadlocks it does not need any extra computation. The algorithm also incorporates a post-resolution computation that leaves information characterizing dependence relations of remaining transactions of the deadlock cycle in the system, and this will help in detecting and resolving deadlocks which may arise in the future. An interesting aspect of this algorithm is that it is possible to compute the exact number of messages generated for a given deadlock configuration. The complexity is comparable to the best algorithm reported. We first present a basic algorithm and then extend it to take into account shared and exclusive lock modes, simultaneous acquisition of multiple locks, and nested transactions.

A methodology has been proposed for solving database problems requiring only approximate solutions. Data items are classified as sensitive and nonsensitive. An approximate transaction modifies only the nonsensitive data items which need not satisfy strong consistency constraints, and provides results only up to a degree of approximation. Further, it is shown that such an approach improves the performance in situations where transaction conflicts are frequent. Additionally, the methodology provides users as well as data managers with mechanisms to control the precision of the computation, preserving the qualitative characteristics of the data items.

Abstract In this paper we present some issues encountered in the implementation of a kernel for a multiprocessor system using a high level language called CCNPASCAL. We present the nature of the problem concerning each issue, the solutions we adopted and possible better alternatives which we could not adopt for various reasons.