• Journal of Advanced Information Technology and Convergence
• /
• v.10 no.2
• /
• pp.15-31
• /
• 2020

Various websites have been created due to the increased use of the Internet, and the number of documents distributed through these websites has increased proportionally. However, it is not easy to collect newly updated documents rapidly. Web crawling methods have been used to continuously collect and manage new documents, whereas existing crawling systems applying a single node demonstrate limited performances. Furthermore, crawlers applying distribution methods exhibit a problem related to effective node management for crawling. This study proposes an efficient distributed crawler through stepwise crawling node allocation, which identifies websites' properties and establishes crawling policies based on the properties identified to collect a large number of documents from multiple websites. The proposed crawler can calculate the number of documents included in a website, compare data collection time and the amount of data collected based on the number of nodes allocated to a specific website by repeatedly visiting the website, and automatically allocate the optimal number of nodes to each website for crawling. An experiment is conducted where the proposed and single-node methods are applied to 12 different websites; the experimental result indicates that the proposed crawler's data collection time decreased significantly compared with that of a single node crawler. This result is obtained because the proposed crawler applied data collection policies according to websites. Besides, it is confirmed that the work rate of the proposed model increased.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.305-314
• /
• 2007

This paper considers single machine scheduling problems where the processing time of a job increases as a function of its position in the sequence. In this model, the later a given job is scheduled in the sequence, the longer its processing time. It is shown that the optimal schedule may be very different from that of the classical version of the problem. We introduce polynomial solutions for the makespan minimization problem, the sum of completion times minimization problem and the sum of earliness penalties minimization problem. For two resource constrained problems, based on the analysis of the problems, the optimal resource allocation methods are presented, respectively.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.9 no.1
• /
• pp.35-41
• /
• 2003

The evaluation of economy of wards is based on the building area. The parameters are nursing area per bed, occupied area per patient, and the portion of movement area. Three areas such as patient area, nurse area, and corridor area are devided. The results of analysis are as follows. At first, allocation of patient area has the highest priority. Even though nurse area is small, the patient area is relatively large. Secondly, the patient area is mostly determined by the type of rooms, such as single, double, etc.. Finally, the type of alley on the floor is important to economy. The single corridor type is the most economical followed by the double corridor type. the single loaded type shows the worst economy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.593-600
• /
• 2002

The reverse link signal power required for multimedia traffic in multipath faded single-code (SC-) and multi-code CDMA (MC-CDMA) systems is investigated. The effect of orthogonality loss among multiple spreading code channels is herein characterized by the orthogonality factor. The required signal power in both the CDMA systems is then analyzed in terms of the relative required signal power ratio of data to voice traffic. The effect of varying system parameters including spreading bandwidth, the of orthogonality factor, and the number of spreading codes are examined. Analytical results show that MC-CDMA users transmitting only a single traffic type require significantly more power than SC-CDMA users with only a single traffic type. On the other hand, MC-CDMA users transmitting multimedia traffic require power levels approximately identical to SC-CDMA users with multimedia traffic. The results can be used in the design of radio resource management (e.g., power allocation) scheme for wireless multimedia services.

• The Journal of the Korea Contents Association
• /
• v.7 no.5
• /
• pp.156-165
• /
• 2007

The concepts of static seat allocation model has been used widely in the air transportation industry, and proven as a good concepts for managing perishable assets. The paper analyzed, in realistic environment, the volume of Accept Demand and Reject Demand through several times' simulation experiments at each fare level by using C-Program analyzing process applied to upward and downward models of demand, to analyze the change of fare level when upward and downward shifts of fare levels' demand happen at once. As a consequence, I concluded that the revenue of the case to consider the both shifts of demand at each fare level is bigger than that of the case to consider the single shift of demand at each fare level, except the case to downsize the seat allotment at very low price when supply is bigger than demand, with developing a general model concerned with plural fare levels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.254-266
• /
• 2006

Recently, researches about downlink resource allocation algorithms applying SDMA to enhance the system throughput and cell coverage have begun. Most OFDM/SDMA based resource allocation algorithms have some limitations such that those only concentrate on maximizing the system throughput or can be applied in single cell environment. In this paper, we propose an OFDM/SDMA based downlink resource allocation algorithm which considers high layer QoS parameters suitable for the required data traffic and it also minimizes the system throughput loss and considers inter-cell interference from adjacent cells. so it can be adopted in multi-cell environment. We manifest the performance of the proposed algorithm in Ped A and SCME MIMO Channel Model.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.211-223
• /
• 2018

Mobile relay systems have been adopted by $4^{th}$ generation mobile systems as an alternative method to extend cell coverage as well as to enhance the system throughput at cell-edges. In order to achieve such performance gains, the mobile relay systems require path selection and resource allocation schemes that are specifically designed for these systems which make use of additional radio resources not needed in single-hop systems. This paper proposes an integrated path selection and resource allocation scheme for LTE-Advanced relay systems using collaborative communication. We first define the problem of maximizing the downlink throughput of LTE-Advanced relay systems using collaborative communication and transform it into a multi-dimensional multi-choice backpacking problem. The proposed Lagrange multiplier-based heuristic algorithm is then applied to derive the approximate solution to the maximization problem. It is shown through simulations that the approximate solution obtained by the proposed scheme can achieve a near-optimal performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.111-116
• /
• 2019

Recently, GPU expands application domains from graphic processing to various kinds of parallel workloads. However, current GPU systems focus on the maximization of each workload's parallelism through simplified control rather than considering various workload characteristics. This paper classifies the resource usage characteristics of GPU workloads into computing-bound, memory-bound, and dependency-latency-bound, and quantifies the fine-grained bottleneck for efficient workload allocation. For example, we identify the exact bottleneck resources such as single function unit, double function unit, or special function unit even for the same computing-bound workloads. Our analysis implies that workloads can be allocated together if fine-grained bottleneck resources are different even for the same computing-bound workloads, which can eventually contribute to efficient workload allocation in GPU.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.3
• /
• pp.430-435
• /
• 2022

In this paper, we consider the non-orthogonal multiple access (NOMA) technique in the heterogeneous network (HetNET) consisting of a single macro base station (BS) and multiple small BSs, where the perfect successive interference cancellation is assumed for the NOMA signals. In this paper, we propose a deep learning-based user association and power allocation scheme to maximize the data rate in the NOMA-based HetNET. In particular, the proposed scheme includes the deep neural network (DNN)-based user association process for load balancing and the DNN-based power allocation process for data-rate maximization. Through the simulation assuming path loss and Rayleigh fading channels between BSs and users, the performance of the proposed scheme is evaluated, and it is compared with the conventional maximum signal-to-interference-plus-noise ratio (Max-SINR) scheme. Through the performance comparison, we show that the proposed scheme provides better sum rate performance than the conventional Max-SINR scheme.

• Journal of Veterinary Science
• /
• v.21 no.4
• /
• pp.55.1-55.11
• /
• 2020

Background: Computed tomography urography (CTU), based on the excretion of contrast medium after its injection, allows visualization of the renal parenchyma and the renal collecting system. Objectives: To determine the optimal contrast medium dose allocation ratio to apply in split-bolus CTU in dogs. Methods: This prospective, experimental, exploratory study used 8 beagles. In 3-phase CTU, unenhanced-, nephrographic-, and excretory-phase images were obtained with a single injection of 600 mg iodine/kg iohexol. In split-bolus CTU, two different contrast medium allocation ratios (30% and 70% for split CTU 1; 50% and 50% for split CTU 2) were used. Unenhanced phase image and a synchronous nephrographic-excretory phase image were acquired. Results: Although the attenuation of the renal parenchyma was significantly lower when using both split CTUs than the 3-phase CTU, based on qualitative evaluation, the visualization score of the renal parenchyma of split CTU 1 was as high as that of the 3-phase CTU, whereas the split CTU 2 score was significantly lower than those of the two others. Artifacts were not apparent, regardless of CTU protocol. The diameter and opacification of the ureter in both split CTUs were not significantly different from those using 3-phase CTU. Conclusions: Split-bolus CTU with a contrast medium allocation ratio of 30% and 70% is feasible for evaluating the urinary system and allows sufficient enhancement of the renal parenchyma and appropriate distention and opacification of the ureter, with similar image quality to 3-phase CTU in healthy dogs. Split-bolus CTU has the advantages of reducing radiation exposure and the number of CT images needed for interpretation.