• Economic and Environmental Geology
• /
• v.48 no.1
• /
• pp.89-101
• /
• 2015

The sour gas is natural gas containing components such as hydrogen sulphide and carbon dioxide that form acids when mixed with water. Element sulfur precipitates from sour gas when reservoir pressure and temperature decrease. According to the International Energy Agency, about 43% of the world's natural gas reserves(2,580 tcf or 73.057 tcm), excluding North America, are sour. The sour gas is often derived from the Germanic word 'sauer or acidic' and the etymology referred to as 'sour'. Sour gas requires special handling and infrastructure because it contains significant amounts of hydrogen sulphide, making it highly corrosive, flammable and explosive, and there fore more costly and dangerous to process. So the business of sour gas is affected by two important factors: the economic value of the gas, and the methods used in its production. According to be analyzed in the academic literature to sour gas(2000~2014) by the program of 'web of science', the research activities 145 papers in sour gas.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.37-48
• /
• 2010

In general, an HTTP server sends information in response to requests from clients. Since it does not support active information delivery to clients, it can not efficiently provide the rapidly changing information to clients. Overcoming this shortcoming of the HTTP protocol, the technology known as server push enables the HTTP server to actively provide information to clients without explicit requests from clients. Adobe BlazeDS is a web server supporting the server push technology, helping users to develop web-based push applications. Unfortunately, since the BlaseDS server have no functions of filtering the information to be pushed according to various types of users, there are difficulties in developing push applications handling various situations in a efficient way. In this paper, to support effective development of push applications on BlazeDS we present the methods of adding a message filtering facility to BlazeDS and utilizing it. According to the filtering request of clients, the message filtering facility modifies information to be pushed, sending the modified information to the clients. The extended BlazeDS server with the message filtering facility provides environments to easily develop push services customized for various clients with their own situations.

• Journal of Life Science
• /
• v.31 no.4
• /
• pp.410-417
• /
• 2021

Next-generation sequencing (NGS) is a high-throughput technique for sequencing large numbers of DNA fragments that are prepared from a genome. This sequencing technique has been used to elucidate whole genome sequences of living organisms and to analyze complementary DNA (cDNA) or chromatin immunoprecipitated DNA (ChIPed DNA) at the genome level. After NGS, the use of proper tools is important for processing and analyzing data with reasonable parameters. However, handling large-scale sequencing data and programing for data analysis can be difficult. The Galaxy platform, a public web service system, provides many different tools for NGS data analysis, and it allows researchers to analyze their data on a web browser with no deep knowledge about bioinformatics and/or programing. In this study, we explain the procedure for preparing chromatin immunoprecipitation-sequencing (ChIP-seq) libraries and steps for analyzing ChIP-seq data using the Galaxy platform. The data analysis steps include the NGS data upload to Galaxy, quality check of the NGS data, premapping processes, read mapping, the post-mapping process, peak-calling and visualization by window view, heatmaps, average profile, and correlation analysis. Analysis of our histone H3K4me1 ChIP-seq data in K562 cells shows that it correlates with public data. Thus, NGS data analysis using the Galaxy platform can provide an easy approach to bioinformatics.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.553-566
• /
• 2004

Some of the current main research areas involving techniques related to XML consist of storing XML documents, optimizing the query, and indexing. As such we may focus on the set of documents that are composed of various structures, but that are not shared with common structure such as the same DTD or XML Schema. In the case, it is essential to analyze structural similarities and differences among many documents. For example, when the documents from the Web or EDMS (Electronic Document Management System) are required to be merged or classified, it is very important to find the common structure for the process of handling documents. In this paper, we transformed sequential pattern mining algorithms(1) to extract maximal similar paths between two XML documents. Experiments with XML documents show that our transformed sequential pattern mining algorithms can exactly find common structures and maximal similar paths between them. For analyzing experimental results, similarity metrics based on maximal similar paths can exactly classify the types of XML documents.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1216-1222
• /
• 2016

The advent of large-scale web services has resulted in gradual increase in the amount of data used in those services. These big data are managed efficiently by DBMS such as MySQL and MariaDB, which use InnoDB engine as their storage engine, since InnoDB guarantees ACID and is suitable for handling large-scale data. To improve I/O performance, InnoDB caches data and index of its database through a buffer pool. It also supports multiple buffer pools to mitigate lock contentions. However, the multiple buffer pool scheme leads to the additional data consistency overhead. In this paper, we analyze the overhead of the multiple buffer pool scheme. In our experimental results, although multiple buffer pool scheme mitigates the lock contention by up to 46.3%, throughput of DMBS is significantly degraded by up to 50.6% due to increased disk I/O and fsync calls.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.195-203
• /
• 2003

With the spread of interment, the digitalization and knowledge-based information are in progress. Specially, numerous users make the various works and use the services on the web. For the most part, these works make use of the XML. The XML shines the reusing of the Documents because it is separated from contents and styles. Also, it can re-define the logic structure of the Document for requirement of the developer. However, the XML document's size is much larger than common text document because it basically handles the document type and adds numerous tags for representing structure of the document. To utilize the limited storage of Palmtop, PDA and so on, it is necessary to compress and handle the documents efficiently. Recently, the compression techniques for efficiently handling and compressing the XML documents are in progress to solve this problem. But the existing research doesn't support the query processing for that. In this paper, we design and implement the XML compression algorithm that compresses the XML document and processes the quay of compressed XML document faster and mote effciently than the previous techniques.

• The Journal of the Korea Contents Association
• /
• v.4 no.1
• /
• pp.90-99
• /
• 2004

With the spread of internet, the digitalization and the knowledge informatization are in progress rapidly. Specially, numerous users make the various works and use the services on the web. For the most part, these works make use of the XML The XML shines the reusing of the documents because it is separated from contents and sues. Also, it can re-define the logic structure of the document for requirement of the developer. However, the XML document’s size is much larger than common text document because it handles the document type and adds numerous tags for representing structure of the document. To utilize the limited storage devices of Palmtop, PDA and so u, it is necessary to compress and handle the documents efficiently. Recently, the compression techniques for efficiently handling and compressing the XML documents are under way to solve this problem. But most of the existing researches don't support the query processing for the compressed XML documents. In this paper, we design and implement the XML compression algorithm that compresses the XML document and Processes the query of compressed XML document faster and more efficiently than previous techniques.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.964-971
• /
• 2003

According to the development of information processing technology and computer hardware, PACS systems have been installed in many hospitals. They can increase the efficiency and the convenience remarkably for handling medical images using digitalized data. After we compare the generation images with other cases, we can read the images correctly and decide how to treat the patients. If the results, included test method and specialist's opinion, are represented dynamically on homepage in hospital. then visitors can get their experience in directly and understand the field of examination and the area of medical treatment. In this thesis, we display the effective images such as MR of the abnormal cases according to parts and diseases, the movie and still images such as Angio image, the other multimedia materials such as the sound and text of doctor's opinions, in SMIL based on XML, concerning the problem of concurrency.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.127-141
• /
• 2014

A Vehicle Tracking System consists of GPS tracking device which fits into the vehicle and captures the GPS location information at regular intervals to a central GIS server, and GIS tracking server providing three major responsibilities: receiving data from the GPS tracking unit, securely storing it, and serving this information on demand of the user. GPS based tracking systems supporting a multi-session processing among RMA, RM, and RCP can make a quick response to various services including other vehicle information between RSU and OBU on demand of the user. In this paper we design RSU lower layers and RCP applications in OBU for a multisession processing simulation and test message processing transactions among RMA-RM and RM-RCP. Furthermore, we implement the additional functions of handling access commands simultaneously on multiple service resources which are appropriate for the experimental testing conditions. In order to make a multi-session processing test, it reads 30 resource data,0002/0001 ~ 0002/0030, in total and then occurs 30 session data transmissions simultaneously. We insert a sequence number field into a special header of dummy data as a corresponding response to check that the messages are received correctly. Thus, we find that GIS service system with a multi-session processing is able to provide additional 30 services in a same speed of screen presentation loading while identifying the number of session processing of Web GIS service, the number of OBU service, and the speed of screen presentation loading by comparing a single session and a multi-session of GIS service system.

• Korean Journal of Cognitive Science
• /
• v.19 no.4
• /
• pp.477-497
• /
• 2008

Mood classification of blog text is an interesting problem, with a potential for a variety of services involving the Web. This paper introduces an approach to mood classification enhancements through the normalized negation n-grams which contain mood clues and corpus-specific term weighting(CSTW). We've done experiments on blog texts with two different classification methods: Enhanced Mood Flow Analysis(EMFA) and Support Vector Machine based Mood Classification(SVMMC). It proves that the normalized negation n-gram method is quite effective in dealing with negations and gave gradual improvements in mood classification with EMF A. From the selection of CSTW, we noticed that the appropriate weighting scheme is important for supporting adequate levels of mood classification performance because it outperforms the result of TF*IDF and TF.