• Title/Summary/Keyword: table size

Search Result 633, Processing Time 0.028 seconds

Non-Contact Level on Air Levitation Table with Porous Chamber Array (다공성 패드를 갖는 챔버의 배열에 따른 공기 부상 테이블의 비접촉 부상 수준에 대한 연구)

  • Kim, Joon Hyun;Jeong, Young Suk;Lee, Tae Geol;Kim, Tae Hoon;Jung, Hyo Jae
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.22 no.6
    • /
    • pp.913-920
    • /
    • 2013
  • This paper presents an applicable basic design that can configure non-contact levitation table for conveying a large sheet of glass. The suggested air levitation table consists of a series of air chambers with porous pads and fans as the conveyor system. The air supply chambers are arrayed to supply an adequately strong upward airflow for supporting the glass. Levitation is controlled by the size and discharge velocity, of the chamber arrays, as well as the glass supporting height. After pre-evaluation of the glass rigidity and the filer functional performance, a one-way fluid structure interface (FSI) analysis is performed for predicting pressure and deflection working of the 8G glass in the transverse and longitudinal directions, respectively. After comparing calculated levels of flatness of the glass, it determines the chamber array for the linear non-contact conveying motion.

Local Similarity based Document Layout Analysis using Improved ARLSA

  • Kim, Gwangbok;Kim, SooHyung;Na, InSeop
    • International Journal of Contents
    • /
    • v.11 no.2
    • /
    • pp.15-19
    • /
    • 2015
  • In this paper, we propose an efficient document layout analysis algorithm that includes table detection. Typical methods of document layout analysis use the height and gap between words or columns. To correspond to the various styles and sizes of documents, we propose an algorithm that uses the mean value of the distance transform representing thickness and compare with components in the local area. With this algorithm, we combine a table detection algorithm using the same feature as that of the text classifier. Table candidates, separators, and big components are isolated from the image using Connected Component Analysis (CCA) and distance transform. The key idea of text classification is that the characteristics of the text parallel components that have a similar thickness and height. In order to estimate local similarity, we detect a text region using an adaptive searching window size. An improved adaptive run-length smoothing algorithm (ARLSA) was proposed to create the proper boundary of a text zone and non-text zone. Results from experiments on the ICDAR2009 page segmentation competition test set and our dataset demonstrate the superiority of our dataset through f-measure comparison with other algorithms.

Performance Evaluation of Hydrostatic Bearing Guided Rotary Table for Large Volume Multi-tasking Vertical Lathe (대형 복합수직선반 가공기용 유정압베어링 회전테이블 성능 실험 및 분석)

  • Shim, Jongyoup;Oh, Jeong-Seok;Park, Chun-Hong;Shin, Heung-Chul;Park, Woo-Sang;Kim, Min-Jae;Kim, Min-Soo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.31 no.7
    • /
    • pp.635-642
    • /
    • 2014
  • The large volume multi-tasking vertical lathe was developed for machining the bearing parts for a wind power generator. Although the machined part is large in size high precision tolerances are required recently. One of the most important components to achieve this mission is the rotating table which holds and supports the part to be machined. The oil hydrostatic bearing is adopted for the thrust bearing and the rolling bearing for the radial bearing. In this article experimental performance evaluation and its analysis results are presented. The rotational accuracy of the table is assessed and the frequency domain analysis for the structural loop is performed. And in order to evaluate the structural characteristic of table the moment load experiment is performed. The rotational error motion is measured as below 10 ${\mu}m$ for the radial and axial direction and 22,800 Nm/arcsec of moment stiffness is achieved for the rotary table.

Study on Optimization of Look-Up Table to Reduce Error of Three-dimensional Interpolation (3차원 보간 오차를 개선하기 위한 룩업 테이블의 최적화에 관한 연구)

  • Kim, Joo-Young;Lee, Hak-Sung;Han, Dong-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.2 s.314
    • /
    • pp.12-18
    • /
    • 2007
  • The three dimensional interpolation is widely used for many kinds of color signal transformation such as real-time color gamut mapping. Given input color signal, the output color signal is approximately calculated by the interpolation with the input point and extracted values from a lookup table which is constructed by storing the values of transformation at regularly packed sample points. Apparently, errors of the interpolated approximation heavily depend on the selection of the lookup table. In this paper, a least square method is applied to assigning values of the lookup table with fixed size in order to minimize error of three-dimensional interpolation. The experimental result shows that the proposed method has better interpolation performance.

An Index Structure for Trajectory-based Query of Moving Objects in Mobile Applications (모바일 응용에서 이동 객체의 궤적-기반 질의를 위한 색인 구조)

  • Shim Choon-Bo;Joo Jae-Heum
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.8
    • /
    • pp.1828-1834
    • /
    • 2004
  • With the rapid development of wireless communications and mobile technologies, requirements of various services based on moving objects like location-based services and mobile applications services have been increased. In this paper, we propose an index structure which can improve the performance on trajectory-based query especially, one of the various query types for moving objects in mobile applications. It maintains link table(L-Table) to obtain good efficiency on retrieval and insertion performance of the existing TB(Trajectory Bundle)-tree proposed for trajectory-based query of moving objects. The L-Table contains page number in disk and memory pointers pointing the leaf node with the first and last line segment of moving objects in order to directly access preceding node. In addition, we design to reside a part of whole index in main memory by preserving a fixed size of buffer in case of being restricted by available main memory. Finally, experimental results with various data sets show that the proposed technique is superior to the existing index structures with respect to insertion and trajectory-based query.

Color Inverse Halftoning using Vector Adaptive Filter (벡터적응필터를 이용한 컬러 역하프토닝)

  • Kim, Chan-Su;Kim, Yong-Hun;Yi, Tai-Hong
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.3
    • /
    • pp.162-168
    • /
    • 2008
  • A look-up table based vector adaptive filter is proposed in color inverse halftoning. Inverse halftoning converts halftone image into a continuous-tone image. The templates and training images are required in the process of look-up table based methods, which can be obtained from distributed patterns in the sample halftone images and their original images. Although the look-up table based methods usually are faster and show better performances in PSNR than other methods do, they show wide range of qualities depending on how they treat nonexisting patterns in the look-up table. In this paper, a vector adaptive filter is proposed to compensate for these nonexisting patterns, which achieves better quality owing to the contributed informations about hue, saturation, and intensity of surrounding pixels. The experimental results showed that the proposed method resulted in higher PSNR than that of conventional Best Linear Estimation method. The bigger the size of the template in the look-up table becomes, the more outstanding quality in the proposed method can be obtained.

Data Cube Generation Method Using Hash Table in Spatial Data Warehouse (공간 데이터 웨어하우스에서 해쉬 테이블을 이용한 데이터큐브의 생성 기법)

  • Li, Yan;Kim, Hyung-Sun;You, Byeong-Seob;Lee, Jae-Dong;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1381-1394
    • /
    • 2006
  • Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.

  • PDF

Fast Generation of 3-D Hologram Fringe Patterns by using the Block Redundancy of 3-D Object Images and the Novel Look-up Table Method (3차원 영상의 블록 중복성 및 N-LUT 기법을 이용한 3차원 홀로그램 프린지 패턴의 고속합성)

  • Kim, Si-Hyung;Koo, Jung-Sik;Kim, Seung-Cheol;Kim, Eun-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2355-2364
    • /
    • 2012
  • Recently, the novel loop-up table(N-LUT) method to solve the tremendous memory problem of the conventional look-up table (LUT) method as well as to increase the generation speed of hologram patterns has been proposed. But, as the resolution of an input 3-D object is enhanced, the number of object points to be calculated for generation of its hologram pattern also increases, which results in a sharp increase of the computation time. Therefore, in this paper, a new approach for fast generation of the hologram pattern of 3-D object images is proposed by using the block redundancy feature of 3-D object images and the N-LUT method. Experimental results show that in the proposed method the number of object points and the overall computation time have been reduced by 43.3 % and 47.9 %, respectively compared to those of the conventional method for the case of the $5{\times}5$ block size. These good experimental results finally confirm the feasibility of the proposed method.

A Study of the Construction in order to 24/25 I-NRZI Modulator Designs for DVCR (DVCR용 24/25 I-NRZI 변조기의 설계를 위한 구조 고찰)

  • Park, Jong-Jin;Kook, Il-Ho;Kim, Eun-Won;Cho, Won-Kyung
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.1
    • /
    • pp.35-41
    • /
    • 2000
  • This paper considers the consturction of 24/25 I-NRZI (Interleaved - Non Return to Zero Inverse) modulator designs for DVCR (Digital Video Cassette Recorder), and size of validity bit in order to store the amplitude value of square-wave and the standard data ( sine and cosine coefficients) at ROM Table that to acceptable the spectrum standard. The validity bit size of the standard data and the amplitude value of square-wave that to store at ROM Table are affected the size of pilot signal on the output spectrum, and the hardware size of modulator. At the designable 24/25 I-NRZI modulator, we simulated using random pattern (F0,F1,F2) that to verification the output data of the spectrum. Moreover, the resultant of the spectrum analysis, at the optimizing value, is 0.065 on the amplitude value of square-wave, and 3bit on the size of bit in order to store the standared data at ROM Table. In order to verify the hardware of designable 24/25 I-NRZI modulator, we perform to modeling of C-language firstly, and coding to Verilog HDL (Cadence Verilog XL) and synthesized using Synopsys (Library "Samsung KG75") tool as a base of spectrum results. In a foundation of this result, we are considered the size of hardware. In this paper, a considerable 24/25 I-NRZI modulator designable less than 10,000 gates as that is improved consturction as regards the path method of pre-coder etc, and able to application digital camcorders as now practical use.

  • PDF

Estimation of Software Development Efforts and Schedule Based on A Ballpark Schedule Estimation Table (개략적 일정추정표 기반 소프트웨어 개발노력과 일정 추정)

  • Park, Young-Mok
    • Journal of Internet Computing and Services
    • /
    • v.8 no.4
    • /
    • pp.105-117
    • /
    • 2007
  • In order to succeed in a bid or development, the project manager should estimate its cost and schedule more accurately in the early stage of the project. Usually, the nominal schedule of most projects can be derived from rule of thumb, first-order estimation practice, or ball-park schedule estimation table. But the rule-of-thumb models for the nominal schedule estimation are so various, and the first-order estimation practice does not provide sufficient information. So they do not help much to decide on the proper development effort and schedule for a particular size of project. This paper presents a statistical regression model for deciding the development effort and schedule of a project using the ball-park schedule estimation table. First, we have redefined such words suggested in the ballpark schedule estimation table as shortest possible schedule, efficient schedule and nominal schedule, Next, we have investigated the relationship between the development effort and the schedule. Finally, we have suggested a model for estimating the development effort and the more accurate schedule of such particular sizes of software as are not presented in the ball-park schedule estimation table. The experimental results show that our proposed regression analysis model decreases the mean magnitude of relative error by 2% at maximum. Also this model can estimated the development effort and schedule for a particular size of software.

  • PDF