Abstract: An approach to determine the service demand of various resources of any individual server (present in a cluster of servers), given the overall transaction throughput and utilization values of these resources, in case of a network load balanced scenario is disclosed. The method proposes a quantitative approach to calculate the transaction throughput of each network load balanced server from the overall transaction throughput, obtained from any commercial performance testing tool. The individual transaction throughputs are calculated using monitored values of network related performance counters of each server and the load balancer obtained from performance testing. Service demands of the resource can be computed using the Utilization law of Queuing Theory once the throughput of that server and utilization of that resource is obtained.

Abstract: Tasks for a business process can be decomposed into subtasks represented by messages. Message processing can be throttled in a heterogeneous environment. For example, message processing at subtask nodes can be individually throttled at the node level by controlling the number of instances of subtask processors for the subtask node. An infrastructure built with framework components can be used for a variety of business process tasks, separating business logic from the framework logic. Thus, intelligent scalability across platform types can be provided for large scale business processes with reduced development time and resources.

Abstract: Enterprise data and syndicated data can be integrated by obtaining enterprise data, obtaining syndicated data from a syndicated data provider, performing various processing on the enterprise and syndicated data such as recast processing, fringe compensation, event identification, and/or event matching, and outputting results. A data integration framework for integrating enterprise data, syndicated data, and/or unstructured data can be provided. The framework can comprise a plurality of data extractors and a data integration module. The data integration module can be configured to perform syndicated data recast processing on the syndicated data, perform fringe compensation processing on the syndicated data, identify consumption events in the processed syndicated data, and match shipment events to consumption events. Results of the matching can be stored and reported.

Abstract: A method for handling cross-cutting concerns at business level while developing enterprise application is disclosed. The method identifies the common variation requirements for the common cross cutting business concerns. The method then identifies the architecture strategies to enable identified variations and based on those strategies define an architecture with well defined variation points and finally define mechanisms for bundling such variations. The proposed solution describes how business aspects can be developed for applying cross cutting business concerns using the Infosys RADIEN Framework.

Abstract: A method for disseminating Early Warning Messages (EWMs) to subscriber terminals by an Early Warning Unit (EWU) in a mobile communication network is provided. The method comprises identifying at least one base station in a first region and sending a trigger signal to the identified base station for initiating the dissemination of the EWMs. The method further comprises sending an invitation request to one or more peer base stations in a second region and receiving subscriber details from one or more base stations. The method furthermore comprises selectively disseminating the EWMs to the one or more subscriber terminals based on location details of the subscriber terminals using a grid computing architecture. The grid computing architecture facilitates parallel dissemination of the EWMs to the one or more subscriber terminals by splitting the subscriber details into one or more data fragments.

Abstract: A method for rapid processing and transport of large XML files is provided. The method enables splitting an XML file into a plurality of records by a client module. The method further enables parsing each record to obtain a wrapper object. Next, the wrapper object is transported by the client module to a server module. Then, mapping information is populated at the client module based on path information of the wrapper object at the server module. Further, the mapping information is provided from the client module to the server module and records are accessed at the server module using the mapping information.

Abstract: A system and method for automatically generating the universe from the documented MS-Excel file is disclosed. The methods for the Generate Universe, Migrate Universe, Update Universe and Document Universe are disclosed. The method helps in reduction of build effort of the project and removes the problem of corruption of the universe file of link being lost. The method provides easy maintenance of the universe versions and multi-user development environments and updating of universe files.

Abstract: A framework for supporting transition of one or more applications of an organization is provided. The one or more applications are transitioned from a first set of users to a second set of users. The framework includes a transition module, a knowledge capture module, a knowledge validation module, and a collaboration module. The transition module generates one or more transition plans based on information corresponding to the one or more applications. The knowledge capture module captures a plurality of knowledge elements corresponding to the one or more applications. The knowledge capture module further establishes association between the plurality of knowledge elements. The knowledge validation module validates the plurality of knowledge elements and their association. The collaboration module provides collaboration between the first set of users and the second set of users during the transition of the one or more applications.

Abstract: A method and system for managing projects on a network platform that enables a buyer to make a buy request for a project on a network platform. The buy request includes various requirements of the project. In response to the buy request, various sellers provide submissions for the project on the network platform. The submissions may be utilized by the buyer of the project. Various sellers can provide the submissions that comply with one or more requirements of the project. The buyer utilizes the submissions to execute the project, based on their compliance with the requirements of the project, and provides compensation to the sellers.

Abstract: A system for data exchange in multiprocessor computer system is disclosed. The system includes at least one processing module adapted to communicate with at least one of a plurality of routing modules or a plurality of buffer modules or both and at least one communicating interfaces to facilitate data exchange in multiprocessor computer system.

Abstract: A method for adaptive data masking of a database is provided. The method comprises extracting data from a first database and providing one or more predefined rules for masking the extracted data. The method further comprises masking a first portion of extracted data using a trained Artificial Neural Network (ANN), where the ANN is trained for masking at least one database having properties similar to the first database. The masked and unmasked data is aggregated to arrive at an output structurally similar to the extracted data. The method furthermore comprises determining a deviation value between the arrived output and expected output of the extracted data, and adapting the trained ANN automatically according to data masking requirements of the first database, if the deviation value is more than a predefined value.

Abstract: The present invention provides a method, system and computer program product for generating a family of questions for a programming language. Generating the family of questions includes the generation of various questions from a particular compilable code, and the corresponding options for the questions. The options include various correct and incorrect options for the questions.

Abstract: A method for scheduling a plurality of computation jobs to a plurality of data processing units (DPUs) in a grid computing system 100. The method includes receiving a first computation job by a scheduling DPU from the plurality of computation jobs. Further, the method includes scheduling the first computation job at a first set of DPUs in the grid computing system based on first scheduling criteria. Furthermore, the method includes scheduling the first computation job at a first DPU from the first set of DPUs based on second scheduling criteria. The method also includes storing information about the first computation job and the first set of DPUs in a history table at the scheduling DPU. The method further includes storing information about the first DPU in a demand matrix of the first set of DPUs.

Abstract: A method to shape one or more features of Web 2.0 in the form of Web 2.0 solutions, using Web 2.0 realization framework, to the plurality of enterprises is disclosed. The method includes identifying the respective enterprises computing infrastructure and a business application needs of the respective enterprises. The respective enterprises current support system is also measured to find the feasibility of implementing the features of the Web 2.0. The method further comprises offering one or more Web 2.0 features to the respective enterprises based on the business activity. The method includes providing the Web Realization Cycle (WRC) for controlled implementation of Web 2.0 features to the respective enterprises.

Abstract: A method and system for parallel query processing is provided. The method includes estimating a number of sub-queries that may be formed corresponding to an input query. The method further includes fragmenting the input query into a plurality of sub queries by adding one or more filter predicates to the input query without altering the semantics of the input query. Further, processing of the sub queries is scheduled. Thereafter, one or more query execution plans are generated and processed. Following the processing of the query execution plans, the results of the processed sub queries are collated, aggregated and presented in a required format.

Abstract: A method for delivering location based information in wireless zone is disclosed. All the location based information is stored in the access point itself thus eliminating the need for backend server. Access point has the intelligence to deliver information in customized to each requesting device's display capability. To provide seamless access to local information the user will get a default web page once the device connects to access point and tries to access internet. This web page will act as a gateway to all the location based information available in the access point. Along with location based information advertisements can also be delivered to the end user in a very cost effective and targeted manner.

Abstract: Computing resources can be assigned to sub-plans within a query plan to effect parallel execution of the query plan. For example, computing resources in a grid can be represented by nodes, and a shortest path technique can be applied to allocate machines to the sub-plans. Computing resources can be provisionally allocated as the query plan is divided into query plan segments containing one or more sub-plans. Based on provisional allocations to the segments, the computing resources can then be allocated to the sub-plans within respective segments. Multiprocessor computing resources can be supported. The techniques can account for data locality. Both pipelined and partitioned parallelism can be addressed. Described techniques can be particularly suited for efficient execution of bushy query plans in a grid environment. Parallel processing will reduce the overall response time of the query.

Abstract: Software system facts comprising concepts, concept instances and relationships within the software system are identified and stored in a repository. The software system facts are extracted from artifacts comprising the software system or are provided through explicit definition. Architectures of the software system are recovered from the stored software system facts. Layered views of the recovered architectures are generated. The stored software system facts are checked against architectural rules to ensure architectural compliance of the software system. The impact of proposed changes to the software system is assessed by querying the identified software system facts.

Abstract: Topics in source code can be identified using Latent Dirichlet Allocation (LDA) by receiving source code, identifying domain specific keywords from the source code, generating a keyword matrix, processing the keyword matrix and the source code using LDA, and outputting a list of topics. The list of topics is output as collections of domain specific keywords. Probabilities of domain specific keywords belonging to their respective topics can also be output. The keyword matrix comprises weighted sums of occurrences of domain specific keywords in the source code.

Abstract: Software system facts comprising concepts, concept instances and relationships within the software system are identified and stored in a repository. The software system facts are extracted from artifacts comprising the software system or are provided through explicit definition. Architectures of the software system are recovered from the stored software system facts. Layered views of the recovered architectures are generated. The stored software system facts are checked against architectural rules to ensure architectural compliance of the software system. The impact of proposed changes to the software system is assessed by querying the identified software system facts.