Academic literature on the topic 'Modified Jacobian coordinates'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Modified Jacobian coordinates.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Modified Jacobian coordinates"

1

Wang, Hua Kun, and Guo Liang Yu. "Mesh Moving Scheme Based on Solving the Laplace Equation with Jacobian Stiffening Technique." Advanced Materials Research 594-597 (November 2012): 2529–36. http://dx.doi.org/10.4028/www.scientific.net/amr.594-597.2529.

Full text
Abstract:
Mesh moving scheme is an important issue in many fluid-structure interaction problems. In this paper a new mesh motion technique is presented for the effective treatment of moving mesh. The entire deformation is imposed at each time step and the motion of the internal nodes is governed by a modified Laplace equation. Finite element method is adopted to solve the Laplace equation with elemental Jacobian-based stiffening technique. Nodal coordinates are updated by using the total nodal displacements and initial coordinates. The proposed scheme has been applied to several 2D and 3D test cases inv
APA, Harvard, Vancouver, ISO, and other styles
2

Hao, Yue, Shun’an Zhong, Mingzhi Ma, et al. "Lightweight Architecture for Elliptic Curve Scalar Multiplication over Prime Field." Electronics 11, no. 14 (2022): 2234. http://dx.doi.org/10.3390/electronics11142234.

Full text
Abstract:
In this paper, we present a novel lightweight elliptic curve scalar multiplication architecture for random Weierstrass curves over prime field Fp. The elliptic curve scalar multiplication is executed in Jacobian coordinates based on the Montgomery ladder algorithm with (X,Y)-only common Z coordinate arithmetic. At the finite field operation level, the adder-based modular multiplier and modular divider are optimized by the pre-calculation method to reduce the critical path while maintaining low resource consumption. At the group operation level, the point addition and point doubling methods in
APA, Harvard, Vancouver, ISO, and other styles
3

Guglielmo, Kennon, and Nader Sadegh. "Theory and Implementation of a Repetitive Robot Controller With Cartesian Trajectory Description." Journal of Dynamic Systems, Measurement, and Control 118, no. 1 (1996): 15–21. http://dx.doi.org/10.1115/1.2801138.

Full text
Abstract:
This paper presents a new repetitive learning controller for motion control of mechanical manipulators undergoing periodic tasks defined in Cartesian space. The controller does not require knowledge of the manipulator dynamic parameters beyond a simple geometric description. The desired task will be defined in Cartesian coordinates, and no inverse kinematics or inverse Jacobian will be calculated. The asymptotic stability of this algorithm is proven using the Lyapunov approach, and the nonlinear characteristics of the manipulator are explicitly taken into account. The results of implementation
APA, Harvard, Vancouver, ISO, and other styles
4

ElMaraghy, H. A., and B. Johns. "An Investigation Into the Compliance of SCARA Robots. Part I: Analytical Model." Journal of Dynamic Systems, Measurement, and Control 110, no. 1 (1988): 18–22. http://dx.doi.org/10.1115/1.3152641.

Full text
Abstract:
A special class of robots suited for assembly tasks called SCARA (Selective Compliance Assembly Robot Arm) provides a degree of built-in flexibility due to robot structure. In such robots there are three revolute joints and a prismatic joint. They offer four degrees of freedom consisting of rotation about two vertical and parallel axes at the revolute joints, and translation and rotation about the tool axis. Some models offer additional degrees of freedom at the end effector. Structural compliance can arise due to the stiffness of the robot links, drive system, grippers as well as the assemble
APA, Harvard, Vancouver, ISO, and other styles
5

Gupta, K. C., and R. Ma. "Formulation of manipulator Jacobian using the velocity similarity principle." Robotica 8, no. 1 (1990): 81–84. http://dx.doi.org/10.1017/s0263574700007359.

Full text
Abstract:
SUMMARYVelocity similarity principle V(θ., ṡ, ub, Qb) = DabV (θ., ṡ, ua, Qa)D ab–1 is presented and used to derive several useful forms of the Jacobian matrix for the manipulator from its basic kinematic equations in 4 X 4 matrix form. The zero reference position representation is used and, therefore, the base system is the only coordinate system utilized in the derivations. For manipulators with a spherical wrist, a modified form of the Jacobian is presented in which the Jacobian columns corresponding to the regional structure are completely decoupled from those corresponding to the wrist str
APA, Harvard, Vancouver, ISO, and other styles
6

Deilami, Sara. "Online Coordination of Plug-In Electric Vehicles Considering Grid Congestion and Smart Grid Power Quality." Energies 11, no. 9 (2018): 2187. http://dx.doi.org/10.3390/en11092187.

Full text
Abstract:
This paper first introduces the impacts of battery charger and nonlinear load harmonics on smart grids considering random plug-in of electric vehicles (PEVs) without any coordination. Then, a new centralized nonlinear online maximum sensitivity selection-based charging algorithm (NOL-MSSCA) is proposed for coordinating PEVs that minimizes the costs associated with generation and losses considering network and bus total harmonic distortion (THD). The aim is to first attend the high priority customers and charge their vehicles as quickly as possible while postponing the service to medium and low
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Modified Jacobian coordinates"

1

Hitchcock, Yvonne Roslyn. "Elliptic curve cryptography for lightweight applications." Thesis, Queensland University of Technology, 2003. https://eprints.qut.edu.au/15838/1/Yvonne_Hitchcock_Thesis.pdf.

Full text
Abstract:
Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security
APA, Harvard, Vancouver, ISO, and other styles
2

Hitchcock, Yvonne Roslyn. "Elliptic Curve Cryptography for Lightweight Applications." Queensland University of Technology, 2003. http://eprints.qut.edu.au/15838/.

Full text
Abstract:
Elliptic curves were first proposed as a basis for public key cryptography in the mid 1980's. They provide public key cryptosystems based on the difficulty of the elliptic curve discrete logarithm problem (ECDLP) , which is so called because of its similarity to the discrete logarithm problem (DLP) over the integers modulo a large prime. One benefit of elliptic curve cryptosystems (ECCs) is that they can use a much shorter key length than other public key cryptosystems to provide an equivalent level of security. For example, 160 bit ECCs are believed to provide about the same level of security
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Modified Jacobian coordinates"

1

Babenko, M., A. Tchernykh, A. Redvanov, and A. Djurabaev. "Comparative analysis of the scalar point multiplication algorithms in the NIST FIPS 186 elliptic curve cryptography." In 3rd International Workshop on Information, Computation, and Control Systems for Distributed Environments 2021. Crossref, 2021. http://dx.doi.org/10.47350/iccs-de.2021.02.

Full text
Abstract:
In today's world, the problem of information security is becoming critical. One of the most common cryptographic approaches is the elliptic curve cryptosystem. However, in elliptic curve arithmetic, the scalar point multiplication is the most expensive compared to the others. In this paper, we analyze the efficiency of the scalar multiplication on elliptic curves comparing Affine, Projective, Jacobian, Jacobi-Chudnovsky, and Modified Jacobian representations of an elliptic curve. For each coordinate system, we compare Fast exponentiation, Nonadjacent form (NAF), and Window methods. We show tha
APA, Harvard, Vancouver, ISO, and other styles
2

Yongliang, Tan, He Lesheng, Jin Haonan, and Kong Qingyang. "Fast Implementation of Elliptic Curve Cryptographic Algorithm on GF(3M) Based on FPGA." In 5th International Conference on Computer Science and Information Technology (COMIT 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111709.

Full text
Abstract:
As quantum computing and the theory of bilinear pairings continue being studied in depth, elliptic curves on GF(3m ) are becoming of an increasing interest because they provide a higher security. What’s more, because hardware encryption is more efficient and secure than software encryption in today's IoT security environment, this article implements a scalar multiplication algorithm for the elliptic curve on GF(3m ) on the FPGA device platform. The arithmetic in finite fields is quickly implemented by bit-oriented operations, and then the computation speed of point doubling and point addition
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!