• Journal of the Korea Society of Computer and Information
• /
• v.20 no.10
• /
• pp.61-68
• /
• 2015

This paper deals with the pre-marshalling problem that the containers of container yard at container terminal are relocated in consensus sequence of loading schedule of container vessel. This problem is essential to improvement of competitive power of terminal. This problem has to relocate the all of containers in a bay with minimum number of movement. There are various algorithms such as metaheuristic as genetic algorithm and heuristic algorithm in order to find the solution of this problem. Nevertheless, there is no unique general algorithm that is suitable for various many data. And the main drawback of metaheuristic methods are not the solution finding rule but can be find the approximated solution with many random trials and by coincidence. This paper can be obtain the solution with O(m) time complexity that this problem deals with bin packing problem for m stack bins with descending order of take out ranking. For various experimental data, the proposed algorithm can be obtain the optimal solutions for all of data. And to conclude, this algorithm can be show that most simple and general algorithm with simple optimal solution finding rule.

• Korean Journal of Soil Science and Fertilizer
• /
• v.45 no.3
• /
• pp.360-369
• /
• 2012

Parent material, climate, topography, biological factors, and time are considered five soil forming factors. This study was conducted to elucidate the effects of several environment factors on soil distribution using quantitative analysis method, called soil series estimation algorithm in the soils of Jeju Island. We selected environment factors including mean temperature, annual precipitation, surface geology, altitude, slope, aspect, altitude difference within 1 $km^2$ area, topographic wetness index, distance from the shore, distance from the mountain peak, and landuse for a quantitative analysis. We analyzed the ranges of environment factors for each soil series and calculated probabilities of possible-soil series for certain locations using estimation algorithm. The algorithm can predicted exact soil series on the soil map with correctness of 33% on $1^{st}$ ranking, 62% within $2^{nd}$ ranking, 74% within $5^{th}$ ranking after estimating using randomly extracted environment factors. In predicted soil map, soil sequences of Entisols-Alfisols-Andisols on northern area and Alfisols-Ultisols-Andisols on western area can be suggested along increasing altitude. More modeling studies will be needed for the genesis process of soils in Jeju Island.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.285-289
• /
• 2009

Tag is important to retrieve and classify contents. However, someone uses so many unrelated tags with contents for the high ranking In this work, we propose tag refinement algorithm using TextRank. We calculate the importance of keywords occurred a title, description, tag, and comments. We refine tags removing unrelated keywords from user generated tags. From the results of experiments, we can see that proposed method is useful for refining tags.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.163-163
• /
• 1988

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.163-175
• /
• 1996

This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2728-2739
• /
• 1999

This paper proposes an effective fusion algorithm for retrieval results from heterogeneous information sources in federated digital libraries. The algorithm determines the population of documents retrieved from involved information sources for a given query and evaluates the degree of relevance between the query and the population. The evaluated results are used as relevance distribution information for collection fusion. The main informations used for the fusion are relevance distribution among collections, the population size N, and ranking information of relevant documents in their origin. We also present th performance evaluation of the algorithm by developing the prototype of a meta-searcher.

• International Journal of Computer Science & Network Security
• /
• v.23 no.3
• /
• pp.161-168
• /
• 2023

It is a common practice to use a password in order to restrict access to information, or in a general sense, to assets. Right selection of the password is necessary for protecting the assets more effectively. Password finding/cracking try outs are performed for deciding which level of protection do used or prospective passwords offer, and password cracking algorithms are generated. These algorithms are becoming more intelligent and succeed in finding more number of passwords in less tries and in a shorter duration. In this study, the performances of possible password finding algorithms are measured, and a hybrid algorithm based on the performances of different password cracking algorithms is generated, and it is demonstrated that the performance of the hybrid algorithm is superior to the base algorithms.

• International conference on construction engineering and project management
• /
• 2011.02a
• /
• pp.575-581
• /
• 2011

A novel approach for analysis of criticality with respect to path and to activity in networks with fuzzy activity durations is proposed. After recalling the Yager ranking method, the relative degree of criticality of activities and paths are defined. An efficient algorithm based on path enumeration to compute the relative degree of criticality of activities and paths in networks with fuzzy durations is proposed. Examples of former researches are employed to validate the proposed approach. The proposed algorithm has been tested on real world project networks and experimental results have shown that the algorithm can calculate the relative degree of criticality of activities and paths in a reasonable time.

• Journal of KIISE:Software and Applications
• /
• v.36 no.3
• /
• pp.236-243
• /
• 2009

With advances in topic detection and tracking(TDT), automatic trend analysis from a collection of time-stamped documents, like patents, news papers, and blog pages, is a challenging research problem. Past research in this area has mainly focused on showing a trend line over time of a given concept by measuring the strength of trend-associated term frequency information. for detection of emerging trends, either a simple criterion such as frequency change was used, or an overall comparison was made against a training data. We note that in order to show most salient trends detected among many possibilities, it is critical to devise a ranking function. To this end, we define four properties(change, persistency, stability and volume) of trend lines drawn from frequency information, to quantify various aspects of trends, and propose a method by which trend lines can be ranked. The properties are examined individually and in combination in a series of experiments for their validity using the ranking algorithm. The results show that a judicious combination of the four properties is a better indicator for salient trends than any single criterion used in the past for ranking or detecting emerging trends.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.631-640
• /
• 2003

Because of multi-hop wireless communication, P2P applications in ad hoc networks suffer poor performance. We Propose neighbor caching strategy to overcome this shortcoming and show it is more efficient than self caching that nodes store data in theirs own cache individually. A node can extend its caching storage instantaneously with neighbor caching by borrowing the storage from idle neighbors, so overcome multi-hop wireless communications with data source long distance away from itself. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The node that uses the ranking based prediction can select the neighbor that has high possibility to keep data for a long time and avoid caching the low ranked data. Therefore the ranking based prediction improves the throughput of neighbor caching. In the simulation results, we observe that neighbor caching has better performance, as large as network size, as long as idle time, and as small as cache size. We also show the ranking based prediction is an adaptive algorithm that adjusts times of data movement into the neighbor, so makes neighbor caching flexible according to the idleness of nodes