Search

Lead-free metal halide perovskites are emerging as less-toxic alternatives to their lead-based counterparts. However, their applicability in optoelectronic devices is limited, and the charge transport dynamics remain poorly understood. Understanding photo-induced charge and structural dynamics is critical for unlocking the potential of these novel systems. In this work, we employ ultrafast optical and Raman spectroscopy combined with band structure calculations to investigate the coupled electronic and vibrational dynamics in Caesium gold bromide, a promising lead-free perovskite. We find that the band-edge charge transfer states are strongly coupled to Au-Br stretching phonon modes, leading to frequency modulation of absorption by impulsively excited coherent phonons. Early-stage relaxation is characterized by dynamics of delocalized charge transfer excitation and slowly decaying coherent phonons. The electronic and vibrational relaxation reveals a slow formation of a localized polaronic state in the 10-20 ps timescale. Using a displaced harmonic oscillator model, the polaronic binding energy is estimated to be ~80 meV following lattice relaxation along the phonon modes. Strong exciton-phonon coupling and slow polaron formation via coupling to lattice modes make this material a promising testbed for the control of coherent phonons and localized polaronic states using light., Comment: 38 pages, 15 Figures

In this paper, we focus on the problem of item matching using only the description. Those specific items not only lack a unique code but also contain short text descriptions, making the item matching process difficult. Our goal is to compare products using only the description provided by the purchase process. Therefore, evaluating other characteristics and differences can uncover possible flaws during the acquiring phase. However, the text of the items that we were working on was very small, with numbers due to the nature of the products and we have a limited amount of time to develop the solution which was 8 weeks. As result, we showed that working using a well-oriented methodology we were able to deliver a successful MVP and achieve the results expected with up to 55% match.

Neuromuscular electrical stimulation (NMES) has been effectively applied in many rehabilitation treatments of individuals with spinal cord injury (SCI). In this context, we introduce a novel, robust, and intelligent control-based methodology to closed-loop NMES systems. Our approach utilizes a robust control law to guarantee system stability and machine learning tools to optimize both the controller parameters and system identification. Regarding the latter, we introduce the use of past rehabilitation data to build more realistic data-driven identified models. Furthermore, we apply the proposed methodology for the rehabilitation of lower limbs using a control technique named the robust integral of the sign of the error (RISE), an offline improved genetic algorithm optimizer, and neural network models. Although in the literature, the RISE controller presented good results on healthy subjects, without any fine-tuning method, a trial and error approach would quickly lead to muscle fatigue for individuals with SCI. In this paper, for the first time, the RISE controller is evaluated with two paraplegic subjects in one stimulation session and with seven healthy individuals in at least two and at most five sessions. The results showed that the proposed approach provided a better control performance than empirical tuning, which can avoid premature fatigue on NMES-based clinical procedures., Comment: 49 pages, 16 figures, 5 tables

Given a graph $G$, let $vc(G)$ and $vc^+(G)$ be the sizes of a minimum and a maximum minimal vertex covers of $G$, respectively. We say that $G$ is well covered if $vc(G)=vc^+(G)$ (that is, all minimal vertex covers have the same size). Determining if a graph is well covered is a coNP-complete problem. In this paper, we obtain $O^*(2^{vc})$-time and $O^*(1.4656^{vc^+})$-time algorithms to decide well coveredness, improving results of Boria et. al. (2015). Moreover, using crown decomposition, we show that such problems admit kernels having linear number of vertices. In 2018, Alves et. al. (2018) proved that recognizing well covered graphs is coW[2]-hard when the independence number $\alpha(G)=n-vc(G)$ is the parameter. Contrasting with such coW[2]-hardness, we present an FPT algorithm to decide well coveredness when $\alpha(G)$ and the degeneracy of the input graph $G$ are aggregate parameters. Finally, we use the primeval decomposition technique to obtain a linear time algorithm for extended $P_4$-laden graphs and $(q,q-4)$-graphs, which is FPT parameterized by $q$, improving results of Klein et al (2013)., Comment: 15 pages, 2 figures

Traditional dictionary learning methods are based on quadratic convex loss function and thus are sensitive to outliers. In this paper, we propose a generic framework for robust dictionary learning based on concave losses. We provide results on composition of concave functions, notably regarding super-gradient computations, that are key for developing generic dictionary learning algorithms applicable to smooth and non-smooth losses. In order to improve identification of outliers, we introduce an initialization heuristic based on undercomplete dictionary learning. Experimental results using synthetic and real data demonstrate that our method is able to better detect outliers, is capable of generating better dictionaries, outperforming state-of-the-art methods such as K-SVD and LC-KSVD.

This paper describes NS - Network Simulator, the computer networks simulation tool. We offer an overview NS, and also analyze its characteristics and functions. Finally, we present in detail all steps for preparing a simulation of a simple model in NS., Comment: in Portuguese, Semin\'ario Estudantil de Produ\c{c}\~ao Acad\^emica, 2002

We consider chiral fermions interacting minimally with abelian and non-abelian gauge fields. Using a path integral approach and exploring the consequences of a mechanism of symmetry restoration, we show that the gauge anomaly has null expectation value in the vacuum for both cases (abelian and non-abelian). We argue that the same mechanism has no possibility to cancel the chiral anomaly, what eliminates competition between chiral and gauge symmetry at full quantum level. We also show that the insertion of the gauge anomaly in arbitrary gauge invariant correlators gives a null result, which points towards anomaly cancellation in the subspace of physical state vectors., Comment: published version