• 한국항해항만학회지
• /
• 제30권7호
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• ETRI Journal
• /
• 제33권2호
• /
• pp.145-154
• /
• 2011

We present a novel video codec for supporting entertainment-quality video. It has new coding tools such as an intra prediction with offset, integer sine transform, and enhanced block-based adaptive loop filter. These tools are used adaptively in the processing of intra prediction, transform, and loop filtering. In our experiments, the proposed codec achieved an average reduction of 13.35% in BD-rate relative to H.264/AVC for 720p sequences.

• 산업공학
• /
• 제13권4호
• /
• pp.556-563
• /
• 2000

In this paper, we consider wavelength assignment problem (WAP) in Wavelength division multiplexed (WDM) unidirectional optical telecommunication ring networks. We show that, even though WAP on unidirectional ring belongs to NP-hard, WAP can be exactly solvable in real-sized WDM rings for near future demand. To accomplish this, we convert WAP to the vertex coloring problem of the related graph and choose a special integer programming formulation for the vertex coloring problem. We use a column generation technique in a branch-and-price framework for the suggested formulation. We also propose some generic heuristics and do the performance comparison with the suggested optimization algorithm.

• 한국국방경영분석학회지
• /
• 제26권1호
• /
• pp.56-69
• /
• 2000

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

• 대한수학회보
• /
• 제58권6호
• /
• pp.1507-1520
• /
• 2021

Let R be a commutative ring with 1 ≠ 0, n be a positive integer and M be an R-module. In this paper, we introduce the concept of weakly quasi n-absorbing submodule which is a proper generalization of quasi n-absorbing submodule. We define a proper submodule N of M to be a weakly quasi n-absorbing submodule if whenever a ∈ R and x ∈ M with 0 ≠ aⁿ x ∈ N, then aⁿ ∈ (N :_R M) or a^n-1 x ∈ N. We study the basic properties of this notion and establish several characterizations.

• 대한수학회지
• /
• 제56권5호
• /
• pp.1371-1385
• /
• 2019

Given a topological space X and a non-negative integer k, ${\varepsilon}^{\sharp}_k(X)$ is the set of all self-homotopy equivalences of X that do not change maps from X to an t-sphere $S^t$ homotopically by the composition for all $t{\geq}k$. This set is a subgroup of the self-homotopy equivalence group ${\varepsilon}(X)$. We find certain homotopic tools for computations of ${\varepsilon}^{\sharp}_k(X)$. Using these results, we determine ${\varepsilon}^{\sharp}_k(M(G,n))$ for $k{\geq}n$, where M(G, n) is a Moore space type of (G, n) for a finitely generated abelian group G.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.41-41
• /
• 1992

In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• 한국통신학회논문지
• /
• 제33권8C호
• /
• pp.627-632
• /
• 2008

시간 오차는 직교 주파수 분할 다중화 (orthogonal frequency division multiplexing: OFDM) 기술에 기반한 무선랜 (wireless local area network: WLAN) 시스템에서 주파수 옵셋 추정 시, 오류를 일으키는 원인들 중 하나이다. 시간 오차가 주파수 옵셋 추정 시에 미치는 영향을 줄이기 위하여 몇몇 연구가 진행되어 왔지만, 대부분의 주파수 옵셋 추정 기법들은 시간 오차 범위에 대한 사전 정보를 미리 알고 있다는 가정 하에 연구됨으로써, 실제 시스템에 적용되지 못하였다. 본 논문에서는 시간 오차에 대한 정보를 요구하지 않고 두 개의 연속적인 상관 값 표본 사이에 차동 결합 기법을 적용함으로서, 실제 시스템에 적용 가능한 새로운 정수 주파수 옵셋 추정 기법을 제안하였다. 모의실험 결과, 제안한 기법은 시간 오차 범위에 대한 정보를 요구하지 않기 때문에, 시간 오차 분산에 강인하며, 또한 시간 오차의 범위를 정확하게 모르는 경우, 평균적으로 기존의 기법보다 더 나은 성능을 보였다.

• 한국항해항만학회지
• /
• 제45권3호
• /
• pp.102-108
• /
• 2021

본 연구의 목적은 선석 계획 수립 시에 선박 도착시간의 불확실성에 따른 피해를 대비할 수 있는 방법론을 개발하는 데에 있다. 세계적으로 수입량과 수출량이 급증하면서 컨테이너 터미널 선석 계획의 효율화가 더욱 중요해졌다. 선석 계획은 컨테이너 터미널의 처리용량을 결정하기 때문에 선박 사이의 시간과 공간적 간격을 최소화하여 선석 활용도를 극대화하는 것이 중요하다. 실제 선석을 운영할 때에는 여러 불확실한 요소로 인해서 선박이 예정보다 늦게 도착하는 경우 기존의 선석 계획이 틀어지게 되면서 터미널이 큰 피해를 입게 된다. 이러한 피해를 방지하기 위해 본 논문에서는 기존의 문헌들을 조사하여 완충 시간을 도입하는 방법을 제안한다.

• Asian-Australasian Journal of Animal Sciences
• /
• 제25권12호
• /
• pp.1667-1673
• /
• 2012

The objective of this study was to estimate economic weights of Hanwoo carcass traits that can be used to build economic selection indexes for selection of seedstocks. Data from carcass measures for determining beef yield and quality grades were collected and provided by the Korean Institute for Animal Products Quality Evaluation (KAPE). Out of 1,556,971 records, 476,430 records collected from 13 abattoirs from 2008 to 2010 after deletion of outlying observations were used to estimate relative economic weights of bid price per kg carcass weight on cold carcass weight (CW), eye muscle area (EMA), backfat thickness (BF) and marbling score (MS) and the phenotypic relationships among component traits. Price of carcass tended to increase linearly as yield grades or quality grades, in marginal or in combination, increased. Partial regression coefficients for MS, EMA, BF, and for CW in original scales were +948.5 won/score, +27.3 $won/cm^2$, -95.2 won/mm and +7.3 won/kg when all three sex categories were taken into account. Among four grade determining traits, relative economic weight of MS was the greatest. Variations in partial regression coefficients by sex categories were great but the trends in relative weights for each carcass measures were similar. Relative economic weights of four traits in integer values when standardized measures were fit into covariance model were +4:+1:-1:+1 for MS:EMA:BF:CW. Further research is required to account for the cost of production per unit carcass weight or per unit production under different economic situations.