• Title/Summary/Keyword: 서가 배열

Search Result 549, Processing Time 0.029 seconds

논증식 배열을 통한 서대문 자연사 박물관 전시물 배열의 제안: 지구의 탄생을 중심으로

  • Jo, Myeong-Sin;Kim, Yong-Gi;O, Jun-Yeong
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.36 no.1
    • /
    • pp.80-80
    • /
    • 2011
  • 이 연구는 일종의 비형식 교육기관인, 과학관 전시물의 배열과 설명문의 구조에 대한 논증적 접근을 목표로 하고 있다. 그러한 접근을 통하여 서대문 자연사 과학관 전시물 배열의 문제점과 새로운 전시물 배열방식을 제안한다. 이를 위해 첫째, 우리는 논증을 바탕으로 전시물 배열의 거시와 미시적 관점의 점검 기준을 설정하였다. 이 분석 결과를 바탕으로 서대문 자연사 박물관 지구의 탄생분야의 전시의 배열에 대한 개선점을 제안한다. 분석은 Booth 등(2008)의 논증에 기초하여 공룡은 다른 동물들에 비해서 어떻게 그렇게 번창하였는가? 그 이유는 무엇인가? 무엇이 이 주장과 이유를 지지하는 증거인가? 질문들을 다루었다. 따라서 이러한 논증 식 전시물 배열이 서대문 자연사 박물관 전시 배열에 도입된다면 더 좋은 전시 효과를 얻을 수 있다고 결론 짓는다.

  • PDF

Procedure Development and Qualification of the Phased Array Ultrasonic Testing for the Nuclear Power Plant Piping Weld (원자력발전소 배관 용접부 위상배열 초음파검사 절차서 개발 및 기량검증)

  • Yoon, Byung-Sik;Yang, Seung-Han;Kim, Yong-Sik;Lee, Hee-Jong
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.30 no.4
    • /
    • pp.317-323
    • /
    • 2010
  • The manual ultrasonic examination for the nuclear power plant piping welds has been demonstrated by using KPD(Korean Performance Demonstration) generic procedure. For automated ultrasonic examination, there is no generic procedure and it should be qualified by using applicable automated equipment. Until now, most of qualified procedures used pulse-echo technique and there is no qualified procedure using phased array technique. In this study, data acquisition and analysis software were developed and phased-array transducer and wedge were designed to implement phased array technique for nuclear power plant in-service inspection. The developed procedure are qualified for performance demonstration for the flaw detection, length sizing and depth sizing. The qualified procedure will be applied for the field examination in the nuclear power plant piping weld inspection.

Effect of Airgun Intervals on marine Seismic Acquisition (탄성파 탐사에서 건 간격이 미치는 영향)

  • 유해수
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.06c
    • /
    • pp.483-486
    • /
    • 1998
  • 한국해양연구소 온누리호에 장착된 에어건 배열에서 건 간격에 따른 빔 패턴 변화를 확인하였으며 남극해역에서 획득된 탐사자료와 비교하였다. 컴퓨터 모의과정과 배열 이론을 이용하여 신호진폭 및 빔 폭 변화 등을 시간 및 주파수 영역에서 분석하였다. 154 Hz에서 송이배열 (cluster array) 및 폭 배열 (wide array)의 빔 폭 변화는 배열 형태보다는 건 간격에 큰 영향을 받고 있어 배열 형태가 달라도 빔 폭은 서로 유사하게 변한다. 건 간격이 클수록 송이배열이 90$^{\circ}$의 빔 패턴에서 주엽 (mainlobe)이 최대치가 되는 것과는 달리 폭배열은 0$^{\circ}$에서 최대치를 나타내며 부엽 (sidelobe)은 건 간격과 무관하게 나타난다. 두 배열의 선형간섭이 점차 줄어드는 건 간격은 2.43 m이다. 남극해 탐사자료는 건 간격이 증가함에 따라 주신호 진폭은 약하게 기포는 강하게 증가한다. 이러한 결과는 빔 패턴 변화에서도 마찬가지로 나타나는데 건 간격이 클수록 주엽의 빔 폭이 점차 좁아져 강한 빔 패턴을 나타냄으로서 남극 탐사자료와 서로 잘 일치한다.

  • PDF

Electromagnetic Transmission Characteristics of a Nanorod Cylinder Array (나노 원기둥 배열의 전자파 전달 특성)

  • Cho, Yong Heui
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2013.05a
    • /
    • pp.29-30
    • /
    • 2013
  • 차세대 전자 소자용 전송 선로로 사용될 수 있는 나노 원기둥 배열의 분산 관계 특성을 모드 정합법을 사용하여 계산하였다. 서로 떨어진 나노 원기둥 배열에도 배열이 놓인 방향으로 전자파 모드가 형성되는 것을 수치 해석 결과로 제시한다. 또한 나노 원기둥 배열에 생기는 전기장의 분포 특성도 제시한다.

  • PDF

Characteristics of Sequentially-Rotated Array Antenna by Varying Sequential Array Parameter (배열 정수 변화에 의한 순차 회전 배열 안테나의 특성)

  • Han, Jeong-Se;Lee, Hyun-Sung;Seo, Dong-Kug;Park, Byoung-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.11
    • /
    • pp.76-83
    • /
    • 2007
  • In the sequentially rotated array antennas, the characteristics of antenna gain, axial ratio and cross polarization have been analyzed with a varying of sequential array constant(number of array element, figure of rotation) respectively. Where the antenna element of array is a probe feeding, LHCP truncated microstrip antenna whose resonant frequency is in 11.85GHz. The simulation results of 23 SRA antennas((M=2, 3, 4, 6, 8), $(1\leqP\leqM)$) has shown as follows. The widest 3dB bandwidth of axial ratio appears at P=2 which is in-dependant of M, the highest antenna gain appears when a sequential array constant has a pair of (2, 1), (3, 2), (4, 1), (6, 3), (8, 1) respectively. Specially, all of the SRA antenna appear very poor characteristics in case of M=P. Therefore the SRA antenna has to be designed as selecting a optimal sequential array constant among a lot of simulation data.

Discussion on Calculating the Required Shelves for Arranging the School Library Collection (학교도서관 장서 배가를 위한 소요 서가 산출에 대한 논의)

  • Kang, Bong-Suk
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.56 no.1
    • /
    • pp.347-364
    • /
    • 2022
  • The purpose of this study is to propose a method of calculating the shelves required for the placement of bookshelves in the school library. The study was conducted by visiting 11 school libraries, and current library status was identified according to school levels and major subjects of the Korean Decimal Classification. According to the results of the survey, ideal numbers of arranged volumes are 46.9, 32.3, and 28.4 volumes of books, for elementary, middle, and, high school respectively, which takes up 67 percent of a 90-centimeter-unit bookshelf. However, the more realistic number turned out to be 75%, with 52.8, 36.4, and 32.0 volumes of books for elementary, middle, and high schools, respectively. Based on the results of the survey, a tool was presented to calculate required bookshelves in school libraries. This study is expected to have a positive impact on library operation by making it easier to calculate the bookshelves required for actual placement.

An Efficient Method for Finding Similar Regions in a 2-Dimensional Array Data (2차원 배열 데이터에서 유사 구역의 효율적인 탐색 기법)

  • Choe, YeonJeong;Lee, Ki Yong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.4
    • /
    • pp.185-192
    • /
    • 2017
  • In various fields of science, 2-dimensional array data is being generated actively as a result of measurements and simulations. Although various query processing techniques for array data are being studied, the problem of finding similar regions, whose sizes are not known in advance, in 2-dimensional array has not been addressed yet. Therefore, in this paper, we propose an efficient method for finding regions with similar element values, whose size is larger than a user-specified value, for a given 2-dimensional array data. The proposed method, for each pair of elements in the array, expands the corresponding two regions, whose initial size is 1, along the right and down direction in stages, keeping the shape of the two regions the same. If the difference between the elements values in the two regions becomes larger than a user-specified value, the proposed method stops the expansion. Consequently, the proposed method can find similar regions efficiently by accessing only those parts that are likely to be similar regions. Through theoretical analysis and various experiments, we show that the proposed method can find similar regions very efficiently.

Performance analysis of sensor selection methods for beam steering direction of non-linear conformal array (비선형 곡면 배열 센서의 빔 지향 방위별 센서 선택 방법에 대한 성능 분석)

  • Kwon, Taek-ik
    • The Journal of the Acoustical Society of Korea
    • /
    • v.40 no.4
    • /
    • pp.391-399
    • /
    • 2021
  • The conformal array sensor has different sub-array depending on different beam steering directions. According to the method to effective the sensor, the performance of the conformal array sensor can be different, where the sub-array selects an effective sensor. Also, due to the figure of the conformal array sensor, the figure of the sub-array can be different each other, which results in different performance on directivity index, beam width and etc. In this paper, two methods to select sub-array which is the criteria for each sensors position vector and directive vector were proposed. For two sub-array selection methods, the performance of the directivity index, horizontal and vertical beam width were compared with the average and variance. In addition, this comparison was conducted when the number of sensors was fixed. When the number of sensors was not fixed, the directional vector method mainly results in high performance, but the performance of vertical beam width was lower or equal. When the number of sensors was fixed, the performance of two methods is similar, but the performance of variance was deteriorated.

Directional Search for Optimization of Metal-Only Reflectarray Antenna (금속 격자 배열 안테나 최적화를 위한 방향 탐색)

  • Lee, Sangwook
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2014.11a
    • /
    • pp.45-46
    • /
    • 2014
  • 금속 격자 배열 안테나의 이득을 최적화하려면 격자배열 원소의 개구면 깊이를 조정하여 위치에 관계없이 동위상 특성을 이루도록 해야 한다. 각 개구면의 깊이가 안테나 이득에 미치는 영향은 서로 종속적이어서 결정론적인 방법으로 풀기는 쉽지 않다. 본 논문에서는 기존의 Armijo 법칙을 적용한 방향 탐색 기법을 제안한다. 실험결과 방향 탐색 기법은 금속 배열 안테나 최적화 문제에서 효율적인 것을 확인하였다.

  • PDF

Efficient Construction of Generalized Suffix Arrays by Merging Suffix Arrays (써픽스 배열 합병을 이용한 일반화된 써픽스 배열의 효율적인 구축 알고리즘)

  • Jeon, Jeong-Eun;Park, Heejin;Kim, Dong-Kyue
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.6
    • /
    • pp.268-278
    • /
    • 2005
  • We consider constructing the generalized suffix way of strings A and B when the suffix arrays of A and B are given, j.e., merging two suffix arrays of A and B. There are efficient algorithms to merge some special suffix arrays such as the odd array and the even array. However, for the general case that A and B are arbitrary strings, no efficient merging algorithms have been developed. Thus, one had to construct the generalized suffix arrays of A and B by constructing the suffix array of A$\#$B$\$$ from scratch, even though the suffix ways of A and B are given. In this paper, we Present efficient merging algorithms for the suffix arrays of two arbitrary strings A and B drawn from constant and integer alphabets. The experimental results show that merging two suffix ways of A and B are about 5 times faster than constructing the suffix way of A$\#$B$\$$ from scratch for constant alphabets. Our algorithms include searching all suffixes of string B in the suffix array of A. To do this, we use suffix links in suffix ways and we developed efficient algorithms for computing the suffix links. Efficient computation of suffix links is another contribution of this paper because it can be used to solve other problems occurred in bioinformatics that should search all suffixes of a given string in the suffix array of another string such as computing matching statistics, finding longest common substrings, and so on. The experimental results show that our methods for computing suffix links is about 3-4 times faster than the previous fastest methods.