Non-linear Q-clouds around Kerr black holes

Q-balls are regular extended `objects' that exist for some non-gravitating, self-interacting, scalar field theories with a global, continuous, internal symmetry, on Minkowski spacetime. Here, analogous objects are also shown to exist around rotating (Kerr) black holes, as non-linear bound states of a test scalar field. We dub such configurations Q-clouds. We focus on a complex massive scalar field with quartic plus hexic self-interactions. Without the self-interactions, linear clouds have been shown to exist, in synchronous rotation with the black hole horizon, along 1-dimensional subspaces - existence lines - of the Kerr 2-dimensional parameter space. They are zero modes of the superradiant instability. Non-linear Q-clouds, on the other hand, are also in synchronous rotation with the black hole horizon; but they exist on a 2-dimensional subspace, delimited by a minimal horizon angular velocity and by an appropriate existence line, wherein the non-linear terms become irrelevant and the Q-cloud reduces to a linear cloud. Thus, Q-clouds provide an example of scalar bound states around Kerr black holes which, generically, are not zero modes of the superradiant instability. We describe some physical properties of Q-clouds, whose backreaction leads to a new family of hairy black holes, continuously connected to the Kerr family.Comment: 11 pages, 4 figure

Preference Learning for Move Prediction and Evaluation Function Approximation in Othello

This paper investigates the use of preference learning as an approach to move prediction and evaluation function approximation, using the game of Othello as a test domain. Using the same sets of features, we compare our approach with least squares temporal difference learning, direct classification, and with the Bradley-Terry model, fitted using minorization-maximization (MM). The results show that the exact way in which preference learning is applied is critical to achieving high performance. Best results were obtained using a combination of board inversion and pair-wise preference learning. This combination significantly outperformed the others under test, both in terms of move prediction accuracy, and in the level of play achieved when using the learned evaluation function as a move selector during game play

Hybridizing Constraint Programming and Monte-Carlo Tree Search: Application to the Job Shop problem

International audienceConstraint Programming (CP) solvers classically explore the solution space using tree search-based heuristics. Monte-Carlo Tree-Search (MCTS), a tree-search based method aimed at sequential decision making under uncertainty, simultaneously estimates the reward associated to the sub-trees, and gradually biases the exploration toward the most promising regions. This paper examines the tight combination of MCTS and CP on the job shop problem (JSP). The contribution is twofold. Firstly, a reward function compliant with the CP setting is proposed. Secondly, a biased MCTS node-selection rule based on this reward is proposed, that is suitable in a multiple-restarts context. Its integration within the Gecode constraint solver is shown to compete with JSP-specific CP approaches on difficult JSP instances

Ensemble Learning Using Individual Neonatal Data for Seizure Detection

Objective: Sharing medical data between institutions is difficult in practice due to data protection laws and official procedures within institutions. Therefore, most existing algorithms are trained on relatively small electroencephalogram (EEG) data sets which is likely to be detrimental to prediction accuracy. In this work, we simulate a case when the data can not be shared by splitting the publicly available data set into disjoint sets representing data in individual institutions. Methods and procedures: We propose to train a (local) detector in each institution and aggregate their individual predictions into one final prediction. Four aggregation schemes are compared, namely, the majority vote, the mean, the weighted mean and the Dawid-Skene method. The method was validated on an independent data set using only a subset of EEG channels. Results: The ensemble reaches accuracy comparable to a single detector trained on all the data when sufficient amount of data is available in each institution. Conclusion: The weighted mean aggregation scheme showed best performance, it was only marginally outperformed by the Dawid-Skene method when local detectors approach performance of a single detector trained on all available data. Clinical impact: Ensemble learning allows training of reliable algorithms for neonatal EEG analysis without a need to share the potentially sensitive EEG data between institutions.Peer reviewe

Parameter estimation of the kinetic α-Pinene isomerization model using the MCSfilter algorithm

This paper aims to illustrate the application of a derivative-free multistart algorithm with coordinate search filter, designated as the MCSFilter algorithm. The problem used in this study is the parameter estimation problem of the kinetic α -pinene isomerization model. This is a well known nonlinear optimization problem (NLP) that has been investigated as a case study for performance testing of most derivative based methods proposed in the literature. Since the MCSFilter algorithm features a stochastic component, it was run ten times to solve the NLP problem. The optimization problem was successfully solved in all the runs and the optimal solution demonstrates that the MCSFilter provides a good quality solution.(undefined)info:eu-repo/semantics/publishedVersio

Feasibility and dominance rules in the electromagnetism-like algorithm for constrained global optimization

This paper presents the use of a constraint-handling technique, known as feasibility and dominance rules, in a electromagnetismlike (ELM) mechanism for solving constrained global optimization problems. Since the original ELM algorithm is specifically designed for solving bound constrained problems, only the inequality and equality constraints violation together with the objective function value are used to select points and to progress towards feasibility and optimality. Numerical experiments are presented, including a comparison with other methods recently reported in the literature

Polymers of Intrinsic Microporosity derived from a carbocyclic analogue of Tröger's base

Tröger's base (TB) is often used as a building block for the synthesis of Polymers of Intrinsic Microporosity (PIMs) due to its rigid bicyclic V-shaped structure. In this study the TB component in the structure of a PIM is replaced by 2,3:6,7-dibenzobicyclo[3.3.1]nonane, a purely carbocyclic analogue of TB. This modification results in only a slightly reduced amount of microporosity as determined using nitrogen adsorption. Further comparisons with previously reported PIMs indicate that this building unit (and therefore TB) is significantly less effective for the generation of intrinsic microporosity than spirobisindane, a commonly used structural unit for PIM synthesis. It appears that the V-shape of the 2,3:6,7-dibenzobicyclo[3.3.1]nonane and TB units allows closer contact between polymer chains thereby enhancing packing efficiency