• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.113-125
• /
• 2019

In this paper, we introduce the elimination ideal $I_D(G)$ associated to a simple finite graph G. We obtain the upper bound of Castelnuovo-Mumford regularity of elimination ideal for various classes of graphs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1674-1692
• /
• 2018

An RFID network is a network in which a reader inquire about the identities of tags and tags respond with their identities to a reader. The diversity of RFID networks has brought about many applications including an inexpensive system where a single reader supports a small number of tags. Such a system needs a tag cognizance scheme that is able to arbitrate among contending tags as well as is simple enough. In this paper, confining our attention to a clan of simple schemes, we propose a randomized scheme with aiming at enhancing the tag cognizance rate than a conventional scheme. Then, we derive an exact expression for the cognizance rate attained by the randomized scheme. Unfortunately, the exact expression is not so tractable as to optimize the randomized scheme. As an alternative way, we develop an upper bound on the tag cognizance rate. In a closed form, we then obtain a nearly optimal value for a key design parameter, which maximizes the upper bound. Numerical examples confirm that the randomized scheme is able to dominate the conventional scheme in cognizance rate by employing a nearly optimal value. Furthermore, they reveal that the randomized scheme is robust to the fallacy that the reader believes or guesses a wrong number of neighboring tags.

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.501-507
• /
• 2014

A dynamic system is called positive if any trajectory of the system starting from non-negative initial states remains forever non-negative for non-negative controls. In this paper, new sufficient conditions for asymptotic stability of the interval positive time-varying linear discrete-time systems with time-varying delay in states are considered. The considered time-varying delay time has an interval-like bound which has minimum and maximum delay time. The proposed conditions are established by using a solution bound of the Lyapunov equation and they are expressed by simple inequalities which do not require any complex numerical algorithms. An example is given to illustrate that the new conditions are simple and effective in checking stability for interval positive time-varying discrete systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3409-3422
• /
• 2014

The frequency spectrum available for the wireless communication is extremely crowded. In order to improve the spectral efficiency, the two-way relay networks have aroused great attention. A simple $N^{th}$ best-relay selection criterion for the opportunistic two-way relay networks is proposed, which can be implemented easily by extending the distributed timer technique in practice, since the proposed criterion is mainly based on the channel gains. The outage performance of the proposed relay selection scheme is analyzed under the outdated channel state information (CSI), and a tight closed-form lower bound and asymptotic value of the outage probability over Rayleigh fading channels are obtained. Simulation results demonstrate that the tight closed-form lower bound of the outage probability very closely matches with simulated ones in the whole SNR region, and the asymptotic results provide good tight approximations to the simulation ones, especially in the high SNR region.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1681-1693
• /
• 1997

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1188-1195
• /
• 2006

This paper presents an efficient design method of 2-D state-space digital filter based on an improved branch-and -bound algorithm. The resultant 2-D state-space digital filters whose coefficients are represented as the sum of two power-of-two terms, are attractive for high-speed operation and simple implementation. The feasibility of the proposed method is demonstrated by several experiments. The results show that the approximation error and group delay characteristic of the resultant filters are similar to those of the digital filters which designed in the continuous coefficient space.

• Transactions of Materials Processing
• /
• v.8 no.4
• /
• pp.374-383
• /
• 1999

To determine the flow stress of semi-solid materials, a new combined method has been studied by experimental and analytic technique in the current approach. Using backward extrusion experiment and its numerical analysis, the characterization scheme of semi-solid materials according to the change of initial solid volume fraction has been proposed. Because that solid volume fraction is sensitive to temperature change, it is required to precisely control the temperature setting. Model materials can guarantee the establishment of material characterization technique from the noise due to temperature change. Thus, clay mixed with bonded abrasives was used for experiment and the change of initial solid fraction was copied out through the variation of mixing ratio. Upper bound method was adapted to increase in efficiency of the calculation in numerical analysis and new kinematically admissible velocity field was employed to improve the accuracy of numerical solution. It is thought that the material characterization scheme proposed in this study can be applied to not only semi-solid materials, but also other materials that is difficult to obtain the simple stress state.

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.22 no.1
• /
• pp.91-95
• /
• 1993

To investigate hemolysin from Vibrio vulnificus in terms of protein chemistry and immunochemistvy, the simple method to produce antiserum was developed as follows ; Crude hemolysin from Vibrio vulnificus was mixed with cholesterol-phosphatidylcholine-liposome. Only hemolysin with molecular weight of 50kD was selertively bound to the liposome. Thus, without purification of crude hemolysin, liposome bound hemolysin was used as antigen to produce antiserum by injecting into back muscle of a rabbit. Resultant antiserum reacted only with hemolysin. Hemouysin of Vibrio vulnificus from patients and environment was formed single band in gel diffusion precipitation reaction with antiserum.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1606-1626
• /
• 2012

This paper investigates the performance of an amplify-and-forward (AF) two-way relaying system with antenna correlation. The system consists of two multiple-antenna sources, which exchange information via the aid of a single-antenna relay. In particular, we derive the exact outage probability expression. Furthermore, we provide a simple, tight closed-form lower bound for the outage probability. Based on the lower bound, we obtain the closed-form asymptotic outage probability and the average symbol error rate expressions at high signal-to-noise ratio (SNR), which reveal the system's diversity order and coding gain with antenna correlation. To investigate the system's throughput performance with antenna correlation, we also derive a closed-form lower bound for the average sum-rate, which is quite tight from medium to high SNR regime. The analytical results readily enable us to obtain insight into the effect of antenna correlation on the system's performance. Extensive Monte Carlo simulations are conducted to verify the analytical results.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.