• Journal of Korea Multimedia Society
• /
• v.21 no.11
• /
• pp.1288-1296
• /
• 2018

PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.1-24
• /
• 1996

In selecting a final tree, Breiman, Friedman, Olshen, and Stone(1984) compare the prediction risks of a pair of tree, where one contains the other, using the standard error of the prediction risk of the larger one. This paper proposes an approach to selection of a final tree by using the standard error of the difference of the prediction risks between a pair of trees rather than the standard error of the larger one. This approach is compared with CART's for simulated data from a simple regression model. Asymptotic results of the approaches are also derived and compared to each other. Both the asymptotic and the simulation results indicate that final trees by CART tend to be smaller than desired.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1890-1910
• /
• 2013

Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.1-20
• /
• 2016

The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial selection (being used in factoring RSA challenge numbers) is to select a nonlinear polynomial for algebraic sieving and a linear polynomial for rational sieving. There is another method called a nonlinear method which selects two polynomials of the same degree greater than one. In this paper, we generalize Montgomery's method [12] using geometric progression (GP) (mod N) to construct a pair of nonlinear polynomials. We also introduce GP of length d + k with $1{\leq}k{\leq}d-1$ and show that we can construct polynomials of degree d having common root (mod N), where the number of such polynomials and the size of the coefficients can be precisely determined.

• Smart Structures and Systems
• /
• v.26 no.6
• /
• pp.721-733
• /
• 2020

The present study investigates the employing of piezoelectric patches in active control of a sandwich plate. Indeed, the active control and optimal patch distribution on this structure are presented together. A sandwich plate with honeycomb core and composite reinforced by carbon nanotubes in facesheet layers is considered so that the optimum position of actuator/sensor patches pair is guaranteed to suppress the vibration of sandwich structures. The sandwich panel consists of a search space which is a square of 200 × 200 mm with a numerous number of candidates for the optimum position. Also, different dimension of square and rectangular plates to obtain the optimal placement of piezoelectric actuator/senor patches pair is considered. Based on genetic algorithm and LQR, the optimum position of patches and fitness function is determined, respectively. The present study reveals that the efficiency and performance of LQR control is affected by the optimal placement of the actuator/sensor patches pair to a large extent. It is also shown that an intelligent selection of the parent, repeated genes filtering, and 80% crossover and 20% mutation would increase the convergence of the algorithm. It is noted that a fitness function is achieved by collection actuator/sensor patches pair cost functions in the same position (controllability). It is worth mentioning that the study of the optimal location of actuator/sensor patches pair is carried out for different boundary conditions of a sandwich plate such as simply supported and clamped boundary conditions.

• International Journal of Contents
• /
• v.3 no.4
• /
• pp.15-21
• /
• 2007

Image morphing deals with the metamorphosis of one image into another. The field morphing depends on the manual work for most of the process, where a user has to designate the control lines. It takes time and requires skills to have fine quality results. It is an object of this paper to propose a method capable of realizing the semi-automation of field morphing using adaptive vertex correspondence based on image segmentation. The adaptive vertex correspondence process efficiently generates a pair of control lines by adaptively selecting reference partial contours based on the number of vertices that are included in the partial contour of the source morphing object and in the partial contour of the destination morphing object, in the pair of the partial contour designated by external control points through user input. The proposed method generates visually fluid morphs and warps with an easy-to-use interface. According to the proposed method, a user can shorten the time to set control lines and even an unskilled user can obtain natural morphing results as he or she designates a small number of external control points.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.889-898
• /
• 1997

Most general content-based image retrieval techniques use color and texture as retrieval indices. Spatial information is not used to color histogram and color pair based on color retrieval techniques. This paper proposes the selection of a set of representative in the duplicated color histogram, the analysis of spatial information of the selected colors and the image retrieval process based on the duplicated color histogram and spatial information. Two color historgrams for background and object are used in order to decide on color selection in the duplicated color histogram. Spatial information is obtained using a maximum entropy discretization. A retrieval process applies to duplicated color histogram and spatial to retrieve input images and relevant images. As the result of experiment of the image retrieval, improved color his togram and spatial information method hs increased the retrieval effectiveness more the color histogram method and color pair method.

• Korean Journal of Microbiology
• /
• v.50 no.1
• /
• pp.1-7
• /
• 2014

Site-specific incorporation of unnatural amino acids (SSIUA) into protein can be achieved in vivo by coexpression of an orthogonal pair of suppressor tRNA and engineered aminoacyl-tRNA synthetase (ARS) that specifically ligates an unnatural amino acid to the suppressor tRNA. As a step to develop the SSIUA technique in Escherichia coli, here we established a new 2-step screening system that can be used for selecting an ARS variant(s) that ligates an unnatural amino acid to a suppressor tRNA. A positive selection system consists of chloramphenicol acetyl transferase gene containing an amber mutation at the $27^{th}$ residue, and efficiently concentrated amber suppressible ARS with a maximum enrichment factor of $9.0{\times}10^5$. On the other hand, a negative selection system was constructed by adding multiple amber codons in front of a lethal gene encoding the control of cell death B toxin (ccdB) which acts as an inhibitory protein of bacterial topoisomerase II. Amber suppression of ccdB by an orthogonal pair of Saccharomyces cerevisiae tyrosyl-tRNA synthetase (TyrRS) and an amber suppressor tRNA significantly inhibits bacterial growth. This selection system was also able to efficiently remove amber suppressible ARS which could ligate natural amino acids to the suppressor tRNA. Thus, sequential combination of these two selection systems might be able to function as a powerful tool for selecting an ARS variant that specifically ligates an unnatural amino acid to the suppressor tRNA from an ARS mutant pool.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.595-598
• /
• 1988

In this paper, a new folding algorithm for design of high density PLA's is proposed. This algorithm generates transform matrix so that programmed region of each row becomes narrow. Based on transform matrix, folding pair is selected. In the process of generating transform matrix, interval degree and dense degree are used to improve folding ratio. This paper also proposes an efficient folding pair graph which has short time of selection folding pair. This proposed algorithm is named PLAFOLII and implemented in C language on VAX-11/750 (UNIX) computer. Through various example, efficiency of this algorithm is verified.

• Molecules and Cells
• /
• v.21 no.3
• /
• pp.376-380
• /
• 2006

Gene expression is regulated in large part at the level of transcription under the control of sequence-specific transcriptional regulatory proteins. Therefore, the ability to affect gene expression at will using sequencespecific artificial transcription factors would provide researchers with a powerful tool for biotechnology research and drug discovery. Previously, we isolated 56 novel sequence-specific DNA-binding domains from the human genome by in vivo selection. We hypothesized that these domains might be more useful for regulating gene expression in higher eukaryotic cells than those selected in vitro using phage display. However, an unpredictable factor, termed the "context effect", is associated with the construction of novel zinc finger transcription factors--- DNA-binding proteins that bind specifically to 9-base pair target sequences. In this study, we directly selected active artificial zinc finger proteins from a zinc finger protein library. Direct in vivo selection of constituents of a zinc finger protein library may be an efficient method for isolating multi-finger DNA binding proteins while avoiding the context effect.