• Korean Journal of Agricultural and Forest Meteorology
• /
• v.12 no.2
• /
• pp.122-131
• /
• 2010

This paper introduces the concept of a virtual ecosystem and reports the following three mathematical approaches that could be widely used to construct such an ecosystem, along with examples: (1) a molecular dynamics simulation approach for animal flocking behavior, (2) a stochastic lattice model approach for termite colony behavior, and (3) a rule-based cellular automata approach for biofilm growth. The ecosystem considered in this study consists of artificial organisms and their environment. Each organism in the ecosystem is an agent that interacts autonomously with the dynamic environment, including the other organisms within it. The three types of model were successful to account for each corresponding ecosystem. In order to accurately mimic a natural ecosystem, a virtual ecosystem needs to take many ecological variables into account. However, doing so is likely to introduce excess complexity and nonlinearity in the analysis of the virtual ecosystem's dynamics. Nonetheless, the development of a virtual ecosystem is important, because it can provide possible explanations for various phenomena such as environmental disturbances and disasters, and can also give insights into ecological functions from an individual to a community level from a synthetic viewpoint. As an example of how lower and higher levels in an ecosystem can be connected, this paper also briefly discusses the application of the second model to the simulation of a termite ecosystem and the influence of climate change on the termite ecosystem.

• Journal of Internet Computing and Services
• /
• v.16 no.1
• /
• pp.67-74
• /
• 2015

In recent years, frequent itemset mining for considering the importance of each item has been intensively studied as one of important issues in the data mining field. According to strategies utilizing the item importance, itemset mining approaches for discovering itemsets based on the item importance are classified as follows: weighted frequent itemset mining, frequent itemset mining using transactional weights, and utility itemset mining. In this paper, we perform empirical analysis with respect to frequent itemset mining algorithms based on transactional weights. The mining algorithms compute transactional weights by utilizing the weight for each item in large databases. In addition, these algorithms discover weighted frequent itemsets on the basis of the item frequency and weight of each transaction. Consequently, we can see the importance of a certain transaction through the database analysis because the weight for the transaction has higher value if it contains many items with high values. We not only analyze the advantages and disadvantages but also compare the performance of the most famous algorithms in the frequent itemset mining field based on the transactional weights. As a representative of the frequent itemset mining using transactional weights, WIS introduces the concept and strategies of transactional weights. In addition, there are various other state-of-the-art algorithms, WIT-FWIs, WIT-FWIs-MODIFY, and WIT-FWIs-DIFF, for extracting itemsets with the weight information. To efficiently conduct processes for mining weighted frequent itemsets, three algorithms use the special Lattice-like data structure, called WIT-tree. The algorithms do not need to an additional database scanning operation after the construction of WIT-tree is finished since each node of WIT-tree has item information such as item and transaction IDs. In particular, the traditional algorithms conduct a number of database scanning operations to mine weighted itemsets, whereas the algorithms based on WIT-tree solve the overhead problem that can occur in the mining processes by reading databases only one time. Additionally, the algorithms use the technique for generating each new itemset of length N+1 on the basis of two different itemsets of length N. To discover new weighted itemsets, WIT-FWIs performs the itemset combination processes by using the information of transactions that contain all the itemsets. WIT-FWIs-MODIFY has a unique feature decreasing operations for calculating the frequency of the new itemset. WIT-FWIs-DIFF utilizes a technique using the difference of two itemsets. To compare and analyze the performance of the algorithms in various environments, we use real datasets of two types (i.e., dense and sparse) in terms of the runtime and maximum memory usage. Moreover, a scalability test is conducted to evaluate the stability for each algorithm when the size of a database is changed. As a result, WIT-FWIs and WIT-FWIs-MODIFY show the best performance in the dense dataset, and in sparse dataset, WIT-FWI-DIFF has mining efficiency better than the other algorithms. Compared to the algorithms using WIT-tree, WIS based on the Apriori technique has the worst efficiency because it requires a large number of computations more than the others on average.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.26 no.1
• /
• pp.103-113
• /
• 2020

Jack-up drilling rigs are widely used in the offshore oil and gas exploration industry. Although originally designed for use in shallow waters, trends in the energy industry have led to a growing demand for their use in deep sea and harsh environmental conditions. To extend the operating range of jack-up units, their design must be based on reliable analysis while eliminating excessive conservatism. In current industrial practice, jack-up drilling rigs are designed using the working(or allowable) stress design (WSD) method. Recently, classifications have been developed for specific regulations based on the load and resistance factor design (LRFD) method, which emphasises the reliability of the methods. This statistical method utilises the concept of limit state design and uses factored loads and resistance factors to account for uncertainly in the loads and computed strength of the leg components in a jack-up drilling rig. The key differences between the LRFD method and the WSD method must be identified to enable appropriate use of the LRFD method for designing jack-up rigs. Therefore, the aim of this study is to compare and quantitatively investigate the differences between actual jack-up lattice leg structures, which are designed by the WSD and LRFD methods, and subject to different environmental load-to-dead-load ratios, thereby delineating the load-to-capacity ratios of rigs designed using theses methods under these different enviromental conditions. The comparative results are significantly advantageous in the leg design of jack-up rigs, and determine that the jack-up rigs designed using the WSD and LRFD methods with UC values differ by approximately 31 % with respect to the API-RP code basis. It can be observed that the LRFD design method is more advantageous to structure optimization compared to the WSD method.