An Optimal Algorithm for Resource Allocation in D2D Communication

The number of mobile devices accessing wireless networks is skyrocketing due to the rapid advancement of sensors and wireless communication technology. In the upcoming years, it is anticipated that mobile data traffic would rise even more. The development of a new cellular network paradigm is being driven by the Internet of Things, smart homes, and more sophisticated applications with greater data rates and latency requirements. Resources are being used up quickly due to the steady growth of smartphone devices and multimedia apps. Computation offloading to either several distant clouds or close mobile devices has consistently improved the performance of mobile devices. The computation latency can also be decreased by offloading computing duties to edge servers with a specific level of computing power. Device-to-device (D2D) collaboration can assist in processing small-scale activities that are time-sensitive in order to further reduce task delays. The task offloading performance is drastically reduced due to the variation of different performance capabilities of edge nodes. Therefore, this paper addressed this problem and proposed a new method for D2D communication. In this method, the time delay is reduced by enabling the edge nodes to exchange data samples. Simulation results show that the proposed algorithm has better performance than traditional algorithm.     

Dynamic storage and access load balancing for answering range queries in peer-to-peer networks

Recently, many applications have used Peer-to-Peer (P2P) systems to overcome the current problems with client/server systems such as non-scalability, high bandwidth requirement and single point of failure. In this paper, we propose an efficient scheme to support efficient range query processing over structured P2P systems, while balancing both the storage load and access load. The paper proposes a rotating token scheme to balance the storage load by placing joining nodes in appropriate locations in the identifier space to share loads with already overloaded nodes. Then, to support range queries, we utilize an order-preserving mapping function to map keys to nodes in order preserving way and without hashing. This may result in an access load imbalance due to non-uniform distribution of keys in the identifier space. Thus, we propose an adaptive replication scheme to relieve overloaded nodes by shedding some load on other nodes to balance the access load. We derive a formula for estimating the overhead of the proposed adaptive replication scheme. In this study, we carry simulation experiments with synthetic data to measure the performance of the proposed schemes. Our simulation experiments show significant gains in both storage load balancing and access load balancing.     

The mask of (2b + 4)-point n-ary subdivision scheme

In this paper, we present general formulae for the mask of (2b + 4)-point n-ary approximating as well as interpolating subdivision schemes for any integers ${b\,\geqslant\,0}$ and ${n\,\geqslant\,2}$ . These formulae corresponding to the mask not only generalize and unify several well-known schemes but also provide the mask of higher arity schemes. Moreover, the 4-point and 6-point a-ary schemes introduced by Lian [Appl Appl Math Int J 3(1):18–29, 2008] are special cases of our general formulae.     

Empirical modeling of splitting tensile strength from cylinder compressive strength of concrete by genetic programming

Compressive strength and splitting tensile strength are both mechanical properties of concrete that are utilized in structural design. This study presents gene expression programming (GEP) as a new tool for the formulations of splitting tensile strength from compressive strength of concrete. For purpose of building the GEP-based formulations, 536 experimental data have been gathered from existing literature. The GEP-based formulations are developed for splitting tensile strength of concrete as a function of age of specimen and cylinder compressive strength. In experimental parts of this study, cylindrical specimens of 150 × 300 mm and 100 × 200 mm in dimensions are utilized. Training and testing sets of the GEP-based formulations are randomly separated from the complete experimental data. The GEP-based formulations are also validated with additional 173 data of experimental results other than the data used in training and testing sets of the GEP-based formulations. All of the results obtained from the GEP-based formulations are compared with the results obtained from experimental data, the developed regression-based formulation and formulas given by some national building codes. These comparisons showed that the GEP-based formulations appeared to well agree with the experimental data and found to be quite reliable.     

On the qualitative behaviors of solutions of third order nonlinear differential equations

We present some new results about oscillation and asymptotic behavior of solutions of third order nonlinear differential equations of the form

(r₂(t)(r₁(t)y^′)^′)^′+p(t)y^′+q(t)f(y(g(t)))=0.     

An expert system for automated recognition of patients with obstructive sleep apnea using electrocardiogram recordings

Obstructive sleep apnea (OSA) is a highly prevalent sleep disorder. The traditional diagnosis methods of the disorder are cumbersome and expensive. The ability to automatically identify OSA from electrocardiogram (ECG) recordings is important for clinical diagnosis and treatment. In this study, we proposed an expert system based on discrete wavelet transform (DWT), fast-Fourier transform (FFT) and least squares support vector machine (LS-SVM) for the automatic recognition of patients with OSA from nocturnal ECG recordings. Thirty ECG recordings collected from normal subjects and subjects with sleep apnea, each of approximately 8 h in duration, were used throughout the study. The proposed OSA recognition system comprises three stages. In the first stage, an algorithm based on DWT was used to analyze ECG recordings for the detection of heart rate variability (HRV) and ECG-derived respiration (EDR) changes. In the second stage, an FFT based power spectral density (PSD) method was used for feature extraction from HRV and EDR changes. Then, a hill-climbing feature selection algorithm was used to identify the best features that improve classification performance. In the third stage, the obtained features were used as input patterns of the LS-SVM classifier. Using the cross-validation method, the accuracy of the developed system was found to be 100% for using a subset of selected combination of HRV and EDR features. The results confirmed that the proposed expert system has potential for recognition of patients with suspected OSA by using ECG recordings.     

Prediction of performance and exhaust emissions of a diesel engine fueled with biodiesel produced from waste frying palm oil

Biodiesel is receiving increasing attention each passing day because of its fuel properties and compatibility with the petroleum-based diesel fuel (PBDF). Therefore, in this study, the prediction of the engine performance and exhaust emissions is carried out for five different neural networks to define how the inputs affect the outputs using the biodiesel blends produced from waste frying palm oil. PBDF, B100, and biodiesel blends with PBDF, which are 50% (B50), 20% (B20) and 5% (B5), were used to measure the engine performance and exhaust emissions for different engine speeds at full load conditions. Using the artificial neural network (ANN) model, the performance and exhaust emissions of a diesel engine have been predicted for biodiesel blends. According to the results, the fifth network is sufficient for all the outputs. In the fifth network, fuel properties, engine speed, and environmental conditions are taken as the input parameters, while the values of flow rates, maximum injection pressure, emissions, engine load, maximum cylinder gas pressure, and thermal efficiency are used as the output parameters. For all the networks, the learning algorithm called back-propagation was applied for a single hidden layer. Scaled conjugate gradient (SCG) and Levenberg–Marquardt (LM) have been used for the variants of the algorithm, and the formulations for outputs obtained from the weights are given in this study. The fifth network has produced R² values of 0.99, and the mean % errors are smaller than five except for some emissions. Higher mean errors are obtained for the emissions such as CO, NO_x and UHC. The complexity of the burning process and the measurement errors in the experimental study can cause higher mean errors.     

Polymorphic bytecode instrumentation

Bytecode instrumentation is a widely used technique to implement aspect weaving and dynamic analyses in virtual machines such as the Java virtual machine. Aspect weavers and other instrumentations are usually developed independently and combining them often requires significant engineering effort, if at all possible. In this article, we present polymorphic bytecode instrumentation(PBI), a simple but effective technique that allows dynamic dispatch amongst several, possibly independent instrumentations. PBI enables complete bytecode coverage, that is, any method with a bytecode representation can be instrumented. We illustrate further benefits of PBI with three case studies. First, we describe how PBI can be used to implement a comprehensive profiler of inter‐procedural and intra‐procedural control flow. Second, we provide an implementation of execution levels for AspectJ, which avoids infinite regression and unwanted interference between aspects. Third, we present a framework for adaptive dynamic analysis, where the analysis to be performed can be changed at runtime by the user. We assess the overhead introduced by PBI and provide thorough performance evaluations of PBI in all three case studies. We show that pure Java profilers like JP2 can, thanks to PBI, produce accurate execution profiles by covering all code, including the core Java libraries. We then demonstrate that PBI‐based execution levels are much faster than control flow pointcuts to avoid interference between aspects and that their efficient integration in a practical aspect language is possible. Finally, we report that PBI enables adaptive dynamic analysis tools that are more reactive to user inputs than existing tools that rely on dynamic aspect‐oriented programming with runtime weaving. These experiments position PBI as a widely applicable and practical approach for combining bytecode instrumentations. © 2015 The Authors. Software: Practice and Experience Published by John Wiley & Sons Ltd.     

PETOOL: MATLAB-based one-way and two-way split-step parabolic equation tool for radiowave propagation over variable terrain

A MATLAB-based one-way and two-way split-step parabolic equation software tool (PETOOL) has been developed with a user-friendly graphical user interface (GUI) for the analysis and visualization of radio-wave propagation over variable terrain and through homogeneous and inhomogeneous atmosphere. The tool has a unique feature over existing one-way parabolic equation (PE)-based codes, because it utilizes the two-way split-step parabolic equation (SSPE) approach with wide-angle propagator, which is a recursive forward–backward algorithm to incorporate both forward and backward waves into the solution in the presence of variable terrain. First, the formulation of the classical one-way SSPE and the relatively-novel two-way SSPE is presented, with particular emphasis on their capabilities and the limitations. Next, the structure and the GUI capabilities of the PETOOL software tool are discussed in detail. The calibration of PETOOL is performed and demonstrated via analytical comparisons and/or representative canonical tests performed against the Geometric Optic (GO) + Uniform Theory of Diffraction (UTD). The tool can be used for research and/or educational purposes to investigate the effects of a variety of user-defined terrain and range-dependent refractivity profiles in electromagnetic wave propagation.

Program summary

Program title: PETOOL (Parabolic Equation Toolbox)Catalogue identifier: AEJS_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEJS_v1_0.htmlProgram obtainable from: CPC Program Library, Queen?s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 143 349No. of bytes in distributed program, including test data, etc.: 23 280 251Distribution format: tar.gzProgramming language: MATLAB (MathWorks Inc.) 2010a. Partial Differential Toolbox and Curve Fitting Toolbox requiredComputer: PCOperating system: Windows XP and VistaClassification: 10Nature of problem: Simulation of radio-wave propagation over variable terrain on the Earth?s surface, and through homogeneous and inhomogeneous atmosphere.Solution method: The program implements one-way and two-way Split-Step Parabolic Equation (SSPE) algorithm, with wide-angle propagator. The SSPE is, in general, an initial-value problem starting from a reference range (typically from an antenna), and marching out in range by obtaining the field along the vertical direction at each range step, through the use of step-by-step Fourier transformations. The two-way algorithm incorporates the backward-propagating waves into the standard one-way SSPE by utilizing an iterative forward–backward scheme for modeling multipath effects over a staircase-approximated terrain.Unusual features: This is the first software package implementing a recursive forward–backward SSPE algorithm to account for the multipath effects during radio-wave propagation, and enabling the user to easily analyze and visualize the results of the two-way propagation with GUI capabilities.Running time: Problem dependent. Typically, it is about 1.5 ms (for conducting ground) and 4 ms (for lossy ground) per range step for a vertical field profile of vector length 1500, on Intel Core 2 Duo 1.6 GHz with 2 GB RAM under Windows Vista.     

Development of an auxiliary system for the execution of vascular catheter interventions with a reduced radiological risk; system description and first experimental results

Vascular catheterization is a common procedure in clinical medicine. It is normally performed by a specialist using an X-ray fluoroscopic guide and contrast-media. In the present paper, an image-guided navigation system which indicates a path providing guidance to the desired target inside the vascular tree is described with the aim of reducing the exposure of personnel and patients to X-rays during the catheterization procedure. A 3D model of the patient vascular tree, reconstructed with data collected by an angiography before starting the intervention, is used as a guide map instead of fluoroscopic scans. An accurate spatial correspondence between the body of the patient and the 3D reconstructed vascular model is established and, by means of a position indicator installed over the catheter tip, the real-time position/orientation of the tip is indicated correctly. This paper describes the system and the operational procedures necessary to use the proposed method efficiently during a catheter intervention. Preliminary experimental results on a phantom are also reported.