The robust knapsack problem with queries

We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse.     

Ions motion algorithm for solving optimization problems

This paper proposes a novel optimization algorithm inspired by the ions motion in nature. In fact, the proposed algorithm mimics the attraction and repulsion of anions and cations to perform optimization. The proposed algorithm is designed in such a way to have the least tuning parameters, low computational complexity, fast convergence, and high local optima avoidance. The performance of this algorithm is benchmarked on 10 standard test functions and compared to four well-known algorithms in the literature. The results demonstrate that the proposed algorithm is able to show very competitive results and has merits in solving challenging optimization problems.     

Superior foetal electrocardiogram signal elicitation using a novel artificial intelligent Bayesian methodology

Innumerable casualties due to intrauterine hypoxia are a major worry during prenatal phase besides advanced patient monitoring with latest science and technology. Hence, the analysis of foetal electrocardiogram (fECG) signals is very vital in order to evaluate the foetal heart status for timely recognition of cardiac abnormalities. Regrettably, the latest technology in the cutting edge field of biomedical signal processing does not seem to yield the desired quality of fECG signals required by physicians, which is the major cause for the pathetic condition. The focus of this work is to extort non-invasive fECG signal with highest possible quality with a motive to support physicians in utilizing the methodology for the latest intrapartum monitoring technique called STAN (ST analysis) for forecasting intrapartum foetal hypoxia. However, the critical quandary is that the non-invasive fECG signals recorded from the maternal abdomen are affected by several interferences like power line interference, baseline drift interference, electrode motion interference, muscle movement interference and the maternal electrocardiogram (mECG) being the dominant interference. A novel hybrid methodology called BANFIS (Bayesian adaptive neuro fuzzy inference system) is proposed. The BANFIS includes a Bayesian filter and an adaptive neuro fuzzy filter for mECG elimination and non-linear artefacts removal to yield high quality fECG signal. Kalman filtering frame work has been utilized to estimate the nonlinear transformed mECG component in the abdominal electrocardiogram (aECG). The adaptive neuro fuzzy filter is employed to discover the nonlinearity of the nonlinear transformed version of mECG and to align the estimated mECG signal with the maternal component in the aECG signal for annulment. The outcomes of the investigation by the proposed BANFIS system proved valuable for STAN system for efficient prediction of foetal hypoxia.     

A novel approach to adaptive relational association rule mining

The paper focuses on the adaptive relational association rule mining problem. Relational association rules represent a particular type of association rules which describe frequent relations that occur between the features characterizing the instances within a data set. We aim at re-mining an object set, previously mined, when the feature set characterizing the objects increases. An adaptive relational association rule method, based on the discovery of interesting relational association rules, is proposed. This method, called ARARM (Adaptive Relational Association Rule Mining) adapts the set of rules that was established by mining the data before the feature set changed, preserving the completeness. We aim to reach the result more efficiently than running the mining algorithm again from scratch on the feature-extended object set. Experiments testing the method's performance on several case studies are also reported. The obtained results highlight the efficiency of the ARARM method and confirm the potential of our proposal.     

Artificial bee colony based algorithm for maximum power point tracking (MPPT) for PV systems operating under partial shaded conditions

Artificial bee colony (ABC) algorithm has several characteristics that make it more attractive than other bio-inspired methods. Particularly, it is simple, it uses fewer control parameters and its convergence is independent of the initial conditions. In this paper, a novel artificial bee colony based maximum power point tracking algorithm (MPPT) is proposed. The developed algorithm, does not allow only overcoming the common drawback of the conventional MPPT methods, but it gives a simple and a robust MPPT scheme. A co-simulation methodology, combining Matlab/Simulink™ and Cadence/Pspice™, is used to verify the effectiveness of the proposed method and compare its performance, under dynamic weather conditions, with that of the Particle Swarm Optimization (PSO) based MPPT algorithm. Moreover, a laboratory setup has been realized and used to experimentally validate the proposed ABC-based MPPT algorithm. Simulation and experimental results have shown the satisfactory performance of the proposed approach.     

Flexural behaviour of RC slabs strengthened with prestressed CFRP strips using different anchorage systems

The Externally Bonded Reinforcement (EBR) technique using Carbon Fiber-Reinforced Polymers (CFRP) has been commonly used to strengthen concrete structures in flexure. The use of prestressed CFRP material offers several advantages well-reported in the literature. Regardless of such as benefits, several studies on different topics are missing. The present work intends to contribute to the knowledge of two commercially available systems that differ on the type of anchorage: (i) the Mechanical Anchorage (MA), and (ii) the Gradient Anchorage (GA). For that purpose, an experimental program was carried out with twelve slabs monotonically tested under displacement control up to failure by using a four-point bending test configuration. The effect of type of anchorage system (MA and GA), prestrain level (0 and 0.4%), width (50 mm and 80 mm) and thickness (1.2 mm and 1.4 mm) of the CFRP laminate, and the surface preparation (grinded and sandblasted) on the flexural response were the main studied parameters. Better performance was observed for the slabs: (i) with prestressed laminates, (ii) for the MA system, and (iii) with sandblasted surface preparation.     

Collapse load of composite laminates: Lower bound evaluation by stress field analytical approximation

The paper proposes a limit analysis approach to define the ultimate load capacity of orthotropic composite laminates under biaxial loading and plane stress conditions. A lower bound to the collapse load multiplier is computed by solving a maximization nonlinear problem, according to the static theorem of limit analysis. To set up the optimization problem a stress field distribution is hypothesized at lamina level, moreover inter-lamina stresses are also considered. The effectiveness and validity of the proposed approach is shown by comparing the obtained numerical predictions both with available experimental data and with other numerical results carried out by means of a different numerical lower bound approach.     

A two stage heuristic algorithm for the integrated aircraft and crew schedule recovery problems

Airline disruptions incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated aircraft and crew schedule recovery problem. A two stage heuristic algorithm for the integrated recovery problem is proposed. In the first stage, the integrated aircraft recovery and flight-rescheduling model with partial crew consideration is built. This model is based on the traditional multi-commodity network model for the aircraft schedule recovery problem. The objective of this model also includes minimization of the original crew connection disruption. In the second stage, the integrated crew schedule recovery and flight re-scheduling model with partial aircraft consideration is built. We proposed a new multi-commodity model for the crew schedule recovery. The main advantage of such model is that it is much more efficient to integrate the flight-scheduling and aircraft consideration. New constraints are incorporated to guarantee that the aircraft connections generated in the stage 1 are still feasible. Two stages are run iteratively until no improvement can be achieved. Experimental results show that our method can provide better recovery solutions compared with the benchmark algorithms.