• Journal of applied mathematics & informatics
• /
• v.36 no.1_2
• /
• pp.121-133
• /
• 2018

The purpose of the paper is to study the meromorphic functions sharing a nonzero polynomial with finite weight. The results of the paper improve and generalize the recent results due to Pulak Sahoo and Sajahan Seikh [9].

• Kyungpook Mathematical Journal
• /
• v.55 no.3
• /
• pp.653-666
• /
• 2015

With the notion of weighted sharing of values we study the uniqueness of meromorphic functions when certain nonlinear differential polynomials share a nonzero polynomial. Our results improve some recent results including that of a present first author.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.2
• /
• pp.461-473
• /
• 2023

Let f be a nonconstant meromorphic function of hyper-order strictly less than 1, and let c ∈ ℂ \ {0} such that f(z + c) ≢ f(z). We prove that if f and its exact difference ∆_cf(z) = f(z + c) - f(z) share partially 0, ∞ CM and share 1 IM, then ∆_cf = f, where all 1-points with multiplicities more than 2 do not need to be counted. Some similar uniqueness results for such meromorphic functions partially sharing targets with weight and their shifts are also given. Our results generalize and improve the recent important results.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.765-773
• /
• 2006

In ubiquitous environment, private enterprise or public institution's privacy data are sometimes exposed to hackers because of the lack of the sense of information security. We apply secret sharing scheme to solve the privacy problems. But, the existing secret sharing scheme are not suitable for the management of large a quantity of data because that required operation of large capacity. In this paper, We propose new secret sharing scheme for privacy data management. Our scheme makes high-speed operation possible, and it also allows for set weight for each secret pieces depending on weight of participants. The scheme proposed in this paper makes it efficient to collect and manage secure privacy data in ubiquitous environment.

• Journal of Digital Convergence
• /
• v.16 no.10
• /
• pp.79-87
• /
• 2018

In this study, the evaluation index was developed to design the project evaluation model, and the weight was given through the AHP survey. project was evaluated for the first time by using the designed evaluation model for the field appraisal. As a result, it was revealed that the weight of the propriety index of the participant effect and the project content was the highest among 20 indexes. This study is significant in having built a base on which the evaluation system could be stabilized, by developing the integrative project evaluation model of . However, we have yet to adequately address the evaluator's acceptability and efficacy in evaluating indicators. The validity and continuity of the evaluation model will be secured through this.

• International Journal of Quality Innovation
• /
• v.9 no.2
• /
• pp.99-117
• /
• 2008

High-tech industry has been the principal economic source for Taiwan in recent years. The characteristics of high-tech industries in Taiwan are changeable product markets, short product life cycles and high company attrition rate. In the globalization trend, the high-tech industry has gradually increased corporate competitiveness and reached the goal of sustainable operations through knowledge management, knowledge sharing and new product research and development. Firms have aggressively strengthened and integrated their internal and external resources and enhanced knowledge sharing to increase industry operational performance. Effectively strengthening the knowledge management operation and performance evaluation of knowledge sharing in Taiwan's high-tech industry has become a critical issue. In the selection of knowledge sharing Key Performance Indicators (KPI), this research divided the knowledge sharing indicators into representative strategic indicators such as organizational knowledge learning, organizational knowledge resources, organizational information capacity and organizational knowledge performance through screening using Factor Analysis. The characteristics of the constructs were interdependent. This research calculated and adjusted the correlation among the key performance knowledge sharing indicators using ANP and determined the relative weight of knowledge sharing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.7
• /
• pp.51-59
• /
• 1996

The current network environment is composed of heterogeneous H/W and S/W resources. Integrating CSCW applications in such heterogeneous environments is highly complex. This paper describes the design and implementation of ASS (application sharing server) which supprot sharing of a single application between different operating systems. The ASS supports cooperative work among user group using its own window system (X-windwo or MS-windwos). We adopted improved managing heavy-weight data. ASS also provides development environment for vaious groupware application.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.27-36
• /
• 2009

The leaking of personal information is mostly occurred by internal users. The confidential information such as credit card number can be disclosed or modified by system manager easily. The secure storaging and managing scheme for sensitive data of individual and enterprise is required for distributed data management. The manager owning private data is needed to have a weight which is a right to disclose a private data. For deciding a weight, it is required that system is able to designate the level of user's right. In this paper, we propose the new algorithm named digit-independent algorithm. And we propose a new data management scheme of gathering and processing the data based on digit-independent algorithm. Our sharing and recovering scheme have the efficient computation operation for managing a large quantity of data using weight table. The proposed scheme is able to use for secure e-business data management and storage in ubiquitous computing environment.

• Journal of the Chungcheong Mathematical Society
• /
• v.33 no.1
• /
• pp.43-56
• /
• 2020

Recently, linear codes constructed from defining sets have been studied widely and determined their complete weight enumerators and weight enumerators. In this paper, we obtain complete weight enumerators of linear codes and weight enumerators of linear codes. These codes have at most three weight linear codes. As application, we show that these codes can be used in secret sharing schemes and authentication codes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.4
• /
• pp.213-219
• /
• 2002

A secret sharing scheme is a kind of cryptographic protocol to maintain secret information by splitting it to many small pieces of shares and sharing between shareholders. In case of shareholders having different authorization to reconstruct the original secret, it is required a new secret sharing scheme to reflect any hierarchical structure between shareholders. In this paper, we propose a new weighted secret sharing scheme, that is, each shareholder has a weight according to the authorization of reconstructing the secret and an access set which is a subset of shareholders can reconstruct the secret if the sum of weights is equal or greater than a predefined threshold.