• Kyungpook Mathematical Journal
• /
• 제28권1호
• /
• pp.39-44
• /
• 1988

In 1940, B. H. Neumann, working with a system more general than a near-field, proved that the additive group of such a system (and of a near-field) is commutative. The algebraic structure he used is known as a Neumann system (N-system). Here, the prime N-systems are classified and for each possible characteristic, examples of N-systems which are neither near-fields nor rings are given. It is also shown that a necessary condition for the set of all odd polynomials over GF(p) to be an N-system is that p is a Fermat prime.

• Communications for Statistical Applications and Methods
• /
• 제12권2호
• /
• pp.463-472
• /
• 2005

In this paper, the problem of estimating a p-variate (p $\ge$4) normal mean vector is considered in decision-theoretic set up. Using a simple property of the noncentral chi-square distribution, a sequence of estimators dominating the Lindley type estimator with the cases of unknown covariance matrices has been produced and each improved estimator is better than previous one.

• Korean Journal of Mathematics
• /
• 제29권3호
• /
• pp.593-602
• /
• 2021

In this paper, the concept of s-convex function in the third sense is given. Then fundamental characterizations and some basic algebraic properties of s-convex function in the third sense are presented. Also, the relations between the third sense s-convex functions according to the different values of s are examined.

• 대한수학회보
• /
• 제59권6호
• /
• pp.1339-1348
• /
• 2022

Let A = {a₁ < a₂ < ⋯} be a sequence of integers and let P(A) = {Σε_ia_i : a_i ∈ A, ε_i = 0 or 1, Σε_i < ∞}. Burr posed the following question: Determine conditions on integers sequence B that imply either the existence or the non-existence of A for which P(A) is the set of all non-negative integers not in B. In this paper, we focus on some problems of subset sum related to Burr's question.

• Journal of Applied and Pure Mathematics
• /
• 제5권1_2호
• /
• pp.41-53
• /
• 2023

Let G = (V, E) be a (p, q) graph. Define $${\rho}=\{{\frac{2}{p}},\;{\text{{\qquad} if p is even}}\\{\frac{2}{p-1}},\;{{\text{if p is odd}}$$ and L = {±1, ±2, ±3, … , ±ρ} called the set of labels. Consider a mapping f : V ⟶ L by assigning different labels in L to the different elements of V when p is even and different labels in L to p-1 elements of V and repeating a label for the remaining one vertex when p is odd.The labeling as defined above is said to be a pair difference cordial labeling if for each edge uv of G there exists a labeling |f(u) - f(v)| such that ${\mid}{\Delta}_{f_1}-{\Delta}_{f^c_1}{\mid}{\leq}1$, where ${\Delta}_{f_1}$ and ${\Delta}_{f^c_1}$ respectively denote the number of edges labeled with 1 and number of edges not labeled with 1. A graph G for which there exists a pair difference cordial labeling is called a pair difference cordial graph. In this paper we investigate pair difference cordial labeling behaviour of Petersen graphs P(n, k) like P(n, 2), P(n, 3), P(n, 4).

• Asia pacific journal of information systems
• /
• 제29권4호
• /
• pp.571-590
• /
• 2019

Despite the growing amount of mobile peer-to-peer (P2P) payment applications available on mobile app stores, these applications are still in their infancy and have yet to see mass adoption. This study aims to explore the factors that influence the adoption of such mobile P2P payment applications by using a large-scale data set based on the tracking of users' actual mobile application usage behavior. Our main findings reveal that the duration of each session that users use of traditional bank application has a significant relationship with their adoption of mobile P2P payment applications. In addition, we explore the social aspect of such mobile P2P payment applications by analyzing their social network applications usage and found that the amount of social network service applications used and usage duration positively impacted one's adoption of mobile P2P payment applications. These findings have important theoretical and practical implications for stakeholders of mobile P2P payment solution providers as well as intermediaries/banks who provide their own payment applications to their customers.

• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.337-342
• /
• 2013

In this paper, we study a special class of linear codes, called skew cyclic codes, over the ring $R=F_p+vF_p$, where $p$ is a prime number and $v^2=v$. We investigate the structural properties of skew polynomial ring $R[x,{\theta}]$ and the set $R[x,{\theta}]/(x^n-1)$. Our results show that these codes are equivalent to either cyclic codes or quasi-cyclic codes. Based on this fact, we give the enumeration of distinct skew cyclic codes over R.

• 한국근적외분광분석학회:학술대회논문집
• /
• 한국근적외분광분석학회 2001년도 NIR-2001
• /
• pp.1275-1275
• /
• 2001

The pH value of grass silages is one important parameter to determine the quality of the forages. In an attempt to use NIRS spectra taken for other quality parameter of grass silage it has been shown that a good correlation between NIR spectra of the dried forage and pH value of the fresh forage could be determined. Further investigations revealed that the B coefficients of the pH value calibration were almost the same as the B coefficients of the sugar calibration multiplied with -1. And indead the pH value - in the fresh sample material - of the calibration set is strongly correlated with the sugar concentration - in the dried sample material. It is concluded that next to scientific tools in research the scientist and the user of NTRS equippment has to scrutinze his own work. Examples are given. NIRS is a powerfull technique, but pitfalls are present in surplus.

• 대한수학회보
• /
• 제55권6호
• /
• pp.1773-1781
• /
• 2018

The Radon transform introduced by J. Radon in 1917 is the integral transform which is widely applicable to tomography. Here we study the discrete version of the Radon transform. More precisely, when $C({\mathbb{Z}}^n_p)$ is the set of complex-valued functions on ${\mathbb{Z}}^n_p$. We completely determine the subset of $C({\mathbb{Z}}^n_p)$ whose elements can be recovered from its Radon transform on ${\mathbb{Z}}^n_p$.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(B)
• /
• pp.474-477
• /
• 2011

본 논문은 평면상에 주어진 자료점의 집합 P로부터 질의 집합 Q에 대해 skyline을 성질을 만족하는 P의 부분집합을 찾는 알고리즘을 제시한다. 이 때 P의 점들 간의 우위는 Q의 점에서의 거리를 이용하여 판단하는데 이 논문에서는 두 점간의 거리를 $L_1$거리로 정의한다. 이와 같은 환경 하에서 |P|$\geq$|Q|라고 가정할 때 우리는 O(|P|log|P|) 시간에 모든 skyline을 찾는 알고리즘을 제시하였다.