Study of polycrystalline Cu2ZnSnS4 films by Raman scattering

Cu2ZnSnS4 (CZTS) is a p-type semiconductor that has been seen as a possible low-cost replacement for Cu(In,Ga)Se2 in thin film solar cells. So far compound has presented difficulties in its growth, mainly, because of the formation of secondary phases like ZnS, CuxSnSx+1, SnxSy, Cu2−xS and MoS2. X-ray diffraction analysis (XRD), which is mostly used for phase identification cannot resolve some of these phases from the kesterite/stannite CZTS and thus the use of a complementary technique is needed. Raman scattering analysis can help distinguishing these phases not only laterally but also in depth. Knowing the absorption coefficient and using different excitation wavelengths in Raman scattering analysis, one is capable of profiling the different phases present in multi-phase CZTS thin films. This work describes in a concise form the methods used to grow chalcogenide compounds, such as, CZTS, CuxSnSx+1, SnxSy and cubic ZnS based on the sulphurization of stacked metallic precursors. The results of the films’ characterization by XRD, electron backscatter diffraction and scanning electron microscopy/energy dispersive spectroscopy techniques are presented for the CZTS phase. The limitation of XRD to identify some of the possible phases that can remain after the sulphurization process are investigated. The results of the Raman analysis of the phases formed in this growth method and the advantage of using this technique in identifying them are presented. Using different excitation wavelengths it is also analysed the CZTS film in depth showing that this technique can be used as non destructive methods to detect secondary phases.

Automatic tunning of Okumura-Hata model on railway communications

This paper presents the Genetic Algorithms (GA) as an efficient solution for the Okumura-Hata prediction model tuning on railways communications. A method for modelling the propagation model tuning parameters was presented. The algorithm tuning and validation were based on real networks measurements carried out on four different propagation scenarios and several performance indicators were used. It was shown that the proposed GA is able to produce significant improvements over the original model. The algorithm developed is currently been used on real GSM-R network planning process for an enhanced resources usage.

Multi-criteria optimization manipulator trajectory planning

In the last twenty years genetic algorithms (GAs) were applied in a plethora of fields such as: control, system identification, robotics, planning and scheduling, image processing, and pattern and speech recognition (Bäck et al., 1997). In robotics the problems of trajectory planning, collision avoidance and manipulator structure design considering a single criteria has been solved using several techniques (Alander, 2003). Most engineering applications require the optimization of several criteria simultaneously. Often the problems are complex, include discrete and continuous variables and there is no prior knowledge about the search space. These kind of problems are very more complex, since they consider multiple design criteria simultaneously within the optimization procedure. This is known as a multi-criteria (or multiobjective) optimization, that has been addressed successfully through GAs (Deb, 2001). The overall aim of multi-criteria evolutionary algorithms is to achieve a set of non-dominated optimal solutions known as Pareto front. At the end of the optimization procedure, instead of a single optimal (or near optimal) solution, the decision maker can select a solution from the Pareto front. Some of the key issues in multi-criteria GAs are: i) the number of objectives, ii) to obtain a Pareto front as wide as possible and iii) to achieve a Pareto front uniformly spread. Indeed, multi-objective techniques using GAs have been increasing in relevance as a research area. In 1989, Goldberg suggested the use of a GA to solve multi-objective problems and since then other researchers have been developing new methods, such as the multi-objective genetic algorithm (MOGA) (Fonseca & Fleming, 1995), the non-dominated sorted genetic algorithm (NSGA) (Deb, 2001), and the niched Pareto genetic algorithm (NPGA) (Horn et al., 1994), among several other variants (Coello, 1998). In this work the trajectory planning problem considers: i) robots with 2 and 3 degrees of freedom (dof ), ii) the inclusion of obstacles in the workspace and iii) up to five criteria that are used to qualify the evolving trajectory, namely the: joint traveling distance, joint velocity, end effector / Cartesian distance, end effector / Cartesian velocity and energy involved. These criteria are used to minimize the joint and end effector traveled distance, trajectory ripple and energy required by the manipulator to reach at destination point. Bearing this ideas in mind, the paper addresses the planning of robot trajectories, meaning the development of an algorithm to find a continuous motion that takes the manipulator from a given starting configuration up to a desired end position without colliding with any obstacle in the workspace. The chapter is organized as follows. Section 2 describes the trajectory planning and several approaches proposed in the literature. Section 3 formulates the problem, namely the representation adopted to solve the trajectory planning and the objectives considered in the optimization. Section 4 studies the algorithm convergence. Section 5 studies a 2R manipulator (i.e., a robot with two rotational joints/links) when the optimization trajectory considers two and five objectives. Sections 6 and 7 show the results for the 3R redundant manipulator with five goals and for other complementary experiments are described, respectively. Finally, section 8 draws the main conclusions.

Logarithmically proportional objective function for planar surfaces recognition in 3D point cloud

3D laser scanning is becoming a standard technology to generate building models of a facility's as-is condition. Since most constructions are constructed upon planar surfaces, recognition of them paves the way for automation of generating building models. This paper introduces a new logarithmically proportional objective function that can be used in both heuristic and metaheuristic (MH) algorithms to discover planar surfaces in a point cloud without exploiting any prior knowledge about those surfaces. It can also adopt itself to the structural density of a scanned construction. In this paper, a metaheuristic method, genetic algorithm (GA), is used to test this introduced objective function on a synthetic point cloud. The results obtained show the proposed method is capable to find all plane configurations of planar surfaces (with a wide variety of sizes) in the point cloud with a minor distance to the actual configurations. © 2014 IEEE.

Fitness function evaluation through fractional algorithms

This paper proposes a Genetic Algorithm (GA) for the design of combinational logic circuits. The fitness function evaluation is calculated using Fractional Calculus. This approach extends the classical fitness function by including a fractional-order dynamical evaluation. The experiments reveal superior results when comparing with the classical method.

Application of fractional order concepts in the study of electrical potential

The Maxwell equations, expressing the fundamental laws of electricity and magnetism, only involve the integer-order calculus. However, several effects present in electromagnetism, motivated recently an analysis under the fractional calculus (FC) perspective. In fact, this mathematical concept allows a deeper insight into many phenomena that classical models overlook. On the other hand, genetic algorithms (GA) are an important tool to solve optimization problems that occur in engineering. In this work we use FC and GA to implement the electrical potential of fractional order. The performance of the GA scheme and the convergence of the resulting approximations are analyzed.

Application of genetic algorithms in the design of an electrical potential of fractional order

Fractional calculus (FC) is currently being applied in many areas of science and technology. In fact, this mathematical concept helps the researches to have a deeper insight about several phenomena that integer order models overlook. Genetic algorithms (GA) are an important tool to solve optimization problems that occur in engineering. This methodology applies the concepts that describe biological evolution to obtain optimal solution in many different applications. In this line of thought, in this work we use the FC and the GA concepts to implement the electrical fractional order potential. The performance of the GA scheme, and the convergence of the resulting approximation, are analyzed. The results are analyzed for different number of charges and several fractional orders.

Crossing genetic and swarm intelligence algorithms to generate logic circuits

Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary ideas of natural selection and genetic. The basic concept of GAs is designed to simulate processes in natural system necessary for evolution, specifically those that follow the principles first laid down by Charles Darwin of survival of the fittest. On the other hand, Particle swarm optimization (PSO) is a population based stochastic optimization technique inspired by social behavior of bird flocking or fish schooling. PSO shares many similarities with evolutionary computation techniques such as GAs. The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is attractive because there are few parameters to adjust. This paper presents hybridization between a GA algorithm and a PSO algorithm (crossing the two algorithms). The resulting algorithm is applied to the synthesis of combinational logic circuits. With this combination is possible to take advantage of the best features of each particular algorithm.

Calculation of fractional derivatives of noisy data with genetic algorithms

This paper addresses the calculation of derivatives of fractional order for non-smooth data. The noise is avoided by adopting an optimization formulation using genetic algorithms (GA). Given the flexibility of the evolutionary schemes, a hierarchical GA composed by a series of two GAs, each one with a distinct fitness function, is established.

A fractional calculus perspective in the evolutionary design of combinational circuits

This paper analyses the performance of a genetic algorithm (GA) in the synthesis of digital circuits using two novel approaches. The first concept consists in improving the static fitness function by including a discontinuity evaluation. The measure of variability in the error of the Boolean table has similarities with the function continuity issue in classical calculus. The second concept extends the static fitness by introducing a fractional-order dynamical evaluation.

A resource for signs and Feynman diagrams of the standart model

When performing a full calculation within the standard model (SM) or its extensions, it is crucial that one utilizes a consistent set of signs for the gauge couplings and gauge fields. Unfortunately, the literature is plagued with differing signs and notations. We present all SM Feynman rules, including ghosts, in a convention-independent notation, and we table the conventions in close to 40 books and reviews.

Charged higgs bosons in single top production at the LHC

We show that a light charged Higgs boson signal via tau(+/-)nu decay can be established at the Large Hadron Collider (LHC) also in the case of single top production. This process complements searches for the same signal in the case of charged Higgs bosons emerging from t (t) over bar production. The models accessible include the Minimal Supersymmetric Standard Model (MSSM) as well a variety of 2-Higgs Doublet Models (2HDMs). High energies and luminosities are however required, thereby restricting interest on this mode to the case of the LHC running at 14TeV with design configuration.

Could the LHC two-proton signal correspond to the heavier scalar in two-higgs-doublet models?

LHC has reported tantalizing hints for a Higgs boson of mass 125 GeV decaying into two photons. We focus on two-Higgs-doublet Models, and study the interesting possibility that the heavier scalar H has been seen, with the lightest scalar h having thus far escaped detection. Nonobservation of h at LEP severely constrains the parameter-space of two-Higgs-doublet models. We analyze cases where the decay H -> hh is kinematically allowed, and cases where it is not, in the context of type I, type II, lepton-specific, and flipped models.

Metop-A generator for single top production via FCNC interactions

We present a generator for single top-quark production via flavour-changing neutral currents. The MEtop event generator allows for Next-to-Leading-Order direct top production pp -> t and Leading-Order production of several other single top processes. A few packages with definite sets of dimension six operators are available. We discuss how to improve the bounds on the effective operators and how well new physics can be probed with each set of independent dimension six operators.

Properties of patchy colloidal particles close to a surface: a Monte Carlo and density functional study

We investigate the behavior of a patchy particle model close to a hard-wall via Monte Carlo simulation and density functional theory (DFT). Two DFT approaches, based on the homogeneous and inhomogeneous versions of Wertheim's first order perturbation theory for the association free energy are used. We evaluate, by simulation and theory, the equilibrium bulk phase diagram of the fluid and analyze the surface properties for two isochores, one of which is close to the liquid side of the gas-liquid coexistence curve. We find that the density profile near the wall crosses over from a typical high-temperature adsorption profile to a low-temperature desorption one, for the isochore close to coexistence. We relate this behavior to the properties of the bulk network liquid and find that the theoretical descriptions are reasonably accurate in this regime. At very low temperatures, however, an almost fully bonded network is formed, and the simulations reveal a second adsorption regime which is not captured by DFT. We trace this failure to the neglect of orientational correlations of the particles, which are found to exhibit surface induced orientational order in this regime.