• Title/Summary/Keyword: partitioning order

Search Result 214, Processing Time 0.025 seconds

Fault Localization Method by Utilizing Memory Update Information and Memory Partitioning based on Memory Map (메모리 맵 기반 메모리 영역 분할과 메모리 갱신 정보를 활용한 결함 후보 축소 기법)

  • Kim, Kwanhyo;Choi, Ki-Yong;Lee, Jung-Won
    • Journal of KIISE
    • /
    • v.43 no.9
    • /
    • pp.998-1007
    • /
    • 2016
  • In recent years, the cost of automotive ECU (Electronic Control Unit) has accounted for more than 30% of total car production cost. However, the complexity of testing and debugging an automotive ECU is increasing because automobile manufacturers outsource automotive ECU production. Therefore, a large amount of cost and time are spent to localize faults during testing an automotive ECU. In order to solve these problems, we propose a fault localization method in memory for developers who run the integration testing of automotive ECU. In this method, memory is partitioned by utilizing memory map, and fault-suspiciousness for each partition is calculated by utilizing memory update information. Then, the fault-suspicious region for partitions is decided based on calculated fault-suspiciousness. The preliminary result indicated that the proposed method reduced the fault-suspicious region to 15.01(%) of memory size.

The Development of the Components of the Length Measurement Concept in the Procedure of Measurement Using a Ruler

  • Antic, Milica D.;Dokic, Olivera J.
    • Research in Mathematical Education
    • /
    • v.22 no.4
    • /
    • pp.261-282
    • /
    • 2019
  • The research related to testing pupils' achievement in the field of Measurement and Measure in initial teaching of geometry points to an insufficient adoption of the basic components of the length measurement concept among pupils. In order to discover the cause, we looked at the basic components on which the procedure of measuring length using a ruler is based, highlighted the possibilities of introducing the procedure in measuring length, and determined pupils' achievement during the procedure of measuring length using a ruler. The research sample consisted of 145 pupils, out of which 72 were the 2nd grade pupils and 73 were the 4th grade pupils. A descriptive method was applied in the research. The technique we used was testing, and for the statistical data processing we used a χ2 test. The results of the research show that, when drawing a straight line of a given length using a ruler, there is no statistical difference in achievement between the 2nd and 4th grade pupils, nor in the pupils' knowledge regarding drawing a ruler independently, while drawing a straight line of a given length using a "broken" ruler 4th grade pupils are statistically better. The results of the research indicate that pupils' achievement is better in doing standard tasks than in non-standard ones, given that the latter require conceptual knowledge. The components of the concept of length measurement using ruler have not been sufficiently developed yet, and these include: zero-point, partitioning a measured object in a series of consecutive measurement units and their iteration. We shed more light on the critical stage in the procedure of length measurement - the transition from non-standard to standard units and the formation of the length measurement scale. For further research, we propose to look at the formation of the concept of length measurement using the ruler through all its components and their inclusion in the mathematics curriculum, as well as examining the correlation of pupils' achievement in the procedure of measuring length with their achievement in measuring area (and volume).

Fractal Image Coding Based On Variable Block (가변 블록 기반 프랙탈 영상 부호화)

  • 노근수;조성환
    • Journal of the Korean Institute of Telematics and Electronics T
    • /
    • v.35T no.3
    • /
    • pp.15-24
    • /
    • 1998
  • In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.

  • PDF

Robust 3D Facial Landmark Detection Using Angular Partitioned Spin Images (각 분할 스핀 영상을 사용한 3차원 얼굴 특징점 검출 방법)

  • Kim, Dong-Hyun;Choi, Kang-Sun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.199-207
    • /
    • 2013
  • Spin images representing efficiently surface features of 3D mesh models have been used to detect facial landmark points. However, at a certain point, different normal direction can lead to quite different spin images. Moreover, since 3D points are projected to the 2D (${\alpha}-{\beta}$) space during spin image generation, surface features cannot be described clearly. In this paper, we present a method to detect 3D facial landmark using improved spin images by partitioning the search area with respect to angle. By generating sub-spin images for angular partitioned 3D spaces, more unique features describing corresponding surfaces can be obtained, and improve the performance of landmark detection. In order to generate spin images robust to inaccurate surface normal direction, we utilize on averaging surface normal with its neighboring normal vectors. The experimental results show that the proposed method increases the accuracy in landmark detection by about 34% over a conventional method.

Efficient Quantizer Design Algorithm for Sequence-Based Localization (SBL) Systems (시퀀스 기반 위치추정 시스템을 위한 효율적인 양자기 설계 알고리즘)

  • Park, Hyun Hong;Kim, Yoon Hak
    • Journal of IKEEE
    • /
    • v.24 no.1
    • /
    • pp.40-45
    • /
    • 2020
  • In this paper, we consider an efficient design of quantizers at sensor nodes for sequence-based localization (SBL) systems which recently show a competitive performance for in-door positioning, Since SBL systems locate targets by partitioning the sensor field into subregions, each with an unique sequence number, we use the distance samples between sensors and the sequences for quantizer design in order to propose a low weight design process. Furthermore, we present a new cost function devised to assign the number of samples and the number of unique sequences uniformly into each of quantization partitions and design quantizers by searching the quantization partitions and codewords that minimize the cost function. We finally conduct experiments to demonstrate that the proposed algorithm offers an outstanding localization performance over typical designs while maintaining a substantial reduction of design complexity.

TPKDB-tree : An Index Structure for Efficient Retrieval of Future Positions of Moving Objects (TPKDB 트리 : 이동 객체의 효과적인 미래 위치 검색을 위한 색인구조)

  • Seo Dong Min;Bok Kyoung Soo;Yoo Jae Soo;Lee Byoung Yup
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.624-640
    • /
    • 2004
  • Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

The Efficient Cut Detection Algorithm Using the Weight in News Video Data (뉴스 비디오 데이터에서의 가중치를 이용한 효율적 장면변환 검출 알고리즘)

  • Jeong, Yeong-Eun;Lee, Dong-Seop;Sin, Seong-Yun;Jeon, Geun-Hwan;Bae, Seok-Chan;Lee, Yang-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.282-291
    • /
    • 1999
  • In order to construct the News Video Database System, cut detection technique is very important. In general, the color histogram, $\chi$2 histogram or Bin-to-Bin difference(B2B) techniques are mainly using for the scene partitioning. In this paper, we propose the efficient algorithm that is applied the weight in terms of NTSC standard to cut detection. This algorithm is able to reduce the time of acquiring and comparing histogram using by separate calculation of R, G, and B for the color histogram technique. And it also provide the efficient selection method fo threshold value by and use the news videos of KBS, MBC, SBS, CNN and NHK as experimental domains. By the result of experiment, we present the proposed algorithm is more efficient for cut detection than the previous methods, and that the basis for the automatic selection of threshold values.

  • PDF

Transformation of Rice (Oryza sativa L.) with Sucrose Transporter cDNA from Potato (Solanum tuberosum L.) (감자 Sucrose Transporter 유전자의 벼 Genome 내로의 도입)

  • 백소현;유남희;윤성중
    • Korean Journal of Plant Tissue Culture
    • /
    • v.28 no.2
    • /
    • pp.97-101
    • /
    • 2001
  • The transport and allocation of photosynthetic assimilate is an important regulatory factor in plant productivity, In order to modify assimilate partitioning in rice, transgenic plants containing a potato sucrose transporter (SuT) gene were developed. Calli derived from rice seeds (Oryza sativa L. cv Dongjin) were cocultured with A. tumefaciens LBA 4404 harboring the SuT gene. Calli were transferred to MS medium supplemented with 50 mg/L hygromycin, 500 mg/L carbenicillin, 2 mg/L kinetin, 0.1 mg/L NAA. After 2 weeks, hygromycin resistant shoots were obtained from the calli on the selection medium. Roots were induced from the putative transgenic shoots on rooting MS medium supplemented with 250 mg/L cabenicillin. Plant regeneration rate from the calli was about 150%. Stable incorporation of the potato SuT gene into rice genomic DNA was confirmed by PCR and Southern blot analysis.

  • PDF

An Adaptive Dynamic Range Linear Stretching Method for Contrast Enhancement (영상 강조를 위한 Adaptive Dynamic Range Linear Stretching 기법)

  • Kim, Yong-Min;Choi, Jae-Wan;Kim, Yong-Il
    • Korean Journal of Remote Sensing
    • /
    • v.26 no.4
    • /
    • pp.395-401
    • /
    • 2010
  • Image enhancement algorithm aims to improve the visual quality of low contrast image through eliminating the noise and blurring, increasing contrast, and raising detail. This paper proposes adaptive dynamic range linear stretching(ADRLS) algorithm based on advantages of existing methods. ADRLS method is focused on generating sub-histograms of the majority through partitioning the histogram of input image and applying adaptive scale factor. Generated sub-histograms are finally applied by linear stretching(LS) algorithm. In order to validate proposed method, it is compared with LS and histogram equalization(HE) algorithm generally used. As the result, the proposed method show to improve contrast of input image and to preserve distinct characteristics of histogram by controlling excessive change of brightness.

DEVELOPMENT OF A WALL-TO-FLUID HEAT TRANSFER PACKAGE FOR THE SPACE CODE

  • Choi, Ki-Yong;Yun, Byong-Jo;Park, Hyun-Sik;Kim, Hee-Dong;Kim, Yeon-Sik;Lee, Kwon-Yeong;Kim, Kyung-Doo
    • Nuclear Engineering and Technology
    • /
    • v.41 no.9
    • /
    • pp.1143-1156
    • /
    • 2009
  • The SPACE code that is based on a multi-dimensional two-fluid, three-field model is under development for licensing purposes of pressurized water reactors in Korea. Among the participating research and industrial organizations, KAERI is in charge of developing the physical models and correlation packages for the constitutive equations. This paper introduces a developed wall-to-fluid heat transfer package for the SPACE code. The wall-to-fluid heat transfer package consists of twelve heat transfer subregions. For each sub-region, the models in the existing safety analysis codes and the leading models in literature have been peer reviewed in order to determine the best models which can easily be applicable to the SPACE code. Hence a wall-to-fluid heat transfer region selection map has been developed according to the non-condensable gas quality, void fraction, degree of subcooling, and wall temperature. Furthermore, a partitioning methodology which can take into account the split heat flux to the continuous liquid, entrained droplet, and vapor fields is proposed to comply fully with the three-field formulation of the SPACE code. The developed wall-to-fluid heat transfer package has been pre-tested by varying the independent parameters within the application range of the selected correlations. The smoothness between two adjacent heat transfer regimes has also been investigated. More detailed verification work on the developed wall-to-fluid heat transfer package will be carried out when the coupling of a hydraulic solver with the constitutive equations is brought to completion.