• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.17-23
• /
• 2016

In the future network such as Internet of Things (IoT), the number of computing devices are expected to grow exponentially, and each of the things communicates with the others and acquires information by itself. Due to the growing interest in IoT applications, the broadcasting in Opportunistic ad-hoc networks such as Machine-to-Machine (M2M) is very important transmission strategy which allows fast data dissemination. In distributed networks for IoT, the energy efficiency of the nodes is a key factor in the network performance. In this paper, we propose a fuzzy logic based probabilistic multi-hop broadcast (FPMCAST) algorithm which statistically disseminates data accordingly to the remaining energy rate, the replication density rate of sending node, and the distance rate between sending and receiving nodes. In proposed FPMCAST, the inference engine is based the fuzzy rule base which is consists of 27 if-then rules. It maps input and output parameters to membership functions of input and output. The output of fuzzy system defines the fuzzy sets for rebroadcasting probability, and defuzzification is used to extract a numeric result from the fuzzy set. Here Center of Gravity (COG) method is used to defuzzify the fuzzy set. Then, the performance of FPMCAST is evaluated through a simulation study. From the simulation, we demonstrate that the proposed FPMCAST algorithm significantly outperforms flooding and gossiping algorithms. Specially, the FPMCAST algorithm has longer network lifetime because the residual energy of each node consumes evenly.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.271-284
• /
• 2008

Self-healing is an approach to evaluating constraints defined in target system and to applying an appropriate strategy when violating he constrains. Today, the computing environment is very complex, so researches that endow a system with the self-healing's ability that recognizes problem arising in a target system are being an important issues. However, most of the existing researches are that self-healing developers need much effort and time to analyze and model constraints. Thus, this paper proposes an automated approach to determine problem arising in external and internal system environment. The approach proposes: 1) Specifying the target system through the models created in design phase of target system. 2) Automatically creating constraints for external and internal system environment, by using the specified contents. 3) Deriving a dependency model of a component based on the created internal state rule. 4) Translating the constraints and dependency model into code evaluating behaviors of the target system, and determinating problem level. 5) Monitoring an internal and external status of system based on the level of problem determination, and applying self-healing strategy when detecting abnormal state caused in the target system. Through these, we can reduce the efforts of self-healing developers to analyze target system, and heal rapidly not only abnormal behavior of target system regarding external and internal problem, but also failure such as system break down into normal state. To evaluate the proposed approach, through video conference system, we verify an effectiveness of our approach by comparing proposed approach's self-healing activities with those of the existing approach.

• (The) Research of the performance art and culture
• /
• no.37
• /
• pp.223-247
• /
• 2018

A reading aloud performance is an activity in which the actors convey the meaning of the play to the audience through reading the play without memorizing the play. Although this term has been used for a long time, it can be said in the early 2000s that Korea began to pay attention to reading aloud performance in the cultural world. As the theater education is strengthened in the 2015 revision curriculum, interest in this "reading aloud performance" is also growing. In this article, we analyzed the reading aloud performance of the 8th contemporary Japanese drama '2018' in order to utilize the reading aloud performance in the educational field and to utilize it in the lecture of the children education. There are two types of rehearsals for the actors on stage: 'Reading by watching drama', 'Playing by memorizing drama', and 'Mixing two types'. In the end, the key is that there is no set rule for the type of reading aloud performance. It's not trouble to see or not to see the play. It is not necessary to have a stereotype that you should do a proper reading aloud performance in consideration of your situation, but that you should do this. If children understand the concept of read aloud performance in a flexible way, the educational effect will be greater. Based on this analysis, we suggested 'not sticking to the form of reading aloud performance' and 'choosing various types of reading aloud performance' as a criterion for applying to the education field for children. In addition, the sub-criteria required for selecting 'various types of lecture performances' include' selecting a specific scene in the content of the play ',' considering the level or situation of the student ',' not hesitating to make a new type of lecture performance '. I hope that this article will be a stepping stone to revitalize the discussion in the educational world where discussion on the performance of reading aloud is requested, and to solve the problem of lack of educational design due to lack of theory.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.37-47
• /
• 2005

Recently, the malicious e-mail worm-viruses have been widely spreaded over the Internet. If the recipient opens the e-mail attachment or an e-mail itself that contains the worm-virus, the worm-virus can be activated and then cause a tremendous damage to the system by propagating itself to everyone on the mailing list in the user's e-mail package. In this paper, we have designed and implemented two methods blocking e-mail worm-viruses. In the fist method, each e-mail is transmitted only by sender activity such as the click of button on a mail client application. In the second one, we insert the two modules into the sender side, where the one module transforms a recipient's address depending on a predefined rule only in time of pushing button and the other converts the address reversely with the former module whenever an e-mail is sent. The lader method also supports a polymorphism model in order to cope with the new types of e-mail worm-virus attacks. The two methods are designed not to work for the e-mail viruses. There is no additional fraction on the receiver's side of the e-mail system. Experimental results show that the proposed methods can screen the e-mail worm-viruses efficiently with a low overhead.

• Computers and Concrete
• /
• v.31 no.3
• /
• pp.267-276
• /
• 2023

The main purpose of the current research is to develop an efficient two variables trigonometric shear deformation beam theory to investigate the buckling behavior of symmetric and non-symmetric functionally graded carbon nanotubes reinforced composite (FG-CNTRC) beam resting on an elastic foundation with various boundary conditions. The proposed theory obviates the use to shear correction factors as it satisfies the parabolic variation of through-thickness shear stress distribution. The composite beam is made of a polymeric matrix reinforced by aligned and distributed single-walled carbon nanotubes (SWCNTs) with different patterns of reinforcement. The material properties of the FG-CNTRC beam are estimated by using the rule of mixture. The governing equilibrium equations are solved by using new analytical solutions based on the Galerkin method. The robustness and accuracy of the proposed analytical model are demonstrated by comparing its results with those available by other researchers in the existing literature. Moreover, a comprehensive parametric study is presented and discussed in detail to show the effects of CNTs volume fraction, distribution patterns of CNTs, boundary conditions, length-to-thickness ratio, and spring constant factors on the buckling response of FG-CNTRC beam. Some new referential results are reported for the first time, which will serve as a benchmark for future research.

• Health Policy and Management
• /
• v.33 no.1
• /
• pp.3-18
• /
• 2023

Background: A chronic disease management program including patient education, recall and remind service, and reduction of out-of-pocket payment was implemented in Korea through a chronic care model. This study aimed to assess the effect of a community-based intervention program for improving medication adherence of patients with diabetes mellitus in rural areas of Korea. Methods: We applied a non-equivalent control group design using Korean National Health Insurance Big Data. Hongcheon County has been continuously adopting this program since 2012 as an intervention region. Hoengseong County did not adopt such program. It was used as a control region. Subjects were a cohort of patients with diabetes mellitus aged more than 65 years but less than 85 years among residents for 11 years from 2010 to 2020. After 1:1 matching, there were 368 subjects in the intervention region and 368 in the control region. Indirect indicators were analyzed using the difference-in-difference regression according to Andersen's medical use model. Results: The increasing percent point of diabetic patients who continuously received insurance benefits for more than 240 days from 2010 to 2014 and from 2010 to 2020 were 2.6%p and 2.7%p in the intervention region and 3.0%p and 3.9%p in the control region, respectively. The number of dispensations per prescription of diabetic patient in the intervention region increased by approximately 4.61% by month compared to that in the control region. Conclusion: The intervention program encouraged older people with diabetes mellitus to receive continuous care for overcoming the rule of halves in the community. More research is needed to determine whether further improvement in the continuity of comprehensive care can prevent the progression of cardiovascular diseases.

• Asia Marketing Journal
• /
• v.15 no.3
• /
• pp.159-172
• /
• 2013

In the present study, we apply the multiple cue probability learning (MCPL) paradigm to examine consumer learning from feedback in repeated trials. This paradigm is useful in investigating consumer learning, especially learning the relationships between the overall quality and attributes. With this paradigm, we can analyze what people learn from repeated trials by using the lens model, i.e., whether it is knowledge or consistency. In addition to introducing this paradigm, we aim to demonstrate that knowledge people gain from repeated trials with feedback is robust enough to weaken one of the most often examined contextual effects, the asymmetric dominance effect. The experiment consists of learning session and a choice task and stimuli are sport rafting boats with motor engines. During the learning session, the participants are shown an option with three attributes and are asked to evaluate its overall quality and type in a number between 0 and 100. Then an expert's evaluation, a number between 0 and 100, is provided as feedback. This trial is repeated fifteen times with different sets of attributes, which comprises one learning session. Depending on the conditions, the participants do one (low) or three (high) learning sessions or do not go through any learning session (no learning). After learning session, the participants then are provided with either a core or an extended choice set to make a choice to examine if learning from feedback would weaken the asymmetric dominance effect. The experiment uses a between-subjects experimental design (2 × 3; core set vs. extended set; no vs. low vs. high learning). The results show that the participants evaluate the overall qualities more accurately with learning. They learn the true trade-off rule between attributes (increase in knowledge) and become more consistent in their evaluations. Regarding the choice task, there is a significant decrease in the percentage of choosing the target option in the extended sets with learning, which clearly demonstrates that learning decreases the magnitude of the asymmetric dominance effect. However, these results are significant only when no learning condition is compared either to low or high learning condition. There is no significant result between low and high learning conditions, which may be due to fatigue or reflect the characteristics of learning curve. The present study introduces the MCPL paradigm in examining consumer learning and demonstrates that learning from feedback increases both knowledge and consistency and weakens the asymmetric dominance effect. The latter result may suggest that the previous demonstrations of the asymmetric dominance effect are somewhat exaggerated. In a single choice setting, people do not have enough information or experience about the stimuli, which may lead them to depend mostly on the contextual structure among options. In the future, more realistic stimuli and real experts' judgments can be used to increase the external validity of study results. In addition, consumers often learn through repeated choices in real consumer settings. Therefore, what consumers learn from feedback in repeated choices would be an interesting topic to investigate.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1041-1043
• /
• 1993

Fuzzy logic based Control Theory has gained much interest in the industrial world, thanks to its ability to formalize and solve in a very natural way many problems that are very difficult to quantify at an analytical level. This paper shows a solution for treating membership function inside hardware circuits. The proposed hardware structure optimizes the memoried size by using particular form of the vectorial representation. The process of memorizing fuzzy sets, i.e. their membership function, has always been one of the more problematic issues for the hardware implementation, due to the quite large memory space that is needed. To simplify such an implementation, it is commonly [1,2,8,9,10,11] used to limit the membership functions either to those having triangular or trapezoidal shape, or pre-definite shape. These kinds of functions are able to cover a large spectrum of applications with a limited usage of memory, since they can be memorized by specifying very few parameters ( ight, base, critical points, etc.). This however results in a loss of computational power due to computation on the medium points. A solution to this problem is obtained by discretizing the universe of discourse U, i.e. by fixing a finite number of points and memorizing the value of the membership functions on such points [3,10,14,15]. Such a solution provides a satisfying computational speed, a very high precision of definitions and gives the users the opportunity to choose membership functions of any shape. However, a significant memory waste can as well be registered. It is indeed possible that for each of the given fuzzy sets many elements of the universe of discourse have a membership value equal to zero. It has also been noticed that almost in all cases common points among fuzzy sets, i.e. points with non null membership values are very few. More specifically, in many applications, for each element u of U, there exists at most three fuzzy sets for which the membership value is ot null [3,5,6,7,12,13]. Our proposal is based on such hypotheses. Moreover, we use a technique that even though it does not restrict the shapes of membership functions, it reduces strongly the computational time for the membership values and optimizes the function memorization. In figure 1 it is represented a term set whose characteristics are common for fuzzy controllers and to which we will refer in the following. The above term set has a universe of discourse with 128 elements (so to have a good resolution), 8 fuzzy sets that describe the term set, 32 levels of discretization for the membership values. Clearly, the number of bits necessary for the given specifications are 5 for 32 truth levels, 3 for 8 membership functions and 7 for 128 levels of resolution. The memory depth is given by the dimension of the universe of the discourse (128 in our case) and it will be represented by the memory rows. The length of a world of memory is defined by: Length = nem (dm(m)＋dm(fm) Where: fm is the maximum number of non null values in every element of the universe of the discourse, dm(m) is the dimension of the values of the membership function m, dm(fm) is the dimension of the word to represent the index of the highest membership function. In our case then Length=24. The memory dimension is therefore 128*24 bits. If we had chosen to memorize all values of the membership functions we would have needed to memorize on each memory row the membership value of each element. Fuzzy sets word dimension is 8*5 bits. Therefore, the dimension of the memory would have been 128*40 bits. Coherently with our hypothesis, in fig. 1 each element of universe of the discourse has a non null membership value on at most three fuzzy sets. Focusing on the elements 32,64,96 of the universe of discourse, they will be memorized as follows: The computation of the rule weights is done by comparing those bits that represent the index of the membership function, with the word of the program memor . The output bus of the Program Memory (μCOD), is given as input a comparator (Combinatory Net). If the index is equal to the bus value then one of the non null weight derives from the rule and it is produced as output, otherwise the output is zero (fig. 2). It is clear, that the memory dimension of the antecedent is in this way reduced since only non null values are memorized. Moreover, the time performance of the system is equivalent to the performance of a system using vectorial memorization of all weights. The dimensioning of the word is influenced by some parameters of the input variable. The most important parameter is the maximum number membership functions (nfm) having a non null value in each element of the universe of discourse. From our study in the field of fuzzy system, we see that typically nfm 3 and there are at most 16 membership function. At any rate, such a value can be increased up to the physical dimensional limit of the antecedent memory. A less important role n the optimization process of the word dimension is played by the number of membership functions defined for each linguistic term. The table below shows the request word dimension as a function of such parameters and compares our proposed method with the method of vectorial memorization[10]. Summing up, the characteristics of our method are: Users are not restricted to membership functions with specific shapes. The number of the fuzzy sets and the resolution of the vertical axis have a very small influence in increasing memory space. Weight computations are done by combinatorial network and therefore the time performance of the system is equivalent to the one of the vectorial method. The number of non null membership values on any element of the universe of discourse is limited. Such a constraint is usually non very restrictive since many controllers obtain a good precision with only three non null weights. The method here briefly described has been adopted by our group in the design of an optimized version of the coprocessor described in [10].