• Management & Information Systems Review
• /
• v.27
• /
• pp.71-99
• /
• 2008

This study investigates the relationships between three BSC communication attributes(support of organizational culture, message valid, and knowledge sharing) and organizational learning and how that translates into relationship organizational performance in public organization. In this paper, first, past studies on BSC communication and organizational learning that identify the attributes of effective communication and organizational learning in organizational performance are reviewed. Second, a research model, key variables, and three hypotheses tested by PLS(partial least squares) are presented. The data was collected from BSC champions and managers of 53 public organizations in Korea. The results indicate, first, BSC communication (except for support of organizational culture) have not significant related to organizational performance. Therefore, H1 was not supported. Second, the structural path coefficient between support of organizational culture and message valid and organizational learning are statistically significant and in the hypothesized direction. But the knowledge sharing has not significant relationship with organizational learning. Therefore, H2 was partially supported. Third, organizational learning was significantly positively related to organizational performance. H3 was supported. Finally, organizational learning play a significantly positive role in mediating the relationship between BSC communication and organizational performance. The theoretical contributions, limitations, as well as future research directions are discussed at the end of the paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2328-2339
• /
• 1994

The PBS(Partial Buffer Sharing) space priority mechanism is one of priority control methods which may improve the performance of a single server queueing system when mixed traffic with different performance requirements is applied to the system. This paper analyzes the cell loss behavior of PBS assuming loss sensitive traffic and delay sensitive traffic are applied to the system. To derive the successive cell loss probabilities. which are an important performance measure of realtime traffic, we develop a recursive algorithm. Performance results show the successive cell loss probabilities obtained by our method are lager than the probabilities derived from an independent cell loss assumption. These results may indicate the limitation of PBS for realtime traffic and the increase of the admissible load with the criterion of quality of service.

• Fashion & Textile Research Journal
• /
• v.22 no.6
• /
• pp.777-788
• /
• 2020

Growth in the sharing economy and sustainability have grown has influenced collaborative consumption that values usage rather than ownership. Collaborative fashion consumption platforms have become a rapidly growing business and need to be investigated. A theoretical review and case study were conducted to analyze the typology of collaborative fashion consumption consisting of renters, lenders, and platforms. Applying the nascent literature of partial organization, this paper outlines a typology, user-driven types in which lenders take responsibility to manage rental products and platform-driven types in which platforms are in charge. Four representative cases such as Hurr Collective, Villageluxe, Wardrobe, and Closetshare were selected in order to derive the roles of collaborative fashion consumption platforms. First, it is critical to balance between renters and lenders in collaborative fashion consumption platforms. Second, it is imperative to establish trust about the platform and formulate mutually understandable guidelines. Third, the concept of lenders needs to be broadened to individuals as well as fashion brand companies. Fourth, it is necessary to improve interaction between renters and lenders in platform-driven types. This study represents one careful step to understand collaborative consumption platforms that also provides managerial and academic implications.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.215-224
• /
• 2003

Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.

• Informatization Policy
• /
• v.20 no.1
• /
• pp.22-41
• /
• 2013

The purpose of this paper is to examine the effect of interpersonal face-to-face offline on identification-based trust and reciprocity norm in online world, and the effect of identification-based trust and reciprocity norm on the intention and behavior of sharing information in online world. To understand the moderating role, the importance of information was established as a moderating variable, and an empirical analysis was conducted, focusing on the undergraduate. The results of this study are as follows. It was found that interpersonal face-to-face in offline world affects identification-based trust and reciprocity norm in online positively. A reciprocity norm of identification-based trust and reciprocity norm in online world affected by interpersonal face-to-face in offline world has a positive effect on the intention and behavior of sharing information in online, but showed that identification-based trust does not affect them significantly. And reciprocity norm has significant relationship with information sharing behavior through the intention to share information. It was found to be a partial moderating effect of importance of information on the relationship among the reciprocity norm and the intention and behavior of sharing information.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.138-149
• /
• 2006

As the environment with sensor network and ubiquitous computing is emerged, there are many demands of handling continuous, fast data such as streaming data. As work about streaming data has begun, work about management of streaming data in Publish-Subscribe system is started. The recent emergence of XML as a standard for information exchange on Internet has led to more interest in Publish - Subscribe system. A filtering technique of streaming XML data in the existing Publish- Subscribe system is using some schemes based on automata and YFilter, which is one of filtering techniques, is very popular. YFilter exploits commonality among path queries by sharing the common prefixes of the paths so that they are processed at most one and that is using the top-down approach. However, because partial matching path queries interrupt the common prefix sharing and don't calculate from root, throughput of YFilter decreases. So we use sharing of commonality among path queries with the common postfixes of the paths and use the bottom-up approach instead of the top-down approach. This filtering technique is called as PoSFilter. And we verify this technique through comparing with YFilter about throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• The Journal of Asian Finance, Economics and Business
• /
• v.6 no.2
• /
• pp.203-212
• /
• 2019

A system Integrator (SI) makes a consortium with multiple providers of hardware and software solutions to sell an information system. The success of information systems (IS) mainly depends on establishing a trustful relationship between SI supplier and client, and delivering high-quality system. However, the determinants of trust and system quality have been investigated mostly from the perspective of s ystem buyers rather than system sellers. This study examines the influence of key variables that SI can handle to improve trust and system quality which finally leads to user satisfaction toward SI. This study adopts resource complementarity, user participation and information sharing as the key variable then builds a research model to explain their relationships to user satisfaction. Respondents are recruited from 251 firms that have built any information system in recent two years in South Korea. Results of partial least square (PLS) modeling analysis show that both resource complementarity and information sharing have positive relationships with trust. Also the relationships between trust, system quality and user satisfaction toward S.I are supported. In addition, the mediating roles of trust and system quality are identified. We discussed some of the key managerial and theoretical implications of the paper and suggested further research directions.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.3
• /
• pp.59-65
• /
• 2023

As research on blockchain applications in various fields is actively increasing, management of private keys that prove users of blockchain has become important. If you lose your private key, you lose all your data. In order to solve this problem, previously, blockchain wallets, private key recovery using partial information, and private key recovery through distributed storage have been proposed. In this paper, we propose a safe private key backup and recovery method using Shamir's Secrete Sharing (SSS) scheme and biometric information, and evaluate its safety. In this paper, we propose a safe private key backup and recovery method using Shamir's Secrete Sharing (SSS) scheme and biometric information, and evaluate its safety against robustness during message exchange, replay attack, man-in-the-middle attack and forgery and tampering attack.