• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.187-187
• /
• 2004

In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF($2^8$) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.29-38
• /
• 2004

In this paper, we present an efficient architecture of a versatile Reed-Solomon (RS) decoder which can be programmed to decode RS codes continuously with my message length k as well as any block length n. This unique feature eliminates the need of inserting zeros for decoding shortened RS codes. Also, the values of the parameters n and k, hence the error-correcting capability t can be altered at every codeword block. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm (MEA). Since each step can be driven by a separate clock, the decoder can operate just as 2-step pipeline processing by employing the faster clock in step 2 and/or step 3. Also, the decoder can be used even in the case that the input clock is different from the output clock. Each step is designed to have a structure suitable for decoding RS codes with varying block length. A new architecture for the MEA is designed for variable values of the t. The operating length of the shift registers in the MEA block is shortened by one, and it can be varied according to the different values of the t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive technique and the over-clocking technique. The decoder can decodes codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications because of its versatility. The adaptive RS decoder over GF(2$^{8}$ ) having the error-correcting capability of upto 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.134-142
• /
• 2003

We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.2
• /
• pp.133-138
• /
• 2011

In IP-based wireless sensor networks (WSNs), it might be necessary to distribute application updates to the sensor nodes in order to fix bugs or add new functionality. However, physical access to nodes is in many cases extremely limited following deployment. Therefore, network reprogramming protocols have recently emerged as a way to distribute application updates without requiring physical access to sensor nodes. In order to solve the network reprogramming problem over the air interface, this thesis presents a new scheme for new update code propagation using fragmentation scheme and network coding. The proposed code propagation method roughly shows reduced performance improvement in terms of the number of data exchange compared with the previously proposed pipelining scheme. Further, It is shows enhanced reliability for update code propagation and reduced overhead in terms of the number of data exchange. As a result, we can efficiently perform the software update from the viewpoint of speed, energy, and network congestion when the proposed code propagation system is applied. In addition, the proposed system solves overhearing problems of network coding such as the loss of original messages and decoding error using the predefined message. Therefore, our system allows a software update system to exchange reliable data in wireless sensor networks.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.447-454
• /
• 2015

This paper proposes geographical name denoising by machine learning of event detection based on twitter. Recently, the increasing number of smart phone users are leading the growing user of SNS. Especially, the functions of short message (less than 140 words) and follow service make twitter has the power of conveying and diffusing the information more quickly. These characteristics and mobile optimised feature make twitter has fast information conveying speed, which can play a role of conveying disasters or events. Related research used the individuals of twitter user as the sensor of event detection to detect events that occur in reality. This research employed geographical name as the keyword by using the characteristic that an event occurs in a specific place. However, it ignored the denoising of relationship between geographical name and homograph, it became an important factor to lower the accuracy of event detection. In this paper, we used removing and forecasting, these two method to applied denoising technique. First after processing the filtering step by using noise related database building, we have determined the existence of geographical name by using the Naive Bayesian classification. Finally by using the experimental data, we earned the probability value of machine learning. On the basis of forecast technique which is proposed in this paper, the reliability of the need for denoising technique has turned out to be 89.6%.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.2
• /
• pp.391-406
• /
• 2024

The current distribution of digital news has the potential to produce politically biased information for users as a result of individual choices and media selection based on those choices. Consequently, this research explored the factors affecting individual news selection and the effects of opinion changes and political participation that can occur when news tailored to users' partisan preferences is recommended. The phenomenon of selective exposure has been shown to be stronger when individuals utilize more limited information processing, experience higher discussion efficacy among groups with similar political beliefs. Furthermore, When a selective exposure group was randomly provided with a one-way message news that matched their partisan leanings, it was found that opinion consolidation, opinion-reinforcing information processing, and online political participation. On the other hand, when they were randomly presented with two-way messaging news in which the media balanced two competing partisan positions, they were found to be more likely to understand the other side's views and arguments, and more willing to adjust their existing opinions. We are confirmed that the balanced use of various opinions is very important in deliberative democratic process.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.421-429
• /
• 2000

In present, ATM integrated switching system has been developed to a mixed modules that complexed switching system including maintenance, operation based on B-ISDN/LAN service and plug-in module, , which runs on workstation computer system. Meanwhile, workstation has HMI operation system feature including file system management, time management, graphic processing, TMN agent function. The workstation has communicated with between ATM switching module and clients. This computer system architecture has much burden messages communication among processes or processor. These messages communication consume system resources which are socket, message queue, IO device files, regular files, and so on. Therefore, in this paper we proposed new performance modeling with this system architecture. We will analyze the system bottleneck and improve system performance. In addition, in the future, the system has many additional features should be migrated to workstation system, we need previously to evaluate system bottleneck and redesign it. In performance model, we use queueing network model and the simulation package is used PDQ and C-program.

• Journal of Korean Academy of Nursing
• /
• v.25 no.4
• /
• pp.729-740
• /
• 1995

The purpose of this study is to provide basic data for school health computerization by investigating the nurse teacher's attitudes toward school health computerization. For this study, the questionnaires were given to 559 nurse teachers from 3. March to 17. March, 1995. Among them, 338 were returned and included for the analysis. The results of the study were as follows : 1. In general characteristics, the results showed average of 38.6 years in age ; and average of 11.1 years in education experience. In distribution of school, the result showed 47.0% in elementary school, 30.5% in middle school and 22.5% in high school ; 75.4% national and public school vs 26.4% private school. 2. In attitudes of computerization, the score was varied from 19 to 76 point. The attitudes was generally positive with the average of 60.23±7.63(SD) score. The respondents are willing to participate in computer education(the highest score, 3.69), they worry about electromagnetic waves by computer (the lowest score : 2.30). 3. 92.6％ of the respondents want to participate in computer education. The major reason the respondents have not yet learned computer is that they had little chance to learn. While 58.0% of them answered that they had an experience of computer use in school health works, few schools had computer in dispensary. In computer use, nurse teachers in public school have more experience than ones in private school. Word processing was the major function that the most respondents can do(62.7%). They answered that they have little knowledge of computer (84.0%). 4. Computer can be utilized in school health works as follows in order : message from school to home, reports, annual plan and statistics. 65.4% of them answered that computer can be used in 10 items of 13 items. 5. The attitudes of computerization showed differences in the following variables career, age, existence of computer in school health clinic, experience of computer use, intention to participate in computer education, computer knowledge, frequent computer use, ability of computer use, school health computerization areas, experience of computer education. Among there variables, age, existence of computer in school health clinic, intention to participate in computer education, ability of computer use, school health computerization areas showed significant explanation(28.3%) for the attitudes of computerization in multiple regression analysis The younger. the higher degree of intention, the more functions they can perform, the more school health computerization areas, and the more computers in school health clinic, the more positive attitude on school health computerization. In conclusion, to achieve the successful computerization of school health works, the positive attitudes of nurse teachers should be encourged for school health computerization. For this purpose, the chance of computer education should be given as many times as possible. And administerial as well as financial support are essential for enlarging the knowledge and ability of computer.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.19 no.3
• /
• pp.164-173
• /
• 2017

Alternative cropping systems would be one of climate change adaptation options. Suitable areas for a crop could be identified using a climate suitability model. The EcoCrop model has been used to assess climate suitability of crops using monthly climate surfaces, e.g., the digital climate map at high spatial resolution. Still, a high-performance computing approach would be needed for assessment of climate suitability to take into account a complex terrain in Korea, which requires considerably large climate data sets. The objectives of this study were to implement a script for R, which is an open source statistics analysis platform, in order to use the EcoCrop model under a parallel computing environment and to assess climate suitability of maize using digital climate maps at high spatial resolution, e.g., 1 km. The total running time reduced as the number of CPU (Central Processing Unit) core increased although the speedup with increasing number of CPU cores was not linear. For example, the wall clock time for assessing climate suitability index at 1 km spatial resolution reduced by 90% with 16 CPU cores. However, it took about 1.5 time to compute climate suitability index compared with a theoretical time for the given number of CPU. Implementation of climate suitability assessment system based on the MPI (Message Passing Interface) would allow support for the digital climate map at ultra-high spatial resolution, e.g., 30m, which would help site-specific design of cropping system for climate change adaptation.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.307-314
• /
• 2010

Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.