Permission form synopses to improve parents' understanding of research: a randomized trial.

ObjectiveWe hypothesized that, among parents of potential neonatal research subjects, an accompanying cover sheet added to the permission form (intervention) would increase understanding of the research, when compared to a standard form (control).Study designThis pilot study enrolled parents approached for one of two index studies: one randomized trial and one observational study. A one-page cover sheet described critical study information. Families were randomized 1:1 to receive the cover sheet or not. Objective and subjective understanding and satisfaction were measured.ResultsThirty-two parents completed all measures (17 control, 15 intervention). There were no differences in comprehension score (16.8±5.7 vs 16.3±3.5), subjective understanding (median 6 vs 6.5), or overall satisfaction with consent (median 7 vs 6.5) between control and intervention groups (all P>0.50).ConclusionA simplified permission form cover sheet had no effect on parents' understanding of studies for which their newborns were being recruited

Towards an understanding of hole superconductivity

From the very beginning K. Alex M\"uller emphasized that the materials he and George Bednorz discovered in 1986 were $hole$ superconductors. Here I would like to share with him and others what I believe to be $the$ key reason for why high $T_c$ cuprates as well as all other superconductors are hole superconductors, which I only came to understand a few months ago. This paper is dedicated to Alex M\"uller on the occasion of his 90th birthday.Comment: Dedicated to Alex M\"uller on the Occasion of his 90th Birthday. arXiv admin note: text overlap with arXiv:1703.0977

Computational Complexity of Synchronization under Regular Commutative Constraints

Here we study the computational complexity of the constrained synchronization problem for the class of regular commutative constraint languages. Utilizing a vector representation of regular commutative constraint languages, we give a full classification of the computational complexity of the constraint synchronization problem. Depending on the constraint language, our problem becomes PSPACE-complete, NP-complete or polynomial time solvable. In addition, we derive a polynomial time decision procedure for the complexity of the constraint synchronization problem, given some constraint automaton accepting a commutative language as input.Comment: Published in COCOON 2020 (The 26th International Computing and Combinatorics Conference); 2nd version is update of the published version and 1st version; both contain a minor error, the assumption of maximality in the NP-c and PSPACE-c results (propositions 5 & 6) is missing, and of incomparability of the vectors in main theorem; fixed in this version. See (new) discussion after main theore

A particle swarm optimization based memetic algorithm for dynamic optimization problems

Copyright @ Springer Science + Business Media B.V. 2010.Recently, there has been an increasing concern from the evolutionary computation community on dynamic optimization problems since many real-world optimization problems are dynamic. This paper investigates a particle swarm optimization (PSO) based memetic algorithm that hybridizes PSO with a local search technique for dynamic optimization problems. Within the framework of the proposed algorithm, a local version of PSO with a ring-shape topology structure is used as the global search operator and a fuzzy cognition local search method is proposed as the local search technique. In addition, a self-organized random immigrants scheme is extended into our proposed algorithm in order to further enhance its exploration capacity for new peaks in the search space. Experimental study over the moving peaks benchmark problem shows that the proposed PSO-based memetic algorithm is robust and adaptable in dynamic environments.This work was supported by the National Nature Science Foundation of China (NSFC) under Grant No. 70431003 and Grant No. 70671020, the National Innovation Research Community Science Foundation of China under Grant No. 60521003, the National Support Plan of China under Grant No. 2006BAH02A09 and the Ministry of Education, science, and Technology in Korea through the Second-Phase of Brain Korea 21 Project in 2009, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/01 and the Hong Kong Polytechnic University Research Grants under Grant G-YH60

Linear LL-positive sets and their polar subspaces

In this paper, we define a Banach SNL space to be a Banach space with a certain kind of linear map from it into its dual, and we develop the theory of linear $L$-positive subsets of Banach SNL spaces with Banach SNL dual spaces. We use this theory to give simplified proofs of some recent results of Bauschke, Borwein, Wang and Yao, and also of the classical Brezis-Browder theorem.Comment: 11 pages. Notational changes since version

QCD axion and quintessential axion

The axion solution of the strong CP problem is reviewed together with the other strong CP solutions. We also point out the quintessential axion(quintaxion) whose potential can be extremely flat due to the tiny ratio of the hidden sector quark mass and the intermediate hidden sector scale. The quintaxion candidates are supposed to be the string theory axions, the model independent or the model dependent axions.Comment: 15 pages. Talk presented at Castle Ringberg, June 9-14, 200

Busy Beaver Scores and Alphabet Size

We investigate the Busy Beaver Game introduced by Rado (1962) generalized to non-binary alphabets. Harland (2016) conjectured that activity (number of steps) and productivity (number of non-blank symbols) of candidate machines grow as the alphabet size increases. We prove this conjecture for any alphabet size under the condition that the number of states is sufficiently large. For the measure activity we show that increasing the alphabet size from two to three allows an increase. By a classical construction it is even possible to obtain a two-state machine increasing activity and productivity of any machine if we allow an alphabet size depending on the number of states of the original machine. We also show that an increase of the alphabet by a factor of three admits an increase of activity

The anomalous U(1) global symmetry and flavors from an SU(5) x SU(5)′' GUT in Z12−IZ_{12-I} orbifold compactification

In string compactifications, frequently there appears the anomalous U(1) gauge symmetry which belonged to E8$\times$E8 of the heterotic string. This anomalous U(1) gauge boson obtains mass at the compactification scale, just below $10^{18\,}$GeV, by absorbing one pseudoscalar (corresponding to the model-independent axion) from the second rank anti-symmetric tensor field $B_{MN}$. Below the compactification scale, there results a global symmetry U(1)$_{\rm anom}$ whose charge $Q_{\rm anom}$ is the original gauge U(1) charge. This is the most natural global symmetry, realizing the "invisible" axion. This global symmetry U(1)$_{\rm anom}$ is suitable for a flavor symmetry. In the simplest compactification model with the flipped SU(5) grand unification, we calculate all the low energy parameters in terms of the vacuum expectation values of the standard model singlets.Comment: 18 pages, 4 figur

Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time

Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph can be re-embedded into a straight-line drawable 1-plane embedding of the same graph if and only if it does not contain the configuration. Re-embedding of a 1-plane embedding preserves the same set of pairs of crossing edges. We give a linear-time algorithm for finding a straight-line drawable 1-plane re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). This is an extended abstract. For a full version of this paper, see Hong S-H, Nagamochi H.: Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time, Technical Report TR 2016-002, Department of Applied Mathematics and Physics, Kyoto University (2016

Kerr-Newman Black Hole Thermodynamical State Space: Blockwise Coordinates

A coordinate system that blockwise-simplifies the Kerr-Newman black hole's thermodynamical state space Ruppeiner metric geometry is constructed, with discussion of the limiting cases corresponding to simpler black holes. It is deduced that one of the three conformal Killing vectors of the Reissner-Nordstrom and Kerr cases (whose thermodynamical state space metrics are 2 by 2 and conformally flat) survives generalization to the Kerr-Newman case's 3 by 3 thermodynamical state space metric.Comment: 4 pages incl 2 figs. Accepted by Gen. Rel. Grav. Replaced with Accepted version (minor corrections