• Title/Summary/Keyword: Euclidean equation

Search Result 33, Processing Time 0.026 seconds

A Generalization of Abel's Theorem on Power Series

  • Hsiang, W.H.
    • The Mathematical Education
    • /
    • v.29 no.1
    • /
    • pp.55-61
    • /
    • 1990
  • There are three objectives of this paper. First, we present an elegant and simple generalization of Abel's theorem (i .e. tile Abel summability (on the unit disk of the euclidean plane) is regular). Second, we consider the definition of Abel summability through lim (equation omitted) which immediately has clear connexctions with CeSARO summability and Cesaro sums (equation omitted). This approach examplifies some simple aspects of so-called Tauberian theorems of divergent series. Third, we present the applications of the previous results to find the limits of transition probabilities of homogeneous Marker chain. Finally, we explain why the original Abel's theorem which looks obvious is difficult to be proved, and can not be proved analytically.

  • PDF

A Study on the Real Time Recognition of Korean Isolated Words with Filter Bank Output (필터뱅크 출력을 이용한 실시간 격리 단어 인식에 관한 연구)

  • Kim, Kye-Kook;Lee, Jong-Arc;Kahng, Seong-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.10 no.3
    • /
    • pp.5-12
    • /
    • 1991
  • In this paper, 10 city names of Korean were recognized. The name are articulated each 5 times by 10 male speakers. Filter bank output on total 500 words were extracted and they were used as feature parameters. Filter bank was constructed of 15 channels with 1/3 octave spacing from 200[Hz], using RC active circuit. Reference templates were created by clustering algorithm. DTW algorithm was used to compare similarity between reference templates and input words. Euclidean distance equation and Chebyshev distance equation were used to know the distinction between the recognition results obtained by the method of distance caculation, error rates are 16.4[%], 15.0[%], respectively.

  • PDF

Whole learning algorithm of the neural network for modeling nonlinear and dynamic behavior of RC members

  • Satoh, Kayo;Yoshikawa, Nobuhiro;Nakano, Yoshiaki;Yang, Won-Jik
    • Structural Engineering and Mechanics
    • /
    • v.12 no.5
    • /
    • pp.527-540
    • /
    • 2001
  • A new sort of learning algorithm named whole learning algorithm is proposed to simulate the nonlinear and dynamic behavior of RC members for the estimation of structural integrity. A mathematical technique to solve the multi-objective optimization problem is applied for the learning of the feedforward neural network, which is formulated so as to minimize the Euclidean norm of the error vector defined as the difference between the outputs and the target values for all the learning data sets. The change of the outputs is approximated in the first-order with respect to the amount of weight modification of the network. The governing equation for weight modification to make the error vector null is constituted with the consideration of the approximated outputs for all the learning data sets. The solution is neatly determined by means of the Moore-Penrose generalized inverse after summarization of the governing equation into the linear simultaneous equations with a rectangular matrix of coefficients. The learning efficiency of the proposed algorithm from the viewpoint of computational cost is verified in three types of problems to learn the truth table for exclusive or, the stress-strain relationship described by the Ramberg-Osgood model and the nonlinear and dynamic behavior of RC members observed under an earthquake.

Mandibular shape prediction using cephalometric analysis: applications in craniofacial analysis, forensic anthropology and archaeological reconstruction

  • Omran, Ahmed;Wertheim, David;Smith, Kathryn;Liu, Ching Yiu Jessica;Naini, Farhad B.
    • Maxillofacial Plastic and Reconstructive Surgery
    • /
    • v.42
    • /
    • pp.37.1-37.13
    • /
    • 2020
  • Background: The human mandible is variable in shape, size and position and any deviation from normal can affect the facial appearance and dental occlusion. Objectives: The objectives of this study were to determine whether the Sassouni cephalometric analysis could help predict two-dimensional mandibular shape in humans using cephalometric planes and landmarks. Materials and methods: A retrospective computerised analysis of 100 lateral cephalometric radiographs taken at Kingston Hospital Orthodontic Department was carried out. Results: Results showed that the Euclidean straight-line mean difference between the estimated position of gonion and traced position of gonion was 7.89 mm and the Euclidean straight-line mean difference between the estimated position of pogonion and the traced position of pogonion was 11.15 mm. The length of the anterior cranial base as measured by sella-nasion was positively correlated with the length of the mandibular body gonion-menton, r = 0.381 and regression analysis showed the length of the anterior cranial base sella-nasion could be predictive of the length of the mandibular body gonion-menton by the equation 22.65 + 0.5426x, where x = length of the anterior cranial base (SN). There was a significant association with convex shaped palates and oblique shaped mandibles, p = 0.0004. Conclusions: The method described in this study can be used to help estimate the position of cephalometric points gonion and pogonion and thereby sagittal mandibular length. This method is more accurate in skeletal class I cases and therefore has potential applications in craniofacial anthropology and the 'missing mandible' problem in forensic and archaeological reconstruction.

A Design of RS Decoder for MB-OFDM UWB (MB-OFDM UWB 를 위한 RS 복호기 설계)

  • Choi, Sung-Woo;Shin, Cheol-Ho;Choi, Sang-Sung
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2005.11a
    • /
    • pp.131-136
    • /
    • 2005
  • UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MB-OFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MB-OFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

  • PDF

Architecture of RS decoder for MB-OFDM UWB

  • Choi, Sung-Woo;Choi, Sang-Sung;Lee, Han-Ho
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.195-198
    • /
    • 2005
  • UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MBOFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MBOFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

  • PDF

Self Organizing Feature Map Type Neural Computation Algorithm for Travelling Salesman Problem (SOFM(Self-Organizing Feature Map)형식의 Travelling Salesman 문제 해석 알고리즘)

  • Seok, Jin-Wuk;Cho, Seong-Won;Choi, Gyung-Sam
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.983-985
    • /
    • 1995
  • In this paper, we propose a Self Organizing Feature Map (SOFM) Type Neural Computation Algorithm for the Travelling Salesman Problem(TSP). The actual best solution to the TSP problem is computatinally very hard. The reason is that it has many local minim points. Until now, in neural computation field, Hopield-Tank type algorithm is widely used for the TSP. SOFM and Elastic Net algorithm are other attempts for the TSP. In order to apply SOFM type neural computation algorithms to the TSP, the object function forms a euclidean norm between two vectors. We propose a Largrangian for the above request, and induce a learning equation. Experimental results represent that feasible solutions would be taken with the proposed algorithm.

  • PDF

Methods for On-Line Determination of Truncation Point in Steady-State Simulation Outputs (안정상태 시뮬레이션 출력 데이터의 온라인 제거 시점 결정 방법)

  • 이영해
    • Journal of the Korea Society for Simulation
    • /
    • v.7 no.1
    • /
    • pp.27-37
    • /
    • 1998
  • Simulation output is generally stochastic and autocorrelated, and includes the initial condition bias. To exclude the bias, the determination of truncation point has been one of important issues for the steady-state simulation output analysis. In this paper, two methods are presented for detection of truncation point in order to estimate efficiently the steady-state measure of simulation output. They are based on the Euclidean distance equation, and the backpropagation algorithm in Neural Networks. The experimental results obtained by M/M/1 and M/M/2 show that the proposed methods are very promising with respect to coverage and relative bias. The methods could be used for the on-line analysis of simulation outputs.

  • PDF

Security Analysis of ElGamal-Type Signature Scheme Using Integer Decomposition (정수의 분해를 이용한 ElGamal형 서명기법의 안전성 분석)

  • 이익권;김동렬
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.2
    • /
    • pp.15-22
    • /
    • 2004
  • For an ElGamal-type signature scheme using a generate g of order q, it has been well-known that the message nonce should be chosen randomly in the interval (0, q-1) for each message to be signed. In (2), H. Kuwakado and H. Tanaka proposed a polynomial time algorithm that gives the private key of the signer if two signatures with message nonces 0<$k_1$, $k_2$$\leq$Ο(equation omitted) are available. Recently, R. Gallant, R. Lambert, and S. Vanstone suggested a method to improve the efficiency of elliptic curve crytosystem using integer decomposition. In this paper, by applying the integer decomposition method to the algorithm proposed by Kuwakado and Tanaka, we extend the algorithm to work in the case when |$k_1$ |,|$k_2$, |$\leq$Ο(equation mitted) and improve the efficiency and completeness of the algorithm.

Squaring the Circle and Recognizing Right Triangles of Ancient Egyptians (고대 이집트인들의 원의 구적과 직각삼각형의 인식)

  • Park, Mingu;Park, Jeanam;Hong, Kyounghee
    • Journal for History of Mathematics
    • /
    • v.30 no.4
    • /
    • pp.221-232
    • /
    • 2017
  • In this paper, we discuss how ancient Egyptians find out the area of the circle based on $\ll$Ahmose Papyrus$\gg$. Vogel and Engels studied the quadrature of the circle, one of the basic concepts of ancient Egyptian mathematics. We look closely at the interpretation based on the approximate right triangle of Robins and Shute. As circumstantial evidence for Robbins and Shute's hypothesis, Egyptians prior to the 12th dynasty considered the perception of a right triangle as examples of 'simultaneous equation', 'unit of length', 'unit of slope', 'Egyptian triple', and 'right triangles transfer to Greece'. Finally, we present a method to utilize the squaring the circle by ancient Egyptians interpreted by Robbins and Shute as the dynamic symmetry of Hambidge.