Role of Co in formation of Ni-Ti clusters in maraging stainless steel

The effect of Co addition on the formation of Ni-Ti clusters in maraging stainless steel was studied by three dimensional atom probe (3DAP) and first-principles calculation. The cluster analysis based on the maximum separation approach showed an increase in size but a decrease in density of Ni-Ti clusters with increasing the Co content. The first-principles calculation indicated weaker Co-Ni (Co-Ti) interactions than Co-Ti (Fe-Ti) interactions, which should be the essential reason for the change of distribution characteristics of Ni-Ti clusters in bcc Fe caused by Co addition.     

Benchmarking performance of machine and deep learning-based methodologies for Urdu text document classification

Neural Computing and Applications - In order to provide benchmark performance for Urdu text document classification, the contribution of this paper is manifold. First, it provides a publicly...     

A cross-layer approach for partition detection at overlay layer for structured P2P in MANETs

Due to limited radio range and mobility of nodes in mobile ad hoc networks (MANETs), the network partitioning and merging could occur frequently. When structured peer-to-peer (P2P) overlays are running over MANETs, then network partition in the physical network can also cause network partition at the overlay layer. Existing approaches for structured P2P overlay over MANETs do not detect network partition at the overlay layer. This paper proposes a cross-layer approach to detect network partition at the overlay layer for structured P2P overlay over MANETs. Simulation results show that the proposed approach is highly effective and efficient in terms of routing overhead, success ratio and false-negative ratio.     

The Lattice-Boltzmann Method on Optimal Sampling Lattices

In this paper, we extend the single relaxation time Lattice-Boltzmann Method (LBM) to the 3D body-centered cubic (BCC) lattice. We show that the D3bQ15 lattice defined by a 15 neighborhood connectivity of the BCC lattice is not only capable of more accurately discretizing the velocity space of the continuous Boltzmann equation as compared to the D3Q15 Cartesian lattice, it also achieves a comparable spatial discretization with 30 percent less samples. We validate the accuracy of our proposed lattice by investigating its performance on the 3D lid-driven cavity flow problem and show that the D3bQ15 lattice offers significant cost savings while maintaining a comparable accuracy. We demonstrate the efficiency of our method and the impact on graphics and visualization techniques via the application of line-integral convolution on 2D slices as well as the extraction of streamlines of the 3D flow. We further study the benefits of our proposed lattice by applying it to the problem of simulating smoke and show that the D3bQ15 lattice yields more detail and turbulence at a reduced computational cost.     

DeepClassRooms: a deep learning based digital twin framework for on-campus class rooms

Neural Computing and Applications - A lot of different methods are being opted for improving the educational standards through monitoring of the classrooms. The developed world uses Smart...     

Scientific Workflow Makespan Minimization in Edge Multiple Service Providers Environment

The edge computing model offers an ultimate platform to support scientific and real-time workflow-based applications over the edge of the network. However, scientific workflow scheduling and execution still facing challenges such as response time management and latency time. This leads to deal with the acquisition delay of servers, deployed at the edge of a network and reduces the overall completion time of workflow. Previous studies show that existing scheduling methods consider the static performance of the server and ignore the impact of resource acquisition delay when scheduling workflow tasks. Our proposed method presented a meta-heuristic algorithm to schedule the scientific workflow and minimize the overall completion time by properly managing the acquisition and transmission delays. We carry out extensive experiments and evaluations based on commercial clouds and various scientific workflow templates. The proposed method has approximately 7.7% better performance than the baseline algorithms, particularly in overall deadline constraint that gives a success rate.

     

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.     

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.     

Hardware/software co-design of a real-time kernel based tracking system

The probabilistic visual tracking methods using color histograms have been proven to be robust to target model variations and background illumination changes as shown by the recent research. However, the required computational cost is high due to intensive image data processing. The embedded solution of such algorithms become challenging due to high computational power demand and algorithm complexity. This paper presents a hardware/software co-design architecture for implementation of the well-known kernel based mean shift tracking algorithm. The design uses color histogram of the target as tracking feature. The target is searched in the consecutive images by maximizing the statistical match of the color distributions. The target localization is based on gradient based iterative search instead of exhaustive search which makes the system capable of achieving frame rate up to hundreds of frames per second while tracking multiple targets. The design, which is fully standalone, is implemented on a low-cost medium-size field programmable gate array (FPGA) device. The hardware cost of the design is compared with some other tracking systems. The performance of the system in terms of speed is evaluated and compared with the software based implementation. It is expected that the proposed solution will find its utility in applications like embedded automatic video surveillance systems.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.