• Korean small business review
• /
• v.43 no.3
• /
• pp.43-73
• /
• 2021

The purpose of this study is to examine the effect of the collective psychological ownership (CPO) of the board of directors of cooperatives on organizational performance, and to find out the mediator effect of shared leadership between CPO and organizational performance. In this study, we collected a data set of the survey of 453 directors from 78 local consumer cooperatives of iCOOP Korea. The study found that the CPO of the board of directors of consumer cooperatives had a positive impact on the social performance and activity performance of the organization. More importantly, the mediator effect of shared leadership between CPO and performance was statistically significant. These results suggest that strengthening CPO on the board is necessary for the performance of co-operatives, and that shared leadership is an important medium for linking CPO to performance.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3069-3077
• /
• 1997

This paper is concerned with a new paradigm for parallel evaluation of linear recursion rules which contain transitive dependency in a shared-nothing parallel architecture. For parallel evaluation of rules, we consider a shared-nothing parallel architecture that consists of a set of nodes and a message passing network to these nodes. An evaluation of normalized rules is a computation of the proof theoretic meaning of a collection of rules. We shall here define normalized recursion rules which contain transitive dependency, present an equivalent expression for the rule, propose a paradigm for Parallel evaluation of normalized rule based on the equivalent expression using join, partition, and transitive closure operations, and analyze response-time complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.425-438
• /
• 1993

Due to the producer-consumer dependency of shared variables, the potential parallelism embeded in the logic programming language has not been fully examined. The method proposed in this paper eliminates the dependency of shared variables by introducing number-sequenced variables in expanding an AND-OR proof tree. Basically, the execution of a logic program can be divided into two phases : expanding an AND-OR tree and proving the tree by matching facts with leaf nodes. In the course of the first phase, a set of number-sequenced variables are produced by expanding an AND-OR tree in the breadth-first searching. Based on the information of number-sequence, each of them is verified in the second phase in order to prove the tree. Consequently, the proposed algorithm can explore more parallelism without the dependency of shared variables.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.555-557
• /
• 1997

This paper discusses a set of critical requirements in building and using a shared, integrated information management system for power distribution management and control. It then proposes a modem, object-oriented information system model for building such a system based on the current state of arts in database, GIS, and WWW technologies. The key of the proposal is that the shared database system should be the basis of integration efforts in power distribution management and control. A small-scale prototype is being developed to demonstrate the effectiveness of the proposed model.

• BMB Reports
• /
• v.47 no.6
• /
• pp.348-353
• /
• 2014

The speed of sound (SOS) value is an indicator of bone mineral density (BMD). Previous genome-wide association (GWA) studies have identified a number of genes, whose variations may affect BMD levels. However, their biological implications have been elusive. We re-analyzed the GWA study dataset for the SOS values in skeletal sites of 4,659 Korean women, using a gene-set analysis software, GSA-SNP. We identified 10 common representative GO terms, and 17 candidate genes between these two traits (PGS < 0.05). Implication of these GO terms and genes in the bone mechanism is well supported by the literature survey. Interestingly, the significance levels of some member genes were inversely related, in several gene-sets that were shared between two skeletal sites. This implies that biological process, rather than SNP or gene, is the substantial unit of genetic association for SOS in bone. In conclusion, our findings may provide new insights into the biological mechanisms for BMD.

• Transactions of the Korean Society of Pressure Vessels and Piping
• /
• v.5 no.1
• /
• pp.32-37
• /
• 2009

The emergency diesel generator (EDG) in a nuclear power plant (NPP) shall start within 10 secondss and supply electrical power to engineered safety features within one minute and less if a loss of offsite power (LOOP), A design-basis event, or their combination occur. Each NPP has an EDG set consisting of two diesel generators for redundancy. In addition to the EDG set, an alternate Alternating Current Diesel Generator (AAC DG) is installed and shared by several units to cope with a station black out (SBO), i.e., loss of the offsite power concurrent with reactor trip and unavailability of the EDG set. The objective of this study is to analyze the failure data of emergency diesel generators reported in overseas nuclear power plants.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1436-1442
• /
• 2004

A shared-based tree established by the Core Based Tree multicast routing protocol (CBT), the Protocol Independent Multicast Sparse-Mode(PIM-SM), or the Core-Manager based Multicast Routing(CMMR) is rooted at a center node called core or Rendezvous Point(RP). The routes from the core (or RP) to the members of the multicast group are shortest paths. The costs of the trees constructed based on the core and the packet delays are dependent on the location of the core. The location of the core may affect the cost and performance of the shared-based tree. In this paper, we propose three methods for selecting the set of candidate cores. The three proposed methods, namely, k-minimum average cost, k-maximum degree, k-maximum weight are compared with a method which select the candidate cores randomly. Three performance measures, namely, tree cost, mean packet delay, and maximum packet delay are considered. Our simulation results show that the three proposed methods produce lower tree cost, significantly lower mean packet delay and maximum packet delay than the method which selects the candidate cores randomly.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.181-185
• /
• 2008

Layered video multicast such as RLM Receiver-driven layered multicast) is a premising technique for delivering streaming video to a set of heterogeneous receivers over ALM(Application Layer Multicast) as well as over IP multicast. However, this approach may suffer from unnecessary fluctuation of video quality due to overlapped and failed join-experiments. Though a shared teaming scheme was introduced to resolve these problems, it may cause high control overhead and slow convergence problem when used with ALM. In this paper, we propose a new shared learning scheme for ALM-based layered video multicast which reduces control overhead and convergence latency while keeping the number of fluctuation reasonably small. The simulation results show that the proposed scheme performs better than an ALM-based layered video multicast with shared learning in terms of control overhead and convergence latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.3
• /
• pp.51-61
• /
• 2023

Travel demand estimation of E-Scooter is the start point of solving the regional demand-supply imbalance problem and plays pivotal role in a linked transportation system such as Mobility-as-a-Service (a.k.a. MaaS). Most focuses on developing trip generation model of shared E-Scooter but it is no study on selection of an appropriate zone scale when it comes to estimating travel demand of E-Scooter. This paper aimed for selecting an optimal TAZ scale for developing trip distribution model for shared E-Scooter. The TAZ scale candidates were selected in 250m, 500m, 750m, 1,000m square grid. The shared E-Scooter usage historical data were utilized for calculating trip distance and time, and then applying to developing gravity model. Mean Squared Error (MSE) is applied for the verification step to select the best suitable gravity model by TAZ scale. As a result, 250m of TAZ scale is the best for describing practical trip distribution of shared E-Scooter among the candidates.