• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.27-42
• /
• 2009

In realizing ubiquitous computing, techniques of efficiently using the limited resource at client such as mobile devices are required. With a mobile device with limited amount of memory, the techniques of XML stream query processing should be employed to process queries over a large volume of XML data. Recently, several techniques were proposed which fragment XML documents into XML fragments and stream them for query processing at client. During query processing, there could be great difference in resource usage (query processing time and memory usage) depending on how the source XML documents are fragmented. As such, an efficient fragmentation technique is needed. In this paper, we propose an XML fragmentation technique whereby resource efficiency in query processing at client could be enhanced. For this, we first present a cost model of query processing over XML fragment stream. Then, we propose an algorithm for resource-efficient XML fragmentation. Through implementation and experiments, we showed that our fragmentation technique outperformed previous techniques both in processing time and memory usage. The contribution of this paper is to have made the techniques of query processing over XML fragment stream more feasible for practical use.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.157-164
• /
• 2006

Since XML is emerging as the de facto standard for exchanging and representation of data on the web, the amount of XML data has rapidly increased. Thus, the need for effective store and retrieval of U data has arisen. Since the existing techniques such as XRel which is an XML storage and management technique using RDBMS simply record the existing all label paths, diverse classes of label path expressions could not be efficiently supported. In this paper, we present a technique which supports storage and retrieval for XML data using RDBMS efficiently compared with the existing approaches. Since the proposed technique keeps the XML path index on the relational database and replace label paths with path identifiers, diverse XML queries can be evaluated compared with existing approaches. Also, the proposed technique does not require the modification of the relational database engine and consumes the disk space less. Our experimental result demonstrates the better query performance compared with existing techniques.

• Journal of the Korea Society for Simulation
• /
• v.26 no.3
• /
• pp.13-22
• /
• 2017

This research proposes and applies a pipelining parallel processing technique to enhance the speed of visualizing the results of real-time simulations. Generally, a simulation with real-time visualization consists of three processes: executing a simulation model, transmitting simulation result, and visualizing simulation result. If we have these processes in serial, the latency from simulation to visualization will be very long, which degrades the speed of visualization of data from real-time simulation. Thus, the main purpose of this research is maximizing performance by adapting pipelining parallel processing technique to the real-time simulation visualization. Also we show that performance is improved by adding multi-threading technique to each process. This paper proposes a theoretical performance model and simulation results of the techniques and then we applied this to an air combat simulation model as a case study. As the result, it shows that the performance is greatly enhanced than the original model's execution time.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.421-427
• /
• 2013

In general, it can be assumed that the tropospheric effect are removed through double-differencing technique in short-baseline GPS data processing. This means that the high-accuracy positioning can be obtained because various error sources can be eliminated and the number of unknown can be decreased in the adjustment computation procedure. As a consequence, short-baseline data processing is widely used in the fields such as deformation monitoring which require precise positioning. However, short-baseline data processing is limited to achieve high positioning accuracy when the height difference between the reference and the rover station is significant. In this study, the effects of tropospheric delays on the determination of short-baseline is analyzed, which depends on the orientation of baseline. The GPS measurements which include tropospheric effect and measurement noises are generated by simulation, and then rover coordinates are computed by short-baseline data processing technique. The residuals of rover coordinates are analyzed to interpret the tropospheric effect on the positioning. The results show that the magnitudes of the biases in the coordinate residuals increase as the baseline length gets longer. The increasing rate is computed as 0.07cm per meter in baseline length. Therefore, the tropospheric effects should be carefully considered in short-baseline data processing when the significant height difference between the reference and rover is observed.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.495-506
• /
• 2001

XML makes it possible for data to be exchanged regradless of the data model in which it is represented or the platform on which it is stored, serving as a standard for data exchange format on the internet. Especially, it is natural to send XML data without DTD on the internet when XML is data-centric. Therefore it is needed to extract relational schema to store XML data efficiently, to optimize queries, and to publish data which have been stored in the relational database in the XML format. In this paper, we proposed a method to generate relational database in the XML documents without DTD and store XML data using upper/lower bound schema extraction technique for semistructured data. In extracting a lower bound schema, we especially show an efficient technique for creating relational schema by using simulation with is more advanced than the datalog method.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.5
• /
• pp.191-199
• /
• 1993

Investigation is given to the detailed procedure of a computer assisted automatic technique for ortho-image generation from digital stereo image data of close-range photographs scanned by the CCD camera scanner. After rectification of geometric scanning errors, the bundle adjustment technique was used to determine the exterior orientation parameters of terrestrial camera. An automatic correlation matching technique was applied to search for the conjugate pixels in digital stereo pairs. And the 3-dimensional coordinates of the corresponding pixels were calculated by the space intersection method. For the generation of ortho-image from the calculated coordinates and right image data values, inverse-weighted-distance average method was used. And the accuracy of the resulting ortho-image was checked by comparing its image coordinates with there corresponding ground coordinates for the check points.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.219-227
• /
• 2012

This paper describes the design and implementation of an efficient image security system for CCTV using the analysis technique of color informations. In conventional approaches, the compression and encryption techniques are mainly used for reducing the data size of the original images while the analysis technique of color information is first proposed, which eliminates the overlapping part of the original image data in our approach. In addition, security-enhanced CCTV image security system is presented using SSL/VPN tunneling technique. When we use the method proposed in this paper, an efficient image processing is enable for a mount of information, and also security problem is enhanced. Through the implementation results, the proposed method showed that the original image information are dramatically reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.7
• /
• pp.553-564
• /
• 1990

The co-efficient matrix of linear second-order partial differential equations in the general form is partitioned with (n-1)x(n-1) submartices and is transformed into the block tridiagonal system. Then the cyclic odd-even reduction technique is applied to this system with the large-grain data granularity and the block cyclic reduction algorithm to solve unknown vectors of this system is created. But this block cyclic reduction technique is not suitable for the parallel processing system because of its parallelism chanigng at every computing stages. So a new algorithm for solving linear second-order partical differential equations is presentes by the block cyclic reduction technique which is modified in order to keep its parallelism constant, and to reduce gteatly its execution time. Both of these algoriths are compared and studied.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2862-2873
• /
• 1998

In the integrated development environments for automatic generation of Java applets and applications tat can be used as Internet and Intranet-based client-server programs, it is essential to interconnect between the function components such as main window, project manager, object inspector, source code editor, and form designer. This paper describes the function components related with the generation of mobile code based client-server program. In then designs and implements a data structure, named 'JCode', for interconnection between the function components. Finally, it discusses the action principles of Two-Way Access technique based on JCode. By applying the proposed JCode based interconnection technique, user can program efficiently using the function components.

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.585-590
• /
• 2004

Many machine failures are not detected well in advance due to the masking of background noise and attenuation of the source signal through the transmission mediums. Advanced signal processing techniques using adaptive filters and higher order statistics have been attempted to extract the source signal from the measured data at the machine surface. In this paper, blind deconvolution using the eigenvector algorithm (EVA) technique is used to recover a damaged bearing signal using only the measured signal at the machine surface. A damaged bearing signal corrupted by noise with varying signal-to-noise (s/n) was used to determine the effectiveness of the technique in detecting an incipient signal and the optimum choice of filter length. The results show that the technique is effective in detecting the source signal with an s/n ratio as low as 0.21, but requires a relatively large filter length.