In this work, we introduce a special kind of quantum cloning machine called Hybrid quantum cloning machine. The introduced Hybrid quantum cloning machine or transformation is nothing but a combination of pre-existing quantum cloning transformations. In this sense it creates its own identity in the field of quantum cloners. Hybrid quantum cloning machine can be of two types: (i) State dependent ...

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...

Background: Multiple Sclerosis (MS) is the most frequent non-traumatic neurological disease capable of causing disability in young adults. Detection of MS lesions with magnetic resonance imaging (MRI) is the most common technique. However, manual interpretation of vast amounts of data is often tedious and error-prone. Furthermore, changes in lesions are often subtle and extremely unrepresentati...

In this article, a novel winding switching control strategy is proposed to extend the speed range of consequent-pole ferrite-permanent magnet hybrid-excited machine (CPFPM-HEM) for electric vehicle application. The key that in low-speed range, ac armature and dc field are connected series achieve large starting torque, while high-speed injected with adjustable currents realize variable constant...

Hybrid cc̄g of quantum numbers 1−− are considered in a quark model with constituant quarks and gluon. The lowest JP = 1− states may be built in two ways, lg = 1 (gluon excited) corresponding to an angular momentum between the gluon and the cc̄ system, while lcc̄ = 1 (quark excited) corresponds to an angular momentum between the c and the c̄. The lowest lying hybrid JP = 1− state in the flux tube mo...

In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...