• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.469-475
• /
• 2013

In this paper, we propose an efficient interference management technique which controls the number of resource blocks (or subcarriers) shared with other cells based on statistical interference levels among cells. The proposed technique tries to maximize average throughput of a femto cell user under a constraint on non-real time control of a femto cell network while guaranteeing a target throughput value of a macro cell user. In our proposed scheme, femto cells opportunistically use resource blocks allocated to other cells if the required average user throughput is not attained with the primarily allocated resource blocks. The proposed method is similar to the underlay approach in cognitive radio systems, but resource block sharing among cells is statistically controlled. For the statistical control, a femto cell sever constructs a table storing average mutual interference among cells and periodically updates the table. This statistical approach fully satisfies the constraint of non-real time control for femto cell networks. Our simulation results show that the proposed scheme achieves higher average femto user throughput than conventional frequency reuse schemes for time varying number of users.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.7
• /
• pp.536-542
• /
• 2016

To enhance tracking efficiency, a target-tracking filter with a resource management algorithm is required. One of the resource management algorithms chooses or evaluates the proper sampling time using cost functions which are related to the target tracking filter. We propose a resource management algorithm for bearing only tracking environments. Since the tracking performance depends on the system observability, the bearing-only tracking is one of challenging target-tracking fields. The proposed algorithm provides the adaptive sampling time using the variation rate of the error covariance matrix from the target-tracking filter. The simulation verifies the efficiency performance of the proposed algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.1
• /
• pp.41-45
• /
• 1984

A resource constrained scheduling problem that involves trade-off between resources and time is considered. Models are considered. Models are presented as zero-one integer program and objectives of models include minimum project completion time and minimum total project cost.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1998.10a
• /
• pp.731-740
• /
• 1998

This paper discusses a brcriterion approachto sequencing with time/cost trade-offs. The first problem is to minimize the total flow time and the maximum tardiness. And second is to the maximum tardiness and resource allocation costs. This approach , which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by linear time/cost function.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.460-468
• /
• 2004

Quality of Service (QoS)-constrained policy has an advantage to guarantee QoS requirements requested by users. Quorum systems can ensure the consistency and availability of replicated data despite the benign failure of data repositories. We propose a Quorum based resource management scheme, which includes a system resource and network resource, both of which can satisfy the requirements of application QoS. We also propose the resource reconfiguration algorithm based on temporal execution time estimation method. Resource reconfiguration means that reshuffling the current available resource set for maintaining the quality level of the resources. We evaluate the effectiveness of resource reconfiguration mechanism with a Heart Hemodynamics analysis. Our approach shows the increase of the stability of execution environment as well as decrease the completion time compare to the method that is not adapted the resource reconfiguration.

• Korean Journal of Human Ecology
• /
• v.11 no.1
• /
• pp.13-29
• /
• 2002

This study was performed to discuss how to develop policies to support social participation by full-time housewives, from the perspectives of human resource development and utilization. This study focused on three areas of potential human resource development: (a) labor force participation (b) social education (c) volunteerism. It analyzed the related "social infrastructures," especially labor market situation and child care systems. The current governmental policies and other social programs implemented by various institutions as well as the relevant literatures were reviewed. The preliminary policy proposals outlined in this study were evaluated by the policy developers and experts through several hearings and discussions. Programs proposed from this study were as follows : (a) programs to support housewives who wish to find employment or create a self-owned business, (b) educational programs exclusively offered for full time housewives, and (c) programs to award certificates and rewards and to create paid employment tied to volunteer work. In addition, the ways how to ameliorate the gender discrimination by changing the labor and social environments and institutionalizing the child care were discussed.

• Journal of Computing Science and Engineering
• /
• v.6 no.4
• /
• pp.287-293
• /
• 2012

We introduce a methodology for the study of the application-level performance of time-sharing parallel jobs on a set of compute nodes in high performance clusters and report our findings. We assume that parallel jobs arriving at a cluster need to share a set of nodes with the jobs of other users, in that they must compete for processor time in a time-sharing manner and other limited resources such as memory and I/O in a space-sharing manner. Under the assumption, we developed a methodology to simulate job arrivals to a set of compute nodes, and gather and process performance data to calculate the percentage slowdown of parallel jobs. Our goal through this study is to identify a better combination of jobs that minimize performance degradations due to resource sharing and contention. Through our experiments, we found a couple of interesting behaviors for overlapped parallel jobs, which may be used to suggest alternative job allocation schemes aiming to reduce slowdowns that will inevitably result due to resource sharing on a high performance computing cluster. We suggest three job allocation strategies based on our empirical results and propose further studies of the results using a supercomputing facility at the San Diego Supercomputing Center.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.343-348
• /
• 2013

We proposes a power-aware fixed-priority real-time scheduling algorithm for multimedia service, called static voltage scaling algorithm with multi-granularity resource reservation (STATIC-MULTIRSV). The multi-granularity resource reservation was introduced to deliver higher system utilization and better temporal isolation than the traditional approaches in [2]. Based on this, our STATIC-MULTIRSV is designed to reduce the power consumptions while guaranteeing that all I-frames of each video stream meet their deadlines. We implemented the proposed algorithm on top of ChronOS Real-time Linux [6]. We experimentally compared STATIC-MULTIRSV with other existing methods which showed that STATIC-MULTIRSV reduce power consumption by maximum 15% compared to its experimental counterparts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.10
• /
• pp.1712-1732
• /
• 2011

Cloud provides dynamically scalable virtualized computing resources as a service over the Internet. To achieve higher resource utilization over virtualization technology, an optimized strategy that deploys virtual machines on physical machines is needed. That is, the total number of active physical host nodes should be dynamically changed to correspond to their resource usage rate, thereby maintaining optimum utilization of physical machines. In this paper, we propose a pattern-based prediction model for resource provisioning which facilitates best possible resource preparation by analyzing the resource utilization and deriving resource usage patterns. The focus of our work is on predicting future resource requests by optimized dynamic resource management strategy that is applied to a virtualized data center in a Cloud computing environment. To this end, we build a prediction model that is based on user request patterns and make a prediction of system behavior for the near future. As a result, this model can save time for predicting the needed resource amount and reduce the possibility of resource overuse. In addition, we studied the performance of our proposed model comparing with conventional resource provisioning models under various Cloud execution conditions. The experimental results showed that our pattern-based prediction model gives significant benefits over conventional models.

• Journal of Ginseng Research
• /
• v.33 no.1
• /
• pp.59-64
• /
• 2009

$Ca^{2+}$ and calmodulin (CaM), a key $Ca^{2+}$ sensor in all eukaryotes, have been implicated for defense responses of plants. Eukaryotic CaM contains four structurally and functionally similar $Ca^{2+}$ domains named I, II, III and IV. Each $Ca^{2+}$ binding loop consists of 12 amino acid residues with ligands arranged spatially to satisfy the octahedral symmetry of $Ca^{2+}$ binding. To investigate the altered gene expression and the role of CaM in ginseng plant defense system, cDNA clone containing a CaM gene, designated PgCaM was isolated and sequenced from Panax ginseng. PgCaM, which has open reading frame of 450 nucleotides predicted to encode a precursor protein of 150 amino acid residues. Its sequence shows high homologies with a number of other CaMs, with more similarity to CaM of Daucus carota (AAQ63461). The expression of PgCaM in different P. ginseng organs was analyzed using real time PCR. The results showed that PgCaM expressed at different levels in young leaves, shoots, and roots of 3-week-old P. ginseng. In addition, the expressions of PgCaM under different abiotic stresses were analyzed at different time intervals.