• Journal of Climate Change Research
• /
• v.6 no.4
• /
• pp.345-355
• /
• 2015

In this study, we researched a space allocation method of emissions from domestic coastal shipping (passenger ship, cargo ship, fishing boats). We were building a geographic information data that is used in GIS for emissions of space allocation, and presented a methodology capable of performing the space allocated for each grid by calculating the emissions. Passenger ships were assigned emissions of routes each the ship that operated at a fixed. Emissions of crusing mode of cargo ship, was equally assigned to the safe operation line, which is defined for domestic cargo ship. Also, Emissions of maneuvering (moving into or out of port) and hoteling (operations while stationary at dock), was assigned in consideration of anchorage in the major port. Fishing boat was evenly allocated monthly emissions in the country every month fishing grounds formation zone. Based on these results, it tries to provide the basic data that can be used when you want to create a local government measures to reduce scenario in the future.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.63-70
• /
• 2004

Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation.. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look for solutions, use tabu search to optimize them, and design optimized the berth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocation.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.14 no.4
• /
• pp.150-160
• /
• 2011

IT convergence and integration technology aims to create new synergies by combining IT related technology and performance. This study conducted a basic research for combining construction and IT technology to create new synergies. Specifically, the purpose of this study is to combine USN and GIS technology and then apply it to urban facilities management. For this, we have developed the USN hardware, tested propagation communications, and made the GIS Algorithm and a system. Existing sensor node allocation method is mostly to install in a random way or with in-situ survey, but the problem with this method is contradictory to cost effectiveness and efficiency. To solve this problem, we developed a new method for sensor allocation. Using this method, the USN technology could be applied in the range of city unit. This technology can be applied to the ubiquitous urban development such as U-City and Smart City.

• International Journal of Aerospace System Engineering
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2017

This paper proposes the load distribution control allocation technique. The proposed method is designed by combining a conventional control allocation method with load distribution ability in order to reduce the stress acting on ailerons. By designing the weighting matrix as a function of the load distribution rule, the optimal deflection angles of each surface to satisfy both control goal and load distribution can be achieved. Moreover, rule based fault-tolerant control technique is also proposed. The rules are generated by considering both dominant control surfaces and the ratio of load distribution among surfaces. The performance of the proposed method is evaluated through numerical simulations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.191-194
• /
• 2003

Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1302-1310
• /
• 1997

In this paper, we propose a dynamic code allocation strategy using voice activity detection and evaluate the performance of a dynamic code allocation strategy using voice activeity detection in DS-CDMA system. Proposed method allocates code to mobile terminal according to the residual capacity computed by SIR in the base station. In hot spot traffic loading cell, we find that the performance of proposed method is better than that of a fixed code assignment strategy using voice activity detection. Also, we find that the proposed method provide much improvement in blocking probability against the dynamic code assignment strategy withoug voice activity detection.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.175-183
• /
• 1998

When a product is designed, tolerances must be given to the product so that required functions are guaranteed and production costs are minimized. In this research, a model is suggested which allocates tolerances to components optimally according to the STA(Statistical Tolerance Allocation) method. Taking into account the concept that dimensional errors have characteristics of statistical distributions, this model presents the discrete pseudo-boolean approach for the tolerance optimization by minimizing the tolerance cost and the quality loss cost. In this approach, two methods are proposed for the reduction of the problem scale; 1) a method for converting the minimization model for casts into the maximization model for cost savings, and 2) procedures to reduce the number of constraints and variables.

• Journal of the Optical Society of Korea
• /
• v.11 no.1
• /
• pp.6-9
• /
• 2007

We propose a wavelength allocation method for bidirectional transmission in a coarse wavelength division multiplexing channel. The method can be accommodated by assigning a different upstream wavelength from the downstream wavelength at room temperature to eliminate penalties induced by backscattering, including Rayleigh backscattering. We suggest a procedure to obtain the minimum wavelength difference.

• ETRI Journal
• /
• v.24 no.6
• /
• pp.465-468
• /
• 2002

Ethernet passive optical networks (PONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and a customer site. In this paper, we propose a new algorithm of dynamic bandwidth allocation for multimedia services over Ethernet PONs. To implement the suggested dynamic bandwidth allocation algorithm, we present control message formats that handle classified bandwidths in a multi-point control protocol of Ethernet PONs.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.240-242
• /
• 2004

A channel allocation algorithm of multi-user OFDM(orthogonal frequency division multiplexing) system is presented. The proposed algorithm is to reduce the complexity of the system, using the GNN(gradual neural network) with gradual expansion scheme and the algorithm attempts to allocate channel with good channel gain to each user. The method has lower computational complexity and less iteration than other algorithms.