• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.327-336
• /
• 2015

In this paper, we study a constructive approximation by neural networks with positive integer weights. Like neural networks with real weights, we show that neural networks with positive integer weights can even approximate arbitrarily well for any continuous functions on compact subsets of $\mathbb{R}$. We give a numerical result to justify our theoretical result.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.593-602
• /
• 2021

We use a kind of modified Hurwitz class numbers to express the number of representing a positive integer by some ternary quadratic forms such as the sum of three squares, and the Fourier coefficients of weight 2 modular forms of prime level with trivial character.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.731-736
• /
• 2017

It is well-known that there exists a constant-weight $[s{\theta}_{k-1},k,sq^{k-1}]_q$ code for any positive integer s, which is an s-fold simplex code, where ${\theta}_j=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+n_q(k,d)$ for any positive integer d, where $n_q(k,d)$ is the minimum length n for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s{\theta}_{k-1}+1,k,sq^{k-1}]_q$ code for $1{\leq}s{\leq}k-3$, which gives a better upper bound $n_q(k,sq^{k-1}+d){\leq}s{\theta}_{k-1}+1+n_q(k-1,d)$ for $1{\leq}d{\leq}q^s$. As another application, we prove that $n_q(5,d)={\sum_{i=0}^{4}}{\lceil}d/q^i{\rceil}$ for $q^4+1{\leq}d{\leq}q^4+q$ for any prime power q.

• Honam Mathematical Journal
• /
• v.44 no.3
• /
• pp.447-460
• /
• 2022

We consider a closed subspace ${\tilde{A}}^{{\alpha},m}_q$ (ℂ) of the Fock space A^α,m_q (ℂ) of q-analytic functions with the weight ϕ(z) = -α log |z|²+|z|^2m for any positive integer m. We obtain the corresponding reproducing kernel K^ℂ_α,q,m(z, w) using the weighted Laguerre polynomials and the Mittag-Leffler functions. Finally, we investigate the necessary and sufficient condition on (α, q, m) such that K^ℂ_α,q,m(z, w) is zero-free.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.661-669
• /
• 2021

For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑_v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γ_R^P(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.537-544
• /
• 2017

As a special form of the signed-digit representation, the NAF(non-adjacent form) minimizes the hamming weight by reducing the average density of the non-zero bits from the binary representation of the positive integer k. Due to this advantage, the NAF is used in various fields; in particular, it is actively used in cryptology. The existing NAF-conversion algorithm, however, is problematic because the conversion speed decreases when the LSB(least significant bit) frequently becomes "1" during the binary positive integer conversion process. This paper suggests a method for the improvement of the NAF-conversion speed for which the problems that occur in the existing NAF-conversion process are solved. To verify the performance improvement of the algorithm, the CPU cycle for the various inputs were measured on the ATmega128, a low-performance 8-bit microprocessor. The results of this study show that, compared with the existing algorithm, the suggested algorithm not only improved the processing speed of the major patterns by 20% or more on average, but it also reduced the NAF-conversion time by 13% or more.

• Journal of the Korean Mathematical Society
• /
• v.46 no.6
• /
• pp.1309-1318
• /
• 2009

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A Roman k-dominating function on G is a function f : V (G) $\rightarrow$ {0, 1, 2} such that every vertex u for which f(u) = 0 is adjacent to at least k vertices $\upsilon_1,\;\upsilon_2,\;{\ldots},\;\upsilon_k$ with $f(\upsilon_i)$ = 2 for i = 1, 2, $\ldot$, k. The weight of a Roman k-dominating function is the value f(V (G)) = $\sum_{u{\in}v(G)}$ f(u). The minimum weight of a Roman k-dominating function on a graph G is called the Roman k-domination number ${\gamma}_{kR}$(G) of G. Note that the Roman 1-domination number $\gamma_{1R}$(G) is the usual Roman domination number $\gamma_R$(G). In this paper, we investigate the properties of the Roman k-domination number. Some of our results extend these one given by Cockayne, Dreyer Jr., S. M. Hedetniemi, and S. T. Hedetniemi [2] in 2004 for the Roman domination number.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3455-3474
• /
• 2018

As a unique form of signed-digit representation, non-adjacent form (NAF) minimizes Hamming weight by removing a stream of non-zero bits from the binary representation of positive integer. Thanks to this strong point, NAF has been used in various applications such as cryptography, packet filtering and so on. In this paper, to improve the NAF conversion speed of the $NAF_w$ algorithm, we propose a new NAF conversion algorithm, called w-bit Shifting Non-Adjacent Form($SNAF_w$), where w is width of scanning window. By skipping some unnecessary bit comparisons, the proposed algorithm improves the NAF conversion speed of the $NAF_w$ algorithm. To verify the excellence of the $SNAF_w$ algorithm, the $NAF_w$ algorithm and the $SNAF_w$ algorithm are implemented in the 8-bit microprocessor ATmega128. By measuring CPU cycle counter for the NAF conversion under various input patterns, we show that the $SNAF_2$ algorithm not only increases the NAF conversion speed by 24% on average but also reduces deviation in the NAF conversion time for each input pattern by 36%, compared to the $NAF_2$ algorithm. In addition, we show that $SNAF_w$ algorithm is always faster than $NAF_w$ algorithm, regardless of the size of w.

• Clinical and Experimental Pediatrics
• /
• v.60 no.11
• /
• pp.353-358
• /
• 2017

Purpose: To develop and evaluate a simple screening tool to assess hearing loss in newborns. A derived score was compared with the standard clinical practice tool. Methods: This cohort study was designed to screen the hearing of newborns using transiently evoked otoacoustic emission and auditory brain stem response, and to determine the risk factors associated with hearing loss of newborns in 3 tertiary hospitals in Northern Thailand. Data were prospectively collected from November 1, 2010 to May 31, 2012. To develop the risk score, clinical-risk indicators were measured by Poisson risk regression. The regression coefficients were transformed into item scores dividing each regression-coefficient with the smallest coefficient in the model, rounding the number to its nearest integer, and adding up to a total score. Results: Five clinical risk factors (Craniofacial anomaly, Ototoxicity, Birth weight, family history [Relative] of congenital sensorineural hearing loss, and Apgar score) were included in our COBRA score. The screening tool detected, by area under the receiver operating characteristic curve, more than 80% of existing hearing loss. The positive-likelihood ratio of hearing loss in patients with scores of 4, 6, and 8 were 25.21 (95% confidence interval [CI], 14.69-43.26), 58.52 (95% CI, 36.26-94.44), and 51.56 (95% CI, 33.74-78.82), respectively. This result was similar to the standard tool (The Joint Committee on Infant Hearing) of 26.72 (95% CI, 20.59-34.66). Conclusion: A simple screening tool of five predictors provides good prediction indices for newborn hearing loss, which may motivate parents to bring children for further appropriate testing and investigations.