• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.812-815
• /
• 1996

In this paper, we consider the optimal control problem based on Discrete Event Dynamic Systems(DEDS) in the Temporal Logic framework(TLF) which have studied for a convenient modeling technique. The TLF is enhanced with objective functions(event cost indices) and a measurement space is also defined. Our research goal is the design of the optimal controller for DEDSs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.328-332
• /
• 2007

The structure of MMSE receiver frontended by CMA array working in CDMA forward link is proposed. By using the despreaded pilot signal of forward link as a reference signal, CMA array can capture multi-path signals securely even in severely faded mobile channel. The remaining MAl (Multiple Access Interference) is cancelled by the cascaded MMSE receiver. Through computer simulation, it is proved that the proposed system shows much better BER performance than any other systems. As a mobile based spatio-temporal receiver, the proposed system also reduces implemental cost and complexity by adopting the simplest algorithm for its spatial and temporal domain processing.

• The Bulletin of The Korean Astronomical Society
• /
• v.42 no.2
• /
• pp.88.3-89
• /
• 2017

We present our experiences with open-source NoSQL database systems in analyzing spatial and temporal astronomical data. We conduct experiments of using Redis in-memory NoSQL database system by modifying and exploiting its support of geohash for astronmical spatial data. Our experiment focuses on performance, cost, difficulty, and scalability of the database system. We also test OpenTSDB as a possible NoSQL database system to process astronomical time-series data. Our experiments include ingesting, indexing, and querying millions or billions of astronomical time-series measurements. We choose our KMTNet data and the public VVV (VISTA Variables in the Via Lactea) catalogs as test data. We discuss issues in using these NoSQL database systems in astronomy.

• Journal of Korea Multimedia Society
• /
• v.8 no.9
• /
• pp.1187-1194
• /
• 2005

In this paper, new contrast enhancement algorithms that use temporal decimation method and approximated CDF(Cumulative Distribution Function) are proposed. They reduce the amount of computation which is required for image contrast enhancement. Simulation results show that the algorithms can achieve significant reduction in the computational cost and the hardware complexity. Visual test and standard deviation of their histogram have been introduced to evaluate the resultant output images of the proposed method and the original ones.

• Asian Journal of Business Environment
• /
• v.5 no.3
• /
• pp.17-21
• /
• 2015

Purpose - This paper compares current requirements for depreciation accounting from the Financial Accounting Standards Board in America for equity securities and all debt securities with determinable fair value, and disclosure requirements related to the fair value of securities below registered cost with the requirements of the international Financial Reporting Standards Board and accounting standards committee. Research design, data, and methodology - Mini-review statements are examined relating to depreciation of investments in America and the Financial Accounting Standards depreciation of investments in Iran that meet the requirements of international reporting standards and the Iranian Accounting Standards Committee. Results - Accounting rules for depreciation of investments in securities requires a good deal of judgment. In particular, devaluation decisions during the recession and market crisis were controversial, although even with no clear guidelines on devaluation, sometimes such decisions were simple. Conclusions -Companies can choose from formal policies applied uniformly and documentations of interest to provide a summary of the principles and conclusions obtained through disclosure, enabling market participants to assess the entity's conclusions reasonably, thereby easing investor and market worries.

• Journal of Satellite, Information and Communications
• /
• v.12 no.2
• /
• pp.65-70
• /
• 2017

The structure of MMSE receiver front-ended by CMA(Constant Modulus Array) array working in CDMA forward link which is applicable to LEO spread spectrum satellite communication system is proposed. By using the despreaded pilot signal of forward link as a reference signal, the CMA array can capture multi-path signals securely even in severely faded LEO satellite channel. The remaining MAI (Multiple Access Interference) is cancelled by the cascaded MMSE receiver. Besides theoretical development, through relevant computer simulation, it is proved that the proposed system shows much better BER performance than any other possible candidate systems. As a spatio-temporal receiver mounted on a mobile vehicle, the proposed system also reduces implemental cost and complexity by adopting the simplest algorithm for its spatial and temporal domain processing.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.451-463
• /
• 2003

Recently, there have been various research efforts to develop strategies for accelerating OLAP operations on huge amounts of spatio-temporal data. Most of the work is based on multi-tree structures which consist of a single R-tree variant for spatial dimension and numerous B-trees for temporal dimension. The multi~tree based frameworks, however, are hardly applicable to spatio-temporal OLAP in practice, due mainly to high management cost and low query efficiency. To overcome the limitations of such multi-tree based frameworks, we propose a new approach called Hilbert Cube(H-Cube), which employs fractals in order to impose a total-order on cells. In addition, the H-Cube takes advantage of the traditional Prefix-sum approach to improve Query efficiency significantly. The H-Cube partitions an embedding space into a set of cells which are clustered on disk by Hilbert ordering, and then composes a cube by arranging the grid cells in a chronological order. The H-Cube refines cells adaptively to handle regional data skew, which may change its locations over time. The H-Cube is an adaptive, total-ordered and prefix-summed cube for spatio-temporal data warehouses. Our approach focuses on indexing dynamic point objects in static spatial dimensions. Through the extensive performance studies, we observed that The H-Cube consumed at most 20% of the space required by multi-tree based frameworks, and achieved higher query performance compared with multi-tree structures.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5015-5022
• /
• 2010

Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1070-1075
• /
• 2009

In this paper, we propose new depth estimation and intermediate view synthesis algorithms for three-dimensional video generation. In order to improve temporal consistency of the depth map sequence, we add a temporal weighting function to the conventional matching function when we compute the matching cost for estimating the depth information. In addition, we propose a boundary noise removal method in the view synthesis operation. after finding boundary noise areas using the depth map, we replace them with corresponding texture information from the other reference image. Experimental results showed that the proposed algorithm improved temporal consistency of the depth sequence and reduced flickering artifacts in the virtual view. It also improved visual quality of the synthesized virtual views by removing the boundary noise.

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.