98,831 research outputs found
Security beyond survival essays for K. Subrahmanyam
No full textKrishna Swami Subrahmanyam, b. 1929, Indian scientist; contributed articles
Design of molecularly imprinted polymers for sensors and solid phase extraction
Get PDFThis thesis presents broadly the applications of molecularly imprinted polymers in
sensors and solid phase extraction. Sensors for creatine and creatinine have been
reported using a novel method of rational design of molecularly imprinted polymers
(MIPs), and solid phase extraction of aflatoxin-B 1 has also been described in the
thesis.
A method for the selective detection of creataine and creatinine is reported in this
thesis, which is based on the reaction between polymerised hemithioacetal, formed by
allyl mercaptan, o-phthalic aldehyde, and primary amine leading to the formation of
fluorescent isoindole complex. This method was demonstrated for the detection of
creatine using creatine-imprinted MIPs. Since MIPs created using traditional methods
were unable to differentiate between creatine and creatinine, a new approach to the
rational design of a MIP selective for creatinine was developed using computer
simulation. A virtual library of functional monomers was assigned and screened
against the target molecule, creatinine, using molecular modeling software. The
monomers giving the highest binding score were further tested using simulated
annealing in order to mimic the complexation of the functional monomers with
template in the monomer mixture. The result of this simulation gave an optimised
MIP composition. The computationally designed polymer demonstrated superior
selectivity in comparison to the polymer prepared using traditional approach, a
detection limit of 25 μM and good stability. The 'Bite-and- Switch' approach
combined with molecular imprinting can be used for the design of assays and sensors,
selective for amino containing substances.
MEP for the selective binding properties for aflatoxin-B 1 was prepared using the
computational approach. The results obtained demonstrate that the MISPE offers a
simple, convenient and a rapid methodology for solid phase extraction of aflatoxin-B 1
even at very low concentrations of 2 ppb. The commercially available C-18 cartridges
were able to recover only about 52% of aflatoxin-B 1 at concentrations of 2 ppb when
compared with almost complete recovery by the MIP. We have proved here that,
MIPs as a solid phase extraction materials offer important and practical advantages
with respect to other solid phase extraction methodologies
Joshua Davis: Author of Spare Parts
Get PDFCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time
Get PDFLet {\mathcal B} be a linear space of matrices over a field {\mathbb spanned by n\times n
matrices B_1, \dots, B_m. The non-commutative rank of {\mathcal B}$ is the minimum r\in {\mathbb N} such that there exists U\leq {\mathbb F}^n satisfying \dim(U)-\dim( {\mathcal B} (U))\geq
n-r, where {\mathcal B}(U):={\mathrm span}(\cup_{i\in[m]} B_i(U)).
Computing the non-commutative rank generalizes some well-known problems including the bipartite graph maximum
matching problem and the linear matroid intersection problem.
In this paper we give a deterministic polynomial-time algorithm to compute the
non-commutative rank over
any field {\mathbb F}. Prior to our work, such
an
algorithm was only known over the rational number field {\mathbb Q}, a result due to Garg et al, [GGOW]. Our algorithm is constructive and produces a witness
certifying the non-commutative rank, a feature that is missing in the algorithm from [GGOW].
Our result is built on techniques which we developed in a previous paper [IQS1], with a new reduction procedure that
helps to keep the blow-up parameter small. There are two ways to realize this
reduction. The first involves constructivizing a key result
of Derksen and Makam [DM2] which they developed in order to prove that the null cone
of matrix semi-invariants is cut out by generators whose degree is polynomial in the size of the matrices involved. We also give a second, simpler method to achieve this. This
gives another proof of the polynomial upper bound on the degree of the generators cutting out the null cone of matrix
semi-invariants.
Both the invariant-theoretic result and the algorithmic result rely crucially
on the regularity lemma proved in [IQS1]. In
this paper we improve on the constructive version of the regularity lemma from [IQS1] by removing a technical coprime
condition that was assumed there
sj-pdf-1-pie-10.1177_09544089221127132 - Supplemental material for Numerical investigation of heat transfer enhancement in microchannel heat sink with fan cavities using secondary channels and ribs
No full textSupplemental material, sj-pdf-1-pie-10.1177_09544089221127132 for Numerical investigation of heat transfer enhancement in microchannel heat sink with fan cavities using secondary channels and ribs by K Bala Subrahmanyam and Pritam Das in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
sj-pdf-1-pie-10.1177_0954408920987433 - Supplemental material for Numerical investigation on fluid flow and convective heat transfer in a microchannel heat sink with fan-shaped cavities and ribs
No full textSupplemental material, sj-pdf-1-pie-10.1177_0954408920987433 for Numerical investigation on fluid flow and convective heat transfer in a microchannel heat sink with fan-shaped cavities and ribs by K Bala Subrahmanyam, Pritam Das and Aparesh Datta in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
“Why post more pictures if no one is looking at them?” Parents’ perception of the Facebook Like in sharenting
No full textThis paper reports on findings from an exploratory investigation about parents’ perceived role of the Facebook Like in sharenting (i.e., sharing about their children on social media) by drawing on the qualitative results of an online survey. Findings show that the majority of participants think that getting a Like on a picture of one’s child can encourage a parent to share more about him/ her because of two main understandings of this paralinguistic cue: the Like as a received validation of one’s parenting, or as a metric of connection with important people, causing emo- tional reactions in the receivers. Several parents, though, judge the Like as more commonly being important for others, explain- ing this difference in terms of internal characteristics. This study aims to extend our understanding of the motivations behind sharenting by taking into account the role of the Like in this practice and highlighting how parents position themselves in such an exchange of digital photo-sharing and feedback. As communication does not happen in a vacuum, we advance that research on parents’ photo-sharing behavior online may benefit from considering whether and how social media liking can foster and shape interpersonal communication between posters and recipients
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs
Get PDFA Conflict-Free Open Neighborhood coloring, abbreviated CFON^* coloring, of a graph G = (V,E) using k colors is an assignment of colors from a set of k colors to a subset of vertices of V(G) such that every vertex sees some color exactly once in its open neighborhood. The minimum k for which G has a CFON^* coloring using k colors is called the CFON^* chromatic number of G, denoted by χ_{ON}^*(G). The analogous notion for closed neighborhood is called CFCN^* coloring and the analogous parameter is denoted by χ_{CN}^*(G). The problem of deciding whether a given graph admits a CFON^* (or CFCN^*) coloring that uses k colors is NP-complete. Below, we describe briefly the main results of this paper.
- For k ≥ 3, we show that if G is a K_{1,k}-free graph then χ_{ON}^*(G) = O(k²log Δ), where Δ denotes the maximum degree of G. Dębski and Przybyło in [J. Graph Theory, 2021] had shown that if G is a line graph, then χ_{CN}^*(G) = O(log Δ). As an open question, they had asked if their result could be extended to claw-free (K_{1,3}-free) graphs, which are a superclass of line graphs. Since it is known that the CFCN^* chromatic number of a graph is at most twice its CFON^* chromatic number, our result positively answers the open question posed by Dębski and Przybyło.
- We show that if the minimum degree of any vertex in G is Ω(Δ/{log^ε Δ}) for some ε ≥ 0, then χ_{ON}^*(G) = O(log^{1+ε}Δ). This is a generalization of the result given by Dębski and Przybyło in the same paper where they showed that if the minimum degree of any vertex in G is Ω(Δ), then χ_{ON}^*(G)= O(logΔ).
- We give a polynomial time algorithm to compute χ_{ON}^*(G) for interval graphs G. This answers in positive the open question posed by Reddy [Theoretical Comp. Science, 2018] to determine whether the CFON^* chromatic number can be computed in polynomial time on interval graphs.
- We explore biconvex graphs, a subclass of bipartite graphs and give a polynomial time algorithm to compute their CFON^* chromatic number. This is interesting as Abel et al. [SIDMA, 2018] had shown that it is NP-complete to decide whether a planar bipartite graph G has χ_{ON}^*(G) = k where k ∈ {1, 2, 3}
Surface modification of sol gel TiO2 surface with sputtered metallic silver for Sun light photocatalytic activity: Initial studies
No full text- …
