Minisum collection depots location problem with multiple facilities on a network

We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported.     

Unique satisfiability of Horn sets can be solved in nearly linear time

If a Horn set I has a single satisfying truth assignment or model then that model is said to be unique for I. The question of determining whether a unique model exists for a given Horn set I is shown to be solved in O((L)*L) time, where L is the sum of the lengths of the clauses in I and is the inverse Ackermann function. It is also shown that if LA*log (A) where A is the number of distinct proposition letters then unique satisfiability can be determined in O(L) time.     

Location of terror response facilities: A game between state and terrorist

We study a leader follower game with two players: a terrorist and a state where the later one installs facilities that provide support in case of a terrorist attack. While the Terrorist attacks one of the metropolitan areas to maximize his utility, the State, which acts as a leader, installs the facilities such that the metropolitan area attacked is the one that minimizes her disutility (i.e., minimizes ‘loss’). We solve the problem efficiently for one facility and we formulate it as a mathematical programming problem for a general number of facilities. We demonstrate the problem via a case study of the 20 largest metropolitan areas in the United States.     

Sparse pseudorandom distributions

The existence of sparse pseudorandom distributions is proved. These are probability distributions concentrated in a very small set of strings, yet it is infeasible for any polynomial-time algorithm to distinguish between truly random coins and coins selected according to these distributions. It is shown that such distributions can be generated by (nonpolynomial) probabilistic algorithms, while probabilistic polynomial-time algorithms cannot even approximate all the pseudorandom distributions. Moreover, we show the existence of evasive pseudorandom distributions which are not only sparse, but also have the property that no polynomial-time algorithm may find an element in their support, except for a negligible probability. All these results are proved independently of any intractability assumption.     

Large number hypothesis

Dirac's large number hypothesis (LNH) and the Whitrow-Randall-Sciama relation are related to some cosmological models. The LNH and Whitrow-Randall-Sciama relations are neither equivalent nor consistent in general relativity, but they may both be valid in the Brans-Dicke theory and in another theory considered in this paper.     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.     

A special anisotropic model of the universe (II)

By means of exponential laws we show a Bianchi Type I model of the universe where we define overall deceleration and Hubble's parameters that have constant values. We employ a convenient relation for defining the radius of the universe. Pressure and density have constant values, too.     

Rapid liquid chromatography-ultraviolet determination of organic acids and phenolic compounds in red wine and must

A reversed-phase liquid chromatography-ultraviolet (LC-UV) method is proposed for the rapid simultaneous analysis of the main carboxylic acids and polyphenols in must and wine. Good resolution was obtained for citric, tartaric, malic, lactic, acetic, caffeic, ellagic and gallic acids, (-)-epicatechin, quercetin and resveratrol. A novel silica-based column containing ether-linked phenyl groups, with polar end-capping and suitable for low-pH aqueous mobile phases was used and found to be superior to others tested. The method employed a mixture of 0.2% TFA in water and acetonitrile as eluents, showed linearity and precision, and was applied to samples of must and wine.