Ms Niha Dingankar Assistant Professor and Dr Anita Chaware, Head PG Depa
Total Page：16
File Type：pdf, Size：1020Kb
Load more
Recommended publications
-
Computing: 50 Years On
Computing: 50 Years On Mathai Joseph* From a TIFR Alumni Association Public Lecture 27 July 2007 Introduction We may each remember a year for different things: some personal, some related to our work and interests and some for the unusual events that took place. 1957 is probably like any other year in this respect. For many scientists, the launch of the first Sputnik from Baikonur in the then-USSR will be remembered as the event which transformed the race to space and was the stimulus for the man-on-the-moon program that followed in the United States. Physicists may remember the year for the award of the Nobel Prize to Yann Chen Ning and Lee Tsung-Dao, both from China and working respectively at the Institute of Advanced Study, Princeton, and Columbia, for their work on parity laws. We in India may recall that it marked the first full year of operation of the Apsara nuclear reactor at Trombay. And, chess-lovers will certainly remember the year for the remarkable feat by Bobby Fischer in becoming the US chess champion at the age of 14! There were landmarks in computing in 1957. By that time, around 1000 computers had been sold worldwide (none of them in India) and new computer series (with solid-state technology) were announced by the big manufacturers such as IBM, Univac, NCR and Siemens. Development of the integrated circuit was nearing completion in the laboratories of Jack Kilby at Texas Instruments and Robert Noyce at Fairchild. The Fortran programming language was formally published by a team led by John Backus at IBM, marking the start of a great era of programming language development. -
Sun-Earth System Interaction Studies Over Vietnam: an International Cooperative Project
Ann. Geophys., 24, 3313–3327, 2006 www.ann-geophys.net/24/3313/2006/ Annales © European Geosciences Union 2006 Geophysicae Sun-Earth System Interaction studies over Vietnam: an international cooperative project C. Amory-Mazaudier1, M. Le Huy2, Y. Cohen3, V. Doumbia4,*, A. Bourdillon5, R. Fleury6, B. Fontaine7, C. Ha Duyen2, A. Kobea4, P. Laroche8, P. Lassudrie-Duchesne6, H. Le Viet2, T. Le Truong2, H. Luu Viet2, M. Menvielle1, T. Nguyen Chien2, A. Nguyen Xuan2, F. Ouattara9, M. Petitdidier1, H. Pham Thi Thu2, T. Pham Xuan2, N. Philippon**, L. Tran Thi2, H. Vu Thien10, and P. Vila1 1CETP/CNRS, 4 Avenue de Neptune, 94107 Saint-Maur-des-Fosses,´ France 2Institute of Geophysics, Vietnamese Academy of Science and Technology , 18 Hoang Quoc Viet, Cau Giay, Hano¨ı, Vietnam 3IPGP, 4 Avenue de Neptune, 94107 Saint-Maur-des-Fosses,´ France 4Laboratoire de Physique de l’Atmosphere,` Universite´ d’Abidjan Cocody 22 B.P. 582, Abidjan 22, Coteˆ d’Ivoire 5Institut d’Electronique et de Tel´ ecommunications,´ Universite´ de Rennes Batˆ 11D, Campus Beaulieu, 35042 Rennes, cedex,´ France 6ENST, Universite´ de Bretagne Occidentale, CS 83818, 29288 Brest, cedex´ 3, France 7CRC , Faculte´ des Sciences, 6 Boulevard Gabriel, F 21004 Dijon cedex´ 04, France 8Unite´ de Recherche Environnement Atmospherique,´ ONERA, 92332 Chatillon, cedex,´ France 9University of Koudougou, Burkina Faso 10Laboratoire signaux et systemes,` CNAM, 292 Rue saint Martin, 75141 Paris cedex´ 03, France *V. Doumbia previously signed V. Doumouya **affiliation unknown Received: 15 June 2006 – Revised: 19 October 2006 – Accepted: 8 November 2006 – Published: 21 December 2006 Abstract. During many past decades, scientists from var- the E, F1 and F2 ionospheric layers follow the variation of ious countries have studied separately the atmospheric mo- the sunspot cycle. -
Information and Announcements Mathematics Prizes Awarded At
Information and Announcements Mathematics Prizes Awarded at ICM 2014 The International Congress of Mathematicians (ICM) is held once in four years under the auspices of the International Mathematical Union (IMU). The ICM is the largest, and the most prestigious, meeting of the mathematics community. During the ICM, the Fields Medal, the Nevanlinna Prize, the Gauss Prize, the Chern Medal and the Leelavati Prize are awarded. The Fields Medals are awarded to mathematicians under the age of 40 to recognize existing outstanding mathematical work and for the promise of future achievement. A maximum of four Fields Medals are awarded during an ICM. The Nevanlinna Prize is awarded for outstanding contributions to mathematical aspects of information sciences; this awardee is also under the age of 40. The Gauss Prize is given for mathematical research which has made a big impact outside mathematics – in industry or technology, etc. The Chern Medal is awarded to a person whose mathematical accomplishments deserve the highest level of recognition from the mathematical community. The Leelavati Prize is sponsored by Infosys and is a recognition of an individual’s extraordinary achievements in popularizing among the public at large, mathematics, as an intellectual pursuit which plays a crucial role in everyday life. The 27th ICM was held in Seoul, South Korea during August 13–21, 2014. Fields Medals The following four mathematicians were awarded the Fields Medal in 2014. 1. Artur Avila, “for his profound contributions to dynamical systems theory, which have changed the face of the field, using the powerful idea of renormalization as a unifying principle”. Work of Artur Avila (born 29th June 1979): Artur Avila’s outstanding work on dynamical systems, and analysis has made him a leader in the field. -
OTC TCS 2005.Pdf
1 Annual Report 2004-05 Contents Board of Directors ............................................................................................................................................................................................................................... 3 Management Team ............................................................................................................................................................................................................................. 4 Message from the CEO...................................................................................................................................................................................................................... 6 Notice........................................................................................................................................................................................................................................................ 8 Directors' Report ............................................................................................................................................................................................................................... 15 Management Discussion and Analysis ................................................................................................................................................................................... 30 Corporate Governance Report................................................................................................................................................................................................... -
A PROFILE Dr. Vijay Bhatkar Is One of Most Acclaimed and Internationally Acknowledged
DR. VIJAY BHATKAR: A PROFILE www.vijaybhatkar.org Dr. Vijay Bhatkar is one of most acclaimed and internationally acknowledged scientists of India. He is presently the Chancellor of Nalanda University. In this responsibility, he has committed himself to resurrecting the glory of ancient Nalanda, in the context of 21st century. Prior to Nalanda responsibility, he was the Chairman of Board of Governors of IIT Delhi from 2012 to 2017. He is best known as the architect of India’s national initiative in supercomputing, where he led the development of India’s first supercomputer Param in 1990, under the technology denial regime. Currently he is steering the National Supercomputing Mission of developing Exascale Architecture Supercomputing for India. Dr. Bhatkar is also widely known for bringing ICT to the masses through a wide range of path-breaking initiatives, such as the celebrated GIST multilingual technology covering India’s 22 official languages with 10 diverse scripts that has dissolved the language barrier on computers once for all; MKCL’s computer literacy programme that made a world mark by creating 10 million computer literates within a decade; Education to Home (ETH) initiative for bringing the benefits of ICT to school education. In the 80’s, Dr Bhatkar substantially contributed to the ushering of electronics revolution in India. He is also credited with the creation of several national research labs and institutions, notably amongst them being C-DAC, ER&DC Trivandrum, IIITM-K, TechnoPark, MKCL, IsquareIT, ETH Research Lab and Multiversity. Simultaneously, he has mentored several innovation-based start-ups. Dr. Bhatkar has served as a member of the Scientific Advisory Committee to PM, Member of the Governing Council of CSIR and a member of the IT Task Force constituted by PM in 1998. -
Section 124- Unpaid and Unclaimed Dividend
Sr No First Name Middle Name Last Name Address Pincode Folio Amount 1 ASHOK KUMAR GOLCHHA 305 ASHOKA CHAMBERS ADARSHNAGAR HYDERABAD 500063 0000000000B9A0011390 36.00 2 ADAMALI ABDULLABHOY 20, SUKEAS LANE, 3RD FLOOR, KOLKATA 700001 0000000000B9A0050954 150.00 3 AMAR MANOHAR MOTIWALA DR MOTIWALA'S CLINIC, SUNDARAM BUILDING VIKRAM SARABHAI MARG, OPP POLYTECHNIC AHMEDABAD 380015 0000000000B9A0102113 12.00 4 AMRATLAL BHAGWANDAS GANDHI 14 GULABPARK NEAR BASANT CINEMA CHEMBUR 400074 0000000000B9A0102806 30.00 5 ARVIND KUMAR DESAI H NO 2-1-563/2 NALLAKUNTA HYDERABAD 500044 0000000000B9A0106500 30.00 6 BIBISHAB S PATHAN 1005 DENA TOWER OPP ADUJAN PATIYA SURAT 395009 0000000000B9B0007570 144.00 7 BEENA DAVE 703 KRISHNA APT NEXT TO POISAR DEPOT OPP OUR LADY REMEDY SCHOOL S V ROAD, KANDIVILI (W) MUMBAI 400067 0000000000B9B0009430 30.00 8 BABULAL S LADHANI 9 ABDUL REHMAN STREET 3RD FLOOR ROOM NO 62 YUSUF BUILDING MUMBAI 400003 0000000000B9B0100587 30.00 9 BHAGWANDAS Z BAPHNA MAIN ROAD DAHANU DIST THANA W RLY MAHARASHTRA 401601 0000000000B9B0102431 48.00 10 BHARAT MOHANLAL VADALIA MAHADEVIA ROAD MANAVADAR GUJARAT 362630 0000000000B9B0103101 60.00 11 BHARATBHAI R PATEL 45 KRISHNA PARK SOC JASODA NAGAR RD NR GAUR NO KUVO PO GIDC VATVA AHMEDABAD 382445 0000000000B9B0103233 48.00 12 BHARATI PRAKASH HINDUJA 505 A NEEL KANTH 98 MARINE DRIVE P O BOX NO 2397 MUMBAI 400002 0000000000B9B0103411 60.00 13 BHASKAR SUBRAMANY FLAT NO 7 3RD FLOOR 41 SEA LAND CO OP HSG SOCIETY OPP HOTEL PRESIDENT CUFFE PARADE MUMBAI 400005 0000000000B9B0103985 96.00 14 BHASKER CHAMPAKLAL -
FOCS 2005 Program SUNDAY October 23, 2005
FOCS 2005 Program SUNDAY October 23, 2005 Talks in Grand Ballroom, 17th floor Session 1: 8:50am – 10:10am Chair: Eva´ Tardos 8:50 Agnostically Learning Halfspaces Adam Kalai, Adam Klivans, Yishay Mansour and Rocco Servedio 9:10 Noise stability of functions with low influences: invari- ance and optimality The 46th Annual IEEE Symposium on Elchanan Mossel, Ryan O’Donnell and Krzysztof Foundations of Computer Science Oleszkiewicz October 22-25, 2005 Omni William Penn Hotel, 9:30 Every decision tree has an influential variable Pittsburgh, PA Ryan O’Donnell, Michael Saks, Oded Schramm and Rocco Servedio Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing 9:50 Lower Bounds for the Noisy Broadcast Problem In cooperation with ACM SIGACT Navin Goyal, Guy Kindler and Michael Saks Break 10:10am – 10:30am FOCS ’05 gratefully acknowledges financial support from Microsoft Research, Yahoo! Research, and the CMU Aladdin center Session 2: 10:30am – 12:10pm Chair: Satish Rao SATURDAY October 22, 2005 10:30 The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics Tutorials held at CMU University Center into `1 [Best paper award] Reception at Omni William Penn Hotel, Monongahela Room, Subhash Khot and Nisheeth Vishnoi 17th floor 10:50 The Closest Substring problem with small distances Tutorial 1: 1:30pm – 3:30pm Daniel Marx (McConomy Auditorium) Chair: Irit Dinur 11:10 Fitting tree metrics: Hierarchical clustering and Phy- logeny Subhash Khot Nir Ailon and Moses Charikar On the Unique Games Conjecture 11:30 Metric Embeddings with Relaxed Guarantees Break 3:30pm – 4:00pm Ittai Abraham, Yair Bartal, T-H. -
Hierarchical Clustering with Global Objectives: Approximation Algorithms and Hardness Results
HIERARCHICAL CLUSTERING WITH GLOBAL OBJECTIVES: APPROXIMATION ALGORITHMS AND HARDNESS RESULTS ADISSERTATION SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE AND THE COMMITTEE ON GRADUATE STUDIES OF STANFORD UNIVERSITY IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Evangelos Chatziafratis June 2020 © 2020 by Evangelos Chatziafratis. All Rights Reserved. Re-distributed by Stanford University under license with the author. This work is licensed under a Creative Commons Attribution- Noncommercial 3.0 United States License. http://creativecommons.org/licenses/by-nc/3.0/us/ This dissertation is online at: http://purl.stanford.edu/bb164pj1759 ii I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Tim Roughgarden, Primary Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Moses Charikar, Co-Adviser I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Li-Yang Tan I certify that I have read this dissertation and that, in my opinion, it is fully adequate in scope and quality as a dissertation for the degree of Doctor of Philosophy. Gregory Valiant Approved for the Stanford University Committee on Graduate Studies. Stacey F. Bent, Vice Provost for Graduate Education This signature page was generated electronically upon submission of this dissertation in electronic format. -
A Decade of Lattice Cryptography
Full text available at: http://dx.doi.org/10.1561/0400000074 A Decade of Lattice Cryptography Chris Peikert Computer Science and Engineering University of Michigan, United States Boston — Delft Full text available at: http://dx.doi.org/10.1561/0400000074 Foundations and Trends R in Theoretical Computer Science Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is C. Peikert. A Decade of Lattice Cryptography. Foundations and Trends R in Theoretical Computer Science, vol. 10, no. 4, pp. 283–424, 2014. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-113-9 c 2016 C. Peikert All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for in- ternal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC). The ‘services’ for users can be found on the internet at: www.copyright.com For those organizations that have been granted a photocopy license, a separate system of payment has been arranged. -
The FINITE STRING Newsletter Programs 8000 Words), Double
The FINITE STRING Newsletter Programs 8000 words), double-spaced, by 1 December 1985, to Bestougeff, Ligozat - Parametrised abstract objects for the Chairman of the Program Committee: linguistic information processing Salton - On the representation of query term relations by Prof. Makoto Nagao (Kyoto) soft Boolean operators Dept. of Electrical Engineering Kyoto University 29 MARCH Sakyo-ku, Kyoto, 606, Japan MORNING The Program Committee will respond before 15 March Altman - The resolution of local syntactic ambuiguity by 1986. the human sentence processing mechanism The complete text of the revised papers in camera- Pulman - A parser that doesn't ready form should be sent before 1 May 1986 to Delmonte - Parsing difficulties and phonological processing Winfried Lenders in Italian Institut for Kommunikationsforschung und Phonetik Izumida et al. - A natural language interface using a world der Universit~it Bonn model Poppelsdorfer Allee 47 Berry-Rogghe - Interpreting singular definite descriptions D-5300 Bonn 1 in database queries Bree, Smit - Non-standard uses of if Wehrli - Design and implementation of a lexical data base PROGRAMS Maistros, Kotsanis - Lexifamis: A lexical analyser of modern Greek ACL EUROPEANCHAPTER: Beale - Grammatical analysis by computer of the SECOND CONFERENCE Lancaster-Oslo/Bergen corpus 28 MARCH 1985 Fimbel et al. - Using a text model for analysis and gener- ation MORNING Gillott - The simulation of stress patterns in synthetic Opening Session: Invited Speaker speech - a two level problem Kornai - Natural languages and the Chomsky hierarchy Johnston, Altman - Automatic speech recognition: a Hess - How does Natural Language Quantify framework for research Stifling - Distributives, quantifiers, and a multiplicity of .4 FTER NOON events Garside - A probabflistic parser Slocum and Bennett - An evaluation of METAL Boguraev, Briscoe - Toward a dictionary support environ- Root - A two-way approach to structural transfer in MT ment for real time parsing Boitet et al. -
Annual Rpt 2004 For
I N S T I T U T E for A D V A N C E D S T U D Y ________________________ R E P O R T F O R T H E A C A D E M I C Y E A R 2 0 0 3 – 2 0 0 4 EINSTEIN DRIVE PRINCETON · NEW JERSEY · 08540-0631 609-734-8000 609-924-8399 (Fax) www.ias.edu Extract from the letter addressed by the Institute’s Founders, Louis Bamberger and Mrs. Felix Fuld, to the Board of Trustees, dated June 4, 1930. Newark, New Jersey. It is fundamental in our purpose, and our express desire, that in the appointments to the staff and faculty, as well as in the admission of workers and students, no account shall be taken, directly or indirectly, of race, religion, or sex. We feel strongly that the spirit characteristic of America at its noblest, above all the pursuit of higher learning, cannot admit of any conditions as to personnel other than those designed to promote the objects for which this institution is established, and particularly with no regard whatever to accidents of race, creed, or sex. TABLE OF CONTENTS 4·BACKGROUND AND PURPOSE 7·FOUNDERS, TRUSTEES AND OFFICERS OF THE BOARD AND OF THE CORPORATION 10 · ADMINISTRATION 12 · PRESENT AND PAST DIRECTORS AND FACULTY 15 · REPORT OF THE CHAIRMAN 20 · REPORT OF THE DIRECTOR 24 · OFFICE OF THE DIRECTOR - RECORD OF EVENTS 31 · ACKNOWLEDGMENTS 43 · REPORT OF THE SCHOOL OF HISTORICAL STUDIES 61 · REPORT OF THE SCHOOL OF MATHEMATICS 81 · REPORT OF THE SCHOOL OF NATURAL SCIENCES 107 · REPORT OF THE SCHOOL OF SOCIAL SCIENCE 119 · REPORT OF THE SPECIAL PROGRAMS 139 · REPORT OF THE INSTITUTE LIBRARIES 143 · INDEPENDENT AUDITORS’ REPORT 3 INSTITUTE FOR ADVANCED STUDY BACKGROUND AND PURPOSE The Institute for Advanced Study was founded in 1930 with a major gift from New Jer- sey businessman and philanthropist Louis Bamberger and his sister, Mrs. -
Constraint Clustering and Parity Games
Constrained Clustering Problems and Parity Games Clemens Rösner geboren in Ulm Dissertation zur Erlangung des Doktorgrades (Dr. rer. nat.) der Mathematisch-Naturwissenschaftlichen Fakultät der Rheinischen Friedrich-Wilhelms-Universität Bonn Bonn 2019 1. Gutachter: Prof. Dr. Heiko Röglin 2. Gutachterin: Prof. Dr. Anne Driemel Tag der mündlichen Prüfung: 05. September 2019 Erscheinungsjahr: 2019 Angefertigt mit Genehmigung der Mathematisch-Naturwissenschaftlichen Fakultät der Rheinischen Friedrich-Wilhelms-Universität Bonn Abstract Clustering is a fundamental tool in data mining. It partitions points into groups (clusters) and may be used to make decisions for each point based on its group. We study several clustering objectives. We begin with studying the Euclidean k-center problem. The k-center problem is a classical combinatorial optimization problem which asks to select k centers and assign each input point in a set P to one of the centers, such that the maximum distance of any input point to its assigned center is minimized. The Euclidean k-center problem assumes that the input set P is a subset of a Euclidean space and that each location in the Euclidean space can be chosen as a center. We focus on the special case with k = 1, the smallest enclosing ball problem: given a set of points in m-dimensional Euclidean space, find the smallest sphere enclosing all the points. We combine known results about convex optimization with structural properties of the smallest enclosing ball to create a new algorithm. We show that on instances with rational coefficients our new algorithm computes the exact center of the optimal solutions and has a worst-case run time that is polynomial in the size of the input.