Papers by brian christian
Scientific reports, Jan 30, 2017
Laser-induced experimental glaucoma (ExGl) in non-human primates (NHPs) is a common animal model ... more Laser-induced experimental glaucoma (ExGl) in non-human primates (NHPs) is a common animal model for ocular drug development. While many features of human hypertensive glaucoma are replicated in this model, structural and functional changes in the unlasered portions of trabecular meshwork (TM) of laser-treated primate eyes are understudied. We studied NHPs with ExGl of several years duration. As expected, ExGl eyes exhibited selective reductions of the retinal nerve fiber layer that correlate with electrophysiologic measures documenting a link between morphologic and elctrophysiologic endpoints. Softening of unlasered TM in ExGl eyes compared to untreated controls was observed. The degree of TM softening was consistent, regardless of pre-mortem clinical findings including severity of IOP elevation, retinal nerve fiber layer thinning, or electrodiagnostic findings. Importantly, this softening is contrary to TM stiffening reported in glaucomatous human eyes. Furthermore, microscopic a...
Investigative ophthalmology & visual science, Mar 1, 2017
The purpose of this study was to characterize the inflammatory response and determine a no-observ... more The purpose of this study was to characterize the inflammatory response and determine a no-observable effect level (NOEL) in rabbit eyes after endotoxin intravitreal (ITV) injection. Fifty-three naïve male Dutch Belted rabbits were treated with a single 50-μL ITV injection ranging from 0.01 to 0.75 endotoxin units/eye (EU/eye) and monitored for up to 42 days post treatment. Ophthalmic examination included slit-lamp biomicroscopy and indirect ophthalmoscopy. Laser flare photometry was performed in a subset of animals. On days 2, 8, 16, and 43, a subset of animals was necropsied and eyes processed for histopathological evaluation. Intravitreal injection of endotoxin at ≥0.05 EU/eye resulted in a dose-related anterior segment inflammation response. No aqueous flare or cell response was noted in the 0.01 EU/eye dose group. A more delayed posterior segment response characterized by vitreal cell response was observed beginning on day 5, peaking on day 9, and decreasing starting on day 16 ...
Systems and methods for declarative client input security screening
Systems and methods for declarative localization of web services
Declarative page view and click tracking systems and methods
The Most Human Human: What Artificial Intelligence Teaches Us About Being Alive
"The Most Human Human" by Brian Christian is a mind-blowing piece of reportage that wil... more "The Most Human Human" by Brian Christian is a mind-blowing piece of reportage that will appeal to readers of Jon Ronson's "The Psychopath Test", and an inspiring riposte to John Gray's classic "Straw Dogs" - a book that will change your whole understanding of what being human actually means...AI is on the brink of a new dawn. And so are we...Telling the difference between humans and computers used to be easy. But artificial intelligence is now so advanced that it is capable of behaving, and even thinking, in ways that have long been considered exclusive to humankind. The time has come to rethink what being human actually means...In "The Most Human Human" Brian Christian meets the world's leading artificial intelligences, finds out what they're capable of - and what makes us unique. The result is a funny, shocking, inspiring, deeply humane and intelligent book that reaches into every aspect of our lives. "Tremendously entertaining". ("Metro"). "Excellent ...a fascinating explanation of what it means to be human". ("Financial Times"). "Remarkable. A philosophical joyride. The day that a machine creates work of such wit and originality, we should all be very worried". ("The Times"). "An epic tour of philosophical, linguistic and scientific discovery. We stop off in places as far-flung as existential anxiety, predictive text and Gary Kasparov's defeat by Deep Blue". ("Time Out"). "Lively, thought-stirring, entertaining, invaluable ...compelling insights". (John Gray, "New Statesman"). At the age of twenty-six, Brian Christian has lectured at the LSE, Royal Academy, Bristol Festival of Ideas, Microsoft and Google, been interviewed on "The Daily Show", BBC and in the "Paris Review", profiled in the "Guardian", featured in "The New York Times", the "New Yorker" and on the front cover of "Atlantic", and has made numerous appearances at universities and in online videos speaking on his subject. He holds a dual degree from Brown University in computer science and philosophy, and an MFA in poetry.
Journal of controlled release : official journal of the Controlled Release Society, Dec 28, 2016
A potent anti-vascular endothelial growth factor (VEGF) biologic and a compatible delivery system... more A potent anti-vascular endothelial growth factor (VEGF) biologic and a compatible delivery system were co-evaluated for protection against wet age-related macular degeneration (AMD) over a 6month period following a single intravitreal (IVT) injection. The anti-VEGF molecule is dimeric, containing two different anti-VEGF domain antibodies (dAb) attached to a human IgG1 Fc region: a dual dAb. The delivery system is based on microparticles of PolyActive™ hydrogel co-polymer. The molecule was evaluated both in vitro for potency against VEGF and in ocular VEGF-driven efficacy models in vivo. The dual dAb is highly potent, showing a lower IC50 than aflibercept in VEGF receptor binding assays (RBAs) and retaining activity upon release from microparticles over 12months in vitro. Microparticles released functional dual dAb in rabbit and primate eyes over 6months at sufficient levels to protect Cynomolgus against laser-induced grade IV choroidal neovascularisation (CNV). This demonstrates pro...
Research Guides Women S Studies and Gender Studies Citing Sources
Electron. Colloquium Comput. Complex., 2016
We show that checking if a given hypergraph has an automorphism that moves exactly k vertices is ... more We show that checking if a given hypergraph has an automorphism that moves exactly k vertices is fixed parameter tractable, using k and additionally either the maximum hyperedge size or the maximum color class size as parameters. In particular, it suffices to use k as parameter if the hyperedge size is at most polylogarithmic in the size of the given hypergraph. As a building block for our algorithms, we generalize Schweitzer's FPT algorithm [ESA 2011] that, given two graphs on the same vertex set and a parameter k, decides whether there is an isomorphism between the two graphs that moves at most k vertices. We extend this result to hypergraphs, using the maximum hyperedge size as a second parameter. Another key component of our algorithm is an orbit-shrinking technique that preserves permutations that move few points and that may be of independent interest. Applying it to a suitable subgroup of the automorphism group allows us to switch from bounded hyperedge size to bounded co...
Bull. EATCS, 2015
Our colleague and friend Uwe Schöning, who has helped to shape the area of Complexity Theory in m... more Our colleague and friend Uwe Schöning, who has helped to shape the area of Complexity Theory in many decisive ways is turning 60 this year. As a little birthday present we survey in this column some of the newer results related with the concept of lowness, an idea that Uwe translated from the area of Recursion Theory in the early eighties. Originally this concept was applied to the complexity classes in the polynomial time hierarchy. An overview of the many results inspired by the lowness idea was written by the first author in [25]. We review here the lowness scene 20 years later, focusing mainly in the classes out of PH.
Vestnik Tomskogo gosudarstvennogo universiteta, 2018
Рассматриваются основные этапы развития отечественной традиции философско-методологических исслед... more Рассматриваются основные этапы развития отечественной традиции философско-методологических исследований геологического познания, начиная с разработки концепта «геологическая форма движения материи» и заканчивая классификацией наук о Земле и исследованиями специфики метода моделирования в геологии. Целью статьи является выявление наиболее перспективных и актуальных на сегодняшний день подходов к решению научного статуса геологии, разработанных отечественными авторами. Ключевые слова: геология; теория познания; философия науки; геологическая форма движения материи; методология геологии; герменевтика; интерпретация; философия геологии.
Journal on Satisfiability, Boolean Modeling and Computation, 2019
The solution-graph of a Boolean formula on n variables is the subgraph of the hypercube H n induc... more The solution-graph of a Boolean formula on n variables is the subgraph of the hypercube H n induced by the satisfying assignments of the formula. The structure of solution-graphs has been the object of much research in recent years since it is important for the performance of SAT-solving procedures based on local search. Several authors have studied connectivity problems in such graphs focusing on how the structure of the original formula might affect the complexity of the connectivity problems in the solution-graph. In this paper we study the complexity of the isomorphism problem of solution-graphs of Boolean formulas. We consider the classes of formulas that arise in the CSP-setting and investigate how the complexity of the isomorphism problem depends on the formula type. We observe that for general formulas the solution-graph isomorphism problem can be solved in exponential time while in the cases of 2CNF formulas, as well as for CPSS formulas, the problem is in the counting complexity class C = P, a subclass of PSPACE. We also prove a strong property on the structure of solution-graphs of Horn formulas showing that they are just unions of partial cubes. In addition, we give a PSPACE lower bound for the problem on general Boolean functions. We prove that for 2CNF, as well as for CPSS formulas the solution-graph isomorphism problem is hard for C = P under polynomial time many-one reductions, thus matching the given upper bound.
Lecture Notes in Computer Science, 1998
A polynomial time computable function h : ~U*-+ ,U* whose range is the set of tautologies in Prop... more A polynomial time computable function h : ~U*-+ ,U* whose range is the set of tautologies in Propositional Logic (TAUT), is called a proof system. Cook and Reckhow defined this concept in [5] and in order to compare the relative strength of different proof systems, they considered the notion of p-simulation. Intuitively a proof system h p-simulates a second one h' if there is a polynomial time computable function ~, translating proofs in h t into proofs in h. A proof system is called optimal if it p-simulates every other proof system. The question of whether p-optimal proof systems exist is an important one in the field. Krajf~ek and Pudl~k [13,12] proved a sufficient condition for the existence of such optimal systems, showing that if the deterministic and nondeterministic exponential time classes coincide, then p-optimal proof systems exist. They also gave a condition implying the existence of optimal proof systems (a related concept to the one of p-optimal systems). In this paper we improve this result obtaining a weaker sufficient condition for this fact. We show that if a particular class of sets with low information content in nondeterministic double exponential time is included in the corresponding deterministic class, then p-optimal proof systems exist. We also show some complexity theoretical consequences that follow from the assumption of the existence of p-optimal systems. We prove that if p-optimal systems exist then the class UP (and some other related complexity classes) have many-one complete languages, and that many-one complete sets for NP n SPARSE follow from the existence of optimal proof systems.
Language and Automata Theory and Applications, 2014
It is well known that problems encoded with circuits or formulas generally gain an exponential co... more It is well known that problems encoded with circuits or formulas generally gain an exponential complexity blow-up compared to their original complexity. We introduce a new way for encoding graph problems, based on CNF or DNF formulas. We show that contrary to the other existing succinct models, there are examples of problems whose complexity does not increase when encoded in the new form, or increases to an intermediate complexity class less powerful than the exponential blow up. We also study the complexity of the succinct versions of the Graph Isomorphism problem. We show that all the versions are hard for PSPACE. Although the exact complexity of these problems is still unknown, we show that under most existing succinct models the different versions of the problem are equivalent. We also give an algorithm for the DNF encoded version of GI whose running time depends only on the size of the succinct representation.
Mind vs. machine
PsycEXTRA Dataset, 2000
Definition of Problems
Paradigms for Fast Parallel Approximability, 1997
Syntactically Defined Classes
Paradigms for Fast Parallel Approximability, 1997
Primal-Dual Method
Paradigms for Fast Parallel Approximability, 1997
Paradigms for Fast Parallel Approximability, 1997
Tecnologias Digitais e a relação entre teoria e prática: uma análise da produção em trinta anos d... more Tecnologias Digitais e a relação entre teoria e prática: uma análise da produção em trinta anos de BOLEMA Digital Technologies and the relationship between theory and practice: an analysis of the literature in thirty years of BOLEMA
Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibli... more Bibliographic information published by the Deutsche Nationalbibliothek The Deutsche Nationalbibliothek lists this publication in the Deutsche Nationalbibliografie; detailed bibliographic data are available in the Internet at http://dnb.d-nb.de. License This work is licensed under a Creative Commons Attribution 3.0 DE license (CC BY 3.0 DE). In brief, this license authorizes each and everybody to share (to copy, distribute and transmit) the work under the following conditions, without impairing or restricting the authors' moral rights: Attribution: The work must be attributed to its authors. The copyright is retained by the corresponding authors. Digital Object Identifier: 10.4230/DagRep.5.12.i Aims and Scope The periodical Dagstuhl Reports documents the program and the results of Dagstuhl Seminars and Dagstuhl Perspectives Workshops. In principal, for each Dagstuhl Seminar or Dagstuhl Perspectives Workshop a report is published that contains the following: an executive summary of the seminar program and the fundamental results, an overview of the talks given during the seminar (summarized as talk abstracts), and summaries from working groups (if applicable). This basic framework can be extended by suitable contributions that are related to the program of the seminar, e. g. summaries from panel discussions or open problem sessions.
Uploads
Papers by brian christian