2,109 research outputs found
Bollywood cinema: A critical genealogy
Get PDF"Bollywood" has finally made it to the Oxford English Dictionary. The 2005 edition defines it as: "a name for the Indian popular film industry, based in Bombay. Origin 1970s. Blend of Bombay and Hollywood." The incorporation of the word in the OED acknowledges the strength of a film industry which, with the coming of sound in 1931, has produced some 9,000 films. (This must not be confused with the output of Indian cinema generally, which would be four times more). What is less evident from the OED definition is the way in which the word has acquired its current meaning and has displaced its earlier descriptors (Bombay Cinema, Indian Popular Cinema, Hindi Cinema), functioning, perhaps even horrifyingly, as an "empty signifier" (Prasad) that may be variously used for a reading of popular Indian cinema. The triumph of the term (over the others) is nothing less than spectacular and indicates, furthermore, the growing global sweep of this cinema not just as cinema qua cinema but as cinema qua social effects and national cultural coding. Although Indian film producers in particular, and pockets of Indian spectators generally, continue to feel uneasy with it (the vernacular press came around to using "Bollywood" only reluctantly), its ascendancy has been such that Bombay Dreams (the Andrew Lloyd Weber musical) and the homegrown Merchants of Bollywood both become signifiers of a cultural logic which transcends cinema and is a global marker of Indian modernity. As the Melbourne (March 2006) closing ceremony of the Commonwealth Games showed, Bollywood will be the cultural practice through which Indian national culture will be projected when the games are held in Delhi in 2010. International games (the Olympics, World Cup Soccer, Asian Games, Commonwealth Games, and so on) are often expressions of a nation's own emerging modernity. For India that modernity, in the realm of culture, is increasingly being interpellated by Bollywood
Performance evaluation of concurrency control techniques for database management systems
No full textSIGLELD:D50290/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
TraPS-VarI: Identifying genetic variants altering phosphotyrosine based signalling motifs
Get PDFPatient stratification and individualized therapeutic strategies rely on the established knowledge of genotype-specific molecular and cellular alterations of biological and therapeutic significance. Whilst almost all approved drugs have been developed based on the Reference Sequence protein database (RefSeq), the latest genome sequencing studies establish the substantial prevalence of non-synonymous genetic mutations in the general population, including stop-insertion and frame shift mutations within the coding regions of membrane proteins. While the availability of individual genotypes are becoming increasingly common, the biological and clinical interpretations of mutations among individual genomes is largely lagging behind. Lately, transmembrane proteins of haematopoietic (myeloid and lymphoid) derived immune cells have attracted much attention as important targets for cancer immunotherapies. As such, the signalling properties of haematological transmembrane receptors rely on the membrane-proximal phosphotyrosine based sequence motifs (TBSMs) such as ITAM (immunoreceptor tyrosine-based activation motif), ITIM (immunoreceptor tyrosine-based inhibition motif) and signal transducer and activator of transcription 3 (STAT3)-recruiting YxxQ motifs. However, mutations that alter the coding regions of transmembrane proteins, resulting in either insertion or deletion of crucial signal modulating TBSMs, remains unknown. To conveniently identify individual cell line-specific or patient-specific membrane protein altering mutations, we present the Transmembrane Protein Sequence Variant Identifier (TraPS-VarI). TraPS-VarI is an annotation tool for accurate mapping of the effect of an individual's mutation in the transmembrane protein sequence, and to identify the prevalence of TBSMs. TraPS-VarI is a biologist and clinician-friendly algorithm with a web interface and an associated database browser (https://www.traps-vari.org/)
Interactions between plantations and pastoralists in Himachal Pradesh, 2018
No full textThis data provides information on the migratory routes of Gaddi pastoralists and their relationships to plantations in the Indian state of Himachal Pradesh“Impacts of Afforestation on the Provision of Ecosystem Services to Rural Communities in India (ROSES 15).” National Aeronautics and Space Administration (NASA) Award #NNX17AK14G.Fleischman, Forrest; Ramprasad, Vijay; Joglekar, Abha; Gupta, Ajay Kumar. (2020). Interactions between plantations and pastoralists in Himachal Pradesh, 2018. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/214818
Protein phosphatase 2A inhibits interferon signaling through the Jak STAT pathway and promotes hepatitis C viral replication
Get PDFThe first part of the work demonstrate the role of PP2A in IFN-α induced Jak-STAT1 signaling and HCV replication. We show here that PP2Ac activity is not required for IFN-α induced tyrosine phosphorylation of Jak1/Tyk2 and STAT1. In response to IFN-α induction, PP2Ac associates with Jak1/Tyk2 and STAT1. This association modulates the Jak1/Tyk2 and STAT1 tyrosine phosphorylation. However, this study shows that PP2A activity is required for the HCV replication.
The selective behavior of PP2A for Jak-STAT1 signaling pathway inhibition and promotion of HCV replication could be due to the targeted substrate selection by PP2A holoenzyme complex. In the second part of this work, attempts were made to determine the specific regulatory B subunits involved in IFN-α induced Jak-STAT1 signaling inhibition and HCV replication. We observed the inter-regulatory behavior of PP2A subunits. During the course of this study, due to unavailability of specific antibodies for various isoforms of B subunit, the aim to determine specific holoenzyme complex involved in regulation of Jak-STAT1 signaling and HCV replication was not achieved.
Further studies are required to investigate the specific B subunits and thereby holoenzyme complex responsible for IFN-α induced Jak-STAT signaling inhibition and HCV replication by PP2A
Locally Recoverable Streaming Codes for Packet-Erasure Recovery
No full textStreaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that diagonally embedding codewords of a [τ+1,τ+1-a] Maximum Distance Separable (MDS) code within the packet stream, leads to rate-optimal streaming codes capable of recovering from a arbitrary packet erasures, under a strict decoding delay constraint τ. Thus MDS codes are geared towards the efficient handling of the worst-case scenario corresponding to the occurrence of a erasures. In the present paper, we have an increased focus on the efficient handling of the most-frequent erasure patterns. We study streaming codes which in addition to recovering from a>1 arbitrary packet erasures under a decoding delay τ, have the ability to handle the more common occurrence of a single-packet erasure, while incurring smaller delay r<τ. We term these codes as (a,τ,r) locally recoverable streaming codes (LRSCs), since our single-erasure recovery requirement is similar to the requirement of locality in a coded distributed storage system. We characterize the maximum possible rate of an LRSC by presenting rate-optimal constructions for all possible parameters {a,τ,r}. Although the rate-optimal LRSC construction provided in this paper requires large field size, the construction is explicit. It is also shown that our (a,τ=a(r+1)-1,r) LRSC construction provides the additional guarantee of recovery from the erasure of h, 1 ≤ h ≤ a, packets, with delay h(r+1)-1. The construction thus offers graceful degradation in decoding delay with increasing number of erasures
Using Elimination Theory to construct Rigid Matrices
Get PDFThe rigidity of a matrix for target rank is the minimum number
of entries of that must be changed to ensure that the rank of
the altered matrix is at most . Since its introduction by Valiant
\cite{Val77}, rigidity and similar rank-robustness functions of
matrices have found numerous applications in circuit complexity,
communication complexity, and learning complexity. Almost all \nbyn
matrices over an infinite field have a rigidity of . It is a
long-standing open question to construct infinite families of
\emph{explicit} matrices even with superlinear rigidity when .
In this paper, we construct an infinite family of complex matrices
with the largest possible, i.e., , rigidity. The entries of
an \nbyn matrix in this family are distinct primitive roots of unity
of orders roughly \SL{}. To the best of our knowledge, this is
the first family of concrete (but not entirely explicit) matrices
having maximal rigidity and a succinct algebraic description.
Our construction is based on elimination theory of polynomial
ideals. In particular, we use results on the existence of polynomials
in elimination ideals with effective degree upper bounds (effective
Nullstellensatz). Using elementary algebraic geometry, we prove that
the dimension of the affine variety of matrices of rigidity at
most is exactly . Finally, we use elimination theory to
examine whether the rigidity function is semicontinuous
Multi-level state estimation in an outdoor decentralised sensor network
No full textDecentralised estimation of heterogeneous sensors is performed on an outdoor network. Attributes such as position, appearance, and identity represented by non-Gaussian distributions are used in in the fusion process. It is shown here that real-time decentralised data fusion of non-Gaussian estimates can be used to build rich environmental maps. Human operators are also used as additional sensors in the network to complement robotic information
Planar Maximum Matching: Towards a Parallel Algorithm
Get PDFPerfect matchings in planar graphs have been extensively studied and understood in the context of parallel complexity [P W Kastelyn, 1967; Vijay Vazirani, 1988; Meena Mahajan and Kasturi R. Varadarajan, 2000; Datta et al., 2010; Nima Anari and Vijay V. Vazirani, 2017]. However, corresponding results for maximum matchings have been elusive. We partly bridge this gap by proving:
1) An SPL upper bound for planar bipartite maximum matching search.
2) Planar maximum matching search reduces to planar maximum matching decision.
3) Planar maximum matching count reduces to planar bipartite maximum matching count and planar maximum matching decision.
The first bound improves on the known [Thanh Minh Hoang, 2010] bound of L^{C_=L} and is adaptable to any special bipartite graph class with non-zero circulation such as bounded genus graphs, K_{3,3}-free graphs and K_5-free graphs. Our bounds and reductions non-trivially combine techniques like the Gallai-Edmonds decomposition [L. Lovász and M.D. Plummer, 1986], deterministic isolation [Datta et al., 2010; Samir Datta et al., 2012; Rahul Arora et al., 2016], and the recent breakthroughs in the parallel search for planar perfect matchings [Nima Anari and Vijay V. Vazirani, 2017; Piotr Sankowski, 2018]
Robotic Grasping and Contact: A Review
No full textIn this paper, we survey the field of robotic grasping and the work that has been done in this area over the last two decades, with a slight bias toward the development of the theoretical framework and analytical results in this area
- …
