• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.83-98
• /
• 2006

When unit loads are stacked in multiple tiers, as the number of tiers increases, the space consumption per unit load decreases; at the same time, the number of relocations during retrieval operations increases. This study derives formulas fur estimating the expected number of relocations for retrieving a random unit load from various types of stacks with different combinations of the number of rows, the number of columns, and the number of tiers. Based on the derived formulas, the handling cost and the space cost of the different types of stacks are compared with each other.

• Korean System Dynamics Review
• /
• v.14 no.1
• /
• pp.69-87
• /
• 2013

The purpose of this paper is to explore the relationship between the number of relocation and volition of soldier's service based on system thinking perspective using a causal loop analysis. Research adopting system dynamics concerning on the volition of soldier's service and relocation has not been studied yet. Causal loops are analyzed and evaluated by focusing on soldier's military performance, stress of family members and family members' welfare service. Result of this study is that soldier's periodical movement is indispensable factor maintaining military life. Most of the married soldier's life conditions are worse than ordinary people. As the number of relocation is increasing family of soldier's stress is increased by anxiety for welfare conditions is supposed to relocate. The number of movement to another place of soldier's children is more than two times and the result of learning achievement is worse than ordinary students. This kind of stress can influence the married soldier's military performance and stress. So the welfare service should be expanded to an official residence, education, facility, district network service and so on.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.3
• /
• pp.239-245
• /
• 2014

This paper deal with the block storage planning problem of storing and retrieving assembly blocks in a temporary storage yard with limited capacity, which is one of the critical managerial problems in shipbuilding. The block storage planning problem is required to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We first show NP-hardness of the block storage planning problem. Next we propose a heuristic algorithm to generate good quality solutions for larger instances in very short computational time. The proposed heuristic algorithm was validated by comparing the results with the mathematical model presented in the previous study.

• Korean Management Science Review
• /
• v.30 no.3
• /
• pp.99-111
• /
• 2013

This paper studies the scheduling problem of storing and retrieving assembly blocks in a temporary storage yard. The objective is to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We present an integer programming model based on multi-commodity network flows, and the three revised models based on the properties of the problem. We show that the revised models are more efficient than the generic model through the numerical experiments.

• Journal of Internet Computing and Services
• /
• v.17 no.5
• /
• pp.51-58
• /
• 2016

The unprecedented power of cloud computing (CC) that enables free sharing of confidential data records for further analysis and mining has prompted various security threats. Thus, supreme cyberspace security and mitigation against adversaries attack during data mining became inevitable. So, privacy preserving data mining is emerged as a precise and efficient solution, where various algorithms are developed to anonymize the data to be mined. Despite the wide use of generalized K-anonymizing approach its protection and truthfulness potency remains limited to tiny output space with unacceptable utility loss. By combining L-diversity and (${\alpha}$,k)-anonymity, we proposed a hybrid K-anonymity data relocation algorithm to surmount such limitation. The data relocation being a tradeoff between trustfulness and utility acted as a control input parameter. The performance of each K-anonymity's iteration is measured for data relocation. Data rows are changed into small groups of indistinguishable tuples to create anonymizations of finer granularity with assured privacy standard. Experimental results demonstrated considerable utility enhancement for relatively small number of group relocations.

• Journal of Ecology and Environment
• /
• v.35 no.1
• /
• pp.41-50
• /
• 2012

To determine the movement patterns, home range, and use of structural features of captive-bred one- or two-year-old Amur ratsnake (Elaphe schrenckii) juveniles in the natural habitat, we radio-tracked a total of 11 juvenile snakes in a mountain valley in Chiaksan National Park, South Korea, between August 21 and September 20, 2010 and between June 13 and July 13, 2011. During the first week of the release, most juveniles moved short distances, daily, but they increased their distances after the first week. The body weight of the juveniles was negatively related with the movement rate (dividing the number of movements by the number of relocations), which was positively related with the mean daily distances moved and the size of both a kernel 50% and 95% home range. During the study period, the juveniles moved daily, approximately 17 m, and the size of the minimum convex polygon and the 50% and 95% kernel home ranges were 1.8 ha, 0.4 ha, and 3.0 ha, respectively. The released captive-bred juveniles were more frequently confirmed underground or on the ground rather than on rocks or on trees. Our results suggest that the body condition of released individuals, the seasonal time of the release, and the existence of available prey and shelters in the habitat should be carefully considered when releasing captive-bred Amur ratsnake juveniles for the rehabilitation of field populations.