• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.6
• /
• pp.309-314
• /
• 2017

In general, there are many difficulties in collecting, storing, and analyzing SNS (social network service) data, since those data have big data characteristics, which occurs very fast with the mixture form of structured and unstructured data. In this paper, we propose a new data visualization framework that works on Apache Storm, and it can be useful for real-time and dynamic analysis of SNS data. Apache Storm is a representative big data software platform that processes and analyzes real-time streaming data in the distributed environment. Using Storm, in this paper we collect and aggregate the real-time Twitter data and dynamically visualize the aggregated results through the tag cloud. In addition to Storm-based collection and aggregation functionalities, we also design and implement a Web interface that a user gives his/her interesting keywords and confirms the visualization result of tag cloud related to the given keywords. We finally empirically show that this study makes users be able to intuitively figure out the change of the interested subject on SNS data and the visualized results be applied to many other services such as thematic trend analysis, product recommendation, and customer needs identification.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.481-494
• /
• 2008

In this paper we propose Fourier magnitudes based privacy preserving clustering on time-series data. The previous privacy-preserving method, called DFT coefficient method, has a critical problem in privacy-preservation itself since the original time-series data may be reconstructed from privacy-preserved data. In contrast, the proposed DFT magnitude method has an excellent characteristic that reconstructing the original data is almost impossible since it uses only DFT magnitudes except DFT phases. In this paper, we first explain why the reconstruction is easy in the DFT coefficient method, and why it is difficult in the DFT magnitude method. We then propose a notion of distance-order preservation which can be used both in estimating clustering accuracy and in selecting DFT magnitudes. Degree of distance-order preservation means how many time-series preserve their relative distance orders before and after privacy-preserving. Using this degree of distance-order preservation we present greedy strategies for selecting magnitudes in the DFT magnitude method. That is, those greedy strategies select DFT magnitudes to maximize the degree of distance-order preservation, and eventually we can achieve the relatively high clustering accuracy in the DFT magnitude method. Finally, we empirically show that the degree of distance-order preservation is an excellent measure that well reflects the clustering accuracy. In addition, experimental results show that our greedy strategies of the DFT magnitude method are comparable with the DFT coefficient method in the clustering accuracy. These results indicate that, compared with the DFT coefficient method, our DFT magnitude method provides the excellent degree of privacy-preservation as well as the comparable clustering accuracy.

• Journal of Life Science
• /
• v.30 no.4
• /
• pp.394-401
• /
• 2020

As embryonic stem cells become pluripotent, they may cause tumor development when injected into a host. Therefore, researchers are focusing heavily on the therapeutic potential of tissue-specific stem cells (adult stem cells) without resultant tumor formation. Adult stem cells can proliferate for a limited number of generations and are restricted to certain cell types (multipotent). Mature tissue cell types in mammals cannot be intrinsically dedifferentiated or transdifferentiated to adult stem cells. Hence, the technology of induced pluripotent stem cells (iPSCs) for reprogramming adult somatic cells was introduced in 2006, ushering in a new era in adult stem cell research. Although iPSCs have been widely used in the field, the approach has several limitations: instability of the reprogramming process, risk of incomplete reprogramming, and exposure to transgenes integrated into the cell genome. Two years before the introduction of the iPSC technique, the synthetic small molecule 2,6-disubstituted purine, called reversine, was introduced. Reversine can induce the dedifferentiation of committed cells into multipotent progenitor-type cells by reprogramming and converting adult cells to other cell types under appropriate stimuli. Thus, it can be used as a chemically induced multipotent cell agent to overcome the limitations of iPSCs. Also, as an alternative therapeutic approach for treating obesity, it can be used to generate beige cells by browning white adipocytes. While reversine has the potential to act as an anti-cancer agent, this review focuses on its role in differentiation, dedifferentiation, and transdifferentiation in somatic cells.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.38 no.1
• /
• pp.12-24
• /
• 2010

The purpose of this study was to analyze design characteristics of Korean War Memorials(KWM) in the United States(KWMUS). Through site survey and internet searching, the researcher selected 25 KWMUS and analyzed four analysis categories: design concept, spatial form, landscape details, and sculptures. The results are as follows: 1. The analysis revealed that main concepts of KWMUS were to cherish victims of the Korean War, show membership/locality/patriotism, express feelings and the meaning of war, and explain the Korean War realistically and symbolically. 2. Most KWMUS in memorial parks and plazas were designed to pursue the completion of each memorial assuming the form of typical and symmetrical circles and squares. Also, spatial order including spatial sequence was seen in some of KWMUS. 3. Stone walls, stone monument, flags, emblems and paving were used as main landscape details. The map of the Korean peninsula and Taegeuk were often introduced to symbolize Korea and the Korean War, and the symbolic phrase, 'Forgotten War' or 'Freedom is Not Free' were written on the stone to keep the Korean War in the minds of Americans. 4. Sculptures were used as important media to represent the Korean War in a variety of ways. Most of them were formed realistically, except for a few sculptures that aimed to represent the Korean War symbolically and narratively. In particular, the sculptures in Washington D.C. KWVM and Minnesota KWM were remarkable as symbolic media of war memorials in contemporary society. Further study will be required to analyze comparatively KWM in Korea and the U.S. and to understand characteristics of KWM in the point of design style.

• The KIPS Transactions:PartD
• /
• v.14D no.2
• /
• pp.157-168
• /
• 2007

For effective analyses in various business applications, OLAP(On-Line Analytical Processing) systems represent the multidimensional data as the horizontal format of tables whose columns are corresponding to values of dimension attributes. Because the traditional RDBMSs have the limitation on the maximum number of attributes in table columns(MS SQLServer and Oracle permit each table to have up to 1,024 columns), horizontal tables cannot be directly stored into relational database systems. In this paper, we propose various efficient optimization strategies in transforming horizontal queries to equivalent vertical queries. To achieve this goral, we first store a horizontal table using an equivalent vertical table, and then develop various query transformation rules for horizontal table queries using the PIVOT operator. In particular, we propose various alternative query transformation rules for the basic relational operators, selection, projection, and join. Here, we note that the transformed queries can be executed in several ways, and their execution times will differ from each other. Thus, we propose various optimization strategies that transform the horizontal queries to the equivalent vertical queries when using the PIVOT operator. Finally, we evaluate these methods through extensive experiments and identify the optimal transformation strategy when using the PIVOT operator.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Archives of design research
• /
• v.19 no.2 s.64
• /
• pp.121-128
• /
• 2006

The elements to enhance preference in symbol design are mainly related to consumers' response and aesthetic elements. Because certain aesthetic elements in design affect consumers' response and it is actually presented through (the different level of) preference. This study through surveying case studies examines whether a certain aesthetic element in symbol design gives rise to much preference. According to the result of study, high preference in symbolic design depends on high level of Rhythm, Balance, Harmony, Elaboration, Round, Gestalt, Organic, and Artificial/Natural among aesthetic elements. In comparison, it is founded that Simplicity/complexity, Objective/Abstract, depth, and symmetry should be designed at the moderate level, and proportion, repetition of elements be at the low level. Additionally(or Besides) this study makes out that symbol design cases with high preference have shapes from natural material or patterns of traditional culture, while cases with low preference have shapes from geometric figures. On the basis of these results, a guideline of symbol design could De offered(or suggested) to fit preference of consumers. But, this study is mostly concerned with only affect among emotional reactions of consumer in a scope of study, and is considered only in the aspect of form excluding color and texture.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.247-261
• /
• 2002

Aggregation is an important operation that affects the performance of OLAP systems. In this paper we define a new class of aggregation queries, called range-groupby queries, and present a method for processing them. A range-groupby query is defined as a query that, for an arbitrarily specified region of an n-dimensional cube, computes aggregations for each combination of values of the grouping attributes. Range-groupby queries are used very frequently in analyzing information in MOLAP since they allow us to summarize various trends in an arbitrarily specified subregion of the domain space. In MOLAP applications, in order to improve the performance of query processing, a method of maintaining precomputed aggregation results, called the prefix-sum array, is widely used. For the case of range-groupby queries, however, maintaining precomputed aggregation results for each combination of the grouping attributes incurs enormous storage overhead. Here, we propose a fast algorithm that can compute range-groupby queries with minimal storage overhead. Our algorithm maintains only one prefix-sum away and still effectively processes range-groupby queries for all possible combinations of the grouping attributes. Compared with the method that maintains a prefix-sum array for each combination of the grouping attributes in an n-dimensional cube, our algorithm reduces the space overhead by (equation omitted), while accessing a similar number of cells.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.688-701
• /
• 2001

Web caching has become an important problem addressing the performance issues in web applications. In this paper we propose a method that enhances the performance of web caching by incorporating the expiration time of web data we introduce the notion of the effective reference probability that incorporates the effect of expiration time into the reference probability used in the existing cache replacement algorithms .We formally define the effective reference probability and derive it theoretically using a probabilistic model. By simply replacing probabilities with the effective reference probability in the existing cache replacement algorithms we can take the effect of expiration time into account The results of performance evaluation through experiments show that the replacement algorithms using the effective reference probability always outperform the existing ones. The reason is that the proposed method precisely reflects the theoretical probability of getting the cache effect, and thus, incorporates the influence of the expiration time more effectively. In particular when the cache fraction is 0.05 and data update is comparatively frequent (i.e. the update frequency is more than 1/0 of the reference frequency) the performance enhancement is more than 30% in LRU-2 and 13% in Aggarwal's method (PSS integrating a refresh overhead factor) The results show that effective reference probability contributes significantly to the performance enhancement of the web cache in the presence of expiration time.

• Journal of Conservation Science
• /
• v.37 no.5
• /
• pp.411-425
• /
• 2021

The Stupa of State Preceptor Jigwang from Beopcheonsa Temple Site in Wonju (National Treasure) is a representative stupa of the Goryeo Dynasty, with outstanding Buddhist carvings and splendid patterns, clearly indicating its honoree and year of construction. However, it was destroyed by bombing during the Korean War (1950-1953) and repaired and restored with cement and reinforcing bars in 1957. The surface condition of the original stone shows long-term deterioration due to the m ortar used in past restorations. In order to identify the exact causes of deterioration, the m ortar and surface contaminants on the original stone were analyzed. Portlandite, calcite, ettringite, and gypsum from the mortar were identified, and its ongoing deterioration was observed through pH measurements and the neutralization reaction test. Analysis of surface contaminants identified calcite and gypsum, both poorly water-soluble substances, and their growth in volume among rock-forming minerals was observed by microscopy. Based on those results, semi-quantitative analysis of Ca and S contents significantly influencing the formation of salt crystals was conducted using P-XRF to analyze the basis of surface deterioration, and cross-validation was performed by comparing the body stone affected by the mortar and the upper stylobate stone unaffected by the mortar. Results indicate that the elements are directly involved in the surface deterioration of the body stone.