• 제목/요약/키워드: number and operations area

검색결과 168건 처리시간 0.027초

상호영향계층분석방법을 이용한 항공기술의 평가에 관한 연구 (An Application of the Cross-impact Hierarchy Process to Evaluate Aeronautics Technologies: A Case Study)

  • Kwon, Cheol-Shin;Cho, Keun-Tae
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2000년도 추계학술대회 및 정기총회
    • /
    • pp.259-262
    • /
    • 2000
  • The Cross-impact Hierarchy Process (CHP), an extended model of the Analytic Hierarchy Process(AHP) which is linked to Cross Impact Analysis(CIA), is a powerful decision making tool to assist in the ranking of large number of dependent technological alternatives. In this paper, we will describe an application of the CHP to the aerospace industry. We here conducted a questionnaire survey for S company that is one of the representative aerospace companies in Korea. A questionnaire was designed to obtain both the priority with dependence (the CHP priority) and the priority with independence (the AHP priority) in order to compare the priority derived by each of two methods. The hierarchy in this case study is concerned with priority setting for R&D area to ensure dependent aerospace design technology of the company, The result shows that there exists the difference hard to neglect between the final priorities gained by two methods.

  • PDF

대역확산통신에서 FH무전기의 상호간섭연구 (A Study on Co-Channel Interference of FH Spread Spectrum Communications)

  • 최은재;김제영;윤병창;배현웅;이시창
    • 한국국방경영분석학회지
    • /
    • 제16권2호
    • /
    • pp.118-134
    • /
    • 1990
  • This paper considers the mutual interference problem of several users employing the same FH systems in selected multiple user environments. The environment consists of a desired transmitter-receiver pair located in an area where there are M interfering users distributed in accordance with a specified probability density function. Both coherent Phase-Shift-Keyed and incoherent Frequencey-Shift-Keyed modulations are considered. The general formulas of the average bit error probability are derived. The calculation results are summarized and analyzed. The average bit error probability is highly dependent on the relative location of interferences to the desired link, the time duty factor of the hopping and the number of available channels.

  • PDF

포병진지 규모의 축소 가능성에 관한 연구 (A Study for the Possibility of Reducing the Size of Battery Position)

  • 고재홍;강성진
    • 한국국방경영분석학회지
    • /
    • 제18권1호
    • /
    • pp.74-85
    • /
    • 1992
  • Increasing the number of artillery units requires more deployment space in the field operation area. However, there is limited space available in FEBA due to mountainous terrains. Therefore most artillery units cannot occupy enough deployment space which is proposed in the field artillery mannual(FM) to maximize the firing-effectiveness and to minimize the enemy threat. This paper studies the problems of reducing the size of a battery deployment space being applied currently without decreasing the firing-effectiveness of the battery. The optimum size of a battery position is obtained by using Lemus and David's allocation model and Supper Quick II Model which produces the probability of kill data with various input data. The result shows that the battery deployment space can be reduced without decreasing the firing-effectiveness in the example problem.

  • PDF

근사적 확률을 이용한 표적 탐색 (A Faster Algorithm for Target Search)

  • 정성진;홍성필;조성진;박명주
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2006년도 추계학술대회
    • /
    • pp.57-59
    • /
    • 2006
  • The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

  • PDF

잉여수 체계를 이용한 디지털 뉴론 프로세서의 설계 (Design of a Digital Neuron Processor Using the Residue Number System)

  • 윤현식;조원경
    • 전자공학회논문지B
    • /
    • 제30B권10호
    • /
    • pp.69-76
    • /
    • 1993
  • In this paper we propose a design of a digital neuron processor using the residue number system for efficient matrix.vector multiplication involved in neural processing. Since the residue number system needs no carry propagation for modulus operations, the neuron processor can perform multiplication considerably fast. We also propose a high speed algorithm for computing the sigmoid function using the specially designed look-up table. Our method can be implemented area-effectively using the current technology of digital VLSI and siumlation results positively demonstrate the feasibility of our method. The proposed method would expected to adopt for application field of digital neural network, because it could be realized to currently developed digital VLSI Technology.

  • PDF

시각시스템의 Edge 검출용 고속 마스크 Operator (Fast Mask Operators for the edge Detection in Vision System)

  • 최태영
    • 한국통신학회논문지
    • /
    • 제11권4호
    • /
    • pp.280-286
    • /
    • 1986
  • 행렬분해에 의하여 edge검출용 mask operator의 고속계산법을 제시하였다. 다방향성 mask operator의 각방향에 대한 계산결과는 mask원소와 화상간의 곱한 것을 합산한 것이다. 이것은 각 mask의 원소를 행으로 하는 행렬과 mask에 포함되는 화소를 원소로하는 벡터와의 곱과 마찬가지여서 1차원 신호변환으로도 취급할 수 있다. 본 논문에서는 Sobel 및 Prewitt operator의 경우에 대한 변환행렬을 구한 다음 분해하여 계산량을 산출하여 직접 계산할 때의 방법과 비교하였다. 이 결과 여분의 기억점을 사용치 않고서도 이 방법에 의한 계산량은 Soble 및 Prweitt operator의 경우에 각각 직접 계산량의 42.86%, 50%밖에 되지 않았다. 그리고 100x100화소의 화상인 경우에 301개의 여분의 기억점을 사용할때에 Sobel opreator는 직접 계산량의 35.93%로 줄어 들었다.

  • PDF

Numerical Analysis of Plume Characteristics and Liquid Circulation in Gas Injection Through a Porous Plug

  • Choi, Choeng-Ryul;Kim, Chang-Nyung
    • Journal of Mechanical Science and Technology
    • /
    • 제14권12호
    • /
    • pp.1365-1375
    • /
    • 2000
  • Two phase flows have been numerically calculated to analyze plume characteristics and liquid circulation in gas injection through a porous plug. The Eulerian approach has been for formulation of both the continuous and dispersed phases. The turbulence in the liquid phase has been modeled using the standard $textsc{k}$-$\varepsilon$ turbulence model. The interphase friction coefficient has been calculated using correlations available in the literature. The turbulent dispersion of the phase has been modeled by the "dispersion Prand시 number". The predicted mean flows is compared well with the experimental data. The plume region area and the axial velocities are increased with the gas flow rate and with the decrease in the inlet area. The turbulent intensity also shows the same trend. Also, the space-averaged turbulent kinetic energy for various gas flow rates and inlet areas has been obtained. The results are of interest in the design and operation of a wide variety of materials and chemical processing operations.

  • PDF

사전정보를 이용한 차량번호판 영역의 분리 (Isolating vehicle license plate area using the known information)

  • 문기주;신영석;최효돈
    • 경영과학
    • /
    • 제13권2호
    • /
    • pp.1-11
    • /
    • 1996
  • Two different methods to extract the license plate area of a vehicle have been used for automatic recognition purposes. One method is with a color vision system and the other is with an edge detecting operator. The system with color vision has some problems if the colors of license plate and vehicle's body are similar. The various plate colors in Korea also drops the system performance. The edge detecting operator also has a problem for a real time processing since it performs on all pixels of the scene. In this paper a possible method using gray level vision system and available pre-known information of license plates is suggested. The suggested procedure searches the lower boundary of the plate by counting high contrast points between one and near pixel from the bottom line of the scene. It finds the upper boundary from the bottom line by adding number plate height after finding the lower boundary. The left and right boundaries are found by similar processes.

  • PDF

태양활동 자료를 이용한 플레어 발생 예보 (THE PREDICTION OF FLARE PRODUCTION USING SOLAR ACTIVITY DATA)

  • 이진이;김갑성
    • 천문학논총
    • /
    • 제11권1호
    • /
    • pp.263-277
    • /
    • 1996
  • We have intensively carried out numerical calculations on flare predictions from the solar activity data for photospheric sunspots, chromospheric flare and plages, coronal X-ray intensities and 2800MHz radio fluxes, by using multilinear regression method. Intensities of solar flares for the next day have been predicted from the solar data between 1977-1982 and 1993-1996. Firstly, we have calculated flare predictions with the multilinear regression method, by using separate solar data in growth and decay phase of sunspot area and magnetic field strength from the whole data on solar activities. Secondly, the same operations as above have been made for the remaining data after removal of the data with large deviation from the mean calculated by the above prediction method. we have reached a conclusion that average hit ratio of correct predictions to total predictions of flares with class of M5 over has been as high as 70% for the first case and that of correct prediction number to total observation number has been shown as 61%.

  • PDF

이진영상에서 바운딩 서클의 빠른 계산방법 (Fast Computation of the Radius of a Bounding Circle in a Binary Image)

  • 김회율;유광석
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제54권7호
    • /
    • pp.453-457
    • /
    • 2005
  • With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.