Does PPP hold for Big Mac price or consumer price index? Evidence from panel cointegration

This paper examines the validity of purchasing power parity (PPP) using CPI and Big Mac prices. The benchmark model, i.e., the OLS method, which does not take nonstationarity into account, rejects the hypothesis of PPP regardless of prices used. We next use the panel cointegration method to consider the nonstationary nature of variables. Estimated results for CPI are mixed. The PPP is rejected when the nominal exchange rate is employed as the dependent variable but is not rejected when the price ratio is used as the dependent variable. By contrast, the PPP is overwhelmingly not rejected when the Big Mac price is used. Last, we remove the production bias and re-examine the same issue by using panel cointegration. The PPP is again decisively rejected when CPI price is used but not for Big Mac price. Accordingly, Big Mac price is more supportive to the validity of PPP than CPI price.Big Mac

Least Squares Estimation of the Pareto Type I and II Distribution

The estimation of the Pareto distribution can be computationally expensive and the method is badly biased. In this work, an improved Least Squares derivation is used and the estimation will be less biased. Numerical examples and figures are provided so that one may observe the solution more clearly. Furthermore, by varying the different methods of estimation, a comparing of the estimators of the parameters is given. The improved Least Squares derivation is confidently employed for it is economic and efficient

The Photodecomposition and Photooxidation of Aliphatic Amines

The ultraviolet irradiation of ammonia-saturated liquid cyclohexane produces two products, cyclohexylamine in a photostationary state and cyclohexylcyclohexane. It is assumed that ammonia is responsible for the initial light absorption which leads to the observed reaction products. The products and rates of product formation have been determined for the ultraviolet irradiation of cyclohexylamine, cyclopentylamine, and n-hexylamine in saturated hydrocarbon solvents. The results demonstrate that (1) imines are produced during the irradiation, (2) ammonia is isolated and identified, (3) both carbon-nitrogen and nitrogen-hydrogen bonds cleave to varying degrees during the irradiation, and (4) the cleavage pattern is dependent on the stability of the alkyl radicals produced. Direct ultraviolet irradiation of the secondary amines, _i..e., di-n- hexylamine, dicyclohexylamine, and n-hexylcyclohexylamine in cyclohexane liquid solution, produces the corresponding imine in preparative yields (89-91%). The primary process of the photooxidation of cyclohexylamine is determined as charge-transfer excitation by the light absorption dependence of the reaction. The primary products are cyclohexanone oxime, N- cyclohexylidenecyclohexylamine, ammonia, and water. Synthesis and studies of 1-hydroperoxycyclohexylamine show that it is probably the precursor for N-cyclohexylidenecyclohexylamine . Cyclohexanone oxime is presumably generated from the thermal or photodecomposition of N- hydroperoxycyclohexylamine. Hydrogen peroxide is probably present in the photomixture of cyclohexylamine. When ionization potentials of aliphatic amines are plotted versus the frequency of charge-transfer bands, a linear relationship is obtained . The relative rates of oxygen uptake during the photooxidation of cyclic hydrocarbons show that the carbon-hydrogen rather than carbon- carbon bond is the donor in the contact charge-transfer process between oxygen and the hydrocarbon

Masser-W\"ustholz bound for reducibility of Galois representations for Drinfeld modules of arbitrary rank

In this paper, we give an explicit bound on the irreducibility of mod-$\mathfrak{l}$ Galois representation for Drinfeld modules of arbitrary rank without complex multiplication. This is a function field analogue of Masser-W\"ustholz bound on irreducibility of mod-$\ell$ Galois representation for elliptic curves over number field.Comment: 8 page

An approximation theory for the identification of linear thermoelastic systems

An abstract approximation framework and convergence theory for the identification of thermoelastic systems is developed. Starting from an abstract operator formulation consisting of a coupled second order hyperbolic equation of elasticity and first order parabolic equation for heat conduction, well-posedness is established using linear semigroup theory in Hilbert space, and a class of parameter estimation problems is then defined involving mild solutions. The approximation framework is based upon generic Galerkin approximation of the mild solutions, and convergence of solutions of the resulting sequence of approximating finite dimensional parameter identification problems to a solution of the original infinite dimensional inverse problem is established using approximation results for operator semigroups. An example involving the basic equations of one dimensional linear thermoelasticity and a linear spline based scheme are discussed. Numerical results indicate how the approach might be used in a study of damping mechanisms in flexible structures

Applications of gert to quality control

In this thesis, the characteristics of various sampling plans and control charts are modeled by GERT. Most of the sampling models provide information about the probabilities of accepting and rejecting a lot, the expected number and variance of units passed until the lot is accepted as well as rejected. The control chart models are used to compute the expected number of points under control until an out of control condition occurs

Developing Efficient Algorithms of Decoding the Systematic Quadratic Residue Code with Lookup Tables

The lookup table methods for decoding binary systematic Quadratic Residue (QR) code are presented in this paper. The key ideas behind this decoding technique are based on one to one corresponding mapping between the syndromes and the correctable error patterns. Such algorithms determine the error locations directly by lookup tables without the operations of addition and multiplication over a finite field. Moreover, the methods to dramatically reduce the memory requirement by shift-search decoding are utilized. Two new algorithm have been verified through a software simulation in C language. The new approach is modular, regular and naturally suitable for System on Chip (SOC) software implementation

Speculative reordering for a latency-optimized privacy protection in complex event processing

With increasing number of applications in Internet of Things (IoT), Complex Event Processing (CEP) has already become one of the state-of-the-art technologies recently. In CEP, privacy needs to be considered carefully because events with user’s sensitive information may be exposed to outside world. However, most privacy issues in CEP mainly focus on attribute-based events without considering pattern-based events. There are two important works for pattern-based privacy in CEP: suppression and re-ordering. The former suppresses events belonging to private patterns while the later tends to reorder them. The re-ordering mechanism shows better performance in terms of QoS, but the latency would be long when the size of window increases. Also, the re-ordering strategy is performed only at the end of the windows. In this thesis, we extend the Re-ordering strategy by using speculation based on Markov chains, so we start speculating whether the private pattern occurs in current window before the end of the window. If the private pattern is predicted to occur, we then already re-order events that are part of private patterns. Additionally, the top-k preserving algorithm is introduced for preserving public patterns. Our evaluation results show that we maintain nearly 80 % utility when compared to the normal re-ordering strategy. From our experiments, it is seen that we can eliminate the time taken for re-ordering completely if the window size is greater than 3 ms