• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1872-1879
• /
• 2001

As multiview video applications become more popular, correspondence problem for stereo image matching plays an important role in expanding view points. Thus, we propose an efficient dense disparity estimation algorithm considering features of each image pair of multiview image sets. Main concepts of the proposed algorithm are based on the region-dividing-bidirectional-pixel-matching method. This algorithm makes matching process efficient and keeps the reliability of the estimated disparities. Other improvement have obtained by proposed cost function, matching window expanding technique, disparity regularization, and disparity assignment in ambiguous region. These techniques make disparities more stable by removing false disparities and ambiguous regions. The estimated disparities are used to synthesize intermediate views of multiview images. Computer simulation demonstrates the excellence of the proposed algorithm in both subjective and objective evaluations. In addition, processing time is reduced as well.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.50-64
• /
• 2016

Nowadays, smart meter (SM) technology is widely effectively used. In addition, power allocation (PA) and channel selection (CS) are considered problems with many proposed approaches. In this paper, we will suggest a specific scenario for an SM configuration system and show how to solve the optimization problem for transmission between SMs and the data concentrator unit (DCU), the center that collects the data from several SMs, via simulation. An efficient CS with PA scheme is proposed in the TV white space system, which uses the TV band spectrum. On the basic of the optimal configuration requirements, SMs can have a transmission schedule and channel selection to obtain the optimal efficiency of using spectrum resources when transmitting data to the DCU. The optimal goals discussed in this paper are the maximum capacity or maximum channel efficiency and the maximum allowable power of the SMs used to satisfy the quality of service without harm to another wireless system. In addition, minimization of the interference to the digital television system and other SMs is also important and needs to be considered when the solving coexistence scenario. Further, we propose a process that performs an interference analysis scheme by using the spectrum engineering advanced Monte Carlo analysis tool (SEAMCAT), which is an integrated software tool based on a Monte-Carlo simulation method. Briefly, the process is as follows: The optimization process implemented by genetic evolution optimization engines, i.e., a genetic algorithm, will calculate the best configuration for the SM system on the basis of the interference limitation for each SM by SEAMCAT in a specific configuration, which reaches the solution with the best defined optimal goal satisfaction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1210-1220
• /
• 2016

As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.213-220
• /
• 2004

Evolutionary algorithms are well-suited for multi-objective optimization problems involving several. often conflicting objective. Pareto-based evolutionary algorithms, in particular, have shown better performance than other multi-objective evolutionary algorithms in comparison. Recently, pareto-based evolutionary algorithms uses a density information in fitness assignment scheme for generating uniform distributed global pareto optimal front. However, the usage of density information is not Important elements in a whole evolution path but plays an auxiliary role in order to make uniform distribution. In this paper, we propose an evolutionary algorithms for multi-objective optimization which assigns the fitness using pareto dominance rank and density weighting, and thus pareto dominance rank and density have similar influence on the whole evolution path. Furthermore, the experimental results, which applied our method to the six multi-objective optimization problems, show that the proposed algorithms show more promising results.

• Journal of the Korean Society for information Management
• /
• v.22 no.1 s.55
• /
• pp.191-208
• /
• 2005

This study utilizes various approaches for new topic detection in the process of assigning and updating descriptors, which is a representation method of the knowledge structure. Particularly in the case of occurring changes on the knowledge structure due to the appearance and development of new topics in specific study areas, new topic detection can be applied to solving the impossibility or limitation of the existing index terms in representing subject concepts. This study confirms that the majority of newly developing topics in information science are closely associated with each other and are simultaneously in the phase of growth and development. Also, this study shows the possibility that the use of candidate descriptor lists generated by new topic detection methods can be an effective tool in assisting indexers. In particular. the provision of candidate descriptor lists to help assignment of appropriate descriptors will contribute to the improvement of the effectiveness and accuracy of indexing.

• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.59-66
• /
• 2015

A stochastic modeling approach as a mathematical method for workflow intelligence is widely used for analyzing and simulating workflow models in the literature. In particular, as a resource-centric modeling approach, this paper proposes a stochastic model to represent work-handover relationships between performers in a workflow-supported social network. Calculating probabilities for the work-handover relationships are determined by two types of probabilities. One is the work-transition probability between activities, and the other is the task assignment probability between activities and performers. In this paper, we describe formal definitions of stochastic workflow models and stochastic work-handover relationship models, as well. Then, we propose an algorithm for extracting a stochastic work-handover relationship model from a stochastic workflow model. As a consequence, the proposed model ought to be useful in performing resource-centric workflow simulations and model-log comparison analyses.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.2
• /
• pp.18-28
• /
• 2006

We consider a Direct Input Output Manufacturing System(DIOMS) which has a munber of machine centers placed along a built-in Automated Storage/Retrieval System(AS/RS). The Storage/Retrieval (S/R) machine handles parts placed on pallets for the operational aspect of DIOMS and determines the optimal operating policy by combining computer simulation and genetic algorithm. The operational problem includes: input sequencing control, dispatching rule of the S/R machine, machine center-based part type selection rule, and storage assignment policy. For each operating policy, several different policies are considered based on the known research results. In this paper, using the computer simulation and genetic algorithm we suggest a method which gives the optimal configuration of operating policies within reasonable computation time.

• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.996-1001
• /
• 2010

In this paper, network selection algorithm for services of mobile IPTV(internet protocol television) and implementation of a hierarchical processing system for reducing overload by terminal with low speed is proposed. This algorithm selects the network according to the following priorities derived from formulas; value that uses remaining bandwidth, network cost, signal strength. If terminal has a low processing power for using selected network and TV service, quality of service declines due to the system overloading. Hence, we implemented system which processes selected network and TV services accomplished by layer divided. Through experiments results, the method of direct user network selection waits for bandwidth assignment. However, on the one hand, that waiting time in exhausted situation will be very long. On the other hand, if we consider the priority plot of used networks, we should select the network with the best state. Therefore, data transmission rate will keep on average and the waiting time will be low.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.7
• /
• pp.275-288
• /
• 2019

In this paper, we consider a rumor source inference problem when sufficiently many nodes heard the rumor in the network. This is an important problem because information spread in networks is fast in many real-world phenomena such as diffusion of a new technology, computer virus/spam infection in the internet, and tweeting and retweeting of popular topics and some of this information is harmful to other nodes. This problem has been much studied, where it has been shown that the detection probability cannot be beyond 31% even for regular trees if the number of infected nodes is sufficiently large. Motivated by this, we study the impact of query that is asking some additional question to the candidate nodes of the source and propose budget assignment algorithms of a query when the network administrator has a finite budget. We perform various simulations for the proposed method and obtain the detection probability that outperforms to the existing prior works.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.2
• /
• pp.133-138
• /
• 2019

In this study, we analyzed the current status and limitations of software education in A education universities. In order to solve these problems, technical support assistant teachers were employed and operated. During the course of the course, we conducted interviews with the instructor and the technical support teacher. The satisfaction of the teacher in the training school was high and I wanted to be supported continuously. It also called for the capacity building of assistant teachers and the establishment of a pool of staff. On the other hand, the assistant teachers suggested that the role assignment of team teaching should be clarified and a guide of activities should be presented. The technical assistance assistant teacher input system discussed in this study may be different from the practice system of each university, and generalization may be limited. Therefore, it is expected that the effective implementation method will be shared and the software education will be activated.