• Journal of applied mathematics & informatics
• /
• v.42 no.5
• /
• pp.1137-1144
• /
• 2024

We are concerned with the T-Graphs, denoted by G_T, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology T on a set X, a T-Graph G = (V,E) is an undirected graph. In this graph, the vertex set V is P(X) and the edge set E consists of all unordered pairs of nodes u and v in V, denoted by (u, v). The pair of nodes satisfies the condition that u ∈ T and u^c ∩ v ∈ T, where u^c is the complement of the subset u of X. The primary objective of this paper is threefold: (i) Find that the number of triangles (ii) we intend to establish that the number of rectangles and (iii) the number of Hamiltonian cycles and Eulerian closed trials in a graph G_T.

• The Korean Journal of Applied Statistics
• /
• v.24 no.1
• /
• pp.207-216
• /
• 2011

Bootstrap is a resampling technique to find an estimate of parameters or to evaluate the estimate. This technique has been used in estimating parameters in linear model(LM) and generalized linear model(GLM). In this paper, we explore the possibility of applying Bootstrapping Residuals, Pairs, and an Estimating Equation that are most widely used in LM and GLM to the generalized estimating equation(GEE) algorithm for modelling repeatedly measured regression data sets. We compared three bootstrapping methods with coefficient and standard error estimates of GEE models from one simulated and one real data set. Overall, the estimates obtained from bootstrap methods are quite comparable, except that estimates from bootstrapping pairs are somewhat different from others. We conjecture that the strange behavior of estimates from bootstrapping pairs comes from the inconsistency of those estimates. However, we need a more thorough simulation study to generalize it since those results are coming from only two small data sets.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.2E
• /
• pp.79-84
• /
• 2006

Acoustic characteristics of a sound absorbing material can be identified, if the characteristic impedance and propagation constants are known, which have generally been determined experimentally. One easy method determining these two essential parameters is to measure the one dimensional wave characteristics in the impedance tube. In th udy, the effects of backing conditions on the impedance tube measurement have been examined using several pairs of generally used end conditions. The results showed that the measured values are similar for most pairs of end conditions: however, it was observed that the measured characteristic impedance for different thickness did not agree well for some pairs. In this work, the multi termination method, using three or more known backing con ns, was suggested to reduce such random errors, which are mostly caused by the test procedure. Employing three terminations as a set, comprised of a rigid end, an end with porous material, and an end with a backing cavity, it was demonstrated that improved measured results could be obtained for an open cell PU foam varying widely with three different thicknesses.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.43-50
• /
• 1996

This paper is concerned with assessing goodness of fit of gravity models. The Chi-square test, or one of its asymptotic equivalents, is usually recommended for the purpose. A difficulty that frequently arises, particularly when working with urban travel data, is that the expected number of trips for most origin-destination(O-D) pairs are small. In order to test goodness of fit of gravity model, a simple approach, which depends on the number of O-D pairs and certain trip totals being large, is proposed in this paper. In addition, derivation of variance of Chi-square ratio is proposed to test the confidence interval of Chi-square ratio and application of its results with simulated data set is made to verify the usefulness of the results.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.155-164
• /
• 2003

A method is proposed to predict the distances between given residue pairs (between C$\sub$${\alpha}$/ atoms) of a protein using a sequence to structure mapping by indefinite quadratic approximation. The prediction technique requires a data fitting in three dimensional space with coordinates of the residues of known structured proteins and leads to a numerical ref resentation of 20 amino acids by minimizing a large least norm iteratively. These approximations are used in distance prediction for given residue pairs. Some computational experience on a test set of small proteins from Brookhaven Protein Data Bank are given.

• The Pure and Applied Mathematics
• /
• v.4 no.1
• /
• pp.97-104
• /
• 1997

The large deviations theorem of Cramer is extended to conditional probabilities in the following sense. Consider a random sample of pairs of random vectors and the sample means of each of the pairs. The probability that the first falls outside a certain convex set given that the second is fixed is shown to decrease with the sample size at an exponential rate which depends on the Kullback-Leibler distance between two distributions in an associated exponential familiy of distributions. Examples are given which include a method of computing the Bahadur exact slope for tests of certain composite hypotheses in exponential families.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.121-126
• /
• 2007

Among many graphs, directed acyclic graph(DAG) attracts many researchers due to its nice property of existence of topological sort. In some classic graph problems, it is known that, if we use the aforementioned property, then much efficient algorithms can be generated. So, in this paper, new algorithm for the all-pairs shortest path problem in a DAG is proposed. While the algorithm performing the iteration, it identifies the set of essential arcs which requires in a shortest path. So, the proposed algorithm has a running time of $O(m^*n+m)$, where m, n and $m^*$ denote the number of arcs, number of node, and the number of essential arcs in a DAG, respectively.

• Journal of applied mathematics & informatics
• /
• v.42 no.5
• /
• pp.1121-1135
• /
• 2024

In this paper, we introduced a new distance-based index called the minimum degree Wiener index, which is the sum of distances between all unordered pairs of vertices with the minimum degree. Additionally, a matrix related to this index was introduced, and it was discovered that the sum of entries in each row was the same for some classes of graphs, contrary to many graph-related matrices. In particular, we determined the minimum degree Wiener index of the bipartite Kneser graph, bipartite Kneser type-k graphs, Johnson graph and the set inclusion graphs. The terminal Wiener index of a graph G is the sum of distances between all unordered pairs of pendant vertices of G. Also, we determined Wiener index, hyper Wiener index and corresponding polynomials of the bipartite Kneser type-k graphs for k = 2, 3.

• Biomedical Science Letters
• /
• v.24 no.4
• /
• pp.390-397
• /
• 2018

For the specific detection of human Parvovirus B19 (HuPaV-B19), we designed ten specific PCR primers from 3,800~4,500 nucleotides of HuPaV-B19 complete genome (NC_000883.2). Seventeen candidate PCR primer sets for specific detecting HuPaV-B19 were constructed. In specific reaction of HuPaV-B19, seventeen PCR primer sets showed specific band, however five PCR primer sets were selected basis of band intensity, amplicon size and location. In non-specific reaction with seven reference viruses, four PCR primer sets showed non-specific band, however one PCR primer set is not. Detection sensitivity of final selective PCR primer set was $100fg/{\mu}L$ for 112 minute, and PCR amplicon is 539 base pairs (bp). In addition, nested PCR primer set was developed, for detection HuPaV-B19 from a low concentration of contaminated samples. Selection of nested PCR primer set was basis of sensitivity and groundwater sample tests. Detection sensitivity of final selective PCR and nested PCR primer sets for the detection of HuPaV-B19 were $100fg/{\mu}L$ and $100ag/{\mu}L$ basis of HuPaV-B19 plasmid, it was able to rapid and highly sensitive detection of HuPaV-B19 than previous reports. We expect developed PCR primer set in this study will used for detection of HuPaV-B19 in various samples.

• The Plant Pathology Journal
• /
• v.32 no.1
• /
• pp.53-57
• /
• 2016

Major diseases in grafted cacti have been reported and Fusarium oxysporum, Bipolaris cactivora, Phytophthora spp. and Collectotrichum spp. are known as causal pathogens. These pathogens can lead to plant death after infection. Therefore, some European countries have quarantined imported cacti that are infected with specific fungal pathogens. Consequently, we developed PCR detection methods to identify four quarantined fungal pathogens and reduce export rejection rates of Korean grafted cacti. The pathogen specific primer sets F.oF-F.oR, B.CF-B.CR, P.nF-P.nR, and P.cF-P.CR were tested for F. oxysporum, B.cactivora, P. nicotinae, and P. cactorum, respectively. The F.oF-F.oR primer set was designed from the Fusarium ITS region; the B.CF-B.CR and P.nF-P.nR primers respectively from Bipolaris and Phytophthora ITS1; and the P.cF-P.CR primer set from the Ypt1protein gene region. The quarantine fungal pathogen primer pairs were amplified to the specific number of base pairs in each of the following fungal pathogens: 210-bp (F. oxysporum), 510-bp (B. cactivora), 313-bp (P. nicotinae), and 447-bp (P. cactorum). The detection limit for the mono- and multiplex PCR primer sets was 0.1 ng of template DNA under in vitro conditions. Therefore, each primer set successfully diagnosed contamination of quarantine pathogens in export grafted cacti. Consequently, our methodology is a viable tool to screen contamination of the fungal pathogen in exported grafted cacti.