(11)C-LY2795050 is a novel kappa opioid receptor (KOR) antagonist tracer for positron emission tomography (PET) imaging. The purpose of this first-in-human study was to determine the optimal kinetic model for analysis of (11)C-LY2795050 imaging data. Sixteen subjects underwent baseline scans and blocking scans after oral naltrexone. Compartmental modeling and multilinear analysis-1 (MA1) were a...

Preface. Our approach to cryptography is heavily based on computational complexity. Thus, some background on computational complexity is required for our discussion of cryptography. Below, we briefly recall the definitions of the complexity classes P, NP, BPP, “non-uniform P” (i.e., P/poly), and the concept of oracle machines. In addition, we discuss the type of intractability assumptions used ...

In this paper, we extend the classical Variable Size Bin Packing Problem (VS-BPP) by adding time features to both bins and items. Specifically, the bins act as machines that process the assigned batch of items with a fixed processing time. Hence, the items are available for processing at given times and are penalized for tardiness. Within this extension we also consider a stochastic variant, wh...

The Polymer Electrolyte Membrane Fuel Cell (PEMFC), despite being regarded as an ideal replacement to the internal combustion engine, is still not an economically attractive prime-mover due to a number of key challenges that have yet to be fully resolved; such as degradation to cell components resulting in inadequate lifetimes, specialised manufacturing processes and poor gravimetric/volumetric...

Theorem 1 If there exists a probabilistic polynomial time (PPT) algorithm A such that PrM←μk,p [A(1 k, 1p,M) 6= Perm(M) mod p ] ≤ 1 3(k+1) , then there exists a PPT algorithm B such that for every M ∈ Zk×k p , Prcoins of B [B(1k, 1p,M) 6= Perm(M) mod p] ≤ 1/3 In particular, we’d have that ModPerm ∈ BPP, and thus P#P = BPP. (We proved ModPerm was #P-hard last class). Note that this theorem is us...

Color Digital Images require huge storage and transmission resources. Moreover downloading and uploading of these images in internet requires high time. Therefore, image compression is very important and reduces the time required for these requirements. This paper gives the review of various algorithm of image compression based on wavelet transform. The performance of various algorithm based on...

BACKGROUND We investigated the possibility of executing DNA-based computation in living cells by engineering Escherichia coli to address a classic mathematical puzzle called the Burnt Pancake Problem (BPP). The BPP is solved by sorting a stack of distinct objects (pancakes) into proper order and orientation using the minimum number of manipulations. Each manipulation reverses the order and orie...

This paper provides an overview and a tutorial of the BPP program, which is a Bayesian MCMC program for analyzing multi-locus genomic sequence data under the multispecies coalescent model. An example dataset of five nuclear loci from the East Asian brown frogs is used to illustrate four different analyses, including estimation of species divergence time and population size parameters under the ...

This paper proposes a visualization tool for analyzing the behavior of metaheuristic algorithms. It works by reproducing graphically the solutions generated in execution time. The tool was evaluated analyzing the Hybrid Grouping Genetic Algorithm for Bin Packing (HGGA_BP). It was used to solve a benchmark with 17 instances of the one dimensional Bin Packing problem (1D-BPP). The use of the visu...

So far we have discussed the case of interactive zero-knowledge proofs. But what if Alice has the resource to send only a single message to Bob? This proof will now become “non-interactive”. But 1-message zero-knowledge is only possible for languages in BPP. This is because any simulator that can simulate the “single” message can use this as a witness for x. But this is pretty useless, at the v...