6,420 research outputs found
Figure 2 in Distribution of the Indian Bustard Ardeotis nigriceps (Gruiformes: Otididae) in Gujarat State, India
No full textFigure 2. Annual distriution of Indian Bustard in Kachchh (Gujarat) between 2006–2007Published as part of Munjpara, Sandeep B., Jethva, B. & Pandey, C.N., 2011, Distribution of the Indian Bustard Ardeotis nigriceps (Gruiformes: Otididae) in Gujarat State, India, pp. 2090-2094 in Journal of Threatened Taxa 3 (9) on page 2092, DOI: 10.11609/JoTT.o2756.2090-4, http://zenodo.org/record/509242
Incompressibility of H-Free Edge Modification Problems: Towards a Dichotomy
No full textGiven a graph G and an integer k, the H-free Edge Editing problem is to find whether there exist at most k pairs of vertices in G such that changing the adjacency of the pairs in G results in a graph without any induced copy of H. The existence of polynomial kernels for H-free Edge Editing (that is, whether it is possible to reduce the size of the instance to k^O(1) in polynomial time) received significant attention in the parameterized complexity literature. Nontrivial polynomial kernels are known to exist for some graphs H with at most 4 vertices (e.g., path on 3 or 4 vertices, diamond, paw), but starting from 5 vertices, polynomial kernels are known only if H is either complete or empty. This suggests the conjecture that there is no other H with at least 5 vertices were H-free Edge Editing admits a polynomial kernel. Towards this goal, we obtain a set ℋ of nine 5-vertex graphs such that if for every H ∈ ℋ, H-free Edge Editing is incompressible and the complexity assumption NP ⊈ coNP/poly holds, then H-free Edge Editing is incompressible for every graph H with at least five vertices that is neither complete nor empty. That is, proving incompressibility for these nine graphs would give a complete classification of the kernelization complexity of H-free Edge Editing for every H with at least 5 vertices.
We obtain similar result also for H-free Edge Deletion. Here the picture is more complicated due to the existence of another infinite family of graphs H where the problem is trivial (graphs with exactly one edge). We obtain a larger set ℋ of nineteen graphs whose incompressibility would give a complete classification of the kernelization complexity of H-free Edge Deletion for every graph H with at least 5 vertices. Analogous results follow also for the H-free Edge Completion problem by simple complementation
Parameterized Lower Bound and Improved Kernel for Diamond-free Edge Deletion
No full textA diamond is a graph obtained by removing an edge from a complete graph on four vertices. A graph is diamond-free if it does not contain an induced diamond. The Diamond-free Edge Deletion problem asks to find whether there exist at most k edges in the input graph whose deletion results in a diamond-free graph. The problem was proved to be NP-complete and a polynomial kernel of O(k^4) vertices was found by Fellows et. al. (Discrete Optimization, 2011). In this paper, we give an improved kernel of O(k^3) vertices for Diamond-free Edge Deletion. We give an alternative proof of the NP-completeness of the problem and observe that it cannot be solved in time 2^{o(k)} * n^{O(1)}, unless the Exponential Time Hypothesis fails
sj-docx-1-pie-10.1177_09544089221128367 - Supplemental material for A modified thermal flux model to examine the enhanced heat transmission in hybrid blood flow through artery: A comparison between Maxwell and Oldroyd-B models
No full textSupplemental material, sj-docx-1-pie-10.1177_09544089221128367 for A modified thermal flux model to examine the enhanced heat transmission in hybrid blood flow through artery: A comparison between Maxwell and Oldroyd-B models by Niraj Rathore and Sandeep N in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
sj-docx-1-jop-10.1177_02698811221131989 – Supplemental material for Belief changes associated with psychedelic use
No full textSupplemental material, sj-docx-1-jop-10.1177_02698811221131989 for Belief changes associated with psychedelic use by Sandeep M. Nayak, Manvir Singh, David B. Yaden and Roland R. Griffiths in Journal of Psychopharmacology</p
Proceedings of ASME Turbo Expo 2013: Power for Land, Sea and Air, Volume 1A: Combustion, Fuels and Emissions
No full textShahrokh Etemad (with Sandeep Alavandi and Benjamin Baird) is a contributing author, Fuel Flexible Rich Catalytic Lean Burn System for Low Btu Fuels
Autologous human kidney proximal tubule epithelial cells (PTEC) modulate dendritic cell (DC), T cell and B cell responses
No full textThis is a comprehensive study of human kidney proximal tubular epithelial cells (PTEC) which are known to respond to and mediate the pathological process of a range of kidney diseases. It identifies various molecules expressed by PTEC and how these molecules participate in down-regulating the inflammatory process, thereby highlighting the clinical potential of these molecules to treat various kidney diseases. In the disease state, PTEC gain the ability to regulate the immune cell responses present within the interstitium. This down-regulation is a complex interaction of contact dependent/independent mechanisms involving various immuno-regulatory molecules including PD-L1, sHLA-G and IDO. The overall outcome of this down-regulation is suppressed DC maturation, decreased number of antibody producing B cells and low T cell responses. These manifestations within a clinical setting are expected to dampen the ongoing inflammation, preventing the damage caused to the kidney tissue
sj-docx-2-jop-10.1177_02698811221131989 – Supplemental material for Belief changes associated with psychedelic use
No full textSupplemental material, sj-docx-2-jop-10.1177_02698811221131989 for Belief changes associated with psychedelic use by Sandeep M. Nayak, Manvir Singh, David B. Yaden and Roland R. Griffiths in Journal of Psychopharmacology</p
A new Cu(II) three-dimensional network with 4,4′-oxybis benzoic acid: structural diversity, EPR, and magnetism
No full textThe copper derivative [Cu4(oba)4(H2O)4]∙H2On(1) has been hydro(solvo)thermally synthesized by combining flexible 4,4′-oxybis benzoic acid (oba) and divalent copper nitrate. As a result of the potential coordination modes of carboxylate oxygens from the oba ligand, the aforementioned complex leads to the formation of an interesting 3D framework, as evidenced by single-crystal X-ray diffractometry. Concerning the topology in 1, the dimers [Cu2C4O8] are nodes of a 5-fold 4-connected uninodal net of the type lvt, with point symbol 42.84 and vertex symbol [4.4.84.84.88.88]. The encapsulation of the copper coordination polymer displays a moderate luminescent property. On temperature-dependent magnetic study, it reveals that the magnetic behaviour of 1 can be associated to a strong antiferromagnetic coupling between the two Cu(II) ions
Untitled
No full textLos Angeles artist Sandeep Mukherjee's visually stunning abstractions, filled with radiant bursts of energy, are frequently evocative of forms in nature. Here, the dense, fluid earth-tone layers of what might be imagined to be a mountain or hillside are silhouetted against a white sky bearing rose-colored cloud shapes decorated with intricate banded patterns. Central to Mukherjee's achievement of these effects is his use of Duralene, a vellum-like plastic sheet material. He begins by scoring the surface with a needle to guide a process of repetitive folding. Here, the resulting folds read as beams of light and nuanced shadow that emanate from within the cloud form at the upper left. The concentric rings and bands of jewel-like color within the cloud shapes are created by meticulously applying acrylic ink with felt and Q-tips, and occasionally dissolving it with alcohol. Of these and other spiral forms in his work, Mukherjee explains, "to me, the [modernist] grid was too exclusive and aggressive ... I started thinking about a notion of space and time that was a little more open ... all the connotations of breath and life and cyclicality." Initially trained as an engineer, Sandeep Mukherjee earned a BS from the Manipal Institute of Technology, Mangalore, India in 1986 and an MS from the University of California, Berkeley, in 1988. He received his BFA from Otis College of Art and Design, Los Angeles, in 1996 and his MFA from the University of California, Los Angeles, in 1999. - Deni McHenr
- …
