Abstract. Sampling points from the uniform distribution on a polytope is a well-studied problem, and is an important ingredient in several computational tasks involving polytopes, such as volume estimation. This is achieved by setting up a random walk inside the polytope, with its stationary distribution being uniform in the interior of the polytope. Kannan-Narayanan [6] and Narayanan [9] propo...

In this editorial accompanying the special section on Marketing Science in Emerging Markets (MSEM), we describe how research on emerging markets can contribute to richer theoretical and substantive understanding of markets and marketing. Such research can also aid in providing managerial guidance on how to operate in emerging markets. We conclude with a description of the selection and review p...

Specific and robust targeting of pathogenic cells would represent a major advance in treatment eye diseases including diabetic retinopathy. In article number 2000181 Rangaramanujam M. Kannan, Elia J. Duh co-workers use the corticosteroid triamcinolone conjugated to surface PAMAM-dendrimers, which are tree-like branching polymeric nanoparticles. This dendrimer-triamcinolone conjugate selectively...

We study the computational problem of determining covering radius a rational polytope. This parameter is defined as minimal dilation factor that needed for lattice translates correspondingly dilated polytope to cover whole space. As our main result, we describe new algorithm this problem, which simpler, more efficient and easier implement than only prior Kannan (1992). Motivated by variant famo...

The purpose of this paper is to introduce the class (a,b,c)-modified enriched Kannan pair mappings (T,S) in setting Banach space that includes mappings, contraction and nonexpansive some other mappings. Some examples are presented support concepts introduced herein. We establish existence common fixed point such pair. also show problem studied herein well posed. A convergence theorem for Krasno...

in this paper, a new class of multifunctions, called generalized alpha (mu_{x};mu_{ y} )-continuous multifunctions, has been dened and studied. some characterizations and severalproperties concerning generalized alpha (mu_{x};mu_{ y} )-continuous multifunctions are obtained. the re-lationships between generalized alpha (mu_{x};mu_{ y} )-continuous multifunctions and some known con-ce...

Let A be a 0/1 matrix of size m × n, and let p be the density of A (i.e., the number of ones divided by m · n). We show that A can be approximated in the cut norm within ε ·mnp by a sum of cut matrices (of rank 1), where the number of summands is independent of the sizem ·n of A, provided that A satisfies a certain boundedness condition. This decomposition can be computed in polynomial time. Th...

p ≥2 -cyclic and contractive self-mappings on a set of subsets of a metric space which are simultaneously accretive on the wholemetric space are investigated. The joint fulfilment of the p-cyclic contractiveness and accretive properties is formulated as well as potential relationships with cyclic self-mappings in order to be Kannan self-mappings. The existence and uniqueness of best proximity p...

We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementation of KFP specifically targeting cryptographically relevant dimensions. In order to optimize this implementation, we theoretically and experimentally study several facets of KFP, including its efficient parallelization and...

Vol. XLII (May 2005), 233–239 233 *Shibo Li is Assistant Professor of Marketing, Rutgers Business School—Newark and New Brunswick, Rutgers University (e-mail: [email protected]). Baohong Sun is Associate Professor of Marketing, Tepper School of Business, Carnegie Mellon University (e-mail: [email protected]). Ronald T. Wilcox is Associate Professor of Business Administration, Darde...