• Title/Summary/Keyword: weighted sharing

Search Result 59, Processing Time 0.023 seconds

Meromorphic Functions with Weighted Sharing of One Set

  • Alzahary, Thamir C.
    • Kyungpook Mathematical Journal
    • /
    • v.47 no.1
    • /
    • pp.57-68
    • /
    • 2007
  • In this article, we investigate the problem of uniqueness of meromorphic functions sharing one set and having deficient values, and obtain a result which improves some earlier results.

  • PDF

Weighted Secret Sharing Scheme (가중치를 갖는 비밀분산법)

  • Park, So-Young;Lee, Sang-Ho;Kwon, Dae-Sung
    • 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.

ON THE UNIQUENESS OF CERTAIN TYPE OF SHIFT POLYNOMIALS SHARING A SMALL FUNCTION

  • Saha, Biswajit
    • Korean Journal of Mathematics
    • /
    • v.28 no.4
    • /
    • pp.889-906
    • /
    • 2020
  • In this article, we consider the uniqueness problem of the shift polynomials $f^n(z)(f^m(z)-1){\prod\limits_{j=1}^{s}}f(z+c_j)^{{\mu}_j}$ and $f^n(z)(f(z)-1)^m{\prod\limits_{j=1}^{s}}f(z+c_j)^{{\mu}_j}$, where f(z) is a transcendental entire function of finite order, cj (j = 1, 2, …, s) are distinct finite complex numbers and n(≥ 1), m(≥ 1), s and µj (j = 1, 2, …, s) are integers. With the concept of weakly weighted sharing and relaxed weighted sharing we obtain some results which extend and generalize some results due to P. Sahoo [Commun. Math. Stat. 3 (2015), 227-238].

SOME RESULTS ON THE UNIQUE RANGE SETS

  • Chakraborty, Bikash;Kamila, Jayanta;Pal, Amit Kumar;Saha, Sudip
    • Journal of the Korean Mathematical Society
    • /
    • v.58 no.3
    • /
    • pp.741-760
    • /
    • 2021
  • In this paper, we exhibit the equivalence between different notions of unique range sets, namely, unique range sets, weighted unique range sets and weak-weighted unique range sets under certain conditions. Also, we present some uniqueness theorems which show how two meromorphic functions are uniquely determined by their two finite shared sets. Moreover, in the last section, we make some observations that help us to construct other new classes of unique range sets.

A Priority Time Scheduling Method for Avoiding Gateway Bottleneck in Wireless Mesh Networks (무선 메쉬 네트워크에서 게이트웨이 병목 회피를 위한 우선순위 타임 스케줄링 기법)

  • Ryu, Min Woo;Kim, Dae Young;Cha, Si Ho;Cho, Kuk Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.2
    • /
    • pp.101-107
    • /
    • 2009
  • In existing wireless ad-hoc networks, how to distribute network resources fairly between many users to optimize data transmission is an important research subject. However, in wireless mesh networks (WMNs), it is one of the research areas to avoid gateway bottleneck more than the fair network resource sharing. It is because WMN traffic are concentrated on the gateway connected to backhaul. To solve this problem, the paper proposes Weighted Fairness Time-sharing Access (WFTA). The proposed WFTA is a priority time scheduling scheme based on Weighted Fair Queuing (WFQ).

Real-time Vehicle Tracking Algorithm According to Eigenvector Centrality of Weighted Graph (가중치 그래프의 고유벡터 중심성에 따른 실시간 차량추적 알고리즘)

  • Kim, Seonhyeong;Kim, Sangwook
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.4
    • /
    • pp.517-524
    • /
    • 2020
  • Recently, many researches have been conducted to automatically recognize license plates of vehicles and use the analyzed information to manage stolen vehicles and track the vehicle. However, such a system must eventually be investigated by people through direct monitoring. Therefore, in this paper, the system of tracking a vehicle is implemented by sharing the information analyzed by the vehicle image among cameras registered in the IoT environment to minimize the human intervention. The distance between cameras is indicated by the node and the weight value of the weighted-graph, and the eigenvector centrality is used to select the camera to search. It demonstrates efficiency by comparing the time between analyzing data using weighted graph searching algorithm and analyzing all data stored in databse. Finally, the path of the vehicle is indicated on the map using parsed json data.