Random Costs in Combinatorial Optimization

The random cost problem is the problem of finding the minimum in an exponentially long list of random numbers. By definition, this problem cannot be solved faster than by exhaustive search. It is shown that a classical NP-hard optimization problem, number partitioning, is essentially equivalent to the random cost problem. This explains the bad performance of heuristic approaches to the number partitioning problem and allows us to calculate the probability distributions of the optimum and sub-optimum costs.Comment: 4 pages, Revtex, 2 figures (eps), submitted to PR

S-antigen and rod-opsin immunoreactions in midline brain neoplasms of transgenic mice: Similarities to pineal cell tumors and certain medulloblastomas in man.

Transgenic mice expressing the large T-antigen of the simian virus 40 (SV 40) under the control of 1) the enhancer of Moloney murine sarcoma virus (MSV) and 2) the SV 40 promoter develop undifferentiated neuroectodermal tumors located in the midline of the dorsal brain surface, abnormalities in lens fiber differentiation and retinal dysplasia. In this study the brain neoplasms of six adult animals and the brain of one 11-day old mouse were examined by conventional histology and immunocytochemical demonstration of S-antigen, rod-opsin, neuron-specific enolase, neurofilaments (160 and 200 kDa) and glial fibrillary acidic protein. According to histologic criteria the neoplasms were characterized as "primitive" neuroectodermal tumors composed mainly of small cells with scanty and ill-defined cytoplasm. Neoplastic cells displaying immunoreactive S-antigen were found in five brain tumors; three of these tumors also contained a limited number of rod-opsin immunoreactive neoplastic cells. Some tumor cells had neurite-like processes containing immunoreactive neurofilament (200 kDa). No pathologic lesions were found in the brain of the 11-day old animal. Tumors in transgenic mice may resemble pineal cell tumors and a special subtype of medulloblastoma in man. These neoplasms contain S-antigen immunoreactive and also rod-opsin immunoreactive tumors cells in certain cases. The findings suggest that transgenic mice expressing the large T-antigen of SV 40 may become a valuable animal model for analysing the origin, histogenesis and development of primitive neuroectodermal tumors with photoreceptor-like features (pineal cell tumors and certain medulloblastomas)

Potential of Mycobacterium tuberculosis resuscitation-promoting factors as antigens in novel tuberculosis sub-unit vaccines

n/

Treatment of severe alcoholic hepatitis: A systematic review

Severe alcoholic hepatitis is the most severe form of alcohol-related liver disease. Corticosteroids remain the first choice of treatment. However, they are only effective in a subset of patients and are associated with an increased infection risk. Furthermore, nonresponders to corticosteroids have a poor prognosis with a mortality of 70% over 6 months. As such, there is a high need for a more personalized use of corticosteroids and the development and identification of alternative therapeutic strategies. In this review, we summarize the recent and ongoing randomized controlled trials concerning the treatment of severe alcoholic hepatitis

Number Partitioning on a Quantum Computer

We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.Comment: 5 pages, 1 figure, see also http://rugth30.phys.rug.nl/compphys/qce.ht

Search for More Declarativity

Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed search methods with their well-known deficiencies are prone to compromise declarativity, the primary concern of rule languages. The paper presents a new family of uninformed search algorithms that combine the advantages of the traditional ones while avoiding their shortcomings. Moreover, the paper introduces a formal framework based on partial orderings, which allows precise and elegant analysis of such algorithms