In this paper we investigate the effects of a quantum algorithm which increases amplitude states corresponding to solutions partition problem by factor almost two. The study is limited one iteration.

We study a temperature-aware scheduling problem aiming in maximizing the throughput of a set of unit-length jobs, each one having its own heat contribution, on a single processor operating under a strict temperature threshold. Following a simplified model for the processor’s thermal behavior, proposed by Chrobak et al. [9], we analyze the approximation factor of the natural CoolestFirst schedul...

A tree-partition of a graph G is a proper partition of its vertex set into ‘bags’, such that identifying the vertices in each bag produces a forest. The tree-partition-width of G is the minimum number of vertices in a bag in a tree-partition of G. An anonymous referee of the paper by Ding and Oporowski [J. Graph Theory, 1995] proved that every graph with tree-width k ≥ 3 and maximum degree ∆ ≥ ...

Graph computation system performance is generally affected by the quality of graph partition. The balance factor and small edge cut ratio is used to measure the quality of graph partition. A balance graph partition with small edge cut ratio is generally preferred since it cut down the expensive network communication cost. Even so, according to the study of the Giraph, the execution over well pa...

The distribution behavior of ofloxacin enantiomers was examined in the aqueous and organic solvent of a two-phase system containing chiral selector L-tartarate. The effect of extraction equilibrium time, buffer pH, organic solvents and length of alkyl chain of L-tartarate on the partition coefficients and enantioselectivity of racemic ofloxacin were investigated, respectively. The L-tartara...

For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...

An instance of the asymmetric matrix partition problem consists of a matrix A ∈ Rn×m + and a probability distribution p over its columns. The goal is to find a partition scheme that maximizes the resulting partition value. A partition scheme S = {S1, . . . ,Sn} consists of a partition Si of [m] for each row i of the matrix. The partition Si can be interpreted as a smoothing operator on row i, w...

In this paper, we present some preliminary studies on reducing the emittance of the Hefei light source II (HLS-II) storage ring by redistributing the synchrotron damping partition factor using a Robinson wiggler. The studies demonstrate that it is possible to reduce the emittance by 50% using a 2-meter long wiggler on a rematched lattice. This encouraging result suggests a feasible option to si...