Abstract. For any non-trivial abelian group A under addition a graph G is said to be A-magic if there exists a labeling f : E(G) → A − {0} such that, the vertex labeling f defined as f(v) = ∑ f(uv) taken over all edges uv incident at v is a constant. An A-magic graph G is said to be Zk-magic graph if the group A is Zk, the group of integers modulo k and these graphs are referred as k-magic grap...

for (Z',Xk') $ (Zk , Xk"), A , Zk < 1 (lb). For every point (Z1,Z20), ZK0 = hKk(ZkoXko) ZkAol < 1, and for every sufficiently small neighborhood U of this point, there exists o> 0 such that the set of points of b3 which belong to U consists only of points (1) for which Zk-Zkol < a and XXkol < a hold, (lc). For a fixed k and Xk, the corresponding set of points (1) is called a lamina of ek3 and i...

BACKGROUND AND AIMS Current systemic therapies for neuroendocrine tumours (NETs) do not provide sufficient control of tumour growth. However, efficient evaluation of novel drugs is hindered by the lack of a suitable preclinical animal model. Here an orthotopic mouse model of pancreatic NET is established and used to study the action of ZK 304709, a first in class, oral multitarget tumour growth...

Canetti et al. [7] recently proposed a new framework — termed Generalized Universal Composability (GUC) — for properly analyzing concurrent execution of cryptographic protocols in the presence of a global setup, and constructed the first known GUC-secure implementations of commitment (GUCC) and zero-knowledge (GUC ZK), which suffice to implement any two-party or multi-party functionality under ...

In this paper we consider the problem of whether there exist non-trivial constant-round public-coin zero-knowledge (ZK) proofs. We focus on the type of ZK proofs that admit a universal simulator (which handles all malicious verifiers), and show a connection between the existence of such proof systems and a seemingly unrelated “program understanding” problem: for a natural class of constant-roun...

Newton’s iteration has quadratic convergence for simple roots. We present a Newton-based iteration scheme with quadratic convergence for multiple roots of systems of analytic functions. This is a report on work in progress. 1. Newton Iteration, Approximate Roots and γ-Theorems 1.1. Newton Iteration. Let f : Cn → Cn be an analytic function. Newton’s method for solving f = 0 consists in approxima...

For the functional A[ f ] = ∑k=1 ak f (zk) , we give necessary and sufficient conditions over the real numbers zk , such that, the inequality A[ f ] 0 , holds for some classes of convex functions. Then, we deduce an inequality related to Alzer’s inequality and a weighted majorization inequality.

PTK787/ZK 222584 (1-[4-chloroanilino]-4-[4-pyridylmethyl] phthalazine succinate) is a potent inhibitor of vascular endothelial growth factor (VEGF) receptor tyrosine kinases, active in the submicromolar range. It also inhibits other class III kinases, such as the platelet-derived growth factor (PDGF) receptor beta tyrosine kinase, c-Kit, and c-Fms, but at higher concentrations. It is not active...

In this paper, we give an algebra-combinatorics formula of the Möbius transform for an abstract simplicial complex K on [m] = {1, ...,m} in terms of the Betti numbers of the Stanley-Reisner face ring of K. Furthermore, we employ a way of compressing K to estimate the lower bound of the sum of those Betti numbers by using this formula. As an application, associating with the moment-angle complex...