... 2, the algorithms for the duplicate-grouping problem are presented The randomized algorithms are based on the universal class of multiplicative hash functions The randomized closest-pair algorithm ... seminal paper on randomized algorithms, Rabin w27x proposed an algorithm for solving the closest-pair problem The key idea of the algorithm is to determin...
... 3.6 For a suitable choice of the mappings A, η, F, M, Ik , and space X, then the Algorithm 3.5 can be degenerated to the hybrid proximal point algorithm 16, 17 and the over-relaxed A-proximal point ... generalized version of the over-relaxed proximal point algorithm and its applications to approximation solvability of the inclusion problem of the form 2.1 b...
... 2010, Article ID 383740, 19 pages, 2010 11 P Cholamjiak and S Suantai, A new hybrid algorithm for variational inclusions, generalized equilibrium problems, and a finite family of quasi -nonexpansive ... P Katchang and P Kumam, A general iterative method of fixed points for mixed equilibrium problems and variational inclusion problems, Journal of...
... of two variational inequalities VI C ,A and VI C,B PC ; solution of a system of two mixed equilibrium problems Tn Trn and Vn solution of a mixed equilibrium problem and a variational inequality ... prove a strong convergence theorem to approximate a fixed point of S that is also a solution of a mixed equilibrium problem and a solution...
... local Riemannian p-homogeneous forms; we define a suitable notion of Kato class of measures We assume that the potential is a measure in the Kato class and we prove a Harnack inequality (on balls ... (bilinear) Riemannian Dirichlet form was considered in [4, 17] In [7] the Kato class was defined in the case of subelliptic p-Laplacian and in [10] the...
... that is, guaranteeing that the generated Rayleigh envelopes are exactly corresponding to the desired covariance matrix The model of a Rayleigh fading generator for generating an individual baseband ... FLAT RAYLEIGH FADING ENVELOPES 4.1 Covariance matrix of complex Gaussian random variables with Rayleigh fading envelopes It is known that Rayleigh fading...
... important role in determining the mutation class of a quiver In [2], the authors prove that the mutation class of an adjacency matrix associated to a triangulation of a bordered surface with marked ... graph has a unique decomposition, so does the original graph the electronic journal of combinatorics 18 (2011), #P91 43 As an application of the al...
... reader that it refers to a set of MVRPD demand points that emanate from the same IRP customer i and that all share the same geographical location Cumulated quantities Given the nature of the inventory ... deterministic and dynamic demand, and have a finite capacity for holding local inventory Holding costs are however considered at the central warehouse, as well as at the...
... Derivation and preliminary validation of an administrative claims-based algorithm for the effectiveness of medications for rheumatoid arthritis Jeffrey R Curtis1,#, John W Baddley1,2, Shuo Yang1, ... VARA visits; all other data used for the analysis were from the administrative claims data To test the performance of the effectiveness algorithm...
... of the problem, optimal algorithms can solve some instances of the p- median problem with reasonable effort A typical approach is to combine Lagrangian relaxation with branch-and-bound (see, for ... members of the population after every population update The steps for the replacement operator are as follows Replacement Operator Input: One candidate member Step If fitness value...
... therefore in this paper a new transformation which preserves the same advantages as the Park transformation A Mathematical Model of the BDCM We suppose that the motor has the following typical features ... pulsating torque (the homopolar part) and a two-phase motor with a rotating field (the "ap" The classical Park transformation is, in fact, the succ...
... calculate the gap matrices For a given gap matrix, we have to consider all the different ways that its diagram can be assembled using one or two matrices at a time (Again, Feynman diagrams are ... folding and for RNA structural alignment and structural similarity searches The Inside and CYK dynamic programming algorithms used for SCFGbased structural alignment are fundamentall...
... identification and simulation A mathematical model was developed, representing central carbohydrate metabolism in leaves of A thaliana The model was based on the following system of ordinary differential ... in A thaliana A D B E C F Fig Maximum activities of enzymes in central carbohydrate metabolism during cold exposure (A C) Vmax values of three invertase...
... domain of each subunit contributes to the formation of the hydrophilic pore ACh binding protein has structural and functional homology to the extracellular ligand binding domain of the nAChR, and ... development of selective drugs is the identification and pharmacological characterization of the various receptor subtypes, and the determination of their prec...
... In particular if X is a set of reals of cardinality ℵ1 , then X serves as a single -element basis for the class of uncountable separable linear orders PFA is a strengthening of the Baire Category ... C UNCOUNTABLE LINEAR ORDERS 671 ∗ Conjecture (PFA) [4] The orders X, ω1 , ω1 , C and C ∗ form a five element basis for the uncountable linear orders...