as a medium between people and the city, urbanscape makes a mental connection between individuals and their surroundings. it is usually difficult to conceive this mental relationship and its corresponding processes with usual methods. this study seeks to address the mental aspects of urbanscape and highlight its role and importance by using an innovative method. in this study, map-based methods...

We present an r-th root extraction algorithm over a finite field Fq. Our algorithm precomputes a primitive r-th root of unity ξ where s is the largest positive integer satisfying r|q − 1, and is applicable for the cases when s is small. The proposed algorithm requires one exponentiation for the r-th root computation and is favorably compared to the existing algorithms.

For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were proposed by Björk and Hammarling [3], for square roots of general complex matrices, and by Higham [10], for real square roots of real matrices. In this paper we further consider (the computation of) the square roots of m...

Atkin’s algorithm [2] for computing square roots in Z∗ p , where p is a prime such that p ≡ 5mod 8, has been extended by Müller [15] for the case p ≡ 9mod 16. In this paper we extend Atkin’s algorithm to the general case p ≡ 2+1mod 2, for any s ≥ 2, thus providing a complete solution for the case p ≡ 1 mod 4. Complexity analysis and comparisons with other methods are also provided.

This paper provides an acoustic study of monophthongal vowels (i e ɛ ɨ ʌ a u o) in eight South Korean dialects based on a dialectal speech corpus created by the National Institute of the Korean Language (2004-2011). The spontaneous speech data were automatically segmented by force-aligning them with phonemic transcriptions. Multiple formant values using different LPC formant ceiling settings we...

We implement the Babylonian method [1] to compute square roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for linear ordered fields.

für Naturforschung in cooperation with the Max Planck Society for the Advancement of Science under a Creative Commons Attribution 4.0 International License. Dieses Werk wurde im Jahr 2013 vom Verlag Zeitschrift für Naturforschung in Zusammenarbeit mit der Max-Planck-Gesellschaft zur Förderung der Wissenschaften e.V. digitalisiert und unter folgender Lizenz veröffentlicht: Creative Commons Namen...