IADIS-INTERNATIONAL JOURNAL ON COMPUTER SCIENCE AND INFORMATION SYSTEMS

17-31

Authors: Sujay Muramalla, Ragaad AlTarawneh, Shah Rukh Humayoun, Ricarda Moses, Sven Panis and Achim Ebert

Space-filling techniques have been used in the information visualization field as an alternative to the conventional node-link layouts for intuitively showing large hierarchies in less space. Different space filling layouts have been designed, developed and evaluated; however, much less effort have been made to look into how layout can impact user task performance on hierarchical data structures. In this paper, we focus on the impact of layout on user task performance by conducting evaluation studies for two common space-filling layout structures, the Sunburst (radial) layout and the Icicle (rectangular) layout. In our studies, users performed eight search-based tasks on files and directories in the resulting visualizations, first in a controlled environment and subsequently in an online environment. We focused on deriving user performance metrics with regard to effectiveness, efficiency, and user acceptance. Results demonstrate a mixed view of task performance and preference with both layouts, e.g., users performed better with the Icicle layout while they preferred the Sunburst layout for visual aesthetics. We further analyzed the impact of layout on the performance dynamics in terms of response times and accuracy using event history analysis (EHA) in the control study setting. The EHA results revealed clear differences in response tendencies even though no differences existed in mean response times for most of the tasks. It also clearly showed that participants performed more efficiently with the directory comparison tasks than the file comparison tasks. Overall, through these studies we were able to derive causal relationships between the layout and the user’s task performance while interacting with hierarchical data structures.

50-64

Authors: Hardy Pundt

Spatial decision making often requires the consideration of huge datasets from a great variety of sectors. For the achievement of decision that are accepted by as many actors as possible it is indispensable to consider all relevant fields, and contexts. However, if the goal of a project is ill defined or broadly scoped, it can be hard to identify all relevant actors and overview whether their different goals, perceptions and ideas of how a place, a landscape, a village or city should develop in the future, can be integrated. Actors recognize problems necessarily within their specific context. The idea of a holistic approach to decision making is to consider possibly all relevant contexts, in which a spatial problem is embedded. This should lead to qualitatively high and sustainable decisions because the ignorance of specific contextual information can lead to unsatisfying, in the worst case harmful results. The problem as such is not new, but this paper argues not from a perspective of human communication. It raises the question, whether applications can support a holistic approach in spatial decision making by extending decision systems with functionalities to integrate context-information automatically.

86-101

Authors: Duarte Pousa and José Rufino

System Virtualization has become a fundamental IT tool, whether it is type-2/hosted virtualization, mostly exploited by end-users in their personal computers, or type-1/bare metal, well established in IT departments and thoroughly used in modern datacenters as the very foundation of cloud computing. Though bare metal virtualization is meant to be deployed on server-grade hardware (for performance, stability and reliability reasons), properly configured desktop-class systems or workstations are often used as virtualization servers, due to their attractive performance/cost ratio. This paper presents the results of a study conducted on commodity virtualization servers, aiming to assess the performance of a representative set of the type-1 platforms mostly in use today: VMware ESXi, Citrix XenServer, Microsoft Hyper-V, oVirt and Proxmox. Hypervisor performance is indirectly measured through synthetic benchmarks performed on Windows 10 LTSB and Linux Ubuntu Server 16.04 guests: PassMark for Windows, UnixBench for Linux, and the cross-platform Flexible I/O Tester and iPerf3 benchmarks. The evaluation results may be used to guide the choice of the best type-1 platform (performance-wise), depending on the predominant guest OS, the performance patterns (CPUbound, IO-bound, or balanced) of that OS, its storage type (local/remote) and the required network-level performance.

115-132

Authors: Samuel Mann

The premise of Computing Education for Sustainability (CEfS) is examined. CEfS is described as a leverage discipline, where the handprint is much larger than the footprint. The potential of this leverage is described and the development of the field explored. Unfortunately CEfS is found not to be making sufficient impact in terms of a contribution at scale to system change actions resulting in restorative socio-ecological transformation. A transformation mindset is described that provides a lens for considering the role of CEfS and what might be done about it. Three inspirations are described - a case study of a learner with an ambitious change aspiration, a values-driven business, and an alternative approach to education: work-based professional practice education. These lead to consideration of implications, which while not exhaustive, are intended to provoke debate about the nature of computing education for sustainability.

148-165

Authors: Pavel Tarasov and Hitesh Tewari

Voting systems have been around for hundreds of years and despite different views on their integrity, have always been deemed secure with some fundamental security and anonymity principles. Numerous electronic systems have been proposed and implemented but some suspicion has been raised regarding the integrity of elections due to detected security vulnerabilities within these systems. Electronic voting, to be successful, requires a more transparent and secure approach, than is offered by current protocols. The approach presented in this paper involves a protocol developed on blockchain technology. The underlying technology used in the voting system is a payment scheme, which offers anonymity of transactions, a trait not seen in blockchain protocols to date. The proposed protocol offers anonymity of voter transactions, while keeping the transactions private, and the election transparent and secure. The underlying payment protocol has not been modified in any way, the voting protocol merely offers an alternative use case.

14-25

Authors: Gali Suresh Reddy and T. V. Rajinikanth

Dimensionality reduction is very challenging and important in text mining. We need to know which features be retained what to be and It helps in reducing the processing overhead when performing text classification and text clustering. Another concern in text clustering and text classification is the similarity measure which we choose to find the similarity degree between any two text documents. In this paper, we work towards text clustering and text classification by addressing the use of the proposed similarity measure which is an improved version of our previous measures. This proposed measure is used for supervised and un-supervised learning. The proposed measure overcomes the disadvantages of the existing measures.

45-60

Authors: Vangipuram Radhakrishna, P. V. Kumar and V. Janaki

A wide variety of real time applications generate temporal data. Determining and unearthing similar temporal association patterns is complex and challenging task when considering time stamped temporal databases. Previous works have considered only existing distance measure and did not address retrieval and discovery of similar temporal association patterns using new distance measures. In this paper, we design a new similarity measure which suits the temporal context that can be applied to obtain all valid STAP (similar temporal association patterns). Our approach considers approximating the association pattern support bounds and applying the proposed similarity measure. The results show the proposed approach has better computational complexity compared to other approaches and improved time efficiency.

75-87

Authors: Arun Nagaraja and N. Rajasekhar

Privacy is the major concern in the present world today. Data is also playing the major role and how the data is secured in the network is the trivial task. When the data is transmitted in the network, it is initially encrypted and the information is secured with minimal crypto security features. The information is more secured with public and private keys and during retrieval the data is to be decrypted with the same. After gathering and transmitting the required information, how to provide privacy to the data in the network is concern. Data that is shared in the network are to be made private and more secured. By privacy we can preserve the data in any channel and transmit it with security and its standards. The paper discusses on how the recent trend is working on data and its security. The paper also tells about the various cryptographic algorithm used during data transmission.

109-125

Authors: Hassan Oudani, Salah-Ddine Krit, Lahoucine El Maimouni and Jalal Laassiri

Sensor networks are dense wireless networks of small, low-cost sensors, which collect and disseminate environmental data, it used in a variety of fields like military surveillance, habitat monitoring, monitoring and gathering events in hazardous environments, surveillance of buildings, whether monitoring etc. In wireless sensor networks Flat and Hierarchical routing are two most typical routing protocols. Comparing the two routing protocols (flat / hierarchical) is very important to know well the performance of each routing, for that, in this paper we will discuss in first some of the major Flat routing protocols (AODV, DSDV, GSR, FSR, OLSR, SPIN) and hierarchical routing protocols (LEACH-C, LEACH-F, PEGASIS, ZHLS) for wireless sensor networks, and later we will compare and simulate the behavior on lifetime and energy using NS2 simulator for flat and hierarchical routing protocols.

143-161

Authors: Hasan Rashaideh

A new adaptive Differential Evolution (DE) algorithm for finding approximate to the solutions of second-order Dirichlet problems is presented. The proposed adaptive algorithm reflected a variation of the finite difference scheme in the perspective that each of the derivatives are approximated by forward, backward, and central differences’ quotients. The major advantage of the novel adaptive algorithm over other numerical methods; it has no limitations on the nature of the problem, type of classification, and the number of mesh points. A test cases that include different classes and types of Dirichlet problems to demonstrate the efficiency and simplicity of the algorithm are presented. The numerical results obtained show strong agreement with exact solutions, and demonstrate reliability and great accuracy of the method.