Compact relaxations for polynomial programming problems

Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer) quadratic programming problems subject to systems of linear equality constraints. We present an extension to the general case of polynomial programming problems and discuss the derived convex relaxation. We then show how to perform rRLT constraint generation so as to reduce the number of inequality constraints in the relaxation, thereby making it more compact and faster to solve. We present some computational results validating our approach

On the composition of convex envelopes for quadrilinear terms

International audienceWithin the framework of the spatial Branch-and-Bound algorithm for solving Mixed-Integer Nonlinear Programs, different convex relaxations can be obtained for multilinear terms by applying associativity in different ways. The two groupings ((x1x2)x3)x4 and (x1x2x3)x4 of a quadrilinear term, for example, give rise to two different convex relaxations. In [6] we prove that having fewer groupings of longer terms yields tighter convex relaxations. In this paper we give an alternative proof of the same fact and perform a computational study to assess the impact of the tightened convex relaxation in a spatial Branch-and-Bound setting

Ageing test of the ATLAS RPCs at X5-GIF

An ageing test of three ATLAS production RPC stations is in course at X5-GIF, the CERN irradiation facility. The chamber efficiencies are monitored using cosmic rays triggered by a scintillator hodoscope. Higher statistics measurements are made when the X5 muon beam is available. We report here the measurements of the efficiency versus operating voltage at different source intensities, up to a maximum counting rate of about 700Hz/cm^2. We describe the performance of the chambers during the test up to an overall ageing of 4 ATLAS equivalent years corresponding to an integrated charge of 0.12C/cm^2, including a safety factor of 5.Comment: 4 pages. Presented at the VII Workshop on Resistive Plate Chambers and Related Detectors; Clermont-Ferrand October 20th-22nd, 200

The secret santa problem.

Consider a digraph where the vertices represent people and an arc (i, j) represents the possibility of i giving a gift to j. The basic question we pose is whether there is an anonymity-preserving “gift assignment” such that each person makes and receives exactly one gift, and such that no person i can infer the remaining gift assignments from the fact that i is assigned to give a gift to j. We formalize this problem as a graph property involving vertex disjoint circuit covers, give a polynomial algorithm to decide this property for any given graph and provide a computational validation of the algorithm

Wax: A benign hydrogen-storage material that rapidly releases H2-rich gases through microwave-assisted catalytic decomposition

Hydrogen is often described as the fuel of the future, especially for application in hydrogen powered fuel-cell vehicles (HFCV’s). However, its widespread implementation in this role has been thwarted by the lack of a lightweight, safe, on-board hydrogen storage material. Here we show that benign, readily-available hydrocarbon wax is capable of rapidly releasing large amounts of hydrogen through microwave-assisted catalytic decomposition. This discovery offers a new material and system for safe and efficient hydrogen storage and could facilitate its application in a HFCV. Importantly, hydrogen storage materials made of wax can be manufactured through completely sustainable processes utilizing biomass or other renewable feedstocks

High Altitude test of RPCs for the ARGO-YBJ experiment

A 50 m**2 RPC carpet was operated at the YangBaJing Cosmic Ray Laboratory (Tibet) located 4300 m a.s.l. The performance of RPCs in detecting Extensive Air Showers was studied. Efficiency and time resolution measurements at the pressure and temperature conditions typical of high mountain laboratories, are reported.Comment: 16 pages, 10 figures, submitted to Nucl. Instr. Met

Combinatorial optimization based recommender systems.

Recommender systems exploit a set of established user preferences to predict topics or products that a new user might like [2]. Recommender systems have become an important research area in the field of information retrieval. Many approaches have been developed in recent years and the interest is very high. However, despite all the efforts, recommender systems are still in need of further development and more advanced recommendation modelling methods, as these systems must take into account additional requirements on user preferences, such as geographic search and social networking. This fact, in particular, implies that the recommendation must be much more “personalized” than it used to be. In this paper, we describe the recommender system used in the “DisMoiOu”(“TellMeWhere” in French) on-line service (http://dismoiou.fr), which provides the user with advice on places that may be of interest to him/her; the definition of “interest” in this context is personalized taking into account the geographical position of the user (for example when the service is used with portable phones such as the Apple iPhone), his/her past ratings, and the ratings of his/her neighbourhood in a known social network. Using the accepted terminology [6], DisMoiOu is mainly a Collaborative Filtering System (CFS): it employs opinions collected from similar users to suggest likely places. By contrast with existing recommender systems, ours puts together the use of a graph theoretical model [4] and that of combinatorial optimization methods [1]. Broadly speaking, we encode known relations between users and places and users and other users by means of weighted graphs. We then define essential components of the system by means of combinatorial optimization problems on a reformulation of these graphs, which are finally used to derive a ranking on the recommendations associated to pairs (user,place). Preliminary computational results on the three classical evaluation parameters for recommender systems (accuracy, recall, precision [3]) show that our system performs well with respect to accuracy and recall, but precision results need to be improved

Structured frameworks to increase the transparency of the assessment of benefits and risks of medicines: current status and possible future directions

Structured frameworks for benefit-risk analysis in drug licensing decisions are being implemented across a number of regulatory agencies worldwide. The aim of these frameworks is to aid the analysis and communication of the benefit-risk assessment throughout the development, evaluation, and supervision of medicines. In this review, authors from regulatory agencies, pharmaceutical companies, and academia share their views on the different frameworks and discuss future directions

Mean Interplanetary Magnetic Field Measurement Using the ARGO-YBJ Experiment

The sun blocks cosmic ray particles from outside the solar system, forming a detectable shadow in the sky map of cosmic rays detected by the ARGO-YBJ experiment in Tibet. Because the cosmic ray particles are positive charged, the magnetic field between the sun and the earth deflects them from straight trajectories and results in a shift of the shadow from the true location of the sun. Here we show that the shift measures the intensity of the field which is transported by the solar wind from the sun to the earth.Comment: 6 papges,3 figure