IJACSA Volume 6 Issue 4 - thesai.org

IJACSA Volume 6 Issue 4

Copyright Statement: This is an open access publication licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.

View Full Issue

Paper 1: Multidimensional Neural-Like Growing Networks - A New Type of Neural Network

Abstract: The present paper describes a new type of neural networks - multidimensional neural-like growing networks. Multidimensional neural-like growing networks are a dynamic structure, which varies depending on the external information received by receptors and the information coming from the effector area to the outside world. Multidimensional receptor-effector neural-like growing networks are supposed to store and process images of objects or situations in the subject area and manage actions through a variety of spatial representations of information, such as tactile, visual, acoustic, taste, etc. Multidimensional receptor-effector neural-like growing networks are used to design intelligent systems and electronic brains of robots. The article describes the neural-like growing networks, the basic rules for constructing the neural-like growing networks and their comparison with the normal neural networks, modeling of information flows in a human body and basic blocks and functions of electronic brains of intelligent systems and robots.

Author 1: Vitaliy Yashchenko

Keywords: multidimensional receptor-effector neural-like growing networks; neural networks; intelligent systems; electronic brain of robots

Paper 2: Gamification, Virality and Retention in Educational Online Platform

Abstract: The paper describes gamification, virality and retention in the freemium educational online platform with 40,000 users as an example. Relationships between virality and retention parameters as measurable metrics are calculated and discussed using real examples. Virality and monetization can be both competing and complementary mechanisms for the system growth. The K-growth factor, which combines both virality and retention, is proposed as the metrics of the overall freemium system performance in terms of the user base growth. This approach can be tested using a small number of users to assess the system potential performance. If the K-growth factor is less than one, the product needs further development. If the K-growth factor is greater than one, the system retains existing and attracts new users, thus a large scale market launch can be successful. User attraction and retention mechanics are discussed based on the peer-to-peer online language training platform, which utilizes freemium business model. Key system metrics are derived to assess the future commercial potential and making decisions to either fund an advertising campaign, or continue with project technical improvements. The paper can be of interest to venture capitalists as a method to assess freemium projects.

Author 1: Ilya V. Osipov

Author 2: Alex A. Volinsky

Author 3: Vadim V. Grishin

Keywords: Gamification; virality; retention; freemium; K-factor; metrics; open educational resource; e-learning

Paper 3: Developing a Search Algorithm and a Visualization Tool for SNOMED CT

Abstract: With electronic health records rising in popularity among hospitals and physicians, the SNOMED CT medical terminology has served as a valuable standard for those looking to exchange a variety of information linked to clinical knowledge bases, information retrieval, and data aggregation. However, SNOMED CT is distributed as a flat file database by the International Health Terminology Standards Development Organization and visualization of data can be a problem. This study describes an algorithm that allows a user to easily search SNOMED CT for identical or partial matches utilizing indexing and wildcard matching through a graphical user interface developed in the cross-platform programming language Java. In addition to this, the algorithm displays corresponding relationships and other relevant information pertaining to the search term. The outcome of this study can serve as a useful visualization tool for those looking to delve into the increasingly standardized world of electronic health records as well as a tool for healthcare providers who may be seeking specific clinical information contained in the SNOMED CT database.

Author 1: Anthony Masi

Author 2: Ankur Agrawal

Keywords: SNOMED CT; electronic; health records; visualization; search algorithm; GUI

Paper 4: Area Efficient Implementation of Elliptic Curve Point Multiplication Algorithm

Abstract: Elliptic Curve Cryptography (ECC) has established itself as the most preferred and secured cryptography algorithm for the secure data transfer and secure data storage in embedded system environment. Efficient implementation of point multiplication algorithm is crucial activity for designing area efficient, low footprint ECC cryptoprocessors. In this paper, an area efficient implementation of double point multiplication algorithm over binary elliptic curve is presented. Area analysis of double point multiplication algorithm based on differential addition chains method is carried out and area report is generated. Area optimization is achieved by using pipelined structure and by reutilizing idle resources from previous stages in processing unit. The proposed architecture for double point multiplication is implemented on Xilinx Virtex-4 FPGA device. Architecture is modeled in verilog-HDL and synthesized using Xilinx ISE 14.1 design software and is found to be more efficient in terms of area than the existing such architectures.

Author 1: Sunil Devidas Bobade

Author 2: Dr.Vijay R. Mankar

Keywords: Cryptography; Elliptic Curve Cryptography; Double Point Multiplication; Binary Elliptic Curve; Differential Addition Chain

Paper 5: Memetic Multi-Objective Particle Swarm Optimization-Based Energy-Aware Virtual Network Embedding

Abstract: In cloud infrastructure, accommodating multiple virtual networks on a single physical network reduces power consumed by physical resources and minimizes cost of operating cloud data centers. However, mapping multiple virtual network resources to physical network components, called virtual network embedding (VNE), is known to be NP-hard. With considering energy efficiency, the problem becomes more complicated. In this paper, we model energy-aware virtual network embedding, devise metrics for evaluating performance of energy aware virtual network-embedding algorithms, and propose an energy aware virtual network-embedding algorithm based on multi-objective particle swarm optimization augmented with local search to speed up convergence of the proposed algorithm and improve solutions quality. Performance of the proposed algorithm is evaluated and compared with existing algorithms using extensive simulations, which show that the proposed algorithm improves virtual network embedding by increasing revenue and decreasing energy consumption.

Author 1: Ashraf A. Shahin

Keywords: energy-efficient resource management; green computing; virtual network embedding; cloud computing; resource allocation; substrate network fragmentation

Paper 6: Predictable CPU Architecture Designed for Small Real-Time Application - Concept and Theory of Operation

Abstract: The purpose of this paper is to describe an predictable CPU architecture, based on the five stage pipeline assembly line and a hardware scheduler engine. We aim at developing a fine-grained multithreading implementation, named nMPRA-MT. The new proposed architecture uses replication and remapping techniques for the program counter, the register file, and the pipeline registers and is implemented with a FPGA device. An original implementation of a MIPS processor with thread interleaved pipeline is obtained, using dynamic scheduling of hard real-time tasks and interrupts. In terms of interrupts handling, the architecture uses a particular method consisting of assigning interrupts to tasks, which insures an efficient control for both the context switch, and the system real-time behavior. The originality of the approach resides in the predictability and spatial isolation of the hard real-time tasks, executed every two clock cycles. The nMPRA-MT architecture is enabled by an innovative scheme of predictable scheduling algorithm, without stalling the pipeline assembly line.

Author 1: Nicoleta Cristina GAITAN

Author 2: Ionel ZAGAN

Author 3: Vasile Gheorghita GAITAN

Keywords: fine-grained multithreading; hardware scheduler; pipeline; hard real-time; predictable

Paper 7: Classification of Ultrasound Kidney Images using PCA and Neural Networks

Abstract: In this paper, a computer-aided system is proposed for automatic classification of Ultrasound Kidney diseases. Images of five classes: Normal, Cyst, Stone, Tumor and Failure were considered. A set of statistical features and another set of multi-scale wavelet-based features were extracted from the region of interest (ROI) of each image and the principal component analysis was performed to reduce the number of features. The selected features were utilized in the design and training of a neural network classifier. A correct classification rate of 97% has been obtained using the multi-scale wavelet-based features.

Author 1: Mariam Wagih Attia

Author 2: F.E.Z. Abou-Chadi

Author 3: Hossam El-Din Moustafa

Author 4: Nagham Mekky

Keywords: Ultrasound kidney images; Feature Extraction; Principal Component Analysis; Neural Network classifier

Paper 8: Robot Path Planning Based on Random Coding Particle Swarm Optimization

Abstract: Mobile robot navigation is to find an optimal path to guide the movement of the robot, so path planning is guaranteed to find a feasible optimal path. However, the path planning problem must be solve two problems, i.e., the path must be kept away from obstacles or avoid the collision with obstacles and the length of path should be minimized. In this paper, a path planning algorithm based on random coding particle swarm optimization (RCPSO) algorithm is proposed to get the optimal collision-free path. Dijstra algorithm is applied to search a sub-optimal collision-free path in our algorithm; then the RCPSO algorithm is developed to tackle this optimal path planning problem in order to generate the global optimal path. The crossover operator of genetic algorithm and random coding are introduced into the particle swarm optimization to optimize the location of the sub-optimal path. The experiment results show that the proposed method is effective and feasible compared with different algorithms.

Author 1: Kun Su

Author 2: YuJia Wang

Author 3: XinNan Hu

Keywords: robot path planning; Dijsktra algorithm; random coding; particle swarm optimization

Paper 9: Automatic Construction of Java Programs from Functional Program Specifications

Abstract: This paper presents a novel approach to construct Java programs automatically from the input functional program specifications on natural numbers from the constructive proofs of the input specifications using an inductive theorem prover called Poiti'n. The construction of a Java program from the input functional program specification involves two phases. The theorem prover is used to construct a higher order functional (HOF) program from the input specification expressed as an existential theorem. A set of mapping rules for a Programming Language Translation System (PLTS) is defined for translating functional expressions to their semantic equivalent Java code. The generated functional program is translated into intermediate Java code in the form of a Java function using the PLTS module. The generated Java function requires a small refinement to obtain a syntactically correct Java function. This Java function is encapsulated within a user defined Java class as a member operation, which is invoked within a Java application class consisting of a main function by creating objects resulting in an executable Java program. The constructed functional program and the generated Java program both are correct with respect to the input specification as they produce the same output.

Author 1: Md. Humayun Kabir

Keywords: Functional Program Specification; Existential Theorems; Higher Order Functional Program; Mapping Rules; Programming Language Translation System; Java Program; Refinement

Paper 10: Electronic Human Resource Management (e-HRM) of Hotel Business in Phuket

Abstract: This research aims to study the pattern of the electronic human resources management (e-HRM) of the hotel business in Phuket. The study is conducted with the implementation of field data and in-depth interview of hotels’ HR managers. In consequence, the study reveals that the hotel business has applied the use of the e-HRM varying in job recruitment (15 percent), employee engagement (55 percent), organizational file structure (10 percent), idea and creativity exchanges (38 percent) and assessment system (6 percent). However, considered as 100 percent, the hotel business has not prepared to apply the use of the e-HRM in salary system, learning and training program, welfare allocation and career development.

Author 1: Kitimaporn Choochote

Author 2: Kitsiri Chochiang

Keywords: electronic human resource management; e-HRM; hotel business; e-learning; Management

Paper 11: Modeling Mechanical and Electrical Uncertain Systems using Functions of Robust Control MATLAB Toolbox®3

Abstract: Uncertainty is inherent property of all real life control systems, and this is due to that there is nothing constant practically; all parameters are going to change under some environmental circumstances, therefore control engineers must not ignore this changing since it can affect the behavior and the performance of the system. In this paper a critical research method for modeling uncertain systems is demonstrated with the utilization of built in robust control Matlab Toolbox®3 functions. Good results were obtained for testing the stability of interval linear time invariant systems. Finally mechanical and electrical uncertain systems were implemented as practical example to validate the uncertainty.

Author 1: Mohammed Tawfik Hussein

Keywords: uncertainty; interval; robust stability; system response; nyquist criteria; root bounds

Paper 12: Vulnerability of the Process Communication Model in Bittorrent Protocol

Abstract: BitTorrent is the most extensively used protocol in peer-to-peer systems. Its clients are widely spread worldwide and account for a large fraction of today’s Internet traffic. This paper will discuss potential attack that exploits a certain vulnerability of BitTorrent based systems. Code injection refers to force a code – which may be malicious - to run inside another benign code, by inserting it into known process name or process ID. Operating systems supply API functions that can be used by third party to inject a few lines of malicious code inside the original running process, which can effectively damage or harm user resources. Ethernet is the most common internetwork layer for Local Area Networks; the shared medium of LAN enables all users on the same broadcasting domain to listen to all exchanged packets through the network (promiscuous mode), so any adversary can easily perform a simple packet sniffing process on the medium access layer of the network. By capturing and analyzing the sent packets from the P2P application, an adversary can use the revealed process ID by BitTorrent protocol to start the code injection action. So the adversary will be able to seize more machines from the network. Controlled machines can be used to perform many attacks. The study revealed that any adversary can exploit the vulnerability of the process communication model used in P2P by injecting any malicious process inside the BitTorrent application itself exposed by sniffing the exchanged BitTorrent packets through LAN.

Author 1: Ahmed ElShafee

Keywords: Peer-to-Peer security; BitTorrent protocol; Code injection; Packets sniffing, Ethernet LAN

Paper 13: A Simple and Reliable Method for the Evaluation of the Exposed Field Near the GSM Antenna

Abstract: The objective of this paper is to present a simple, accurate and very efficient method for the evaluation of the field in the vicinity of GSM antennas of the radio base-station in urban areas. The method is based on the replacement of the antenna panel with a group of discrete source emitters. A geometrical approximation is used for the evaluation of the environment’s influence also. The calculated results are compared with results taken from the use of NARDA SRM 3000 measuring equipment. The presented method could be successfully used for the exposure evaluation of the electromagnetic field emitted by GSM antennas of the base-station in urban areas.

Author 1: Algenti Lala

Author 2: Bexhet Kamo

Author 3: Vladi Kolici

Author 4: Shkelzen Cakaj

Keywords: evaluation; electromagnetic field;near field; NARDA SRM 3000; base-station

Paper 14: A Novel Distributed Intrusion Detection System for Vehicular Ad Hoc Networks

Abstract: In the new interconnected world, we need to secure vehicular cyber-physical systems (VCPS) using sophisticated intrusion detection systems. In this article, we present a novel distributed intrusion detection system (DIDS) designed for a vehicular ad hoc network (VANET). By combining static and dynamic detection agents, that can be mounted on central vehicles, and a control center where the alarms about possible attacks on the system are communicated, the proposed DIDS can be used in both urban and highway environments for real time anomaly detection with good accuracy and response time.

Author 1: Leandros A. Maglaras

Keywords: VANET; Intrusion Detection; OCSVM

Paper 15: Knowledge Level Assessment in e-Learning Systems Using Machine Learning and User Activity Analysis

Abstract: Electronic Learning has been one of the foremost trends in education so far. Such importance draws the attention to an important shift in the educational paradigm. Due to the complexity of the evolving paradigm, the prospective dynamics of learning require an evolution of knowledge delivery and evaluation. This research work tries to put in hand a futuristic design of an autonomous and intelligent e-Learning system. In which machine learning and user activity analysis play the role of an automatic evaluator for the knowledge level. It is important to assess the knowledge level in order to adapt content presentation and to have more realistic evaluation of online learners. Several classification algorithms are applied to predict the knowledge level of the learners and the corresponding results are reported. Furthermore, this research proposes a modern design of a dynamic learning environment that goes along the most recent trends in e-Learning. The experimental results illustrate an overall performance superiority of a support vector machine model in evaluating the knowledge levels; having 98.6%of correctly classified instances with 0.0069 mean absolute error.

Author 1: Nazeeh Ghatasheh

Keywords: Concept Maps; Multi-Class Classification; Machine Learning; Electronic Learning; Activity Analysis

Paper 16: Lossless Quality Steganographic Color Image Compression

Abstract: This paper develops a steganography-based paradigm for lossless-quality compression of high-resolution color images acquired by megapixel cameras. Our scheme combines space-domain and frequency-domain image processing operations where in the space domain, color-brightness separation is exploited, and in the frequency domain, spectral properties of the Fourier magnitude and phase of the color image is exploited. Working in both domains concurrently allows for an approach to ultrahigh-resolution image compression that addresses both issues of quality and storage size. Experimental results as well as empirical observations show that our technique exceeds the highest quality JPEG image compression standard in terms of compression rates while being very competitive with JPEG in the overall fidelity of the decompressed image, with the added advantage of being able to recover the original fine details in the color image without any degradations common in lossy image compression techniques.

Author 1: Tamer Rabie

Keywords: Lossless Quality Compression; Steganography; Color Image Compression; Lab color space; RGB color space, Frequency Domain Data Hiding

Paper 17: Visualization of Input Parameters for Stream and Pathline Seeding

Abstract: Uncertainty arises in all stages of the visualization pipeline. However, the majority of flow visualization applications convey no uncertainty information to the user. In tools where uncertainty is conveyed, the focus is generally on data, such as error that stems from numerical methods used to generate a simulation or on uncertainty associated with mapping visualiza-tion primitives to data. Our work is aimed at another source of uncertainty - that associated with user-controlled input param-eters. The navigation and stability analysis of user-parameters has received increasing attention recently. This work presents an investigation of this topic for flow visualization, specifically for three-dimensional streamline and pathline seeding. From a dynamical systems point of view, seeding can be formulated as a predictability problem based on an initial condition. Small perturbations in the initial value may result in large changes in the streamline in regions of high unpredictability. Analyzing this predictability quantifies the perturbation a trajectory is subjugated to by the flow. In other words, some predictions are less certain than others as a function of initial conditions. We introduce novel techniques to visualize important user input parameters such as streamline and pathline seeding position in both space and time, seeding rake position and orientation, and inter-seed spacing. The implementation is based on a metric which quantifies similarity between stream and pathlines. This is important for Computational Fluid Dynamics (CFD) engineers as, even with the variety of seeding strategies available, manual seeding using a rake is ubiquitous. We present methods to quantify and visualize the effects that changes in user-controlled input parameters have on the resulting stream and pathlines. We also present various visualizations to help CFD scientists to intuitively and effectively navigate this parameter space. The reaction from a domain expert in fluid dynamics is also reported.

Author 1: Tony McLoughlin

Author 2: Matt Edmunds

Author 3: Chao Tong

Author 4: Robert S Laramee

Author 5: Ian Masters

Author 6: Guoning Chen

Author 7: Nelson Max

Author 8: Harry Yeh

Author 9: Eugene Zhang

Keywords: Seeding Parameter Sensitivity, Uncertainty, Ex-ploratorive Visualization.

Paper 18: Case-Based Reasoning for Selecting Study Program in Senior High School

Abstract: One of the reasoning methods in expert system is Case-Based Reasoning (CBR). A problem is searching for past cases in the case base with thehighest similarity degree. This implies that calculation of similarity degree among the cases is an important aspect in CBR. In this study, an application of computer reasoning system based on CBR is developed for selecting study program in Senior High School (SHS). This aplication can be used to assist students for selecting study program. The cases used in the study include results of the intelligence test, student’s interest, and grades of several subjects.Each case in the case base will be calculated for the similarity degree with new cases entered. Furthermore, it is the cases with highest similarity degree that are recommended as solutions.

Author 1: Sri Mulyana

Author 2: Sri Hartati

Author 3: Retantyo Wardoyo

Author 4: Edi Winarko

Keywords: Case Based Reasoning; Case retrieval; similarity degree; new cases; recommended solutions;selecting study program

Paper 19: Menu Positioning on Web Pages. Does it Matter?

Abstract: This paper concerns an investigation by the authors into the efficiency and user opinions of menu positioning in web pages. While the idea and use of menus on web pages is not new, the authors feel there is not enough empirical evidence to help designers choose an appropriate menu position. We therefore present the design and results of an empirical experiment, investigating the usability of menu positioning on web pages. A four condition experiment was conducted by the authors. Each condition tested a different menu position. The menu positions tested were left vertical, right vertical, top horizontal and bottom horizontal. The context was a fictitious online store. The results, based on statistical analysis and statistically significant findings, suggest that the top horizontal and left vertical positioned menus incurred fewer errors and fewer mouse clicks. Furthermore, the user satisfaction ratings were in line with the efficiency aspects observed.

Author 1: Dr Pietro Murano

Author 2: Tracey J. Lomas

Keywords: User interfaces; menu design; Interface navigation; evaluation; usability; universal design

Paper 20: Cost Optimization of Cloud Computing Services in a Networked Environment

Abstract: Cloud computing service providers' offer their customers' services maximizing their revenues, whereas customers wish to minimize their costs. In this paper we shall concentrate on consumers' point of view. Cloud computing services are composed of services organized according to a hierarchy of software application services, beneath them platform services which also use infrastructure services. Providers currently offer software services as bundles consisting of services which include the software, platform and infrastructure services. Providers also offer platform services bundled with infrastructure services. Bundling services prevent customers from splitting their service purchases between a provider of software and a different provider of the underlying platform or infrastructure. This bundling policy is likely to change in the long run since it contradicts economic competition theory, causing an unfair pricing model and locking-in consumers to specific service providers. In this paper we assume the existence of a free competitive market, in which consumers are free to switch their services among providers. We assume that free market competition will enforce vendors to adopt open standards, improve the quality of their services and suggest a large variety of cloud services in all layers. Our model is aimed at the potential customer who wishes to find the optimal combination of service providers which minimizes his costs. We propose three possible strategies for implementation of the model in organizations. We formulate the mathematical model and illustrate its advantages compared to existing pricing practices used by cloud computing consumers.

Author 1: Eli WEINTRAUB

Author 2: Yuval COHEN

Keywords: Cloud Computing; Pricing Model; Cost optimization; Software as a service; Platform as a service; Infrastructure as a service