G06F17/12

SYSTEMS AND METHODS FOR REMOVING SYSTEMIC BIAS
20220342956 · 2022-10-27 ·

Disclosed herein are system, method, and computer program product embodiments that generally relate to systems and methods of removing systemic bias in a single datum and in data sets. Embodiments include systems and methods of data processing for data related to meter responses, and also to systems and methods of data processing of attitudinal data and/or analysis of questionnaire response(s), as well as systems and methods of processing and analysing statistical data, each of which can be affected by systemic bias.

SYSTEM AND METHOD FOR DATA ANONYMIZATION USING OPTIMIZATION TECHNIQUES

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.

SYSTEM AND METHOD FOR DATA ANONYMIZATION USING OPTIMIZATION TECHNIQUES

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.

Method for identifying a leakage in a conduit in which a fluid flows and system thereof
11609143 · 2023-03-21 ·

The present invention relates to a method for identifying a leakage in a conduit in which a fluid flows. Said method allows to identify a leakage in said conduit based on the mechanical deformation of a cable comprising inside at least one optical fiber, at a plurality of predetermined points of said cable, when said cable is arranged tensioned inside said conduit. The present invention also relates to a system for identifying a leakage in a conduit.

Method for identifying a leakage in a conduit in which a fluid flows and system thereof
11609143 · 2023-03-21 ·

The present invention relates to a method for identifying a leakage in a conduit in which a fluid flows. Said method allows to identify a leakage in said conduit based on the mechanical deformation of a cable comprising inside at least one optical fiber, at a plurality of predetermined points of said cable, when said cable is arranged tensioned inside said conduit. The present invention also relates to a system for identifying a leakage in a conduit.

SCHEDULING METHOD FOR UNRELATED PARALLEL MACHINE AND RELATED DEVICE THEREFOR
20230078835 · 2023-03-16 ·

A scheduling scheme for an uncorrelated parallel machine is provided in this disclosure, in which a complex overlapping relationship between time windows are analyzed deeply and the upper bound for the linear relaxation of the model is improved. A new preprocessing algorithm is designed, which can successfully schedule more objects to be processed. Specifically, firstly, the first variable indicating whether the object to be processed is scheduled to the time window corresponding to the implementer and the second variable indicating the start time when the object to be processed is allocated to the time window are introduced into the model, and then conflicts or relationships between the time windows are analyzed, the corresponding scheduling scheme can be obtained according to different situations and the scheduling can be performed according to the scheduling scheme. A new improved mixed integer linear programming model (MILP) is obtained.

SCHEDULING METHOD FOR UNRELATED PARALLEL MACHINE AND RELATED DEVICE THEREFOR
20230078835 · 2023-03-16 ·

A scheduling scheme for an uncorrelated parallel machine is provided in this disclosure, in which a complex overlapping relationship between time windows are analyzed deeply and the upper bound for the linear relaxation of the model is improved. A new preprocessing algorithm is designed, which can successfully schedule more objects to be processed. Specifically, firstly, the first variable indicating whether the object to be processed is scheduled to the time window corresponding to the implementer and the second variable indicating the start time when the object to be processed is allocated to the time window are introduced into the model, and then conflicts or relationships between the time windows are analyzed, the corresponding scheduling scheme can be obtained according to different situations and the scheduling can be performed according to the scheduling scheme. A new improved mixed integer linear programming model (MILP) is obtained.

Method of determining information about a patterning process, method of reducing error in measurement data, method of calibrating a metrology process, method of selecting metrology targets

Methods of determining information about a patterning process. In a method, measurement data from a metrology process applied to each of a plurality of metrology targets on a substrate is obtained. The measurement data for each metrology target includes at least a first contribution and a second contribution. The first contribution is from a parameter of interest of a patterning process used to form the metrology target. The second contribution is from an error in the metrology process. The method further includes using the obtained measurement data from all of the plurality of metrology targets to obtain information about an error in the metrology process, and using the obtained information about the error in the metrology process to extract a value of the parameter of interest for each metrology target.

Method of determining information about a patterning process, method of reducing error in measurement data, method of calibrating a metrology process, method of selecting metrology targets

Methods of determining information about a patterning process. In a method, measurement data from a metrology process applied to each of a plurality of metrology targets on a substrate is obtained. The measurement data for each metrology target includes at least a first contribution and a second contribution. The first contribution is from a parameter of interest of a patterning process used to form the metrology target. The second contribution is from an error in the metrology process. The method further includes using the obtained measurement data from all of the plurality of metrology targets to obtain information about an error in the metrology process, and using the obtained information about the error in the metrology process to extract a value of the parameter of interest for each metrology target.

COMPUTATION OF THREE-DIMENSIONAL EULER ANGLES THROUGH A DISTINCTIVE MATRICES PATTERN
20230130100 · 2023-04-27 ·

Systems, methods, apparatuses, and computer program products for computing three-dimensional (3D) Euler angles through a distinctive matrices pattern. A method for calculating relative orientations of rigid bodies in space may include determining a three-dimensional (3D) coordinate system of a rigid body D at a time T. The method may also include determining a 3D coordinate system of a rigid body E at time T. The method may further include determining a relative orientation at time T of the rigid body E in the 3D coordinate system of the rigid body D. In addition, the method may include calculating a final relative orientation of the rigid body E in the 3D coordinate system of the rigid body D by implementing a single set of Euler angle equations irrespective of a rotation sequence or a convention chosen.