Patent Filed, Commercialized & Granted Data
Total Page：16
File Type：pdf, Size：1020Kb
Load more
Recommended publications
-
TWAS an Rep IMP
annual re2p0or1t 0 TWAS, the academy of sciences for the developing world, is an autonomous international organization that promotes scientific capacity and excellence in the South. Founded in 1983 by a group of eminent scientists under the leadership of the late Nobel laureate Abdus Salam of Pakistan, TWAS was officially launched in Trieste, Italy, in 1985, by the secretary-general of the United Nations. TWAS has nearly 1,000 members from over 90 countries. More than 80% of its members are from developing countries. A 13-member council directs the Academy activities. A secretariat, headed by an executive director, coordinates the programmes. The Academy’s secretariat is located on the premises of the Abdus Salam International Centre for Theoretical Physics (ICTP) in Trieste, Italy. TWAS’s administration and finances are overseen by the United Nations Educational, Scientific and Cultural Organization (UNESCO) in accordance with an agreement signed by the two organizations. The Italian government provides a major portion of the Academy’s funding. The main objectives of TWAS are to: • Recognize, support and promote excellence in scientific research in the developing world; • Respond to the needs of young researchers in science and technology- lagging developing countries; • Promote South-South and South-North cooperation in science, technology and innovation; • Encourage scientific research and sharing of experiences in solving major problems facing developing countries. To help achieve these objectives, TWAS collaborates with a number of organizations, most notably UNESCO, ICTP and the International Centre for Biotechnology and Genetic Engineering (ICGEB). academy of sciences for the developing world TWAS COUNCIL President Jacob Palis (Brazil) Immediate Past President C.N.R. -
Design Programme Indian Institute of Technology Kanpur
Design Programme Indian Institute of Technology Kanpur Contents Overview 01- 38 Academic 39-44 Profile Achievements 45-78 Design Infrastructure 79-92 Proposal for Ph.D program 93-98 Vision 99-104 01 ew The design-phase of a product is like a womb of a mother where the most important attributes of a life are concieved. The designer is required to consider all stages of a product-life like manufacturing, marketing, maintenance, and the disposal after completion of product life-cycle. The design-phase, which is based on creativity, is often exciting and satisfying. But the designer has to work hard worrying about a large number of parameters of man. In Indian context, the design of products is still at an embryonic stage. The design- phase of a product is often neglected in lieu of manufacturing. A rapid growth of design activities in India is a must to bring the edge difference in the world of mass manufacturing and mass accessibility. The start of Design Programme at IIT Kanpur in the year 2001, is a step in this direction. overvi The Design Program at IIT-Kanpur was established with the objective of advancing our intellectual and scientific understanding of the theory and practice of design, along with the system of design process management and product semantics. The programme, since its inception in 2002, aimed at training post-graduate students in the technical, aesthetic and ergonomic practices of the field and to help them to comprehend the broader cultural issues associated with contemporary design. True to its interdisciplinary approach, the faculty members are from varied fields of engineering like mechanical, computer science, bio sciences, electrical and chemical engineering and humanities. -
Thesis Title
Exp(n+d)-time Algorithms for Computing Division, GCD and Identity Testing of Polynomials A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of Master of Technology by Kartik Kale Roll No. : 15111019 under the guidance of Prof. Nitin Saxena Department of Computer Science and Engineering Indian Institute of Technology Kanpur June, 2017 Abstract Agrawal and Vinay showed that a poly(s) hitting set for ΣΠaΣΠb(n) circuits of size s, where a is !(1) and b is O(log s) , gives us a quasipolynomial hitting set for general VP circuits [AV08]. Recently, improving the work of Agrawal and Vinay, it was showed that a poly(s) hitting set for Σ ^a ΣΠb(n) circuits of size s, where a is !(1) and n, b are O(log s), gives us a quasipolynomial hitting set for general VP circuits [AFGS17]. The inputs to the ^ gates are polynomials whose arity and total degree is O(log s). (These polynomials are sometimes called `tiny' polynomials). In this thesis, we will give a new 2O(n+d)-time algorithm to divide an n-variate polynomial of total degree d by its factor. Note that this is not an algorithm to compute division with remainder, but it finds the quotient under the promise that the divisor completely divides the dividend. The intuition behind allowing exponential time complexity here is that we will later apply these algorithms on `tiny' polynomials, and 2O(n+d) is just poly(s) in case of tiny polynomials. We will also describe an 2O(n+d)-time algorithm to find the GCD of two n-variate polynomials of total degree d. -
Downloaded 2021-09-25T22:20:55Z
Provided by the author(s) and University College Dublin Library in accordance with publisher policies. Please cite the published version when available. Title Realistic Computer Models Authors(s) Ajwani, Deepak; Meyerhenke, Henning Publication date 2010-01-01 Publication information Muller-Hannemann, M., Schirra, S. (eds.). Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice Series Lecture Notes in Computer Science (LNCS, volume 5971) Publisher Springer Item record/more information http://hdl.handle.net/10197/9901 Publisher's statement The final publication is available at www.springerlink.com. Publisher's version (DOI) 10.1007/978-3-642-14866-8_5 Downloaded 2021-09-25T22:20:55Z The UCD community has made this article openly available. Please share how this access benefits you. Your story matters! (@ucd_oa) © Some rights reserved. For more information, please see the item record link above. Chapter 5. Realistic Computer Models Deepak Ajwani ⋆ and Henning Meyerhenke ⋆⋆ 5.1 Introduction Many real-world applications involve storing and processing large amounts of data. These data sets need to be either stored over the memory hierarchy of one computer or distributed and processed over many parallel computing devices or both. In fact, in many such applications, choosing a realistic computation model proves to be a critical factor in obtaining practically acceptable solutions. In this chapter, we focus on realistic computation models that capture the running time of algorithms involving large data sets on modern computers better than the traditional RAM (and its parallel counterpart PRAM) model. 5.1.1 Large Data Sets Large data sets arise naturally in many applications. We consider a few examples here. -
Win the Cyber War
PROGRAM PARTNER Become a Cyber Security Expert Win the Cyber War Advanced Certification Program in Cyber Security and Cyber Defense Build world-class expertise in Cyber Security. The Advanced Certification Program in Cyber Security and Cyber Defense by IIT Kanpur, in association with TalentSprint, is designed for current and aspiring professionals who are keen to explore and exploit the latest trends in Cyber Security Technologies. A combination of deep academic rigor and intense practical approach will allow participants to master in-demand skills and build world class expertise. C3i Advantage Master Mentors Experiential Learning Experience C3i, India’s Learn from experts globally Master state-of- art skills by leading Cyber Security recognized for contribution to Cyber combining deep formal rigor research center at IIT Kanpur Security and Cyber Defense and intense practical approach Global Certification Peer Networking Get certified by IIT Kanpur, a Join the elite community of top global trailblazer in Computer Cyber Security professionals, Science Research and Education practitioners and researchers 3 IIT Kanpur, global trailblazer in Computer Science Research and Education IIT Kanpur, established in 1959, is one of the premier institutions in Computer Science education and research with an aim to provide leadership in technological innovation. As the technology innovation hub will enable us to hire more researchers, engineers, faculty, postdoctoral fellows, visiting faculty – we believe further such programs targeted not only for executives in IT companies, but also utility engineers, and government/defense sector can be launched. Ranked among top engineering colleges by NIRF 2019. Hosts C3i - India’s leading Research Centre in Cyber Security of Cyber Physical Systems Collaborates with global centers of excellence (Israel and USA) in Cyber Security Built on World-class Academic Research Culture 4 Faculty Experts at the cutting-edge of Cyber Security research Dr. -
A Super-Quadratic Lower Bound for Depth Four Arithmetic
A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits Nikhil Gupta Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India [email protected] Chandan Saha Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India [email protected] Bhargav Thankey Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India [email protected] Abstract We show an Ωe(n2.5) lower bound for general depth four arithmetic circuits computing an explicit n-variate degree-Θ(n) multilinear polynomial over any field of characteristic zero. To our knowledge, and as stated in the survey [88], no super-quadratic lower bound was known for depth four circuits over fields of characteristic 6= 2 before this work. The previous best lower bound is Ωe(n1.5) [85], which is a slight quantitative improvement over the roughly Ω(n1.33) bound obtained by invoking the super-linear lower bound for constant depth circuits in [73, 86]. Our lower bound proof follows the approach of the almost cubic lower bound for depth three circuits in [53] by replacing the shifted partials measure with a suitable variant of the projected shifted partials measure, but it differs from [53]’s proof at a crucial step – namely, the way “heavy” product gates are handled. Loosely speaking, a heavy product gate has a relatively high fan-in. Product gates of a depth three circuit compute products of affine forms, and so, it is easy to prune Θ(n) many heavy product gates by projecting the circuit to a low-dimensional affine subspace [53,87]. -
January 2013
January1 of 91. 2013 International affairs: US President Barack Obama on 31 January, has come out with his much-awaited comprehensive immigration reforms, that will pave the way for legalization of more than 11 million undocumented immigrants. The reforms, which also propose to eliminate the annual country caps in the employment category, are expected to benefit large number of Indian technocrats and professionals. In a major policy speech on comprehensive immigration in Las Vegas, Obama urged the Congress to act on his proposals. The other key proposals of his "comprehensive" reform plan include "stapling" a green card to the diplomas of science, technology, engineering and mathematics (STEM), PhD and Masters Degree graduates from qualified US universities who have found employment in the country. The President also proposed to create a startup visa for job-creating entrepreneurs. The proposal allows foreign entrepreneurs, who attract financing or revenue from American investors and customers, to start and grow their businesses in the US, and to remain permanently if their companies grow further, create jobs for American workers, and strengthen the economy. The proposal removes the backlog for employment-sponsored immigration by eliminating annual country caps and adding additional visas to the system. Outdated legal immigration programs are reformed to meet current and future demands by exempting certain categories from annual visa limitations, the White House said. Obama also proposed to eliminate existing backlogs in the family-sponsored immigration system by recapturing unused visas and temporarily increasing annual visa numbers. The proposal also raises existing annual country caps from seven per cent to 15 per cent for the family-sponsored immigration system. -
Algorithms for the Multiplication Table Problem
ALGORITHMS FOR THE MULTIPLICATION TABLE PROBLEM RICHARD BRENT, CARL POMERANCE, DAVID PURDUM, AND JONATHAN WEBSTER Abstract. Let M(n) denote the number of distinct entries in the n×n multi- plication table. The function M(n) has been studied by Erd}os,Tenenbaum, Ford, and others, but the asymptotic behaviour of M(n) as n ! 1 is not known precisely. Thus, there is some interest in algorithms for computing M(n) either exactly or approximately. We compare several algorithms for computing M(n) exactly, and give a new algorithm that has a subquadratic running time. We also present two Monte Carlo algorithms for approximate computation of M(n). We give the results of exact computations for values of n up to 230, and of Monte Carlo computations for n up to 2100;000;000, and compare our experimental results with Ford's order-of-magnitude result. 1. Introduction Although a multiplication table is understood by a typical student in elementary school, there remains much that we do not know about such tables. In 1955, Erd}os studied the problem of counting the number M(n) of distinct products in an n × n multiplication table. That is, M(n) := jfij : 1 ≤ i; j ≤ ngj. In [12], Erd}osshowed that M(n) = o(n2). Five years later, in [13], he obtained n2 (1) M(n) = as n ! 1; (log n)c+o(1) where (here and below) c = 1 − (1 + log log 2)= log 2 ≈ 0:086071. In 2008, Ford [15, 16] gave the correct order of magnitude (2) M(n) = Θ(n2=Φ(n)); where (3) Φ(n) := (log n)c(log log n)3=2 is a slowly-growing function.1 Note that (2) is not a true asymptotic formula, as M(n)=(n2=Φ(n)) might or might not tend to a limit as n ! 1. -
Shanti Swarup Bhatnagar Prize: an Inspiration for International Recognitions – III
CORRESPONDENCE Problems of school science education in India Subramaniam1 has brought into focus the stream3. One of the reasons was the poor suffer from the malady of poor quality of symbiotic relationship between school quality of science teachers who were not teacher orientation in science subjects. education and the university system. He qualified to teach science at high-school Subramaniam1 has also pointed out deplores the minor role played by Indian level. There were very few teacher train- discrepancies and suggested some reme- universities in the promotion of science ing colleges in Punjab and the stress was dial measures: ‘The rapid growth of a education: ‘experience from around the on pedagogy rather than the subject con- separate professional stream of education world indicates that the quality of educa- tent in teacher training. This situation has in isolation from the university, is prone tion depends critically on having well changed and teacher education has to commercialization with its attendant prepared and motivated teachers. The expanded massively over the last few loss of quality and integrity. Second, or- role of the universities in school educa- decades, most of this expansion (almost ganic links with university-based knowl- tion is generally thought to be the prepa- 90%) being in the private sector without edge disciplines are vital to introducing ration of school teachers. However, any regulatory body to control and main- innovation in teacher education, as in universities and research institutions in tain the -
2019-20-English
The Institute of Mathematical Sciences Annual Report & Audited Statement of Accounts 1 March 2019- April 2020 The Institute of Mathematical Sciences Chennai Annual Report and Audited Statement of Accounts April 2019 - March 2020 Telephone: +91-44-2254 3100, 2254 1856 Website: https://www.imsc.res.in/ Fax: +91-44-2254 1586 DID No.: +91-44-2254 3xxx(xxx=extension) 2 Director’s Note Director’s Note I am happy to present the annual report of the Institute for 2019-2020 and put forth the distinctive achievements of its members during the year along with a perspective for the future. During the period April 2019 - March 2020, there were 144 students pursuing their PhD and 42 scholars pursuing their post-doctoral programme at IMSc. Spread through this period, the Institute organized or co-sponsored several workshops and conferences. The First IMSc discussion meeting on extreme QCD matter held during September 16 - 21, 2019 brought together senior scientists to deliver a set of pedagogic lectures on the current state-of-the-art, open problems and challenges in the area of hot and dense QCD matter. The annual meeting of the International Pulsar Timing Array (IPTA) was organized during June 10 - 21, 2019 by its Indian arm, of which IMSc is a part. An NCM sponsored workshop on Combinatorial Models for Representation Theory was organised in IMSc during November 4 - 16, 2019 and saw active participation from Ph.D students and postdocs from across the country. An ACM-India Summer School on Graphs and Graph Algorithms and a meeting on Recent Trends in Algorithms were both organised during the year. -
Poly-Time Blackbox Identity Testing for Sum of Log-Variate Constant-Width Roabps
Poly-time blackbox identity testing for sum of log-variate constant-width ROABPs Pranav Bisht ∗ Nitin Saxena † Abstract Blackbox polynomial identity testing (PIT) affords ‘extreme variable-bootstrapping’ (Agrawal et al, STOC’18; PNAS’19; Guo et al, FOCS’19). This motivates us to study log-variate read-once oblivious algebraic branching programs (ROABP). We restrict width of ROABP to a constant and study the more general sum-of-ROABPs model. We give the first poly(s)-time blackbox PIT for sum of constant-many, size-s, O(log s)-variate constant-width ROABPs. The previous best for this model was quasi-polynomial time (Gurjar et al, CCC’15; CC’16) which is comparable to brute-force in the log-variate setting. Also, we handle unbounded-many such ROABPs if each ROABP computes a homogeneous polynomial. Our new techniques comprise– (1) an ROABP computing a homogeneous polynomial can be made syntactically homogeneous in the same width; and (2) overcome the hurdle of unknown variable order in sum-of-ROABPs in the log-variate setting (over any field). 2012 ACM CCS concept: Theory of computation– Algebraic complexity theory, Fixed parameter tractability, Pseudorandomness and derandomization; Computing methodologies– Algebraic algorithms; Mathematics of computing– Combinatoric problems. Keywords: identity test, hitting-set, ROABP, blackbox, log variate, width, diagonal, derandom- ization, homogeneous, sparsity. 1 Introduction Polynomial Identity Testing (PIT) is the problem of testing whether a given multivariate polynomial is identically zero or not. The input polynomial to be tested is usually given in a compact representation– like an algebraic circuit or an algebraic branching program (ABP). -
Indian Roots of Cryptography
Algologic Technical Report # 2/2013 The Indian roots of cryptography S. Parthasarathy [email protected] Ref.: newcryptoroots.tex Ver. code: 20190123a Keywords : Alice, Bob, Sita, Rama, Vatsyayana, Kamasutra, Hemachan- dra, Fibonacci, Hindu, Arab, Numeral, Ramanujan, Agarwal, AKS, IITK Abstract This note is a sequel to my article [2] about the dramatis personae of cryptography. The article, provoked a world-wide reaction. In fact, a related Google search resulted in over 6 million hits, making me a kind of celebrity ! For those who care to be more reasonable and logical, here is some more evidence to strengthen the proposal I made earlier in my article about Sita and Rama. 1 The Indian roots of cryptography The article [2] about Alice and Bob, talks about the dramatis personae of cryptography, and proposes a much more meaningful alternative. The au- thor came across many situations when contributions by India are unfairly understated or ignored completely by the cryptography community. We take a quick look at some of them. One remarkable exception is the book by Kim Plofker [15], a well-documented book which is free of bias and exaggeration. Most books on cryptography invariably include the Caesar’s cipher as an example of substitution cipher. It is strange that they all ignore, or are unaware of another substitution cipher which was in use a few centuries before Caesar’s cipher. According to [1] Cryptography is recommended in the Kama Sutra (ca 400 BCE) as a way for lovers to communicate without inconvenient discovery. 1 The Signal Corps Association [3], gives an interesting explanation of the kama sutra cipher.