• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.47-56
• /
• 2003

According to rapidly developed mobile terminals and network in the play environment for multimedia presentation, different end-to-end QoS situations appear. Then the generation of transcoding path algorithm was reviewed to transcode a source'data satisfying the needed QoS from a destination and play it considering given transcoders and network. This method used only workload as a parameter although two parameters, workload and throughput, were needed to process multimedia stream in a transcoder, Therefore generated transcoding path with this method had additional calculation to check playability whether it was safisfed the QoS of a destination or not. To solve the problem this paper suggests T algorithm with evaluation function using isochronous property that is needed for multimedia stream to arrive a destination. That means, most playable path is selected with heuristic search based isochronous property between many transcoding paths. Using the suggested algorithm, a transcoding path can be generated faster to play the multimedia data with different end-to-end QoS in real-time transmission.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.109-121
• /
• 2007

In this study, an imputation model using circular probability distribution was developed in order to overcome problems of missing data from a traffic survey. The existing ad-hoc or heuristic, model-based and algorithm-based imputation techniques were reviewed through previous studies, and then their limitations for imputing missing traffic volume data were revealed. The statistical computing language 'R' was employed for model construction, and a mixture of von Mises probability distribution, which is classified as symmetric, and unimodal circular probability were finally fitted on the basis of traffic volume data at survey stations in urban and rural areas, respectively. The circular probability distribution model largely proved to outperform a dummy variable regression model in regards to various evaluation conditions. It turned out that circular probability distribution models depict circularity of hourly volumes well and are very cost-effective and robust to changes in missing mechanisms.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.8
• /
• pp.621-629
• /
• 2020

LRU layout is a complex problem that requires consideration of various criteria such as airworthiness, performance, maintainability and environmental requirements. As aircraft functions become more complex, the necessary equipment is increasing, and unmanned aerial vehicles are equipped with more equipment as a substitute for pilots. Due to the complexity of the problem, the increase in the number of equipment, and the limited development period, the placement of equipment is largely dependent on the engineer's insight and experience. For optimization, quantitative criteria are required for evaluation, but criteria such as safety, performance, and maintainability are difficult to quantitatively compare or have limitations. In this study, we consider the installation and maintenance of the equipment, simplify the deployment model to the traveling salesman problem, Optimization was performed using a genetic algorithm to minimize the weight of the connecting cable between the equipment. When the optimization results were compared with the global calculations, the same results were obtained with less time required, and the improvement was compared with the heuristic.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.51-57
• /
• 2008

We present a modeling of constraint satisfaction problems and provide heuristic algorithms of backtracking search to optimize the frequency assignment. Our research objective is to find a frequency assignment that satisfies all the constraints using minimum number of frequencies while maximizing the number of community radio stations served for a given area. In order to get a effective solution, some ordering heuristics such as variable orderings and value orderings are provided to minimize the backtracking in finding all solutions within a limited time. To complement the late detection of inconsistency in the backtracking, we provide the consistency enforcing technique or constraint propagation to eliminate the values that are inconsistent with some constraints. By integrating backtracking search algorithms with consistency enforcing techniques, it is possible to obtain more powerful and effective algorithms of constraint satisfaction problems. We also provide the performance evaluation of proposed algorithms by comparing the theoretical lower bound and our computed solution.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2002-2007
• /
• 2006

The path search method in the telematics system should consider traffic flow of the roads as well as the shortest time because the optimal path with minimized travel time could be continuously changed by the traffic flow. The existing path search methods are not able to cope efficiently with the change of the traffic flow. The search method to use traffic information also needs more computation time than the existing shortest path search. In this paper, a method for efficiency improvement of path search is implemented and its performance is evaluated. The method employs the fixed grid for adjustable heuristic to traffic flow. Moreover, in order to simplify the computation of estimation values, it only adds graded decimal values instead of multiplication operation of floating point numbers with due regard to the gradient between a departure and a destination. The results obtained from the experiments show that it achieves the high accuracy and short execution time as well.

• Journal of Digital Convergence
• /
• v.17 no.4
• /
• pp.249-254
• /
• 2019

As an alternative to the growing problem of weather anomalies, users are using mobile weather apps to predict the weather. Even though it provides clear information, the user makes mistakes in forecasting the weather. For this reason, The purpose of this study is to find elements that can be prepared for the volatile weather through mobile application. Jakob Nielsen's "heuristic" evaluation found weaknesses in the application. Then I proceeded to analyze it from a behavioral economics standpoint. As a result, the two applications had various functions and accurate information. However, user accessibility was low and focused on 'information delivery'.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.778-785
• /
• 2020

Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.409-420
• /
• 2001

Recently a new approach to evaluation of software reliability, one of important attributes of a software system, during testing has been devised. This approach utilizes test coverage information. The coverage-based software reliability growth models recently appeared in the literature are first reviewed and classified into two classes. Inherent problems of each of the two classes are then discussed and their validity is empirically investigated. In addition, a new mean value function in coverage and a heuristic procedure for selecting the best coverage are proposed.

• Smart Structures and Systems
• /
• v.6 no.1
• /
• pp.39-56
• /
• 2010

Structural Control relies, with a great deal, on the ability of the control algorithm to identify the current state of the system, at any given point in time. When such algorithms are designed to perform in a smart manner, several smart technologies/devices are called upon to perform tasks that involve pattern recognition and control. Smart pattern recognition is proposed to replace/enhance traditional state identification techniques, which require the extensive manipulation of intricate mathematical equations. Smart pattern recognition techniques attempt to emulate the behavior of the human brain when performing abstract pattern identification. Since these techniques are largely heuristic in nature, it is reasonable to ensure their reliability under real life situations. In this paper, a neural network pattern recognition scheme is explored. The pattern identification of three structural systems is considered. The first is a single bay three-story frame. Both the second and the third models are variations on benchmark problems, previously published for control strategy evaluation purposes. A Neural Network was developed and trained to identify the deformed shape of structural systems under earthquake excitation. The network was trained, for each individual model system, then tested under the effect of a different set of earthquake records. The proposed smart pattern identification scheme is considered an integral component of a Smart Structural System. The Reliability assessment of such component represents an important stage in the evaluation of an overall reliability measure of Smart Structural Systems. Several studies are currently underway aiming at the identification of a reliability measure for such smart pattern recognition technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3393-3412
• /
• 2017

As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.