• 제목/요약/키워드: randomized method

Search Result 897, Processing Time 0.025 seconds

Nonparametric procedures using placement in randomized block design with replications (반복이 있는 랜덤화 블록 계획법의 위치를 이용한 비모수 검정법)

  • Lee, Sang-Yi;Kim, Dong-Jae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.6
    • /
    • pp.1105-1112
    • /
    • 2011
  • Mack (1981), Skilling and Wolfe (1977, 1978) proposed typical nonparametric method in randomized block design with replications. In this paper, we proposed the procedures based on placement as extension of the two sample placement tests described in Orban and Wolfe (1982) and treatment versus control tests described in Kim (1999). Also Monte Carlo simulation study is adapted to compare power of the proposed procedure with those of previous procedures.

A Method to Detect Multiple Plane Areas by using the Iterative Randomized Hough Transform(IRHT) and the Plane Detection (평면 추출셀과 반복적 랜덤하프변환을 이용한 다중 평면영역 분할 방법)

  • Lim, Sung-Jo;Kim, Dae-Gwang;Kang, Dong-Joong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.11
    • /
    • pp.2086-2094
    • /
    • 2008
  • Finding a planar surface on 3D space is very important for efficient and safe operation of a mobile robot. In this paper, we propose a method using a plane detection cell (PDC) and iterative randomized Hough transform (IRHT) for finding the planar region from a 3D range image. First, the local planar region is detected by a PDC from the target area of the range image. Each plane is then segmented by analyzing the accumulated peaks from voting the local direction and position information of the local PDC in Hough space to reduce effect of noises and outliers and improve the efficiency of the HT. When segmenting each plane region, the IRHT repeatedly decreases the size of the planar region used for voting in the Hough parameter space in order to reduce the effect of noise and solve the local maxima problem in the parameter space. In general, range images have many planes of different normal directions. Hence, we first detected the largest plane region and then the remained region is again processed. Through this procedure, we can segment all planar regions of interest in the range image.

An Ensemble Cascading Extremely Randomized Trees Framework for Short-Term Traffic Flow Prediction

  • Zhang, Fan;Bai, Jing;Li, Xiaoyu;Pei, Changxing;Havyarimana, Vincent
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1975-1988
    • /
    • 2019
  • Short-term traffic flow prediction plays an important role in intelligent transportation systems (ITS) in areas such as transportation management, traffic control and guidance. For short-term traffic flow regression predictions, the main challenge stems from the non-stationary property of traffic flow data. In this paper, we design an ensemble cascading prediction framework based on extremely randomized trees (extra-trees) using a boosting technique called EET to predict the short-term traffic flow under non-stationary environments. Extra-trees is a tree-based ensemble method. It essentially consists of strongly randomizing both the attribute and cut-point choices while splitting a tree node. This mechanism reduces the variance of the model and is, therefore, more suitable for traffic flow regression prediction in non-stationary environments. Moreover, the extra-trees algorithm uses boosting ensemble technique averaging to improve the predictive accuracy and control overfitting. To the best of our knowledge, this is the first time that extra-trees have been used as fundamental building blocks in boosting committee machines. The proposed approach involves predicting 5 min in advance using real-time traffic flow data in the context of inherently considering temporal and spatial correlations. Experiments demonstrate that the proposed method achieves higher accuracy and lower variance and computational complexity when compared to the existing methods.

Ramdomg Hash for Integrity Verification Method of Multimedia Data in Surveillance System (비디오 감시 장치 무결성 검증을 위한 랜덤 해시 방법)

  • Ghimire, Sarala;Lee, Bumshik
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2019.11a
    • /
    • pp.165-168
    • /
    • 2019
  • The advancement in technology has led to the enormous use of multimedia applications. The video/image recorded by such applications provides critical information that can be used as a visual evidence. However, owing to the adequacy in using different editing tools, it is susceptible to malicious alterations. Thus, the reliability or the integrity of the visual information should be verified before using it as an evidence. In this paper, we propose an integrity verification method for the surveillance system using randomized hashing. The integrity value of the surveillance data is generated using the randomized hashing and elliptic curve cryptography (ECC), which is used later for the validation. The experimental results obtained from the embedded accident data recorder (ADR) system shows that the proposed method is very efficient and provides a high level of security.

  • PDF

A Combined Randomized Response Technique Using Stratified Two-Phase Sampling (층화이중추출을 이용한 결합 확률화응답기법)

  • 홍기학
    • The Korean Journal of Applied Statistics
    • /
    • v.17 no.2
    • /
    • pp.303-310
    • /
    • 2004
  • We suggest a method to procure information from the sensitive population which combine a direct survey method, BB and an indirect survey one, RRT, and a combined estimator that uses the stratified double sampling to estimate the sensitive parameter. We compare the efficiency of our estimator with that of Mangat and Singh model.

Randomization of Elliptic Curve Secret Key to Efficiently Resist Power Analysis (전력분석공격을 효율적으로 방어하는 타원곡선 비밀키의 랜덤화)

  • 장상운;정석원;박영호
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.5
    • /
    • pp.169-177
    • /
    • 2003
  • We establish the security requirements and derive a generic condition of elliptic curve scalar multiplication to resist against DPA and Goubin’s attack. Also we show that if a scalar multiplication algorithm satisfies our generic condition, then both attacks are infeasible. Showing that the randomized signed scalar multiplication using Ha-Moon's receding algorithm satisfies the generic condition, we recommend the randomized signed scalar multiplication using Ha-Moon's receding algorithm to be protective against both attacks. Also we newly design a random recoding method to Prevent two attacks. Finally, in efficiency comparison, it is shown that the recommended method is a bit faster than Izu-Takagi’s method which uses Montgomery-ladder without computing y-coordinate combined with randomized projective coordinates and base point blinding or isogeny method. Moreover. Izu-Takagi’s method uses additional storage, but it is not the case of ours.

Review of Intention-to-Treat Analysis in Randomized Controlled Trials (무작위 대조군 실험 연구에서 치료의향분석 (Intention-to-treat analysis)에 대한 고찰)

  • Kim, Junghun Aj
    • Therapeutic Science for Rehabilitation
    • /
    • v.9 no.2
    • /
    • pp.27-38
    • /
    • 2020
  • Introduction : This review aims to introduce an intention-to-treat analysis(ITT) method and demonstrate the importance of rigorous utilization of this method to researchers in Korea. Discussion : ITT analysis includes all data as results in randomized control trials (RCT). Thereby the result of RCT is high validated to adapt in the real-world so that the result should be expected at clinical practice. Therefore, many RCT quality assessment tools include the question of the utilization of ITT analysis in individual trials. However, many researchers omit to report ITT, not utilize ITT or use ITT incorrectly. Conclusion : Through this review, more Korean researchers may understand and utilize ITT which is expected to enhance the quality of RCT papers.

A Novel Redundant Data Storage Algorithm Based on Minimum Spanning Tree and Quasi-randomized Matrix

  • Wang, Jun;Yi, Qiong;Chen, Yunfei;Wang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.227-247
    • /
    • 2018
  • For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

Acupuncture Treatment for Rotator Cuff Disorder: A Systematic Review (회전근개 질환에 대한 침술 치료의 효과: 체계적 문헌 고찰)

  • Choi, Hyun-Min;Han, Soo-Yeon;Hwang, Doo-Ree;Kang, Jun-Hyuk
    • Journal of Korean Medicine Rehabilitation
    • /
    • v.28 no.4
    • /
    • pp.11-20
    • /
    • 2018
  • Objectives To systematically explore the effects of acupuncture treatment for rotator cuff disorders and review the clinical trials. Methods We searched 9 electronic databases (PubMed, Cochrane central, Embase, China National Knowledge Infrastructure [CNKI], Korea Institute of Science and Technology Information [KISTI], National Digital Science Library [NDSL], Korean studies Information Service System [KISS], Research Information Sharing Service [RISS], Oriental Medicine Advanced Searching Integrated System [OASIS]) to find randomized controlled trials that used acupunture treatment for rotator cuff disorders. We assessed the designs of the randomized controlled trials and the method of acupuncture treatment according to the Standards for Reporting Interventions in Clinical Trials of Acupuncture (STRICTA). The methodological quality of randomized controlled trials were assessed using the Cochrane Risk of Bias (RoB) tool. Results Total 5 trials were reviewed. 4 out of 5 randomized clinical trials reported meaningful effects of acupuncture treatments compared to control group. However risk of bias seemed high. Conclusions Although the results suggest that acupuncture treatment has favorable effects for rotator cuff disorders, most of the studies included methodologically high risk of bias. Thus, well designed randomized clinical trials which evaluate the effects of acupuncture treatment for rotator cuff disorders should be encouraged.

A study of the efficiency comparison of the Black-Box method with the randomized response technique (Black-Box 방법과 RR 기법의 효율성 비교 연구)

  • 이화영;홍기학
    • The Korean Journal of Applied Statistics
    • /
    • v.8 no.2
    • /
    • pp.27-41
    • /
    • 1995
  • In this paper, the proportion of durg-abuse and gas/bond-inhalation among the high school students in Kwangju and Chonnam has been estimated using the survey of the Black-Box method and randomized response technique. We have analyzed empirically the effects of both methods for the surveys of sensitive characters.

  • PDF