scholarly journals A higher-order characterization of probabilistic polynomial time

2015 ◽  
Vol 241 ◽  
pp. 114-141 ◽  
Author(s):  
Ugo Dal Lago ◽  
Paolo Parisen Toldin
Keyword(s):  
Polynomial Time ◽  
Higher Order ◽  
Probabilistic Polynomial Time

scholarly journals A closed-loop optogenetic screen for neurons controlling feeding in Drosophila

2021 ◽  
Author(s):  
Celia K S Lau ◽  
Meghan Jelen ◽  
Michael D Gordon
Keyword(s):  
Drosophila Melanogaster ◽  
Expression Pattern ◽  
Sensory Neurons ◽  
Closed Loop ◽  
Higher Order ◽  
Taste Detection ◽  
Proof Of Principle ◽  
Feeding Circuits

Abstract Feeding is an essential part of animal life that is greatly impacted by the sense of taste. Although the characterization of taste-detection at the periphery has been extensive, higher order taste and feeding circuits are still being elucidated. Here, we use an automated closed-loop optogenetic activation screen to detect novel taste and feeding neurons in Drosophila melanogaster. Out of 122 Janelia FlyLight Project GAL4 lines preselected based on expression pattern, we identify six lines that acutely promote feeding and 35 lines that inhibit it. As proof of principle, we follow up on R70C07-GAL4, which labels neurons that strongly inhibit feeding. Using split-GAL4 lines to isolate subsets of the R70C07-GAL4 population, we find both appetitive and aversive neurons. Furthermore, we show that R70C07-GAL4 labels putative second-order taste interneurons that contact both sweet and bitter sensory neurons. These results serve as a resource for further functional dissection of fly feeding circuits.

Near‐Field Characterization of Higher‐Order Topological Photonic States at Optical Frequencies

2021 ◽  
pp. 2004376
Author(s):  
Anton Vakulenko ◽  
Svetlana Kiriushechkina ◽  
Mingsong Wang ◽  
Mengyao Li ◽  
Dmitry Zhirihin ◽  
...  
Keyword(s):  
Near Field ◽  
Higher Order ◽  
Photonic States

scholarly journals Extended lubrication theory: improved estimates of flow in channels with variable geometry

2017 ◽  
Vol 473 (2206) ◽  
pp. 20170234 ◽  
Author(s):  
Behrouz Tavakol ◽  
Guillaume Froehlicher ◽  
Douglas P. Holmes ◽  
Howard A. Stone
Keyword(s):  
Stokes Equations ◽  
Perturbation Expansion ◽  
Accurate Estimate ◽  
Higher Order ◽  
Lubrication Theory ◽  
Channel Height ◽  
Fluid Films ◽  
Flow Characterization ◽  
Systematic Perturbation

Lubrication theory is broadly applicable to the flow characterization of thin fluid films and the motion of particles near surfaces. We offer an extension to lubrication theory by starting with Stokes equations and considering higher-order terms in a systematic perturbation expansion to describe the fluid flow in a channel with features of a modest aspect ratio. Experimental results qualitatively confirm the higher-order analytical solutions, while numerical results are in very good agreement with the higher-order analytical results. We show that the extended lubrication theory is a robust tool for an accurate estimate of pressure drop in channels with shape changes on the order of the channel height, accounting for both smooth and sharp changes in geometry.

scholarly journals Face-Width of Pfaffian Braces and Polyhex Graphs on Surfaces

10.37236/3540 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Dong Ye ◽  
Heping Zhang
Keyword(s):  
Bipartite Graph ◽  
Polynomial Time ◽  
Perfect Matching ◽  
Cartesian Product ◽  
Perfect Matchings ◽  
Face Width ◽  
Graphs On Surfaces ◽  
Positive Genus ◽  
Pfaffian Graph

A graph $G$ with a perfect matching is Pfaffian if it admits an orientation $D$ such that every central cycle $C$ (i.e. $C$ is of even size and $G-V(C)$ has a perfect matching) has an odd number of edges oriented in either direction of the cycle. It is known that the number of perfect matchings of a Pfaffian graph can be computed in polynomial time. In this paper, we show that every embedding of a Pfaffian brace (i.e. 2-extendable bipartite graph)  on a surface with a positive genus has face-width at most 3.  Further, we study Pfaffian cubic braces and obtain a characterization of Pfaffian polyhex graphs: a polyhex graph is Pfaffian if and only if it is either non-bipartite or isomorphic to the cube, or the Heawood graph, or the Cartesian product $C_k\times K_2$ for even integers $k\ge 6$.

The characterization of monadic logic

1973 ◽  
Vol 38 (3) ◽  
pp. 481-488 ◽  
Author(s):  
Leslie H. Tharp
Keyword(s):  
Finite Sequence ◽  
Higher Order ◽  
Predicate Calculus ◽  
Intrinsic Properties ◽  
Monadic Logic

The first section of this paper is concerned with the intrinsic properties of elementary monadic logic (EM), and characterizations in the spirit of Lindström [2] are given. His proofs do not apply to monadic logic since relations are used, and intrinsic properties of EM turn out to differ in certain ways from those of the elementary logic of relations (i.e., the predicate calculus), which we shall call EL. In the second section we investigate connections between higher-order monadic and polyadic logics.EM is the subsystem of EL which results by the restriction to one-place predicate letters. We omit constants (for simplicity) but take EM to contain identity. Let a type be any finite sequence (possibly empty) of one-place predicate letters. A model M of type has a nonempty universe ∣M∣ and assigns to each predicate letter P of a subset PM of ∣M∣.Let us take a monadic logic L to be any collection of classes of models, called L-classes, satisfying the following:1. All models in a given L-class are of the same type (called the type of the class).2. Isomorphic models lie in the same L-classes.3. If and are L-classes of the same type, then and are L-classes.

Sign in / Sign up

Export Citation Format

Share Document