Tata Consultancy Services Limited

Kishore Padmanabhan

Natarajan Vijayarangan

Muralidharan Somasundaram

Sachin Premsukh Lodha

Sunil Kumar Kopparapu

Sanjay Madhukar Kimbahune

Vijayanand Mahadeo Banahatti

Kumar Mansukhlal Vidhani

Vijayarangan Natarajan

Kalyani Mashiwal

Syed Mohammad Ghouse

Dilys Thomas

System and method for contract management in a data marketplace are disclosed. In an embodiment, the system performs refactoring of a contract, during which the system extracts terms and conditions from the contract and generates a simplified view of the contract. The system further performs a requirement validation based on the contract, during which the system determines features of data entity matches requirements specified by a first party or not, based on domain specific ontologies. If the data entity features are not matching with the requirements, then the system fetches one or more relevant attributes from a list of ontologies, verifies whether the features of entity along with the selected feature(s) satisfy the requirements or not. The system accordingly generates an agreeable requirement document as output of the requirement validation.

Method and system for contract management in a data marketplace

Systems and methods for computing data privacy-utility tradeoff is disclosed. Large data hubs like data marketplace are a source of data that may be of utility to data buyers. However, output data provided to data sellers is required to meet the privacy requirements of data sellers and at the same time maintain a level of utility to data buyers. Conventionally known methods of achieving data privacy tend to suppress components of data that may result in reduced utility of the data. Systems and methods of the present disclosure compute this tradeoff to establish need for data transformation, if any, before data is shared with data sellers.

Systems and methods for computing data privacy-utility tradeoff

A system and method for quantification ofbacteria in water is disclosed. In an embodiment, a region of interest (ROI) is obtained from an image of the water. For example, the ROI includes a plurality of pixels in the image of water contaminated withbacteria. Further, a plurality of red pixels are identified from the ROI based on a value of the plurality of pixels in the ROI and a threshold value. Furthermore, total redness of the plurality of red pixels in the ROI is calculated based on intensity of plurality of red pixels. In addition, a redness factor indicative of a degree of redness of the ROI is computed based on the calculated total redness. Quantification of thebacteria is then estimated based on the computed redness factor.

[object Object]

Method and system for determining the number of computing resources for executing a plurality of jobs. In accordance with the method and the system, the plurality of jobs along with a plurality of variables associated to the plurality of jobs may be received. The plurality of variables may include a mean processing time (&#x3bc;), a standard deviation (&#x3c3;), a service level agreement (&#x3b1;), and a confidence level (1-&#x3b1;). After the receipt of the plurality of variables, an inverse parameter (&#x3b3;) may be determined using the mean processing time (&#x3bc;), the standard deviation (&#x3c3;), and the confidence level (1-&#x3b1;). Further, a queue length (k) may be computed based upon the total processing time (T), the mean processing time (&#x3bc;), the standard deviation (&#x3c3;), and the inverse parameter (&#x3b3;). Finally, the queue length (k) and the number of jobs (n) may be processed in order to determine the number of computing resources.

System and method for determining number of computing resources for executing a plurality of jobs

Method and system for determining the total processing time required for executing a plurality of jobs. In certain aspects, a set of jobs along with a mean processing time and a queue length are received. The set of jobs are distributed across computing resources based upon the queue length. A set of priority jobs is received when the execution of a subset of jobs from the set of jobs has been executed in a first processing time (T). Further, the set of priority jobs is distributed for execution across the plurality of computing resources. A second processing time (T) required for the execution of the set of priority jobs is computed. Further, a third processing time (T) required for the execution of the set of remaining jobs from the set of jobs is determined. Finally, the total processing time is determined by summing T, T, and T.

System and method for determining total processing time for executing a plurality of jobs

Method and system for determining the total processing time required for executing a plurality of jobs (n). The plurality of jobs along with a mean processing time (&#x3bc;), and a queue length (k) are received. A number of preliminary jobs (p) of the plurality of jobs (n) are distributed across computing resources based upon the queue length (k). A first processing time (T) required for the execution of the number of preliminary jobs (p) is determined. Further, a number of remaining jobs (n&#x2212;p) of the plurality of jobs (n) are distributed for execution across the plurality of computing resources. A second processing time (T) required for the execution of the set of remaining jobs (n&#x2212;p) is computed. Finally, the total processing time is determined by summing Tand T.

Growing community of inventors

Tamil Nadu, India

Kishore Padmanabhan