Growth pressure dependence of Cu2ZnSnSe4 properties

In this work, we show a set of growth conditions, for the two step process, with which the growth of CZTSe is successful and reproducible. The properties of the best CTZSe thin films grown by this method were examined by SEM/EDS, XRD, Raman scattering, AFM/EFM, transmittance and reflectance measurements, photoluminescence (PL) measurements and hot point probe. A broad emission band was observed in the photoluminescence spectrum of the CZTSe thin film. The band gap energy was estimated to be around 1.05 eV at room temperature, using the transmittance and reflectance data, and CZTSe samples show p-type conductivity with the hot point probe. The different characterization techniques show that we could grow single phase CZTSe thin films with our optimized process conditions.

Long-term dependence in financial prices: evidence from the Belgian stock market returns

This article aims to contribute to the discussion of long-term dependence, focusing on the behavior of the main Belgian stock index. Non-parametric analyzes of the general characteristics of temporal frequency show that daily returns are non-ergodic and non-stationary. Therefore, we use the rescaled-range analysis (R/S) and the detrended fluctuation analysis (DFA), under the fractional Brownian motion approach, and we found slight evidence of long-term dependence. These results refute the random walk hypothesis with i.i.d. increments, which is the basis of the EMH in its weak form, and call into question some theoretical modeling of asset pricing. Other more localized complementary study, to identify the evolution of the degree of dependence over time windows, showed that the index has become less persistent from 2010. This may mean a maturing market by the extension of the effects of current financial crisis.

From cheating to teaching: a path for conversion of illegal gambling machines

Video poker machines, a former symbol of fraud and gambling in Brazil, are now being converted into computer-based educational tools for Brazilian public primary schools and also for governmental and non-governmental institutions dealing with communities of poverty and social exclusion, in an attempt to reduce poverty risks (decrease money spent on gambling) and promote social inclusion (increase access and motivation to education). Thousands of illegal gambling machines are seized by federal authorities, in Brazil, every year, and usually destroyed at the end of the criminal apprehension process. This paper describes a project developed by the University of Southern Santa Catarina, Brazil, responsible for the conversion process of gambling machines, and the social inclusion opportunities derived from it. All project members worked on a volunteer basis, seeking to promote social inclusion of Brazilian young boys and girls, namely through digital inclusion. So far, the project has been able to convert over 200 gambling machines and install them in over 40 public primary schools, thus directly benefiting more than 12,000 schoolchildren. The initial motivation behind this project was technology based, however the different options arising from the conversion process of the gambling machines have also motivated a rather innovative and unique experience in allowing schoolchildren and young people with special (educational) needs to access to computer-based pedagogical applications. The availability of these converted machines also helps to place Information and Communication Technologies (ICT) in the very daily educational environment of these children and youngsters, thus serving social and cultural inclusion aspects, by establishing a dialogue with the community and their technological expectations, and also directly contributing to their digital literacy.

Cutting path as a rural postman problem

The Rural Postman Problem (RPP) is a particular Arc Routing Problem (ARP) which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications. This paper introduces an original approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates “social knowledge”, using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications.