The Experts below are selected from a list of 11973 Experts worldwide ranked by ideXlab platform

Han Ding - One of the best experts on this subject based on the ideXlab platform.

  • an error bounded b Spline Curve approximation scheme using dominant points for cnc interpolation of micro line toolpath
    Robotics and Computer-integrated Manufacturing, 2020
    Co-Authors: Jie Huang, Limin Zhu, Han Ding
    Abstract:

    Abstract This paper presents a unified framework for computing a B-Spline Curve to approximate the micro-line toolpath within the desired fitting accuracy. First, a bi-chord error test extended from our previous work is proposed to select the dominant points that govern the overall shape of the micro-line toolpath. It fully considers the geometric characteristics of the micro-line toolpath, i.e., the curvature, the curvature variation and the torsion, appropriately determining the distribution of the dominant points. Second, an initial B-Spline Curve is constructed by the dominant points in the least square sense. The fitting error is unpredictable and uncontrollable. It is classified into two types: (a) the geometric deviations between the vertices of the polygon formed by the data points and the constructed B-Spline Curve; (b) those between the edges of the polygon and the constructed B-Spline Curve. Herein, an applicable dominant point insertion is employed to keep the first geometric deviation within the specified tolerance of fitting error. A geometric deviation model extended from our previous work is developed to estimate the second geometric deviation. It can be effectively integrated into global toolpath optimization. Computational results demonstrate that the bi-chord error test applies to both the planar micro-line toolpath and the spatial micro-line toolpath, and it can greatly reduce the number of the control points. Simulation and experimental results demonstrate that the proposed B-Spline approximation approach can significantly improve machining efficiency while ensuring the surface quality.

  • look ahead interpolation of short line segments using b Spline Curve fitting of dominant points
    Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture, 2015
    Co-Authors: Huan Zhao, Limin Zhu, Han Ding
    Abstract:

    In this study, a real-time look-ahead interpolation methodology with B-Spline Curve fitting technique using the selected dominant points is proposed. First, an improved scheme for selecting the dom...

Addepalli V. N. Krishna - One of the best experts on this subject based on the ideXlab platform.

  • A big–data security mechanism based on fully homomorphic encryption using cubic Spline Curve public key cryptography
    Journal of Information and Optimization Sciences, 2018
    Co-Authors: Addepalli V. N. Krishna
    Abstract:

    In this work, a Cubic Spline Curve based Asymmetric mode encrypting data is used for Fully Homomorphic encryption on Big–Data. A steady state, one dimensional equation is integrated over a control ...

  • a big data security mechanism based on fully homomorphic encryption using cubic Spline Curve public key cryptography
    Journal of Information and Optimization Sciences, 2018
    Co-Authors: Addepalli V. N. Krishna
    Abstract:

    In this work, a Cubic Spline Curve based Asymmetric mode encrypting data is used for Fully Homomorphic encryption on Big–Data. A steady state, one dimensional equation is integrated over a control ...

  • cubic Spline Curve public key cryptography
    Journal of Discrete Mathematical Sciences and Cryptography, 2017
    Co-Authors: Addepalli V. N. Krishna, Addepalli Hari Narayana
    Abstract:

    AbstractIn this work, a cubic Spline Curve is considered for Asymmetric mode encrypting data. A CubicSpline Curve is used to generate a set of points under initial known boundary conditions. This set of points is considered as generator points. Given the field, known the generator points, considering for some time and space steps and for a considered private key, Public key will be generated based on Discrete Logarithm problem. Thus for a set of public and private keys, data can be transmitted securely with features like Authenticity of users, Security & Confidentiality of data transmitted.Going by the construction of the algorithm, Encryption is being done on blocks of data for which it consumes less computing resources. Going by complexity of the algorithm, the key length needed is about 120 bit lengths to provide sufficient strengths against cryptoanalysis.

  • window method based cubic Spline Curve public key cryptography
    International Journal of Electronics and Information Engineering, 2016
    Co-Authors: Addepalli V. N. Krishna, Addepalli Hari Narayana, Madhura K Vani
    Abstract:

    In this work, a cubic Spline Curve is considered for Asymmetric mode encrypting data. A steady state, one dimensional equation is integrated over a control volume. The derivatives of above equation form piece wise linear profile, which leads to discretization equation with corresponding weights. These weights are initially solved to generate global variables. Those global variables are used to calculate public key which in turn use the ElGamal mode of encryption. The proposed algorithm supports the features like Authenticity of users, Security & Confidentiality of data transmitted. Going by the construction of the algorithm, Encryption is being done on blocks of data for which it consumes less computing resources. Going by complexity of the algorithm, the key length needed is about 120 bit length to provide sufficient strengths against cryptanalysis.

Limin Zhu - One of the best experts on this subject based on the ideXlab platform.

  • an error bounded b Spline Curve approximation scheme using dominant points for cnc interpolation of micro line toolpath
    Robotics and Computer-integrated Manufacturing, 2020
    Co-Authors: Jie Huang, Limin Zhu, Han Ding
    Abstract:

    Abstract This paper presents a unified framework for computing a B-Spline Curve to approximate the micro-line toolpath within the desired fitting accuracy. First, a bi-chord error test extended from our previous work is proposed to select the dominant points that govern the overall shape of the micro-line toolpath. It fully considers the geometric characteristics of the micro-line toolpath, i.e., the curvature, the curvature variation and the torsion, appropriately determining the distribution of the dominant points. Second, an initial B-Spline Curve is constructed by the dominant points in the least square sense. The fitting error is unpredictable and uncontrollable. It is classified into two types: (a) the geometric deviations between the vertices of the polygon formed by the data points and the constructed B-Spline Curve; (b) those between the edges of the polygon and the constructed B-Spline Curve. Herein, an applicable dominant point insertion is employed to keep the first geometric deviation within the specified tolerance of fitting error. A geometric deviation model extended from our previous work is developed to estimate the second geometric deviation. It can be effectively integrated into global toolpath optimization. Computational results demonstrate that the bi-chord error test applies to both the planar micro-line toolpath and the spatial micro-line toolpath, and it can greatly reduce the number of the control points. Simulation and experimental results demonstrate that the proposed B-Spline approximation approach can significantly improve machining efficiency while ensuring the surface quality.

  • look ahead interpolation of short line segments using b Spline Curve fitting of dominant points
    Proceedings of the Institution of Mechanical Engineers Part B: Journal of Engineering Manufacture, 2015
    Co-Authors: Huan Zhao, Limin Zhu, Han Ding
    Abstract:

    In this study, a real-time look-ahead interpolation methodology with B-Spline Curve fitting technique using the selected dominant points is proposed. First, an improved scheme for selecting the dom...

Addepalli Hari Narayana - One of the best experts on this subject based on the ideXlab platform.

  • cubic Spline Curve public key cryptography
    Journal of Discrete Mathematical Sciences and Cryptography, 2017
    Co-Authors: Addepalli V. N. Krishna, Addepalli Hari Narayana
    Abstract:

    AbstractIn this work, a cubic Spline Curve is considered for Asymmetric mode encrypting data. A CubicSpline Curve is used to generate a set of points under initial known boundary conditions. This set of points is considered as generator points. Given the field, known the generator points, considering for some time and space steps and for a considered private key, Public key will be generated based on Discrete Logarithm problem. Thus for a set of public and private keys, data can be transmitted securely with features like Authenticity of users, Security & Confidentiality of data transmitted.Going by the construction of the algorithm, Encryption is being done on blocks of data for which it consumes less computing resources. Going by complexity of the algorithm, the key length needed is about 120 bit lengths to provide sufficient strengths against cryptoanalysis.

  • window method based cubic Spline Curve public key cryptography
    International Journal of Electronics and Information Engineering, 2016
    Co-Authors: Addepalli V. N. Krishna, Addepalli Hari Narayana, Madhura K Vani
    Abstract:

    In this work, a cubic Spline Curve is considered for Asymmetric mode encrypting data. A steady state, one dimensional equation is integrated over a control volume. The derivatives of above equation form piece wise linear profile, which leads to discretization equation with corresponding weights. These weights are initially solved to generate global variables. Those global variables are used to calculate public key which in turn use the ElGamal mode of encryption. The proposed algorithm supports the features like Authenticity of users, Security & Confidentiality of data transmitted. Going by the construction of the algorithm, Encryption is being done on blocks of data for which it consumes less computing resources. Going by complexity of the algorithm, the key length needed is about 120 bit length to provide sufficient strengths against cryptanalysis.

Tao Shuyi - One of the best experts on this subject based on the ideXlab platform.

  • Extension of uniform quadratic B-Spline Curve
    Computer-Aided Engineering, 2008
    Co-Authors: Tao Shuyi
    Abstract:

    To facilitate the shape modification of uniform quadratic B-Spline Curve,the cubic polynomial blending functions are constructed using the requirements of uniform quadratic B-Spline basis.It is an extension for the uniform quadratic B-Spline basis functions.Based on the blending functions,the piecewise polynomial Curves with shape parameters is built.By changing the values of the shape parameters,the shape of cubic polynomial Curves can be adjusted and swing at the two sides of the uniform quadratic B-Spline Curve.The instance of the continuous Curve with local adjusting parameter G1 is given.The method can enlarge the adjusting scale of uniform quadratic B-Spline Curve by adjusting the related parameters.