• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• The KIPS Transactions:PartB
• /
• v.13B no.7 s.110
• /
• pp.633-642
• /
• 2006

In the Internet environment many interactions between many users and unknown users take place and it is usually rare to have the trust information about others. Due to the lack of trust information, entities have to take some risks in transactions with others. In this perspective, it is crucial for the entities to be equipped with functionality to accumulate and manage the trust information on other entities in order to reduce risks and uncertainty in their transactions. This paper is concerned with a quantitative computational trust model which takes into account multiple evaluation criteria and uses the recommendation from others in order to get the trust for an entity. In the proposed trust model, the trust for an entity is defined as the expectation for the entity to yield satisfactory outcomes in the given situation. Once an interaction has been made with an entity, it is assumed that outcomes are observed with respect to evaluation criteria. When the trust information is needed, the satisfaction degree, which is the probability to generate satisfactory outcomes for each evaluation criterion, is computed based on the empirical outcome outcome distributions and the entity's preference degrees on the outcomes. Then, the satisfaction degrees for evaluation criteria are aggregated into a trust value. At that time, the reputation information is also incorporated into the trust value. This paper also shows that the model could help the entities effectively choose other entities for transactions with some experiments in e-commerce.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.725-732
• /
• 2002

P-values are often perceived as measurements of degree of compatibility between the current data and the hypothesized model. In this paper, a new concept of Bayesian p-values is proposed and studied under the non-informative prior distributions, which can be thought as the Bayesian counterparts of the classical p-values in the sense of using the concept of significance level. The performances of the proposed Bayesian p-values are compared with those of the classical p-values through several examples.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.506-511
• /
• 1998

In this paper we consider multiobjective linear programming problems with coefficients of the objective functions specified by possibility distributions. Possibly and necessarily efficient solution sets are defined as funny solution sets whose membership grades represent possibility and necessity degrees to which a feasible solution is efficient. Considering efficiency condition and its dual condition in ordinary multiobjective linear programming problem, we propose efficiency test methods based on an extreme ray generation method. Since the proposed methods can be put in the part of a bi-section method, we can develop calculation and methods of the degree of possible and necessary efficiency for feasible solutions.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.427-438
• /
• 2005

From a notion of d-pseudo-orthogonality for a sequence of poly-nomials ($d\;\in\;{2,3,\cdots}$), this paper introduces three different characterizations of natural exponential families (NEF's) with polynomial variance functions of exact degree 2d-1. These results provide extended versions of the Meixner (1934), Shanbhag (1972, 1979) and Feinsilver (1986) characterization results of quadratic NEF's based on classical orthogonal polynomials. Some news sets of polynomials with (2d-1)-term recurrence relation are then pointed out and we completely illustrate the cases associated to the families of positive stable distributions.

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2003.04a
• /
• pp.207-210
• /
• 2003

In this research analyzed the daily precipitation depths of 4 climatic stations in south eastern part of Korea. It aimed to present some indices for regionalization of the area. The items are frequency distributions of precipitation quantity and days and the longest days less than class limit set up by arithmetic differences. The regression analysis between class value and frequency show very good correlation coefficients better than 0.99 which are cubic equation for the precipitation, exponential equation for the precipitation days, and first degree equation for the longest day less than class limit.

• Cross-Cultural Studies
• /
• v.27
• /
• pp.387-414
• /
• 2012

This paper is intended to describe the idiosyncratic aspects of the 'let alone' construction in English, clarifying the productivity property of this construction and to show that this construction displays the properties of prepositional phrase that denote the meaning of 'the comparison of degree', against the claim that this construction should be regarded as a coordinating conjunction. In the process of doing that, this paper classifies this 'let alone' construction into two types of construction, by investigating the external and internal syntactic distributions of 'let alone' constructions as well as the relationship between 'let alone' phrases and the main clause.

• Proceedings of the KSME Conference
• /
• 2001.06e
• /
• pp.819-824
• /
• 2001

Mean velocity and Reynolds stress components of the developing turbulent flows in a rotating 90 degree bend with square cross-section were measured by a hot-wire anemometer. Effects of the centrifugal and Coriolis forces generated by the curvature and rotation of bend on the mean motion and turbulence structures are investigated experimentally. Results show that the Coriolis force associated with the rotation of the bend may act both through the mean motion and turbulent structures, thereby changing the pressure fields, mean and turbulent velocities distributions.

• Journal of the Korean Society of Visualization
• /
• v.1 no.2
• /
• pp.38-46
• /
• 2003

An experimental investigation was performed to study the turbulent characteristics of swirling flow a 90$^{\circ}C$ circular tube for Re = 10,000, 15,000 and 20,000. 2D-PIV(Particle Image Velocimetry)technique was employed to measure the fluctuation velocity field. The results include spatial distributions of mean velocity vectors, turbulence intensity and turbulence kinetic energy. The axial and radial turbulence intensities, and kinetic energy profiles show double-peak structures in the inlet region of the 90 degree bend and the profiles are disappeared along the test tube with decaying the swirl intensity.

• Nuclear Engineering and Technology
• /
• v.31 no.3
• /
• pp.303-313
• /
• 1999

Various interpolation methods have been compared for reconstruction of LMR pin power distributions in hexagonal geometry. Interpolation functions are derived for several combinations of nodal quantities and various sets of basis functions, and tested against fine mesh calculations. The test results indicate that the interpolation functions based on the sixth degree polynomial are quite accurate, yielding maximum interpolation errors in power densities less than 0.5%, and maximum reconstruction errors less than 2% for driver assemblies and less than 4% for blanket assemblies. The main contribution to the total reconstruction error is made tv the nodal solution errors and the comer point flux errors. For the polynomial interpolations, the basis monomial set needs to be selected such that the highest powers of x and y are as close as possible. It is also found that polynomials higher than the seventh degree are not adequate because of the oscillatory behavior.