• Geophysics and Geophysical Exploration
• /
• v.10 no.1
• /
• pp.60-68
• /
• 2007

Conventional analysis of spectral induced polarization (SIP) data consists of measuring impedances over a range of frequencies, followed by spectral analysis to estimate spectral parameters. For the quantitative and accurate estimation of subsurface SIP parameter distribution, however, a sophisticated and stable inversion technique is required. In this study, we have developed a two-step inversion approach to obtain the two-dimensional distribution of SIP parameters. In the first inversion step, all the SIP data measured over a range of frequencies are simultaneously inverted, adopting cross regularisation of model complex resistivities at each frequency. The cross regularisation makes it possible to enhance the noise characteristics of the inversion by imposing a strong assumption, that complex resistivities should show similar characteristics over a range of frequencies. In numerical experiments, we could verify that our inversion approach successfully reduced inversion artefacts. As a second step, we have also developed an inversion algorithm to obtain SIP parameters based on the Cole-Cole model, in which frequency-dependent complex resistivities from the first step are inverted to obtain a two-dimensional distribution of SIP parameters. In numerical tests, the SIP parameter images showed a fairly good match with the exact model, which suggests that SIP imaging can provide a very useful subsurface image to complement resistivity.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2006.03a
• /
• pp.86-95
• /
• 2006

Brillouin backscatter is a type of reflection that occurs when light is shone into an optical fibre. Brillouin reflections are very sensitive to changes in the fibre arising from external effects, such as temperature, strain and pressure. We report here several case studies on the measurement of strain using Brillouin reflections. A mechanical bending test of an I beam, deployed with both fiber optic sensors and conventional strain gauge rosettes, was performed with the aim of evaluating: (1) the capability and technical limit of the DTSS technology for strain profile sensing; (2) the reliability of strain measurement using fiber optic sensor. The average values of strains obtained from both DTSS and strain gauges (corresponding to the deflection of I beam) showed a linear relationship and an excellent one-to-one match. A practical application of DTSS technology as an early warning system for land sliding or subsidence was examined through a field test at a hillside. Extremely strong, lightweight, rugged, survivable tight-buffered cables, designed for optimal strain transfer to the fibre, were used and clamped on the subsurface at a depth of about 50cm. It was proved that DTSS measurements could detect the exact position and the progress of strain changes induced by land sliding and subsidence. We also carried out the first ever distributed dynamic strain measurement (10Hz) on the Korean Train eXpress(KTX) railway track in Daejeon, Korea. The aim was to analyse the integrity of a section of track that had recently been repaired. The Sensornet DTSS was used to monitor this 85m section of track while a KTX train passed over. In the repaired section the strain increases to levels of 90 microstrain, whereas in the section of regular track the strain is in the region of 30-50 microstrain. The results were excellent since they demonstrate that the DTSS is able to measure small, dynamic changes in strain in rails during normal operating conditions. The current 10km range of the DTSS creates a potential to monitor the integrity of large lengths of track, and especially higher risk sections such as bridges, repaired track and areas at risk of subsidence.

• Genomics & Informatics
• /
• v.5 no.1
• /
• pp.10-18
• /
• 2007

Numerous studies have reported that genes with similar expression patterns are co-regulated. From gene expression data, we have assumed that genes having similar expression pattern would share similar transcription factor binding sites (TFBSs). These function as the binding regions for transcription factors (TFs) and thereby regulate gene expression. In this context, various analysis tools have been developed. However, they have shortcomings in the combined analysis of expression patterns and significant TFBSs and in the functional analysis of target genes of significantly overrepresented putative regulators. In this study, we present a web-based A Functional Clustering Analysis Tool for Predicted Transcription Regulatory Elements and Gene Ontology Terms (FCAnalyzer). This system integrates microarray clustering data with similar expression patterns, and TFBS data in each cluster. FCAnalyzer is designed to perform two independent clustering procedures. The first process clusters gene expression profiles using the K-means clustering method, and the second process clusters predicted TFBSs in the upstream region of previously clustered genes using the hierarchical biclustering method for simultaneous grouping of genes and samples. This system offers retrieved information for predicted TFBSs in each cluster using $Match^{TM}$ in the TRANSFAC database. We used gene ontology term analysis for functional annotation of genes in the same cluster. We also provide the user with a combinatorial TFBS analysis of TFBS pairs. The enrichment of TFBS analysis and GO term analysis is statistically by the calculation of P values based on Fisher’s exact test, hypergeometric distribution and Bonferroni correction. FCAnalyzer is a web-based, user-friendly functional clustering analysis system that facilitates the transcriptional regulatory analysis of co-expressed genes. This system presents the analyses of clustered genes, significant TFBSs, significantly enriched TFBS combinations, their target genes and TFBS-TF pairs.

• Korean Journal of Optics and Photonics
• /
• v.18 no.6
• /
• pp.375-382
• /
• 2007

The Shack-Hartmann wavefront sensor is composed of a lenslet array generating the spot images from which local slope is calculated and overall wavefront is measured. Generally the principle of wavefront reconstruction is that the spot centroid of each lenslet array is calculated from pixel intensity values in its subaperture, and then overall wavefront is reconstructed by the local slope of the wavefront obtained by deviations from reference positions. Hence the spot image of each lenslet array has to remain in its subaperture for exact measurement of the wavefront. However the spot of each lenslet array deviates from its subaperture area when a wavefront with large local slopes enters the Shack-Hartmann sensor. In this research, we propose a spot image searching method that finds the area of each measured spot image flexibly and determines the centroid of each spot in its area Also the algorithms that match these centroids to their reference points unequivocally, even if some of them are situated off the allocated subaperture, are proposed. Finally we verify the proposed algorithm with the test of a defocus measurement through experimental setup for the Shack-Hartmann wavefront sensor. It has been shown that the proposed algorithm can expand the dynamic range without additional devices.

• Journal of Navigation and Port Research
• /
• v.42 no.6
• /
• pp.469-477
• /
• 2018

Most of the current administrative names and locations for the names of places in the Nanjung diary have since been confirmed. However, a disagreement ensued among translators or researchers over Anpyeon-do (Baleum-do) islet recorded in Admiral Yi Sun-Shin's diary. Anpyeon-do was first recorded in the diary on October 11, 1597. It is credited to be the location where Yi Sun-shin and Chosun Naval Fleet stayed when sailing along the Southwestern coast of the Korean Peninsula after the battle of Myeongnyang. However, Anpyeon-do's exact geographical location has never been accurately confirmed. To accurately locate the islet, this study compared the direction and position of geographical locations observed in the Anpeon-do site match to actual geographical positions and directions. In addition, the direction and position of the geographical locations observed in the newly explored islands and mountains were evaluated with regard to how they correspond to the actual Anpeon-do. As a result, we concluded that the real location of Anpyeon-do recorded in the Nanjung diary is the Maebong mountain in Anjwa-do.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.512-522
• /
• 2003

For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Typically, the size of the chip required to implement the circuit depends on both the maximum number of the LUT blocks required to implement the function of each subcircuit and the maximum number of micro-registers to store results over context switches in the same time. Therefore, many partitioning or synthesis methods try to minimize these two factors. In this paper, we present a new estimation technique to find the lower bound on the number of micro-registers which can be obtained by any synthesis methods, respectively, without performing any actual synthesis and/or design space exploration. The lower bound estimation is very important in sense that it greatly helps to evaluate the results of the previous work and even the future work. If the estimated lower bound exactly matches the actual number in the actual design result, we can say that the result is guaranteed to be optimal. In contrast, if they do not match, the following two cases are expected: we might estimate a better (more exact) lower bound or we find a new synthesis result better than those of the previous work. Our experimental results show that there are some differences between the numbers of micro-registers and our estimated lower bounds. One reason for these differences seems that our estimation tries to estimate the result with the minimum micro-registers among all the possible candidates, regardless of usage of other resources such as LUTs, while the previous work takes into account both LUTs and micro-registers. In addition, it implies that our method may have some limitation on exact estimation due to the complexity of the problem itself in sense that it is much more complicated than LUT estimation and thus needs more improvement, and/or there may exist some other synthesis results better than those of the previous work.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• Progress in Medical Physics
• /
• v.24 no.2
• /
• pp.85-91
• /
• 2013

At present, megavoltage computed tomography (MVCT) is the only method used to correct the position of tomotherapy patients. MVCT produces extra radiation, in addition to the radiation used for treatment, and repositioning also takes up much of the total treatment time. To address these issues, we suggest the use of a video image-guided setup (VIGS) system for correcting the position of tomotherapy patients. We developed an in-house program to correct the exact position of patients using two orthogonal images obtained from two video cameras installed at $90^{\circ}$ and fastened inside the tomotherapy gantry. The system is programmed to make automatic registration possible with the use of edge detection of the user-defined region of interest (ROI). A head-and-neck patient is then simulated using a humanoid phantom. After taking the computed tomography (CT) image, tomotherapy planning is performed. To mimic a clinical treatment course, we used an immobilization device to position the phantom on the tomotherapy couch and, using MVCT, corrected its position to match the one captured when the treatment was planned. Video images of the corrected position were used as reference images for the VIGS system. First, the position was repeatedly corrected 10 times using MVCT, and based on the saved reference video image, the patient position was then corrected 10 times using the VIGS method. Thereafter, the results of the two correction methods were compared. The results demonstrated that patient positioning using a video-imaging method ($41.7{\pm}11.2$ seconds) significantly reduces the overall time of the MVCT method ($420{\pm}6$ seconds) (p<0.05). However, there was no meaningful difference in accuracy between the two methods (x=0.11 mm, y=0.27 mm, z=0.58 mm, p>0.05). Because VIGS provides a more accurate result and reduces the required time, compared with the MVCT method, it is expected to manage the overall tomotherapy treatment process more efficiently.

• Journal of Intelligence and Information Systems
• /
• v.18 no.3
• /
• pp.137-152
• /
• 2012

In the generation of Web 2.0, as many users start to make lots of web contents called user created contents by themselves, the World Wide Web is overflowing by countless information. Therefore, it becomes the key to find out meaningful information among lots of resources. Nowadays, the information retrieval is the most important thing throughout the whole field and several types of search services are developed and widely used in various fields to retrieve information that user really wants. Especially, the legal information search is one of the indispensable services in order to provide people with their convenience through searching the law necessary to their present situation as a channel getting knowledge about it. The Office of Legislation in Korea provides the Korean Law Information portal service to search the law information such as legislation, administrative rule, and judicial precedent from 2009, so people can conveniently find information related to the law. However, this service has limitation because the recent technology for search engine basically returns documents depending on whether the query is included in it or not as a search result. Therefore, it is really difficult to retrieve information related the law for general users who are not familiar with legal terms in the search engine using simple matching of keywords in spite of those kinds of efforts of the Office of Legislation in Korea, because there is a huge divergence between everyday words and legal terms which are especially from Chinese words. Generally, people try to access the law information using everyday words, so they have a difficulty to get the result that they exactly want. In this paper, we propose a term mapping methodology between everyday words and legal terms for general users who don't have sufficient background about legal terms, and we develop a search service that can provide the search results of law information from everyday words. This will be able to search the law information accurately without the knowledge of legal terminology. In other words, our research goal is to make a law information search system that general users are able to retrieval the law information with everyday words. First, this paper takes advantage of tags of internet blogs using the concept for collective intelligence to find out the term mapping relationship between everyday words and legal terms. In order to achieve our goal, we collect tags related to an everyday word from web blog posts. Generally, people add a non-hierarchical keyword or term like a synonym, especially called tag, in order to describe, classify, and manage their posts when they make any post in the internet blog. Second, the collected tags are clustered through the cluster analysis method, K-means. Then, we find a mapping relationship between an everyday word and a legal term using our estimation measure to select the fittest one that can match with an everyday word. Selected legal terms are given the definite relationship, and the relations between everyday words and legal terms are described using SKOS that is an ontology to describe the knowledge related to thesauri, classification schemes, taxonomies, and subject-heading. Thus, based on proposed mapping and searching methodologies, our legal information search system finds out a legal term mapped with user query and retrieves law information using a matched legal term, if users try to retrieve law information using an everyday word. Therefore, from our research, users can get exact results even if they do not have the knowledge related to legal terms. As a result of our research, we expect that general users who don't have professional legal background can conveniently and efficiently retrieve the legal information using everyday words.