• 제목/요약/키워드: ubiquitous business model

Search Result 135, Processing Time 0.018 seconds

The Effect of the Context Awareness Value on the Smartphone Adopter' Advertising Attitude (스마트폰광고 이용자의 광고태도에 영향을 미치는 상황인지가치에 관한 연구)

  • Yang, Chang-Gyu;Lee, Eui-Bang;Huang, Yunchu
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.3
    • /
    • pp.73-91
    • /
    • 2013
  • Advertising market has been facing new challenges due to dramatic change in advertising channels and the advent of innovative media such as mobile devices. Recent research related to mobile devices is mainly focused on the fact that mobile devices could identify users'physical location in real-time, and this sheds light on how location-based technology is utilized to achieve competitive advantage in advertising market. With the introduction of smartphone, the functionality of smartphone has become much more diverse and context awareness is one of the areas that require further study. This work analyses the influence of context awareness value resulted from the transformation of advertising channel in mobile communication market, and our research result reflects recent trend in advertising market environment which is not considered in previous studies. Many constructs has intensively been studied in the context of advertising channel in traditional marketing environment, and entertainment, irritation and information are considered to be the most widely accepted variables that has positive relationship with advertising value. Also, in smartphone advertisement, four main dimensions of context awareness value are recognized: identification, activity, timing and location. In this study, we assume that these four constructs has positive relationship with context awareness value. Finally, we propose that advertising value and context awareness value positively influence smartphone advertising attitude. Partial Least Squares (PLS) structural model is used in our theoretical research model to test proposed hypotheses. A well designed survey is conducted for college students in Korea, and reliability, convergent validity and discriminant validity of constructs and measurement indicators are carefully evaluated and the results show that reliability and validity are confirmed according to predefined statistical criteria. Goodness-of-fit of our research model is also supported. In summary, the results collectively suggest good measurement properties for the proposed research model. The research outcomes are as follows. First, information has positive impact on advertising value while entertainment and irritation have no significant impact. Information, entertainment and irritation together account for 38.8% of advertising value. Second, along with the change in advertising market due to the advent of smartphone, activity, timing and location have positive impact on context awareness value while identification has no significant impact. In addition, identification, activity, location and time together account for 46.3% of context awareness value. Third, advertising value and context awareness value both positively influence smartphone advertising attitude, and these two constructs explain 31.7% of the variability of smartphone advertising attitude. The theoretical implication of our research is as follows. First, the influence of entertainment and irritation is reduced which are known to be crucial factors according to previous studies related to advertising value, while the influence of information is increased. It indicates that smartphone users are not likely interested in entertaining effect of smartphone advertisement, and are insensitive to the inconvenience due to smartphone advertisement. Second, in today' ubiquitous computing environment, it is effective to provide differentiated advertising service by utilizing smartphone users'context awareness values such as identification, activity, timing and location in order to achieve competitive business advantage in advertising market. For practical implications, enterprises should provide valuable and useful information that might attract smartphone users by adopting differentiation strategy as smartphone users are sensitive to the information provided via smartphone. Also enterprises not only provide useful information but also recognize and utilize smarphone users' unique characteristics and behaviors by increasing context awareness values. In summary, our result implies that smartphone advertisement should be optimized by considering the needed information of smartphone users in order to maximize advertisement effect.

A Research on types of DMB advertising according to features of DMB Media (DMB의 미디어와 기술 특성에 따른 DMB광고 유형과 종류에 관한 연구)

  • Ahn, Jong-Bae
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.3 no.4
    • /
    • pp.59-88
    • /
    • 2008
  • For the success of the DMB market to meet consumers' demands for Ubiquitous Media and strengthen the nation's competitiveness, it's inevitable for us to activate DMB advertising as of main profit source for DMB Media, and to develop various types of DMB advertising which are linked to the profit model. So I'd like to look over the various types of DMB advertising which are suitable for DMB features as one of the efforts to activate DMB advertising. First of all, I've figured out what kinds of advertising are available for new media and which related technologies are required for DMB media. Through this research, I could find out what features of new media such as cable broadcasting, Internet and Mobile have become the source of developing various types of advertising and how to a great part to activate new media advertising markets by making the best use of their media features. This research also shows that DMB advertising has the high potential to be developed in various and effective types and kinds of advertising with its media feature and technological feature. This research observing DMB advertising cases showed that DMB advertising can be divided into 6 types such as forms, purposes, techniques, advertising positions, the use of LBS(Location Based Service), coupons and it could be developed into various kinds of DMB advertising dependent on each type. On the other hands, it would be great to have continual researches and follow-ups for various types of DMB advertising and the verification of the effectiveness for DMB advertising by performing potential DMB advertising.

  • PDF

Intelligent Optimal Route Planning Based on Context Awareness (상황인식 기반 지능형 최적 경로계획)

  • Lee, Hyun-Jung;Chang, Yong-Sik
    • Asia pacific journal of information systems
    • /
    • v.19 no.2
    • /
    • pp.117-137
    • /
    • 2009
  • Recently, intelligent traffic information systems have enabled people to forecast traffic conditions before hitting the road. These convenient systems operate on the basis of data reflecting current road and traffic conditions as well as distance-based data between locations. Thanks to the rapid development of ubiquitous computing, tremendous context data have become readily available making vehicle route planning easier than ever. Previous research in relation to optimization of vehicle route planning merely focused on finding the optimal distance between locations. Contexts reflecting the road and traffic conditions were then not seriously treated as a way to resolve the optimal routing problems based on distance-based route planning, because this kind of information does not have much significant impact on traffic routing until a a complex traffic situation arises. Further, it was also not easy to take into full account the traffic contexts for resolving optimal routing problems because predicting the dynamic traffic situations was regarded a daunting task. However, with rapid increase in traffic complexity the importance of developing contexts reflecting data related to moving costs has emerged. Hence, this research proposes a framework designed to resolve an optimal route planning problem by taking full account of additional moving cost such as road traffic cost and weather cost, among others. Recent technological development particularly in the ubiquitous computing environment has facilitated the collection of such data. This framework is based on the contexts of time, traffic, and environment, which addresses the following issues. First, we clarify and classify the diverse contexts that affect a vehicle's velocity and estimates the optimization of moving cost based on dynamic programming that accounts for the context cost according to the variance of contexts. Second, the velocity reduction rate is applied to find the optimal route (shortest path) using the context data on the current traffic condition. The velocity reduction rate infers to the degree of possible velocity including moving vehicles' considerable road and traffic contexts, indicating the statistical or experimental data. Knowledge generated in this papercan be referenced by several organizations which deal with road and traffic data. Third, in experimentation, we evaluate the effectiveness of the proposed context-based optimal route (shortest path) between locations by comparing it to the previously used distance-based shortest path. A vehicles' optimal route might change due to its diverse velocity caused by unexpected but potential dynamic situations depending on the road condition. This study includes such context variables as 'road congestion', 'work', 'accident', and 'weather' which can alter the traffic condition. The contexts can affect moving vehicle's velocity on the road. Since these context variables except for 'weather' are related to road conditions, relevant data were provided by the Korea Expressway Corporation. The 'weather'-related data were attained from the Korea Meteorological Administration. The aware contexts are classified contexts causing reduction of vehicles' velocity which determines the velocity reduction rate. To find the optimal route (shortest path), we introduced the velocity reduction rate in the context for calculating a vehicle's velocity reflecting composite contexts when one event synchronizes with another. We then proposed a context-based optimal route (shortest path) algorithm based on the dynamic programming. The algorithm is composed of three steps. In the first initialization step, departure and destination locations are given, and the path step is initialized as 0. In the second step, moving costs including composite contexts into account between locations on path are estimated using the velocity reduction rate by context as increasing path steps. In the third step, the optimal route (shortest path) is retrieved through back-tracking. In the provided research model, we designed a framework to account for context awareness, moving cost estimation (taking both composite and single contexts into account), and optimal route (shortest path) algorithm (based on dynamic programming). Through illustrative experimentation using the Wilcoxon signed rank test, we proved that context-based route planning is much more effective than distance-based route planning., In addition, we found that the optimal solution (shortest paths) through the distance-based route planning might not be optimized in real situation because road condition is very dynamic and unpredictable while affecting most vehicles' moving costs. For further study, while more information is needed for a more accurate estimation of moving vehicles' costs, this study still stands viable in the applications to reduce moving costs by effective route planning. For instance, it could be applied to deliverers' decision making to enhance their decision satisfaction when they meet unpredictable dynamic situations in moving vehicles on the road. Overall, we conclude that taking into account the contexts as a part of costs is a meaningful and sensible approach to in resolving the optimal route problem.

Context Prediction Using Right and Wrong Patterns to Improve Sequential Matching Performance for More Accurate Dynamic Context-Aware Recommendation (보다 정확한 동적 상황인식 추천을 위해 정확 및 오류 패턴을 활용하여 순차적 매칭 성능이 개선된 상황 예측 방법)

  • Kwon, Oh-Byung
    • Asia pacific journal of information systems
    • /
    • v.19 no.3
    • /
    • pp.51-67
    • /
    • 2009
  • Developing an agile recommender system for nomadic users has been regarded as a promising application in mobile and ubiquitous settings. To increase the quality of personalized recommendation in terms of accuracy and elapsed time, estimating future context of the user in a correct way is highly crucial. Traditionally, time series analysis and Makovian process have been adopted for such forecasting. However, these methods are not adequate in predicting context data, only because most of context data are represented as nominal scale. To resolve these limitations, the alignment-prediction algorithm has been suggested for context prediction, especially for future context from the low-level context. Recently, an ontological approach has been proposed for guided context prediction without context history. However, due to variety of context information, acquiring sufficient context prediction knowledge a priori is not easy in most of service domains. Hence, the purpose of this paper is to propose a novel context prediction methodology, which does not require a priori knowledge, and to increase accuracy and decrease elapsed time for service response. To do so, we have newly developed pattern-based context prediction approach. First of ail, a set of individual rules is derived from each context attribute using context history. Then a pattern consisted of results from reasoning individual rules, is developed for pattern learning. If at least one context property matches, say R, then regard the pattern as right. If the pattern is new, add right pattern, set the value of mismatched properties = 0, freq = 1 and w(R, 1). Otherwise, increase the frequency of the matched right pattern by 1 and then set w(R,freq). After finishing training, if the frequency is greater than a threshold value, then save the right pattern in knowledge base. On the other hand, if at least one context property matches, say W, then regard the pattern as wrong. If the pattern is new, modify the result into wrong answer, add right pattern, and set frequency to 1 and w(W, 1). Or, increase the matched wrong pattern's frequency by 1 and then set w(W, freq). After finishing training, if the frequency value is greater than a threshold level, then save the wrong pattern on the knowledge basis. Then, context prediction is performed with combinatorial rules as follows: first, identify current context. Second, find matched patterns from right patterns. If there is no pattern matched, then find a matching pattern from wrong patterns. If a matching pattern is not found, then choose one context property whose predictability is higher than that of any other properties. To show the feasibility of the methodology proposed in this paper, we collected actual context history from the travelers who had visited the largest amusement park in Korea. As a result, 400 context records were collected in 2009. Then we randomly selected 70% of the records as training data. The rest were selected as testing data. To examine the performance of the methodology, prediction accuracy and elapsed time were chosen as measures. We compared the performance with case-based reasoning and voting methods. Through a simulation test, we conclude that our methodology is clearly better than CBR and voting methods in terms of accuracy and elapsed time. This shows that the methodology is relatively valid and scalable. As a second round of the experiment, we compared a full model to a partial model. A full model indicates that right and wrong patterns are used for reasoning the future context. On the other hand, a partial model means that the reasoning is performed only with right patterns, which is generally adopted in the legacy alignment-prediction method. It turned out that a full model is better than a partial model in terms of the accuracy while partial model is better when considering elapsed time. As a last experiment, we took into our consideration potential privacy problems that might arise among the users. To mediate such concern, we excluded such context properties as date of tour and user profiles such as gender and age. The outcome shows that preserving privacy is endurable. Contributions of this paper are as follows: First, academically, we have improved sequential matching methods to predict accuracy and service time by considering individual rules of each context property and learning from wrong patterns. Second, the proposed method is found to be quite effective for privacy preserving applications, which are frequently required by B2C context-aware services; the privacy preserving system applying the proposed method successfully can also decrease elapsed time. Hence, the method is very practical in establishing privacy preserving context-aware services. Our future research issues taking into account some limitations in this paper can be summarized as follows. First, user acceptance or usability will be tested with actual users in order to prove the value of the prototype system. Second, we will apply the proposed method to more general application domains as this paper focused on tourism in amusement park.

A Smoothing Data Cleaning based on Adaptive Window Sliding for Intelligent RFID Middleware Systems (지능적인 RFID 미들웨어 시스템을 위한 적응형 윈도우 슬라이딩 기반의 유연한 데이터 정제)

  • Shin, DongCheon;Oh, Dongok;Ryu, SeungWan;Park, Seikwon
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.3
    • /
    • pp.1-18
    • /
    • 2014
  • Over the past years RFID/SN has been an elementary technology in a diversity of applications for the ubiquitous environments, especially for Internet of Things. However, one of obstacles for widespread deployment of RFID technology is the inherent unreliability of the RFID data streams by tag readers. In particular, the problem of false readings such as lost readings and mistaken readings needs to be treated by RFID middleware systems because false readings ultimately degrade the quality of application services due to the dirty data delivered by middleware systems. As a result, for the higher quality of services, an RFID middleware system is responsible for intelligently dealing with false readings for the delivery of clean data to the applications in accordance with the tag reading environment. One of popular techniques used to compensate false readings is a sliding window filter. In a sliding window scheme, it is evident that determining optimal window size intelligently is a nontrivial important task in RFID middleware systems in order to reduce false readings, especially in mobile environments. In this paper, for the purpose of reducing false readings by intelligent window adaption, we propose a new adaptive RFID data cleaning scheme based on window sliding for a single tag. Unlike previous works based on a binomial sampling model, we introduce the weight averaging. Our insight starts from the need to differentiate the past readings and the current readings, since the more recent readings may indicate the more accurate tag transitions. Owing to weight averaging, our scheme is expected to dynamically adapt the window size in an efficient manner even for non-homogeneous reading patterns in mobile environments. In addition, we analyze reading patterns in the window and effects of decreased window so that a more accurate and efficient decision on window adaption can be made. With our scheme, we can expect to obtain the ultimate goal that RFID middleware systems can provide applications with more clean data so that they can ensure high quality of intended services.