Characterization of the Ion Beam Current Density of the RF Ion Source with Flat and Convex Extraction Systems

Silicon - The characterization of ion beam current density distribution and beam uniformity is crucial for improving broad-beam ion source technologies. The design of the broad ion beam extraction...     

Polynomial time approximation algorithms for proportionate open‐shop scheduling

This paper deals with the presentation of polynomial time (approximation) algorithms for a variant of open‐shop scheduling, where the processing times are only machine‐dependent. This variant of scheduling is called proportionate scheduling and its applications are used in many real‐world environments. This paper develops three polynomial time algorithms for the problem. First, we present a polynomial time algorithm that solves the problem optimally if , where n and m denote the numbers of jobs and machines, respectively. If, on the other hand, , we develop a polynomial time approximation algorithm with a worst‐case performance ratio of that improves the bound existing for general open‐shops. Next, in the case of , we take into account the problem under consideration as a master problem and convert it into a simpler secondary approximation problem. Furthermore, we formulate both the master and secondary problems, and compare their complexity sizes. We finally present another polynomial time algorithm that provides optimal solution for a special case of the problem where .     

Relay-Assisted Wireless Energy Transfer for Efficient Spectrum Sharing in Harsh Environments

International Journal of Wireless Information Networks - With exponential growth in the number of wireless devices and limited available spectrum, the problem of spectrum sharing remains in...     

The distributed permutation flowshop scheduling problem

This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of F identical factories or shops, each one with m machines disposed in series. A set of n available jobs have to be distributed among the F factories and then a processing sequence has to be derived for the jobs assigned to each factory. The optimization criterion is the minimization of the maximum completion time or makespan among the factories. This production setting is necessary in today's decentralized and globalized economy where several production centers might be available for a firm. We characterize the DPFSP and propose six different alternative mixed integer linear programming (MILP) models that are carefully and statistically analyzed for performance. We also propose two simple factory assignment rules together with 14 heuristics based on dispatching rules, effective constructive heuristics and variable neighborhood descent methods. A comprehensive computational and statistical analysis is conducted in order to analyze the performance of the proposed methods.     

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing critically depends on its operators and parameters, in particular, its neighborhood search structure. In this paper, we propose an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters by the means of Taguchi method. An experiment based on Taillard benchmark is conducted to evaluate the proposed algorithm against some effective algorithms existing in the literature. The results show that the proposed algorithm outperforms the other algorithms.     

Quality Management in Pakistan's Bedwear Industry

Pakistan's bedwear industry contributes significantly to Pakistan's industry in general and to its textile industrial output and exports in particular. The exports of bedwear have increased steadily. However, its key basis of competitive advantage has been low cost. After greater liberalization from 2005 onwards and due to tariffication of quotas, the bedwear industry will not only have to scale higher tariff walls but will be more exposed to the threat of anti-dumping duties as it relies primarily on low prices to penetrate the export markets. To enhance its competitiveness, it will have to combine better quality with low costs and quick response. Research in quality management in Pakistan's bedwear industry was, therefore, undertaken. A postal self-completion questionnaire was mailed to 38 members of Pakistan Bedwear Manufacturers' and Exporters' Association (PBMEA). The response rate was almost 79%. It was found that this industrial segment was in various stages of development. This study demonstrates both the effectiveness and the limits of quality assurance in improving the levels of quality which remain a moving target in a dynamic liberalizing international trade environment that is more competitive since 2005. The bedwear industry, therefore, needs to graduate to advanced practices in quality management in order to remain competitive in rapidly changing times.     

Adaptive neural dynamic surface control of MIMO nonlinear time delay systems with time‐varying actuator failures

In this paper, an adaptive dynamic surface control approach is developed for a class of multi‐input multi‐output nonlinear systems with unknown nonlinearities, bounded time‐varying state delays, and in the presence of time‐varying actuator failures. The type of the considered actuator failure is that some unknown inputs may be stuck at some time‐varying values where the values, times, and patterns of the failures are unknown. The considered actuator failure can cover most failures that may occur in actuators of the systems. With the help of neural networks to approximate the unknown nonlinear functions and combining the dynamic surface control approach with the backstepping design method, a novel control approach is constructed. The proposed design method does not require a priori knowledge of the bounds of the unknown time delays and actuator failures. The boundedness of all the closed‐loop signals is guaranteed, and the tracking errors are proved to converge to a small neighborhood of the origin. The proposed approach is employed for a double inverted pendulums benchmark as well as a chemical reactor system. The simulation results show the effectiveness of the proposed method. Copyright © 2016 John Wiley & Sons, Ltd.     

CuIns2/Cus Nanocomposite: Synthesis via Simple Microwave Approach and Investigation Its Behavior in Solar Cell

CuInS₂/CuS nanocomposite were synthesized by a copper complex, [bis(ethylenediamine)copper(ΙΙ)] sulfate. Eight sulfur sources were used for this experiment. The products were characterized by X-ray diffraction, scanning electron microscopy, transmission electron microscopy, energy dispersive X-ray analysis spectroscopy, and room temperature photoluminescence spectroscopy. Thin film of nanocomposite powder was fabricated and its feature (V_oc, J_sc and FF) was calculated by current–voltage (I–V) curve.     

Mutual information-based optimization of sparse spatio-spectral filters in brain–computer interface

Recently, neuro-rehabilitation based on brain–computer interface (BCI) has been considered one of the important applications for BCI. A key challenge in this system is the accurate and reliable detection of motor imagery. In motor imagery-based BCIs, the common spatial patterns (CSP) algorithm is widely used to extract discriminative patterns from electroencephalography signals. However, the CSP algorithm is sensitive to noise and artifacts, and its performance depends on the operational frequency band. To address these issues, this paper proposes a novel optimized sparse spatio-spectral filtering (OSSSF) algorithm. The proposed OSSSF algorithm combines a filter bank framework with sparse CSP filters to automatically select subject-specific discriminative frequency bands as well as to robustify against noise and artifacts. The proposed algorithm directly selects the optimal regularization parameters using a novel mutual information-based approach, instead of the cross-validation approach that is computationally intractable in a filter bank framework. The performance of the proposed OSSSF algorithm is evaluated on a dataset from 11 stroke patients performing neuro-rehabilitation, as well as on the publicly available BCI competition III dataset IVa. The results show that the proposed OSSSF algorithm outperforms the existing algorithms based on CSP, stationary CSP, sparse CSP and filter bank CSP in terms of the classification accuracy, and substantially reduce the computational time of selecting the regularization parameters compared with the cross-validation approach.     

Parkinson’s Disease Detection Using Biogeography-Based Optimization

In recent years, Parkinson's Disease (PD) as a progressive syndrome of the nervous system has become highly prevalent worldwide. In this study, a novel hybrid technique established by integrating a Multi-layer Perceptron Neural Network (MLP) with the Biogeography-based Optimization (BBO) to classify PD based on a series of biomedical voice measurements. BBO is employed to determine the optimal MLP parameters and boost prediction accuracy. The inputs comprised of 22 biomedical voice measurements. The proposed approach detects two PD statuses: 0-disease status and 1- good control status. The performance of proposed methods compared with PSO, GA, ACO and ES method. The outcomes affirm that the MLP-BBO model exhibits higher precision and suitability for PD detection. The proposed diagnosis system as a type of speech algorithm detects early Parkinson’s symptoms, and consequently, it served as a promising new robust tool with excellent PD diagnosis performance.