EVALUATION OF SURFACE FORCE-PORE FLOW AND MODIFIED SURFACE FORCE-PORE FLOW MODELS FOR REVERSE OSMOSIS TRANSPORT

The surface force-pore flow (SF-PF) model of reverse osmosis transport and the extended and modified form (the MD-SF-PF model) have been employed to predict the performance of four aromatic polyamide (FilmTec, FT30)reverse osmosis membranes. The evaluation is based on a comparison of model predictions with experimental data. Dilute sodium chloride-water solution experimental data were used to estimate model parameters. The models are then used to predict flux and separation at various operating pressures and concentrations. Membrane performance (i.e., separation and permeate flux) can be well predicted by the MD-SF-PF model while the SF-PF model predicts the performance for the sodium chloride system less satisfactorily.     

Proactive discovery protocol with security enhancement for D2D communication system

With the increase in mobile traffic and the band-width demand, Device-to-Device (D2D) communication has gained tremendous interest by the researchers, cellular operators and equipment manufacturers. However, D2D communication has been limited to study the converge services at cell edge. D2D users that located outside the cellular network coverage haven’t received enough attention. Some of the problems faced in this case are discovering process of neighbor user equipment (UE) and services, as well as designing suitable and secure protocols for D2D communication. Toward these problems, in this paper, we propose security enhancement for D2D communication based on modified elliptic curve cryptography (MECC), which provides greater efficiency in computational overhead, key sizes and bandwidths for user’s authentication applied on proactive routing protocol for neighbor and service discovery. We study Diffie–Hellman, ElGamal and MECC techniques to improve service of D2D users at cell edge. Results show that the proposed scheme can strength the secrecy with less control overhead and can increase the robustness in a wide range of scenarios for service discovery in D2D networks.

     

Design of a compact dual‐band folded‐waveguide bandpass filter using multilayer waveguide resonators

A novel compact dual‐band bandpass filter based on multilayer folded‐waveguide (FWG) structure is presented in this article.In this design, slots are used to realize direct coupling between adjacent resonators and apertures are adopted to implement cross coupling between non‐adjacent resonators.A new technique of external quality factor of FWG resonator and coupling coefficients between different resonators are studied using full‐wave simulator. In order to demonstrate the proposed technique, a four‐pole dual‐band bandpass filter is designed, fabricated and measured using vector network analyzer. Measurement results which are well agreed with simulation results are presented. Moreover, four‐pole substrate integrated folded waveguide SIFW dual‐band bandpass filter, using two layers of slotted folded waveguide resonators, is demonstrated. The proposed filter has a compact size and it is excellent candidate for the application of wireless communication systems. © 2015 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:780–788, 2015.     

Emotional Loneliness and Coping Strategies: A Reference to Older Malaysians at Nursing Homes

This article presents an in-depth qualitative study using a phenomenological approach to understand loneliness among elderly individuals in Malaysia. The objective of the study was to understand how the Malaysian elderly perceive and understand social isolation as well as loneliness, with the aim of identifying the factors that cause emotional loneliness among the elderly in nursing homes. In addition, this study also explored their coping strategies when dealing with loneliness. Semi-structured interviews were conducted with ten elderly participants from two different nursing homes in Kuala Lumpur and Selangor with representatives from the three major ethnic groups of Malaysia. Based on the results, there are several factors that cause the elderly to feel lonely – health factors, lack of family ties, and the lack of communication and cognitive factors, such as memory and perception. It was also found that internal (expectations and optimism) and external (work and activities) coping strategies play major roles in overcoming loneliness. In conclusion, some recommendations are made to respective party families and the government to consider when developing plans to help the elderly overcome loneliness, which could strengthen the family and social support system in Malaysia.     

Toward an efficient and scalable feature selection approach for internet traffic classification

There is significant interest in the network management and industrial security community about the need to identify the “best” and most relevant features for network traffic in order to properly characterize user behaviour and predict future traffic. The ability to eliminate redundant features is an important Machine Learning (ML) task because it helps to identify the best features in order to improve the classification accuracy as well as to reduce the computational complexity related to the construction of the classifier. In practice, feature selection (FS) techniques can be used as a preprocessing step to eliminate irrelevant features and as a knowledge discovery tool to reveal the “best” features in many soft computing applications. In this paper, we investigate the advantages and disadvantages of such FS techniques with new proposed metrics (namely goodness, stability and similarity). We continue our efforts toward developing an integrated FS technique that is built on the key strengths of existing FS techniques. A novel way is proposed to identify efficiently and accurately the “best” features by first combining the results of some well-known FS techniques to find consistent features, and then use the proposed concept of support to select a smallest set of features and cover data optimality. The empirical study over ten high-dimensional network traffic data sets demonstrates significant gain in accuracy and improved run-time performance of a classifier compared to individual results produced by some well-known FS techniques.     

Feature Selection for Detecting ICMPv6-Based DDoS Attacks Using Binary Flower Pollination Algorithm

Internet Protocol version 6 (IPv6) is the latest version of IP that goal to host 3.4 × 10³⁸ unique IP addresses of devices in the network. IPv6 has introduced new features like Neighbour Discovery Protocol (NDP) and Address Auto-configuration Scheme. IPv6 needed several protocols like the Address Auto-configuration Scheme and Internet Control Message Protocol (ICMPv6). IPv6 is vulnerable to numerous attacks like Denial of Service (DoS) and Distributed Denial of Service (DDoS) which is one of the most dangerous attacks executed through ICMPv6 messages that impose security and financial implications. Therefore, an Intrusion Detection System (IDS) is a monitoring system of the security of a network that detects suspicious activities and deals with a massive amount of data comprised of repetitive and inappropriate features which affect the detection rate. A feature selection (FS) technique helps to reduce the computation time and complexity by selecting the optimum subset of features. This paper proposes a method for detecting DDoS flooding attacks (FA) based on ICMPv6 messages using a Binary Flower Pollination Algorithm (BFPA-FA). The proposed method (BFPA-FA) employs FS technology with a support vector machine (SVM) to identify the most relevant, influential features. Moreover, The ICMPv6-DDoS dataset was used to demonstrate the effectiveness of the proposed method through different attack scenarios. The results show that the proposed method BFPA-FA achieved the best accuracy rate (97.96%) for the ICMPv6 DDoS detection with a reduced number of features (9) to half the total (19) features. The proven proposed method BFPA-FA is effective in the ICMPv6 DDoS attacks via IDS.     

Hybrid image steganography method using Lempel Ziv Welch and genetic algorithms for hiding confidential data

Multidimensional Systems and Signal Processing - Digital images are commonly used in steganography due to the popularity of digital image transfer and exchange through the Internet. However, the...     

Quantification of the inherent uncertainty in the relaxation modulus and creep compliance of asphalt mixes

Advanced material characterization of asphalt concrete is essential for realistic and accurate performance prediction of flexible pavements. However, such characterization requires rigorous testing regimes that involve mechanical testing of a large number of laboratory samples at various conditions and set-ups. Advanced measurement instrumentation in addition to meticulous and accurate data analysis and analytical representation are also of high importance. Such steps as well as the heterogeneous nature of asphalt concrete (AC) constitute major factors of inherent variability. Thus, it is imperative to model and quantify the variability of the needed asphalt material’s properties, mainly the linear viscoelastic response functions such as: relaxation modulus, \(E(t)\), and creep compliance, \(D(t)\). The objective of this paper is to characterize the inherent uncertainty of both \(E(t)\) and \(D(t)\) over the time domain of their master curves. This is achieved through a probabilistic framework using Monte Carlo simulations and First Order approximations, utilizing \(E^{*}\) data for six AC mixes with at least eight replicates per mix. The study shows that the inherent variability, presented by the coefficient of variation (COV), in \(E(t)\) and \(D(t)\) is low at small reduced times, and increases with the increase in reduced time. At small reduced times, the COV in \(E(t)\) and \(D(t)\) are similar in magnitude; however, differences become significant at large reduced times. Additionally, the probability distributions and COVs of \(E(t)\) and \(D(t)\) are mix dependent. Finally, a case study is considered in which the inherent uncertainty in \(D(t)\) is forward propagated to assess the effect of variability on the predicted number of cycles to fatigue failure of an asphalt mix.     

The use of coevolution and the artificial immune system for ensemble learning

This paper presents two new approaches for constructing an ensemble of neural networks (NN) using coevolution and the artificial immune system (AIS). These approaches are extensions of the CLONal Selection Algorithm for building ENSembles (CLONENS) algorithm. An explicit diversity promotion technique was added to CLONENS and a novel coevolutionary approach to build neural ensembles is introduced, whereby two populations representing the gates and the individual NN are coevolved. The former population is responsible for defining the ensemble size and selecting the members of the ensemble. This population is evolved using the differential evolution algorithm. The latter population supplies the best individuals for building the ensemble, which is evolved by AIS. Results show that it is possible to automatically define the ensemble size being also possible to find smaller ensembles with good generalization performance on the tested benchmark regression problems. More interestingly, the use of the diversity measure during the evolutionary process did not necessarily improve generalization. In this case, diverse ensembles may be found using only implicit diversity promotion techniques.     

Semantic partitioning of peer-to-peer search space

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be conceived as an ontology-based distributed hash table (DHT). Also, we introduce a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree. Further, we introduce a broadcast algorithm on the network. We present worst case analysis of both lookup and broadcast algorithms and measure their performance using simulation. The results show that our scheme is highly scalable and can be used in real P2P applications.