• Title/Summary/Keyword: 계수 탐색

Search Result 371, Processing Time 0.028 seconds

Conditional Branch Optimization in the Compilers for Superscalar Processors (수퍼스칼라 프로세서를 위한 컴파일러에서 조건부 분기의 최적화)

  • Kim, Myung-Ho;Choi, Wan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.2
    • /
    • pp.264-276
    • /
    • 1995
  • In this paper, a technique for eliminating conditional branches in the compilers for superscalar processors is presented. The technique consists of three major steps. The first step transforms conditional branches into equivalent expressions using algebraic laws. The second step searches all possible instruction sequences for those expressions using GSO of Granlund/Kenner. Finally an optimal sequence that has the least dynamic count for the target superscalar processor is selected from the GSO output. Experiment result shows that for each conditional branch is the input program matched by one of the optimization patterns, the proposed technique outperforms more than 25% speedup of execution time over the original code when the GNU C compiler and the SuperSPARC processor are used.

  • PDF

Investigation of Various Reliability Indices of Pre-service Mathematics Teachers' Teaching Aptitude and Personality Test based on Setting Cut Scores (예비수학교사의 교직 적성·인성 검사에서 분할점수 변화에 따른 다양한 신뢰도 탐색)

  • Kim, Sungyeun
    • The Mathematical Education
    • /
    • v.57 no.1
    • /
    • pp.55-74
    • /
    • 2018
  • The purpose of this study is first to examine the relative influence of each error source and to investigate the optimal measurement conditions to ensure satisfactory multiple reliability coefficients based on the teaching aptitude and personality test for pre-service teachers. Participants were 33 students enrolled in mathematics education in a graduate school of education located in the Seoul metropolitan area from 2013 to 2017. The main results were as follows. First, the estimated variance due to residual was highest, followed by nesting of items within domains, graduate students, interactions of graduate students with domains, and domains. Second, total 96 items, with 12 domains containing 8 items in each domain, with cut score of 598, and original 210 items, with 14 domains containing 15 items in each domain, with cut scores of 615 or 716 were optimal measurement conditions to reach acceptable reliability levels based on the joint consideration of dependability coefficients, cut score dependability coefficients, adjusted dependability coefficients, and standard errors of measurement. Third, larger deviations between the arithmetic mean and the cut score indicated higher reliability coefficients of the test results. Finally, this study suggests ways for practitioners to consider how to apply generalizability theory for criterion-referenced tests and how to develop future research based on limitations.

A Study on the Generation of Three Dimensional Orthophoto Map from Aerial Photograph by Digital Photogrammetry (수치사진측량 기법을 이용한 항공사진의 정사투영사진 지도 생성에 관한 연구)

  • 조재호;윤종성
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.16 no.2
    • /
    • pp.203-211
    • /
    • 1998
  • A traditional method to produce three dimensional orthophoto map has been studied by digital photogrammetry which decides a height by digitally searching conjugate points on the stereo image. Many researches in digital photogrammetric field are still in progress to determine conjugate points automatically. In this study, we analyze the effect of accuracy of area-based image matching with changing eight types of target area size using four types of image pyramid. The result of image matching to each method compared with 1/5,000 digital mapping data. We decided a optimal size of target area on a percentage of image matching. Digital elevation model is generated by matching results and bundle method. As a result, three dimensional orthophoto map is made in terms of digital elevation model and orthophoto.

  • PDF

Wavelet Transform Coding for Image Conference (화상회의를 위한 웨이브렛 변환 부호화)

  • 김정일
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.73-77
    • /
    • 1999
  • In this paper. wavelet transform coding for image conference is studied. Original video frames are transformed into hierarchical pyramidal images with multiresolution using the band property of wavelet transform coefficients. Moving information between neighboring frames is obtained from the low-resolution band. Also, to control the video coding procedure. a new picture set filter is proposed. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently. video quality can be preserved and bit rate can be controlled adaptively In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. Consequently. the proposed method shows a reasonably good performance over existing ones.

A Study on Stucture of CAD / CAPP System in th e Heading Process Using Rigid-Plastic Finite Element Analysis (강소성 유한 요소법을 이용한 냉간 2단 헤딩가공에 있어서 CAD / CAPP 시스템의 구축에 대한 연구 1))

  • 신영우
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.30 no.1
    • /
    • pp.53-63
    • /
    • 1994
  • The conventional cold-heading process for the production of a bolt-shaped product is composed of some process and two or three blows heading. The strength of a bolt-shaped product produced by multi-blow heading depends on the working conditions of the heading process such as preforming die angle, corner-radius of the necked portion of product, and the reduction in height during pre-forming. Arigid-plastic finite-element program(RDHPSC) has been coded and the program testified by comparison with the results of experimentation. A method of testing the optimum die-conditions in the double-blow heading process by use of RDHPSC analysis is discussed a fundamental structures of CAD/CAPP system for two-blow heading process is discussed.

  • PDF

An Improvement Method of Engineering Education Quality using Kano's Dualistic Quality Model and Timko's Satisfaction Coefficient (Kano의 이원적 품질모형과 Timko의 만족계수를 활용한 공학교육의 질 향상 방안 탐색)

  • Hur, Young-Ju;Ye, Cheol-Hae
    • Journal of Engineering Education Research
    • /
    • v.21 no.3
    • /
    • pp.31-37
    • /
    • 2018
  • The purpose of this study is to develop a method to improve the quality of engineering education by using Kano's dualistic quality model and Timko's customer satisfaction coefficient. The results of the study are as follows. Firstly, the top priority for major education is improve 'smooth support of class medium' as an attractive and one-dimensional quality element, and 'use of various examples' and 'specialty improvement of major curriculum' as an one-dimensional quality element. Secondly, the top priority for general education is improve 'liberal education curriculum' as an attractive quality element 'use of various examples' as an one-dimensional quality element. Thirdly, the top priority for extra-curriculum is develop and provide 'study support program of student' and 'voluntary service'. Fourthly, the top priority for administrative service and facilities is improve 'increase of scholarship' and expand 'service of welfare facilities as dormitory and refectory' as an one-dimensional quality element.

The Exploratory Study on the Effect of Service Recovery Attributes on Perceived Justice and Satisfaction (서비스 회복속성이 고객의 공정성인식과 만족에 미치는 영향에 관한 탐색적 연구 (인터넷 서비스 업체를 중심으로))

  • 김성호;백승익;유재원
    • Asia Marketing Journal
    • /
    • v.3 no.2
    • /
    • pp.69-91
    • /
    • 2001
  • 고객이 서비스상의 실패에 대해 때로는 강한 부정적 반응을 보이기에 서비스를 제공하는 조직의 서비스회복능력은 고객만족을 달성하기 위해 강력하고 효율적으로 운영되어야 한다. 따라서 본 연구는 온라인상의 서비스인 ISP업체(10개의 회사)를 대상으로 온라인 서비스 상에서 고객이 서비스상의 불만을 경험할 때 기업이 고객의 불만을 회복시켜 만족으로 전환시키려는 회복속성들이 실제로 고객이 가지는 분배상의 공정성, 절차상의 공정성 및 상호작용 공정성에 어떤 영향을 미치는가를 실증적으로 검증하기 위한 것이다. 이를 위해 10개의 ISP업체를 선정하고 해당 업체에 대해 불만을 가진 고객들이 기업의 불만제거 노력에 대해 평가하도록 하였다. 가설 검증을 위해 LISREL을 이용하여 서비스의 회복속성인 보상, 신속한 반응, 무반응, 사과, 사전보상제공 등이 분배상공정성, 절차상 공정성, 상호작용 공정성에 직접적으로 미치는 효과를 파악하고 이 공정성의 요인들이 만족에 미치는 영향도 실증적으로 검증하였다. 온라인 상이라는 새로운 환경을 고려하여 기존의 모델에서 간과된 부분을 확인하기 위해 확장 모델을 제시하여 새로운 의미를 가진 경로가 존재하는지 확인하고 이 부분에서 유의적인지 않은 경로를 배제한 수정모델을 제시하였다. 기존의 연구를 바탕으로 제시된 가설은 연구모델에서 경로 계수를 추정하고 이에 대한 t값을 통해 검증하였다. 본 연구에서 제시하는 시사점으로는 고객의 서비스 실패 및 회복상황에 대한 평가의 이론적 원칙을 설명하고 관리자에게 각각의 서비스 실패와 일치하는 서비스 회복전략을 제시하여 운영상의 가이드 라인을 제시한다고 할 수 있다

  • PDF

Color-Texture Image Watermarking Algorithm Based on Texture Analysis (텍스처 분석 기반 칼라 텍스처 이미지 워터마킹 알고리즘)

  • Kang, Myeongsu;Nguyen, Truc Kim Thi;Nguyen, Dinh Van;Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.4
    • /
    • pp.35-43
    • /
    • 2013
  • As texture images have become prevalent throughout a variety of industrial applications, copyright protection of these images has become important issues. For this reason, this paper proposes a color-texture image watermarking algorithm utilizing texture properties inherent in the image. The proposed algorithm selects suitable blocks to embed a watermark using the energy and homogeneity properties of the grey level co-occurrence matrices as inputs for the fuzzy c-means clustering algorithm. To embed the watermark, we first perform a discrete wavelet transform (DWT) on the selected blocks and choose one of DWT subbands. Then, we embed the watermark into discrete cosine transformed blocks with a gain factor. In this study, we also explore the effects of the DWT subbands and gain factors with respect to the imperceptibility and robustness against various watermarking attacks. Experimental results show that the proposed algorithm achieves higher peak signal-to-noise ratio values (47.66 dB to 48.04 dB) and lower M-SVD values (8.84 to 15.6) when we embedded a watermark into the HH band with a gain factor of 42, which means the proposed algorithm is good enough in terms of imperceptibility. In addition, the proposed algorithm guarantees robustness against various image processing attacks, such as noise addition, filtering, cropping, and JPEG compression yielding higher normalized correlation values (0.7193 to 1).

Optimal Design of Water Distribution System considering the Uncertainties on the Demands and Roughness Coefficients (수요와 조도계수의 불확실성을 고려한 상수도관망의 최적설계)

  • Jung, Dong-Hwi;Chung, Gun-Hui;Kim, Joong-Hoon
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.10 no.1
    • /
    • pp.73-80
    • /
    • 2010
  • The optimal design of water distribution system have started with the least cost design of single objective function using fixed hydraulic variables, eg. fixed water demand and pipe roughness. However, more adequate design is accomplished with considering uncertainties laid on water distribution system such as uncertain future water demands, resulting in successful estimation of real network's behaviors. So, many researchers have suggested a variety of approaches to consider uncertainties in water distribution system using uncertainties quantification methods and the optimal design of multi-objective function is also studied. This paper suggests the new approach of a multi-objective optimization seeking the minimum cost and maximum robustness of the network based on two uncertain variables, nodal demands and pipe roughness uncertainties. Total design procedure consists of two folds: least cost design and final optimal design under uncertainties. The uncertainties of demands and roughness are considered with Latin Hypercube sampling technique with beta probability density functions and multi-objective genetic algorithms (MOGA) is used for the optimization process. The suggested approach is tested in a case study of real network named the New York Tunnels and the applicability of new approach is checked. As the computation time passes, we can check that initial populations, one solution of solutions of multi-objective genetic algorithm, spread to lower right section on the solution space and yield Pareto Optimum solutions building Pareto Front.

Reversible DNA Information Hiding based on Circular Histogram Shifting (순환형 히스토그램 쉬프팅 기반 가역성 DNA 정보은닉 기법)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.12
    • /
    • pp.67-75
    • /
    • 2016
  • DNA computing technology makes the interests on DNA storage and DNA watermarking / steganography that use the DNA information as a newly medium. DNA watermarking that embeds the external watermark into DNA information without the biological mutation needs the reversibility for the perfect recovery of host DNA, the continuous embedding and detecting processing, and the mutation analysis by the watermark. In this paper, we propose a reversible DNA watermarking based on circular histogram shifting of DNA code values with the prevention of false start codon, the preservation of DNA sequence length, and the high watermark capacity, and the blind detection. Our method has the following features. The first is to encode nucleotide bases of 4-character variable to integer code values by code order. It makes the signal processing of DNA sequence easy. The second is to embed the multiple bits of watermark into -order coded value by using circular histogram shifting. The third is to check the possibility of false start codon in the inter or intra code values. Experimental results verified the our method has higher watermark capacity 0.11~0.50 bpn than conventional methods and also the false start codon has not happened in our method.