• Journal of applied mathematics & informatics
• /
• 제42권2호
• /
• pp.367-377
• /
• 2024

Let G = (V, E) be a graph with p-vertices and q-edges and let R^◦ be a finite zero ring of order n. An injective function f : V (G) → {r₁, r₂, _…, r_k}, where r_i ∈ R^◦ is called vertex pair sum k-zero ring labeling, if it is possible to label the vertices x ∈ V with distinct labels from R^◦ such that each edge e = uv is labeled with f(e = uv) = [f(u) + f(v)] (mod n) and the edge labels are distinct. A graph admits such labeling is called vertex pair sum k-zero ring graph. The minimum value of positive integer k for a graph G which admits a vertex pair sum k-zero ring labeling is called the vertex pair sum k-zero ring index denoted by 𝜓_pz(G). In this paper, we defined the vertex pair sum k-zero ring labeling and applied to some graphs.

• East Asian mathematical journal
• /
• 제24권4호
• /
• pp.377-387
• /
• 2008

We consider associative ring R (not necessarily commutative). In this paper the concepts: zero square ring of type-1/type-2, zero square ideal of type-1/type-2, zero square dimension of a ring R were introduced and obtained several important results. Finally, some relations between the zero square dimension of the direct sum of finite number of rings; and the sum of the zero square dimension of individual rings; were obtained. Necessary examples were provided.

• 한국심리학회지 : 문화 및 사회문제
• /
• 제27권3호
• /
• pp.285-303
• /
• 2021

이 연구는 Różycka-Tran, Boski, Wojciszke(2015)이 Belief in a Zero-Sum Game (BZSG) 모델을 토대로 개발한 제로섬 신념 척도를 국내 성인들을 대상으로 신뢰도와 타당도를 검증하고자 하였다. 이를 위해 전국에 거주하는 508명의 성인(대학생 252명, 일반성인 256명)을 대상으로 제로섬 신념, 사회적 신뢰, 주관적 사회경제적 지위, 개인주의-집단주의 문화 성향, 사회비교 지향성 척도로 구성된 온라인 설문조사를 실시하였다. 탐색적 요인분석과 확인적 요인분석 결과, 한국판 제로섬 신념은 단일요인 구조를 가지고 있는 것으로 확인되었고, 신뢰도 분석 결과, 양호한 내적 일치도를 확인할 수 있었다. 한국판 제로섬 신념 척도는 사회적 신뢰와 주관적 사회경제적 지위와는 관련이 없는 것으로 나타났다. 그러나 제로섬 신념 척도는 수직적 개인주의와 수직적 집단주의 문화 성향과 정적 관계를 나타냈고, 수평적 집단주의 문화 성향과는 부적 관계, 수평적 개인주의와는 관련성이 나타나지 않았으며, 사회비교 지향성과는 정적 관계로 나타났다. 하지만 이러한 결과는 대학생 집단이나 일반 성인 집단이냐에 따라 차이가 있었다. 마지막으로 이 연구가 국내에서 제로섬 신념과 관련된 많은 연구를 촉진할 수 있음을 밝혔고, 제로섬 신념에 영향을 주는 요인들을 살펴보고 제로섬 신념으로 인해 나타날 결과들을 밝히는 후속 연구가 필요하다는 제언을 제시하였다.

• Kyungpook Mathematical Journal
• /
• 제50권4호
• /
• pp.465-472
• /
• 2010

In this paper, we consider two extreme sets of zero-term rank sum of fuzzy matrix pairs: $$\cal{z}_1(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=min\{z(X),z(Y)\}\};$$ $$\cal{z}_2(\cal{F})=\{(X,Y){\in}\cal{M}_{m,n}(\cal{F})^2{\mid}z(X+Y)=0\}$$. We characterize the linear operators that preserve these two extreme sets of zero-term rank sum of fuzzy matrix pairs.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.362-369
• /
• 2013

The optimal number of users achieving the maximum sum throughput is analyzed in zero-forcing (ZF) based multiuser multiple-input multiple-output (MIMO) systems with a large number of base station (BS) antennas. By utilizing deterministic ergodic sum rates for the ZF-beam forming (ZF-BF) and ZF-receiver (ZF-R) with a large number of BS antennas [1], [2], we can obtain the ergodic sum throughputs for the ZF-BF and ZF-R for the uplink and downlink frame structures, respectively. Then, we can also formulate and solve the optimization problems maximizing the ergodic sum throughputs with respect to the number of users. This paper shows that the approximate downlink sum throughput for the ZF-BF is a concave function and the approximate uplink sum throughput for the ZF-R is also a concave function in a feasible range with respect to the number of users. The simulation results verify the analyses and show that the derived numbers of users provide the maximum sum throughputs for the ZF-BF as well as ZF-R in multiuser MIMO systems with a large number of BS antennas.

• East Asian mathematical journal
• /
• 제38권1호
• /
• pp.85-94
• /
• 2022

Recently, an LWE-based commitment scheme is proposed. Their construction is statistically hiding as well as computationally binding. On the other hand, the construction of related zero-knowledge protocols is left as an open problem. In this paper, we present zero-knowledge protocols with hardness based on the LWE problem. we show how to instantiate efficient zero-knowledge protocols that can be used to prove linear and sum relations among these commitments. In addition, we show how the variant of LWE, spLWE problem, can be used to instantiate efficient zero-knowledge protocols.

• Asian Journal for Public Opinion Research
• /
• 제5권1호
• /
• pp.15-40
• /
• 2017

This paper addresses the zero-sum of soft power against the backdrop of the rise of China and the relative "decline" of America. It attempts to find out that whether the "decline" of America's soft power is caused by the rise of China's soft power, and whether China's rise could guarantee with certainty the growth of soft power. In light of the particularity of South Korea, that is, its economy relies on China and its security relies on the US, this paper chooses South Korea as the entry point for the study. Based on the Pew data from a South Korean opinion poll, this paper conducts bivariate correlation and binary logistic regression respectively, to explore the existence of zero-sum "competitions" between China's and America's soft power.

• Kyungpook Mathematical Journal
• /
• 제49권2호
• /
• pp.221-233
• /
• 2009

In this article, we generalize a well-known result of Hebisch and Weinert that states that a finite semidomain is either zerosumfree or a ring. Specifically, we show that the class of commutative semirings S such that S has nonzero characteristic and every zero-divisor of S is nilpotent can be partitioned into zerosumfree semirings and rings. In addition, we demonstrate that if S is a finite commutative semiring such that the set of zero-divisors of S forms a subtractive ideal of S, then either every zero-sum of S is nilpotent or S must be a ring. An example is given to establish the existence of semirings in this latter category with both nontrivial zero-sums and zero-divisors that are not nilpotent.

• 한국통신학회논문지
• /
• 제38A권7호
• /
• pp.560-570
• /
• 2013

본 논문에서는 셀 간 간섭과 셀 내 사용자 간 간섭이 공존하는 two-cell 다중 안테나 하향링크 간섭 채널에서 송수신기 설계 방법을 제안한다. 우선 셀 간 간섭과 셀 내 사용자 간 간섭을 다차원 subspace에 정렬하는 zero-forcing 간섭 정렬 방법을 일반화한다. 그리고 일반화한 zero-forcing 간섭 정렬 방법에서 구한 송수신기를 "regularizing" 하는 minimum weighted-mean-square-error 기반 regularized ZF-IA 방법을 제안한다. 기존 weighted-sum-rate-maximizing 송수신기 설계 방법에 비해 제안하는 방법은 weight 를 구하는 반복 연산 과정이 필요하지 않다. 그 결과 제안하는 방법은 비록 sum-rate 최대화하도록 설계되진 않았지만, 기존의 weighted-sum-rate maximizing 방법 보다 계산 복잡도 면에서 효율적이고 더 빠른 수렴 속도를 얻을 수 있다. 다양한 분석과 실험을 통해 제안하는 regularized ZF-IA 방법의 우수성을 확인하였다. 구체적으로 반복 연산 수가 작은 경우, 제안하는 regularized ZF-IA 방법의 sum-rate 성능이 기존의 weighted-sum-rate maximizing 방법보다 SNR = 20 [dB] 에서 약 49.8 % 이상 나음을 확인할 수 있다. 더불어 채널 정보에 오차가 있는 경우 상당한 robustness를 제공하는 robust 송수신기 설계 방법도 제시한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.280-295
• /
• 2015

Block cipher ARIA was first proposed by some South Korean experts in 2003, and later, it was established as a Korean Standard block cipher algorithm by Korean Agency for Technology and Standards. In this paper, we focus on the security evaluation of ARIA block cipher against the recent zero-correlation linear cryptanalysis. In addition, Partial-sum technique and FFT (Fast Fourier Transform) technique are used to speed up the cryptanalysis, respectively. We first introduce some 4-round linear approximations of ARIA with zero-correlation, and then present some key-recovery attacks on 6/7-round ARIA-128/256 with the Partial-sum technique and FFT technique. The key-recovery attack with Partial-sum technique on 6-round ARIA-128 needs $2^{123.6}$ known plaintexts (KPs), $2^{121}$ encryptions and $2^{90.3}$ bytes memory, and the attack with FFT technique requires $2^{124.1}$ KPs, $2^{121.5}$ encryptions and $2^{90.3}$ bytes memory. Moreover, applying Partial-sum technique, we can attack 7-round ARIA-256 with $2^{124.6}$ KPs, $2^{203.5}$ encryptions and $2^{152}$ bytes memory and 7-round ARIA-256 employing FFT technique, requires $2^{124.7}$ KPs, $2^{209.5}$ encryptions and $2^{152}$ bytes memory. Our results are the first zero-correlation linear cryptanalysis results on ARIA.