• International journal of advanced smart convergence
• /
• v.13 no.1
• /
• pp.152-161
• /
• 2024

The purpose of this study sought to determine the impact of shared leadership perceived by organizational members on team effectiveness and team learning behavior. For this purpose, the results of the empirical analysis of 206 organizational members are as follows. First, shared leadership was analyzed to improve team effectiveness. Second, shared leadership had a positive effect on team learning behavior. Third, team learning behavior was statistically significantly analyzed for team effectiveness. This study confirmed the importance of shared leadership, which has a positive impact on team effectiveness and team learning behavior. This may require building a new culture that can demonstrate the inherent leadership of organizational members in the influence relationship between shared leadership, team effectiveness, and team learning behavior. In other words, in order to systematically demonstrate and implement shared leadership, the execution ability of executives, managers, and working-level managers is important. To this end, it is necessary to build an organizational culture that matches the characteristics of the organization and develop and continuously implement human resource development systems and programs that can implement this.

• Journal of Family Resource Management and Policy Review
• /
• v.16 no.1
• /
• pp.199-227
• /
• 2012

Studies of leisure time generally have been concentrated on the amount of time spent by each family member in Korea. In this study, the shared leisure time among family members in various leisure activities was mainly investigated. Purposes of this study were to describe how family members spent the leisure time together and to investigate the determinants that affected whether or not family shared leisure time together. The data source was the '2009 Time Use Survey' conducted by the Korea National Statistical Office. The person involved in each activity was surveyed for the first time in the survey. The data from 17,470 diaries(10,359 weekdays and 3,549 Sunday) from 8,745 individuals aged from 20 to 59 who had a spouse were analyzed. The descriptive statistics and logistic regressions were used. On average, married couples spent leisure time together with spouses 36 minutes a day on weekdays and 1 hour and 38 minutes on Sunday, respectively. Parent did with preschool children 5 minutes a day on weekdays and 15 minutes on Sunday, respectively. The shared leisure time with other family and relatives was 22 minutes a day on weekdays and 1 hour and 13 minutes on Sunday, respectively. Although there was a wide variation on the shared family leisure time by the types of activities, the main shared leisure activity was using mass media, which accounts for about two third of all shared leisure time together with family. Independent variables, including the age, sex, education level, working hours, personal income, presence of preschool children, marital status, sex role attitude, and dual or single income earner were the significant determinants of family's or couple's parent-preschool children's shared leisure time on weekdays or Sunday. Based on the results of this study, family and leisure policy were suggested to increase active family shared leisure time.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.331-337
• /
• 2008

In this paper, we investigate survivability in wavelength division multiplexing (WDM) mesh networks and propose a new algorithm called improved shared-path protection (ISPP) to completely tolerate the double-link failures. Compared with previous algorithms for protecting double-link failures, i.e., shared-path protection (SPP) and shared-link protection (SLP), the advantage of ISPP is to allow primary paths and backup paths to share the mixed wavelength-links based on the proposed new rules in which some primary wavelength-links can be changed to mixed wavelength-links, which can be shared by primary paths and backup paths. In addition, some mixed wavelength-links also can be shared by different backup paths for saving resources. Simulation results show that ISPP algorithm performs better in resource utilization ratio and blocking probability than conventional SPP and SLP algorithms.

• Journal of Family Resource Management and Policy Review
• /
• v.17 no.2
• /
• pp.93-119
• /
• 2013

The actual time fathers spend in childcare has not increased much in spite of recent attention paid to nurturing their children and changes in the fathers' role. In this study, parenting time is measured by time spent in childcare, shared housework, and shared leisure. In this way, this study seeks to analyze trends in fathers' time spent with children and the factors that influence fathers' participation in parenting. The data source for this study was the 2009 Korean Time Use Survey. The main results of this research are as follows: First, when measuring childcare time as a primary activity, fathers' time spent in parenting averaged 17 minutes on weekdays and 32 minutes on Sundays. This extended to 44 minutes on weekdays and 166 minutes on Sundays when including the secondary childcare time and the shared time with their children while doing housework or leisure. Second, fathers' probability of participating in childcare was higher for fathers who had shorter working hours, younger children, higher spouse average monthly income, and a college or higher education level. The variable that influenced fathers' participation in shared housework on weekdays was working hours. On Sundays, the variables were working hours, age of the youngest child, and the type of occupation. Fathers' participation in shared leisure was influenced by father's working hours, number of children, age of the youngest child, and type of occupation on weekdays. On Sundays, it was influenced by working hours and the age of the youngest child.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.226-236
• /
• 2002

In this paper, we present the channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service (QoS) in the radio network controller (RNC) in asynchronous IMT-2000 system. We first describe two types of traffic channel block assignments for utilizing the traffic channel efficiently; the partially dedicated and partially shared channel (PDPSC) assignment and the completely shared channel (CSC) assignment. The former is that some traffic channel block is completely assigned to each traffic type and the other blocks are shared with some traffic type. The latter is that all traffic channel blocks are completely shared with all traffic types. Further, for efficiently assigning, releasing, and managing the channel resource, we present the traffic channel management method which consists of the block and task management step. Through numerical examples, we evaluate the blocking probability and the mean number of required search for fading the available channel when applying our proposed channel block assignment and resource management methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.4
• /
• pp.371-380
• /
• 2013

D2D (Device-to-Device) communication on an underlying cellular infrastructure which exploits the same spectrum has several advantages such as increased resource utilization and improved cellular coverage. However, D2D communication system needs to cope with ICI (Inter-Cell Interference) and interference between cellular and D2D links. As a result, macro UEs (User Equipments), especially those located near cell edge, will suffer from serious link performance degradation. We propose a novel interference avoidance mechanism assisted by SRN (Shared Relay Node) in this paper. SRN not only performs data re-transmission as a usual Type II relay but also has several features newly defined to avoid interference between cellular and D2D links. In particular, we suggest resource allocation methods based on the SRN for effective interference avoidance, and evaluate their performance through computer simulations.

• Journal of Convergence Society for SMB
• /
• v.6 no.4
• /
• pp.17-23
• /
• 2016

With the advance of ICT, the Internet has been creating new services in various fields. However, due to the architectural problem of the Internet, it may inhibit the development of network architectures and various services. Network virtualization is being investigated as an alternative to overcome the architectural problem of the Internet and a virtual network resource allocation algorithm is a very important issue. In this paper, we propose a multiple path resource allocation algorithm with shared backup bandwidth in order to overcome single link failure. It will be improved survivability of the virtual networks. Through our experiments, we confirmed that the multi-path creation time of the proposed algorithm has about 50% performance improvement than previous works.

• The KIPS Transactions:PartA
• /
• v.17A no.6
• /
• pp.259-264
• /
• 2010

In case of scheduling tasks with shared resources in multiprocessor systems, Global Earliest Deadline First (GEDF) algorithm, equally applied Earliest Deadline First (EDF) which runs scheduling with deadline criterion, makes schedulability decline because GEDF typically does not have a specific process in order to handle tasks with shared resources. In this paper, we propose Earliest Deadline First with Partitioning (EDFP) for tasks with shared resources which partitions a task into two kinds of subtasks that include critical sections to access to shared resources, gives their own deadline respectively and manages them. As a result of simulations, EDFP shows better performance than GEDF for tasks with shared resources since system load goes up and the number of processor increases.

• Journal of KIISE:Information Networking
• /
• v.33 no.3
• /
• pp.247-256
• /
• 2006

Among the resource provisioning mechanisms for the hose based Virtual Private Network (VPN) Quality of Service (QoS ), VPN-specific state provisioning allows the service provider to obtain highest resource multiplexing gains. However, dynamic and automatic resource reservation for the VPN-specific state provisioning is difficult due to the lack of appropriate resource reservation protocol. Furthermore, users of a VPN may experience unfair usage of resources among themselves since the reserved resources of a VPN are shared by the VPN users in a similar way that the traditional LAN bandwidth is shared by the attached hosts. In this paper, we propose a resource reservation protocol and a traffic service mechanism, which not only enable dynamic and automatic resource reservation according to the VPN-specific state provisioning algorithm, but also enforce the fair usage of reserved resources among the users of a VPN in case of congestion.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1445-1454
• /
• 1999

광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.