• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.581-584
• /
• 2008

본 논문은 피터슨 그래프를 기반으로 설계된 노드수가 증가함에 따라 분지수가 증가하는 하이퍼 피터슨을 분지수가 고정인 피터슨-토러스(PT) 네트워크에 임베딩 가능함을 보인다. 하이퍼 피터슨 $HP_{log_2n^2+3}$을 PT(n,n)에 확장율 1, 연장율 1.5n+2 그리고 밀집율 5n에 임베딩 하였다.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.4 no.2
• /
• pp.37-43
• /
• 2005

A simple scheduler satisfying the proportional fairness (PF) was introduced in wireless access networks and revealed that it can achieve a good compromise between total throughput and user fairness. Though it has received much attention for some time, its application was mainly restricted to the single channel systems. In this paper, we study how to implement the PF scheduler in the multi-channel environments such as OFDMA/TDMA. Besides the traditional PF-SC scheme, we propose a new PF-OPT scheme that is the genuine PF scheduler in a sense of maximizing the total log-utility of users. The simulation results show that PF-OPT gives large throughput under the heterogeneous subchannel statistics.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.144-149
• /
• 2020

A database called Home Location Register(HLR) plays a major role in location management in mobile cellular networks. The objectives of this paper are to identify the problems of the current HLR system through rigorous analysis, to suggest solutions to them. The current HLR backup method is a process of simply writing the changed memory SLD block to disk, which has a problem in maintaining database consistency. Since information change and backup are performed separately by separate processes, there is a risk of information inconsistency when an error restart occurs. To solve this problem, a transaction concept was introduced for subscriber-related operation functions and a recovery method through logging and checkpointing was introduced. The subscriber related functions of tasks terminated normally by the suggested process are recovered with consistency even after system restarts. Performance is also not affected seriously because disk tasks for log occur with only subscriber related functions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.6
• /
• pp.860-867
• /
• 1986

It was shown previously that four tests are required in order to detect single fault and to locate single link stuck fault for a class of multistage interconnection networks. In this paper, we show that only three tests are necessary and sufficient both to detect single fault and to locate single link stuck fault. A fault diagnosis method with four valid state for a class of multistage kinterconnection networks is presented. Using this method, all single link stuck fault or all single switching element faults, can be detected by at most 4 log2N+e tests. In the example, the location and type of single fault are pinpointed, and unlocatable probabilities of questionable of questionable regions are given.

• International Journal of Contents
• /
• v.8 no.4
• /
• pp.30-35
• /
• 2012

Error surfaces provide us with very important information for training of feed-forward neural networks (FNNs). In this paper, we draw the contour plots of various error or objective functions for training of FNNs. Firstly, when applying FNNs to classifications, the weakness of mean-squared error is explained with the viewpoint of error contour plot. And the classification figure of merit, mean log-square error, cross-entropy error, and n-th order extension of cross-entropy error objective functions are considered for the contour plots. Also, the recently proposed target node method is explained with the viewpoint of contour plot. Based on the contour plots, we can explain characteristics of various error or objective functions when training of FNNs proceeds.

• ETRI Journal
• /
• v.37 no.4
• /
• pp.736-742
• /
• 2015

A serial concatenated decoding algorithm with dynamic threshold is proposed for low-density parity-check codes with short and medium code lengths. The proposed approach uses a dynamic threshold to select a decoding result from belief propagation decoding and order statistic decoding, which improves the performance of the decoder at a negligible cost. Simulation results show that, under a high SNR region, the proposed concatenated decoder performs better than a serial concatenated decoder without threshold with an Eb/N0 gain of above 0.1 dB.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.42 no.3
• /
• pp.464-477
• /
• 2013

There is a great need to develop a training program proven to change behavior and improve knowledge. The purpose of this study was to evaluate employee hygiene knowledge, hygiene practice, and cleanliness, before and after HACCP system implementation at one small-size restaurant. The efficiency of the system was analyzed using time-temperature control after implementation of u-HACCP$^{(R)}$. The employee hygiene knowledge and practices showed a significant improvement (p<0.05) after HACCP system implementation. In non-heating processes, such as seasoned lettuce, controlling the sanitation of the cooking facility and the chlorination of raw ingredients were identified as the significant CCP. Sanitizing was an important CCP because total bacteria were reduced 2~4 log CFU/g after implementation of HACCP. In bean sprouts, microbial levels decreased from 4.20 logCFU/g to 3.26 logCFU/g. There were significant correlations between hygiene knowledge, practice, and microbiological contamination. First, personnel hygiene had a significant correlation with 'total food hygiene knowledge' scores (p<0.05). Second, total food hygiene practice scores had a significant correlation (p<0.05) with improved microbiological qualities of lettuce salad. Third, concerning the assessment of microbiological quality after 1 month, there were significant (p<0.05) improvements in times of heating, and the washing and division process. On the other hand, after 2 months, microbiological was maintained, although only two categories (division process and kitchen floor) were improved. This study also investigated time-temperature control by using ubiquitous sensor networks (USN) consisting of an ubi reader (CCP thermometer), an ubi manager (tablet PC), and application software (HACCP monitoring system). The result of the temperature control before and after USN showed better thermal management (accuracy, efficiency, consistency of time control). Based on the results, strict time-temperature control could be an effective method to prevent foodborne illness.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.674-684
• /
• 2000

One key obstacle which has been identified in achieving parallel processing is to communicate effectively between processors during execution. One approach to achieving an optimal delay time is to use expander graph. The networks and algorithms which are based on expander graphs are successfully exploited to yield fast parallel algorithms and efficient design. The AKS sorting algorithm in time O(logN) which is an important result is based on the use of expanders. The expander graph also can be applied to construct a concentrator and a superconcentrator. Since Margulis found a way to construct an explicit linear expander graph, several expander graphs have been developed. But the proof of existence of such graphs is in fact provided by a nonconstructive argument. We investigate the expander network on the hypercube network. We prove the expansion of a sin81e stage hypercube network and extend this from a single stage to multistage networks. The results in this paper provide a theoretical analysis of expansion in the hypercube network.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.4
• /
• pp.435-442
• /
• 2007

To reduce damage from high concentration ozone in the air, we have researched how to predict high concentration ozone before it occurs. High concentration ozone is a rare event and its reaction mechanism has nonlinearities and complexities. In this paper, we have tried to apply and consider as many methods as we could. We clustered the data using the fuzzy c-mean method and took a rejection sampling to fill in the missing and abnormal data. Next, correlations of the input component and output ozone concentration were calculated to transform more correlated components by modified log transformation. Then, we made the prediction models using Dynamic Polynomial Neural Networks. To select the optimal model, we adopted a minimum bias criterion. Finally, to evaluate suggested models, we compared the two models. One model was trained and tested by the transformed data and the other was not. We concluded that the modified transformation effected good to ideal performance In some evaluations. In particular, the data were related to seasonal characteristics or its variation trends.