Wet Chemical Treatment and Mg Doping of p-InP Surfaces for Ohmic Low-Resistive Metal Contacts

Manufacturing a low-resistive Ohmic metal contact on p-type InP crystals for various applications is a challenge because of the Fermi-level pinning via surface defects and the diffusion of p-type doping atoms in InP. Development of wet-chemistry treatments and nanoscale control of p-doping for InP surfaces is crucial for decreasing the device resistivity losses and durability problems. Herein, a proper combination of HCl-based solution immersion, which directly provides an unusual wet chemical-induced InP(100)c(2 × 2) atomic structure, and low-temperature Mg-surface doping of the cleaned InP before Ni-film deposition is demonstrated to decrease the contact resistivity of Ni/p-InP by the factor of 10 approximately as compared to the lowest reference value without Mg. Deposition of the Mg intermediate layer on p-InP and postheating of Mg/p-InP at 350 °C, both performed in ultrahigh-vacuum (UHV) chamber, lead to intermixing of Mg and InP elements according to X-ray photoelectron spectroscopy. Introducing a small oxygen gas background (O₂ ≈ 10⁻⁶ mbar) in UHV chamber during the postheating of Mg/p-InP enhances the indium outdiffusion and provides the lowest contact resistivity. Quantum mechanical simulations indicate that the presence of InP native oxide or/and metal indium alloy at the interface increases In diffusion.     

Second Sound Measurements Near the Tricritical Point in 3He-4He Mixtures

In this paper we discuss a pulsed second sound experiment, aimed at determining accurately the critical exponent , and the predicted logarithmic correction to scaling, for the superfluid density along a tricritical path in the ³ He- ⁴ He phase diagram. We present an accurate estimate for the limits for closest approach to the tricritical point, as set by gravitationally induced sample inhomogeneities and finite size effects, and discuss some of the complications associated with measurements close to the tricritical point.     

Estimation of magnitude and time duration of temporary overvoltages using ANN in transmission lines during power system restoration

In most countries, the main step in the process of power system restoration, following a complete/partial blackout, is energization of primary restorative transmission lines. Artificial neural network (ANN) is employed for performing a nonlinear input–output mapping in this work, in order to estimate the temporary overvoltages (TOVs) due to transmission lines energization. In the proposed methodology, Levenberg–Marquardt second order method is used to train the multilayer perceptron. Proposed ANN is trained with equivalent circuit parameters of the network as input parameters, trained ANN has therefore satisfactory generalization capability. Both single and three-phase line energizations are analyzed. The simulated results for 39-bus New England test system, indicate that the proposed technique can estimate the peak values and duration of switching overvoltages with acceptable accuracy.     

A hybrid method for flowshops scheduling with condition-based maintenance constraint and machines breakdown

One of the most important assumptions in production scheduling is that the machines are permanently available without any breakdown. In the real world of scheduling, machines can be made unavailable due to various reasons such as preventive maintenance and unpredicted breakdown. In this paper, we explore flowshop configuration under the assumption of condition-based maintenance to minimize expected makespan. Furthermore, we consider a condition-based maintenance (CBM) strategy which could be used in most industrial settings. The proposed algorithm is designed for non-resumable flowshop state where the processing of jobs after preventive maintenance is restarted from the beginning. We propose a hybrid algorithm based on genetic algorithm and simulated annealing. Additionally, we conduct an extensive parameter calibration with the utilization of Taguchi method and select the optimal levels of the algorithm’s performance influential factors. The preliminary results indicate that the proposed method provides significantly better results compared with other high performing algorithms in the literature.     

Analysis and suppression of spurious modes of the ring shape anchored RF MEMS contour mode disk resonator

One of the most encumbering issues in RF MEMS resonators is spurious modes. The problem of spurious modes becomes more critical, when the ring type resonators are used. In the ring shape anchored contour mode disk resonator, for achieving a low serial resistance, the inner radius of the disk must be increased. This causes the spurious modes to become too close to the desired mode and degrade the operation of the resonator. In this work, spurious modes of before-mentioned device are introduced and their characteristics are evaluated by exact analytical approach. Based on those analytical approaches, we introduce two techniques for spurious mode suppression. The first technique is based on exciting the desired mode by proper electrode engineering and hence is an electrical approach. The second technique is reconfiguring of the anchor from a continuous ring to crossed ring segments and locating the segments on the phase discriminating lines to increase the insertion loss for spurious modes and decrease the losses for the fundamental mode. The final harmonic analysis verifies that the proposed techniques result a resonator with a pure frequency spectrum and spurious modes excluded over a very wide frequency range.     

A Combinational Perspective in Stimulating Cooperation in Mobile Ad Hoc Networks

In wireless ad hoc networks cooperation among nodes cannot always be assumed since nodes with limited resources and different owners are capable of making independent decisions. Cooperation problems in topology control and packet forwarding tasks have been mostly studied separately but these two tasks are not independent. Considering a joint cooperation problem by taking into account dependencies between tasks will result in more reliable and efficient networks. In this paper topology control definition is extended to cover cooperation problem in both packet forwarding and topology control in a single problem. In this definition nodes have to adjust their transmission power and decide on their relay role. This paper models the interactions of nodes as a potential game with two-dimensional utility function. The presented model, named TCFORCE (Topology Control packet FORwarding Cooperation Enforcement), preserves the network connectivity and reduces the energy consumption by providing cooperative paths between all pairs of nodes in the network.     

A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations

A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well.     

Hamshahri: A standard Persian text collection

The Persian language is one of the dominant languages in the Middle East, so there are significant amount of Persian documents available on the Web. Due to the different nature of the Persian language compared to the other languages such as English, the design of information retrieval systems in Persian requires special considerations. However, there are relatively few studies on retrieval of Persian documents in the literature and one of the main reasons is the lack of a standard test collection. In this paper, we introduce a standard Persian text collection, named Hamshahri, which is built from a large number of newspaper articles according to TREC specifications. Furthermore, statistical information about documents, queries and their relevance judgments are presented in this paper. We believe that this collection is the largest Persian text collection, so far.     

Multi-Verse Optimizer: a nature-inspired algorithm for global optimization

This paper proposes a novel nature-inspired algorithm called Multi-Verse Optimizer (MVO). The main inspirations of this algorithm are based on three concepts in cosmology: white hole, black hole, and wormhole. The mathematical models of these three concepts are developed to perform exploration, exploitation, and local search, respectively. The MVO algorithm is first benchmarked on 19 challenging test problems. It is then applied to five real engineering problems to further confirm its performance. To validate the results, MVO is compared with four well-known algorithms: Grey Wolf Optimizer, Particle Swarm Optimization, Genetic Algorithm, and Gravitational Search Algorithm. The results prove that the proposed algorithm is able to provide very competitive results and outperforms the best algorithms in the literature on the majority of the test beds. The results of the real case studies also demonstrate the potential of MVO in solving real problems with unknown search spaces. Note that the source codes of the proposed MVO algorithm are publicly available at http://www.alimirjalili.com/MVO.html.     

Convergence Results of the Biconjugate Residual Algorithm for Solving Generalized Sylvester Matrix Equation

In this article, we investigate a variant of the biconjugate residual (BCR) algorithm to solve the generalized Sylvester matrix equation which includes the well‐known Lyapunov, Stein and Sylvester matrix equations. We show that the BCR algorithm with any (special) initial matrix pair can smoothly compute the (least Frobenius norm) solution pair of the generalized Sylvester matrix equation within a finite number of iterations in the absence of round‐off errors. Finally the accuracy and effectiveness of the BCR algorithm in comparison to some existing algorithms are demonstrated by two numerical examples.