• Korean Journal of English Language and Linguistics
• /
• v.1 no.1
• /
• pp.145-162
• /
• 2001

The operation Move is defined in Chomsky (1999, 2000) as a composite operation consisting of three components: Agree, Identify and Merge, taking Agree as a necessary condition for Move. Therefore, I call this definition of Move as the Agree-based Move. In this paper, I argue that the Agree-based approach to Move cannot be maintained; I claim that the Selection-based approach to Move, in which the EPP-feature is analyzed as an s-selectional property of a head, offers a more natural account of the sentences under consideration. I believe that the three components of Move as defined in (6) happen to co-occur in the derivation of certain sentences, as the composite transformation called Passivization does in the derivation of a passive sentence like “the city was destroyed by the enemy.” On the basis of these observations, I conclude that Agree and Move should be regarded as separate computational operations; the task of Agree is to erase uninterpretable features of both probe and goal, and that of Move is to satisfy the EPP-feature, which should be taken as an s-selectional feature.

• Journal of Korean Society on Water Environment
• /
• v.30 no.1
• /
• pp.60-67
• /
• 2014

In this study, four methods for calculation of continuous daily flow was suggested using short-term or partial recording station of streamflow including missing data. Using these methods, standard flows at the outlet of unit/small basins for the management of total maximum daily loads (TMDLs) in Namgang dam basin were estimated from full-period flow duration curve (FDC). Four methods of extension are described, and their properties are explored. The methods are regression (REG), regression plus noise (RPN), and maintenance of variance extension types 1 and 2 (MOVE.1, MOVE.2). In these methods, the continuous daily flow was calculated using extension equation based on correlation analysis, after conducting the correlation analysis between historic record of streamflow and long-term recording station (a base station). Finally the best optimal method was selected as the MOVE.2, and the standard flows in the abundant, ordinary, low and drought flow estimated from FDC was evaluated using MOVE.2 in unit/small basins.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.8
• /
• pp.1-10
• /
• 1993

In this paper, we will propose 4-move ZKIP and its application. Using bit-commitment scheme that is necessary to organize the ZKIP related to NP-Complete problem and WH and WI preserving the property for security under parallel composition of protocols, we will show that the proposed ZKIP is 4-move ZKIP of SAT comparing to 6-move ZKIP of SAT proposed by Brassard. Chaum and Yung, and under claw-free pairs of function the proposed ZKIP is also 4-move ZKIP comparing to 5-move ZKIP proposed by Goldreich and Krawczyk under the same assumption. Moreover we will show the efficiency of the proposed scheme better than Fiat and Shamir's scheme at the points of computational complexity and communication complexity, and also propose the efficient and secure identification scheme against the chosen ciphertext attack, using the proposed scheme.

• Communications of Mathematical Education
• /
• v.5
• /
• pp.523-523
• /
• 1997

Suppose that G is a group of permutations of a set ${\Omega}$. For a finite subset ${\gamma}$of${\Omega}$, the movement of ${\gamma}$ under the action of G is defined as move(${\gamma}$):=$max\limits_{g{\epsilon}G}|{\Gamma}^{g}{\backslash}{\Gamma}|$, and ${\gamma}$ will be said to have restricted movement if move(${\gamma}$)<|${\gamma}$|. Moreover if, for an infinite subset ${\gamma}$of${\Omega}$, the sets|{\Gamma}^{g}{\backslash}{\Gamma}| are finite and bounded as g runs over all elements of G, then we may define move(${\gamma}$)in the same way as for finite subsets. If move(${\gamma}$)${\leq}$m for all ${\gamma}$${\subseteq}$${\Omega}$, then G is said to have bounded movement and the movement of G move(G) is defined as the maximum of move(${\gamma}$) over all subsets ${\gamma}$ of ${\Omega}$. Having bounded movement is a very strong restriction on a group, but it is natural to ask just which permutation groups have bounded movement m. If move(G)=m then clearly we may assume that G has no fixed points is${\Omega}$, and with this assumption it was shown in [4, Theorem 1]that the number t of G=orbits is at most 2m-1, each G-orbit has length at most 3m, and moreover|${\Omega}$|${\leq}$3m+t-1${\leq}$5m-2. Moreover it has recently been shown by P. S. Kim, J. R. Cho and C. E. Praeger in [1] that essentially the only examples with as many as 2m-1 orbits are elementary abelian 2-groups, and by A. Gardiner, A. Mann and C. E. Praeger in [2,3]that essentially the only transitive examples in a set of maximal size, namely 3m, are groups of exponent 3. (The only exceptions to these general statements occur for small values of m and are known explicitly.) Motivated by these results, we would decide what role if any is played by primes other that 2 and 3 for describing the structure of groups of bounded movement.

• International Journal of Human Ecology
• /
• v.2 no.1
• /
• pp.1-16
• /
• 2001

This study measures whether people who are expected to live in the new city of Namak are environmentally and ecologically aware, and it investigates which variables are related to their willingness to move to an ecological city. This study investigated the environmental cognition of inhabitants in Chollanam Province; it focused particularly on ecologically -oriented values, environmental knowledge, environmental management behavior, and the awareness of an ecological city. For the purposes of this study, 500 inhabitants from Mokpo, Kwangju and Muan who are expected to live in a new city of Namak were surveyed. Awareness of the ecological city was at medium level; half of the respondents were not aware of an ecological city. Multiple regression analysis was conducted to estimate the effects of the variables on the awareness of the ecological city. The most significant variable was environmental knowledge. Next, experience in environmental education and homeownership affected awareness. Half of the respondents were willing to move to an ecological city. Among all of the variables, seven variables were significantly related to the willingness to move to an ecological city.

• Korean Journal of English Language and Linguistics
• /
• v.1 no.4
• /
• pp.561-585
• /
• 2001

It has been claimed recently that the two computational operations Move and Agree of Chomsky (2000, 2001a) should be separated into distinct and independent operations. According to this view, Move is an “operation that applies only to meet an EPP-feature of a functional category.” It is also claimed under that analysis that “a candidate for Move is simply a syntactic object with phonetic content.” The purpose of this short paper is to show that the operation Move should still be viewed as composite; hence it must have the operation Agree as one of its prerequisites. We argue that the EPP feature of T may not be analyzed as an independent feature that triggers overt displacement in syntax. Under Chomsky's (2000, 2001a) theory, displacement in syntax must require the probe-goal (P, G) association before the actual movement takes place. It is shown in this paper that in order for an element $\beta$ to raise to the [Spec, T] position, the $\varphi$-features of T must establish a (P, G) relation with those of $\beta$ prior to movement. In short, Move requires Agree, the EPP feature being dependent on the minimal $\varphi$-feature [person] of nominals.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4467-4486
• /
• 2018

Trying to deal with the problem of low robustness of Copy-Move Forgery Detection (CMFD) under various transformation and degradation attacks, a novel CMFD method is proposed in this paper. The main advantages of proposed work include: (1) Discrete Analytical Fourier-Mellin Transform (DAFMT) and Locality Sensitive Hashing (LSH) are combined to extract the block features and detect the potential copy-move pairs; (2) The Euclidian distance is incorporated in the pixel variance to filter out the false potential copy-move pairs in the post-verification step. In addition to extracting the effective features of an image block, the DAMFT has the properties of rotation and scale invariance. Unlike the traditional lexicographic sorting method, LSH is robust to the degradations of Gaussian noise and JEPG compression. Because most of the false copy-move pairs locate closely to each other in the spatial domain or are in the homogeneous regions, the Euclidian distance and pixel variance are employed in the post-verification step. After evaluating the proposed method by the precision-recall-$F_1$ model quantitatively based on the Image Manipulation Dataset (IMD) and Copy-Move Hard Dataset (CMHD), our method outperforms Emam et al.'s and Li et al.'s works in the recall and $F_1$ aspects.

• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.342-347
• /
• 2018

We proposed a fast detection of copy-move image forgery using four step search algorithm in the spatial domain. In the four-step search algorithm, the search area is 21 (-10 ~ +10), and the number of pixels to be scanned is 33. Our algorithm reduced computational complexity more than conventional copy move image forgery methods. The proposed method reduced 92.34 % of computational complexity compare to exhaustive search algorithm.

• Journal of the Korean housing association
• /
• v.13 no.1
• /
• pp.29-36
• /
• 2002

This study was performed to investigate the awareness of Namak Eco-city, a willingness to move to an ecological city and their related variables. Data was collected through a questionnaire survey given to 491 residents who live in Mokpo, Kwangju and Muan in Chollanam Province. The awareness of Namak Eco-city was medium level and half of the respondents were not aware of that. Multiple regression analysis was conducted to estimate the effects of the variables on the awareness of Namak Eco-city. The most significant variable was the awareness of taco-city. Thirty eight percent of the respondents were willing to move to Namak Eco-City. Two variables were related with willingness to move to the city. Those who were aware of an Eco-city and had more commuting-oriented housing value had more willingness to move to the city.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.527-534
• /
• 2019

Recently, Photo editing softwares such as digital cameras, Paintshop Pro, and Photoshop digital can create counterfeit images easily. Various techniques for detection of tamper images or forgery images have been proposed in the literature. A form of digital forgery is copy-move image forgery. Copy-move is one of the forgeries and is used wherever you need to cover a part of the image to add or remove information. Copy-move image forgery refers to copying a specific area of an image itself and pasting it into another area of the same image. The purpose of copy-move image forgery detection is to detect the same or very similar region image within the original image. In this paper, we proposed fast detection of forgery image using four step search based on discrete cosine transform and a four step search algorithm using discrete cosine transform (FSSDCT). The computational complexity of our algorithm reduced 34.23 % than conventional DCT three step search algorithm (DCTTSS).