• 한국소프트웨어감정평가학회 논문지
• /
• 제14권2호
• /
• pp.35-44
• /
• 2018

서로 다른 언어로 작성된 소스코드의 유사성 검사는 주로 요약구문트리를 기반으로 비교를 수행한다. 하지만 대규모의 소스코드를 실용적인 수준으로 비교하려면 토큰수준 기반에서 작동하는 유사성 검사 기술이 필요하다. 본 연구에서는 서로 다른 언어에서 생성되었지만 같은 의미를 지닌 토큰을 표현할 수 있는 공통 토큰을 정의하고, 소스코드에서 언어별 처리 과정을 거쳐 생성한 공통 토큰의 나열을 입력으로 소스코드의 유사성 검사를 수행하는 방법을 제안한다. 한국저작권위원회의 표절검사 도구 exEyes를 사용해서 서로 다른 언어로 작성된 동일한 코드를 대상으로 실험한 결과, 제안한 방법을 사용했을 때, 유사성 평가 성능이 향상됨을 보였다.

• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.101-108
• /
• 1997

The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

• 정보보호학회논문지
• /
• 제18권2호
• /
• pp.139-150
• /
• 2008

최근, 공공기관을 비롯한 금융기관 및 기업들은 안전한 시스템관리 및 사용자 신원확인을 위해 OTP, 스마트카드, USB 인증토큰 등의 보안토큰을 도입하고 있다. 그러나 최근 들어 이런 제품들에 대한 취약성이 소개되었다. 따라서 본 논문에서는 국내 외 보안토큰 표준화 및 개발 동향을 살펴보고, 보안토큰의 취약성, 공격방법 등의 분석을 통해 보안토큰이 일반적으로 갖춰야 할 보안기능과 보안 요구사항을 도출하고, 이를 바탕으로 CC v3.1 기반 보안토큰 보호프로파일을 개발한다.

• 음성과학
• /
• 제1권
• /
• pp.153-200
• /
• 1997

In languages such as Japanese, it is very common to observe that short peripheral vowel are completely voiceless when surrounded by voiceless consonants. This phenomenon has been known as Montreal French, Shanghai Chinese, Greek, and Korean. Traditionally this phenomenon has been described as a phonological rule that either categorically deletes the vowel or changes the [+voice] feature of the vowel to [-voice]. This analysis was supported by Sawashima (1971) and Hirose (1971)'s observation that there are two distinct EMG patterns for voiced and devoiced vowel in Japanese. Close examination of the phonetic evidence based on acoustic data, however, shows that these phonological characterizations are not tenable (Jun & Beckman 1993, 1994). In this paper, we examined the vowel devoicing phenomenon in Korean using data from ENG fiberscopic and acoustic recorders of 100 sentences produced by one Korean speaker. The results show that there is variability in the 'degree of devoicing' in both acoustic and EMG signals, and in the patterns of glottal closing and opening across different devoiced tokens. There seems to be no categorical difference between devoiced and voiced tokens, for either EMG activity events or glottal patterns. All of these observations support the notion that vowel devoicing in Korean can not be described as the result of the application of a phonological rule. Rather, devoicing seems to be a highly variable 'phonetic' process, a more or less subtle variation in the specification of such phonetic metrics as degree and timing of glottal opening, or of associated subglottal pressure or intra-oral airflow associated with concurrent tone and stricture specifications. Some of token-pair comparisons are amenable to an explanation in terms of gestural overlap and undershoot. However, the effect of gestural timing on vocal fold state seems to be a highly nonlinear function of the interaction among specifications for the relative timing of glottal adduction and abduction gestures, of the amplitudes of the overlapped gestures, of aerodynamic conditions created by concurrent oral tonal gestures, and so on. In summary, to understand devoicing, it will be necessary to examine its effect on phonetic representation of events in many parts of the vocal tracts, and at many stages of the speech chain between the motor intent and the acoustic signal that reaches the hearer's ear.

• 음성과학
• /
• 제8권2호
• /
• pp.93-106
• /
• 2001

The pronunciation of English l and r was a consistent problem in learning English in Korea as well as Japan. This problem occurs from the fact that in Korea and Japan there is only one liquid sound. Substituting the Korean liquid for English l and r was a common error. The pronunciation of the dark l causes a further problem in pronouncing the English l sound. To see the relationship between the English l, r, and the Korean liquid sound, an electropalatographic (EPG) experiment was done. The findings were (1) there were no tongue contacts either on the alveolar ridge or on the palate during the articulation of the dark l. (2) The Korean liquid sound was different in the tongue contact points either from English l or r. The English clear l consistently touched the alveolar ridge in the forty tokens, but the Korean liquid sound in the intervocalic and word-final position touched mainly the alveopalatal area. The English r touched exclusively the velum area. The Korean intervocalic /l/ was similar to English flap in EPG and spectrographic data. There was evidence that the word-final Korean /l/ is a lateral.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권10호
• /
• pp.5171-5189
• /
• 2016

With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.317-323
• /
• 2021

Social media is increasingly becoming a part of our daily life for communicating each other. There are various tools and applications for communication and therefore, identity theft is a common issue among users of such application. A new style of identity theft occurs when cybercriminals break into WhatsApp account, pretend as real friends and demand money or blackmail emotionally. In order to prevent from such issues, data mining can be used for text classification (TC) in analysis authorship attribution (AA) to recognize original sender of the message. Arabic is one of the most spoken languages around the world with different variants. In this research, we built a machine learning model for mining and analyzing the Arabic messages to identify the author of the messages in Saudi dialect. Many points would be addressed regarding authorship attribution mining and analysis: collect Arabic messages in the Saudi dialect, filtration of the messages' tokens. The classification would use a cross-validation technique and different machine-learning algorithms (Naïve Baye, Support Vector Machine). Results of average accuracy for Naïve Baye and Support Vector Machine have been presented and suggestions for future work have been presented.

• 인문언어
• /
• 제8집
• /
• pp.331-367
• /
• 2006

In this paper I attempted to investigate the matters related with the clarification of the close relationship between writing system and pronunciation. On the way of pursuing the research on the subject I found the fact that the same topic has been the main academic target in Korea. There have been some remarks about English alphabets and pronunciation. Nevertheless, the relation between alphabet codes and pronunciation tokens wasn't considered as the main key to master the English pronunciation correctly and completely. As the main target of this paper I argue that it is necessary to comprehend the connection. Then, we can recognize the significant role of alphabetic structure for understanding the gist of pronunciation exercise. This paper is classified into four parts. Each part consists of the material to affirm the fact that writing system should be the inevitable equivalent of sound system, and vice versa. In the first section I show that the development of the way of pronouncing English words is closely related with the endeavors of the scholars. While performing the survey of the studies about the alphabetic structure of the age many scholars found that the spelling construction was recorded without any common denominator. Thus, they not only sought to stage the bedrock for the standard written form of words but also to associate the alphabet letters with phonetic features. Secondly I mention the negative aspect of the 'only spelling based English pronunciation education' for the educational goal of 'Phonics methodology.' In this part I suggest the essentiality of phonemic properties with the phonetic prospect: phonemic awareness. Thirdly I refer to the standardization of the spelling system of English. As the realm of application of the language is extended toward the various professional areas such as commercial, scientific, and cultural spheres, it is quite natural to assume that the usage of the language will be transformed according to the areas in the world. Fourthly I introduce the first English-Korean grammar book with the section of 'the introduction to English pronunciation.' At the chapter the author explained the sound features of English based on the regulation of 'Scientific Alphabet' of U.S.A. In the transcribing system all the symbols were postulated on the basis of the English alphabet form instead of the separate phonetic signs of IPA.

• 대한전자공학회논문지TC
• /
• 제43권5호
• /
• pp.84-93
• /
• 2006

이더넷 PON은 현재 광가입자망의 기술 수준, 경제성을 고려할 때 가입자망의 고속화 실현을 위한 가장 현실성 있는 구현 방안으로 주목받고 있다. 이더넷 PON은 하향 및 상향 전송을 위하여 점대다점(point-to-multipoint), 다점대점(multipoint-to-point) 구조를 갖는다. 따라서 하향 전송을 위하여 이더넷 프레임은 수동분배기를 거쳐 모든 ONU에게 방송되는 반면, 상향 구조는 다수의 ONU가 단일의 상향 채널을 공유하는 형태이므로 각 ONU에게 공평하고 효율적인 채널 할당을 위한 MAC 프로토콜이 요구된다. 따라서 종래의 연구는 ONU간 충돌을 해결하고 망 자원을 효율적으로 사용하기 위한 다양한 MAC 프로토콜과 대역 할당 알고리즘에 초점을 맞추었다. 그러나 서비스를 제공하는 망 사업자 입장에서 볼 때, 망 사업자는 각 ONU에게 사전에 협약한 대역폭을 보장하는 동시에 IP 트래픽에 유연한 효율적인 망 자원 관리 책임이 요구된다. 이러한 관점에서 하향 트래픽 제어는 매우 중요하다. 본 논문에서는 이더넷 PON 환경에서 하향 트래픽의 협약 대역을 보장함으로써 각 ONU에게 공평성을 제공하고 망 자원의 효율적 사용을 위한 하향 트래픽 제어 기법을 제안한다. 제안한 기법은 하나의 토큰 버킷과 과거 트래픽 정보를 이용한 서비스제공 확률을 기반으로 구현의 단순성, 공평성, 융통성을 제공한다. 제안한 기법의 성능 평가를 위해 AWESIM을 이용하여 IEEE 802.3ah 기반의 이더넷 PON 시스템을 설계하고 시뮬레이션을 수행하였으며, 다양한 시나리오를 기반으로 공평성, 지연, 폐기율 관점에서 성능을 평가하고 분석하였다.