A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
P-immune sets with holes lack self-reducibility properties
2003
Theoretical Computer Science
Preserved Fulltext
No P-immune set having exponential gaps is positive-Turing self-reducible. ...
(1) No P-immune set having E-gaps is positive-Turing self-reducible or positive-Turing word-decreasing-self-reducible. (2) No P-immune set having E-gaps is disjunctive-Turing self-reducible or disjunctive-Turing ...
It has been shown by K amper [11] that no P-immune set A having doubleexponential-size gaps can be disjunctive-Turing self-reducible. ...
doi:10.1016/s0304-3975(02)00576-5
fatcat:qn3obn37t5exzcjp2hjvqedssm
P-Immune Sets with Holes Lack Self-Reducibility Properties
[article]
2001
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
No P-immune set having exponential gaps is positive-Turing self-reducible. ...
No P-immune set having E-gaps is disjunctive-Turing self-reducible or disjunctive-Turing word-decreasing-self-reducible.3. ...
Our main result is that P-immune sets having exponentially large holes can never be positive-Turing self-reducible (or even locally left-positive-Turing word-decreasing-selfreducible). ...
arXiv:cs/0102024v1
fatcat:zhapymvyezeehkok2uljwpmiay
Page 34 of Mathematical Reviews Vol. , Issue 92a
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
result relating disjunctive self-reducibility to P-immunity. ...
For any P-immune set A there is a set many-one reducible to A in polynomial time which is not disjunctively self- reducible. ...
On self-reducibility and weak P-selectivity
1983
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
It is proved that self-reducible sets are not polynomial-time Turing reducible to these sets. ...
Self-reducible sets and some low sets, including p-selective sets, and weakly p-selective sets are studied. ...
We first restate results about sparse sets. THEOREM 4 (6, 161. Zf L is T-self-reducible, and L <", A, L <", B for some sparse sets A and B, then L E P. ...
doi:10.1016/0022-0000(83)90013-2
fatcat:jcfahgcydzgyzpgyqeqrm2kt2q
Concise Review: Update on Retinal Pigment Epithelium Transplantation for Age-Related Macular Degeneration
2019
Stem Cells Translational Medicine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Synaptic disjunction and photoreceptor apoptosis associated with retinal detachment can be reduced with Rho kinase inhibitors. ...
Retinal detachment, currently used to deliver transplanted RPE cells to the subretinal space, induces disjunction of the first synapse in the visual pathway: the photoreceptor-bipolar synapse. ...
found that rod-bipolar synaptic disjunction could be reduced with subretinal administration of a ROCK inhibitor (Fig. 5 ) [71] . ...
doi:10.1002/sctm.18-0282
pmid:30748126
pmcid:PMC6477002
fatcat:gc66m72xrzgf7ck6accjjtdpqe
The Crossover Closure and Partial Match Detection
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
The paper reviews earlier results and extends the previously introduced notion of crossover closure to encompass additional match rules. ...
The crossover closure generation rule characterizes the generalization achieved by artificial immune systems using partial match detection. ...
The first specifies whether detectors are tailored to match strings in self or nonself, denoted as P or N respectively. ...
doi:10.1007/978-3-540-45192-1_24
fatcat:wm4vpckqd5avjhlfmbpa33r47e
Scheduling flow lines with buffers by ant colony digraph
2013
Expert systems with applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This model is addressed in the literature as non-permutation flowshop scheduling (NPFS) and is described in this article by a disjunctive graph (digraph) with the purpose of designing specialized heuristic ...
Ant Colony Optimization (ACO) with the biologically inspired mechanisms of learned desirability and pheromone rule is shown to produce natively eligible schedules, as opposed to most metaheuristics approaches ...
Each operation O * j is connected with disjunctive arcs of E j only, because the related operation can be processed by a machine at stage j. ...
doi:10.1016/j.eswa.2012.12.041
fatcat:eqil4l3645gclokmqapr4e4tfi
MILP-based technique for smart self-healing grids
2018
IET Generation, Transmission & Distribution
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this study, a smart self-healing optimisation strategy for smart grids is proposed. ...
Self-healing is an important characteristic of smart grids, as it pertains to the capability of the grid to isolate and restore the system, or part of it, to its normal operation following interruptions ...
Self-healing refers to the ability of a smart grid to identify and react to disturbance by restoring the system to normal operation with minimal or no human intervention [19] . ...
doi:10.1049/iet-gtd.2017.1844
fatcat:ekqb3svdjrfpbcvknv7muoc2t4
Nonrecursive Relations Among the Isols
1972
Proceedings of the American Mathematical Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The universal isol metatheorem is extended so as to deal with nonrecursive relations and countable Boolean operations. Received by the editors April 25, 1971. A MS 1970 subject classifications. ...
(A sketch; refer to [3] for all the details.) As in the proof of Theorem 11.1 of [3] part (ii) reduces to part (i), and for (i) it suffices to consider the case where 31 is a single conjunct. ...
Our second result concerns a generalization of Theorem 1 to a class of infinitary universal sentences in J¡fa _ . ...
doi:10.2307/2039067
fatcat:kxdqgbn57jex5kws4n74lcw2oy
Nonrecursive relations among the isols
1972
Proceedings of the American Mathematical Society
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The universal isol metatheorem is extended so as to deal with nonrecursive relations and countable Boolean operations. Received by the editors April 25, 1971. A MS 1970 subject classifications. ...
(A sketch; refer to [3] for all the details.) As in the proof of Theorem 11.1 of [3] part (ii) reduces to part (i), and for (i) it suffices to consider the case where 31 is a single conjunct. ...
Our second result concerns a generalization of Theorem 1 to a class of infinitary universal sentences in J¡fa _ . ...
doi:10.1090/s0002-9939-1972-0313039-4
fatcat:2md2ms7swfbozpihofh36aekxi
Conserved Immunoglobulin Domain Similarities of Higher Plant Proteins
2020
Computational Molecular Bioscience
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The resulting seventeen sets of records describing conserved domain similarities of 1323 different sequence IDs yielded a set of next generation (final set) comprising forty-nine records containing superior ...
The selected sets and their subsets were mapped and subsequently statistically compared with respect to immunoglobulin-related as well as other reciprocal domain linkages. ...
MQP1 or MQP2); -P, -NP, -NPoP-disjunctive subsets obtained only with, only without or simultaneously with and without ALPS-related MPSQ, respectively (similarly to the unique subset-NPoP, the set NPoP ...
doi:10.4236/cmb.2020.101002
fatcat:vcvwvhyie5hihhe3wlqrijlnzy
A restricted Principle of Sufficient Reason and the cosmological argument
2004
Religious Studies: An International Journal for the Philosophy of Religion
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
I present a natural restricted version of the PSR that avoids all conceptual counter-examples, and yet that is strong enough to ground a cosmological argument. ...
It is likely that one reason why a number of philosophers reject the PSR is that they think there are conceptual counter-examples to it. ...
If a proposition p reduces in a sufficiently strong sense to q, then if p is true, it is true in virtue of q being true. ...
doi:10.1017/s003441250300684x
fatcat:6lshivlmpfeqrp4qyukenume3q
Validity, dialetheism and self-reference
2018
Synthese
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we will show that LP can be non-trivially expanded with a naive validity predicate. The resulting theory, LP Val reaches this goal by adopting a weak self-referential procedure. ...
We show that LP Val is sound and complete with respect to the three-sided sequent calculus SLP Val . Moreover, LP Val can be safely expanded with a transparent truth predicate. ...
LP Val+ will be sound and complete with respect to a new disjunctive three- To apply SeudoDL, p * ↔ A p * must be a member of Z * . ...
doi:10.1007/s11229-018-1731-x
fatcat:ptcmksy3v5g55gcrsv5ccf2whu
Evolutionary Algorithm for Artificial-Immune-System-Based Failure-Detector Generation and Optimization
2010
Journal of Guidance Control and Dynamics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Artificial Immune System (AIS)-based fault detection operates in a similar manner as does its biological counterpart -according to the principle of self/non-self discrimination -when it distinguishes ...
A second phase consists of a classic genetic algorithm that attempts to optimize the number of detectors, overlapping between detectors, and coverage of the "non-self" while maintaining no overlap with ...
through a grant within the Research Seed Grant program. ...
doi:10.2514/1.46126
fatcat:exeut6r56vedxpppgw6kp6fwku
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P
2006
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We discuss this application to non-self-reducibility and provide a general related result. We also discuss when raising a problem's NP-hardness lower bound to ∆ p 2hardness can be valuable. ...
This result optimally improves upon a result of Khuller and Vazirani who prove this problem NP-hard, and conclude that it is not self-reducible in the sense of Schnorr, assuming P = NP. ...
In particular, we thank the referee who suggested an idea that led to Theorem 3.5, which subsumes some results from an earlier draft of this paper. ...
doi:10.1016/j.ipl.2006.04.007
fatcat:del3hgx3nreufpl3gemu3h5nwa
« Previous
Showing results 1 — 15 out of 3,614 results