That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo’s paradox. We establish a strong law of large numbers and a central limit theorem for the Parrondo player’s sequence of profits, both in a one-parameter family of capital-dependent games and in a two-parameter family of history-dependent games...

In this paper, buckling and free vibration analysis of a circular tapered nanoplate subjected to in-plane forces were studied. The linear variation of the plate thickness was considered in radial direction. Nonlocal elasticity theory was employed to capture size-dependent effects. The Raleigh-Ritz method and differential transform method were utilized to obtain the frequency equations for simpl...

In this paper, axisymmetric free vibration analysis of a circular Nano-plate having variable thickness was studied. The variation in thickness of plate was considered as a linearly in radial direction. Nonlocal elasticity theory was utilized to take into account size-dependent effects. Ritz functions was utilized to obtain the frequency equations for simply supported and clamped boundary. To ve...

Parameter estimation of polynomial phase signals (PPSs) is of great interest in various practical applications. In this paper, parametric methods for parameter estimation of polynomial phase signals are discussed and compared. The suboptimal maximum likelihood estimation methods, such as the high-order ambiguity function (HAF) and the product HAF (PHAF) are presented. The polynomial time freque...

In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show combinatorial weaknesses of the cryptosystem, and introduce a variant of the XL resolution algorithm, the Linear Method, which is able to leverage these weaknesses to invert in short time the trapdoor one-way function defin...

This paper investigates analogs of the Kreisel-Lacombe-Shoenfield Theorem in the context of the type-2 basic feasible functionals. We develop a direct, polynomial-time analog of effective operation in which the time boundingon computations is modeled after Kapron and Cook’s scheme for their basic polynomial-time functionals. We show that if P = NP, these polynomial-time effective operations are...

In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP optimization problem has a fully polynomial time approximation scheme if and only if the problem is polynomial fixed-parameter tractable. By enfor...

There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints. In this work, we lift the investigations to the case of directed graphs; herein, we focus on arc insertions. To this end, our general two-stage framework consists of efficiently solving a problem-specific number pro...