• 한국항해학회지
• /
• 제13권1호
• /
• pp.55-61
• /
• 1989

Nowadays much efforts for evaluating the productivity of port physical distribution system to meet the rapid change of the port and shipping circumstances has been made continuously all over the world. The major part of these efforts is the improvement of the productivity of cargo handling system. The cargo equipment system as infrastructure in the cargo handling system is organized well in some degrees, but the management system of manpower as upper structure is still remained in an insufficient degree. There is little study, so far, on a systematic research for the management of port labor gang, and even those were mainly depended on rule of thumb. The object of this study is to introduce the method of optimal allocation and assignment for the labor gang in single ship, which was suggested as a first stage in dealing with them generally. The problem of optimal allocation and assignment of the labor gang can be (I) formalized with multi-stage allocation and assignment of the labor gang can be. (II) dealt with two stages in form of hierarchic structure and moreover, (III) The optimal size of labor gang was obtained through dynamic programming from the point of minimizing the summation of labor gang in every stage, (IV) For the problem of optimal assignment, the optimal policy was determined at the point of minimizing the summation of movement between hatches.

• 산업경영시스템학회지
• /
• 제29권1호
• /
• pp.1-8
• /
• 2006

This paper proposes a real-time resource allocation algorithm for minimizing the completion time of overall workflow process. The jobs in a workflow process are interrelated through the precedence graph including Sequence, AND, OR and Loop control structure. A resource should be allocated for the processing of each job, and the required processing time of the job can be varied by the resource allocation decision. Each resource has several inherent restrictions such as the functional, geographical, positional and other operational characteristics. The algorithm suggested in this paper selects an effective resource for each job by considering the precedence constraint and the resource characteristics such as processing time and the inherent restrictions. To investigate the performance of the proposed algorithm, several numerical tests are performed for four different workflow graphs including standard, parallel and two series-parallel structures. In the tests, the solutions by the proposed algorithm are compared with random and optimal solutions which are obtained by a random selection rule and a full enumeration method respectively.

• 국제학술발표논문집
• /
• The 9th International Conference on Construction Engineering and Project Management
• /
• pp.222-229
• /
• 2022

Although stochastic programming and feedback control approaches could efficiently mitigate the overdue risks caused by inherent uncertainties in ground conditions, the lack of formal representations of planners' rationales for resource allocation still prevents planners from applying these approaches due to the inability to consider comprehensive resource allocation policies for hard rock tunnel projects. To overcome the limitations, the authors developed an ontology that represents the project duration estimation rationales, considering the impacts of ground conditions, excavation methods, project states, resources (i.e., given equipment fleet), and resource allocation policies (RAPs). This ontology consists of 5 main classes with 22 subclasses. It enables planners to explicitly and comprehensively represent the necessary information to rapidly and consistently estimate the excavation durations during construction. 10 rule sets (i.e., policies) are considered and categorized into two types: non-progress-related and progress-related policies. In order to provide simplified information about the remaining durations of phases for progress-related policies, the ontology also represents encoding principles. The estimation of excavation schedules is carried out based on a hypothetical example considering two types of policies. The estimation results reveal the feasibility, potential for flexibility, and comprehensiveness of the developed ontology. Further research to improve the duration estimation methodology is warranted.

• 인터넷정보학회논문지
• /
• 제19권1호
• /
• pp.1-10
• /
• 2018

인터넷 웜, 컴퓨터 바이러스 등 네트워크에 위협적인 악성트래픽이 증가하고 있다. 특히 최근에는 지능형 지속 위협 공격 (APT: Advanced Persistent Threat), 랜섬웨어 등 수법이 점차 고도화되고 그 복잡성(Complexity)이 증대되고 있다. 지난 몇 년간 침입탐지시스템(IDS: Intrusion Detection System)은 네트워크 보안 솔루션으로서 중추적 역할을 수행해왔다. 침입탐지시스템의 효과적 활용을 위해서는 탐지규칙(Rule)을 적절히 작성하여야 한다. 탐지규칙은 탐지하고자 하는 악성트래픽의 핵심 시그니처를 포함하며, 시그니처를 포함한 악성트래픽이 침입탐지시스템을 통과할 경우 해당 악성트래픽을 탐지하도록 한다. 그러나 악성트래픽의 핵심 시그니처를 찾는 일은 쉽지 않다. 먼저 악성트래픽에 대한 분석이 선행되어야 하며, 분석결과를 바탕으로 해당 악성트래픽에서만 발견되는 비트패턴을 시그니처로 사용해야 한다. 만약 정상 트래픽에서 흔히 발견되는 비트패턴을 시그니처로 사용하면 수많은 오탐(誤探)을 발생시키게 될 것이다. 본고에서는 네트워크 트래픽을 분석하여 핵심 시그니처를 추출하는 기법을 제안한다. 제안 기법은 LDA(Latent Dirichlet Allocation) 알고리즘을 활용하여, 어떠한 네트워크 트래픽에 포함된 시그니처가 해당 트래픽을 얼마나 대표하는지를 정량화한다. 대표성이 높은 시그니처는 해당 네트워크 트래픽을 탐지할 수 있는 침입탐지시스템의 탐지규칙으로 활용될 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.91-107
• /
• 2014

Device-to-device (D2D) communication is an excellent technology to improve the system capacity by sharing the spectrum resources of cellular networks. Multicast service is considered as an effective transmission mode for the future mobile social contact services. Therefore, multicast based on D2D technology can exactly improve the spectrum resource efficiency. How to apply D2D technology to support multicast service is a new issue. In this paper, a resource allocation scheme based on cognitive radio (CR) for D2D underlay multicast communication (CR-DUM) is proposed to improve system performance. In the cognitive cellular system, the D2D users as secondary users employing multicast service form a group and reuse the cellular resources to accomplish a multicast transmission. The proposed scheme includes two steps. First, a channel allocation rule aiming to reduce the interference from cellular networks to receivers in D2D multicast group is proposed. Next, to maximize the total system throughput under the condition of interference and noise impairment, we formulate an optimal transmission power allocation jointly for the cellular and D2D multicast communications. Based on the channel allocation, optimal power solution is in a closed form and achieved by searching from a finite set and the interference between cellular and D2D multicast communication is coordinated. The simulation results show that the proposed method can not only ensure the quality of services (QoS), but also improve the system throughput.

• 항공우주정책ㆍ법학회지
• /
• 제29권1호
• /
• pp.199-236
• /
• 2014

본 논문은 인류가 공유해야 할 유한한 우주자원인 정지궤도(geostationary orbit)의 국제적 배분기제를 분배적 정의의 관점에서 분석한 것이다. 배분의 주체인 국제통신연합(ITU)은 체약국이 합의한 헌장 및 협약의 하위규정인 무선규칙에 의해 주파수와 궤도자원을 분배하고 있으므로 논문은 무선규칙을 세밀히 검토하는데 중점을 두었다. 현행 배분메커니즘은 크게 두 가지 원칙에 따른다. 하나는 먼저 등록한 행정청에 우선권을 주는 선착순 원칙('first come, first served' principle)에 의한 사후배분체제(a posteriori system)이고, 다른 하나는 선착순원칙을 적용할 경우 배제될 수 있는 국가(행정청)를 위해 미리 계획을 통하여 배분하는 사전배분체제(a priori system)이다. 논의는 우선 사후배분체제가 우주후진국에 불리하다는 확립된 관점을 전제로 출발한다. Philip De Man은 사후배분체제의 기저에 있는 선착순원칙에도 예외가 있다면서 이에 관한 7가지의 예를 들어 선착순원칙에 의한 배분적 정의의 형해화 가능성이 배제될 수 있음을 보여주려 시도한다. 하지만 본 논문은 그가 주장하는 각각의 논거에 대해 반박하고, 이를 근거로 여전히 선착순원칙이 대부분의 우주자원배분에 적용되고 있으며 따라서 배분적 평등의 실현에 걸림돌이 되고 있음을 보여준다. De Man이 주장하는 근거는 다음과 같다: 1) 선착순 원칙은 유해간섭을 일으키는 할당에만 적용된다; 2) 선착순 원칙 외에도 국제적 권리의 형성에는 규정합치성원칙(rule of conformity)이 상호 적용된다; 3) 선착순 원칙에 반해 정보목적 및 임시로 등록이 가능하다; 4) 선착순 원칙 외에도 서비스의 종류에 따른 우선순위가 존재한다; 5) 먼저 등록했다는 사실만으로는 이득을 볼 수 없도록 선언한 절차규정(Rule of Procedure)이 있다; 6) 선착순 원칙과 동등하게 적용되는 기술적 요소의 고려와 국제 및 국내법에 따른 평등원칙이 있다; 7) 할당의 기본성격(basic characteristics)에 변경이 있을 경우 선착순 원칙이 배제된다. 논의의 또 다른 부분은 우주후진국을 위한 사전배분체제마저도 그 본래의 목적을 달성할 수 없으며, 이를 가능케 하는 구조화된 메커니즘을 관련 무선규칙과 그 부속서의 면밀한 분석을 통해 밝혀낸다. 분석대상은 방송위성계획(Broadcasting-Satellite System) 및 고정위성계획(Fixed-Satellite System)에 따라 각 행정청이 자신의 할당을 국제적으로 등록하는 세부절차이며, 이 사전배분체제 에서도 선착순원칙이 압도하고 있음을 드러내면서 본 논문의 주장을 뒷받침한다.

• 한국시뮬레이션학회논문지
• /
• 제9권2호
• /
• pp.89-102
• /
• 2000

In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.

• 무역상무연구
• /
• 제32권
• /
• pp.93-111
• /
• 2006

The purpose of this paper is to analyze the composition of the arbitration costs in ICC Rule of Arbitration and to examine how each item of the costs is determined. Furthermore this author tired to find the principles or criteria deciding which of the party should bear them or in what proportion they shall be home by the parties in Article 31. Thus this author could find three common approaches. First, all of the costs are home by the losing party, or Second, all of the costs are allocated in proportion to the result of award in each case. Third, all of the costs determined by the Court as shared equally by the parties and both parties bear their own costs. But, both parties may include their intention in accordance with the principle of party autonomy. For example if the parties with to ensure that the arbitration costs be shared equally and that the arbitrator make no allocation of costs and fees, the following sentence could be added to the arbitration clause. "All costs and expenses of the arbitrators (and the arbitral institution) shall be home by the parties equally; each party shall bear the costs and expenses, including attorneys' fees, of its own counsel, experts, witnesses and preparation and presentation of its case."

• 한국통신학회논문지
• /
• 제33권12A호
• /
• pp.1191-1199
• /
• 2008

주파수 재사용도 K = 1을 사용하는 셀룰러 OFDMA 시스템에서 셀 경계 사용자의 동일 채널 간섭에 의한 수율 저하 문제를 완화하기 위한 대역 분산적 자원 할당 알고리즘을 제안하고, 이에 따른 성능 향상 효과를 분석한다. 본 논문에서 고려한 대역 분산적 자원 할당 알고리즘은 셀 내의 사용자를 경로 감쇄 순서로 내림차순으로 정렬한 후에 각 셀마다 다르게 미리 정해져 있는 자원 할당 영역부터 자원을 할당한다. 셀마다 다른 시간과 공간적인 영역에서 자원 할당을 시작하도록 되어 있으므로 셀 경계의 사용자부터 셀 중앙의 사용자들까지 셀 내 특정위치의 사용자를 특정 시간대에 배치하여 셀 경계 사용자들이 동시에 같은 자원을 사용하여 간섭이 매우 커지는 경우를 미리 방지하고 셀 내의 사용자들에게 간섭이 평준화되어 고르게 영향을 받도록 한다. 이러한 대역 분산적 자원 할당 방식을 사용하여 셀 경계 사용자의 전송률과 outage 성능이 향상되었음을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1325-1344
• /
• 2019

Recently, to satisfy mobile users' increasing data transmission requirement, energy efficiency (EE) resource allocation in distributed antenna systems (DASs) has become a hot topic. In this paper, we aim to maximize EE in DASs subject to constraints of the minimum data rate requirement and the maximum transmission power of distributed antenna units (DAUs) with different density distributions. Virtual cell is defined as DAUs selected by the same user equipment (UE) and the size of virtual cells is dependent on the number of subcarriers and the transmission power. Specifically, the selection rule of DAUs is depended on different scenarios. We develop two scenarios based on the density of DAUs, namely, the sparse scenario and the dense scenario. In the sparse scenario, each DAU can only be selected by one UE to avoid co-channel interference. In order to make the original non-convex optimization problem tractable, we transform it into an equivalent fractional programming and solve by the following two sub-problems: optimal subcarrier allocation to find suitable DAUs; optimal power allocation for each subcarrier. Moreover, in the dense scenario, we consider UEs could access the same channel and generate co-channel interference. The optimization problem could be transformed into a convex form based on interference upper bound and fractional programming. In addition, an energy-efficient DAU selection scheme based on the large scale fading is developed to maximize EE. Finally, simulation results demonstrate the effectiveness of the proposed algorithm for both sparse and dense scenarios.