2,277 research outputs found

    Set Membership with Non-Adaptive Bit Probes

    No full text
    We consider the non-adaptive bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by non-adaptively probing the bit vector at t places. Let s_N(m,n,t) be the minimum number of bits of storage needed for such a scheme. In this work, we show existence of non-adaptive and adaptive schemes for a range of t that improves an upper bound of Buhrman, Miltersen, Radhakrishnan and Srinivasan (2002) on s_N(m,n,t). For three non-adaptive probes, we improve the previous best lower bound on s_N(m,n,3) by Alon and Feige (2009)

    Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes

    No full text
    We consider the bit-probe complexity of the set membership problem: represent an n-element subset S of an m-element universe as a succinct bit vector so that membership queries of the form "Is x ∈ S" can be answered using at most t probes into the bit vector. Let s(m,n,t) (resp. s_N(m,n,t)) denote the minimum number of bits of storage needed when the probes are adaptive (resp. non-adaptive). Lewenstein, Munro, Nicholson, and Raman (ESA 2014) obtain fully-explicit schemes that show that s(m,n,t) = ((2^t-1)m^{1/(t - min{2⌊log n⌋, n-3/2})}) for n ≥ 2,t ≥ ⌊log n⌋+1 . In this work, we improve this bound when the probes are allowed to be superlinear in n, i.e., when t ≥ Ω(nlog n), n ≥ 2, we design fully-explicit schemes that show that s(m,n,t) = ((2^t-1)m^{1/(t-{n-1}/{2^{t/(2(n-1))}})}), asymptotically (in the exponent of m) close to the non-explicit upper bound on s(m,n,t) derived by Radhakrishan, Shah, and Shannigrahi (ESA 2010), for constant n. In the non-adaptive setting, it was shown by Garg and Radhakrishnan (STACS 2017) that for a large constant n₀, for n ≥ n₀, s_N(m,n,3) ≥ √{mn}. We improve this result by showing that the same lower bound holds even for storing sets of size 2, i.e., s_N(m,2,3) ≥ Ω(√m)

    Bactrocera (Bactrocera) digressa Radhakrishnan, s.str.

    No full text
    Bactrocera (Bactrocera) digressa Radhakrishnan Bactrocera (Bactrocera) digressa Radhakrishnan, 1999. Rec.Zool.Surv. India, 97(4):1. Holotype ♀. India (Tamil Nadu: Salem dist., Shevroy Hills, Semmanathan) (ZSI) [not examined] Bactrocera (Daculus) yercaudiae Drew, 2002. Raffles Bull.Zool., 50(2): 346. Holotype ♂. India (Tamil Nadu: Yercaud, 15 Km from Yercaud) (BMNH) [not examined]; syn.nov. Material examined INDIA: Karnataka: 11 ♂, Bangalore, 916m, 10.vii.1989, S. Ramani; 2 ♂, same data except 11.vii.1989; 1 ♂, same data except 4.ii.1989; 2 ♂, same data except 3.vii.1988, G. Bhat; 3 ♂, Bangalore, Hessaraghatta, 916m, 14.iii.1987, G. Bhat; 3 ♂ same data except 23.i.1988; 2 ♂ same data except 9.vii.1988; 2 ♂, 1♀, Bangalore, GKVK, 4.ii.2008, David, K. J.; 1 ♂, same data except 20.i.2008; 1 ♂, same data except 8.vi.2008, Sudha, M.; 1 ♂, Gouribidanur, 29.vi.2009, Praveen; 1 ♂, Mandya, 24-30.vii.1989, Gubbaiah; 2 ♂, Tamil Nadu, Yercaud, 3.vii.1992, S. Ramani (UASB); 2 ♀, Karnataka, Gowribidanur, Kolar, 23.vii.07, Naveen Kumar (NBAII). Radhakrishnan (1999) described Bactrocera digressa based on two females collected from Salem district, Tamil Nadu. The diagnostic characters of the species are reddish brown scutum, bifid aculeus tip, absence of acrostichal and anterior supra-alar setae. Later, Drew and Raghu (2002) described Bactrocera (Daculus) yercaudiae based on males collected from Yercaud, Tamil Nadu and Bangalore which responded to cue lure. Perusal of original description of the two species showed complete congruence of characters except costal band, which was mentioned as confluent with vein R 2+ 3 in Bactrocera digressa and slightly overlapping R in B. yercaudiae. Material mentioned above which were keyed out as Bactrocera yercaudiae were examined to confirm the identity. Examination of aculeus tip of the females revealed that it has a bifid aculeus and all the characters are in concordance with that of B. digressa except for a slightly overlapping costal band which might have been overlooked by Radhakrishnan (1999) because it is very faint beyond vein R 2+3. Hence we propose B. yercaudiae as a junior synonymn of B. digressa. Since all the Asian species in subgenus Daculus are aberrant Bactrocera s.str. and true Daculus are African, B. digressa is retained in subgenus Bactrocera (Copeland et al., 2004). As per ICZN rules, Bactrocera digressa Radhakrishnan is the valid name. Three females have been reared from fruits of Alangium lamarkii collected from Yercaud, Tamil Nadu and are deposited in BMNH (Ian M. White, pers. comm.)Published as part of David, K. J. & Ramani, S., 2011, An illustrated key to fruit flies (Diptera: Tephritidae) from Peninsular India and the Andaman and Nicobar Islands, pp. 1-31 in Zootaxa 3021 on page 1

    Platessa arborea C. Radhakrishnan, S. Sherly & B. Karthick 2022, sp. nov.

    No full text
    Platessa arborea C. Radhakrishnan, S. Sherly & B. Karthick sp. nov. (Figs 1–67, Fig. 9 represents the holotype) LM Description (Figs 1–60):—Valve elliptical with narrowly rounded apices. Raphe-sternum valve (RSV): Length: 6.5–9.5 µm, width: 3.5–4.5 µm, ratio length/width: 1.6–2.2 (n = 60). Axial area narrow and hardly discernible, visible only near center of the valve; central area nearly rectangular shape, bordered by 2–3 shorter striae frequently more widely spaced. Striae radiate throughout the valve, 22–24 in 10 µm. Raphe slightly filiform expanded proximal raphe endings. Sternum valve (SV): wide axial area, Length: 6.0–9.0 µm, width: 3.5–4.5 µm. Striae densely arranged 22–24 in 10 µm, parallel at centre, radiate towards apices. SEM Description (Figs 61–67):—Raphe-sternum valve (RSV): Externally, raphe filiform, slight curvature found near ends (Figs 61 & 63). Proximal raphe ends positioned in a broadened shallow groove, distal raphe located in the shallow groove with cone-shaped endings, and both ends slightly bend to the same side (Fig. 61). Striae mostly uniseriate; however found biseriate at 2–3 striae near apices. (Fig. 61). Areolae, apically slit-like throughout the valve, only at the center of the valve it is round-shaped towards axial area (Fig. 61). Internally, proximal raphe ends are strongly hooked, a very remarkable feature which is infrequent in other Platessa species, and its distal ends are curved on opposite sides, terminating in well-developed helictoglossae (Figs 64, 65). Striae lowered between raised virgae. Width of the interstriae is wider than the striae. Striae internally rectangular to round in shape and mostly covered with hymen (Figs 64, 65). An apparent depression is observed on the central nodule (Figs 64, 65). Sternum valve (SV), externally, axial area covered with several irregular shape depressions distributed on the surface of the valve (Fig. 62). Striae uniseriate, however, found biseriate at more than 10 striae near the valve mantle (Fig. 62). Interstriae is raised, and the width of striae is unequal (Fig. 62). Internally, axial area is flat and features are not easily visible (Fig. 66). Biseriate striae found near the mantle with hymenated areolae. Interstriae raised its width slightly more than the striae (Fig. 67). Holotype (designated here):—Slide #58/55, Sample #2878; deposited at the Diatom Collection, Agharkar Research Institute Herbarium (AHMA), Pune, India. Type locality:— INDIA, Sikkim, composite tree moss sample collected on 22 November 2019 on the way to Khecheopalri Lake, West Sikkim district (27.34829 °N, 88.19187 °E; elevation 1794 m a.s.l.) by Radhakrishnan Cheran. Etymology:—Named after the habitat (tree) on which it was found. In Latin, the tree is called an Arbor.Published as part of Sherly, Sheena, Radhakrishnan, Cheran & Karthick, Balasubramanian, 2022, Platessa arborea sp. nov. (Bacillariophyceae): A new tree moss dwelling diatom from the Eastern Himalayas, India, pp. 151-158 in Phytotaxa 552 (2) on pages 152-153, DOI: 10.11646/phytotaxa.552.2.2, http://zenodo.org/record/669098

    Set Membership with Two Classical and Quantum Bit Probes

    No full text
    We study the classical and quantum bit-probe versions of the static set membership problem : Given a subset, S (|S| ≤ n) of a universe, (|| = m ≫ n), represent it as a binary string in memory so that the query "Is x in S?" (x ∈ ) can be answered by making at most t probes into the string. Let s_{A}(m,n,t) denote the minimum length of the bit string in any scheme that solves this static set membership problem. We show that for n ≥ 4 s_A(m,n,t = 2) = (m^{1-1/(n-1)}) (if n = 0 (mod 3)); (m^{1-1/n}) (if n = 1,2 (mod 3)); (m^{6/7}) (if n = 8,9). These bounds are shown using a common scheme that is based on a graph-theoretic observation on orienting the edges of a graph of high girth. For all n ≥ 4, these bounds substantially improve on the previous best bounds known for this problem, some of which required elaborate constructions [Mirza Galib Anwarul Husain Baig and Deepanjan Kesh, 2020]. Our schemes are explicit. A lower bound of the form s_A(m,n,2) = Ω(m^{1-1/⌊{n/4}⌋}) was known for this problem. We show an improved lower bound of s_A(m,n,2) = Ω(m^{1-2/(n+3)}); this bound was previously known only for n = 3,5 [Mirza Galib Anwarul Husain Baig and Deepanjan Kesh, 2020; Mirza Galib Anwarul Husain Baig et al., 2019; Mirza Galib Anwarul Husain Baig and Deepanjan Kesh, 2018; Mirza Galib Anwarul Husain Baig et al., 2019; Mirza Galib Anwarul Husain Baig and Deepanjan Kesh, 2020]. We consider the quantum version of the problem, where access to the bit-string b ∈ {0,1}^s is provided in the form of a quantum oracle that performs the transformation _b: |i⟩ ↦ (-1)^{b_i} |i⟩. Let s_Q(m,n,2) denote the minimum length of the bit string that solves the above set membership problem in the quantum model (with adaptive queries but no error). We show that for all n ≤ m^{1/8}, we have s_{QA}(m,n,2) = (m^{7/8}). This upper bound makes crucial use of Nash-William’s theorem [Diestel, 2005] for decomposing a graph into forests. This result is significant because, prior to this work, it was not known if quantum schemes yield any advantage over classical schemes. We also consider schemes that make a small number of quantum non-adaptive probes. In particular, we show that the space required in this case, s_{QN}(m,n = 2,t = 2) = O(√m) and s_{QN}(m,n = 2,t = 3) = O(m^{1/3}); in contrast, it is known that two non-adaptive classical probes yield no savings. Our quantum schemes are simple and use only the fact that the XOR of two bits of memory can be computed using just one quantum query to the oracle

    Introduction : Handbook of Prawns

    No full text
    The suborder Dendrobranchiata constitute a diverse group of marine decapods with over 533 species under 68 genera ( De Grave and Fransen, 2011). Globally distributed, and inhabiting both shallow waters and abyssal zones below 5000 m, they occupy different trophic levels of the food chain at various water depths in the ocean (Pérez Farfante and Kensley, 1997). This group includes most of the prawns of high economic value that account for over one-third of the annual wild crustacean catch (FAO, 2009)

    Need for a national epilepsy control program

    No full text
    This article briefly outlines the proposed national epilepsy control program. The content of the article is based on four meetings held by invitation of the Ministry of Health. Invitees by ministry - Drs. D. C. Jain, M. Gourie Devi, V. Saxena, S. Jain, P. Satish. Chandra, M. Gupta, K. Bala, V. Puri, K. S. Anand, S. Gulati, S. Johri, P. S. Chandra, M. Behari, K. Radhakrishnan, D. Bachani. Presentations were made by Dr. M. Tripathi.The program will involve all neurologists across the country in teaching and training at state levels and a central monitoring committee

    Proprotein Convertases Process and Thereby Inactivate Formylglycine-generating Enzyme

    No full text
    Ennemann E, Radhakrishnan K, Mariappan M, et al. Proprotein Convertases Process and Thereby Inactivate Formylglycine-generating Enzyme. Journal of Biological Chemistry. 2013;288(8):5828-5839.Formylglycine-generating enzyme (FGE) post-translationally converts a specific cysteine in newly synthesized sulfatases to formylglycine (FGly). FGly is the key catalytic residue of the sulfatase family, comprising 17 nonredundant enzymes in human that play essential roles in development and homeostasis. FGE, a resident protein of the endoplasmic reticulum, is also secreted. A major fraction of secreted FGE is N-terminally truncated, lacking residues 34-72. Here we demonstrate that this truncated form is generated intracellularly by limited proteolysis mediated by proprotein convertase(s) (PCs) along the secretory pathway. The cleavage site is represented by the sequence RYSR72 down arrow, a motif that is conserved in higher eukaryotic FGEs, implying important functionality. Residues Arg-69 and Arg-72 are critical because their mutation abolishes FGE processing. Furthermore, residues Tyr-70 and Ser-71 confer an unusual property to the cleavage motif such that endogenous as well as overexpressed FGE is only partially processed. FGE is cleaved by furin, PACE4, and PC5a. Processing is disabled in furin-deficient cells but fully restored upon transient furin expression, indicating that furin is the major protease cleaving FGE. Processing by endogenous furin occurs mostly intracellularly, although also extracellular processing is observed in HEK293 cells. Interestingly, the truncated form of secreted FGE no longer possesses FGly-generating activity, whereas the unprocessed form of secreted FGE is active. As always both forms are secreted, we postulate that furin-mediated processing of FGE during secretion is a physiological means of higher eukaryotic cells to regulate FGE activity upon exit from the endoplasmic reticulum
    corecore