In this work, the $\ensuremath{\gamma}Z$-exchange contributions in low-energy elastic parity-violating $ep$ scattering are discussed with approximation ${m}_{e}=0$. By expanding $\ensuremath{\gamma}pp$ and $Zpp$ interactions on momentum of photon considering both leading-order next-to-leading order interactions, we calculate amplitudes diagrams. After performing loop integral, expand results lo...

A medical cross-sectional examination of a copper smelter work force was undertaken after environmental contamination with lead, cadmium and arsenic had been documented. A total of 920 subjects was examined, including active smelter employees, retired workers and copper mine employees who had never worked in the smelter. Slight to moderate absorption of lead and cadmium was definitely present i...

We present a uniform approach to investigate the relationship between the existence of complete sets for promise classes and the existence of (p-)optimal proof systems for certain languages. Central to our approach is the notion of a test set which can be used to verify that a given nondeterministic polynomial-time machine obeys the promise on a given input. Basically, we show that a promise cl...

We consider the design of approximation algorithms for multicolor generalization of the well known hypergraph 2-coloring problem (property B). Consider a hypergraph H with n vertices, s edges, maximum edge degree D(≤ s) and maximum vertex degree d(≤ s). We study the problem of coloring the vertices of H with minimum number of colors such that no hyperedge i contains more than bi vertices of any...

We study clustering over multiple graphs each encoding a distinct set of similarity relationships (edges) over the same set of objects (nodes) where the aim is to identify clusters that are supported across the collection of graphs. This problem of simultaneous clustering is readily motivated by the recent deluge of datasets in several domains (including the biological sciences, social sciences...

We study two properties of a complexity class Cwhether there exists a truth-table hard p-selective language for C, and whether polynomially-many nonadaptive queries to C can be answered by making O(log n)-many adaptive queries to C (in symbols, is PF C tt PF C O(log n)]). We show that if there exists a NP-hard p-selective set under truth-table reductions, then PF NP tt PF NP O(log n)]. As a con...

Myerson's seminal work provides a computationally efficient revenue-optimal auction for selling one item to multiple bidders. Generalizing this work to selling multiple items at once has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item settings cann...

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a1, b1]× [a2, b2]× · · · × [ak, bk]. The boxicity of G, box(G) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes, i.e. each vertex is mapped to a k-dimensional box and two vertices are adjacent...