Scheduling with agreements: new results

In this paper, the problem of scheduling with agreements (SWA) is considered. In scheduling, this consists of a set of jobs non-preemptively on identical machines subject to constraints that only some specific jobs can be scheduled concurrently on different machines. These constraints are given by an agreement graph and the aim is to minimise the makespan. In the case of two machines we extend two NP-hardness results of SWA with processing times at most three that hold for bipartite agreement graphs to more general agreement graphs. Complexity results of SWA are established in the case of split and complement of bipartite graphs. We also present some approximation results for SWA.     

Minimizing the total completion time in a two-machine flowshop problem with time delays

This article proposes to solve the problem of minimizing the total completion time in a two-machine permutation flowshop environment in which time delays between the machines are considered. For this purpose, an enumeration algorithm based on the branch-and-bound framework is developed, which includes new lower and upper bounds as well as dominance rules. The computational study shows that problems with up to 40 jobs can be solved in a reasonable amount of time.     

Application of a hot-melt granulation process to enhance fenofibrate solid dose manufacturing

Evaluation of hot-melt granulation of fenofibrate and croscarmellose sodium and its cooling time for the molten mass in a ratio of 55:45 was conducted to assess the manufacturing process capability to produce an acceptable granulation which flows well on Korsch PH300 tablet compression machine. The formation of the drug-polymer eutectic mixture was investigated by differential scanning calorimetry, scanning electron microscopy and X-ray powder diffraction. The physical properties of the hot-melt was determined by examining the milled blocks after solidification and milling after cooling periods of 10, 20 and 30 d. The milled material was assessed for the effect of hold time of the blend on the solid dose compression characteristics. The impact of cooling on the processing of the blocks was assessed after 10, 20 and 30 d of cooling. The study suggests that after the hot-melt formed the fenofibrate crystallized independently and a solid solution with croscarmellose sodium was not formed. The age of the blocks determined the hardness of the crystals, changing the processing nature of the granules with respect to compression and powder flow characteristics. The blocks processed after 20 d and beyond produced granules with a characteristic suitable for holding the blend for 14 d in the bin with no impact on flow properties and compressibility of the blend. There was no chipping, capping, sticking or picking observed and a higher compression speed was achieved.     

Nutratherapeutics approach against cancer: tomato‐mediated synthesised gold nanoparticles

In this study, an eco‐friendly biosynthesis of stable gold nanoparticles (T‐GNPs) was carried out using different concentrations of tomato juice (nutraceuticals) as a reducing agent and tetrachloroauric acid as a metal precursor to explore their potential application in cancer therapeutics. The synthesis of T‐GNPs was monitored by UV‐visible absorption spectroscopy, which unveiled their formation by exhibiting the typical surface plasmon absorption maxima at 522 nm. The size of T‐GNPs was found to be 10.86 ± 0.6 nm. T‐GNPs were characterised by dynamic light scattering, zeta potential, transmission electron microscopy analysis and Fourier transform infrared spectroscopy. T‐GNPs were further investigated for their anti‐cancer activity against human lung carcinoma cell line (A ₅₄₉) and human cervical cancer cell line wherein the IC₅₀ values were found to be 0.286 and 0.200 mM, respectively. T‐GNPs inhibited the growth of cancer cells by generating ROS and inducing apoptosis. T‐GNPs were found highly effective by virtue of their size, metallic property and capping molecules. Thus, this study opens up the prospects of using nutraceutical (tomato juice) as nutratherapeutic agent (T‐GNPs) against critical diseases like lung cancer and cervical cancer.Inspec keywords: gold, nanoparticles, particle size, cancer, ultraviolet spectra, visible spectra, electrokinetic effects, transmission electron microscopy, Fourier transform infrared spectra, cellular biophysics, spectrochemical analysis, nanomedicine, nanofabricationOther keywords: tomato‐mediated synthesised gold nanoparticles, tomato juice, reducing agent, tetrachloroauric acid, cancer therapeutics, UV‐visible absorption spectroscopy, surface plasmon absorption, dynamic light scattering, zeta potential, transmission electron microscopy analysis, Fourier transform infrared spectroscopy, human lung carcinoma cell line, anticancer activity, human cervical cancer cell line, nutratherapeutic agent, lung cancer, Au     

Modeling and Analysis of UAV-Assisted Mobile Network with Imperfect Beam Alignment

With the rapid development of emerging 5G and beyond (B5G), Unmanned Aerial Vehicles (UAVs) are increasingly important to improve the performance of dense cellular networks. As a conventional metric, coverage probability has been widely studied in communication systems due to the increasing density of users and complexity of the heterogeneous environment. In recent years, stochastic geometry has attracted more attention as a mathematical tool for modeling mobile network systems. In this paper, an analytical approach to the coverage probability analysis of UAV-assisted cellular networks with imperfect beam alignment has been proposed. An assumption was considered that all users are distributed according to Poisson Cluster Process (PCP) around base stations, in particular, Thomas Cluster Process (TCP). Using this model, the impact of beam alignment errors on the coverage probability was investigated. Initially, the Probability Density Function (PDF) of directional antenna gain between the user and its serving base station was obtained. Then, association probability with each tier was achieved. A tractable expression was derived for coverage probability in both Line-of-Sight (LoS) and Non-Line-of-Sight (NLoS) condition links. Numerical results demonstrated that at low UAVs altitude, beam alignment errors significantly degrade coverage performance. Moreover, for a small cluster size, alignment errors do not necessarily affect the coverage performance.     

Optimal Deep Learning Model Enabled Secure UAV Classification forIndustry 4.0

Emerging technologies such as edge computing, Internet of Things (IoT), 5G networks, big data, Artificial Intelligence (AI), and Unmanned Aerial Vehicles (UAVs) empower, Industry 4.0, with a progressive production methodology that shows attention to the interaction between machine and human beings. In the literature, various authors have focused on resolving security problems in UAV communication to provide safety for vital applications. The current research article presents a Circle Search Optimization with Deep Learning Enabled Secure UAV Classification (CSODL-SUAVC) model for Industry 4.0 environment. The suggested CSODL-SUAVC methodology is aimed at accomplishing two core objectives such as secure communication via image steganography and image classification. Primarily, the proposed CSODL-SUAVC method involves the following methods such as Multi-Level Discrete Wavelet Transformation (ML-DWT), CSO-related Optimal Pixel Selection (CSO-OPS), and signcryption-based encryption. The proposed model deploys the CSO-OPS technique to select the optimal pixel points in cover images. The secret images, encrypted by signcryption technique, are embedded into cover images. Besides, the image classification process includes three components namely, Super-Resolution using Convolution Neural Network (SRCNN), Adam optimizer, and softmax classifier. The integration of the CSO-OPS algorithm and Adam optimizer helps in achieving the maximum performance upon UAV communication. The proposed CSODL-SUAVC model was experimentally validated using benchmark datasets and the outcomes were evaluated under distinct aspects. The simulation outcomes established the supreme better performance of the CSODL-SUAVC model over recent approaches.     

Classification of Electroencephalogram Signals Using LSTM and SVM Based on Fast Walsh-Hadamard Transform

Classification of electroencephalogram (EEG) signals for humans can be achieved via artificial intelligence (AI) techniques. Especially, the EEG signals associated with seizure epilepsy can be detected to distinguish between epileptic and non-epileptic regions. From this perspective, an automated AI technique with a digital processing method can be used to improve these signals. This paper proposes two classifiers: long short-term memory (LSTM) and support vector machine (SVM) for the classification of seizure and non-seizure EEG signals. These classifiers are applied to a public dataset, namely the University of Bonn, which consists of 2 classes –seizure and non-seizure. In addition, a fast Walsh-Hadamard Transform (FWHT) technique is implemented to analyze the EEG signals within the recurrence space of the brain. Thus, Hadamard coefficients of the EEG signals are obtained via the FWHT. Moreover, the FWHT is contributed to generate an efficient derivation of seizure EEG recordings from non-seizure EEG recordings. Also, a k-fold cross-validation technique is applied to validate the performance of the proposed classifiers. The LSTM classifier provides the best performance, with a testing accuracy of 99.00%. The training and testing loss rates for the LSTM are 0.0029 and 0.0602, respectively, while the weighted average precision, recall, and F1-score for the LSTM are 99.00%. The results of the SVM classifier in terms of accuracy, sensitivity, and specificity reached 91%, 93.52%, and 91.3%, respectively. The computational time consumed for the training of the LSTM and SVM is 2000 and 2500 s, respectively. The results show that the LSTM classifier provides better performance than SVM in the classification of EEG signals. Eventually, the proposed classifiers provide high classification accuracy compared to previously published classifiers.     

Discrimination between accelerated life models via Approximate Bayesian Computation

Accelerated life testing (ALT) is widely used in high-reliability product estimation to get relevant information about an item's performance and its failure mechanisms. To analyse the observed ALT data, reliability practitioners need to select a suitable accelerated life model based on the nature of the stress and the physics involved. A statistical model consists of (i) a lifetime distribution that represents the scatter in product life and (ii) a relationship between life and stress. In practice, several accelerated life models could be used for the same failure mode and the choice of the best model is far from trivial. For this reason, an efficient selection procedure to discriminate between a set of competing accelerated life models is of great importance for practitioners. In this paper, accelerated life model selection is approached by using the Approximate Bayesian Computation (ABC) method and a likelihood-based approach for comparison purposes. To demonstrate the efficiency of the ABC method in calibrating and selecting accelerated life model, an extensive Monte Carlo simulation study is carried out using different distances to measure the discrepancy between the empirical and simulated times of failure data. Then, the ABC algorithm is applied to real accelerated fatigue life data in order to select the most likely model among five plausible models. It has been demonstrated that the ABC method outperforms the likelihood-based approach in terms of reliability predictions mainly at lower percentiles particularly useful in reliability engineering and risk assessment applications. Moreover, it has shown that ABC could mitigate the effects of model misspecification through an appropriate choice of the distance function.