• ETRI Journal
• /
• 제41권1호
• /
• pp.52-60
• /
• 2019

A fast hologram calculation approach is proposed to reduce computational load by avoiding the recalculation of redundancy information. In the proposed method, the hologram is divided into several sub-holograms that record and reconstruct different views of 3D objects. The sub-hologram is generated from its adjacent calculated sub-holograms by only adding the holograms of difference images between an adjacent pair of views. The repetitive information of two adjacent views is called angular redundancy. Therefore, avoiding the recalculation of this angular redundancy can considerably reduce the computational load. Experimental results confirm that the proposed method can reduce the computational time for the statue head, rabbits, and car to 4.73%, 6.67%, and 10.4%, respectively, for uniform intensity, and to 56.34%, 57.9%, and 66.24%, respectively, for 256 levels intensity, when compared to conventional methods.

• 한국기후변화학회지
• /
• 제7권4호
• /
• pp.485-492
• /
• 2016

For reporting national greenhouse gas inventory in forest sector, the forest growing stock from the National Forest Inventory (NFI) system has used as activity data sources. The National Forest Inventory system was changed from rotation system by province to annual system by 5 years across the country. The forest growing stocks based on the new inventory system produced a different trend compared to the previous estimations. This study was implemented to recalculate previous forest growing stocks for time series consistency at a national level. The recalculation of forest growing stock was conducted in an overlap approach by the IPCC guideline. In order to support the more consistency data, we used calibration factors between applied stand volumes in 1985 and 2012, respectively. As a result, the time series of recalculated forest growing stock was to be consistency using the overlap approach and the calibration factor with the lower middle/middle site index. According to the applied overlap period, however, we will recalculate activity data using more complete data from national forest inventory system.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.308-313
• /
• 1998

In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general description of concepts from specific instances of these concepts. In many real life situations, however, new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overcall set of instances. The method of learning presented here is base don a rough set concept proposed by Pawlak[2][11]. It is shown an algorithm to find minimal set of rules using reduct change theorems giving criteria for minimum recalculation with an illustrative example. Finally, the proposed learning algorithm is applied to fuzzy system to learn sampled I/O data.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.331-337
• /
• 1997

In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general descriptions of concepts from specific instances of these concepts. In many real life situations however new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overall set of instances. The method of learning presented here is based on a rough set concept proposed by Pawlak[2]. It is shown an algorithm to fund minimal set of rules using reduct change theorems giving criteria for minimum recalculation and an illustrative example.

• 한국전자파학회논문지
• /
• 제14권2호
• /
• pp.89-95
• /
• 2003

본 논문은 핸드오버 지역에서 cdma2000 1X와 WCDMA간의 적절한 가드 밴드를 결정하기 위하여 다운링크 블록킹을 모델화하고 lower bound approximation을 이용하여 다운링크 블록킹 확률의 근사식을 제안하고 있다. 본 논문의 연구결과에 의한 cdma2000 1X와 WCDMA간의 주파수 공유조건은 기지국의 공용화와 가드밴드(guard band) 1 MHz이상이다. 또한, 본 논문에서 제안된 다운링크 블록킹 확률 근사식은 Q-함수로 되어 있으므로 Monte-Carlo 방법이 가지고 있는 간섭 파라미터 변화에 따른 재계산(recalculation) 단점을 극복하는 해석 방법(analytical solution)이다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2003년도 추계학술대회 논문집(II)
• /
• pp.123-128
• /
• 2003

The first design elements of horizontal alignment are very important things for improvement or movement in Railway. When the design elements are lost or damaged, it is necessary to recalculation. In this paper, an investigation is made on the method of representation of horizontal alignment as a result of design element using GPS method. The results show that northing calculated about $2\~10$ meters and easting calculated about $0\~7$ meters between calculated and design data in center points.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2004년도 가을 학술발표회 논문집
• /
• pp.363-370
• /
• 2004

This Paper presents the response force distribution factor(RDF) and its application to recalculation of member forces in case of partial changes of structures. Using RDF, the mutuality of response forces between members can be estimated. The reanalysis technique recalculates directly any displacement or member force under consideration in real time without a full reanalysis in spite of local changes in member stiffness or connectivity using RDF. It is expected that RDF and the reanalysis technique can be used to develop efficient analysis techniques for tall buildings.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 춘계학술발표회 논문집
• /
• pp.75-79
• /
• 2003

Nowadays, the value of the ocean is growing noticeably throughout the world in accordance with the development of the industrial society and increase in the number of the ocean related economic activities. Therefore the pursuit of more waters has led more disputes amongst many maritime powers in the world. In this study, the territorial basepoints are recalculated methods to develop their accuracies to settle a boundary issue among nations.

• 한국정보통신학회논문지
• /
• 제12권12호
• /
• pp.2219-2225
• /
• 2008

동적인 XML문서에서 빈번히 발생하는 갱신에 대한 고려를 하지 않는 레이블링 기법들은 XML 문서 트리의 갱신이 일어날 때 마다 변화된 레이블 정보를 반영하기 위해서 전체 XML 트리를 재탐색하여 전체 노드의 레이블을 다시 계산하는 리레이블링 과정이 필요하다. 이러한 리레이블링은 갱신이 빈번히 일어나는 동적인 XML 문서에서는 비용이 상당히 크다는 단점이 있다. 이런 단점을 해결하기 위해 리레이블링 과정이 필요 없는 레이블링 기법으로 프라임 넘버 레이블링 기법이 제안되었다. 그러나 프라일 넘버 레이블링 기법은 문서가 갱신될 때 XML 문서 트리의 노드 간 형제순서를 갱신하는 문제는 고려하지 않고 있다. 이러한 형제순서의 갱신과정은 XML 문서 트리의 많은 부분을 재탐색하고 재기록 하여야 하므로 많은 비용이 필요하게 된다. 따라서 본 논문에서는 XML 문서 트리의 리레이블링과 재계산이 필요 없이 형제순서를 유지할 수 있는 형제순서 값을 갖는 프라임 넘버 레이블링 기법을 제안한다.

• Transactions on Control, Automation and Systems Engineering
• /
• 제4권1호
• /
• pp.92-99
• /
• 2002

To obtain visual information of a target object, a camera should be placed within the visibility region. As the visibility region is dependent on the relative position of the target object and the surrounding object, the position change of the surrounding object during a task requires recalculation of the visibility region. For a fast computation of the visibility region so as to modify the camera position to be located within the visibility region, we propose a spherical projection method. After being projected onto the sphere the visibility region is represented in $\theta$-$\psi$ spaces of the spherical coordinates. The reduction of calculation space enables a fast modification of the camera location according to the motion of the surrounding objects so that the continuous observation of the target object during the task is possible.