Development and Verification of Simulation Model Based on Real MANET Experiments for Transport Layer Protocols （UDP and TCP）

There is a lack of appropriate guidelines for realistic user traces, mobility models, routing protocols, considerations of real-life challenges, etc. for general-purpose mobile ad hoc networks (MANET). In this paper, four laptops are used in an open field environment in four scenarios to evaluate the performances of Internet control message protocol (ICMP) based ping and transmission control protocol (TCP) based streaming video applications using optimised link state routing (OLSR) implementation in an IEEE 802.11g wireless network. Corresponding simulations are developed in Network Simulator ns-2 by setting simulation parameters according to the real experiments. Difficulties faced to regenerate real-life scenarios have been discussed and the gaps between reality and simulation are identified. A setup guideline to produce realistic simulation results has been established.     

Continuous size-based focusing and bifurcating microparticle streams using a negative dielectrophoretic system

Dielectrophoresis (DEP) is an electrokinetic phenomenon which is used for manipulating micro- and nanoparticles in micron-sized devices with high sensitivity. In recent years, electrode-based DEP by patterning narrow oblique electrodes in microchannels has been used for particle manipulation. In this theoretic study, a microchannel with triangular electrodes is presented and a detailed comparison with oblique electrodes is made. For each shape, the behavior of particles is compared for three different configurations of applied voltages. Electric field, resultant DEP force, and particle trajectories for configurations are computed by means of Rayan native code. The separation efficiency of the two systems is assessed and compared afterward. The results demonstrate higher lateral DEP force, responsible for particle separation, distributed wider across the channel width for triangular shape electrodes in comparison with the oblique ones. The proposed electrode shape also shows the ability of particle separation by attracting negative DEP particles to or propelling them from the flow centerline, according to the configuration of applied voltages. A major deficiency of the oblique electrodes, which is the streamwise variation of the lateral DEP force direction near the electrodes, is also eliminated in the proposed electrode shape. In addition, with a proper voltages configuration, the triangular electrodes require lower voltages for particle focusing in comparison with the oblique ones.     

Data-Intensive Cloud Computing: Requirements, Expectations, Challenges, and Solutions

Data-intensive systems encompass terabytes to petabytes of data. Such systems require massive storage and intensive computational power in order to execute complex queries and generate timely results. Further, the rate at which this data is being generated induces extensive challenges of data storage, linking, and processing. A data-intensive cloud provides an abstraction of high availability, usability, and efficiency to users. However, underlying this abstraction, there are stringent requirements and challenges to facilitate scalable and resourceful services through effective physical infrastructure, smart networking solutions, intelligent software tools, and useful software approaches. This paper analyzes the extensive requirements which exist in data-intensive clouds, describes various challenges related to the paradigm, and assess numerous solutions in meeting these requirements and challenges. It provides a detailed study of the solutions and analyzes their capabilities in meeting emerging needs of widespread applications.     

Behavioral Attestation for Web Services using access policies

Service Oriented Architecture with underlying technologies like web services and web service orchestration opens new vistas for integration among business processes operating in heterogeneous environments. However, such dynamic collaborations require a highly secure environment at each respective business partner site. Existing web services standards address the issue of security only on the service provider platform. The partner platforms to which sensitive information is released have till now been neglected. Remote Attestation is a relatively new field of research which enables an authorized party to verify that a trusted environment actually exists on a partner platform. To incorporate this novel concept in to the web services realm, a new mechanism called WS-Attestation has been proposed. This mechanism provides a structural paradigm upon which more fine-grained solutions can be built. In this paper, we present a novel framework, Behavioral Attestation for Web Services, in which XACML is built on top of WS-Attestation in order to enable more flexible remote attestation at the web services level. We propose a new type of XACML policy called XACML behavior policy, which defines the expected behavior of a partner platform. Existing web service standards are used to incorporate remote attestation at the web services level and a prototype is presented, which implements XACML behavior policy using low-level attestation techniques.     

Permeability prediction and construction of 3D geological model: application of neural networks and stochastic approaches in an Iranian gas reservoir

Determination of petrophysical parameters by using available data has a specific importance in exploration and production studies for oil and gas industries. Modeling of corrected permeability as a petrophysical parameter can help in decision making processes. The objective of this study is to construct a comprehensive and quantitative characterization of a carbonate gas reservoir in marine gas field. Artificial neural network is applied for prediction of permeability in accordance with other petrophysical parameters at well location. Correlation coefficient for this method is 84 %. In the study, the geological reservoir model is developed in two steps: First, the structure skeleton of the field is constructed, and then, reservoir property is distributed within it by applying new stochastic methods. Permeability is modeled by three techniques: kriging, sequential Gaussian simulation (SGS) and collocated co-simulation using modeled effective porosity as 3D secondary variable. This paper enhances the characterization of the reservoir by improving the modeling of permeability through a new algorithm called collocated co-simulation. Kriging is very simple in modeling the reservoir permeability, and also, original distribution of the data changes considerably in this model. In addition, the SGS model is noisy and heterogeneous, but it retains the original distribution of the data. However, the addition of a 3D secondary variable in third method resulted in a much more reliable model of permeability.     

Modeling and robust discrete LQ repetitive control of electrically driven robots

Discrete linear quadratic control has been efciently applied to linear systems as an optimal control.However,a robotic system is highly nonlinear,heavily coupled and uncertain.To overcome the problem,the robotic system can be modeled as a linear discrete-time time-varying system in performing repetitive tasks.This modeling motivates us to develop an optimal repetitive control.The contribution of this paper is twofold.For the frst time,it presents discrete linear quadratic repetitive control for electrically driven robots using the mentioned model.The proposed control approach is based on the voltage control strategy.Second,uncertainty is efectively compensated by employing a robust time-delay controller.The uncertainty can include parametric uncertainty,unmodeled dynamics and external disturbances.To highlight its ability in overcoming the uncertainty,the dynamic equation of an articulated robot is introduced and used for the simulation,modeling and control purposes.Stability analysis verifes the proposed control approach and simulation results show its efectiveness.     

Fault localization algorithm in computer networks by employing a genetic algorithm

Abstract

Fault localization is an important part in communication networks. Faults are unwanted and unavoidable in communication systems, and hence, their quick detection and localization is essential for sustaining the health of the network. This paper proposes an end-to-end approach that uses passive measurements for fault localization in communication networks. We formulate the fault localisation issue as an optimisation problem and then employ the genetic algorithm technique to solve it. Extensive simulation results show that although our algorithm needs to test only a small set of network components to localise all faults, it can infer the faulty nodes in at least 97% of cases. This simulation shows that the proposed algorithm, called genetic algorithm-based fault localisation is superior to the other approaches to localise all faults in a network.     

Sound source localization using compressive sensing-based feature extraction and spatial sparsity

In this paper, we propose a source localization algorithm based on a sparse Fast Fourier Transform (FFT)-based feature extraction method and spatial sparsity. We represent the sound source positions as a sparse vector by discretely segmenting the space with a circular grid. The location vector is related to microphone measurements through a linear equation, which can be estimated at each microphone. For this linear dimensionality reduction, we have utilized a Compressive Sensing (CS) and two-level FFT-based feature extraction method which combines two sets of audio signal features and covers both short-time and long-time properties of the signal. The proposed feature extraction method leads to a sparse representation of audio signals. As a result, a significant reduction in the dimensionality of the signals is achieved. In comparison to the state-of-the-art methods, the proposed method improves the accuracy while the complexity is reduced in some cases.     

A hybrid metaheuristic approach for the capacitated p-median problem

The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considering distances and capacities for the services to be given by each median. This paper presents an efficient hybrid metaheuristic algorithm by combining a proposed cutting-plane neighborhood structure and a tabu search metaheuristic for the CPMP. In the proposed neighborhood structure to move from the current solution to a neighbor solution, an open median is selected and closed. Then, a linear programming (LP) model is generated by relaxing binary constraints and adding new constraints. The generated LP solution is improved using cutting-plane inequalities. The solution of this strong LP is considered as a new neighbor solution. In order to select an open median to be closed, several strategies are proposed. The neighborhood structure is combined with a tabu search algorithm in the proposed approach. The parameters of the proposed hybrid algorithm are tuned using design of experiments approach. The proposed algorithm is tested on several sets of benchmark instances. The statistical analysis shows efficiency and effectiveness of the hybrid algorithm in comparison with the best approach found in the literature.     

Increasing image compression rate using steganography

The goal of image compression is to remove the redundancies for minimizing the number of bits required to represent an image while steganography works by embedding the secret data in redundancies of the image in invisibility manner. Our focus in this paper is the improvement of image compression through steganography. Even if the purposes of digital steganography and data compression are by definition contradictory, we use these techniques jointly to compress an image. Hence, two schemes exploring this idea are suggested. The first scheme combines a steganographic algorithm with the baseline DCT-based JPEG, while the second one uses this steganographic algorithm with the DWT-based JPEG. In this study data compression is performed twice. First, we take advantage of energy compaction using JPEG to reduce redundant data. Second, we embed some bit blocks within its subsequent blocks of the same image with steganography. The embedded bits not only increase file size of the compressed image, but also decrease the file size further more. Experimental results show for this promising technique to have wide potential in image coding.