Abstract: Finding optimal solutions to Web Service Location Allocation Problem (WSLAP) using exhaustive algorithms and exact approaches is not practical. Computational time required to solve WSLAP using exact approaches increases exponentially with the problem size. The disclosure herein generally relates to service deployment, and, more particularly, to a method and system for web service location allocation and virtual machine deployment. The system identifies a plurality of web-services that are associated with the WSLAP and then decomposes the WSLAP to a plurality of sub-problems. For each sub-problem, the system determines at least one non-dominating solution, which are then merged to generate the solution for the WSLAP. The generated solution to the WSLAP can be used for perform Virtual Machine (VM) deployment under uncertainties, using a stochastic approach, wherein the uncertainties refer to dynamic change in requirements in terms of parameters such as but not limited to configuration, and cost.

Abstract: Existing data residency compliance techniques suffer from inherent drawbacks to discover the spread of data, understanding the data residency regulations and semantics behind them and most importantly placement of data in cloud datacenters such that it is data residency compliant. Embodiments herein provide a method and system for optimizing placement of data to a cloud datacenter complying data residency regulations. The system selects one serving cloud datacenter for a user center. The selection considers three conflicting objectives such as minimum data placement cost, provide good quality of service (i.e. latency) and to comply with data residency regulations. The system essentially covers data residency compliance problem in three phases namely, violation detection, decision support and recommendation. Herein, the system trades-offs latency with data placement cost.

Abstract: This disclosure relates generally to data anonymization using clustering techniques. In Typically, data anonymization using global recoding can overgeneralize the data. However, preservation of information while anonymization the data is of equal importance as obscuring the relevant information that can be used by the attackers. The disclosed method and system utilized attribute taxonomy tree for generalization to optimize the generalization of the records. The disclosed method uses clustering-based approach and after clustering, each cluster is solved independently using ILP model for K-Anonymization. The ILP model is solved by generalizing the value of the attributes. Sometimes, even after clustering the number of possible patterns is large, thus the disclosed method generates patterns on the fly during multiple iterations.

Abstract: System for performance-based design space composition in engineering systems includes design configuration module, explainable recommendation module and user interface module. A list of one or more system configurations is generated, each system configuration having a unique set of components that satisfy system goals and system requirements. For each system configuration, system performance values are determined based on performance enabled by each system component. A design dashboard presents the system configurations in rank order and the system performance value for each of the system configuration components.

Abstract: The disclosure relates to sequencing of asset segments of privacy policies. The asset segments are sequenced based on a set of constraints. In an embodiment the asset segments are sequenced using a set of pre-defined predecessors and a set of pre-defined successors of each asset segment through a feasible sequence generation technique and a sequence generation technique based on the constraints, wherein the constraints are preferences associated with the source entity and the target entity. Hence the disclosure bridges a communication gap between the source entity and the target entity by optimally displaying the most relevant privacy policy (mapped to the asset segments) based on the constraints associated with the source entity and the target entity. Further the disclosed system also determines a violation factor that represents a conflict between the preferences associated with the source entity and the target entity.

Abstract: System and method for logic rule formula induction on knowledge graphs for engineering system designs include receiving plurality of knowledge graphs for an engineering system. For a disconnected knowledge graph, agglomerative beam search is constrained to edges connected from node of interest, and candidate formulas are generated representing a respective edge found by the beam search engine, each formula constrained by a requirement of at least two arguments for defined formula chain length. Formula evaluation establishes whether each candidate formula is valid. Top ranked formulas are selected from the candidate formulas according to defined criteria. For well-connected graphs, a graph neural network is trained to predict first class for a query graph and second class for distractor graph. Counterfactual solver engine solves for minimum number of edits to query graph toward distractor graph which transforms predicted first class of the query graph to predicted second class.

Abstract: This disclosure relates generally to data anonymization and more particular y risk-aware data anonymization. Conventional data anonymization systems either replace PII/sensitive attributes with random values or shuffles them, that causes huge data distortion affecting the data utility. The goal of publishing data is best achieved when privacy is balanced with utility of data, Moreover, to ensure privacy, assessing the risk of disclosure is important. The proposed system provides a pipeline for analysis of data patterns to understand the associated risk level of re-identification of records. Further, based on the identified risks with the records the system anonymizes the data following a pattern based anonymization approach wherein data is clustered and for each cluster distinct patterns are identified such that the information loss is minimal.

Abstract: A system and method for synthesis and optimization of smoothed surfaced three-dimensional (3D) objects uses a trainable generative adversarial network (GAN). A generator network of the GAN includes a deconvolutional neural network configured to receive a latent vector and to generate control points and weights. A Bézier layer in the generator uses the control points and weights to generate surface points of a simulated 3D surface according to a parametric Bézier curve. A GAN discriminator network includes a convolutional neural network configured to discriminate between generated surface points and surface points corresponding to training data stored in a database. The convolutional network also predicts latent vector statistics through convolution of parameters.

Abstract: Existing data residency compliance techniques suffer from inherent drawbacks to discover the spread of data, understanding the data residency regulations and semantics behind them and most importantly placement of data in cloud datacenters such that it is data residency compliant. Embodiments herein provide a method and system for optimizing placement of data to a cloud datacenter complying data residency regulations. The system selects one serving cloud datacenter for a user center. The selection considers three conflicting objectives such as minimum data placement cost, provide good quality of service (i.e. latency) and to comply with data residency regulations. The system essentially covers data residency compliance problem in three phases namely, violation detection, decision support and recommendation.

Abstract: This disclosure relates to method and system for secure scheduling of workflows and virtual machine utilization in cloud. Scheduling of tasks in workflow comprises of heterogeneous and interdependent computational tasks. The method receives a set of workflows comprising of one or more heterogeneous tasks. Further, a set of parameters are extracted from each heterogeneous task to select a set of optimal VM type combination parameters and a set of security level combination parameters. The method selects the optimized combination of VM types, security service levels and task order. Further, a workflow schedule is generated for the tasks of the selected VM type combinations. The method further performs optimal selection of VM types and security services, with efficient schedule generation, and effectively reuses VM with reduced overall cost without delay in make span. Additionally, the method enhances security model with accurate risk estimation.

Abstract: The disclosure relates to a method and a system for sequencing asset segments of privacy policy using optimization techniques. The asset segments are sequenced based on several constraints associated with preferences of a source entity and a target entity. Further the disclosure also determines a target entity violation factor that represents a conflict between the preferences associated with the source entity and the target entity. In an embodiment the disclosed method and system optimally sequences the plurality of asset segments using several optimization techniques that include a basic sequence generation technique, a source entity sequence optimizing technique and a target entity sequence optimizing technique considering constraints. Hence the disclosure bridges a communication gap between several stakeholders by optimally displaying the most relevant privacy policy (mapped to the asset segments) considering the constraints or preferences associated with both the source entity and the target entity.

Abstract: System and method for latent bias detection by artificial intelligence modeling of human decision making using time series prediction data and events data of survey participants along with personal characteristics data for the participants. A deep Bayesian model solves for a bias distribution that fits a modeled prediction distribution of time series event data and personal characteristics data to a prediction probability distribution derived by a recurrent neural network. Sets of group bias clusters are evaluated for key features of related personal characteristics. Causal graphs are defined from dependency graphs of the key features. Bias explainability is inferred by perturbation in the deep Bayesian model of a subset of features from the causal graph, determining which causal relationships are most sensitive to alter group membership of participants.

Abstract: Finding optimal solutions to Web Service Location Allocation Problem (WSLAP) using exhaustive algorithms and exact approaches is not practical. Computational time required to solve WSLAP using exact approaches increases exponentially with the problem size. The disclosure herein generally relates to service deployment, and, more particularly, to a method and system for web service location allocation and virtual machine deployment. The system identifies a plurality of web-services that are associated with the WSLAP and then decomposes the WSLAP to a plurality of sub-problems. For each sub-problem, the system determines at least one non-dominating solution, which are then merged to generate the solution for the WSLAP. The generated solution to the WSLAP can be used for perform Virtual Machine (VM) deployment under uncertainties, using a stochastic approach, wherein the uncertainties refer to dynamic change in requirements in terms of parameters such as but not limited to configuration, and cost.

Abstract: This disclosure relates generally to data anonymization using clustering techniques. In Typically, data anonymization using global recoding can overgeneralize the data. However, preservation of information while anonymization the data is of equal importance as obscuring the relevant information that can be used by the attackers. The disclosed method and system utilized attribute taxonomy tree for generalization to optimize the generalization of the records. The disclosed method uses clustering-based approach and after clustering, each cluster is solved independently using ILP model for K-Anonymization. The ILP model is solved by generalizing the value of the attributes. Sometimes, even after clustering the number of possible patterns is large, thus the disclosed method generates patterns on the fly during multiple iterations.

Abstract: This disclosure relates generally to data anonymization and more particular y risk-aware data anonymization. Conventional data anonymization systems either replace PII/sensitive attributes with random values or shuffles them, that causes huge data distortion affecting the data utility. The goal of publishing data is best achieved when privacy is balanced with utility of data, Moreover, to ensure privacy, assessing the risk of disclosure is important. The proposed system provides a pipeline for analysis of data patterns to understand the associated risk level of re-identification of records. Further, based on the identified risks with the records the system anonymizes the data following a pattern based anonymization approach wherein data is clustered and for each cluster distinct patterns are identified such that the information loss is minimal.

Abstract: System and method for performance-based design space composition in engineering systems includes an explainable recommendation module configured to generate a list of one or more system configurations, each system configuration comprising a unique set of components that satisfy system goals and system requirements. The system configurations are based on received seed designs and specification of system design requirements. For each system configuration, system performance values are determined based on performance enabled by each system component. The system configurations are ranked according system performance values. A design dashboard presents the system configurations in rank order, and for each system configuration, the system performance value for each of the system configuration components.

Abstract: System and method for conversational dialog in an engineering systems design includes a design bot configured to generate a design dashboard on a graphical user interface that presents a textual representation of system design view information with a rendering of system design view components. A dialog box feature of the dashboard receives a plain text string conveying a user request for a system design view of system elements and properties of the system elements. The design bot translates plain text of the user request to a vectorized contextual user request using context defined for design activity goals with respect to elements of the system design. System design view information is retrieved from a design repository based on the vectorized user request. A plain text string response to the user request conveying system design information relevant to the system design is displayed in the dialog box.

Abstract: This disclosure relates generally to selection of cloud service providers in a multi-cloud. The selection of cloud service providers (CSPs) in a multi-cloud environment is challenging as it depends on multiple criteria such as security, usability, latency, and service cost. In an embodiment, for each CSP and multi-CSP combination, two decision problems are solved; namely, a VM selection problem and a cloud region selection problem, taking latency requirement and DR laws constraints into consideration. By solving the VM selection and CC selection problems, the service cost and the user to cloud region mapping are estimated. Using said estimates and other qualitative criteria, a multi-cloud multi-criteria decision problem is solved using MCDM techniques to rank the CSP combinations for each application. Based on the ranks and a constraint on a service cost of the entity one of a CSP and a CSP combination is selected for each application.

Abstract: The disclosure relates to a method and a system for sequencing asset segments of privacy policy using optimization techniques. The asset segments are sequenced based on several constraints associated with preferences of a source entity and a target entity. Further the disclosure also determines a target entity violation factor that represents a conflict between the preferences associated with the source entity and the target entity. In an embodiment the disclosed method and system optimally sequences the plurality of asset segments using several optimization techniques that include a basic sequence generation technique, a source entity sequence optimizing technique and a target entity sequence optimizing technique considering constraints. Hence the disclosure bridges a communication gap between several stakeholders by optimally displaying the most relevant privacy policy (mapped to the asset segments) considering the constraints or preferences associated with both the source entity and the target entity.

Abstract: The disclosure relates to sequencing of asset segments of privacy policies. The asset segments are sequenced based on a set of constraints. In an embodiment the asset segments are sequenced using a set of pre-defined predecessors and a set of pre-defined successors of each asset segment through a feasible sequence generation technique and a sequence generation technique based on the constraints, wherein the constraints are preferences associated with the source entity and the target entity. Hence the disclosure bridges a communication gap between the source entity and the target entity by optimally displaying the most relevant privacy policy (mapped to the asset segments) based on the constraints associated with the source entity and the target entity. Further the disclosed system also determines a violation factor that represents a conflict between the preferences associated with the source entity and the target entity.