ISI Digital Commons (Indian Statistical Institute )
Not a member yet
7571 research outputs found
Sort by
Diversity and Distribution of Soil and Plant Nematodes in Mizoram, India
No full textThis study aimed to investigate the nematode diversity in various cropping systems across five districts (Aizawl, Kolasib, Mamit, Serchhip and Champhai) of Mizoram, India. The study revealed the presence of 11 nematode orders, encompassing 35 families and 70 genera. Among the 70 genera, 14 belong to the order Tylenchida, 2 to Aphelenchida, 26 to Dorylaimida, 1 to Mononchida, 15 to Rhabditida, 3 to Araeolaimida, 1 to Monhysterida, 4 to Triplonchida, 2 to Enoplida, 2 to Plectida, and 1 to Isolaimiida. Important plant parasitic nematode (PPN) genera included Meloidogyne (M. incognita, M. javanica), Pratylenchus (P. coffeae, P. zeae), Rotylenchulus (R. reniformis), Hirschmanniella (H. oryzae, H. mucronata), Tylenchorhynchus (T. mashhoodi), Helicotylenchus (H. dihystera, H. multicinctus), Hoplolaimus (H. indicus), Criconemoides, Hemicriconemoides, Xiphinema, and Longidorus. The distribution of economically important PPNs was visualized using a thematic spatial distribution map along with the population density of nematode abundance. Our study demonstrates that root-knot nematodes could be a potential threat to the vegetable cropping system in Mizoram. To our knowledge, this study will generate baseline information on economically important PPNs, which could help assess biological soil health scenarios, and identify the likely risk of growing crops in the area
Eigenfunctions of the Laplacian Satisfying Hardy-Type Estimates on Homogeneous Trees
No full textThis work deals with the characterization of eigenfunctions of the Laplacian L on a homogeneous tree X, which satisfy certain growth conditions. More precisely, we shall prove that the Poisson transform on X provides an one-to-one correspondence between the subspace of all Hardy-type eigenfunctions of L on X and the Lebesgue spaces (possibly the set of all complex measures) on the boundary of X
Evaluating AI literacy proficiency among LIS researchers in ASEAN
No full textPurpose: This paper aims to investigate AI literacy proficiency among LIS researchers in Association of Southeast Asian Nations (ASEAN) countries. This study also aims to assess current proficiency levels, identify challenges and gaps, explore recommendations for improving skills and examine how researchers stay updated on AI advancements. Design/methodology/approach: A structured questionnaire was used to collect data, then analysed using appropriate statistical methods. Findings: Most respondents showed proficiency in various aspects of AI literacy for LIS research. However, some aspects, such as understanding AI concepts, ethical considerations and programming skills, had lower proficiency levels. Factors influencing AI literacy included limited resources for enhancement, lack of awareness and insufficient AI-related courses in LIS education. Originality/value: This study presents an original assessment of AI literacy proficiency among LIS researchers in ASEAN countries, shedding light on the current state of AI knowledge in the region’s library and information science field. The findings identify specific gaps and challenges, offering valuable insights for policymakers, educators and stakeholders seeking to enhance AI literacy skills in this context
Explicit evaluation of triple convolution sums of the divisor functions
No full textIn this paper, we use the theory of modular forms and give a general method to obtain the convolution sums (Formula presented) for odd integers r1, r2, r3 ≥ 1, and d1, d2, d3, n ∈ N, where σr(n) is the sum of the rth powers of the positive divisors of n. We consider four cases, namely (i) r1 = r2 = r3 = 1, (ii) r1 = r2 = 1; r3 ≥ 3 (iii) r1 = 1; r2, r3 ≥ 3 and (iv) r1, r2, r3 ≥ 3, and give explicit expressions for the respective convolution sums. We provide several examples of these convolution sums in each case and further use these formulas to obtain explicit formulas for the number of representations of a positive integer n by certain positive definite quadratic forms. The existing formulas for W1,1,1(n) (in [20]), W1,1,2(n), W1,2,2(n), W1,2,4(n) (in [7]), W1,1,11,3,3(n), W1,1,31,3,3(n), W1,3,31,3,3(n), W3,1,11,3,3(n), W3,3,11,3,3(n) (in [35]), Wd1,d2,d3(n), lcm(d1, d2, d3) ≤ 6 (in [30]) and lcm(d1, d2, d3) = 7, 8, 9 (in [31]), which were all obtained by using the theory of quasimodular forms, follow from our method
Finding Complete Impossible Differential Attacks on AndRX Ciphers and Efficient Distinguishers for ARX Designs
No full textThe impossible differential (ID) attack is one of the most important cryptanalytic techniques for block ciphers. There are two phases to finding an ID attack: searching for the distinguisher and building a key recovery upon it. Previous works only focused on automated distinguisher discovery, leaving key recovery as a manual post-processing task, which may lead to a suboptimal final complexity. At EUROCRYPT 2023, Hadipour et al. introduced a unified constraint programming (CP) approach based on satisfiability for finding optimal complete ID attacks in strongly aligned ciphers. While this approach was extended to weakly-aligned designs like PRESENT at ToSC 2024, its application to ARX and AndRX ciphers remained as future work. Moreover, this method only exploited ID distinguishers with direct contradictions at the junction of two deterministic transitions. In contrast, some ID distinguishers, particularly for ARX and AndRX designs, may not be detectable by checking only the existence of direct contradictions. This paper fills these gaps by extending Hadipour et al.’s method to handle indirect contradictions and adapting it for ARX and AndRX designs. We also present a similar method for identifying zero-correlation (ZC) distinguishers. Moreover, we extend our new model for finding ID distinguishers to a unified optimization problem that includes both the distinguisher and the key recovery for AndRX designs. Our method improves ID attacks and introduces new distinguishers for several ciphers, such as SIMON, SPECK, Simeck, ChaCha, Chaskey, LEA, and SipHash. For example, we achieve a one-round improvement in ID attacks against SIMON-64-96, SIMON-64-128, SIMON-128-128, SIMON-128-256 and a two-round improvement against SIMON-128-192. These results significantly contribute to our understanding of the effectiveness of automated tools in the cryptanalysis of different design paradigms
Fractional parts of generalized polynomials at prime arguments
No full textLet f(X) be a monic polynomial of degree d≥2 with real coefficients. In this paper, we obtain an upper bound for the discrepancy of the sequence ([f(p)α]β) generated by the generalized polynomial [f(X)α]β, where p runs through the set of all primes and α, β are irrational numbers satisfying certain conditions. We also study the small fractional parts of the sequence ([f(p)α]β) and prove a result analogous to that of Madritsch and Tichy (Theorem 2.3, [13])
Generalized fractional derivatives generated by Dickman subordinator and related stochastic processes
No full textIn this article, convolution-type fractional derivatives generated by Dickman subordinator and inverse Dickman subordinator are discussed. The Dickman subordinator and its inverse are generalizations of stable and inverse stable subordinators, respectively. The series representations of densities of the Dickman subordinator and inverse Dickman subordinator are also obtained, which could be helpful for computational purposes. Moreover, the space and time-fractional Poisson-Dickman processes, space-fractional Skellam Dickman process and non-homogenous Poisson-Dickman process are introduced and their main properties are studied
Generalized welfare lower bounds and strategyproofness in sequencing problems
No full textIn an environment with private information, we study the class of sequencing problems with welfare lower bounds. The “generalized welfare lower bound” represents some of the lower bounds that have been previously studied in the literature. Every agent is offered a protection in the form of a minimum guarantee on their utilities. We provide a necessary and sufficient condition to identify an outcome efficient and strategyproof mechanism that satisfies generalized welfare lower bound. We then characterize the entire class of mechanisms that satisfy outcome efficiency, strategyproofness and generalized welfare lower bound. These are termed as “relative pivotal mechanisms”. Our paper proposes relevant theoretical applications namely; ex-ante initial order, identical costs bound and expected cost bound. We also give insights on the issues of feasibility and/or budget balance