Certain subclasses of multivalent functions defined by new multiplier transformations

In the present paper the new multiplier transformations \mathrm{{\mathcal{J}% }}_{p}^{\delta }(\lambda ,\mu ,l) (\delta ,l\geq 0,\;\lambda \geq \mu \geq 0;\;p\in \mathrm{% }%\mathbb{N} )} of multivalent functions is defined. Making use of the operator $\mathrm{{\mathcal{J}}}_{p}^{\delta }(\lambda ,\mu ,l),$ two new subclasses $\mathcal{P}_{\lambda ,\mu ,l}^{\delta }(A,B;\sigma ,p)$ and $\widetilde{\mathcal{P}}_{\lambda ,\mu ,l}^{\delta }(A,B;\sigma ,p)$\textbf{\ }of multivalent analytic functions are introduced and investigated in the open unit disk. Some interesting relations and characteristics such as inclusion relationships, neighborhoods, partial sums, some applications of fractional calculus and quasi-convolution properties of functions belonging to each of these subclasses $\mathcal{P}_{\lambda ,\mu ,l}^{\delta }(A,B;\sigma ,p)$ and $\widetilde{\mathcal{P}}_{\lambda ,\mu ,l}^{\delta }(A,B;\sigma ,p)$ are investigated. Relevant connections of the definitions and results presented in this paper with those obtained in several earlier works on the subject are also pointed out

Goodness-of-fit test in parametric mixed effects models based on estimation of the error distribution

We address the problem of testing for a parametric function of fixed effects in mixed models. We propose a test based on the distance between two empirical error distribution functions, which are constructed from residuals calculated under the opposing hypotheses. The proposed test statistic has power against all alternatives, and its asymptotic distribution is derived. A simulation study shows that the test outperforms others in the literature. The test is applied to longitudinal data from an AIDS clinical trial and a growth study

Unifying Thread-Level Speculation and Transactional Memory ⋆

Abstract. The motivation of this work is to ask whether Transactional Memory (TM) and Thread-Level Speculation (TLS), two prominent concurrency paradigms usually considered separately, can be combined into a hybrid approach that extracts untapped parallelism and speed-up from common programs. We show that the answer is positive by describing an algorithm, called TLSTM, that leverages an existing TM with TLS capabilities. We also show that our approach is able to achieve up to a 48 % increase in throughput over the base TM, on read dominated workloads of long transactions in a multi-threaded application.