• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.574-580
• /
• 2016

In this paper, we will introduce the system that can control multiple vehicles on the road through Single Board Computers and V2I (Vehicle-To-Infrastructure). Also, we will propose the group evasive maneuver decision algorithm, which plays a critical role in deciding whether the vehicles in the system have to conduct evasive maneuvers to avoid obstacles on the road. In order to test this system, we have utilized Wi-Fi and TCP/IP for establishing the communication between multiple vehicles and the relay server, and observed their driving states on the road with obstacles. During the experiments, we have discovered that our original decision algorithm possesses high failure rate when there is frequency interference in ISM (Industrial Scientific Medical) band. In order to reduce this failure rate, we have implemented the data transition detector. This paper will focus on how the use of data transition detector can affect the reliability of the system under the frequency interference of ISM band. If this technology is improved and applied in the field, we will effectively deal with such dangerous situations as multiple collision accidents through vehicle-to-vehicle communication or vehicle-to-infrastructure communication. Furthermore, this can be applied to the autonomous driving technologies. This can be used as the reference data for the development of the similar system.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.123-136
• /
• 2014

Recently, online shopping has further developed as the use of the Internet and a variety of smart mobile devices becomes more prevalent. The increase in the scale of such shopping has led to the creation of many Internet shopping malls. Consequently, there is a tendency for increasingly fierce competition among online retailers, and as a result, many Internet shopping malls are making significant attempts to attract online users to their sites. One such attempt is keyword marketing, whereby a retail site pays a fee to expose its link to potential customers when they insert a specific keyword on an Internet portal site. The price related to each keyword is generally estimated by the keyword's frequency of appearance. However, it is widely accepted that the price of keywords cannot be based solely on their frequency because many keywords may appear frequently but have little relationship to shopping. This implies that it is unreasonable for an online shopping mall to spend a great deal on some keywords simply because people frequently use them. Therefore, from the perspective of shopping malls, a specialized process is required to extract meaningful keywords. Further, the demand for automating this extraction process is increasing because of the drive to improve online sales performance. In this study, we propose a methodology that can automatically extract only shopping-related keywords from the entire set of search keywords used on portal sites. We define a shopping-related keyword as a keyword that is used directly before shopping behaviors. In other words, only search keywords that direct the search results page to shopping-related pages are extracted from among the entire set of search keywords. A comparison is then made between the extracted keywords' rankings and the rankings of the entire set of search keywords. Two types of data are used in our study's experiment: web browsing history from July 1, 2012 to June 30, 2013, and site information. The experimental dataset was from a web site ranking site, and the biggest portal site in Korea. The original sample dataset contains 150 million transaction logs. First, portal sites are selected, and search keywords in those sites are extracted. Search keywords can be easily extracted by simple parsing. The extracted keywords are ranked according to their frequency. The experiment uses approximately 3.9 million search results from Korea's largest search portal site. As a result, a total of 344,822 search keywords were extracted. Next, by using web browsing history and site information, the shopping-related keywords were taken from the entire set of search keywords. As a result, we obtained 4,709 shopping-related keywords. For performance evaluation, we compared the hit ratios of all the search keywords with the shopping-related keywords. To achieve this, we extracted 80,298 search keywords from several Internet shopping malls and then chose the top 1,000 keywords as a set of true shopping keywords. We measured precision, recall, and F-scores of the entire amount of keywords and the shopping-related keywords. The F-Score was formulated by calculating the harmonic mean of precision and recall. The precision, recall, and F-score of shopping-related keywords derived by the proposed methodology were revealed to be higher than those of the entire number of keywords. This study proposes a scheme that is able to obtain shopping-related keywords in a relatively simple manner. We could easily extract shopping-related keywords simply by examining transactions whose next visit is a shopping mall. The resultant shopping-related keyword set is expected to be a useful asset for many shopping malls that participate in keyword marketing. Moreover, the proposed methodology can be easily applied to the construction of special area-related keywords as well as shopping-related ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.938-943
• /
• 2015

The proposed circular patch antenna was designed to include relative bandwidth of above 25% as designed by the FCC in the FCC in the 3.1 ~ 10.6 GHz band. The antenna was induced to have a wide band characteristic through two structures of the usual microstrip line and a microstrip line with a linear change in impedance. The proposed finally antenna was designed using an FR4_epoxy substrate with 4.7% permittivity, 0.02 of loss tangent, and 1.6 mm of thickness, and was simulated with the use of HFSS made by Ansys. Return loss at frequency, VSWR, radiation pattern and the gain of the antenna were analysed. As a result, if satisfied a return loss of -10 dB and $VSWR{\leq}2$ from 2.28 ~ 13.35 GHz, showing about the bandwidth of 11.89 GHz, and the radiation pattern was unidirectional in all bands. The antenna gain gradually increased from 2 ~ 8 GHz and had the highest gain of 7.92 dBi at 8 GHz. and the gain gradually decreased in the 9 ~ 12 GHz band.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.139-147
• /
• 2019

In this paper, we propose to explore ways to create internal motivation to enhance the job disposition of Korean and Chinese employees. In order to achieve this goal, we would like to select parameters that may trigger an increasing number of internal motivations for interest in recent years: perceived organisational support, perceived provider support, and perceived peer support, and to explore the impact on job embeddedness. I would like to find out the effect of job embodiedness on involved beauty. The process also seeks to verify that China and South Korea are different. To verify the research theory of this research, we will use a questionnaire to researchers of automotive companies using VR technology in Gyeonggi-do, Korea and Hadong-seong, China, and conducted a survey. A total of 200 pairs of questionnaires were distributed to the study subjects, 195 of which were retrieved, 191 of which eliminated unfaithful responses were used for the final analysis. The collected data were used for frequency analysis, exploratory factor analysis, reliability analysis, confirmatory factor analysis, correlation analysis, structural equation analysis. The results of this study, identified through empirical analysis, can be summarized as follows: First, Perceived Organizational Support, Perceived Supervisor Support will have a positive impact on Job Embeddedness. Second, Job Embeddedness will have a positive influence on the Innovative Beehivior. Third, Perceived Organizational Support, Perceived Supervisor Support will have a partial positive effect on Innovative Behavior. Fourth, the formation process and influence of Job Embeddedness of corporate employees in Korea and China are partly different, the report showed.

• The Journal of Society for e-Business Studies
• /
• v.19 no.3
• /
• pp.107-123
• /
• 2014

Current text mining techniques suffer from the problem that the conventional text representation models cannot express the semantic or conceptual information for the textual documents written with natural languages. The conventional text models represent the textual documents as bag of words, which include vector space model, Boolean model, statistical model, and tensor space model. These models express documents only with the term literals for indexing and the frequency-based weights for their corresponding terms; that is, they ignore semantical information, sequential order information, and structural information of terms. Most of the text mining techniques have been developed assuming that the given documents are represented as 'bag-of-words' based text models. However, currently, confronting the big data era, a new paradigm of text representation model is required which can analyse huge amounts of textual documents more precisely. Our text model regards the 'concept' as an independent space equated with the 'term' and 'document' spaces used in the vector space model, and it expresses the relatedness among the three spaces. To develop the concept space, we use Wikipedia data, each of which defines a single concept. Consequently, a document collection is represented as a 3-order tensor with semantic information, and then the proposed model is called text cuboid model in our paper. Through experiments using the popular 20NewsGroup document corpus, we prove the superiority of the proposed text model in terms of document clustering and concept clustering.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.1-11
• /
• 2009

XQuery query proposed by W3C is one of the standard query languages for XML data and is widely accepted by many applications. Therefore the studies for efficient Processing of XQuery query have become a topic of critical importance recently and the optimization of XQuery query is one of new issues in these studies. However, previous researches just focus on the optimization techniques for a specific XML data management system and these optimization techniques can not be used under the any XML data management systems. Also, some previous researches use predefined XML data structure information such as XML schema or DTD for the optimization. In the real situation, however applications do not all refer to the structure information for XML data. Therefore, this paper analyzes only a XQuery query and optimize by using itself of the XQuery query. In this paper, we propose 3 kinds of optimization method that considers the characteristic of XQuery query. First method removes the redundant expressions described in XQuery query second method replaces the processing order of operation and clause in XQuery query and third method rewrites the XQuery query based on FOR clause. In case of third method, we consider FOR clause because generally FOR clause generates a loop in XQuery query and the loop often rises to execution frequency of redundant operation. Through a performance evaluation, we show that the processing time for rewritten queries is less than for original queries. also each method in our XQuery query optimizer can be used separately because the each method is independent.

• Journal of Digital Convergence
• /
• v.14 no.11
• /
• pp.275-281
• /
• 2016

In modern society, which boomed it became easier to obtain the necessary information to the emergence of a variety of smart devices. Due to this, the frequency of using the content based on the Web is growing rapidly. In addition, companies are turning into a production and modify the content using the CMS under the web-based. It can be a very important part to provide users with the content. Currently web services are designing a UI to the device and provided. To improve the ease of use, they are enhancing services only by survey and analysis of the patterns of all users. Most are designed without considering the UX only in the technical aspects. In this paper, to break the limits that apply to all users of the Web service pattern analysis, we propose a visualization system via the animation based on the individual user's movement patterns and usage patterns. Through this convergence is expected to be able to transform the web from the central manager to the user UX and the planning aspects researchers.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.11
• /
• pp.1-9
• /
• 2021

3D-NAND flash memory provides high capacity per unit area by stacking 2D-NAND cells having a planar structure. However, due to the nature of the lamination process, there is a problem that the frequency of error occurrence may vary depending on each layer or physical cell location. This phenomenon becomes more pronounced as the number of write/erase(P/E) operations of the flash memory increases. Most flash-based storage devices such as SSDs use ECC for error correction. Since this method provides a fixed strength of data protection for all flash memory pages, it has limitations in 3D NAND flash memory, where the error rate varies depending on the physical location. Therefore, in this paper, pages and layers with different error rates are classified into clusters through the K-means machine learning algorithm, and differentiated data protection strength is applied to each cluster. We classify pages and layers based on the number of errors measured after endurance test, where the error rate varies significantly for each page and layer, and add parity data to stripes for areas vulnerable to errors to provides differentiate data protection strength. We show the possibility that this differentiated data protection policy can contribute to the improvement of reliability and lifespan of 3D NAND flash memory compared to the protection techniques using RAID-like or ECC alone.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.24 no.4
• /
• pp.489-495
• /
• 2018

In this paper, we designed and fabricated WLAN / UWB communication antennas operating at 3.3 [GHz] and 5 [GHz] bands in order to effectively use the high-speed communication network system that improved antenna miniaturization, gain and radiation pattern. Microstrip patch antennas were chosen to improve the bandwidth. The slot width, length, and transmission line width were calculated using the theoretical formula for each step. Simulation results show that the return loss is -14.053 [dB] at 3.3 [GHz] and -13.118 [dB] at 5 [GHz]. The gain showed a value of 2.479 [dBi] at 3.3 [GHz] and a value of 3.317 [dBi] at 5 [GHz]. After optimizing it with the CST Microwave Studio 2014 program, which can be 3D-designed, Based on these results, we investigated the performance of antennas by measuring their characteristics. In recent years, WLAN, which is a variety of wireless technologies that are continuously developing, and UWB, which is a communication technology which is increasing in frequency band due to an increase in demand of the technology users, is used for a high speed wireless communication system. Communication seems to be possible.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.2 s.344
• /
• pp.27-38
• /
• 2006

When an RFID reader attempts to read tags, interference might occur if the neighboring readers also attempt to communicate with the same tag at the same time or the neighboring readers use the same frequency at the same time. These interferences cause the RFID reader collision. When the RFID reader collision occirs, either the command from the reader can not be transmitted to the tags or the response from the tags can not be received by the reader correctly. RFID reader anti-collision algorithms have been developed to reduce it. One of the best blown reader anti-collision algorithms is the Colorwave algorithm proposed by MIT. The Colorwave algorithm reduces the reader collisions by having the readers operate at different times. In Colorwave the time is divided into frames and a frame is divided into a number of slots. Each reader can access the tags using the slot time assigned to it. Depending on the probability of the interference, the colorwave adjusts the frame size to improve the efficiency. In this paper, we analyze the operations and the performance of the Colorwave algorithm and identify the problems of the algorithm. We also show that by adding some modifications to the algorithm the performance can be improved significantly.