• Title/Summary/Keyword: double point

Search Result 729, Processing Time 0.026 seconds

Point Quadruple Operation on Elliptic Curve Cryptography Algorithm (타원 곡선 암호 알고리즘의 네배점 스칼라 연산)

  • 문상국;허창우;유광열
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.784-787
    • /
    • 2004
  • The most time-consuming back-bone operation in an elliptic curve cryptosystem is scalar multiplication. In this paper, we propose a method of inducing a GF operation named point quadruple operation to be used in the quad-and-add algorithm, whith was achieved by refining the traditional double-and-add algorithm. Induced expression of the algorithm was verified and proven by C program in a real model of calculation. The point quadruple operation can be used in fast and efficient implementation of scalar multiplication operation.

  • PDF

Highly Efficient and Precise DOA Estimation Algorithm

  • Yang, Xiaobo
    • Journal of Information Processing Systems
    • /
    • v.18 no.3
    • /
    • pp.293-301
    • /
    • 2022
  • Direction of arrival (DOA) estimation of space signals is a basic problem in array signal processing. DOA estimation based on the multiple signal classification (MUSIC) algorithm can theoretically overcome the Rayleigh limit and achieve super resolution. However, owing to its inadequate real-time performance and accuracy in practical engineering applications, its applications are limited. To address this problem, in this study, a DOA estimation algorithm with high parallelism and precision based on an analysis of the characteristics of complex matrix eigenvalue decomposition and the coordinate rotation digital computer (CORDIC) algorithm is proposed. For parallel and single precision, floating-point numbers are used to construct an orthogonal identity matrix. Thus, the efficiency and accuracy of the algorithm are guaranteed. Furthermore, the accuracy and computation of the fixed-point algorithm, double-precision floating-point algorithm, and proposed algorithm are compared. Without increasing complexity, the proposed algorithm can achieve remarkably higher accuracy and efficiency than the fixed-point algorithm and double-precision floating-point calculations, respectively.

A duplication formula for the double gamma function $Gamma_2$

  • Park, Junesang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.289-294
    • /
    • 1996
  • The double Gamma function had been defined and studied by Barnes [4], [5], [6] and others in about 1900, not appearing in the tables of the most well-known special functions, cited in the exercise by Whittaker and Waston [25, pp. 264]. Recently this function has been revived according to the study of determinants of Laplacians [8], [11], [15], [16], [19], [20], [22] and [24]. Shintani [21] also uses this function to prove the classical Kronecker limit formula. Its p-adic analytic extension appeared in a formula of Casson Nogues [7] for the p-adic L-functions at the point 0.

  • PDF

Hybrid Group-Sequential Conditional-Bayes Approaches to the Double Sampling Plans

  • Seong-gon Ko
    • Communications for Statistical Applications and Methods
    • /
    • v.5 no.1
    • /
    • pp.107-120
    • /
    • 1998
  • This research aims here to develop a certain extended double sampling plan, EDS, which is an extension of ordinary double sampling plan in the sense that the second-stage sampling effort and second-stage critical value are allowed to depend on the point at which the first-stage continuation region is traversed. For purpose of comparison, single sampling plan, optimal ordinary double sampling plan(ODS) and sequential probability ratio test are considered with the same overall error rates, respectively. It is observed that the EDS idea allows less sampling effort than the optimal ODS.

  • PDF

ROUGH STATISTICAL CONVERGENCE OF DIFFERENCE DOUBLE SEQUENCES IN NORMED LINEAR SPACES

  • KISI, Omer;UNAL, Hatice Kubra
    • Honam Mathematical Journal
    • /
    • v.43 no.1
    • /
    • pp.47-58
    • /
    • 2021
  • In this paper, we introduce rough statistical convergence of difference double sequences in normed linear spaces as an extension of rough convergence. We define the set of rough statistical limit points of a difference double sequence and analyze the results with proofs.

Analytical methods for determination of double-K fracture parameters of concrete

  • Kumar, Shailendra;Pandey, Shashi Ranjan;Srivastava, A.K.L.
    • Advances in concrete construction
    • /
    • v.1 no.4
    • /
    • pp.319-340
    • /
    • 2013
  • This paper presents a comparative study on the double-K fracture parameters of concrete obtained using four existing analytical methods such as Gauss-Chebyshev integral method, simplified Green's function method, weight function method and simplified equivalent cohesive force method. Two specimen geometries: three point bend test and compact tension specimen for sizes 100-500 mm at initial notch length to depth ratios 0.25 and 0.4 are used for the comparative study. The required input parameters for determining the double-K fracture parameters are derived from the developed fictitious crack model. It is found that the cohesive toughness and initial cracking toughness determined using weight function method and simplified equivalent cohesive force method agree well with those obtained using Gauss-Chebyshev integral method whereas these fracture parameters determined using simplified Green's function method deviates more than by 11% and 20% respectively as compared with those obtained using Gauss-Chebyshev integral method. It is also shown that all the fracture parameters related with double-K model are size dependent.

MODIFIED DOUBLE SNAKE ALGORITHM FOR ROAD FEATURE UPDATING OF DIGITAL MAPS USING QUICKBIRD IMAGERY

  • Choi, Jae-Wan;Kim, Hye-Jin;Byun, Young-Gi;Han, You-Kyung;Kim, Yong-Il
    • Proceedings of the KSRS Conference
    • /
    • 2007.10a
    • /
    • pp.234-237
    • /
    • 2007
  • Road networks are important geospatial databases for various GIS (Geographic Information System) applications. Road digital maps may contain geometric spatial errors due to human and scanning errors, but manually updating roads information is time consuming. In this paper, we developed a new road features updating methodology using from multispectral high-resolution satellite image and pre-existing vector map. The approach is based on initial seed point generation using line segment matching and a modified double snake algorithm. Firstly, we conducted line segment matching between the road vector data and the edges of image obtained by Canny operator. Then, the translated road data was used to initialize the seed points of the double snake model in order to refine the updating of road features. The double snake algorithm is composed of two open snake models which are evolving jointly to keep a parallel between them. In the proposed algorithm, a new energy term was added which behaved as a constraint. It forced the snake nodes not to be out of potential road pixels in multispectral image. The experiment was accomplished using a QuickBird pan-sharpened multispectral image and 1:5,000 digital road maps of Daejeon. We showed the feasibility of the approach by presenting results in this urban area.

  • PDF

Shear Test on New Modified Double Tee Slabs including Service Ducts at the Ends (단부에 설비덕트를 포함하는 새로운 더블티 전단실험)

  • Kim Yun Soo;Song Hyung Soo;Ryu Jeong Wook;Lee Bo Kyung;Lee Jung Woo;Yu Sung Yong
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2005.05a
    • /
    • pp.71-74
    • /
    • 2005
  • The increasement in the floor hight may be one of the most significant problem in the use of precast concrete double slab in the multi-story buildings. The modified double-tees including duct space at the ends of slab were considered in this study. The length and thickness of nib of modified double tee was increased to receive the uniform reaction from rectangular beam, while the original PCI dapped one to receive the point load from inverted tee beam to the leg of double tee. Shear tests were performed on the ends of the modified double tees which were designed by strut-tie model. The modified double tees generally show more ductile flexural failure in the long thickened nib. It is concluded that they show superior failure patterns than that of original dapped one with shear failure.

  • PDF

Effect of Crystal Structural Environment of Pr3+ on Photoluminescence Characteristics of Double Tungstates

  • Lee, Kyoung-Ho;Chae, Ki-Woong;Cheon, Chae-Il;Kim, Jeong-Seog
    • Journal of the Korean Ceramic Society
    • /
    • v.48 no.2
    • /
    • pp.183-188
    • /
    • 2011
  • In this article, the effect of the crystal structural environment of $Pr^{3+}$ ions on the photoluminescence (PL) characteristics of double tungstates, such as $A(M_{1-X}Pr_X)W_2O_8$ (A=Li, Cs, M = In, Y, Sc, La; $0.007{\leq}x{\leq}0.1$) and $La_{1.96}Pr_{0.04}W_3O_{12}$ are characterized. By varying the ion radius in A and M sites, the structural environment of $Pr^{3+}$ ions were modified. The structural criteria, that is, the point charge electrostatic potentials V around the $Pr^{3+}$ activator, were calculated using the crystal structural parameters. The point charge potential V can be a valid criterion for $^3P_o$ quenching in various double tungstates. When the calculated V values are large (> 6.0), the luminescence from the $^3P_0$ level becomes dominant. When the calculated V values are about 3.8, the $^1D_2$ line appears weakly but $^3P_0$-level luminescence is absent. When the calculated V values are small (< 2.0), the luminescence from the $^1D_2$ level becomes dominant and $^3P_0$-level luminescence is absent. At 2.0$^3P_o$ quenching to $^1D_2$ level occurs substantially in accordance with the structural criterion of the point charge potential model.

Double Enveloping Worm Thread Tooth Machining Study using Full Face Contact Cutting Tool (전체면 접촉 절삭공구를 이용한 장구형 웜나사 치형가공 연구)

  • Kang, S.J.;Kim, Y.H.
    • Transactions of Materials Processing
    • /
    • v.29 no.3
    • /
    • pp.144-150
    • /
    • 2020
  • In this paper, we propose the generation of a double enveloping worm thread profile with a non-developable ruled surface. Thread surface machining cuts all the way from the tip to the tooth root at one time, like full-face contact machining, rather than cutting several times like point machining. This cutting can reduce the cutting duration and achieve the smooth surface that does not require a grinding process for the threaded surface. The mathematical model of the cutting process was developed from theoretical equations, and the tooth surface was generated using two parameters and modeled in the CATIA using the generated Excel data. Additionally, the machining process of the worm was simulated in a numerical control simulation system. To verify the validity of the proposed method, the deviation between the modeling and the workpiece was measured using a 3D measuring machine.