• Nuclear Engineering and Technology
• /
• v.15 no.1
• /
• pp.33-40
• /
• 1983

It is shown that the Shanks sequence $E_{k}$-transformation and the conventional extrapolation method are theoretically related. The $E_1$$^2$-transformation method is then applied for the multigroup diffusion problems. The diffusion code, CITATION, is modified for this study and the computing time is compared for each iteration tactics. The Equipose method, in which only sing1e inner iteration for each energy group is carried for an outer iteration, has been known as the fastest iteration method. However, in the case of 3-group problems, the proposed method, in which the number of inner iteration for the fast and thermal group is 2 and 1 respectively, gives better convergency than the Equipose method by about 12%. The double extrapolation method results in faster computing time than the single extrapolation method without computing storage problem. It is, however, to note that this method is verified only for a two-group treatment.t.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.81-92
• /
• 2002

In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member of a group may be allowed to generate signatures up to a certain number of times according to his/her position in the group. In proxy signature schemes, an original signer may want to allow a proxy signer to generate a certain number of signatures on behalf of the original signer. In the paper, we present signature schemes, called c-times signature schemes, that restrict the signing ability of a signer up to c times for pre-defined value c at set-up. The notion of c-times signature schemes are formally defined, and generic transformation from a signature scheme to a c-times signature scheme is suggested. The proposed scheme has a self-enforcement property such that if a signer generates c+1 or more signatures, his/her signature is forged. As a specific example, we present a secure c-times signature scheme $^c$DSA based on the DSA (Digital Signature Algorithm) by using a threshold scheme. Our transformation can be applied to other ElGamal-like signature schemes as well.

• Journal of International Academy of Physical Therapy Research
• /
• v.4 no.2
• /
• pp.633-639
• /
• 2013

This study aims to reveal the impact of continuous antagonist strengthening(CAS) and Evjenth-Hamberg stretching(EHS) on the cervical mobility in the university students with abnormal transformation of forward head posture(FHP). Our experiment was conducted 3 times a week for 6 weeks in a total of 20 individuals : continuous antagonist strengthening(CAS) group(n=10) & Evjenth-Hamberg stretching(EHS) group(n=10). In a pre and post comparison, both CAS group and EHS group appeared significantly in mSBI and SBA(p<.05) and the two-group comparison showed a significant difference(p<.05) : CAS group showed better effects. Thus, it is considered that the combined use with continuous antagonist strengthening(CAS) had better effects for cervical mobility than Evjenth-Hamberg stretching(EHS) alone.

• Korean Journal of Veterinary Research
• /
• v.46 no.1
• /
• pp.47-55
• /
• 2006

To evaluate method for monitoring anesthetic depth with quantitative electroencephalography (q-EEG), we recorded processed EEG (raw EEG) and pain score till 100 minutes in beagle dogs anesthetized for 60 minutes with propofol (n = 5, PRO group), isoflurane (n = 5, ISO group) and propofol-ketaminefentanyl (n = 5, PFK group). Raw EEG was converted into 95% spectral edge frequency (SEF) by fast Fourier transformation (FFT) method. We investigated anesthetic depth by comparing relationship (Pearson's correlation) between q-EEG (95% SEF) and pain score. Pearson's correlation coefficients are +0.2372 (p = 0.0494, PRO group), +0.79506 (p < 0.001, ISO group) and +0.49903 (p = 0.0039, PFK group).

• Journal of Educational Research in Mathematics
• /
• v.12 no.4
• /
• pp.509-521
• /
• 2002

The purpose of this paper is as follows: $^{\circleda}$ to disclose the essence of symmetry $^{\circledb}$ to propose the desirable strategy of problem-solving as to symmetry $^{\circledc}$ to clarify the relationship between symmetry and group $^{\circledd}$ to propose a way of introduction of 'group' in school mathematics according to its fundamental characteristic, symmetry. This study shows that the nature of symmetry is 'invariance under a transformation' and symmetry is the main idea of 'group'. In mathematics textbooks and mathematics education literature, we find out that the logic of symmetry is widespread. We illustrate two paradigmatic problem related to symmetrical logic and exemplify a desirable instruction of Pascal's triangle. This study also suggests a possibility of developing students' unformal and unconscious conception of group with sym metry idea from elementary to secondary school mathematics.

• Journal for History of Mathematics
• /
• v.26 no.4
• /
• pp.233-243
• /
• 2013

The Erlangen program is a scholastic plan by German mathematician Felix Klein, in which he, based on group theory, made a reassessment of geometry as well as an attempt to generally organize it. In this paper, I will introduce the historical and scholastic background of the Erlangen program, overview the process of its formation, and provide some comments regarding its historical significance.

• Korean Journal of Mathematics
• /
• v.6 no.1
• /
• pp.71-75
• /
• 1998

This paper is a continuation of [1]. Let ${\sigma}(X,x_0,G)$ be the fundamental group of a transformation group (X,G). Let $R({\varphi},{\psi})$ be the generalized Reidemeister number for an endomorphism $({\varphi},{\psi}:(X,G){\rightarrow}(X,G)$. The main results in this paper concern the conditions for $R({\varphi},{\psi})={\mid}Coker(1-({\varphi},{\psi})_{\bar{\sigma}}){\mid}$.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.1
• /
• pp.7-16
• /
• 2001

We study the Fourier transformation on the Gelfand-Bruhat space of type S and characterize this space by means of Fourier transform on a locally compact abelian group G. Also, we extend Bochner-Schwartz theorem to the dual space of the Gelfand-Bruhat space and the space of Fourier hyperfunctions on G. respectively.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1088-1095
• /
• 2009

In this paper, we describe the reorientation method of distorted road sign by using projection transformation for improving recognition rate of road sign. RSR (Road Sign Recognition) is one of the most important topics for implementing driver assistance in intelligent transportation systems using pattern recognition and vision technology. The RS (Road Sign) includes direction of road or place name, and intersection for obtaining the road information. We acquire input images from mounted camera on vehicle. However, the road signs are often appeared with rotation, skew, and distortion by perspective camera. In order to obtain the correct road sign overcoming these problems, projection transformation is used to transform from 4 points of image coordinate to 4 points of world coordinate. The 4 vertices points are obtained using the trajectory as the distance from the mass center to the boundary of the object. Then, the candidate areas of road sign are transformed from distorted image by using homography transformation matrix. Internal information of reoriented road signs is segmented with arrow and the corresponding indicated place name. Arrow area is the largest labeled one. Also, the number of group of place names equals to that of arrow heads. Characters of the road sign are segmented by using vertical and horizontal histograms, and each character is recognized by using SAD (Sum of Absolute Difference). From the experiments, the proposed method has shown the higher recognition results than the image without reorientation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1633-1649
• /
• 2017

In remote sensing image processing, the traditional fusion algorithm is based on the Intensity-Hue-Saturation (IHS) transformation. This method does not take into account the texture or spectrum information, spatial resolution and statistical information of the photos adequately, which leads to spectrum distortion of the image. Although traditional solutions in such application combine manifold methods, the fusion procedure is rather complicated and not suitable for practical operation. In this paper, an improved IHS transformation fusion algorithm based on the local variance weighting scheme is proposed for remote sensing images. In our proposal, firstly, the local variance of the SPOT (which comes from French "Systeme Probatoire d'Observation dela Tarre" and means "earth observing system") image is calculated by using different sliding windows. The optimal window size is then selected with the images being normalized with the optimal window local variance. Secondly, the power exponent is chosen as the mapping function, and the local variance is used to obtain the weight of the I component and match SPOT images. Then we obtain the I' component with the weight, the I component and the matched SPOT images. Finally, the final fusion image is obtained by the inverse Intensity-Hue-Saturation transformation of the I', H and S components. The proposed algorithm has been tested and compared with some other image fusion methods well known in the literature. Simulation result indicates that the proposed algorithm could obtain a superior fused image based on quantitative fusion evaluation indices.