• Title/Summary/Keyword: 알파벳최적화

Search Result 6, Processing Time 0.017 seconds

Animated Quantile Plots for Evaluating Response Surface Designs (반응표면실험계획을 평가하기 위한 동적분위수그림)

  • Jang, Dae-Heung
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.2
    • /
    • pp.285-293
    • /
    • 2010
  • The traditional methods for evaluating response surface designs are alphabetic optimality criteria. These single-number criteria such as D-, A-, G- and V-optimality do not completely reflect the prediction variance characteristics of the design in question. Alternatives to single-numbers summaries include graphical displays of the prediction variance across the design regions. We can suggest the animated quantile plots as the animation of the quantile plots and use these animated quantile plots for comparing and evaluating response surface designs.

Animated Quantile Plots for Evaluating Response Surface Designs (반응표면실험계획을 평가하기 위한 동적분위수그림)

  • Jang, Dae-Heung
    • Proceedings of the Korean Society for Quality Management Conference
    • /
    • 2010.04a
    • /
    • pp.115-120
    • /
    • 2010
  • 반응표면실험계획들을 평가하기 위한 방법으로서 전형적인 방법이 알파벳최적화이다. 그러나 이러한 알파벳최적화(D-, A-, G-, V-최적화 등)는 하나의 수치이므로 그 유용성에도 불구하고 반응표면실험 계획들이 갖는 추정반응값분산의 분포에 대한 정보에 한계를 갖는다. 이를 극복하고자 하는 대안으로서 그래픽 방법들이 있는데 우리는 그 중에 분위수그림을 애니메이션화한 동적분위수그림을 제안할 수 있고 이 동적분위수그림을 이용하여 반응표면실험계획들이 갖는 추정반응값분산의 분포를 서로 비교, 평가 할 수 있다.

  • PDF

Adaptive-learning Code Allocation Technique for Improving Dimming Level and Reducing Flicker in Visible Light Communication (가시광통신에서 Dimming Level 향상 및 Flicker 감소를 위한 적응-학습 코드할당 기법)

  • Lee, Kyu-Jin;Han, Doo-Hee
    • Journal of Convergence for Information Technology
    • /
    • v.12 no.2
    • /
    • pp.30-36
    • /
    • 2022
  • In this paper, when the lighting and communication functions of the visible light communication system are used at the same time, we propose a technique to reduce the dimming level and flicker of the lighting. Visible light communication must satisfy both communication and lighting performance. However, the existing data code method results in reducing the brightness of the entire lighting. This causes deterioration of lighting performance and flicker phenomenon. To solve this problem, in this paper, we propose an adaptive learning code allocation technique that allocates binary codes to transmitted characters and optimizes and matches the binary codes allocated according to the frequency of occurrence of alphabets in character strings. Through this, we studied a technique that can faithfully play the role of lighting as well as communication function by allocating codes so that the 'OFF' pattern does not occur continuously while maintaining the maximum dimming level of each character string. As a result of the performance evaluation, the frequency of occurrence of '1' increased significantly without significantly affecting the overall communication performance, and on the contrary, the frequency of consecutive '0' decreased, indicating that the lighting performance of the system was greatly improved.

Efficient Blind Maximal Ratio Combining Methods for Digital Communication Systems (디지탈 통신 시스템을 위한 효율적인 블라인드 최대비 결합 방법)

  • Oh, Seong-Keun
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.11
    • /
    • pp.1-11
    • /
    • 1998
  • We present somple block methods for blind maximal ratio combining (MRC) based on a maximum likelihood (ML) principle and finite alphabet properties (FAP) inherent in digital communication systems. The methods can provide accurate estimates of channel parameters even with a small subset of data, thus realizing nearly perfect combining. The channel parameters of diversity branches and the data sequence are estimated simultaneously by using an alternating projection technique. Two different methods, that is, (1) Joint combining and data sequence estimation(JC-DSE) method and (2) Pre-combining and blind phase estimation (PC-BPE) method are presented. Efficient initiallization schemes that can assure the convergence to the global optimum are also presented. Simulation results demonstrate the performance of two methods on the symbol error rate (SER) and the estimated accuracy of the channel parameters.

  • PDF

Design of Electro-Thread Embroidery UHF RFID Tag Antennas with Character Shapes (글자 모양의 자수형 도전사 UHF RFID 태그 안테나 디자인)

  • Choi, Jae-Han;Chung, You-Chung
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.10
    • /
    • pp.1114-1120
    • /
    • 2009
  • The conductivity of various electro-threads is analyzed, and the washable electro-thread embroidery UHF RFID tag antennas using the character shape without T-matching structure are designed by adding a T-matching structure. The RFID tag antenna using the electro-thread is easy to be embedded on a cloth as a wearable antenna because it is flexible and different from general copper inlay shape and tape type tag. The embroidery tag antennas are designed with the English alphabet 'F' and the Korea alphabet 'ㄹ' character. Those are easy to be applied to general clothes. The parameters of antennas are optimized and fabricated. The characteristics and the reading range patterns of the tag antennas are measured. The reading ranges of wet tags(tap water, sea water and soapy water) are tested and compared.

Development of deep learning-based holographic ultrasound generation algorithm (딥러닝 기반 초음파 홀로그램 생성 알고리즘 개발)

  • Lee, Moon Hwan;Hwang, Jae Youn
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.2
    • /
    • pp.169-175
    • /
    • 2021
  • Recently, an ultrasound hologram and its applications have gained attention in the ultrasound research field. However, the determination technique of transmit signal phases, which generate a hologram, has not been significantly advanced from the previous algorithms which are time-consuming iterative methods. Thus, we applied the deep learning technique, which has been previously adopted to generate an optical hologram, to generate an ultrasound hologram. We further examined the Deep learning-based Holographic Ultrasound Generation algorithm (Deep-HUG). We implement the U-Net-based algorithm and examine its generalizability by training on a dataset, which consists of randomly distributed disks, and testing on the alphabets (A-Z). Furthermore, we compare the Deep-HUG with the previous algorithm in terms of computation time, accuracy, and uniformity. It was found that the accuracy and uniformity of the Deep-HUG are somewhat lower than those of the previous algorithm whereas the computation time is 190 times faster than that of the previous algorithm, demonstrating that Deep-HUG has potential as a useful technique to rapidly generate an ultrasound hologram for various applications.