• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.182-189
• /
• 2016

The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

• Journal of the Korean Data and Information Science Society
• /
• 제22권6호
• /
• pp.1175-1182
• /
• 2011

본 연구는 초기하분포의 모수, 즉 성공의 확률에 대한 신뢰구간추정에 대하여 설펴보았다. 초기하분포의 성공의 확률에 대한 신뢰구간은 일반적으로 잘 알려져 있지 않으나 그 응용성과 활용성의 측면에서 신뢰구간의 추정은 상당히 중요하다. 본 논문에서는 초기하분포의 성공의 확률에 대한 정확신뢰구간과 이항분포와 정규분포에 의한 근사신뢰구간을 소개하고 여러 가지 모집단의 크기와 표본 수에 대하여, 그리고 몇 가지 관찰값에 대한 정확신뢰구간과 근사신뢰구간을 계산하고 소 표본의 경우에 모의실험을 통하여 실제포함확률의 측면에서 살펴보았다.

• 한국인터넷방송통신학회논문지
• /
• 제23권2호
• /
• pp.185-191
• /
• 2023

본 논문은 지금까지 NP-완전 문제로 다항시간 알고리즘이 존재하지 않는 완전피복 문제에 대해 선형시간으로 해를 구할 수 있는 알고리즘을 제안하였다. 제안된 알고리즘은 "행과 열에는 동일한 값이 존재하면 안된다"는 완전피복문제의 특징을 이용하였다. 이를 위해 먼저 최소 원소 개수를 가진 부분집합을 선택하고 선택된 부분집합의 원소를 가진 부분집합을 삭제하였다. 남은 부분집합들을 대상으로 반복적으로 수행하면 해를 구한다. 만약, 해를 구하지 못하면 최대 원소 개수를 가진 부분집합을 선택하여 동일한 과정을 수행하였다. 제안된 알고리즘은 일반적인 완전피복 문제의 해를 쉽게 구하였다. 추가로, 완전피복 문제를 보다 일반화한 N-퀸 문제를 대상으로 제안된 알고리즘을 적용할 수 있음을 보였다. 결국, 제안된 완전피복 알고리즘은 완전피복 문제에 대해 P-문제임을 증명하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.185-199
• /
• 2005

With the growth of internet shopping malls, there is increasing interest in comparison shopping mall. However most comparison sites compare only book prices by collecting simple XML data and do not provide .the exact comparison Including precise shipping costs. Shipping costs vary depending on each customer's address, the delivery method, and the category of selected goods, so rule based system is required in order to calculate exact shipping costs. Therefore, we designed and implemented comparison shopping mall which compares not only book prices but also shipping costs using rule based inference. By adopting the extensible Rule Markup language (XRML) approach, we proposed the methodology of extracting delivery rules from Web pages of each shopping mall. The XRML approach can facilitate nearly automatic rule extraction from Web pages and consistency maintenance between Web pages and rule base. We developed a ConsiderD system which applies our rule acquisition methodology based on XRML. The objective of the ConsiderD system is to compare the exact total cost of books including the delivery cost over Amazon.com, BarnesandNoble.com, and Powells.com. With this prototype, we conducted an experiment to show the potential of automatic rule acquisition from Web pages and illustrate the effect of delivery cost.

• 한국학교수학회논문집
• /
• 제1권1호
• /
• pp.131-138
• /
• 1998

The aims of mathematical education are to improve uniformity and rigidity, and to apply to an information age which our society demands. One of the educational aims in the 6th educational curriculum emphasizes on the expansion of mathematical thought and utility, But, The change of contents in the text appears little. This means that mathematical teachers must actively develop the new types of problems. That the interests and concerns about mathematics lose the popularity and students recognize mathematics burdensome is the problems of not only teaching method, unrealistically given problems but abstractiveness and conceptions. Mathematical Modeling is classified exact model, almost exact theory based model and impressive model in accordance with the realistic situation and its equivalent degree of mathematical modeling. Mathematical Modeling is divided into normative model and descriptive model according to contributed roles of mathematics. The Modeling Applied Problems in the present text are exact model and stereotyped problems. That the expansion of mathematical thought in mathematics teaching fell into insignificance appears well in the result of evaluating students. For example, regardless of easy or hard problems, students tend to dislike the new types of mathematical problems which students can solve with simple thought and calculation. The ratings of the right answer tend to remarkably go down. If mathematical teachers entirely treat present situation, and social and scientific situation, students can expand the systematic thought and use the knowledge which is taught in the class. Through these abilities of solving problems, students can cultivate their general thought and systematic thought. So it is absolutely necessary for students to learn the Modeling Applied Problems.

• International Journal of Aeronautical and Space Sciences
• /
• 제3권2호
• /
• pp.46-58
• /
• 2002

An inverse method is introduced to construct benchmark problems for the numerical solution of initial value problems. Benchmark problems constructed through this method have a known exact solution, even though analytical solutions are generally not obtainable. The solution is constructed such that it lies near a given approximate numerical solution, and therefore the special case solution can be generated in a versatile and physically meaningful fashion and can serve as a benchmark problem to validate approximate solution methods. A smooth interpolation of the approximate solution is forced to exactly satisfy the differential equation by analytically deriving a small forcing function to absorb all of the errors in the interpolated approximate solution. A multi-variable orthogonal function expansion method and computer symbol manipulation are successfully used for this process. Using this special case exact solution, it is possible to directly investigate the relationship between global errors of a candidate numerical solution process and the associated tuning parameters for a given code and a given problem. Under the assumption that the original differential equation is well-posed with respect to the small perturbations, we thereby obtain valuable information about the optimal choice of the tuning parameters and the achievable accuracy of the numerical solution. Illustrative examples show the utility of this method not only for the ordinary differential equations (ODEs) but for the partial differential equations (PDEs).

• Structural Engineering and Mechanics
• /
• 제68권4호
• /
• pp.399-408
• /
• 2018

Cable supported structures have been widely used in civil engineering. Cable tension estimation has great importance in cable supported structures' analysis, ranging from design to construction and from inspection to maintenance. Even though the Bernoulli-Euler beam element is commonly used in the traditional finite element method for calculation of frequency and cable tension estimation, many elements must be meshed to achieve accurate results, leading to expensive computation. To improve the accuracy and efficiency, a dynamic finite element method for estimation of cable tension is proposed. In this method, following the dynamic stiffness matrix method, frequency-dependent shape functions are adopted to derive the stiffness and mass matrices of an exact beam element that can be used for natural frequency calculation and cable tension estimation. An iterative algorithm is used for the exact beam element to determine both the exact natural frequencies and the cable tension. Illustrative examples show that, compared with the cable tension estimation method using the conventional beam element, the proposed method has a distinct advantage regarding the accuracy and the computational time.

• 한국산학기술학회논문지
• /
• 제13권7호
• /
• pp.2858-2864
• /
• 2012

곡선보 (curved beam)의 내평면 모멘트 및 등분포하중 하에서 평면내 (in-plane) 좌굴 (buckling)을 미분구적법(DQM)을 이용하여 해석하였다. 다양한 경계조건 (boundary conditions)과 굽힘각 (opening angles)에 따른 임계모멘트 및 임계하중을 계산하였다. DQM의 해석결과는 해석적 해답 (exact solution) 결과와 비교하였으며, DQM은 적은 요소 (grid points)를 사용하여 정확한 해석결과를 보여주었다. 두 경계조건(고정-고정, 단순지지-고정)하에서 새 결과를 또한 제시하였다.