submit CrossRef Open Access Subscribe New Journal Ideal

Click on image to enlarge

Indexed in the SCIE (2017 Impact Factor
0.311), and in Scopus

Journal of Web Engineering

Martin Gaedke, Chemnitz University of Technology, Germany
Geert-Jan Houben, Delft University of Technology, The Netherlands
Bebo White, Stanford University, USA

ISSN: 1540-9589 (Print Version),

ISSN: 1544-5976 (Online Version)
Vol: 14   Issue: Combined Issue 1 & 2

Published In:   March 2015

Publication Frequency: 8 issues per year

Search Available Volume and Issue for Journal of Web Engineering

Journal Description        Read Full Articles        Editorial Board        Subscription        Indexed

Surfing the Web Using Browser Interface Facilities: A Performance Evaluation Approach

l Peña-Ortiz1,2, José Antonio Gil1, Julio Sahuquillo1 and Ana Pont1

1Departament d'Informatica de Sistemes i Computadors,Universitat Politecnica de Valencia,Cam de Vera s/n, 46022, Valencia, Spain
2Facultad de Ingeniera en Sistemas, Electronica e Industrial,Universidad Tecnica de Ambato, Campus Huachi, Edi cio Zeta, Ambato, Tungurahua, Ecuador

Abstract: [+]    |    Download File [ 913KB ]

Abstract: The user interaction with the current web contents is a major concern when de ning web workloads in order to precisely estimate system performance. However, the intrinsic diculty to represent this dynamic behavior with a workload model has caused that many research studies are still using non representative workloads of the current web navigations. In contrast, in previous works we demonstrated that the use of an accurate workload model which considers user's dynamism when navigating the web clearly a ects system performance metrics. In this paper we analyze, for the rst time, the e ect of considering the User-Browser Interaction as a part of user's dynamic behavior on web workload characterization in performance studies. To this end, we evaluate a typical e-commerce scenario and compare the obtained results for di erent behaviors that take the user interaction into account, such as the use of the back button and parallel browsing originated by using browser tabs or opening new windows when sur ng a website. Experimental results show that these interaction patterns allow users to achieve their navigation objectives sooner, so increasing their productivity up to 200% when sur ng the Web. In addition, results prove that when this type of navigations is taken into account, performance indexes can widely di er and relax the stress borderline of the server. For instance, the server utilization drops as much as 45% due to parallel browsing behavior.

Keywords: Web performance evaluation, Web dynamism, User's dynamic behavior, Dynamic web workload, Human-Computer Interaction

Exploiting Emoticons in Polarity Classification of Text

Alexander Hogenboom1, Danella Bal1, Flavius Frasincar1, Malissa Bal1, Franciska de Jong2,3 and Uzay Kaymak4

1Econometric Institute, Erasmus University Rotterdam,P.O. Box 1738, 3000 DR Rotterdam, the Netherlands
2Erasmus School of History, Culture & Communication, Erasmus University Rotterdam,P.O. Box 1738, 3000 DR Rotterdam, the Netherlands
3Department of Computer Science, Universiteit Twente,P.O. Box 217, 7500 AE Enschede, the Netherlands
4Department of Industrial Engineering & Innovation Sciences, Eindhoven University of Technology,P.O. Box 513, 5600 MB Eindhoven, the Netherlands

Abstract: [+]    |    Download File [ 595KB ]

Abstract: With people increasingly using emoticons in written text on the Web in order to ex- press, stress, or disambiguate their sentiment, it is crucial for automated sentiment analysis tools to correctly account for such graphical cues for sentiment. We analyze how emoticons typically convey sentiment and we subsequently propose and evaluate a novel method for exploiting this with a manually created emoticon sentiment lexicon in a lexicon-based polarity classi cation method. We evaluate our approach on 2,080 Dutch tweets and forum messages, which all contain emoticons. We validate our nd- ings on 10,069 English reviews of apps, some of which contain emoticons. We nd that accounting for the sentiment conveyed by emoticons on a paragraph level { and, to a lesser extent, on a sentence level { signi cantly improves polarity classi cation perfor- mance. Whenever emoticons are used, their associated sentiment tends to dominate the sentiment conveyed by textual cues and forms a good proxy for the polarity of text.

Keywords: Sentiment analysis, polarity classi cation, emoticons, sentiment lexicon

Keyboard Navigation Mechanisms in Widgets: an Investigation on ARIA's Implementations

Willian M. Watanabe1, Rafael Jose Geraldo2 and Renata Pontin de Mattos Fortes2

1UTFPR - Universidade Tecnologica Federal do Parana , Campus Cornelio Procopio,Cornelio Procopio, PR, 84016-210, Brazil
2Intermdia, ICMC-USP - Institute of Mathematical and Computer Sciences of the University of S~ao Paulo,S~ao Carlos, SP P.O.Box 668, 13560-970, Brazil

Abstract: [+]    |    Download File [ 567KB ]

Abstract: This study presents an investigation on how keyboard accessibility has been delivered in RIA - Rich Internet Applications. We conducted an evaluation on 32 websites which contained Tab Widgets and 74 websites which contained Menu Widgets, from the 150 websites of Alexa's top most accessed websites list. The evaluation process consisted of checking if the Widgets implemented ARIA - Accessible Rich Internet Applications requirements, like the use of role/state semantic attributes and presentation of keyboard interaction strategies. The results showed that, even though the ARIA speci cation achieved the status of W3C Candidate Recommendation in 2011 and W3C Recommen- dation in 2014, few websites implemented Tab and Menu Widgets according to ARIA in the Web. The study also identi ed alternative keyboard navigation mechanisms that are accessible to Assistive Technologies users, despite the disadvantages they might rep- resent. Moreover, the study proposes a framework to classify these alternative keyboard navigation mechanisms and map the technological requirements which need to be ad- dressed in order to make the Tab and Menu Widgets implement the ARIA speci cation.

Keywords: Web accessibility, ARIA, Widgets, Keyboard Navigation, Navigation Mech- anisms

Multilevel Analysis for Agent-Based Service Composition

Arif Bramantoro1, Ahlem B. Hassine2, Shigeo Matsubara and Toru Ishida3

1Al Imam Mohammad Ibn Saud Islamic University (IMSIU),Riyadh, Saudi Arabia
2Tunis University,Tunisia
3 Kyoto University,Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501, Japan

Abstract: [+]    |    Download File [ 479KB ]

Abstract: Agent-based Web service composition has become one of the most challenging research issues. Many composition techniques and formalizations have been proposed, but they are neither mature nor flexible. They assume that each sub-task is an atomic process, hence it cannot be decomposed based on user requirements. Moreover, those techniques and formalizations are not suitable for dynamic environments such as the language service domain. Language service requires a flexible formalization to accommodate the user’s language skills in conjunction with QoS. The key contributions of this paper are (i) a complete formalization that ideally reflects the nature of real applications and permits extension of the original abstract workflow (in case of failure); (ii) a novel agent-based protocol able to find satisfying solutions for this problem in real time to allow restriction and/or relaxation within the original workflow; (iii) a hybrid architecture of serviceoriented computing and multi-agent systems for implementing Abstract Web service, Information analysis, and User agents. Experiments are presented to find solutions that can be executed within a feasible time and space.

Keywords: Web service composition, constraint optimization, multi-agent

Type-Ahead Exploratory Search through Typo and Word Order Tolerant Autocompletion

Pavlos Fafalios and Yannis Tzitzikas

Institute of Computer Science, Foundation for Research and Technology - Hellas (FORTH), and Computer Science Department, University of Crete, GREECE

Abstract: [+]    |    Download File [ 973KB ]

Abstract: There is an increasing interest on recommending to the user instantly (during typing characters) queries and query results. This is evidenced by the emergence of several systems that offer such functionalities, e.g. Google Instant Search for Web searching or Facebook Search for social searching. In this paper we consider showing more rich rec- ommendations that show several other kinds of supplementary information that provide the user with a better overview of the search space. This supplementary information can be the result of various tasks (e.g. textual clustering or entity mining of the top search results), may have very large size and may cost a lot to be derived. The instant presen- tation of these recommendations (as the user types a query letter-by-letter) helps the user (a) to quickly discover what is popular among other users, (b) to decide fast which (of the suggested) query completions to use, and (c) to decide what hits of the returned answer to inspect. In this paper we focus on making this feasible (scalable) and flexible. Regarding scalability we elaborate on an approach based on precomputed information and we comparatively evaluate various trie-based index structures for making real-time interaction feasible, even if the size of the available memory space is limited. Specifically, we show how with modest hardware (like this of a mobile device) one can provide instant access to large amounts of data. Moreover, we propose and experimentally evaluate an incremental procedure for updating the index. For improving the throughput that can be served we analyze and experimentally evaluate various policies for caching subtries. With regard to flexibility, in order to reduce user’s effort and to increase the exploitation of the precomputed information, we elaborate on how the recommendations can tolerate different word orders and spelling errors, assuming the proposed trie-based index struc- tures. The experimental results revealed that such functionality significantly increases the number of recommendations especially for queries that contain several words. Fi- nally, we propose an algorithm for computing the top-K suggestions that exploits the ranking information in order to reduce the trie traversals. An experimental evaluation proves that the proposed algorithm highly improves the retrieval time.

Keywords: type-ahead search, instant search, exploratory search, autocompletion, query suggestions, caching

An Interactive Web Based Toolkit For Multi Focus Image Fusion

Veysel Aslantas, Rifat Kurban, Ahmet Nusret Toprak, and Emre Bendes

Erciyes University, Department of Computer Engineering, Kayseri, Turkey

Abstract: [+]    |    Download File [ 1785KB ]

Abstract: This paper presents a web-based multi-focus image fusion toolkit developed by using ASP.NET and MATLAB. The toolkit enables users to explore different image fusion techniques such as basic averaging, Laplacian pyramid, wavelet, Discrete Cosine Transform (DCT), pixel based method using spatial frequency & morphological operators (PBSFMO) and block-based spatial domain fusion (SDMIF) methods. The toolkit also includes a new optimal fusion method based on evolutionary algorithms such as Evolution strategies (ES), Genetic algorithm (GA), Differential evolution (DE), and Adaptive differential evolution (JADE) algorithm. Users will be able to evaluate several image fusion techniques easily and efficiently by employing the toolkit.

Keywords: Web based MATLAB applications, multi-focus image fusion, evolutionary algorithms

Prevention of Fault Propagation in Web Service: a Complex Network Approach

Ying Liu1, Shu Mao1, Mingwei Zhang1, Guoqi Liu1, Zhiliang Zhu1 and Jingde Cheng2

1Northeastern University, Shenyang, China
2Saitama University, Saitama, Japan

Abstract: [+]    |    Download File [ 1235KB ]

Abstract: How to prevent the fault propagation problems in Web Service has become an important issue. The recent research works mostly take some fault tolerance method in service based system. These methods detect or diagnose faults in the composition process, find the failure service, take tolerance action and recover the system. However, in the service oriented architecture, one service is shared by different service based systems. The fault tolerance method only considers from the view of one service user, and tolerance action not considering the whole network would change its load and even the global redistribution of loads over all of the services, trigger a cascade of overload, and result in service network paralysis. The research of cascading failure in Complex Network provides a set of models to help study the above problems. Consequently, this paper proposes a new approach to deal with the fault propagation for Web Service from the view point of the whole service network, which could analyze its resistance influenced by the size of network, different types of attacks and load allocation strategies and prevent the disasters from happening. Firstly, it constructs a Web Service Complex Network (WSCN) composed of single service and their functional similarity. Then it models fault propagation based on WSCN, and simulates the propagation process by analyzing WSCN performance under small attack, large attack, random attack and calculated attack. When fault happens in WSCN, our method uses weight-based and spare-load-based load allocation methods of failed service to compare their influences on the whole network. The experimental results show that when fault happens in WSCN, the network has better resistance for small scale failure than big scale one, and resists stronger for random attack than deliberate one; when the service failure happens, the remaining space based load allocation strategy on it has higher robustness than weight based one. The simulation of fault propagation for Web Service could set example for preventing and reducing probabilities of collapse in the service network.

Keywords: Web Service Complex Network, invocable relation between services, fault propagation, loads allocation strategy

Analyzing Topological Characteristics of The Korean Blogosphere

Jiwoon Ha1, Duck-Ho Bae1, Minsoo Ryu1, Sang-Wook Kim1, Seok-Chul Baek2, Byeong-Soo Jeong3 and Jinsoo Cho4

1Hanyang University,222 Wangsimni-ro, Seongdong-gu, Seoul, South Korea
2Complex Network Analysis Team, NHN Corp, 6 Buljeong-ro, Bundang-gu, Seongnam-si, Gyeonggi-do, South Korea
3Kyung Hee University, 26 Kyungheedae-ro, Dongdaemun-gu, Seoul, South Korea
4Gachon University, 1342 Seongnamdae-ro, Sujeong-gu, Seongnam-si, Gyeonggi-do, South Korea

Abstract: [+]    |    Download File [ 5024KB ]

Abstract: Due to their popularity and widespread use, blogs have become an important medium through which many people communicate and exchange information on the World Wide Web (WWW). The blogosphere has provided many opportunities for individuals and companies to establish new business models that investigate social relationships. In Korea, there are many blogospheres that appear to have characteristics that differ from other foreign blogospheres on the Internet. Consequently, it is inappropriate to apply the analysis methods used for the foreign blogosphere directly to the Korean blogospheres. To establish successful business policies for the Korean blogospheres, it is necessary to understand the characteristics of the Korean blogospheres and the behavioral patterns of the bloggers. In this paper, we analyze the characteristics of the Korean blog network, wherein each blogger forms a node and scraps by bloggers form edges. First, we demon- strate that the Korean blog network is a scale-free network, like the WWW. Second, we compare the bow-tie structure of the Korean blog network with that of the WWW. Lastly, we analyze the changes in the Korean blog network over time. Results of these analyses will be helpful in developing effective algorithms and establishing new business models targeted at the Korean blogosphere.

Keywords: Blogosphere, social network analysis, bow-tie, data mining, graph mining

River Publishers: Journal of Web Engineering