• Journal of Information Technology Services
• /
• v.12 no.3
• /
• pp.331-343
• /
• 2013

In RFID systems, the anti-collision algorithm is being improved to recognize Tag's ID within recognition area of the reader quickly and efficiently. This paper focuses on Tag collision. Many studies have been carried out to resolve Tag collision. This paper proposes a new N-ary Query Tree Algorithm to resolve more than Tag collision simultaneously, according to the value of m(2 ~ 6). This algorithm can identify more tags than existing methods by treating a maximum 6 bit collision, regardless of the continuation/non-continuation Tag's ID patterns. So, it extracts maximumly different $2^6$ bit patterns per single prefix in recognition process. The performance of N-ary Query Tree Algorithm is evaluated by theoretical analysis and simulation program.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.839-848
• /
• 2023

Let G be a simple undirected graph. A planar graph known as a Halin graph(HG) is characterised by having three connected and pendent vertices of a tree that are connected by an outer cycle. A subset S of V is said to be a dominating set of the graph G if each vertex u that is part of V is dominated by at least one element v that is a part of S. The domination number of a graph is denoted by the γ(G), and it corresponds to the minimum size of a dominating set. A dominating set S is called a secure dominating set if for each v ∈ V＼S there exists u ∈ S such that v is adjacent to u and S₁ = (S＼{v}) ∪ {u} is a dominating set. The minimum cardinality of a secure dominating set of G is equal to the secure domination number γ_s(G). In this article we found the secure domination number of Halin graph(HG) with perfet k-ary tree and also we determined secure domination of rooted product of special trees.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.1-6
• /
• 2011

The performance and practicality of cryptosystem for encryption, decryption, and primality test is primarily determined by the implementation efficiency of the modular exponentiation of $a^b$(mod n). To compute $a^b$(mod n), the standard binary squaring still seems to be the best choice. But, the d-ary, (d=2,3,4,5,6) method is more efficient in large b bits. This paper suggests m-numeral system modular exponentiation. This method can be apply to$b{\equiv}0$(mod m), $2{\leq}m{\leq}16$. And, also suggests the another method that is exit the algorithm in the case of the result is 1 or a.

• Journal of Information Science Theory and Practice
• /
• v.8 no.3
• /
• pp.6-14
• /
• 2020

On information markets, we can identify different relations between sellers and their customers, with some users paying with money, some paying with attention, and others paying with their personal data. For the description of these different market relations, this article introduces the notion of arity into the scientific discussion. On unary information markets, customers pay with their money; examples include commercial information suppliers. Binary information markets are characterized by one market side paying with attention (e.g., on the search engine Google) or with personal data (e.g., on most social media services) and the other market side (mainly advertisers) paying with money. Our example of a ternary market is a social media market with the additional market side of influencers. If customers buy on unary markets, they know what to pay (in terms of money). If they pay with attention or with their personal data, they do not know what they have to pay exactly in the end. On n-ary markets (n greater than 1), laws should regulate company's abuse of money and-which is new-abuse of data streams with the aid of competition (or anti-trust) laws, and by modified data protection laws, which are guided by fair use of end users' attention and data.

• Korean Journal of Mathematics
• /
• v.9 no.2
• /
• pp.129-131
• /
• 2001

Let $q=p^{e1}_1{\cdots}p^{em}_m$ be the product of distinct prime elements. In this short paper, we show that the largest value of M such that there exists an ($n$, M, $n-1$) $q$-ary code is $q^2$ if $n-1{\leq}p^{ei}_i$ for all $i$.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.27-44
• /
• 2001

A fast Poisson solver on irregular domains, based on bound-ary methods, is presented. The harmonic polynomial approximation of the solution of the associated homogeneous problem provides a good practical boundary method which allows a trivial parallel processing for solution evaluation or straightfoward computations of the interface values for domain decomposition/embedding. AMS Mathematics Subject Classification : 65N35, 65N55, 65Y05.

• The Korean Journal of Applied Statistics
• /
• v.12 no.1
• /
• pp.253-260
• /
• 1999

이어진 블록계획 중에서 대칭 균형된 불완비 블록계획(Symmetrical Balanced Incomplete Block Design : SBIBD)을 이용하여 n-ary를 블록 완전이면교배(Complete Diallel Cross : CDC)계획을 설계하였다. 처리 수와 반복 수가 고정된 경우, 이렇게 설계된 계획이 균형된 불완비 블록계획을 이용해서 설계한 계획들 중에서 가장 효율이 높은 계획임을 보인다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1995.06a
• /
• pp.115-118
• /
• 1995

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.189-198
• /
• 2004

We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.5
• /
• pp.755-764
• /
• 2001

In this paper, we propose maximum likelihood (ML) decision feedback channel estimation (DFCE) for M-ary orthogonal modulation in direct sequence/code division multiple access (DS/CDMA) systems. The proposed DFCE uses the maximum combiner output in a RAKE receiver as decision feedback information, enabling M-ary orthogonal signals to be demodulated coherently and a RAKE receiver to use a em maximal ration combining (MRC) scheme. However, the performance of the proposed DFCE in the multiuser environment is severely degraded due to multiple access interference (MAI). To overcome this problem, a multistage parallel interference cancellation (PIC) scheme is combined with the proposed DFCE for multiuser environments. Accurate knowledge of the channel coefficient estimated by the proposed DFCE is used to regenerate the signal of each user for the multistage PIC scheme. According to the results of our simulations, the performance of coherent demodulation using the proposed system is significantly improved in comparison with conventional noncoherent demodulation.