• Parasites, Hosts and Diseases
• /
• v.49 no.3
• /
• pp.281-284
• /
• 2011

Amebiasis is a protozoan disease caused by Entamoeba histolytica and a potential health threat in areas where sanitation and hygiene are inappropriate. Highly sensitive PCR methods for detection of E. histolytica in clinical and environmental samples are extremely useful to control amebiasis and to promote public health. The present study compared several primer sets for small subunit (SSU) rDNA and histone genes of E. histolytica cysts. A 246 bp of the SSU rDNA gene of pure cysts contained in phosphate-buffered saline (PBS) and in stool samples was successfully amplified by nested PCR, using the 1,147-246 bp primer set, of the primary PCR products which were pre-amplified using the 1,147 bp primer as the template. The detection limit of the nested PCR using the 1,147-246 primer set was 10 cysts in both groups (PBS and stool samples). The PCR to detect histone gene showed negative results. We propose that the nested PCR technique to detect SSU rDNA can be used as a highly sensitive genetic method to detect E. histolytica cysts in stool samples.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.53-58
• /
• 2008

A pellet program including a nested parallelism has a result of non-deterministic because of executed concurrently without synchronization. In order to detect like this error the visualization technique which is various is used. But the intuition characteristic is decreased because of limits of space and excessive abstraction. In this paper, proposes 3-D visualization engines which provide global structure of the arranging in a parallel program with nested parallelism which is complicated to the user. The visualization engine which is proposed provides global structure to the user as program easily to understand, it provides an effective debugging environment.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1093-1105
• /
• 2007

This paper presents a multidimensional type inheritance indexing technique (MD-TIX) for XML databases. We use a multidimensional file organization as the index structure. In conventional XML database indexing techniques using one-dimensional index structures, they do not efficiently handle complex queries involving both nested elements and type inheritance hierarchies. We extend a two-dimensional type hierarchy indexing technique(2D-THI) for indexing the nested elements of XML databases. 2D-THI is an indexing scheme that deals with the problem of clustering elements in a two-dimensional domain space consisting of the key value domain and the type identifier domain for indexing a simple element in a type hierarchy. In our extended scheme, we handle the clustering of the index entries in a multidimensional domain space consisting of a key value domain and multiple type identifier domains that include one type identifier domain per type hierarchy on a path expression. This scheme efficiently supports queries that involve search conditions on the nested element represented by an extended path expression. An extended path expression is a path expression in which every type hierarchy on a path can be substituted by an individual type or a subtype hierarchy.

• The Plant Pathology Journal
• /
• v.29 no.4
• /
• pp.357-363
• /
• 2013

The fungus Venturia nashicola is the causal agent of scab on Asian pears. For the rapid and reliable identification as well as sensitive detection of V. nashicola, a PCR-based technique was developed. DNA fingerprints of three closely related species, V. nashicola, V. pirina, and V. inaequalis, were obtained by random amplified polymorphic DNA (RAPD) analysis. Two RAPD markers specific to V. nashicola were identified by PCR, after which two pairs of sequence characterized amplified region (SCAR) primers were designed from the nucleotide sequences of the markers. The SCAR primer pairs, designated as D12F/D12R and E11F/E11R, amplified 535-bp and 525-bp DNA fragments, respectively, only from genomic DNA of V. nashicola. The specificity of the primer sets was tested on strains representing three species of Venturia and 20 fungal plant pathogens. The nested PCR primer pair specific to V. nashicola was developed based on the sequence of the species-specific 525-bp DNA fragment amplified by primer set E11F/E11R. The internal primer pair Na11F/Na11R amplified a 235-bp fragment from V. nashicola, but not from any other fungal species tested. The nested PCR assay was sensitive enough to detect the specific fragment in 50 fg of V. nashicola DNA.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.518-527
• /
• 2007

It is an important issue to find out the difference between RDF documents, because RDF documents are changed frequently. When RDF documents contain blank nodes, we need a matching technique for blank nodes in the change detection. Blank nodes have a nested form and they are used in most RDF documents. A RDF document can be modeled as a graph and it will contain many subtrees. We can consider a change detection problem as a minimum cost tree matching problem. In this paper, we propose a change detection technique for RDF documents using the labeling scheme for blank nodes. We also propose a method for improving the efficiency of general triple matching, which used predicate grouping and partitioning. In experiments, we showed that our approach was more accurate and faster than the previous approaches.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.41-50
• /
• 2004

Detecting races is important for debugging shared-memory Parallel programs, because races result in unintended nondeterministic executions of the programs. Particularly, the first races to occur in an execution of a program must be detected because they can potentially affect other races that occur later. Previous on-the-fly techniques that detect such first races based on candidate events that are likely to participate in the first races monitor access events in order to collect the candidate events during a program execution, and try to report the races only from determining the concurrency relationships of the candidates. Such races reported in this way. however, are not guaranteed to be first races, because they are not determined by taking into account how they are affected with each other. This paper presents a new post-mortem technique that analyzes, on each nesting level, candidate events collected from an execution of a shared-memory program with nested parallelism in order to report only first races. This technique is efficient, because it guarantees that first races reported by analyzing a nesting level are the races that occur first at the level, and does not require more analyses to the higher nesting levels than the current level. The Proposed technique facilitates more practical and effective debugging than the previous techniques, because it guarantees to detect first races if candidate events are collected from an execution instance of the program with nested parallelism.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.75-87
• /
• 2009

We propose in this paper a novel approach to image fusion in which the fusion rule is guided by optimizing an image clarity function. A Genetic Algorithm is used to stochastically select, comparative to the clarity function, the optimum block from among the source images. A novel nested Genetic Algorithm with gifted individuals found through bombardment of genes by the mutation operator is designed and implemented. Convergence of the algorithm is analytically and empirically examined and statistically compared (MANOVA) with the canonical GA using 3 test functions commonly used in the GA literature. The resulting GA is invariant to parameters and population size, and a minimal size of 20 individuals is found to be sufficient in the tests. In the fusion application, each individual in the population is a finite sequence of discrete values that represent input blocks. Performance of the proposed technique applied to image fusion experiments, is characterized in terms of Mutual Information (MI) as the output quality measure. The method is tested with C=2 input images. The results of the proposed scheme indicate a practical and attractive alternative to current multi-focus image fusion techniques.

• Korean Journal of Plant Resources
• /
• v.16 no.1
• /
• pp.40-48
• /
• 2003

Cylindrocarpon destructans is the major pathogen inducing the root rot disease in ginseng. Up to now, there is no reliable and convenient method to analyze the spore density or population of this pathogen in ginseng-growing soil or any contaminated farmlands. Therefore, it will be very valuable to develop a new and reliable method in detecting the spore of this pathogen. In this study, a molecular biological technique using two step nested PCR method, was developed. Two universal ITS primers, ITS5F and ITS4R were used in the first round of PCR to amplify a fragment of ITS region from the genomic DNA of C. destructans. The specific prmers Nest 1 and Nest 2 were designed and used in the second round of PCR to amplify a inner fragment from the first round PCR product of C. destructans. C. destructans spore, only soil samples from the diseased ginseng farm produced the positive bands, suggesting its usefulness in detecting the C. destructans spores in soil samples. Thus it is recommended to first extract the whole genomic DNA from soil samples and use it for the PCR reaction, thereby eliminating the inhibitory activity of soil components.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.149-156
• /
• 2014

NGE(Nested Generalized Exemplar Method) can increase the performance of the noisy data at the same time, can reduce the size of the model. It is the optimal distance-based classification method using a matching rule. NGE cross or overlap hyperrectangles generated in the learning has been noted to inhibit the factors. In this paper, We propose the DHGen(Dominant Hyperrectangle Generation) algorithm which avoids the overlapping and the crossing between hyperrectangles, uses interval weights for mixed hyperrectangles to be splited based on the mutual information. The DHGen improves the classification performance and reduces the number of hyperrectangles by processing the training set in an incremental manner. The proposed DHGen has been successfully shown to exhibit comparable classification performance to k-NN and better result than EACH system which implements the NGE theory using benchmark data sets from UCI Machine Learning Repository.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.549-557
• /
• 2016

It is important for effective visualization to summarize not only a large amount of debugging information but also the mental models of abstract ideas. This paper presents an abstract visualization tool which provides effective visualization of thread structure and race information for OpenMP programs with critical sections and nested parallelism, using a partial order execution graph which captures logical concurrency among threads. This tool is supported by an on-the-fly trace-filtering technique to reduce space complexity of visualization information, and a graph abstraction technique to reduce visual complexity of nested parallelism and critical sections in the filtered trace. The graph abstraction of partial-order relation and race information is effective for understanding program execution and detecting to eliminate races, because the user can examine control flow of program and locations of races in a structural fashion.