• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.53-56
• /
• 2002

This paper discusses the quorum based algorithm for group mutual exclusion defined by Yuh-Jzer Joung. Group mutual exclusion[4,5,6] is a generalization of mutual exclusion that allows a resource to be shared by processes of the same group, but requites processes of different groups to use the resource in a mutually exclusive style. Joung proposed a quorum system, which he referred to as the surficial quorum system for group mutual exclusion and two modifications of Maekawa's algorithm[6]. He mentioned that when a process may belong to more than one group, the process must identify one of the groups it belongs when it wishes to enter CS(Critical Section). However, his solution didn't provide mechanism of identifying a group which maximizes the possibility to enter CS. In this paper, we provide a mechanism for identifying that each process belongs to which group.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.739-742
• /
• 2004

The term 'Grid' refers to systems and applications that integrate and manage resources and services distributed across multiple control domains. Resource sharing is, necessarily, highly controlled, with resource providers and consumers defining clearly and carefully just what is shared, who is allowed to share, and the conditions under which sharing occurs. In this paper, we design and implement a grid access control system, called PGAM. This system works on heterogeneous resources, can be applied to the additional service development and its service, provides template account management mechanism, and tries to ensure site autonomy. This system is implemented to increase portability and to be tit tll any kind of economic model.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.519-522
• /
• 1998

The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1153-1156
• /
• 2003

In this paper, we present a reducing power consumption of a scheduling for module selection under the time constraint. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed scheduling of reducing power consumption is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our approach various HLS benchmark environment using chaining and multi-cycling in the scheduling techniques..

• Journal of Family Resource Management and Policy Review
• /
• v.11 no.4
• /
• pp.55-71
• /
• 2007

The purpose of this study was to explore a self-diagnostic indicator for measuring a healthy family by adopting the theme of "happiness", which has surfaced as the most interesting in many academic fields recently. Though the basic concept of a healthy family may be shared by everyone, the criterion of happiness varies from one family to another. Therefore, it is desirable that the tool be made in such a way that every member of the family can check their health from a holistic perspective, rather than diagnosing health and happiness from the perspective of professionals. So, this study was aimed at diagnosing a family by using a tool named GAMMA model, so each family member can recognize problems and find the best options to solve it. This study. has a significant meaning in that it has tried to diagnose families by introducing the GAMMA model into domestic science for the first time.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.4 no.3
• /
• pp.77-83
• /
• 2008

In this paper, CPLD low power technology mapping for reuse module design under the time constraint is proposed. Traditional high-level synthesis do not allow reuse of complex, realistic datapath component during the task of scheduling. On the other hand, the proposed algorithm is able to approach a productivity of the design the low power to reuse which given a library of user-defined datapath component and to share of resource sharing on the switching activity in a shared resource. Also, we are obtainable the optimal the scheduling result in experimental results of our using chaining and multi-cycling in the scheduling techniques. Low power circuit make using CPLD technology mapping algorithm for selection reuse module by scheduling.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.394-400
• /
• 2022

The radio resources available in a wireless network system are limited. Therefor, job of managing resources is not easy task. Because the resources are shared among the UEs that are connected, the process of assigning resources must be carefully controlled. The packet scheduler in an LTE network is in charge of allocating resources to the user equipment (UE). Femtocells networks are being considered as a promising solution for poor channel performance for mulitple environments. The implementation of femtocells into a macrocell (traditional base station) would boost the capacities of the cellular network. To increase femtocells network capacity, a reliable Packet Scheduler mechanism should be implemented. The Packet Scheduler technique is introduced in this paper to maximize capacity of the network while maintaining fairness among UEs. The proposed solution operates in a manner consistent with this principle. An analysis of the proposed scheme's performance is conducted using a computer simulation. The results reveal that it outperforms the well-known PF scheduler in terms of cell throughput and average throughput of UEs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.73-81
• /
• 2011

In this paper, we studied on the building models of open educational resource service system for download or upload their own educational content to be shared with the others without worrying about copyright infringement. We first analyzed the building models of the international OER(Open Educational Resource) service sites. And then, based on these results, we present the new service models suitable to be built the open educational resource service system in phases. The proposed models have the flexibility to accommodate the needs of users and have the advantage that the copyright-related issues of the existing 'National Educational Information Sharing System' could be solved step by step.

• Journal of Microbiology
• /
• v.45 no.5
• /
• pp.409-417
• /
• 2007

Burkholderia sp. HY-10 isolated from the digestive tracts of the longicorn beetle, Prionus insularis, produced an extracellular lipase with a molecular weight of 33.5 kDa estimated by SDS-PAGE. The lipase was purified from the culture supernatant to near electrophoretic homogenity by a one-step adsorption-desorption procedure using a polypropylene matrix followed by a concentration step. The purified lipase exhibited highest activities at pH 8.5 and $60^{\circ}C$. A broad range of lipase substrates, from $C_4\;to\;C_{18}$ p-nitrophenyl esters, were hydrolyzed efficiently by the lipase. The most efficient substrate was p-nitrophenyl caproate ($C_6$). A 2485 bp DNA fragment was isolated by PCR amplification and chromosomal walking which encoded two polypeptides of 364 and 346 amino acids, identified as a lipase and a lipase foldase, respectively. The N-terminal amino acid sequence of the purified lipase and nucleotide sequence analysis predicted that the precursor lipase was proteolytically modified through the secretion step and produced a catalytically active 33.5 kDa protein. The deduced amino acid sequence for the lipase shared extensive similarity with those of the lipase family 1.2 of lipases from other bacteria. The deduced amino acid sequence contained two Cystein residues forming a disulfide bond in the molecule and three, well-conserved amino acid residues, $Ser^{131},\;His^{330},\;and\;Asp^{308}$, which composed the catalytic triad of the enzyme.