• Journal of the Korean Institute of Navigation
• /
• v.13 no.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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.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.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• 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.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.1-10
• /
• 2018

Network threats such as Internet worms and computer viruses have been significantly increasing. In particular, APTs(Advanced Persistent Threats) and ransomwares become clever and complex. IDSes(Intrusion Detection Systems) have performed a key role as information security solutions during last few decades. To use an IDS effectively, IDS rules must be written properly. An IDS rule includes a key signature and is incorporated into an IDS. If so, the network threat containing the signature can be detected by the IDS while it is passing through the IDS. However, it is challenging to find a key signature for a specific network threat. We first need to analyze a network threat rigorously, and write a proper IDS rule based on the analysis result. If we use a signature that is common to benign and/or normal network traffic, we will observe a lot of false alarms. In this paper, we propose a scheme that analyzes a network threat and extracts key signatures corresponding to the threat. Specifically, our proposed scheme quantifies the degree of correspondence between a network threat and a signature using the LDA(Latent Dirichlet Allocation) algorithm. Obviously, a signature that has significant correspondence to the network threat can be utilized as an IDS rule for detection of the threat.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.

• The Korean Journal of Air & Space Law and Policy
• /
• v.29 no.1
• /
• pp.199-236
• /
• 2014

This paper analyses from the perspective of distributive justice the legal mechanisms for international allocation of orbital slots, which are of co-owned nature and thereby limited natural resources in outer space. The allocative function is delegated to the International Telecommunication Union. The Radio Regulation, amongst such other legal instruments as the Constitution and Convention, by which the ITU and contracting States thereof abides, dictates how the orbital positions are distributed. Thus, the RR is thoroughly reviewed in the essay. The mechanisms are in a broad sense categorized into two systems: 'a posteriori system' where the 'first come, first served' principle prevails; and 'a priori system' designed to foster the utilisation of the slots by those who lack space resources and are, in especial, likely to be marginalised under the former system. The argument proceeds on the premise that a posteriori system places the under-resourced States in unfavourable positions in the securement of the slots. In contrast with this notion, seven factors were instantiated for an assertion that the degradation of the distributive justice derived from the 'first come, first served' rule, which lays the foundation for the system, could be either mitigated or counterbalanced by the alleged exceptions to the rule. However, the author of this essay argues for counterevidences against the factors and thereby demonstrating that the principle still remains as an overwhelming doctrine, posing a threat to the pursuit of fair allocation. The elements he set forth are as in the following: 1) that the 'first come, first served' principle only applies to assignments capable of causing harmful interferences; 2) the interoperability of the principle with the 'rule of conformity' with the all the ITU instruments; 3) the viability of alternative registrations, as an exception of the application of the principle, on the condition of provisional and informational purposes; 4) another reference that matters in deciding the priority: the types of services in the TFA; 5) the Rule of Procedure H40 proclaiming a ban on taking advantage of coming first to the Register; 6) the technical factors and equity-oriented norms under international and municipal laws along with; 7) the changes of 'basic characteristics' of registered assignments. The second half of this essay illustrates by examining the relevant Annexes to the Regulation that the planned allocation, i.e., a priori system, bear the structured flaws that hinder the fulfillment of the original purpose of the system. The Broadcasting and Fixed Satellite Systems are the reviewed Plans in which the 'first come, first served' principle re-emerges in the end as a determining factor to grant the 'right to international recognition' to administrations including those who has not the allotted portions in the Plan.

• Journal of the Korea Society for Simulation
• /
• v.9 no.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.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.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."

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12A
• /
• pp.1191-1199
• /
• 2008

We propose the Staggered-zone Resource Allocation (SRA) in order to relax throughput decrease problems by the co-channel interference of the cell boundary users at the cellular OFDMA system using frequency reuse factor K=1 and analyze the throughput improvement. The proposed algorithm allocates the resources to the users in compliance with resource allocation rule which is planned in order to minimize co-channel interference between cells without any additional information. The resource allocation method in the SRA lines up the users in pathloss order as descending series, and then allocates from pre-determined resource allocation region where decides differently in each cell. This algorithm prevents the co-channel interferences of the cell boundary user to be caused by using same resource simultaneously and equalizes interference to the users in the cell.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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.