Restricted Version Research Articles

Hard QBFs for Merge Resolution

We prove the first genuine quantified Boolean formula (QBF) proof size lower bounds for the proof system Merge Resolution (MRes), a refutational proof system for prenex QBFs with a CNF matrix. Unlike most QBF resolution systems in the literature, proofs in MRes consist of resolution steps together with information on countermodels, which are syntactically stored in the proofs as merge maps. This makes MRes quite powerful: it has strategy extraction by design and allows short proofs for formulas that are hard for classical QBF resolution systems. Here, we show the first genuine QBF exponential lower bounds for MRes , thereby uncovering limitations of MRes. Technically, the results are either transferred from bounds from circuit complexity (for restricted versions of MRes) or directly obtained by combinatorial arguments (for full MRes). Our results imply that the MRes approach is largely orthogonal to other QBF resolution models such as the QCDCL resolution systems QRes and QURes and the expansion systems ∀ Exp + Res and IR.

Methodological Naturalism, Analyzed

AbstractI present and evaluate three interpretations of methodological naturalism (MN), the principle that scientific explanations may only appeal to natural phenomena: as an essential feature of science, as a provisional guideline grounded in the historical failure of supernatural hypotheses, and as a synthesis of these two approaches. In doing so, I provide both a synoptic overview of current scholarship on MN, as well a contribution to that discussion by arguing in favor of a restricted version of MN, placing it on a firmer theoretical foundation than that supplied by previous studies, and replying to recent objections.

The quantum focusing conjecture and the improved energy condition

By rearranging its terms, the Quantum Focusing Conjecture (QFC) can be viewed as a quantum energy condition, and we can consider various limits. A recent restricted version is a limiting form where the quantum focusing vanishes Θ → 0, and has been proven for Braneworld scenario. As a result, we derive an improved quantum null energy condition (INEC) Tkk≥ħ2πASout′′−12θSout′\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ {T}_{kk}\\ge \\frac{\\mathrm{\\hbar}}{2\\pi \\mathcal{A}}\\left({S}_{\ extrm{out}}^{\\prime \\prime }-\\frac{1}{2}\ heta {S}_{\ extrm{out}}^{\\prime}\\right) $$\\end{document}, that can be proven with field theory techniques. We sketch the beginning of a proof, and briefly discuss possible interpretations in the absence of one.

Weighted, Circular and Semi-Algebraic Proofs

In recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find a balance between the power of the proof system (the size of the proofs required to refute a formula) and the difficulty of finding the proofs. In this paper we consider the proof systems circular Resolution, Sherali-Adams, Nullstellensatz and Weighted Resolution and we study their relative power from a theoretical perspective. We prove that circular Resolution, Sherali-Adams and Weighted Resolution are polynomially equivalent proof systems. We also prove that Nullstellensatz is polynomially equivalent to a restricted version of Weighted Resolution. The equivalences carry on also for versions of the systems where the coefficients/weights are expressed in unary. The practical interest in these systems comes from the fact that they admit efficient algorithms to find proofs in case these have small width/degree.

Better stoma care using the Stoma App: does it help? A first randomized double-blind clinical trial on the effect of mobile healthcare on quality of life in stoma patients

BackgroundReceiving a stoma significantly impacts patients’ quality of life. Coping with this new situation can be difficult, which may result in a variety of physical and psychosocial problems. It is essential to provide adequate guidance to help patients cope with their stoma, as this positively influences self-efficacy in return. Higher self-efficacy reduces psychosocial problems increasing patient’s quality of life. This study investigates whether a new mobile application, the Stoma App, improves quality of life. And if personalized guidance, timed support, and peer contact offered as an in-app surplus makes a difference.MethodsA double-blind, randomized controlled trial was conducted between March 2021 and April 2023. Patients aged > 18 years undergoing ileostomy or colostomy surgery, in possession of a compatible smartphone were included. The intervention group received the full version of the app containing personalized and time guidance, peer support, and generic (non-personalized) stoma-related information. The control group received a restricted version with only generic information. Primary outcome was stoma quality of life. Secondary outcomes included psychological adaption, complications, re-admittance, reoperations, and length of hospital stay.ResultsThe intervention version of the app was used by 96 patients and the control version by 112 patients. After correction for confounding, the intervention group reported a significant 3.1-point improvement in stoma-related quality of life one month postoperatively (p = 0.038). On secondary outcomes, no significant improvements could be retrieved of the intervention group.ConclusionThe Stoma App improves the quality of life of stoma patients. Peer support and personalized guidance are of significant importance in building self-efficacy. It is to be recommended to implement Stoma app—freely available software qualifying as a medical device—in standard stoma care pathways for the benefits of both patients and healthcare providers.

Tight GNSS/INS integration

GNSS/INS tight integration algorithm has been studied in this paper. The main idea is to get the user’s position by considering the solution of a restricted version of the GNSS optimization problem, in which the classical tripartite is limited to INS measurements. It leads to a linearly bounded least squares problem, which may be solved in the worst case in polynomial time. The efficiency of the algorithm is confirmed by simulations in complex scenarios (multipath and weak signal conditions) and shows improved performance compared to autonomous GNSS AND GNSS/INS Kalman in the same conditions.

The Implicative Conditional

This paper investigates the implicative conditional, a connective intended to describe the logical behavior of an empirically defined class of natural language conditionals, also named implicative conditionals, which excludes concessive and some other conditionals. The implicative conditional strengthens the strict conditional with the possibility of the antecedent and of the contradictory of the consequent. p⇒q\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${p\\Rightarrow q}$$\\end{document} is thus defined as ¬◊(p∧¬q)∧◊p∧◊¬q\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\lnot } \\Diamond {(p \\wedge \\lnot q) \\wedge } \\Diamond {p \\wedge } \\Diamond {\\lnot q}$$\\end{document}. We explore the logical properties of this conditional in a reflexive normal Kripke semantics, provide an axiomatic system and prove it to be sound and complete for our semantics. The implicative conditional validates transitivity and contraposition, which we take to be integral parts of reasoning and communication. But it only validates restricted versions of strengthening the antecedent, right weakening, simplification, and rational monotonicity. Apparent counterexamples to some of these properties are explained as due to contextual factors. Finally, the implicative conditional avoids the paradoxes of material and strict implication, and validates some connexive principles such as Aristotle’s theses and weak Boethius’ thesis, as well as some highly entrenched principles of conditionals, such as conjunction of consequents, disjunction of antecedents, modus ponens, cautious monotonicity and cut.

A General Iterative Procedure for Solving Nonsmooth Constrained Generalized Equations

In this paper, we concentrate on an abstract iterative procedure for solving nonsmooth constrained generalized equations. This procedure employs both the property of weak point-based approximation and the approach of searching for a feasible inexact projection on the constrained set. Utilizing the contraction mapping principle, we establish higher order local convergence of the proposed method under the assumption of metric regularity property which ensures that the iterative procedure generates a sequence converging to a solution of the constrained generalized equation. Under strong metric regularity assumptions, we obtain that each sequence generated by this procedure converges to a solution. Furthermore, a restricted version of the proposed method is considered, for which we establish the desired convergence for each iterative sequence without a strong metric subregularity condition. The obtained results are new even for generalized equations without a constraint set.

A baby–Skyrme model with anisotropic DM interaction: Compact skyrmions revisited

We consider a baby–Skyrme model with Dzyaloshinskii–Moriya interaction (DMI) and two types of potential terms. The model has a close connection with the vacuum functional of fermions coupled with O(3) nonlinear n-fields and with a constant SU(2) gauge background. The energy functional is derived from the heat-kernel expansion for the fermion determinant. The model possesses normal skyrmions with topological charge Q=1. The restricted version of the model also includes both the weak-compacton case (at the boundary, not continuously differentiable) and genuine-compacton case (continuously differentiable). The model consists of only the Skyrme term, and the DMI provides soliton solutions that are known as skyrmions without any potential. The BPS equation in the supersymmetric soliton models implies that the impurity coupling is closely related to the DMI. Therefore, the effect of an exponentially localized DMI is also studied in the present model.

Existence as a web of problem-solving systems

PurposeProblem-solving, systems thinking and design thinking are disciplines practiced by all human beings and is also innate in other living objects with limited use of symbolic structures. They are necessary to achieve the goals and survive. Interpretation of problem-solving as a change in equilibrium makes it applicable throughout the inanimate world. The aim is to describe the proposed empirical systems theory that integrates problem-solving and systems thinking through design thinking.Design/methodology/approachA brief historical background describes why comprehensive empirical systems theory has not been attempted before except as a restricted version in engineering systems. The methodology of the general theory follows that of conventional science, but with systemic content. Interference by required mental or physical product/systems changes states which is subject to discussion, creativity, innovation and inspiration accomplished by iteration as necessary.FindingsA problem-solving structure has been created, which is implemented in a methodical way to aid the innate ability of individuals and organisations, and is open to modifications and the use of quantitative methods. Processed natural language allows for implementation at the operational level.Originality/valueThe proposed systems theory is an empirical theory that uses the structural properties of parts of the world. The integration makes “systems” the driver of change of state and offers fundamental concepts. The implementation shown in Figure 2 is methodical and can be applied by individuals and organisations subject to peer review and development. The method clarifies the roles of product/artifact and systems designers.

Real-time, constant-space, constant-randomness verifiers

We study the class of languages that have membership proofs which can be verified by real-time finite-state machines using only a constant number of random bits, regardless of the size of their inputs. Since any further restriction on the verifiers would preclude the verification of nonregular languages, this is the tightest computational budget which allows the checking of externally provided proofs to have meaningful use. We provide a full characterization of this class of languages in terms of a restricted version of the one-way nondeterministic multihead finite automaton model. For any k>0, there exist languages that cannot be recognized by any k-head one-way nondeterministic finite automaton, but that are nonetheless real-time verifiable in this sense. The set of nonpalindromes, which cannot be recognized by any one-way multihead deterministic finite automaton, is also demonstrated to be verifiable within these restrictions.

A personalized app to improve quality of life of patients with a stoma: A protocol for a multicentre randomized controlled trial.

Proper education, guidance and support is crucial before and following creation of a stoma. Patients with a stoma and their close relatives need to adapt to and cope with this new - and sometimes unforeseen - situation, which may result in insecurities and a variety of psychosocial problems. Self-efficacy is associated both with a reduction in psychosocial problems and with improved quality of life. The main objective of this study was to investigate whether self-reported quality of life of patients with a stoma can be enhanced by offering personalized and timed guidance, as well as peer contact, in a patient-centred mobile application. A multicentre, double-blind, randomized controlled trial will be conducted. Consented adults >18 years of age who will receive an ileostomy or colostomy and possess an eligible smartphone will be included. The intervention group will be given the full version of the application (containing personalized and timed guidance, such as operation-specific information and information on the associated care pathway) to install on their smartphone. In addition, the intervention group has access to a protected peer-support platform within the app. The control group will receive a restricted version of the application that contains only generic (non-personalized) stoma-related information. The primary outcome is quality of life, 3 months postoperatively. Secondary outcomes are Patient Reported Outcome Measures (PROMs), such as psychological adaption, as well as number of complications, re-admission and re-operation rates and the length of hospital stay. Patient enrolment began in March 2021. Data collection was not complete when this protocol was submitted. We hypothesize that patients with a stoma who are supported by the intervention version of the app will report a significantly higher quality of life than patients with a stoma who are supported by the control version of the app (ie, are not offered personalized and timed guidance and information and do not have access to peer support in the app).

A parametrized axiomatization for a large number of restricted second-order logics

Abstract By limiting the range of the predicate variables in a second-order language, one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note, we provide an infinitary strongly complete axiomatization for several systems of this kind having the range of the predicate variables as a parameter. The completeness argument uses simple techniques from the theory of Boolean algebras. This article is dedicated to our friend John N. Crossley on the occasion of his 86th birthday.

Comparative analysis of mathematical formulations for the two‐dimensional guillotine cutting problem

AbstractAbout 15 years ago, a paper proposed the first integer linear programming formulation for the constrained two‐dimensional guillotine cutting problem (with unlimited cutting stages). Since then, eight other formulations followed, seven of them in the last four years. This spike of interest gave no opportunity for a comprehensive comparison between the formulations. We review each formulation and compare their empirical results over instance datasets of the literature. We adapt most formulations to allow for piece rotation. The possibility of adaptation was already predicted but not realized by the prior work. The results show the dominance of pseudo‐polynomial formulations until the point instances become intractable by them, while more compact formulations keep achieving good primal solutions. Our study also reveals a mistake in the generation of the T instances, which should have the same optima with or without guillotine cuts. We also propose hybridising a recent formulation with a prior formulation for a restricted version of the problem. The hybridisations show a reduction of about 20% of the branch‐and‐bound time thanks to the symmetries broken by the hybridisation.

Acceptance of Insurance by Psychiatrists and Other Physicians, 2007-2016.

The authors aimed to analyze psychiatrists' and other physicians' acceptance of insurance and the associations between insurance acceptance and specific physician- and practice-level characteristics. Using the restricted version of the National Ambulatory Medical Care Survey, January 2007-December 2016, the authors analyzed acceptance of private insurance, public insurance, and any insurance among psychiatrists compared with nonpsychiatrist physicians. Because data were considered restricted, all analyses were conducted at federal Research Data Center facilities. The unweighted sample included an average of 4,725 physicians per 2-year time grouping between 2007 and 2016, with an average of 7% being psychiatrists. Nonpsychiatrists participated in all insurance networks at higher rates than did psychiatrists, and the acceptance gap was wider for public (Medicare and Medicaid) than private (noncapitated and capitated) insurance. Among psychiatrists, those practicing in metropolitan statistical areas and those in solo practices were significantly less likely than their peers in other locations and treatment settings to accept private, public, or any insurance. These findings were also observed among nonpsychiatrists, although to a lesser extent. In addition to general policy interventions to improve insurance network adequacy for psychiatric care, additional measures or incentives to promote insurance network participation should be considered for psychiatrists in solo practices and those in metropolitan areas.

Thin spectra and singular continuous spectral measures for limit‐periodic Jacobi matrices

AbstractThis paper investigates the spectral properties of Jacobi matrices with limit‐periodic coefficients. We show that generically the spectrum is a Cantor set of zero Lebesgue measure, and the spectral measures are purely singular continuous. For a dense set of limit‐periodic Jacobi matrices, we show that the spectrum is a Cantor set of zero lower box counting dimension while still retaining the singular continuity of the spectral type. We also show how results of this nature can be established by fixing the off‐diagonal coefficients and varying only the diagonal coefficients, and, in a more restricted version, by fixing the diagonal coefficients to be zero and varying only the off‐diagonal coefficients. We apply these results to produce examples of weighted Laplacians on the multidimensional integer lattice having purely singular continuous spectral type and zero‐dimensional spectrum.

Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets

We analyze the computational complexity of motion planning through local “input/output” gadgets with separate entrances and exits, and a subset of allowed traversals from entrances to exits, each of which changes the state of the gadget and thereby the allowed traversals. We study such gadgets in the zero-, one-, and two-player settings, in particular extending past motion-planning-through-gadgets work [7,8] to zero-player games for the first time, by considering “branchless” connections between gadgets that route every gadget's exit to a unique gadget's entrance. Our complexity results include containment in L, NL, P, NP, and PSPACE; as well as hardness for NL, P, NP, and PSPACE. We apply these results to show PSPACE-completeness for certain mechanics in the video games Factorio, [the Sequence], and a restricted version of Trainyard, improving the result of [3]. This work strengthens prior results on switching graphs, ARRIVAL [6], and reachability switching games [10].

An epistemic approach to model uncertainty in data-graphs

Graph databases are becoming widely successful as data models that allow to effectively represent and process complex relationships among various types of data. Data-graphs are particular types of graph databases whose representation allows both data values in the paths and in the nodes to be treated as first class citizens by the query language. As with any other type of data repository, data-graphs may suffer from errors and discrepancies with respect to the real-world data they intend to represent. In this work, we explore the notion of probabilistic unclean data-graphs, in order to capture the idea that the observed (unclean) data-graph is actually the noisy version of a clean one that correctly models the world but that we know only partially. As the factors that lead to such a state of affairs may be many, e.g., all different types of clerical errors or unintended transformations of the data, and depend heavily on the application domain, we assume an epistemic probabilistic model that describes the distribution over all possible ways in which the clean (uncertain) data-graph could have been polluted. Based on this model we define two computational problems: data cleaning and probabilistic query answering and study for both of them their corresponding complexity when considering that the polluting transformation of the data-graph can be caused by either removing (subset), adding (superset), or modifying (update) nodes and edges. For data cleaning, we explore restricted versions when the transformation only involves updating data-values on the nodes. Finally, we look at some implications of incorporating hard and soft constraints to our framework.

Revealing the properties of the out-of-plane points of equilibrium of the restricted 3-body problem with non-spherical radiating bodies

Our target is to understand and also reveal the dynamics of the out-of-plane points of equilibrium of the restricted version of the 3-body problem with equally massed radiating bodies that have either prolate or oblate shapes. We use standard root-finding numerical methods of high accuracy for determining the coordinates of the locations of the out-of-plane equilibria and also for computing their linear stability. For obtaining a global view of how the two system’s parameters, that is the prolateness/oblateness coefficient and the radiation pressure factor, affect the equilibria dynamics we perform a systematic and thorough scan of the parameters space. Our analysis suggests that the out-of-plane equilibria are highly affected by these two parameters and play a key role in the overall dynamics of the system.

The Craving-Manager smartphone app designed to diagnose substance use/addictive disorders, and manage craving and individual predictors of relapse: a study protocol for a multicenter randomized controlled trial.

The rate of individuals with addiction who are currently treated are low, and this can be explained by barriers such as stigma, desire to cope alone, and difficulty to access treatment. These barriers could be overcome by mobile technologies. EMI (Ecological Momentary Intervention) is a treatment procedure characterized by the delivery of interventions (messages on smartphones) to people in their daily lives. EMI presents opportunities for treatments to be available to people during times and in situations when they are most needed. Craving is a strong predictor of relapse and a key target for addiction treatment. Studies using Ecological Momentary Assessment (EMA) method have revealed that, in daily life, person-specific cues could precipitate craving, that in turn, is associated with a higher probability to report substance use and relapse in the following hours. Assessment and management of these specific situations in daily life could help to decrease addictive use and avoid relapse. The Craving-Manager smartphone app has been designed to diagnose addictive disorders, and assess and manage craving as well as individual predictors of use/relapse. It delivers specific and individualized interventions (counseling messages) composed of evidence-based addiction treatments approaches (cognitive behavioral therapy and mindfulness). The Craving-Manager app can be used for any addiction (substance or behavior). The objective of this protocol is to evaluate the efficacy of the Craving-Manager app in decreasing use (of primary substance(s)/addictive behavior(s)) over 4 weeks, among individuals on a waiting list for outpatient addiction treatment. This multicenter double-blind randomized controlled trial (RCT) will compare two parallel groups: experimental group (full interventional version of the app, 4 weeks, EMA + EMI), versus control group (restricted version of the app, 4 weeks, only EMA). Two hundred and seventy-four participants will be recruited in 6 addiction treatment centers in France. This RCT will provide indication on how the Craving-Manager app will reduce addictive use (e.g., better craving management, better stimulus control) in both substance and behavioral addictions. If its efficacy is confirmed, the app could offer the possibility of an easy to use and personalized intervention accessible to the greatest number of individuals with addiction. ClinicalTrials.gov: NCT04732676.