using the evaporating method, the solubility of potassium nitrate was determined in various mixtures containing water and ethanol at 25°c. the results show that the solubility of kno3 decreases with increasing the mass percent of ethanol in the mixtures. this trend is along with decreasing the dielectric constant of water+ethanol mixtures. moreover, it can be concluded that the totqal solubilit...

Top-down partitioning has focused on minimum cut or ratio cut objectives, while bottom-up clustering has focused on density-based objectives. In seeking a more uni ed perspective, we propose a new sum of densities measure for multi-way circuit decomposition, where the density of a subhypergraph is the ratio of the number of edges to the number of nodes in the subhypergraph. Finding a k-way part...

Using hashing techniques, this paper develops a family of space-efficient Las Vegas randomized algorithms for k-SUM problems. This family includes an algorithm that can solve 3-SUM in O(n) time and O( √ n) space. It also establishes a new time-space upper bound for SUBSETSUM, which can be solved by a Las Vegas algorithm in O(2 √ 8 9 ) time and O(2) space, for any β ∈ [0, 9 32 ].

Using the QCD sum rules approach and the complete leading–logarithmic short–distance coefficients determining the penguin–amplitude, we obtain B(B → K * γ) = (6.8 ± 2.4) · 10 −5 for top–quark masses in the range (150–200) GeV and |V cb | = 0.035 for τ B = 1.5 ps. The ratio to the inclusive rate is B(B → K * γ)/B(B → X s γ) = (20 ± 6)%. Since some time, the penguin–induced decay b → sγ has recei...

Using the evaporating method, the solubility of potassium Nitrate was determined in various mixtures containing Water and Ethanol at 25°C. The results show that the solubility of KNo3 decreases with increasing the mass percent of Ethanol in the mixtures. This trend is along with decreasing the dielectric constant of Water+Ethanol mixtures. Moreover, it can be concluded that the totqal solubilit...

We consider the EXACT-WEIGHT-H problem of finding a (not necessarily induced) subgraph H of weight 0 in an edge-weighted graph G. We show that for every H , the complexity of this problem is strongly related to that of the infamous k-SUM problem. In particular, we show that under the k-SUM Conjecture, we can achieve tight upper and lower bounds for the EXACT-WEIGHT-H problem for various subgrap...

Given a set of n real numbers, the 3SUM problem is to decide whether there are three of them that sum to zero. Until a recent breakthrough by Grønlund and Pettie [FOCS’14], a simple Θ(n2)-time deterministic algorithm for this problem was conjectured to be optimal. Over the years many algorithmic problems have been shown to be reducible from the 3SUM problem or its variants, including the more g...

Universal One-Way Hash Functions (UOWHFs) may be used in place of collision-resistant functions in many public-key cryptographic applications. At Asiacrypt 2004, Hong, Preneel and Lee introduced the stronger security notion of higher order UOWHFs to allow construction of long-input UOWHFs using the Merkle-Damg̊ard domain extender. However, they did not provide any provably secure constructions f...