Transverse magnetoresistance peculiarities of thermoelectric Lu-doped Bi2Te3 compound due to strong electrical disorder

The n-type thermoelectric Bi_1.9Lu_0.1Te₃ was prepared by microwave-solvothermal method and spark plasma sintering. The magnetic field and temperature dependences of transverse magnetoresistance measured within temperature 2–200 K interval allow finding the peculiarities characteristic for strongly disordered and inhomogeneous semiconductors. The first peculiarity is due to appearance of linear-in-magnetic field contribution to the total magnetoresistance reflected in a crossover from quadratic magnetoresistance at low magnetic fields to linear magnetoresistance at high magnetic fields. The linear magnetoresistance can result from the Hall resistance picked up from macroscopically distorted current paths due to local variations in stoichiometry of the compound studied. The second peculiarity is that both linear magnetoresistance magnitude and crossover field are functions of carrier mobility which is in agreement with the Parish and Littlewood model developed for disordered and inhomogeneous semiconductors. An increase in the mobility due to a decrease in temperature is accompanied by an increase in the magnetoresistance magnitude and a decrease in the crossover field. Finally, the third peculiarity is related to the remarkable deviation of the total magnetoresistance measured at various temperatures from the Kohler's rule. Presence of strong inhomogeneity and disorder in the Bi_1.9Lu_0.1Te₃ structure concluded from the magnetoresistance peculiarities can be responsible for the remarkable reduction in the total thermal conductivity of this compound.     

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

A signal adaptive diffusion filter for video coding: Mathematical framework and complexity reductions

In this paper we combine video compression and modern image processing methods. We construct novel iterative filter methods for prediction signals based on Partial Differential Equation (PDE) based methods. The mathematical framework of the employed diffusion filter class is given and some desirable properties are stated. In particular, two types of diffusion filters are constructed: a uniform diffusion filter using a fixed filter mask and a signal adaptive diffusion filter that incorporates the structures of the underlying prediction signal. The latter has the advantage of not attenuating existing edges while the uniform filter is less complex. The filters are embedded into a software based on HEVC with additional QTBT (Quadtree plus Binary Tree) and MTT (Multi-Type-Tree) block structure. In this setting, several measures to reduce the coding complexity of the tool are introduced, discussed and tested thoroughly. The coding complexity is reduced by up to 70% while maintaining over 80% of the gain. Overall, the diffusion filter method achieves average bitrate savings of 2.27% for Random Access having an average encoder runtime complexity of 119% and 117% decoder runtime complexity. For individual test sequences, results of 7.36% for Random Access are accomplished.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

Teaching and Learning Electrochemistry

Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported.     

Control theory for stochastic distributed parameter systems,an engineering perspective

The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

A case-deletion diagnostic for penalized calibration estimators and BLUP under linear mixed models in survey sampling

The penalized calibration technique in survey sampling combines usual calibration and soft calibration by introducing a penalty term. Certain relevant estimates in survey sampling can be considered as penalized calibration estimates obtained as particular cases from an optimization problem with a common basic structure. In this framework, a case deletion diagnostic is proposed for a class of penalized calibration estimators including both design-based and model-based estimators. The diagnostic compares finite population parameter estimates and can be calculated from quantities related to the full data set. The resulting diagnostic is a function of the residual and leverage, as other diagnostics in regression models, and of the calibration weight, a singular feature in survey sampling. Moreover, a particular case, which includes the basic unit level model for small area estimation, is considered. Both a real and an artificial example are included to illustrate the diagnostic proposed. The results obtained clearly show that the proposed diagnostic depends on the calibration and soft-calibration variables, on the penalization term, as well as on the parameter to estimate.     

Application of the Microsoft Excel Solver tool in the solution of optimization problems of heat exchanger network systems

Optimization of heat exchanger networks (HEN_S) is a field of interest in Chemical Engineering. The aim is to use the residual heat of process streams to raise the temperature of other process streams which are cold, thus minimizing the use of hot and cold utilities. The usual way to deal with this task is to pose a linear programming problem according to a transshipment model in order to minimize either the general services consumptions or the number of hot and cold stream matchings required. This optimization is subjected to several restrictions given by the energy balances corresponding to each heat exchange.The high number of variables and equations obliges the use of specific software to solve these problems, e.g. GAMS (General Algebraic Modelling System). However, this software is not intuitive and requires a long time of training and a certain level of practice for the students to adequately use it.This work describes the use of Microsoft Excel-Solver for the sequential solving of HEN_S optimization problems according to the transshipment model. Solver is a much simpler, intuitive and easily available tool for the students who, besides, usually learn how to use it in the first years of their degree, in Informatics or similar subjects. Thus, it is not necessary to spend extra time in the teaching of the software, time that may be devoted to other contents.This paper presents an example of HEN_S problem proposed in the subject Simulation and Optimization of Chemical Processes corresponding to the Joint Master in Chemical Engineering of the Rey Juan Carlos University and the Autónoma University of Madrid and solved by the students using Excel-Solver.     

A globally convergent BFGS method for pseudo-monotone variational inequality problems

In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm.