On the performance of different capability indices under normal and non-normal distributions

In this article, we have examined the performance of some useful capability indices using normal and non-normal distributions. The confidence intervals are calculated and mean coverage rates are observed for different capability indices. The effects of symmetry and kurtosis of parent distributions are examined on the mean coverage rates of different capability indices. Moreover, we have investigated the robustness (of confidence interval) using the median and percentile-based indices. We have considered the well-known distributions including normal, gamma, t, Weibull, and chi-squared. For these process scenarios, we have observed that some indices resist disturbance only in symmetry of the parent distribution, some resist the disturbance in symmetry and kurtosis of the distribution, and some indices don’t resist against either type of disturbance.     

On the Efficiency of Runs Rules Schemes for Process Monitoring

There are two main types of variations, namely, common and special causes leading to in‐control and out‐of‐control states, respectively. Control charts are popular tools used to differentiate between these two states of a process. Implementation of runs rules schemes with control charts is an attractive approach for process monitoring. This study is designed to describe the methodology of runs rules schemes and discuss their implementation for different types of control charts. We have considered memory‐less charts, namely, , S, and R charts for our study purposes. It is examined that the efficiency gain depends on the number of decision points utilized to implement a given rule. Moreover, superiority of runs rules schemes may vary for different types of location and dispersion charts. An application example using a dataset is also included in the study for practical considerations. Copyright © 2015 John Wiley & Sons, Ltd.     

Three-dimensional macroscale assembly of Pd nanoclusters

Construction of macro-materials with highly oriented microstructures and well-connected interfaces between building blocks is significant for a variety of applications. However, it is still challenging to confine the desired structures. Thus, well-defined building blocks would be crucial to address this issue. Herein, we present a facile process based on 1.8 nm Pd nanoclusters (NCs) to achieve centimeter-size assemblages with aligned honeycomb structures, where the diameter of a single tubular moiety is ～4 μm. Layered and disordered porous assemblages were also obtained by modulating the temperature in this system. The reconciled interactions between the NCs were crucial to the assemblages. As a comparison, 14 nm Pd nanoparticles formed only aggregates. This work highlights the approach of confining the size of the building blocks in order to better control the assembly process and improve the stability of the structures.

Open image in new window

     

Intrusion Detection Based on Bidirectional Long Short-Term Memory with Attention Mechanism

With the recent developments in the Internet of Things (IoT), the amount of data collected has expanded tremendously, resulting in a higher demand for data storage, computational capacity, and real-time processing capabilities. Cloud computing has traditionally played an important role in establishing IoT. However, fog computing has recently emerged as a new field complementing cloud computing due to its enhanced mobility, location awareness, heterogeneity, scalability, low latency, and geographic distribution. However, IoT networks are vulnerable to unwanted assaults because of their open and shared nature. As a result, various fog computing-based security models that protect IoT networks have been developed. A distributed architecture based on an intrusion detection system (IDS) ensures that a dynamic, scalable IoT environment with the ability to disperse centralized tasks to local fog nodes and which successfully detects advanced malicious threats is available. In this study, we examined the time-related aspects of network traffic data. We presented an intrusion detection model based on a two-layered bidirectional long short-term memory (Bi-LSTM) with an attention mechanism for traffic data classification verified on the UNSW-NB15 benchmark dataset. We showed that the suggested model outperformed numerous leading-edge Network IDS that used machine learning models in terms of accuracy, precision, recall and F1 score.     

A Service Level Agreement Aware Online Algorithm for Virtual Machine Migration

The demand for cloud computing has increased manifold in the recent past. More specifically, on-demand computing has seen a rapid rise as organizations rely mostly on cloud service providers for their day-to-day computing needs. The cloud service provider fulfills different user requirements using virtualization - where a single physical machine can host multiple Virtual Machines. Each virtual machine potentially represents a different user environment such as operating system, programming environment, and applications. However, these cloud services use a large amount of electrical energy and produce greenhouse gases. To reduce the electricity cost and greenhouse gases, energy efficient algorithms must be designed. One specific area where energy efficient algorithms are required is virtual machine consolidation. With virtual machine consolidation, the objective is to utilize the minimum possible number of hosts to accommodate the required virtual machines, keeping in mind the service level agreement requirements. This research work formulates the virtual machine migration as an online problem and develops optimal offline and online algorithms for the single host virtual machine migration problem under a service level agreement constraint for an over-utilized host. The online algorithm is analyzed using a competitive analysis approach. In addition, an experimental analysis of the proposed algorithm on real-world data is conducted to showcase the improved performance of the proposed algorithm against the benchmark algorithms. Our proposed online algorithm consumed 25% less energy and performed 43% fewer migrations than the benchmark algorithms.     

A Framework of Deep Optimal Features Selection for Apple Leaf Diseases Recognition

Identifying fruit disease manually is time-consuming, expert-required, and expensive; thus, a computer-based automated system is widely required. Fruit diseases affect not only the quality but also the quantity. As a result, it is possible to detect the disease early on and cure the fruits using computer-based techniques. However, computer-based methods face several challenges, including low contrast, a lack of dataset for training a model, and inappropriate feature extraction for final classification. In this paper, we proposed an automated framework for detecting apple fruit leaf diseases using CNN and a hybrid optimization algorithm. Data augmentation is performed initially to balance the selected apple dataset. After that, two pre-trained deep models are fine-tuning and trained using transfer learning. Then, a fusion technique is proposed named Parallel Correlation Threshold (PCT). The fused feature vector is optimized in the next step using a hybrid optimization algorithm. The selected features are finally classified using machine learning algorithms. Four different experiments have been carried out on the augmented Plant Village dataset and yielded the best accuracy of 99.8%. The accuracy of the proposed framework is also compared to that of several neural nets, and it outperforms them all.     

Implementation of VLSI on Signal Processing-Based Digital Architecture Using AES Algorithm

Continuous improvements in very-large-scale integration (VLSI) technology and design software have significantly broadened the scope of digital signal processing (DSP) applications. The use of application-specific integrated circuits (ASICs) and programmable digital signal processors for many DSP applications have changed, even though new system implementations based on reconfigurable computing are becoming more complex. Adaptable platforms that combine hardware and software programmability efficiency are rapidly maturing with discrete wavelet transformation (DWT) and sophisticated computerized design techniques, which are much needed in today’s modern world. New research and commercial efforts to sustain power optimization, cost savings, and improved runtime effectiveness have been initiated as initial reconfigurable technologies have emerged. Hence, in this paper, it is proposed that the DWT method can be implemented on a field-programmable gate array in a digital architecture (FPGA-DA). We examined the effects of quantization on DWT performance in classification problems to demonstrate its reliability concerning fixed-point math implementations. The Advanced Encryption Standard (AES) algorithm for DWT learning used in this architecture is less responsive to resampling errors than the previously proposed solution in the literature using the artificial neural networks (ANN) method. By reducing hardware area by 57%, the proposed system has a higher throughput rate of 88.72%, reliability analysis of 95.5% compared to the other standard methods.     

WiMA: Towards a Multi-Criterion Association in Software Defined Wi-Fi Networks

Despite the planned installation and operations of the traditional IEEE 802.11 networks, they still experience degraded performance due to the number of inefficiencies. One of the main reasons is the received signal strength indicator (RSSI) association problem, in which the user remains connected to the access point (AP) unless the RSSI becomes too weak. In this paper, we propose a multi-criterion association (WiMA) scheme based on software defined networking (SDN) in Wi-Fi networks. An association solution based on multi-criterion such as AP load, RSSI, and channel occupancy is proposed to satisfy the quality of service (QoS). SDN having an overall view of the network takes the association and reassociation decisions making the handoffs smooth in throughput performance. To implement WiMA extensive simulations runs are carried out on Mininet-NS3-Wi-Fi network simulator. The performance evaluation shows that the WiMA significantly reduces the average number of retransmissions by 5%–30% and enhances the throughput by 20%–50%, hence maintaining user fairness and accommodating more wireless devices and traffic load in the network, when compared to traditional client-driven (CD) approach and state of the art Wi-Balance approach.     

Infrared Spectroscopy-Based Chemometric Analysis for Lard Differentiation in Meat Samples

One of the most pressing concerns for the consumer market is the detection of adulteration in meat products due to their preciousness. The rapid and accurate identification mechanism for lard adulteration in meat products is highly necessary, for developing a mechanism trusted by consumers and that can be used to make a definitive diagnosis. Fourier Transform Infrared Spectroscopy (FTIR) is used in this work to identify lard adulteration in cow, lamb, and chicken samples. A simplified extraction method was implied to obtain the lipids from pure and adulterated meat. Adulterated samples were obtained by mixing lard with chicken, lamb, and beef with different concentrations (10%–50% v/v). Principal component analysis (PCA) and partial least square (PLS) were used to develop a calibration model at 800–3500 cm⁻¹. Three-dimension PCA was successfully used by dividing the spectrum in three regions to classify lard meat adulteration in chicken, lamb, and beef samples. The corresponding FTIR peaks for the lard have been observed at 1159.6, 1743.4, 2853.1, and 2922.5 cm⁻¹, which differentiate chicken, lamb, and beef samples. The wavenumbers offer the highest determination coefficient R² value of 0.846 and lowest root mean square error of calibration (RMSEC) and root mean square error prediction (RMSEP) with an accuracy of 84.6%. Even the tiniest fat adulteration up to 10% can be reliably discovered using this methodology.     

Correction on link relative based approach to CUSUM chart

Link relative-based approach was used in an article (see reference 1) to enhance the performance of the cumulative sum (CUSUM) control chart. This technique involves the use of firstly, the link relative variable to convert the process observations in a relative to the mean form and secondly, optimal constants to define a new variable which is used as the plotting statistic of the link relative CUSUM chart. In this article, it is proven through simulation study that the optimal constants with fixed values, as reported in the aforementioned article, give different results. Instead, if the regression technique is used, then the same results will be obtained.