-
公开(公告)号：US20220300651A1
公开(公告)日：2022-09-22
申请号：US17401559
申请日：2021-08-13
发明人： Sutapa MONDAL , Saket Saurabh , Arun Ramamurthy , Mangesh Sharad Gharote , Sachin Premsukh Lodha
摘要： 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.
-
公开(公告)号：US12061924B2
公开(公告)日：2024-08-13
申请号：US17564475
申请日：2021-12-29
CPC分类号： G06F9/45558 , G06F9/4881 , G06F9/5077 , G06F2009/4557 , G06F2009/45595 , G06F2209/501
摘要： 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.
-
公开(公告)号：US11983278B2
公开(公告)日：2024-05-14
申请号：US17395677
申请日：2021-08-06
发明人： Saket Saurabh , Arun Ramamurthy , Sutapa Mondal , Mangesh Sharad Gharote , Sachin Premsukh Lodha
摘要： 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.
-
4.发明授权公开(公告)号：US11568084B2
公开(公告)日：2023-01-31
申请号：US17163621
申请日：2021-02-01
发明人： Arun Ramamurthy , Shree Nivas , Mangesh Sharad Gharote , Vijayanand Mahadeo Banahatti , Sachin Premsukh Lodha
摘要： 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.
-
公开(公告)号：US11948213B2
公开(公告)日：2024-04-02
申请号：US17158850
申请日：2021-01-26
发明人： Arun Ramamurthy , Shree Nivas , Mangesh Sharad Gharote , Vijayanand Mahadeo Banahatti , Sachin Premsukh Lodha
IPC分类号： G06Q50/16 , G06F40/279 , G06F40/40
CPC分类号： G06Q50/16 , G06F40/279 , G06F40/40
摘要： 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.
-
公开(公告)号：US11056147B2
公开(公告)日：2021-07-06
申请号：US16999565
申请日：2020-08-21
发明人： Shree Nivas , Vijayanand Mahadeo Banahatti , Sachin Premsukh Lodha , Gokul Chettoor Jayakrishnan , Mangesh Sharad Gharote , Arun Ramamurthy
IPC分类号： G11B27/031 , G06F16/75 , G06F40/30 , G11B27/10 , G06F40/186 , G06F40/284 , G06K9/00 , G06Q10/10
摘要： This disclosure relates generally to automatic conversion of text-based privacy policy (PP) to video format. Typically, the PP are cognitively loaded with the content and hence difficult to read and understand. The disclosed method and system facilitate in automatic conversion of text-based PP to video format. Said video formats may incorporated in animated forms for ease of understanding of the user. The disclosed system identifies segments from target PP and maps them to template PP segments stored in a template repository. The template PP segments selected from the template repository are mapped to short video templates or snippets stored in a video repository to identify video templates representative of the selected template segments. The selected video templates are sequenced in an optimal manner considering preferences and dependencies to obtain the portions of or complete target PP.
-
公开(公告)号：US12045369B2
公开(公告)日：2024-07-23
申请号：US17824968
申请日：2022-05-26
发明人： Sutapa Mondal , Shubhro Roy , Pankaj Kumar Sahu , Arun Ramamurthy , Mangesh Sharad Gharote , Sachin Premsukh Lodha
IPC分类号： G06F21/62 , H04L67/1095 , H04L67/1097
CPC分类号： G06F21/6245 , G06F21/6236 , H04L67/1095 , H04L67/1097
摘要： 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. Further, the system considers user center location, determined violation of data residency regulations, cost of movement from one datacenter to another, and a predefined threshold latency.
-
公开(公告)号：US11874951B2
公开(公告)日：2024-01-16
申请号：US17401559
申请日：2021-08-13
发明人： Sutapa Mondal , Saket Saurabh , Arun Ramamurthy , Mangesh Sharad Gharote , Sachin Premsukh Lodha
CPC分类号： G06F21/6254 , G06F18/23 , G06N5/01
摘要： 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.
-
公开(公告)号：US20230274022A1
公开(公告)日：2023-08-31
申请号：US17824968
申请日：2022-05-26
发明人： Sutapa MONDAL , Shubhro Roy , Pankaj Kumar Sahu , Arun Ramamurthy , Mangesh Sharad Gharote , Sachin Premsukh Lodha
IPC分类号： G06F21/62 , H04L67/1095 , H04L67/1097
CPC分类号： G06F21/6245 , H04L67/1095 , H04L67/1097 , G06F21/6236
摘要： 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, Further, the system considers user center location, determined violation of data residency regulations, cost of movement from one datacenter to another, and a predefined threshold latency.
-
公开(公告)号：US20220357969A1
公开(公告)日：2022-11-10
申请号：US17564475
申请日：2021-12-29
摘要： 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.
-
-
-
-
-
-
-
-
-
搜索结果
10 条记录 (耗时 0.017 秒)
