• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.15 no.1
• /
• pp.56-61
• /
• 2022

In this paper, we classify and present AI algorithms and natural language processing methods used in chatbots. A framework that can be used to implement a chatbot is also described. A chatbot is a system with a structure that interprets the input string by constructing the user interface in a conversational manner and selects an appropriate answer to the input string from the learned data and outputs it. However, training is required to generate an appropriate set of answers to a question and hardware with considerable computational power is required. Therefore, there is a limit to the practice of not only developing companies but also students learning AI development. Currently, chatbots are replacing the existing traditional tasks, and a practice course to understand and implement the system is required. RNN and Char-CNN are used to increase the accuracy of answering questions by learning unstructured data by applying technologies such as deep learning beyond the level of responding only to standardized data. In order to implement a chatbot, it is necessary to understand such a theory. In addition, the students presented examples of implementation of the entire system by utilizing the methods that can be used for coding education and the platform where existing developers and students can implement chatbots.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.337-347
• /
• 2007

An embedded system is called a multi-mode embedded system if it performs multiple applications by dynamically reconfiguring the system functionality. Further, the embedded system is called a multi-mode multi-task embedded system if it additionally supports multiple tasks to be executed in a mode. In this Paper, we address a HW/SW partitioning problem, that is, HW/SW partitioning of multi-mode multi-task embedded applications with timing constraints of tasks. The objective of the optimization problem is to find a minimal total system cost of allocation/mapping of processing resources to functional modules in tasks together with a schedule that satisfies the timing constraints. The key success of solving the problem is closely related to the degree of the amount of utilization of the potential parallelism among the executions of modules. However, due to an inherently excessively large search space of the parallelism, and to make the task of schedulabilty analysis easy, the prior HW/SW partitioning methods have not been able to fully exploit the potential parallel execution of modules. To overcome the limitation, we propose a set of comprehensive HW/SW partitioning techniques which solve the three subproblems of the partitioning problem simultaneously: (1) allocation of processing resources, (2) mapping the processing resources to the modules in tasks, and (3) determining an execution schedule of modules. Specifically, based on a precise measurement on the parallel execution and schedulability of modules, we develop a stepwise refinement partitioning technique for single-mode multi-task applications. The proposed techniques is then extended to solve the HW/SW partitioning problem of multi-mode multi-task applications. From experiments with a set of real-life applications, it is shown that the proposed techniques are able to reduce the implementation cost by 19.0% and 17.0% for single- and multi-mode multi-task applications over that by the conventional method, respectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.493-501
• /
• 2007

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.

• Archives of design research
• /
• v.18 no.4 s.62
• /
• pp.53-64
• /
• 2005

The emergence of new communication media, digital, is something of a wonder, as well as a cultural tension. The industrial technologies that dramatically expand human abilities are being developed much faster than the speed of adaptation by humans. Without an exception, it creates new contents and form of the culture by shaking the very foundation of the notion about human beings. Korean broadcasting environment has stepped into the era of multi-media, multi-channel as the digital technology separated the media into network, cable, satellite and internet. In this digital culture, broadcasting, as a medium of information delivering and communication, has bigger influence than ever. Such changes in broadcasting environment turned the TV viewers into new consumers who participate and play the main role in active communication by choosing and using the media. This study is trying to systemize the question about the core identity of broadcasting through brand as the consumers stand in the center of broadcasting with the power to select channel. The story schema theory can be applied as a cognitive psychological tool to approach the active consumers in order to explain the cognitive processes that are related to information processing. It is a design with stories, which comes up as a case of a brand's story telling. The range of this study covers the current issue and educational programs in network TV during the period of May and August of year 2005. The cases of Korean and foreign programs were compared by the station each program is broadcasted. This study concludes that it is important to take the channel identity into the consideration in the brand strategy of each program. Especially, the leading programs of a station must not be treated as a separate program that has nothing to do with the station's identity. They must be treated to include the contents and form that builds the identity of the channel. Also, this study reconfirmed that building a brand of the anchor person can play as an important factor in the identity of the program's brand.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.650-664
• /
• 2000

NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.619-628
• /
• 2000

Abstract Perspective views provide a powerful depth cue and thus aid the interpretation of complicated images. The main drawback of current perspective volume rendering is the long execution time. In this paper, we present an efficient perspective volume rendering algorithm based on coherency between rays. Two sets of templates are built for the rays cast from horizontal and vertical scanlines in the intermediate image which is parallel to one of volume faces. Each sample along a ray is calculated by interpolating neighboring voxels with the pre-computed weights in the templates. We also solve the problem of uneven sampling rate due to perspective ray divergence by building more templates for the regions far away from a viewpoint. Since our algorithm operates in object-order, it can avoid redundant access to each voxel and exploit spatial data coherency by using run-length encoded volume. Experimental results show that the use of templates and the object-order processing with run-length encoded volume provide speedups, compared to the other approaches. Additionally, the image quality of our algorithm improves by solving uneven sampling rate due to perspective ray di vergence.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.271-280
• /
• 2010

For the next generation mobile communication system, diverse wireless network techniques such as beyond 3G LTE, WiMAX/WiBro, and next generation WLAN etc. are proceeding to the form integrated into the All-IP core network. According to this development, Beyond 3G integrated into heterogeneous wireless access technologies must support the vertical handover and network to be used of several radio networks. However, unified management of each network is demanded since it is individually serviced. Therefore, in order to solve this problem this study is introducing the theory of Common Radio Resource Management (CRRM) based on Generic Link Layer (GLL). This study designs the structure and functions to support the vertical handover and propose the vertical handover algorithm of which policy-based and MCDM are composed between LTE and WLAN systems using GLL. Finally, simulation results are presented to show the improved performance over the data throughput, handover success rate, the system service cost and handover attempt number.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.30-43
• /
• 2008

Memory reference instructions such as loads or stores are critical factors that limit the processing power of processor. The prefetching technique is an effective way to reduce the latency caused from memory access. However, excessively aggressive prefetch leads to cache pollution so as to cancel out the advantage of prefetch. In this study, four filtering schemes have been compared and evaluated which dynamically decide whether to begin prefetch after referring a filtering table to decrease cache pollution. First, A bi-states scheme has been shown to analyze the lock problem of the conventional scheme, this scheme such as conventional scheme used to be N:1 mapping, but it has the two state to 1bit value of each entries. A complete state scheme has been introduced to be used as a reference for the comparative study. A block address lookup scheme has been proposed as the main idea of this paper which exhibits the most exact filtering performance. This scheme has a length of the table the same as the bi-states scheme, the contents of each entry have the fields the same as the complete state scheme recently, never referenced data block address has been 1:1 mapping a entry of the filter table. Experimental results from commonly used general benchmarks and multimedia programs show that average cache miss ratio have been decreased by 10.5% for the block address lookup scheme(BAL) compare to conventional dynamic filter scheme(2-bitSC).

• The Journal of the Korea Contents Association
• /
• v.16 no.11
• /
• pp.281-307
• /
• 2016

The goal of this study was to verify that effectiveness of transformational leadership in impacting work engagement with the psychological contract breach among members of the organization and organizational anomie as mediating factors. The mediating effect of psychological contract breach and organizational anomie on the relationship between transformational leadership and work engagement was explored using a theoretical approach based on Social Exchange Theory, Social Information Processing Model and Job Demands- Resources Model. To avoid common method bias, the dependent variable was surveyed using employee peer review. 277 surveys were collected from 18 companies in diverse industries including manufacturing, distribution, and finance. The results of the analysis showed that transformational leadership has a significant positive effect on employees' work engagement, while having a significant negative effect on psychological contract breach and organizational anomie. In addition, psychological contract breach and organizational anomie were found to act as partial mediators in the relationship between transformational leadership and employees' work engagement. Overall, this study showed that if leaders at organizations can assist employees to overcome negative factors such as psychological contract breach and organizational anomie through transformational leadership, it is possible to improve employees' work engagement.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.8
• /
• pp.3672-3681
• /
• 2013

The purpose of this study was to analyze subculture of professional football supporters with a view of Bourdieu's Habitus theory. What sorts of mechanism were worked when supporters formed their Habitus. The methods adopted in the article was qualitative. The qualitative information on the nature of their fandom was gleaned from 'virtual participant observation' or 'interviewing' of professional football fans that participated in discussions on the internet and participant observation of professional fans. The intensity and criteria sampling method was used to select 6 supporters who had participated in the supporting activities for more than five years and played crucial roles in running their organization as officials. The textual analysis which is consisting of translation, coding, and processing was used to mean the identification and exegesis of contextualization cues that make a text meaningful to the professional football supporters. an intended audience. The findings of this study were that (1) the subculture variety of activities for players and coaching staffs were the fundamental factors when supporters formed their subculture. (2) the professional supporters became habitus through the progressively development of subcultures such as enthusiastic supporters, small meetings, and events relating to soccer players.