• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.858-870
• /
• 2007

TCP is popular protocol for reliable data delivery in the Internet. In recent years, wireless environments with transmission errors are becoming more common. Therefore, there is significant interest in using TCP over wireless links. Previous works have shown that, unless the protocol is modified, TCP may perform poorly on paths that include a wireless link subject to transmission errors. The reason for this is the implicit assumption in TCP that all packet losses are due to congestion which causes unnecessary reduction of transmission rate when the cause of packet losses are wireless transmission errors. In this paper, we propose a new LDA that monitors the network congestion level using ROTT. And we evaluate the performance of our scheme and compare with TCP Veno, Spike scheme with NS2(Network Simulator 2). In the result of our experiment, our scheme reduces the packet loss misclassification to maximum 55% of other schemes. And the results of another simulation show that our scheme raise its transmission rate with the fairness preserved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.369-390
• /
• 2023

Technologies for disaster management are highly sought areas for research and commercial deployment. Landslides, Flood, cyclones, earthquakes, forest fires and road/train accidents are some causes of disasters. Capturing video and accessing data in real time from the disaster site can help first responders make split second decisions which may save human lives and valuable resource destructions. In this context the communication technologies performing the task should have high bandwidth and low latency which only 5G can deliver. But unfortunately in India, deployment of the 5G mobile communication systems is yet to give a shape and again in remote areas unavailability of 4G signals is still severe. In this situation the authors have proposed, simulated and experimented a 4G-5G communication scheme where from the disaster site the signals will be transmitted by a 5G terminal to a nearby 4G-5G gateway installed in a mobile vehicle. The received 5G signal will be further relayed by the 4G-5G gateway to the fixed 4G base station for onward transmission towards the disaster management station for decision making, deployment and relief monitoring. The 4G-5G gateway acts as a relay and converter of 5G signal to 4G signal and vice versa. This relayed system can be further mounted on a vehicle mounted relay (VMR) as proposed by 3GPP in Release 18. The scheme is also in the same line of context with Verizon's, "Tactical Humanitarian Operations Response" (THOR) vehicle concept. The performance of the link is studied in different channel conditions, the throughput achieved is superb. The authors have implemented the above mentioned system towards smart campus networking and monitoring landslides activities which are common in their regions.

• Asia pacific journal of information systems
• /
• v.17 no.4
• /
• pp.31-59
• /
• 2007

We frequently use search engines to find relevant information in the Web but still end up with too much information. In order to solve this problem of information overload, ranking algorithms have been applied to various domains. As more information will be available in the future, effectively and efficiently ranking search results will become more critical. In this paper, we propose a ranking algorithm for the Semantic Web resources, specifically RDF resources. Traditionally, the importance of a particular Web page is estimated based on the number of key words found in the page, which is subject to manipulation. In contrast, link analysis methods such as Google's PageRank capitalize on the information which is inherent in the link structure of the Web graph. PageRank considers a certain page highly important if it is referred to by many other pages. The degree of the importance also increases if the importance of the referring pages is high. Kleinberg's algorithm is another link-structure based ranking algorithm for Web pages. Unlike PageRank, Kleinberg's algorithm utilizes two kinds of scores: the authority score and the hub score. If a page has a high authority score, it is an authority on a given topic and many pages refer to it. A page with a high hub score links to many authoritative pages. As mentioned above, the link-structure based ranking method has been playing an essential role in World Wide Web(WWW), and nowadays, many people recognize the effectiveness and efficiency of it. On the other hand, as Resource Description Framework(RDF) data model forms the foundation of the Semantic Web, any information in the Semantic Web can be expressed with RDF graph, making the ranking algorithm for RDF knowledge bases greatly important. The RDF graph consists of nodes and directional links similar to the Web graph. As a result, the link-structure based ranking method seems to be highly applicable to ranking the Semantic Web resources. However, the information space of the Semantic Web is more complex than that of WWW. For instance, WWW can be considered as one huge class, i.e., a collection of Web pages, which has only a recursive property, i.e., a 'refers to' property corresponding to the hyperlinks. However, the Semantic Web encompasses various kinds of classes and properties, and consequently, ranking methods used in WWW should be modified to reflect the complexity of the information space in the Semantic Web. Previous research addressed the ranking problem of query results retrieved from RDF knowledge bases. Mukherjea and Bamba modified Kleinberg's algorithm in order to apply their algorithm to rank the Semantic Web resources. They defined the objectivity score and the subjectivity score of a resource, which correspond to the authority score and the hub score of Kleinberg's, respectively. They concentrated on the diversity of properties and introduced property weights to control the influence of a resource on another resource depending on the characteristic of the property linking the two resources. A node with a high objectivity score becomes the object of many RDF triples, and a node with a high subjectivity score becomes the subject of many RDF triples. They developed several kinds of Semantic Web systems in order to validate their technique and showed some experimental results verifying the applicability of their method to the Semantic Web. Despite their efforts, however, there remained some limitations which they reported in their paper. First, their algorithm is useful only when a Semantic Web system represents most of the knowledge pertaining to a certain domain. In other words, the ratio of links to nodes should be high, or overall resources should be described in detail, to a certain degree for their algorithm to properly work. Second, a Tightly-Knit Community(TKC) effect, the phenomenon that pages which are less important but yet densely connected have higher scores than the ones that are more important but sparsely connected, remains as problematic. Third, a resource may have a high score, not because it is actually important, but simply because it is very common and as a consequence it has many links pointing to it. In this paper, we examine such ranking problems from a novel perspective and propose a new algorithm which can solve the problems under the previous studies. Our proposed method is based on a class-oriented approach. In contrast to the predicate-oriented approach entertained by the previous research, a user, under our approach, determines the weights of a property by comparing its relative significance to the other properties when evaluating the importance of resources in a specific class. This approach stems from the idea that most queries are supposed to find resources belonging to the same class in the Semantic Web, which consists of many heterogeneous classes in RDF Schema. This approach closely reflects the way that people, in the real world, evaluate something, and will turn out to be superior to the predicate-oriented approach for the Semantic Web. Our proposed algorithm can resolve the TKC(Tightly Knit Community) effect, and further can shed lights on other limitations posed by the previous research. In addition, we propose two ways to incorporate data-type properties which have not been employed even in the case when they have some significance on the resource importance. We designed an experiment to show the effectiveness of our proposed algorithm and the validity of ranking results, which was not tried ever in previous research. We also conducted a comprehensive mathematical analysis, which was overlooked in previous research. The mathematical analysis enabled us to simplify the calculation procedure. Finally, we summarize our experimental results and discuss further research issues.

• KDI Journal of Economic Policy
• /
• v.31 no.1
• /
• pp.239-276
• /
• 2009

The paper investigates the possible relationship between earnings prediction by security analysts and special ownership ties that link security companies those analysts belong to and firms under analysis. "Security analysts" are known best for their role as information producers in stock markets where imperfect information is prevalent and transaction costs are high. In such a market, changes in the fundamental value of a company are not spontaneously reflected in the stock price, and the security analysts actively produce and distribute the relevant information crucial for the price mechanism to operate efficiently. Therefore, securing the fairness and accuracy of information they provide is very important for efficiencyof resource allocation as well as protection of investors who are excluded from the special relationship. Evidence of systematic distortion of information by the special tie naturally calls for regulatory intervention, if found. However, one cannot presuppose the existence of distorted information based on the common ownership between the appraiser and the appraisee. Reputation effect is especially cherished by security firms and among analysts as indispensable intangible asset in the industry, and the incentive to maintain good reputation by providing accurate earnings prediction may overweigh the incentive to offer favorable rating or stock recommendation for the firms that are affiliated by common ownership. This study shares the theme of existing literature concerning the effect of conflict of interests on the accuracy of analyst's predictions. This study, however, focuses on the potential conflict of interest situation that may originate from the Korea-specific ownership structure of large conglomerates. Utilizing an extensive database of analysts' reports provided by WiseFn(R) in Korea, we perform empirical analysis of potential relationship between earnings prediction and common ownership. We first analyzed the prediction bias index which tells how optimistic or friendly the analyst's prediction is compared to the realized earnings. It is shown that there exists no statistically significant relationship between the prediction bias and common ownership. This is a rather surprising result since it is observed that the frequency of positive prediction bias is higher with such ownership tie. Next, we analyzed the prediction accuracy index which shows how accurate the analyst's prediction is compared to the realized earnings regardless of its sign. It is also concluded that there is no significant association between the accuracy ofearnings prediction and special relationship. We interpret the results implying that market discipline based on reputation effect is working in Korean stock market in the sense that security companies do not seem to be influenced by an incentive to offer distorted information on affiliated firms. While many of the existing studies confirm the relationship between the ability of the analystand the accuracy of the analyst's prediction, these factors cannot be controlled in the above analysis due to the lack of relevant data. As an indirect way to examine the possibility that such relationship might have distorted the result, we perform an additional but identical analysis based on a sub-sample consisting only of reports by best analysts. The result also confirms the earlier conclusion that the common ownership structure does not affect the accuracy and bias of earnings prediction by the analyst.

• Journal of Intelligence and Information Systems
• /
• v.27 no.1
• /
• pp.23-46
• /
• 2021

Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.21 no.3
• /
• pp.176-188
• /
• 2018

Modern urban problems are increasingly becoming a market mix that can not be solved by the power of a single department and the necessity of establishing a cooperation system based on data communication between departments is increasing. Therefore, this study analyzed Busan metropolitan city's IT projects from 2014 to 2018 in order to understand the utilization and sharing status of departmental data from the viewpoint that cooperation between departments can start from the sharing of data with high common utilization. In addition, based on the results of the FGI(Focus Group Interview) conducted for the officials of the department responsible for the informatization project, we verified the results of data status analysis. At the same time, we figured out the necessity of data link between departments through SNA(Social Network Analysis) and presented data that should be shared first in the future. As a result, most of the information systems currently use limited data only within the department that produced the data. Most of the linked data was concentrated in the information department. Therefore, this study suggested the following solutions. First, in order to prevent overlapping investments caused by the operation of individual departments and share information, it is necessary to build a small platform to tie the departments, which have high connectivity with each other, into small blocks. Second, a local level process is needed to develop data standards as an extension of national standards in order to expand the information to be used in various fields. Third, as another solution, we proposed a system that can integrate various types of information based on address and location information through application of cloud-based GIS platform. The results of this study are expected to contribute to build a cooperation system between departments through expansion of information sharing with cost reduction.

• Journal of Fashion Business
• /
• v.19 no.6
• /
• pp.82-100
• /
• 2015

Mobile fashion apps present much opportunity for marketers to engage consumers, however not all apps provide enough functions for their targeted audience. This study aims to determine how mobile fashion apps can be used to build brand community with consumer engagement. Qualitative data on fashion mobile apps were collected from the Apple app store and Android market during the spring and summer of 2015. A total of 110 fashion mobile apps were collected;, 50 apps were identified as apparel brands that either manufacture or sell apparel to consumers, which we categorized as "brand" fashion apps, and the remaining 60 were categorized as "non-brand" fashion apps. The result of the study can be summarized as below. The 60 non-brand fashion apps were grouped into 5 app types: shopping, searching, sharing, organizational, and informational. The main functions are for informational use and shopping needs, since at least half (31 apps) are used for either retrieving information or for shopping. However, in contrast, social networking and location were infrequent and not commonly utilized by these apps. The most common type of non-brand fashion apps available were shopping apps;, many shopping apps enable users to shop from several different websites and save their items into one universal shopping cart so that they only check out once. Most of these apps are informational and help consumers make more informed decisions on purchases;, in addition many offer location services to help consumers find these items in store. While these apps perform several functions, they do not link to social media. The 50 brand apps were grouped into 5 brand types: athletic, casual, fast fashion, luxury, and retailer. These apps were also checked for attributes to determine their functionality. The result shows that the main functions of brand fashion apps are for information (82% of the 50 apps) as well as location searching (72% of 50 apps). Conversely, these apps do not offer any photo sharing, and very few have organizational or community functions. Fashion mobile apps and m-marketing elements: To build brand community, mobile apps can be designed to motivate consumer's engagement with brands. The motivations of fashion mobile apps are useful in developing fashion mobile apps. Entertainment motives can be fulfilled with multimedia attributes, functionality motives are satisfied with organizational and location-based features, information motives with informational service, socialization with community and social network, learning and intellectual stimulation from informational attributes, and trend following through photo sharing. The 8 key attributes of mobile apps can correspond to the 4 m-marketing elements (i.e., Informative content, multimedia, interactions, and product promotions) that are further intertwined with m-branding elements. App Attributes and M-Marketing aim to Build Brand Community;, the eight key attributes can impact on 4 m-branding elements, which further contribute to building brand community by affecting consumers' perceptions of brands preference and advocacy, and their likelihood to be loyal.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.271-280
• /
• 2010

For the next generation mobile communication system, diverse wireless network techniques such as beyond 3G LTE, WiMAX/WiBro, and next generation WLAN etc. are proceeding to the form integrated into the All-IP core network. According to this development, Beyond 3G integrated into heterogeneous wireless access technologies must support the vertical handover and network to be used of several radio networks. However, unified management of each network is demanded since it is individually serviced. Therefore, in order to solve this problem this study is introducing the theory of Common Radio Resource Management (CRRM) based on Generic Link Layer (GLL). This study designs the structure and functions to support the vertical handover and propose the vertical handover algorithm of which policy-based and MCDM are composed between LTE and WLAN systems using GLL. Finally, simulation results are presented to show the improved performance over the data throughput, handover success rate, the system service cost and handover attempt number.

• Journal of Hospice and Palliative Care
• /
• v.17 no.1
• /
• pp.18-26
• /
• 2014

Purpose: Anorexia is a common symptom in terminal cancer patients. Some data have suggested a role of visfatin in regulating feeding behavior. We studied the relationship of a serum visfatin level and anorexia in cancer patients provided with hospice care. Methods: After informed consent was obtained, 69 cancer patients over 20 years old at a hospice center were enrolled in the study from July 2009 to July 2010. We characterized patients by age, sex, body mass index, primary cancer site, and Eastern Cooperative Oncology Group (ECOG) performance status, etc. Also, blood tests were performed to measure the level of hemoglobin, white blood cell (WBC), C-reactive protein (CRP), total cholesterol, albumin, lymphocyte count, glucose, blood urea nitrogen (BUN), creatinine, tumor necrosis factor-alpha (TNF-${\alpha}$), interukin-6, leptin and visfatin. Results: The mean age of subjects was 65.5 years old, According to univariate analysis, pulse, ECOG performance scale, opioid use and visfatin level were different between the anorexia and non-anorexic group (P<0.05). The median visfatin level was higher in the anorexia group than the good appetite group (P=0.0323). Serum visfatin concentrations were not related with either body mass index or serum leptin or total cholesterol levels, but it was negatively correlated with serum albumin levels (P=0.0198) and lymphocyte counts (P=0.0013). Conclusion: This study did not identify a novel link between visfatin levels and anorexia in cancer patients at a hospice.

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

Nowadays, Internet users tend to do a variety of actions at the same time such as web browsing, social networking and multimedia consumption. While watching a video, once a user is interested in any product, the user has to do information searches to get to know more about the product. With a conventional approach, user has to search it separately with search engines like Bing or Google, which might be inconvenient and time-consuming. For this reason, a video annotation platform has been developed in order to provide users more convenient and more interactive ways with video content. In the future of smart TV environment, users can follow annotated information, for example, a link to a vendor to buy the product of interest. It is even better to enable users to search for information by directly discussing with friends. Users can effectively get useful and relevant information about the product from friends who share common interests or might have experienced it before, which is more reliable than the results from search engines. Social networking services provide an appropriate environment for people to share products so that they can show new things to their friends and to share their personal experiences on any specific product. Meanwhile, they can also absorb the most relevant information about the product that they are interested in by either comments or discussion amongst friends. However, within a very huge graph of friends, determining the most appropriate persons to ask for information about a specific product has still a limitation within the existing conventional approach. Once users want to share or discuss a product, they simply share it to all friends as new feeds. This means a newly posted article is blindly spread to all friends without considering their background interests or knowledge. In this way, the number of responses back will be huge. Users cannot easily absorb the relevant and useful responses from friends, since they are from various fields of interest and knowledge. In order to overcome this limitation, we propose a method to filter a user's friends for information search, which leverages semantic video annotation and social networking services. Our method filters and brings out who can give user useful information about a specific product. By examining the existing Facebook information regarding users and their social graph, we construct a user profile of product interest. With user's permission and authentication, user's particular activities are enriched with the domain-specific ontology such as GoodRelations and BestBuy Data sources. Besides, we assume that the object in the video is already annotated using Linked Data. Thus, the detail information of the product that user would like to ask for more information is retrieved via product URI. Our system calculates the similarities among them in order to identify the most suitable friends for seeking information about the mentioned product. The system filters a user's friends according to their score which tells the order of whom can highly likely give the user useful information about a specific product of interest. We have conducted an experiment with a group of respondents in order to verify and evaluate our system. First, the user profile accuracy evaluation is conducted to demonstrate how much our system constructed user profile of product interest represents user's interest correctly. Then, the evaluation on filtering method is made by inspecting the ranked results with human judgment. The results show that our method works effectively and efficiently in filtering. Our system fulfills user needs by supporting user to select appropriate friends for seeking useful information about a specific product that user is curious about. As a result, it helps to influence and convince user in purchase decisions.