• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.12
• /
• pp.2372-2380
• /
• 2015

In this paper, we propose frequency allocation and path selection scheme in underlay cognitive radio (CR) networks using network coding. In the proposed scheme, we choose the path with consideration of network coding and interference temperature in underlay CR networks and propose an optimization problem to maximize the system throughput of secondary users (SUs). Then, we represent the proposed optimization problem as the multi-dimensional multiple-choice knapsack problem and give the theoretical upper bound for the system throughput of SUs by using linear programming. Finally, we compute the system throughput of SUs by using brute-force search (BFS) and link quality first (LQF) scheme in underlay CR networks. Simulation results show that the system throughput of SUs with BFS is higher than that with LQF in underlay CR networks with and without application of network coding, respectively.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.6
• /
• pp.105-114
• /
• 2022

We examine berth allocation problems in tidal bulk ports with an objective of minimizing the demurrage and dispatch associated berthing cost. In the proposed optimization model inventory (or stock) level constraints are considered so as to satisfy the service level requirements in bulk terminals. It is shown that the mathematical programming formulation of this research provides improved schedule resolution and solution accuracy. We also show that the conventional big-M method of standard resource allocation models can be exempted in tidal bulk ports, and thus the computational efficiency can be significantly improved.

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.129-141
• /
• 2009

Intermodal freight transportation is defined as the movement of freight from origins to destinations by two or more transportation modes. When implemented in hub networks, it could enhance the efficiency of the networks because consolidated flows are transported by more suitable modes and technologies. In spite of this advantage, the intermodal hub network design problem has received limited attention in the literature partly because of the complex nature of the problem. This paper aims to develop an optimization model for designing intermodal hub networks with sin91e allocation strategy. The model takes into account various cost components of intermodal hub networks including transportation, stationary inventory, and service delay costs. Moreover, using transport frequency variables, it is capable of endogenously determining the transportation economies of scale achieved by consolidation of flows. As such, the model is able to realistically represent the characteristics of intermodal hub networks in practice. Since the model Is a complicated nonlinear integer programming problem, we perform model simplification based on the analytical study of the model, which could facilitate the development of solution algorithms in the future. We expect that this study contributes to the design of intermodal hub networks as well as to the assessment of existing logistics systems.

• 한국경영정보학회:학술대회논문집
• /
• 2008.06a
• /
• pp.478-485
• /
• 2008

고객 만족과 납기 충족율을 최대화하기 위하여, 정확하고 실용적인 납기회답 시스템(ATP)은 매우 중요한 역할을 한다. 그러나 복잡한 공급사슬관리 환경 하에서 조달, 제조, 분배 등을 모두 고려한 정확한 ATP 수량 할당은 매우 어려운 업무이고, 때문에 많은 연구들이 이루어져 왔다. 지금까지 기존의 선행 연구에서 시도되었던 ATP 모형들은 공통적으로 정수배의 시간 단위만 고려해 왔고, 이는 실제 산업 현장의 ATP 프로세스를 정확하게 반영하지 못하고 있는 비현실적인 가정이라 할 수 있다. 본 논문에서는 SCM을 위하여 비정수 타임 랙을 사용한 ATP 시스템을 고려한다. 기존 연구들에서 이산형의 무리한 가정으로 표현되어 왔던 시간 단위를 동적 생산 함수(dynamic production function) 개념을 통하여 비음의 실수 범위에서의 자유롭게 나누어 고려할 수 있도록 하였다. 이를 통하여 기존 ATP 연구들의 무리한 가정을 제거하였으며, 보다 더 현실에 가까운 ATP 모델을 제안한다. 본 논문에서는 특히 공급 사슬(Supply Chain) 전체의 재고와 생산, 운송을 모두 고려하며 고객 주문에 대응하는 통합 ATP 시스템을 설계하였고, 기존 연구들이 미처 고려하지 못한 시간 흐름의 연속성에 중점을 두고 선형 계획(LP) 문제의 형태로 비정수 타임랙(non-integer time lag)을 갖는 ATP 시스템을 모델링하였다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.11
• /
• pp.256-264
• /
• 2020

Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

• Journal of the military operations research society of Korea
• /
• v.32 no.2
• /
• pp.21-39
• /
• 2006

This paper presents a mixed linear and integer goal programming (GP) model to aid in strategic planning and scheduling of guard soldiers. The proposed model is a general-purpose model, hence can be used to produce an optimal schedule with respect to any user-provided combination of guard post objectives and soldier preferences. We extensively test the usefulness of the model on a real-life dataset from a guard post in the ROK Army with using three objectives set by the guard post and three preferences provided by individual solders. Numerical results and analysis from these experiments show that the proposed guard scheduling model efficiently as well as effectively generates an optimal guard schedule and can also be used for an optimal revision of any existing schedule. In summary, these illustrate that the proposed model can be practically used for optimal planning and scheduling of guard soldiers in guard posts.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2196-2203
• /
• 1999

This paper describes the bus scheduling problem and register optimization method in datapath synthesis. Scheduling is process of operation allocation to control steps in order to minimize the cost function under the given circumstances. For that purpose, we propose some formulations to minimize the cost function for bus assignment to get an optimal and minimal cost function in hardware allocations. Especially, bus and register minimization technique are fully considered which are the essential topics in hardware allocation. Register scheduling is done after the operation and bus scheduling. Experiments are done with the DFG model of fifth-order digital ware filter to show its effectiveness. Structural integer programming formulations are used to solve the scheduling problems in order to get the optimal scheduling results in the integer linear programming environment.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.784-791
• /
• 2004

In this study, we deal with face recognition using fuzzy-based Fisherface method. The well-known Fisherface method is more insensitive to large variation in light direction, face pose, and facial expression than Principal Component Analysis method. Usually, the various methods of face recognition including Fisherface method give equal importance in determining the face to be recognized, regardless of typicalness. The main point here is that the proposed method assigns a feature vector transformed by PCA to fuzzy membership rather than assigning the vector to particular class. In this method, fuzzy membership degrees are obtained from FKNN(Fuzzy K-Nearest Neighbor) initialization. Experimental results show better recognition performance than other methods for ORL and Yale face databases.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.11a
• /
• pp.77-80
• /
• 2018

360 VR 콘텐츠는 기존의 선형적인 일반 영상에 비해 사용자에게 더 많은 정보와 높은 몰입감을 제공할 수 있어 의학, 군사, 교육, 게임 등 다양한 분야에서 활용되고 있다. 최근에는 모바일 기기의 성능 향상과 통신기술의 발달에 힘입어 모바일 네트워크를 사용한 360 VR 콘텐츠 소비가 증가하는 추세이다. 모바일 네트워크는 대역폭이 한정적이고 가변적인 특성이 있어 이를 통해 용량이 큰 360 VR 콘텐츠 전송 시 초기 접속 지연 및 재생 끊김이 발생하여 사용자의 만족도를 감소시킬 수 있다. 이에 본 논문은 위에 언급한 문제를 해결하기 위해 360 VR 콘텐츠 전송 시 전체 요구대역폭을 감소시키고 사용자 초기 접속 속도를 향상시키는 것을 목표로, 360 VR 콘텐츠의 지오메트리 값과 사용자의 요(i.e. yaw)값을 활용하여 각도 기반으로 사용자의 현재 시점에 해당하는 타일을 확인하고 해당 타일에 높은 비트율을 할당하는 방법 및 웹 기반 전송에 대해 연구 개발하였다. 이를 위하여 웹 기반 3D 렌더링 API 인 WebVR API, HTTP Adaptive Streaming 기술의 표준 MPEG-DASH의 dash.js API를 활용하여 개발하고, 성능 확인 실험을 통해 요구대역폭 감소, 클라이언트 접속 속도 향상을 제시한다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.