• Journal of Global Scholars of Marketing Science
• /
• v.19 no.3
• /
• pp.37-48
• /
• 2009

The standardization of marketing has been one of the most focused research topics in international marketing. The term "global marketing" was often used to mean an internationally standardized marketing strategy based on similarities between foreign markets. Marketing standardization was discussed only within the context of traditional physical marketplaces. Since then, the digital "marketspace" of the Internet had emerged in the 90's, and it became one of the most important drivers of the globalization process opening new opportunities for the standardization of global marketing activities. On the other hand, the opinion that a greater adoption of the Internet by customers may lead to a higher degree of customization and differentiation of products rather than standardization is also quite popular. Considering this disagreement, it is notable that comprehensive studies which focus upon the marketing standardization especially in the context of global e-commerce are missing to a high degree. On this background, the two basic research questions being addressed in this study are: (1) To what extent do companies standardize their marketing in international e-commerce? (2) Is there an impact of marketing standardization on the performance (or success) of these companies? Following research hypotheses were generated based upon literature review: H 1: Internationally engaged e-commerce firms show a growing readiness for marketing standardization. H 2: Marketing standardization exerts positive effects on the success of companies in international e-commerce. H 3: In international e-commerce, marketing mix standardization exerts a stronger positive effect on the economic as well as the non-economic success of companies than marketing process standardization. H 4: The higher the non-economic success in international e-commerce firms, the higher the economic success. The data for this research were obtained from a questionnaire survey conducted from February to April 2005. The international e-commerce companies of various industries in Germany and all subsidiaries or headquarters of foreign e-commerce companies based in Germany were included in the survey. 118 out of 801 companies responded to the questionnaire. For structural equation modelling (SEM), the Partial-Least. Squares (PLS) approach in the version PLS-Graph 3.0 was applied (Chin 1998a; 2001). All of four research hypotheses were supported by result of data analysis. The results show that companies engaged in international e-commerce standardize in particular brand name, web page design, product positioning, and the product program to a high degree. The companies intend to intensify their efforts for marketing mix standardization in the future. In addition they want to standardize their marketing processes also to a higher degree, especially within the range of information systems, corporate language and online marketing control procedures. In this study, marketing standardization exerts a positive overall impact on company performance in international e-commerce. Standardization of marketing mix exerts a stronger positive impact on the non-economic success than standardization of marketing processes, which in turn contributes slightly stronger to the economic success. Furthermore, our findings give clear support to the assumption that the non-economic success is highly relevant to the economic success of the firm in international e-commerce. The empirical findings indicate that marketing standardization is relevant to the companies' success in international e-commerce. But marketing mix and marketing process standardization contribute to the firms' economic and non-economic success in different ways. The findings indicate that companies do standardize numerous elements of their marketing mix on the Internet. This practice is in part contrary to the popular concept of a "differentiated standardization" which argues that some elements of the marketing mix should be adapted locally and others should be standardized internationally. Furthermore, the findings suggest that the overall standardization of marketing -rather than the standardization of one particular marketing mix element - is what brings about a positive overall impact on success.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.117-127
• /
• 2012

Due to the recent expansion of the Web 2.0 -based services, along with the widespread of smartphones, online social network services are being popularized among users. Online social network services are the online community services which enable users to communicate each other, share information and expand human relationships. In the social network services, each relation between users is represented by a graph consisting of nodes and links. As the users of online social network services are increasing rapidly, the SNS are actively utilized in enterprise marketing, analysis of social phenomenon and so on. Social Network Analysis (SNA) is the systematic way to analyze social relationships among the members of the social network using the network theory. In general social network theory consists of nodes and arcs, and it is often depicted in a social network diagram. In a social network diagram, nodes represent individual actors within the network and arcs represent relationships between the nodes. With SNA, we can measure relationships among the people such as degree of intimacy, intensity of connection and classification of the groups. Ever since Social Networking Services (SNS) have drawn increasing attention from millions of users, numerous researches have made to analyze their user relationships and messages. There are typical representative SNA methods: degree centrality, betweenness centrality and closeness centrality. In the degree of centrality analysis, the shortest path between nodes is not considered. However, it is used as a crucial factor in betweenness centrality, closeness centrality and other SNA methods. In previous researches in SNA, the computation time was not too expensive since the size of social network was small. Unfortunately, most SNA methods require significant time to process relevant data, and it makes difficult to apply the ever increasing SNS data in social network studies. For instance, if the number of nodes in online social network is n, the maximum number of link in social network is n(n-1)/2. It means that it is too expensive to analyze the social network, for example, if the number of nodes is 10,000 the number of links is 49,995,000. Therefore, we propose a heuristic-based method for finding the shortest path among users in the SNS user graph. Through the shortest path finding method, we will show how efficient our proposed approach may be by conducting betweenness centrality analysis and closeness centrality analysis, both of which are widely used in social network studies. Moreover, we devised an enhanced method with addition of best-first-search method and preprocessing step for the reduction of computation time and rapid search of the shortest paths in a huge size of online social network. Best-first-search method finds the shortest path heuristically, which generalizes human experiences. As large number of links is shared by only a few nodes in online social networks, most nods have relatively few connections. As a result, a node with multiple connections functions as a hub node. When searching for a particular node, looking for users with numerous links instead of searching all users indiscriminately has a better chance of finding the desired node more quickly. In this paper, we employ the degree of user node vn as heuristic evaluation function in a graph G = (N, E), where N is a set of vertices, and E is a set of links between two different nodes. As the heuristic evaluation function is used, the worst case could happen when the target node is situated in the bottom of skewed tree. In order to remove such a target node, the preprocessing step is conducted. Next, we find the shortest path between two nodes in social network efficiently and then analyze the social network. For the verification of the proposed method, we crawled 160,000 people from online and then constructed social network. Then we compared with previous methods, which are best-first-search and breath-first-search, in time for searching and analyzing. The suggested method takes 240 seconds to search nodes where breath-first-search based method takes 1,781 seconds (7.4 times faster). Moreover, for social network analysis, the suggested method is 6.8 times and 1.8 times faster than betweenness centrality analysis and closeness centrality analysis, respectively. The proposed method in this paper shows the possibility to analyze a large size of social network with the better performance in time. As a result, our method would improve the efficiency of social network analysis, making it particularly useful in studying social trends or phenomena.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5827-5833
• /
• 2013

Due to science and technology evolutions, modern systems are becoming larger and more complex. In developing complex systems, Model-Based Systems Engineering (MBSE), which is approach to reduce complexity, is being introduced and applied to various system domains. However, because of the modeling being made through a variety of languages, there is a problem with communication within the stakeholders and a lack of consistency in the models. In this paper, by investigating the rule explaining the transformation of one of the only traditional diagrams, DFD, to SysML and reusing the formerly built models, we attempt to implement by SysML. Analyzing each diagram's Metamodel and validating the connection of each component through bipartite graph especially suggest an effective transformation rule. Also, by applying to naval-combat system, we confirm efficiency of this study. Establishing the results of this study as basis for conducting further study, we will be able to transform other previous models gained from formerly built system to SysML. In this way, the stakeholder's communication can be improved and we anticipate that the application of SysML will be beneficial to the much efficient MBSE.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.8 no.1
• /
• pp.1088-1096
• /
• 1966

The following is a method of synthetic unitgraph derivation based on the routing of a time area diagram through channel storage, studied by Clark-Jonstone and Laurenson. Unithy drograph (or unitgraph) is the hydrograph that would result from unit rainfall\ulcorner excess occuring uniformly with respect to both time and area over a catchment in unit time. By thus standarzing rainfall characteristics and ignoring loss, the unitgraph represents only the effects of catchment characteristics on the time distribution of runoff from a catchment The situation abten arises where it is desirable to derive a unitgraph for the design of dams, large bridge, and flood mitigation works such as levees, floodways and other flood control structures, and are also used in flood forecasting, and the necessary hydrologie records are not available. In such cases, if time and funds permit, it may be desirable to install the necessary raingauges, pruviometers, and stream gaging stations, and collect the necessary data over a period of years. On the otherhand, this procedure may be found either uneconomic or impossible on the grounds of time required, and it then becomes necessary to synthesise a unitgraph from a knowledge of the physical charcteristics of the catchment. In the preparing the approach to the solution of the problem we must select a number of catchment characteristic(shape, stream pattern, surface slope, and stream slope, etc.), a number of parameters that will define the magnitude and shape of the unit graph (e.g. peak discharge, time to peak, and base length, etc.), evaluate the catch-ment characteristics and unitgraph parameters selected, for a number of catchments having adequate rainfall and stream data and obtain Correlations between the two classes of data, and assume the relationships derived in just above question apply to other, ungaged, Catchments in the same region and, knowing the physical characteritics of these catchments, substitute for them in the relation\ulcorner ships to determine the corresponding unitgraph parameters. This method described in this note, based on the routing of a time area diagram through channel storage, appears to provide a logical line of research and they allow a readier correlation of unitgraph parameters with catchment characteristics. The main disadvantage of this method appears to be the error in routing all elements of rainfall excess through the same amount of storage. evertheless, it should be noted that the synthetic unitgraph method is more accurate than the rational method since it takes account of the shape and tophography of the catchment, channel storage, and temporal variation of rainfall excess, all of which are neglected in rational method.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.657-667
• /
• 2020

The Android framework allows apps to take full advantage of personal information through granting single permission, and does not determine whether the data being leaked is actual personal information. To solve these problems, we propose a tool with static/dynamic analysis. The tool analyzes the Source and Sink used by the target app, to provide users with information on what personal information it used. To achieve this, we extracted the Source and Sink through Control Flow Graph and make sure that it leaks the user's privacy when there is a Source-to-Sink flow. We also used the sensitive permission information provided by Google to obtain information from the sensitive API corresponding to Source and Sink. Finally, our dynamic analysis tool runs the app and hooks information from each sensitive API. In the hooked data, we got information about whether user's personal information is leaked through this app, and delivered to user. In this process, an automated Source/Sink classification model was applied to collect latest Source/Sink information, and the we categorized latest release version of Android(9.0) with 88.5% accuracy. We evaluated our tool on 2,802 APKs, and found 850 APKs that leak personal information.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.81-93
• /
• 2000

In a methodological approach to improve the processing performance of modulo exponentiation which is the primary arithmetic in RSA crypto algorithm, we present a new RSA hardware architecture based on high-radix modulo multiplication and CRT(Chinese Remainder Theorem). By implementing the modulo multiplier using radix-16 arithmetic, we reduced the number of PE(Processing Element)s by quarter comparing to the binary arithmetic scheme. This leads to having the number of clock cycles and the delay of pipelining flip-flops be reduced by quarter respectively. Because the receiver knows p and q, factors of N, it is possible to apply the CRT to the decryption process. To use CRT, we made two s/2-bit multipliers operating in parallel at decryption, which accomplished 4 times faster performance than when not using the CRT. In encryption phase, the two s/2-bit multipliers can be connected to make a s-bit linear multiplier for the s-bit arithmetic operation. We limited the encryption exponent size up to 17-bit to maintain high speed, We implemented a linear array modulo multiplier by projecting horizontally the DG of Montgomery algorithm. The H/W proposed here performs encryption with 15Mbps bit-rate and decryption with 1.22Mbps, when estimated with reference to Samsung 0.5um CMOS Standard Cell Library, which is the fastest among the publications at present.

• Journal of agricultural medicine and community health
• /
• v.30 no.2
• /
• pp.127-135
• /
• 2005

Objectives: This study was conducted to investigate the trend of tuberculosis mortality rate by years and by areas. Methods: We calculated raw and age-adjusted mortality rate of tuberculosis from 1995 to 2002. The calculation was based on the data from resident registration data and death certification registration data gathered by 232 basic local authority. We used direct age standardization method for calculating age-adjusted mortality rate. We compared patterns of change in tuberculosis mortality rate of metropolitan areas, cities, and countryside by determinating the comparability of medels to explore linear relationship. We also analyzed the data of mortality rate between urban and rural area by comparing ANOVA and post-hoc by two periods: one from 1995 to 1998, and the other from 1999 to 2002. Results: In national mortality rate, both raw and age-adjusted mortality rate showed negative linear relationship. However, the graph become more horizontal: the slope line is close to zero. From 1995 to 1998, countryside showed significantly higher age-adjusted mortality rate than in metropolitan areas and cities. Ever after considering more horizontal graph in national mortality rate, the data shows that the countryside still have significantly higher mortality rate from 1999 to 2002. In model diagnostic checking, metropolitan areas and cities showed apparently linear pattern on the decrease of age-adjusted mortality rate. Pattern of mortality rate in countryside was decreased initially, but became flat. Conclusions: Further research is necessary to explore the characteristics of quality of tuberculosis control program in rural area. Different approach and strategies should be considered to decrease tuberculosis mortality rate in rural areas.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.109-122
• /
• 2014

People are nowadays creating a tremendous amount of data on Social Network Service (SNS). In particular, the incorporation of SNS into mobile devices has resulted in massive amounts of data generation, thereby greatly influencing society. This is an unmatched phenomenon in history, and now we live in the Age of Big Data. SNS Data is defined as a condition of Big Data where the amount of data (volume), data input and output speeds (velocity), and the variety of data types (variety) are satisfied. If someone intends to discover the trend of an issue in SNS Big Data, this information can be used as a new important source for the creation of new values because this information covers the whole of society. In this study, a Twitter Issue Tracking System (TITS) is designed and established to meet the needs of analyzing SNS Big Data. TITS extracts issues from Twitter texts and visualizes them on the web. The proposed system provides the following four functions: (1) Provide the topic keyword set that corresponds to daily ranking; (2) Visualize the daily time series graph of a topic for the duration of a month; (3) Provide the importance of a topic through a treemap based on the score system and frequency; (4) Visualize the daily time-series graph of keywords by searching the keyword; The present study analyzes the Big Data generated by SNS in real time. SNS Big Data analysis requires various natural language processing techniques, including the removal of stop words, and noun extraction for processing various unrefined forms of unstructured data. In addition, such analysis requires the latest big data technology to process rapidly a large amount of real-time data, such as the Hadoop distributed system or NoSQL, which is an alternative to relational database. We built TITS based on Hadoop to optimize the processing of big data because Hadoop is designed to scale up from single node computing to thousands of machines. Furthermore, we use MongoDB, which is classified as a NoSQL database. In addition, MongoDB is an open source platform, document-oriented database that provides high performance, high availability, and automatic scaling. Unlike existing relational database, there are no schema or tables with MongoDB, and its most important goal is that of data accessibility and data processing performance. In the Age of Big Data, the visualization of Big Data is more attractive to the Big Data community because it helps analysts to examine such data easily and clearly. Therefore, TITS uses the d3.js library as a visualization tool. This library is designed for the purpose of creating Data Driven Documents that bind document object model (DOM) and any data; the interaction between data is easy and useful for managing real-time data stream with smooth animation. In addition, TITS uses a bootstrap made of pre-configured plug-in style sheets and JavaScript libraries to build a web system. The TITS Graphical User Interface (GUI) is designed using these libraries, and it is capable of detecting issues on Twitter in an easy and intuitive manner. The proposed work demonstrates the superiority of our issue detection techniques by matching detected issues with corresponding online news articles. The contributions of the present study are threefold. First, we suggest an alternative approach to real-time big data analysis, which has become an extremely important issue. Second, we apply a topic modeling technique that is used in various research areas, including Library and Information Science (LIS). Based on this, we can confirm the utility of storytelling and time series analysis. Third, we develop a web-based system, and make the system available for the real-time discovery of topics. The present study conducted experiments with nearly 150 million tweets in Korea during March 2013.

• Asia pacific journal of information systems
• /
• v.18 no.1
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

• Journal of Intelligence and Information Systems
• /
• v.25 no.1
• /
• pp.63-83
• /
• 2019

Investors prefer to look for trading points based on the graph shown in the chart rather than complex analysis, such as corporate intrinsic value analysis and technical auxiliary index analysis. However, the pattern analysis technique is difficult and computerized less than the needs of users. In recent years, there have been many cases of studying stock price patterns using various machine learning techniques including neural networks in the field of artificial intelligence(AI). In particular, the development of IT technology has made it easier to analyze a huge number of chart data to find patterns that can predict stock prices. Although short-term forecasting power of prices has increased in terms of performance so far, long-term forecasting power is limited and is used in short-term trading rather than long-term investment. Other studies have focused on mechanically and accurately identifying patterns that were not recognized by past technology, but it can be vulnerable in practical areas because it is a separate matter whether the patterns found are suitable for trading. When they find a meaningful pattern, they find a point that matches the pattern. They then measure their performance after n days, assuming that they have bought at that point in time. Since this approach is to calculate virtual revenues, there can be many disparities with reality. The existing research method tries to find a pattern with stock price prediction power, but this study proposes to define the patterns first and to trade when the pattern with high success probability appears. The M & W wave pattern published by Merrill(1980) is simple because we can distinguish it by five turning points. Despite the report that some patterns have price predictability, there were no performance reports used in the actual market. The simplicity of a pattern consisting of five turning points has the advantage of reducing the cost of increasing pattern recognition accuracy. In this study, 16 patterns of up conversion and 16 patterns of down conversion are reclassified into ten groups so that they can be easily implemented by the system. Only one pattern with high success rate per group is selected for trading. Patterns that had a high probability of success in the past are likely to succeed in the future. So we trade when such a pattern occurs. It is a real situation because it is measured assuming that both the buy and sell have been executed. We tested three ways to calculate the turning point. The first method, the minimum change rate zig-zag method, removes price movements below a certain percentage and calculates the vertex. In the second method, high-low line zig-zag, the high price that meets the n-day high price line is calculated at the peak price, and the low price that meets the n-day low price line is calculated at the valley price. In the third method, the swing wave method, the high price in the center higher than n high prices on the left and right is calculated as the peak price. If the central low price is lower than the n low price on the left and right, it is calculated as valley price. The swing wave method was superior to the other methods in the test results. It is interpreted that the transaction after checking the completion of the pattern is more effective than the transaction in the unfinished state of the pattern. Genetic algorithms(GA) were the most suitable solution, although it was virtually impossible to find patterns with high success rates because the number of cases was too large in this simulation. We also performed the simulation using the Walk-forward Analysis(WFA) method, which tests the test section and the application section separately. So we were able to respond appropriately to market changes. In this study, we optimize the stock portfolio because there is a risk of over-optimized if we implement the variable optimality for each individual stock. Therefore, we selected the number of constituent stocks as 20 to increase the effect of diversified investment while avoiding optimization. We tested the KOSPI market by dividing it into six categories. In the results, the portfolio of small cap stock was the most successful and the high vol stock portfolio was the second best. This shows that patterns need to have some price volatility in order for patterns to be shaped, but volatility is not the best.