• 제목/요약/키워드: Pair Selection

검색결과 126건 처리시간 0.033초

PBS(Pairwise Broadcast Synchronization)를 위한 노드 쌍 선택 알고리즘 (Pair-nodes Selection Algorithm for PBS (Pairwise Broadcast Synchronization))

  • 배시규
    • 한국멀티미디어학회논문지
    • /
    • 제21권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.

Model Selection for Tree-Structured Regression

  • Kim, Sung-Ho
    • Journal of the Korean Statistical Society
    • /
    • 제25권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.

  • PDF

Robust Backup Path Selection in Overlay Routing with Bloom Filters

  • Zhou, Xiaolei;Guo, Deke;Chen, Tao;Luo, Xueshan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권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.

ON NONLINEAR POLYNOMIAL SELECTION AND GEOMETRIC PROGRESSION (MOD N) FOR NUMBER FIELD SIEVE

  • Cho, Gook Hwa;Koo, Namhun;Kwon, Soonhak
    • 대한수학회보
    • /
    • 제53권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.

Optimal placement of piezoelectric actuator/senor patches pair in sandwich plate by improved genetic algorithm

  • Amini, Amir;Mohammadimehr, Mehdi;Faraji, Alireza
    • Smart Structures and Systems
    • /
    • 제26권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.

Semi-automatic Field Morphing : Polygon-based Vertex Selection and Adaptive Control Line Mapping

  • Kwak, No-Yoon
    • International Journal of Contents
    • /
    • 제3권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.

중복된 칼라 히스토그램과 공간 정보를 이용한 내용 기반 화상 검색 시스템 설계 및 구현 (LDesign and implementation of a content-based image retrieval system using the duplicated color histogram and spatial information)

  • 김철원;최기호
    • 한국통신학회논문지
    • /
    • 제22권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.

  • PDF

비천연 아미노산의 위치특이적 단백질 삽입을 위한 Amino Acyl-tRNA Synthetase 선별시스템 개발 (Establishment of a Selection System for the Site-Specific Incorporation of Unnatural Amino Acids into Protein)

  • 다우드 살림 이단;최인경;박중찬
    • 미생물학회지
    • /
    • 제50권1호
    • /
    • pp.1-7
    • /
    • 2014
  • 생명체에서 비천연 아미노산을 단백질의 특정 위치에 삽입하는 방법으로 orthogonal suppressor tRNA와 여기에 비천연 아미노산을 특이적으로 결합시킬 수 있는 유전자 변형된 aminoacyl-tRNA synthetase (ARS)가 활용되고 있다. 이 기술개발을 위해서는 돌연변이를 유발한 ARS library로부터 비천연 아미노산만을 특이적으로 결합시킬 수 있는 변형된 ARS를 탐색하기 위한 선별시스템이 필요하다. 본 논문에서는 대장균에서 작용하는 2단계로 구성된 새로운 선별시스템을 개발하였다. 먼저 양성선별 시스템은 27번 잔기를 amber 코돈으로 치환한 Chloramphenicol acetyl transferase 유전자로 구성되어 있으며, 이유전자의 amber suppression에 의해 chloramphenicol 배지에서 생존함에 따라 활성을 나타내는 ARS를 최고 $9.0{\times}10^5$배로 농축할 수 있었다. 반면 음성선별 시스템은 대장균의 Topoisomerase II의 기능을 억제하는 단백질을 암호화하는 control of cell death B (ccdB) 유전자의 N-말단 앞에 3개의 amber 코돈을 삽입하여 제작하였다. 이 음성선별 시스템을 가진 대장균에 orthogonal pair인 Saccharomyces cerevisiae tyrosyl-tRNA synthetase (Scc TyrRS)와 amber suppressor tRNA를 형질전환하면 amber suppression으로 CcdB가 발현되어 대장균의 성장이 억제되는 것을 확인하였으며, 천연 아미노산에 대한 특이성을 가진 ARS를 효과적으로 제거하는 것을 관찰하였다. 따라서, 양성선별 및 음성선별 시스템을 순차적으로 거침으로써 무작위적으로 아미노산에 대한 특이성을 변형시킨 ARS 라이브러리로부터 비천연 아미노산을 suppressor tRNA에 특이적으로 결합하는 유전자 변형 ARS를 탐색하는데 유용하게 사용될 수 있을 것이다.

고밀도 PLA 설계를 위한 겹침 알고리즘 (A folding algorithm for design of high density PLA's)

  • 선선구;김윤홍;홍인식;정준모;이재민;임인칠
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
    • /
    • 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.

  • PDF

One-Step Selection of Artificial Transcription Factors Using an In Vivo Screening System

  • Bae, Kwang-Hee;Kim, Jin-Soo
    • Molecules and Cells
    • /
    • 제21권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.