• 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.

• Journal of Animal Science and Technology
• /
• v.66 no.1
• /
• pp.125-134
• /
• 2024

In this research, the growth efficiency, nutritional utilization, fecal microbial levels, and fecal score of weaned pigs were evaluated using therapeutic zinc oxide (ZnO) and zinc aspartic acid chelate (Zn-Asp). In a 42-day feeding trial, 60 weaned pigs ([Yorkshire × Landrace] × Duroc) were arbitrarily allotted (age: 21 days; 7.01 ± 0.65 kg preliminary body weight) to 3 different treatment groups with 5 repetitions (2 male and 2 female piglets) in each pen. The trial had 2 different phases, including 1-21 days as phase 1, and 22-42 days as phase 2. The nutritional treatments were: basal diet as control (CON), basal diet incorporated with 3,000 ppm ZnO as TRT1, and basal diet incorporated with 750 ppm Zn-Asp as TRT2. In comparison to the CON group, the pigs in the TRT1 and TRT2 groups had greater (p < 0.05) body weight on day 42; an average daily gain, and an average daily feed intake on days 22-42. Furthermore, during days 1-42, the average daily gain in the treatment groups trended higher (p < 0.05) than in the CON group. Additionally, the fecal score decreased (p < 0.05) at week 6, the lactic acid bacteria count tended to increase (p < 0.05), and coliform bacteria presented a trend in reduction (p < 0.05) in the TRT1 and TRT2 groups compared to the CON group. However, there was no difference in nutrient utilization (p > 0.05) among the dietary treatments. Briefly, the therapeutic ZnO and Zn-Asp nutritional approaches could decrease fecal score and coliform bacteria, increase lactic acid bacteria, and improve growth efficiency; moreover, Zn-Asp (750 ppm) can perform a comparable role to therapeutic ZnO (3,000 ppm). So we can use Zn-Asp (750 ppm) instead of therapeutic ZnO (3,000 ppm) for the better performance of weaning pigs and the reduction of environmental pollution, as therapeutic ZnO is responsible for environmental pollution.

• The Journal of Industrial Distribution & Business
• /
• v.9 no.9
• /
• pp.35-44
• /
• 2018

Purpose - In endless competition, companies pursue cost reduction and work efficiency. So, entrepreneurs try to increase job intensity, which may lead to job stress and high turnovers because of job burnout. But, Information systems are acknowledged as a work support tool that secures work convenience and the productivity of employees. In this study, we aimed to confirm the effects of information systems in reduing the work overload of employees in a human resource intensive industry. Research design, data and methodology - This is based on the job demands-resources model, conducting an empirical analysis of surveys given to hospital employees working in a human resource intensive industry. Results - The research revealed that information systems reduced the work overload of employees in a human resource intensive industry. Conclusion - This study confirmed the effects of information systems as a job resource based on JD-R theory, and presentation of empirical results indicated that information systems alleviate employee job overload and increases job satisfaction in the medical services industry. In the medical services industry, using electronic health record system decreases in work overload, which results in employees gaining time for self-development and time management, reducing job stress, and leading to job satisfaction.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.1-9
• /
• 2006

As an effective solution to resolve complex computing problems and to handle geographically dispersed data sets, grid computing has been noticed. Grid computing separates an application to several parts and executes on heterogeneous computing platforms simultaneously. The most important problem in grid computing environments is to manage grid resources and to schedule grid resources. This paper proposes a grid transaction network model that is applicable for resource management and scheduling in grid computing environment and presents a grid resource bidding algorithm for grid users and grid resource providers. Using DEVSJAVA modeling and simulation, this paper evaluates usefulness and efficiency of the proposed model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.34-49
• /
• 2015

Market means of spectrum trading have been utilized as a vital method of spectrum sharing and access in future cognitive radio system. In this paper, we consider the spectrum trading with multiple primary carrier providers (PCP) leasing the spectrum to multiple secondary carrier providers (SCP) for a short period of time. Several factors including the price of the resource, duration of leasing, and the spectrum quality guides the proposed model. We formulate three trading policies based on the game theory for dynamic spectrum access in a LTE based cognitive radio system (CRS). In the first, we consider utility function based resource sharing (UFRS) without any knowledge of past transaction. In the second policy, each SCP deals with PCP using a non-cooperative resource sharing (NCRS) method which employs optimal strategy based on reinforcement learning. In variation of second policy, third policy adopts a Nash bargaining while incorporating a recommendation entity in resource sharing (RERS). The simulation results suggest overall increase in throughput while maintaining higher spectrum efficiency and fairness.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.266-274
• /
• 2010

The efficient network resource management is one of the important topics in a real-time system. In this paper, we present a practical network resource management framework, control-theoretic packet scheduler (CPS) system. Using our framework, an operating system can schedule both input and output streams accurately and efficiently. Our framework adopts very portable feedback control theory for efficiency and accuracy. The CPS system is able to operate independent of the internal network protocol state, and it is designed to schedule packet streams in fine-grained time intervals to meet the resource requirement. This approach simplifies the design of the CPS system, and leads us to obtain the intended output bandwidth. We implemented our prototype system in Linux, and measured the performance of the network resource management system under various network QoS constraints. The distinctive features of our principles are as follows: It is robust and accurate, and its operation is independent of internal network protocols.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.341-351
• /
• 2012

We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai-Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.

• Korea Journal of Hospital Management
• /
• v.17 no.1
• /
• pp.59-78
• /
• 2012

The purpose of this study is to evaluate on the fitting with human resource practice and strategic on 6 public hospital in the point of resource based view. At the result of this study, public strategy is not much fitted into HRM(human resource management) system, but it shows positive result of the fitting with efficiency strategy and HRM system. These results were associated with the integration of G Medical Center. Generally 6 public hospitals of the HRM system and the strategy had not been linked. They also did not achieve a great outcome. We suggest that the manager in charge of each hospital make strategies of the hospital, and then evaluates about fitting with HRM system. We hope, hereafter, it applied the analysis methods that evaluates it with financing result and individual non-financial result all together.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.70-79
• /
• 2010

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2568-2588
• /
• 2021

Shared mesh protection (SMP) protects traffic against failures occurring in a working path, as with linear protection, and allows resource sharing of protection paths with different endpoints. The SMP mechanism coordinates multiple protection paths that require shared resources when failures occur on multiple working paths. When multiple failures occur in SMP networks sharing limited resources, activation can fail because some of the resources in the protection path are already in use. In this case, a node confirming that a resource is not available has the option to wait until the resource is available or to withdraw activation of the protection path. In this study, we recognize that the protection switching time and the number of protected services can be different, depending on which option is used for SMP networks. Moreover, we propose a detailed design for the implementation of SMP by considering options and algorithms that are commonly needed for network nodes. A simulation shows the performance of an SMP system implemented with the proposed design and utilizing two options. The results demonstrate that resource utilization can be increased or protection switching time can be shortened depending on the option selected by the network administrator.