• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.285-291
• /
• 2014

Recently, many researchers have paid attention to the study on generation of new linked data from tables by using linked open data (e.g. RDF, OWL). This paper proposes a new method for such generation of linked data. A pattern-based method intrinsically has a conflict problem among patterns. For instance, several patterns, mapping a single header of a table into different properties of linked data, conflict with each others. Existing studies have sacrificed precision by applying a statistically dominant pattern or have ignored conflicting patterns to increase precision. The proposed method finds appropriate patterns for all headers in a given table by connecting patterns applied to the headers. Experiments using DBPedia and Wikipedia showed results that conflicts of patterns are effectively resolved by the proposed method.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.24 no.1
• /
• pp.112-121
• /
• 2016

AFLS (Adaptive front lighting system) is being applied to improve safety in driving automotive at night. Safe embedded system design for controlling head-lamps is required to improve noise robust ECU hardware and software simultaneously by considering safety requirement of hardware-dependent software under severe environmental noise. In this paper, we propose an adaptive headlight controller with a newly-designed symmetric angle sensor compensator, especially based on the proposed steering-swivel angle lookup table to determine whether the current controlling target is safe. The proposed system includes an additional backup hardware to compare the system status and provides safe swivel-angle management using a controlling algorithm based on the pre-defined lookup table (LUT), which is a symmetric mapping relationship between the requested steering angle and expected swivel angle target. The implemented system model shows that the proposed architecture effectively detects abnormal situations and restores safe status of controlling the light-angle in AFLS operations under severe noisy environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.241-246
• /
• 2004

Medical images are being managed more by PACS in general medical institutions. It is important to protect patients from being invaded their privacy related to the images. It is also necessary to confirm the ownership, the right of properity of the medical images and notice whether the data are modified. In this paper, we propose a robust watermarking against RST attacks in medical images on the PACS. The proposed scheme modifies and improves Log-Polar Mapping and Fourier Mellin Transform in order to realize and recover serious image degradation and watermark data loss caused by the conversion between cartesian coordinate and log-polar coordinate. We used the radius and theta Look Up Table to solve the realization of the Fourier Mellin Transform, and inserted a watermark into 2D-DFT magnitudes using Spread Spectrum. Experimental results shows that this method are robust to several attack.

• Journal of Broadcast Engineering
• /
• v.27 no.5
• /
• pp.812-815
• /
• 2022

Images displayed on a digital devices under the sunlight are generally perceived to be darker than the original images, which leads to a decrease in visibility. For better visibility, global luminance compensation or tone mapping adaptive to ambient lighting is required. However, the existing methods have limitations in chrominance compensation and are difficult to use in real world due to their heavy computational cost. To solve these problems, this paper propose a piece-wise linear curves (PLECs)-based image enhancement method to improve both luminance and chrominance. At this time, PLECs are regressed through deep learning and implemented in the form of a lookup table to real-time operation. Experimental results show that the proposed method has better visibility compared to the original image with low computational cost.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.123-136
• /
• 2006

The prefetching technique is an effective way to reduce the latency caused memory access. However, excessively aggressive prefetch not only leads to cache pollution so as to cancel out the benefits of prefetch but also increase bus traffic leading to overall performance degradation. In this thesis, a prefetch filtering scheme is proposed which dynamically decides whether to commence prefetching by referring a filtering table to reduce the cache pollution due to unnecessary prefetches In this thesis, First, prefetch hashing table 1bitSC filtering scheme(PHT1bSC) has been shown to analyze the lock problem of the conventional scheme, this scheme such as conventional scheme used to be N:1 mapping, but it has the two state to 1bit value of each entries. A complete block address table filtering scheme(CBAT) has been introduced to be used as a reference for the comparative study. A prefetch block address lookup table scheme(PBALT) has been proposed as the main idea of this paper which exhibits the most exact filtering performance. This scheme has a length of the table the same as the PHT1bSC scheme, the contents of each entry have the fields the same as CBAT scheme recently, never referenced data block address has been 1:1 mapping a entry of the filter table. On commonly used prefetch schemes and general benchmarks and multimedia programs simulates change cache parameters. The PBALT scheme compared with no filtering has shown enhanced the greatest 22%, the cache miss ratio has been decreased by 7.9% by virtue of enhanced filtering accuracy compared with conventional PHT2bSC. The MADT of the proposed PBALT scheme has been decreased by 6.1% compared with conventional schemes to reduce the total execution time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.37-47
• /
• 2016

The practical constraints on the commercial FPGAs which contain dedicated wide function multiplexers in their slice structure are incorporated with one of the most advanced FPGA mapping algorithms based on the AIG (And-Inverter Graph), one of the best logic representations in academia. As the first step of the mapping process, cuts are enumerated as intermediate structures. And then, the cuts which can be mapped to the multiplexers are recognized. Without any increased complexity, the delay and area of multiplexers as well as LUTs are calculated after checking the requirements for the tree construction such as symmetry and depth limit against dynamically changing mapping of neighboring nodes. Besides, the root positions of multiplexer trees are identified from the RTL code, and annotated to the AIG as AOs (Auxiliary Outputs). A new AIG embedding the multiplexer tree structures which are intentionally synthesized by Shannon expansion at the AOs, is overlapped with the optimized AIG. The lossless synthesis technique which employs FRAIG (Functionally Reduced AIG) is applied to this approach. The proposed approach and techniques are validated by implementing and applying them to two RISC processor examples, which yielded 13~30% area reduction, and up to 32% delay reduction. The research will be extended to take into account the constraints on the dedicated hardware for carry chains.

• The Journal of Society for e-Business Studies
• /
• v.9 no.4
• /
• pp.117-136
• /
• 2004

As the time-to-market gets more important for competitiveness of an enterprise in manufacturing industry, it becomes important to shorten the development cycle of a product. Reuse of existing design models and e-Catalog for components are required for faster product development. To achieve this goal, an electric catalog must provide parametric CAD models since parametric information is indispensable for configuration design. There are difficulties in building up a parametric library of all the necessary combination using a CAD system, since we have too many combinations of components for a product. For example, there are at least 80 million combinations of components on one page of paper catalog of a mold base. To solve this problem, we propose the method of table parametric for the automatic generation of parametric CAD models. Any combination of mold base can be generated by mapping between a classification system of an electric catalog and the design parameters set of the table parametric. We propose how to select parametric models and to construct the design parameters set.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.15 no.1
• /
• pp.12-18
• /
• 1978

From the state table of sequential machines, Roomers) obtained minimal k co-mapping chain(k-CC) and proposed an algorithm obtaining binary partitions which were seed partitions of S-shift registers. By comparing and processing bits simply, this paper obtained two different algorithms more efficient than that of Roome's for obtaining such binary partitions and defined the concept of the triple pair of the basis partitions. By using the concept, given set of basis partitions was reduced to the set containing elements of the triple pair only and the algorithm became quite simple.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.09a
• /
• pp.782-789
• /
• 2010

Landslides cause enormous economic losses and casualties. Korea has mountainous regions and heavy slopes in most parts of the land and has consistently built new roads and large-scale housing complexes according to its industrial and urban growth. As a result, the damage from landslides becomes greater every year. In this study, performed a GIS-based landslide hazard analysis by SINMAP(Stability Index MAPping) model in Gyeonggi Icheon area coupling with geomorphological and geological data. SINMAP model has its theoretical basis in the infinite plane slope stability model with wetness obtained from a topographically based steady state model of hydrology. To Gyeonggi Icheon area landslides hazards evaluated, these SINMAP model were analysed results while simultaneously referring to the stability index map, where lines distinguish the zones categorized into the different stability classes and a table giving summary statistics.

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

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.