Sharif Digital Repository

Sulfur doped and pure micro-nanoporous TiO2 film were synthesized with PEO method to produce a film with a high surface area for photocatalysis applications. The effect of applied voltage and electrolyte concentration on the microstructure and photocatalytic properties of the prepared layer were investigated via SEM, XRD, EIS and DRS studies. Electrochemical Impedance Spectroscopy (EIS) was carried out in order to determine the corrosion and electrochemical properties of the produced layer. It was found that although the barrier layer resistance decreases with the voltage, the layers porosity and consequently the surface area increases. Finally the XRD and DRS spectrums were correlated with... 

We propose an inexact nonmonotone successive quadratic programming (SQP) algorithm for solving nonlinear programming problems with equality constraints and bounded variables. Regarding the value of the current feasibility violation and the minimum value of its linear approximation over a trust region, several scenarios are envisaged. In one scenario, a possible infeasible stationary point is detected. In other scenarios, the search direction is computed using an inexact (truncated) solution of a feasible strictly convex quadratic program (QP). The search direction is shown to be a descent direction for the objective function or the feasibility violation in the feasible or infeasible... 

An inexact nonmonotone filter sequential quadratic programming algorithm is presented for solving general constrained nonlinear programming problems. At every iteration, a steering direction is computed as a minimizer of a linear model of the constraint violation over a trust region. A possible infeasible stationary point can be detected using the steering direction. If the current iterate is not an infeasible stationary point, a strongly convex feasible quadratic programming subproblem is defined to compute a search direction as an inexact solution satisfying some loose and achievable conditions. We prove that the search direction is a descent direction for the constraint violation or the... 

We propose an inexact nonmonotone successive quadratic programming (SQP) algorithm for solving nonlinear programming problems with equality constraints and bounded variables. Regarding the value of the current feasibility violation and the minimum value of its linear approximation over a trust region, several scenarios are envisaged. In one scenario, a possible infeasible stationary point is detected. In other scenarios, the search direction is computed using an inexact (truncated) solution of a feasible strictly convex quadratic program (QP). The search direction is shown to be a descent direction for the objective function or the feasibility violation in the feasible or infeasible... 

An inexact nonmonotone filter sequential quadratic programming algorithm is presented for solving general constrained nonlinear programming problems. At every iteration, a steering direction is computed as a minimizer of a linear model of the constraint violation over a trust region. A possible infeasible stationary point can be detected using the steering direction. If the current iterate is not an infeasible stationary point, a strongly convex feasible quadratic programming subproblem is defined to compute a search direction as an inexact solution satisfying some loose and achievable conditions. We prove that the search direction is a descent direction for the constraint violation or the... 

We propose an inexact nonmonotone successive quadratic programming (SQP) algorithm for solving nonlinear programming problems with equality constraints and bounded variables. Regarding the value of the current feasibility violation and the minimum value of its linear approximation over a trust region, several scenarios are envisaged. In one scenario, a possible infeasible stationary point is detected. In other scenarios, the search direction is computed using an inexact (truncated) solution of a feasible strictly convex quadratic program (QP). The search direction is shown to be a descent direction for the objective function or the feasibility violation in the feasible or infeasible... 

Quantum computing is an emerging and promising computational paradigm that provides substantial speedup for a variety of tasks such as integer factorization, database search, and machine learning. One of the quantum computation features is the possibility of developing quantum algorithms, which could be faster than algorithms developed for classic computers. However, we are still unable to fully realize a physical quantum computer and depend on traditional computers to simulate their behavior and test quantum algorithms. This is a source of complexity since one of the challenges to simulate quantum algorithms is the exponential memory requirement. In this work, we propose a method to... 

The elastic behavior of a screw dislocation which is positioned inside the shell domain of an eccentric core-shell nanowire is addressed with taking into account the surface/interface stress effect. The complex potential function method in combination with the conformal mapping function is applied to solve the governing non-classical equations. The dislocation stress field and the image force acting on the dislocation are studied in detail and compared with those obtained within the classical theory of elasticity. It is shown that near the free outer surface and the inner core-shell interface, the non-classical solution for the stress field considerably differs from the classical one, while... 

This paper studies the problem of receiver modeling in molecular communication systems. We consider the diffusive molecular communication channel between a transmitter nanomachine and a receiver nano-machine in a fluid environment. The information molecules released by the transmitter nano-machine into the environment can degrade in the channel via a first-order degradation reaction and those that reach the receiver nanomachine can participate in a reversible bimolecular reaction with receiver receptor proteins. Thereby, we distinguish between two scenarios. In the first scenario, we assume that the entire surface of the receiver is covered by receptor molecules. We derive a closed-form... 

The k-nearest neighbor (k-NN) is a widely used classification technique and has significant applications in various domains. The most challenging issues in the k-nearest neighbor algorithm are high dimensional data, the reasonable accuracy of results and suitable computation time. Nowadays, using parallel processing and deploying many-core platforms like GPUs is considered as one of the popular approaches to improving these issues. In this paper, we present a novel and accurate parallel implementation of k-NN based on Mahalanobis distance metric in GPU platform. We design and implement k-NN for GPU architecture and utilize mathematic and algorithmic techniques to eliminate repetitive... 

In this paper, a new extended quasi-switched Z-source inverter, using a switched-inductor cell, is proposed. The most important advantage of the proposed inverter is achieving the maximum voltage gain in the lower duty cycle with less circuit components than similar previous inverters, which causes the modulation index value increase. Furthermore, it leads to less power losses and less voltage and current ripples. The employed control method in this inverter is the pulse width modulation (PWM) simple boost control method. In this paper, theoretical analysis and comparison results of the proposed inverter with other similar ones are prepared. In addition, the experimental results reconfirm...