• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1386-1396
• /
• 2009

Most decision support functions of spatial data warehouse rely on the OLAP operations upon a spatial cube. Meanwhile, higher performance is always guaranteed by indexing the cube, which stores huge amount of pre-aggregated information. Hierarchical Dwarf was proposed as a solution, which can be taken as an extension of the Dwarf, a compressed index for cube structures. However, it does not consider the spatial dimension and even aggregates incorrectly if there are redundant values at the lower levels. OLAP-favored Searching was proposed as a spatial hierarchy based OLAP operation, which employs the advantages of R-tree. Although it supports aggregating functions well against specified areas, it ignores the operations on the spatial dimensions. In this paper, an indexing approach, which aims at utilizing the concept hierarchy of the spatial cube for decision support, is proposed. The index consists of concept hierarchy trees of all dimensions, which are linked according to the tuples stored in the fact table. It saves storage cost by preventing identical trees from being created redundantly. Also, it reduces the OLAP operation cost by integrating the spatial and aspatial dimensions in the virtual concept hierarchy.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1385-1398
• /
• 2004

This paper discusses an effective processing of subsequence matching under time warping in time-series databases. Time warping is a trans-formation that enables finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, is on the CPU processing step. Then, we propose a novel method that optimizes the CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations occurring in computing the time warping distance between the query sequence and data subsequences. We formally prove the proposed method does not incur false dismissals and also is the optimal one for processing Naive-Scan. Also, we discuss the we discuss to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the previous methods for processing of subsequence matching under time warping. Then, we quantitatively verify the performance improvement ef-fects obtained by the proposed method via extensive experiments. The result shows that the performance of all the three previous methods im-proves by employing the proposed method. Especially, Naive-Scan, which is known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all cases when it employs the proposed method for CPU processing. This result is so meaningful in that the performance inversion among Nive- Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their perform-ance bottleneck.

• Journal of Convergence for Information Technology
• /
• v.10 no.10
• /
• pp.1-8
• /
• 2020

The need for storage, management, and retrieval techniques for alternative data has emerged as technologies based on data generated from business activities conducted by enterprises have emerged as the key to business success in recent years. Existing big data platform systems must load a large amount of data generated in real time without delay to process unstructured data, which is an alternative data, and efficiently manage storage space by utilizing a deduplication system of different storages when redundant data occurs. In this paper, we propose a multi-layer distributed data deduplication process system using the similarity of the Cuckoo hashing filter technique considering the characteristics of big data. Similarity between virtual machines is applied as Cuckoo hash, individual storage nodes can improve performance with deduplication efficiency, and multi-layer Cuckoo filter is applied to reduce processing time. Experimental results show that the proposed method shortens the processing time by 8.9% and increases the deduplication rate by 10.3%.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.48-58
• /
• 2009

Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.

• Journal of architectural history
• /
• v.12 no.1 s.33
• /
• pp.25-41
• /
• 2003

This paper is a study of Le Corbusier's trace regulateur of the 1920s, particularly its role in the design of the Villas La Roche-Jeanneret and Stein-de Monzie. It proceeds on the basis of the following three themes: first, the relation between the regulating line and the dom-ino frame; second, its status as a proportional device based not on a module system but one that defines relations; third, its function as an essential practical device in the design process. In the Villa La Roche-Jeanneret, the embedded horizontal planes of the dom-ino frame were constant, but the vortical lines of the columns were altered according to the changes in plan. Initially, a left-hand bay window formed a symmetry with the right-hand bay window, the only constant in the design process. With subsequent changes, mullion sections of the horizontal window and roof elements came to provide the reference points for the regulating line. Eventually, a regulating line different from the one that controlled the bay window and the elongated volume came to control the entrance hall of Villa La Roche, resulting in three different kinds of regulating lines in the final version. In contrast to the Villa La Roche-Jeanneret, a singular and consistent regulation line was anticipated in the earliest design stages of the Villa Stein-de Monzie. The repetition of its A:B grid and the standard $2.5m{\times}1.0m$ sliding window determined the proportions of both its plan and elevation, and thus the regulating line became 'automatic,' losing its viability as a practical tool. Though the regulating titles of the La Roche-Jeanneret look as if they were an afterthought, drawn after the design was complete, they were most active, requiring tenacity and discipline in their application. On the other hand, the seemingly 'redundant' regulating line of the Villa Stein-de Monzie gains its raison d'etre from the dom-ino frame. Its cantilevers and uninterrupted horizontal window could be used in decisive fashion because of the guarantee that the correct proportion would always be maintained. Thus we discover that Le Corbusier's discipline of the 1920s had a certain spectrum of flexibility. His 'parti' ranged from the extremely loose and malleable grid of the Villa La Roche-Jeanneret to the fixed grid of the Villa Stein-de Monzie. In different ways, these projects retain the tension between the dom-ino frame and the regulating line. For Le Corbusier, as much as the grid was an object with fixed attributes, it was also an active medium manipulated by the will of the architect.

• Spatial Information Research
• /
• v.9 no.1
• /
• pp.73-89
• /
• 2001

In the recent rapidly changing technology environment the computerization of administration business using GIS is driven or will be driven to give improved information services for the people by local government or central government with huge budget. Development of GIS for local governments is investigated with huge budge. Development of GIS for local governments is investigated to prevent local government from investing redundant money and to reuse the existing investment at this time. The purpose of this study is finding the development method of Land Management Information System (LMIS) to give service and share data in various computing environment of local governments. To do this, we have to develop LMIS as open system with interoperability and we explain it with a focus to framework of Open LMIS. According to recent trend of technology we developed Open LMIS for convenient maintenance with nationwide LMIS expansion at hand. This system was developed at the $\ulcorner$Land Management Information System Development$\lrcorner$project which was managed by Ministry of Construction and Transportation (MOCT). GIS application was based on OpenGIS CORBA specification for development of standard interface and RUP(Rational Unified Process) for development method and LML(Unified Modeling Language) for system design. Developed systems were land administration system for local government, spatial planning support system for regional government, and land policy support system for MOCT.

• Spatial Information Research
• /
• v.19 no.3
• /
• pp.95-106
• /
• 2011

Recently as efficient processing of aggregate queries for fetching desired data from sensors has been recognized as a crucial part, in-network aggregate query processing techniques are studied intensively in wireless sensor networks. Existing representative in-network aggregate query processing techniques propose routing algorithms and data structures for processing aggregate queries. However, these aggregate query processing techniques have problems such as high energy consumption in sensor nodes, low accuracy of query processing results, and long query processing time. In order to solve these problems and to enhance the efficiency of aggregate query processing in wireless sensor networks, this paper proposes Bucket-based Parallel Aggregation(BPA). BPA divides a query region into several cells according to the distribution of sensor nodes and builds a Quad-tree, and then processes aggregate queries in parallel for each cell region according to routing. And it sends data in duplicate by removing redundant data, which, in turn, enhances the accuracy of query processing results. Also, BPA uses a bucket-based data structure in aggregate query processing, and divides and conquers the bucket data structure adaptively according to the number of data in the bucket. In addition, BPA compresses data in order to reduce the size of data in the bucket and performs data transmission filtering when each sensor node sends data. Finally, in this paper, we prove its superiority through various experiments using sensor data.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.51-59
• /
• 1993

This paper develops practical and realistic reliability models and methods for the evaluation of system-reliability and system reliability-based rating of various types of box-girder bridge superstructures. The strength limit state model for box-girder bridges suggested in the paper are based on not only the basic flexural strength but also the strength interaction equations which simultaneously take into account flexure, shear and torsion. And the system reliability problem of box-girder superstructure is formulated as parallel-series models obtained from the FMA(Failure Mode Approach) based on major failure mechanisms or critical failure states of each girder. In the paper, an improved IST(Importance Sampling Technique) simulation algorithm is used for the system reliability analysis of the proposed models. This paper proposes a practical but rational approach for the evaluation of capacity rating in terms of the equivalent system-capacity rating corresponding to the estimated system-reliability index which is derived based on the concept of the equivalent FOSM(First Order Second Moment) form of system reliability index. The results of the reliability evaluation and rating of existing bridges indicate that the reserved reliability and capacity rating at system level are significantly different from those of element reliability or conventional methods especially in the case of highly redundant box-girder bridges.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.13-23
• /
• 2007

Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

• The Journal of Society for e-Business Studies
• /
• v.24 no.4
• /
• pp.49-78
• /
• 2019

In the context of knowledge sharing, network position has been a controversial subject. A central position in the network provides access to non-redundant knowledge, leading to more opportunities of knowledge sharing. On the other hand, as "bridging" relationships, its characteristics as a "weak tie" suggest innate lack of trust and reciprocity which is considered an impediment to share knowledge. This paper attempts to enlighten the underlying dynamic by examining the interaction between network centrality, motivation and ability in knowledge sharing. Furthermore, this paper examines the concept of knowledge sharing ability in depth by operationalizing the construct into three aspects: extensive and diverse knowledge, social media utilization ability and self-efficacy. The results show a partially supported three-way interaction, where the highest level of knowledge provision is reported when the employee has low network centrality, high autonomous motivation and high knowledge sharing ability, i.e. extensive and diverse prior knowledge. Though all models indicate strong associations between network centrality and knowledge sharing, this suggests an even greater power of motivation and ability that gives the strength to overcome unfavorable environments of peripheral position. Therefore, this paper offers an alternative explanation to the existing debate whether network centrality positively or negatively influences knowledge sharing.