• Journal of Distribution Science
• /
• v.14 no.12
• /
• pp.107-118
• /
• 2016

Purpose - In today's markets, new technologies such as social network systems and user generated contents have provided consumers with access to unlimited amounts of information and an ability to communicate with other consumers in the world. Specially, the massive of the internet and the development of online communities and interactive platforms offer the potential to cocreate with a large number of consumers. Significant changes in marketplace suggest that simply being consumer oriented is not enough, so firms must learn from and collaborate with consumers to create values that meet their individual and dynamic needs. In these sense, emergent perspectives in marketing highlight new opportunities for co-opting consumers as a means to define and cocreate value through their engagement. Although the importance of consumer co-creation with firms, the current literature lacks the respond to two questions: (1) who are the most competent consumers for creating the values with firm? and (2) what are the stimulaters to help the consumers engage for co-creation? To this answer the question, this research investigate how to structure consumer motivations to encourage consumers to be more engaged for co-creation and what drives a consumer to get involved to respond to a call for co-creation. Research design, data, and methodology - To empirically test the hypotheses, a survey was conducted among consumers who had experienced the co-creation including upstream, downstream, autonomous, and sponsored co-creation with the firms. We collected a total of 343 responses. After we excluded 37 questionnaire because of incomplete responses, a total of 306 questionnaire remained. Working with a sample of 306 responses in Seoul and Kwangju, hierarchical moderated regression is employed to test research hypotheses. Results - The results indicated that consumer creativity and emergent nature are positively related to engagement in co-creation including upstream, downstream, autonomous, and sponsored co-creation. Also, the relationships between consumer creativity/emergent nature and engagement in co-creation were moderated by intrinsic motivation in case of upstream and downstream co-creation. Finally, interaction effects between consumer creativity/emergent nature and extrinsic motivation were not significant. Conclusions - These results suggest that marketing managers have to consider the consumer personality such as creativity and emergent nature and stimulate the intrinsic motivation of consumer to achieve the co-creation project successfully.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1421-1434
• /
• 2006

Spatial data warehouses provide analytical information for decision supports using SOLAP (Spatial On-Line Analytical Processing) operations. Many researches have been studied to reduce analysis cost of SOLAP operations using pre-aggregation methods. These methods use the index composed of fixed size nodes for supporting the concept hierarchy. Therefore, these methods have many unused entries in sparse data area. Also, it is impossible to support the concept hierarchy in dense data area. In this paper, we propose a dynamic pre-aggregation index method based on the spatial hierarchy. The proposed method uses the level of the index for supporting the concept hierarchy. In sparse data area, if sibling nodes have a few used entries, those entries are integrated in a node and the parent entries share the node. In dense data area, if a node has many objects, the node is connected with linked list of several nodes and data is stored in linked nodes. Therefore, the proposed method saves the space of unused entries by integrating nodes. Moreover it can support the concept hierarchy because a node is not divided by linked nodes. Experimental result shows that the proposed method saves both space and aggregation search cost with the similar building cost of other methods.

• Journal of Cadastre & Land InformatiX
• /
• v.47 no.2
• /
• pp.79-90
• /
• 2017

Urban environment represent one of the most dynamic regions on earth. As in other countries, forests, green areas, agricultural lands are rapidly changing into residential or industrial areas in South Korea. Monitoring such rapid changes in land use requires rapid data acquisition, and satellite imagery can be an effective method to this demand. In general, SAR(Synthetic Aperture Radar) satellites acquire images with an active system, so the brightness of the image is determined by the surface roughness. Therefore, the water areas appears dark due to low reflection intensity, In the residential area where the artificial structures are distributed, the brightness value is higher than other areas due to the strong reflection intensity. If we use these characteristics of SAR images, settlement areas can be extracted efficiently. In this study, extraction of settlement areas was performed using TerraSAR-X of German high-resolution X-band SAR satellite and KOMPSAT-5 of South Korea, and object-oriented image classification method using the image segmentation technique is applied for extraction. In addition, to improve the accuracy of image segmentation, the speckle divergence was first calculated to adjust the reflection intensity of settlement areas. In order to evaluate the accuracy of the two satellite images, settlement areas are classified by applying a pixel-based K-means image classification method. As a result, in the case of TerraSAR-X, the accuracy of the object-oriented image classification technique was 88.5%, that of the pixel-based image classification was 75.9%, and that of KOMPSAT-5 was 87.3% and 74.4%, respectively.

• Journal of Cadastre & Land InformatiX
• /
• v.47 no.2
• /
• pp.159-174
• /
• 2017

The long-term imbalances between supply and demand in office market can weaken urban growth since excessive supply of offices led to office market instability and excessive demand of offices weakens growth of urban industry. Recently, there have been a lot of new large-scale supplies, which increased volatility in Seoul office market. Nevertheless, new supply of Seoul office has not been fully examined. Given this, the focus of this article was on confirming the influences of profitability, replacement cost, and demand on new office supplies in Seoul. In examining those influences, another focus was on their relative influences over time. For these purposes, we analyzed quarterly data of Seoul office market between 2003 and 2015 using a vector error correction model (VECM). As a result, in terms of the influences on the current new supply, the impact of supply before the first quarter was negative, while that of office employment before the first quarter was positive. Also, that of interest rate before the second quarter was positive, while those of cap rate before the first quarter and cap rate before the second quarter were negative. Based on the findings, it is suggested that prediction models on Seoul offices need to be developed considering the influences of profitability, replacement cost, and demand on new office supplies in Seoul.

• The KIPS Transactions:PartD
• /
• v.13D no.6 s.109
• /
• pp.839-846
• /
• 2006

Context-aware adaptive service for overcoming the limitations of wireless devices and maintaining adequate service levels in changing environments is becoming an important issue. However, most existing studies concentrate on an adaptation module on the client, proxy, or server. These existing studies thus suffer from the problem of having the workload concentrated on a single system when the number of users increases md, and as a result, increases the response time to a user's request. Therefore, in this paper the adaptation module is dispersed and arranged over the client, proxy, and server. The module monitors the contort of the system and creates a proposition as to the dispersed adaptation system in which the most adequate system for conducting operations. Through this method faster adaptation work will be made possible even when the numbers of users increase, and more stable system operation is made possible as the workload is divided. In order to evaluate the proposed system, a prototype is constructed and dispersed operations are tested using multimedia based learning content, simulating server overload and compared the response times and system stability with the existing server based adaptation method. The effectiveness of the system is confirmed through this results.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.349-356
• /
• 2005

Artificial Organism-used application areas are expanding at a break-neck speed with a view to getting things done in a dynamic and Informal environment. A use of general programming or traditional hi methods as the representation of Artificial Organism behavior knowledge in these areas can cause problems related to frequent modifications and bad response in an unpredictable situation. Strategies aimed at solving these problems in a machine-learning fashion includes Genetic Programming and Evolving Neural Networks. But the learning method of Artificial-Organism is not good yet, and can't represent life in the environment. With this in mind, this research is designed to come up with a new behavior evolution model. The model represents behavior knowledge with Classification Rules and Enhanced Backpropation Neural Networks and discriminate the denomination. To evaluate the model, the researcher applied it to problems with the competition of Artificial-Organism in the Simulator and compared with other system. The survey shows that the model prevails in terms of the speed and Qualify of learning. The model is characterized by the simultaneous learning of classification rules and neural networks represented on chromosomes with the help of Genetic Algorithm and the consolidation of learning ability caused by the hybrid processing of the classification rules and Enhanced Backpropagation Neural Network.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.1003-1012
• /
• 2005

The most significant difference of embedded systems from general purpose systems is that embedded systems are allowed to use only limited resources including battery and memory. Especially, the number of applications increases which deal with multimedia data. In those systems with high data computations, the delay of memory access is one of the major bottlenecks hurting the system performance. As a result, many researchers have investigated various techniques to reduce the memory access cost. Most programs generally have locality in memory references. Temporal locality of references means that a resource accessed at one point will be used again in the near future. Spatial locality of references is that likelihood of using a resource gets higher if resources near it were just accessed. The latest embedded processors usually adapt cache memory to exploit these two types of localities. Processors access faster cache memory than off-chip memory, reducing the latency. In this paper we will propose the enhanced dynamic allocation technique for structure-type data in order to eliminate unused memory space and to reduce both the cache miss rate and the application execution time. The proposed approach aggregates fields from multiple records dynamically allocated and consecutively remaps them on the memory space. Experiments on Olden benchmarks show $13.9\%$ L1 cache miss rate drop and $15.9\%$ L2 cache miss drop on average, compared to the previously proposed techniques. We also find execution time reduced by $10.9\%$ on average, compared to the previous work.

• Journal of KIISE:Databases
• /
• v.29 no.3
• /
• pp.180-192
• /
• 2002

We investigate the effect of the data skew of join attributes on the performance of a pipelined multi-way hash join method, and propose two new harsh join methods in the shared-nothing multiprocessor environment. The first proposed method allocates buckets statically by round-robin fashion, and the second one allocates buckets dynamically via a frequency distribution. Using harsh-based joins, multiple joins can be pipelined to that the early results from a join, before the whole join is completed, are sent to the next join processing without staying in disks. Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. However, this hardware structure is very sensitive to the data skew. Unless the pipelining execution of multiple hash joins includes some dynamic load balancing mechanism, the skew effect can severely deteriorate the system performance. In this parer, we derive an execution model of the pipeline segment and a cost model, and develop a simulator for the study. As shown by our simulation with a wide range of parameters, join selectivities and sizes of relations deteriorate the system performance as the degree of data skew is larger. But the proposed method using a large number of buckets and a tuning technique can offer substantial robustness against a wide range of skew conditions.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.431-446
• /
• 2007

Executable composite Web services are selected by binding a given abstract workflow with the specific Web services that satisfy given QoS requirements. Considering the rapidly increasing number of Web services and their highly dynamic QoS environment, the fast selection of composite services is important. This paper presents a method for quality driven comosite Web services selection based on a workflow partition strategy. The proposed method partitions an abstract workflow into two sub-workflows to decrease the number of candidate services that should be considered. The QoS requirement is also decomposed for each partitioned workflow. Since the decomposition of a QoS requirement is based on heuristics, the selection might fail to find composite Web services. To avoid such a failure, the tightness of a QoS requirement is defined and a workflow is determined to be partitioned according to the tightness. A mixed integer linear programming is utilized for the efficient service selection. Experimental results show that the success rate of partitioning is above 99%. Particularly, the proposed method performs faster and selects composite services whose qualities are not significantly different (less than 5%) from the optimal one.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.