Interplay of polarization geometry and rotational dynamics in high harmonic generation from coherently rotating linear molecule

Recent reports on intense-field pump-probe experiments for high harmonic generation from coherently rotating linear molecules, have revealed remarkable characteristic effects of the simultaneous variation of the polarization geometry and the time delay on the high harmonic signals. We analyze the effects and give a unified theoretical account of the experimental observationsComment: 4 pages, 5 figure

Multiphoton excitations in vibrational rotational states of diatomic molecules in intense electromagnetic field

A theory is presented and a calculational procedure is outlined for evaluating transition amplitudes of multiphoton excitations of vibrational-rotational levels in diatomic molecules. This theory can be utilized in studying behavior of molecules in intense electromagnetic fields

Analisis Determinan Earnings Management

This study aims to examines the relationship between the level of leverage, free cash flow, financing requirements, auditor\u27s independence and audit committee independence as a determinant of earnings management behavior. This study uses discretionary accruals as a proxy on earnings management.This study uses data manufacturing companies listed in Indonesia Stock Exchange (IDX) with a selected sample by purposive sampling method with a total sample of 43 companies and data used are annual report from 2012 period until 2014. To test the effect of each independent variable on the dependent variable using multiple linear regression. The results showed that the level of leverage negatively affect earnings management behavior while financing needs positively effect on earnings management behavior

Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms

Kernelization algorithms in the context of Parameterized Complexity are often based on a combination of reduction rules and combinatorial insights. We will expose in this paper a similar strategy for obtaining polynomial-time approximation algorithms. Our method features the use of approximation-preserving reductions, akin to the notion of parameterized reductions. We exemplify this method to obtain the currently best approximation algorithms for \textsc{Harmless Set}, \textsc{Differential} and \textsc{Multiple Nonblocker}, all of them can be considered in the context of securing networks or information propagation