From icalp2003 at TUE.nl Fri Oct 4 12:32:31 2002 From: icalp2003 at TUE.nl (icalp2003@TUE.nl) Date: Mon Jan 9 13:41:07 2006 Subject: [DMANET] Call for workshops Message-ID: [apologies for multiple copies] ICALP 2003 Eindhoven, the Netherlands, June 30 - July 4, 2003 ICALP 2003, the 30th International Colloquium on Automata, Languages and Programming, will be held next year in Eindhoven, the Netherlands from June 30th till July 4th. For the weekends preceding and following the week of the ICALP conference several satelite events are planned. For more information see http://www.win.tue.nl/icalp2003. The ICALP 2003 Organizing Commitee welcomes further initiatives. In particular, workshop proposals are invited addressing the following issues: - workshop title and brief description of the scope and goal - motivation of the relevance to the TCS community - organizing commitee and potential invited speakers - format of the workshop, duration and refereeing procedure, if applicable Proposals can be sent to Erik de Vink, workshop coordinator for ICALP 2003, e-mail evink@win.tue.nl, no later than November 8th, 2002. ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From vshapiro at engr.wisc.edu Tue Oct 1 12:54:10 2002 From: vshapiro at engr.wisc.edu (Vadim Shapiro) Date: Mon Jan 9 13:41:07 2006 Subject: Abstracts for SM-03 can now be submitted Message-ID: <5.1.1.5.2.20021001115335.00b16998@me.engr.wisc.edu> Dear Colleagues, Abstracts for 2003 SOLID MODELING SYMPOSIUM can now be submitted via the symposium webpage at http://maximus.ce.washington.edu/sm03/ The deadline for abstract submission is October 15, 2002, with full papers due on November 30, 2002 Gershon Elber, Technion, Israel Vadim Shapiro, University of Wisconsin, USA Program Co-Chairs, ACM Solid Modeling 2003 ------------------------------------------------------------------------------------- Call for Papers SOLID MODELING 2003 Eighth ACM Symposium on Solid Modeling and Applications University of Washington, Seattle, WA June 16-20, 2003 Sponsored by ACM SIGGRAPH The Solid Modeling symposia series is an international forum for the exchange of recent research and applications of solid modelling, shape modelling, and geometric computation in design, analysis and manufacturing, as well as in the emerging biomedical, geophysical and other areas. This highly successful symposium, which has been held bi-annually since 1991, brings together prominent researchers, key practitioners, and numerous students in the field. The symposium is held annually, alternating its location between the USA and other countries. The Solid Modeling 2003 symposium will be held on the campus of University of Washington in Seattle, WA, USA. In addition to technical papers in plenary sessions, the program for Solid Modeling 2003 will include: * academic and industrial tutorials * keynote lectures * panel and poster sessions * best paper award at the symposium banquet * sponsorship of students to attend the symposium * social program More information on the symposium can be found on the Solid Modeling 2003 web page: http://www.ce.washington.edu/sm03 The papers submission schedule is as follows: October 15, 2002: Abstracts due November 30, 2002: Full papers due February 10, 2003: Notice of acceptance and reviews March 31, 2003: Final camera-ready papers and extended abstracts due For details on how to submit abstracts and papers, please consult the web page http://www.ce.washington.edu/sm03/submit_proc. Abstracts are used to facilitate the review process and should be 150-300 words in length. Papers are limited to 12 typeset pages in length, including figures and references, and should present previously unpublished original results. All papers will be peer-reviewed and can be selected for presentation at a plenary session, or for presentation at a poster session, with publication in the conference proceedings published by ACM Press. A revised version of selected papers will also be published in special issues of related scientific journals. Best paper award will be selected by a jury of experts and will be presented at the symposium banquet. Symposium Co-Chairs: Pere Brunet, Polytechnical University of Catalonia, Barcelona, Spain George Turkiyyah, University of Washington, USA Program Co-Chairs: Gershon Elber, Technion, Israel Vadim Shapiro, University of Wisconsin, USA Industrial Chair: Jan Vandenbrande, Boeing Topics of interest for Solid Modeling 2003 include, but are not limited to: Geometric and topological representations Multi-resolution models Heterogeneous models Geometric interrogations and reasoning Computational geometry Robustness of geometric computations Blends, sweeps, offsets & deformations Procedural, constraint-based and parametric modeling Feature-based modeling Conceptual design techniques Product and assembly modeling Representation conversion Product data exchange User interaction techniques Haptic interfaces Collaborative/distributed design Virtual environments and prototypes Reverse engineering Engineering analysis using solid models Engineering tolerances Manufacturing and assembly planning Computational support for new manufacturing technologies Biomedical applications Geo-scientific applications Entertainment applications ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From frank at dehne.net Sat Oct 5 16:02:08 2002 From: frank at dehne.net (Frank Dehne (www.dehne.net)) Date: Mon Jan 9 13:41:07 2006 Subject: Call For Papers: Workshop on Algorithms and Data Structures (WADS 2003) Message-ID: <5.0.2.1.2.20021005150155.01bb22a0@209.229.213.67> Call For Papers Workshop on Algorithms and Data Structures (WADS 2003) - www.wads.org - July 30 - August 1, 2003 Ottawa, Canada Submission Deadline: Feb. 10, 2003 The Workshop, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. We invite submissions of papers presenting original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing. Contributors are invited to submit a full paper (not exceeding 12 pages). Detailed submission instructions are located at http://www.wads.org. Submissions must arrive on or before Feb. 10 at 12:00 noon EST. Authors will be notified of acceptance or rejection by April 14, 2003. Proceedings will be published in the Springer Verlag series Lecture Notes in Computer Science. The final versions of accepted papers must arrive in camera-ready form before May 12, 2003 to ensure the availability of the proceedings at the conference. Selected papers will be invited for publication in a special issue of Computational Geometry: Theory and Applications. Invited Speakers: Gilles Brassard, Michael Fellows, Daniel Spielman, Dorothea Wagner. Special Presentation: Wing T. Yan (Nelligan O'Brien Payne LLP, www.nelligan.ca), "Protecting your intellectual property". Conference Chair: Michiel Smid Program Committee: Co-Chairs: F. Dehne, J.-R. Sack, M. Smid. PC-Members: Lars Arge (Duke), Susanne Albers (Freiburg), Michael Atkinson (Dunedin), Hans Bodlaender (Utrecht), Gerth Brodal (Aarhus), Tom Cormen (Dartmouth), Timothy Chan (Waterloo), Erik Demaine (MIT), Mike Fellows (Newcastle), Pierre Freigniaud (Paris-Sud), Naveen Garg (Delhi), Andrew Goldberg (Microsoft), Giuseppe Italiano (Rome), Ravi Janardan (Minneapolis), Rolf Klein (Bonn), Stephan Naeher (Trier), Giri Narasimhan (Florida International University), Rolf Niedermeier (Tuebingen), Viktor Prasanna (Southern California), Andrew Rau-Chaplin (Halifax), R. Ravi (Carnegie Mellon), Paul Spirakis (Patras), Roberto Tamassia (Brown), Jeff Vitter (Duke), Dorothea Wagner (Konstanz), Peter Widmayer (Zurich). ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From markov at cs.uu.nl Wed Oct 16 16:40:03 2002 From: markov at cs.uu.nl (Mark Overmars) Date: Mon Jan 9 13:41:07 2006 Subject: Two Assistent Professor Positions at Utrecht University Message-ID: <02a901c27519$87b0ac50$2850d383@shark> TWO ASSISTENT PROFESSOR POSITIONS At the Institute of Information and Computing Sciences at Utrecht University, in the Center for Geometry, Imaging and Virtual Environments, there are two assistant professor positions (UD-positions) vacant in the area of computational geometry, geographic information systems, graphics and/or virtual environments. Detailed information -------------------- The Center for Geometry, Imaging and Virtual Environments, headed by prof. Mark Overmars, performs research and offers a master program in the area of computational geometry, imaging and multimedia, virtual environments and game design. Both fundamental research and application oriented research is performed, normally from an algorithmic perspective. For more information about the center, see the website: http://www.cs.uu.nl/centers/give/ In the center there are two assistent professor positions vacant. One position should preferably focus on computational geometry and its application in geographic information systems and/or automated cartography. The other position should preferably focus on computer graphics and/or virtual environments. But candidates with other interests that fit within the scope of the center will also be considered. The positions are 50% research and 50% teaching positions. The candidates are expected to perform independent, original research in the indicated area of expertise on an international level. They will teach courses, both in the master program and in the bachelors program in computer science, offered by the institute. They are expected to supervise master students and PhD students in their research domain. We ask ------ Candidates should have a PhD in computer science. Scientific creativity and productivity must be shown by publications in international journals and conferences, within the indicated area. Candidates should preferably have teaching experience. We offer -------- One position will be tenure track. The other position will be for a period of four years. The salary is maximal EURO 4420 per month (rank 12) for a full-time position. More information can be obtained from ------------------------------------- prof. Mark H. Overmars Institute of Information and Computing Sciences Utrecht University P.O.Box 80.089, 3508 TB Utrecht the Netherlands tel. +31-30-2533736 fax +31-30-2513791 http://www.cs.uu.nl/~markov Application procedure --------------------- To apply you can send a letter (with CV), addressed to: Head of Personnel and Organisation Buys Ballotlaboratorium, room 102 Princetonplein 5 3584 CC Utrecht (De Uithof) The Netherlands or you can send an email to: P&O@phys.uu.nl Please cite vacancy number 62212. ____________________________________________ Mark H. Overmars Institute of Information and Computing Sciences Utrecht University P.O.Box 80.089, 3508 TB Utrecht the Netherlands tel. +31-30-2533736 fax +31-30-2513791 http://www.cs.uu.nl/~markov ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sack at scs.carleton.ca Wed Oct 16 16:13:41 2002 From: sack at scs.carleton.ca (Jorg-Rudiger Sack) Date: Mon Jan 9 13:41:08 2006 Subject: Postdoctoral Position Message-ID: Carleton University PARADIGM RESEARCH GROUP a center for Geometric Computing and its Applications and for Applied High Performance Computing POSTDOCTORAL FELLOWSHIPS We invite applications for postdoctoral fellowships at Carleton University. Carleton University's Paradigm Research Group is a concentration of 7 researchers working directly in geometric computing and three working in closely related areas. The group is participant of several national and international activities and has links to industry and regional hospitals. Research support comes from governments and industry, in particular SUN Microsystems is a partner in our SUN-NSERC industrial research Chair in applied parallel computing and in a research program on wireless geographic information services. Paradigm is a participant in the High Performance Virtual Laboratory which has several SUN SMP Sunfires and a 128-processor beowulf cluster. Applications in areas of applied geometric and parallel computing are welcomed. Currently research areas of particular interest to us are: * Approximation algorithms - including shortest paths problems * Medical computing - including visualization, image processing and cancer treatment * High Performance Computing - all areas are considered with particular focus on spatial applications * Geographic Information Systems - including design and implementation of wireless GIS * Algorithms for GIS - including geometric computations performed in wireless GIS Postdoctoral fellowships are for one year but could be extended. R&D would be carried out in collaboration with J.-R. Sack and D. Nussbaum. It is expected that postdocs would participate in graduate student research and in our research seminar. In general, postdocs are not expected to teach. Applicants are expected to have a strong background in computer science and should provide a statement as to how their background relates to the topics listed above, how they will contribute to and benefit from our research program. Applications should be sent to: postdoc@scs.carleton.ca or by regular mail to: J.-R. Sack SUN-NSERC Chair and Professor Assoc. Dean - research School of Computer Science Carleton University Ottawa, ON Canada K1S 5B6 http://www.scs.carleton.ca/~gis CHECKLIST Curriculum Vitae incl. publication list Summary of main contributions (readable!) <= 2 pages Background as it relates to topic listed <= 1 page Benefits to/from our research program <= 1 page Three letters of recommendations (to be sent directly from referees) Statement of specific funding for postdoctoral work ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From jsbm at ams.sunysb.edu Mon Oct 28 08:56:40 2002 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:08 2006 Subject: Call for Participation: DIMACS Workshop on Computational Geometry Message-ID: <200210281354.g9SDsjx28543@catbert.ams.sunysb.edu> DIMACS Workshop on Computational Geometry (The 12th annual Fall workshop on Computational Geometry) November 14 - 15, 2002 DIMACS Center, Rutgers University, Piscataway, NJ Organizers: Joseph S. B. Mitchell, University at Stony Brook, jsbm@ams.sunysb.edu Program Committee: Herve Bronnimann, Polytechnic University Erik Demaine, MIT Steven Fortune, Bell Laboratories Joseph S. B. Mitchell, University at Stony Brook Ileana Streinu, Smith College Suresh Venkatasubramanian, AT&T Presented under the auspices of the Special Focus on Computational Geometry and Applications. **************************************************************** We are pleased to announce the twelfth in a series of annual fall workshops on Computational Geometry. This workshop series, founded initially under the sponsorship of the Mathematical Sciences Institute (MSI) at Stony Brook (with funding from the U. S. Army Research Office), has continued during 1996-1999 under the sponsorship of the Center for Geometric Computing, a collaborative center of Brown, Duke, and Johns Hopkins Universities, also funded by the U.S. Army Research Office. In 2000, the workshop returned to the campus of the University at Stony Brook. In 2001, it was held at Polytechnic University in Brooklyn. This year, as part of the DIMACS Special Focus on Computational Geometry and Applications, the workshop is being hosted and sponsored by DIMACS. Scope and Format: The aim of this workshop is to bring together students and researchers from academia and industry, to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry Geometric data structures Implementation issues Robustness Computer graphics Solid modeling Geographic information systems Applications to computational biology and chemistry Computational metrology Graph drawing Experimental studies Computer vision Robotics Computer-aided design Mesh generation Manufacturing applications of geometry I/O-scalable geometric algorithms Animation of geometric algorithms Following the tradition of the previous workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. There will also be an Open Problem Session in order to promote a free exchange of questions and research challenges. **************************************************************** Invited Speakers: Timothy Chan, Waterloo, Low-Dimensional Linear Programming with Violations Piotr Indyk, MIT, Approximate Algorithms for High-Dimensional Geometric Problems Lydia Kavraki, Rice, Modeling the Conformational Flexibility of Proteins Regina Liu, Rutgers, Data Depth in Multivariate Data Analysis: Usefulness and Challenges **************************************************************** Tentative Workshop Program: Thursday, November 14 8:00-8:50 Continental Breakfast 8:50-9:00 Opening Remarks 9:00-10:00 Contributed talks: The Path of a Pseudo-Triangulation Oswin Aichholzer, Ileana Streinu, and Bettina Speckmann An Energy-Driven Approach to Linkage Unfolding Jason H. Cantarella, Erik D. Demaine, Hayley N. Iben, and James F. O'Brien Proximate Planar Point Location John Iacono and Stefan Langerman. Exact Algorithms for Computing the Location Depth and the $k$-th Depth Regions Based on Parallel Arrangement Constructions Komei Fukuda and Vera Rosta 10:00-10:30 Break 10:30-11:20 Invited Talk Regina Liu (Rutgers) Data Depth in Multivariate Data Analysis: Usefulness and Challenges 11:20-11:30 Minibreak 11:30-12:30 Contributed talks: Several Geometric Tiling and Packing Problem With Applications To Nonoverlapping local alignments, DNA microarray designs and Homology Searches Bhaskar DasGupta Art Gallery Theorems for Guarded Guards T. S. Michael and Val Pinciu Matching Planar Maps Helmut Alt, Alon Efrat, G\"unter Rote, and Carola Wenk Approximation Algorithms for Aligning Points Sergio Cabello and Marc van Kreveld 12:30-2:00 Lunch 2:00-2:50 Invited Talk: Timothy Chan (Waterloo): Low-Dimensional Linear Programming with Violations 2:50-3:00 Minibreak 3:00-4:00 Contributed talks: The Rectilinear Minimum Bends Path Problem in Three Dimensions David P. Wagner, Robert Scot Drysdale, and Clifford Stein Fault-Tolerant Geometric Spanners Artur Czumaj and Hairong Zhao Computing Homotopic Shortest Paths Efficiently Alon Efrat, Stephen Kobourov, and Anna Lubiw Variants on Alternating Segment Paths Csaba D. T\'oth 4:00-4:30 Break 4:30-5:30 Contributed talks: Optimal Motion Strategies to Track and Capture a Predictable Target Alon Efrat, H\'ector H. Gonzalez-Banos, Stephen G. Kobourov, and Lingeshwaran Palaniappan Online Dispersion Algorithms for Robot Swarms Esther M. Arkin, Michael A. Bender, S\'andor P. Fekete, Tien-Ruey Hsiang, Nenad Jovanovic, Joseph S. B. Mitchell, and Marcelo O. Sztainberg New Approximation Results for the Maximum Scatter TSP Yi-Jen Chiang Hide and Seek for Robots Tien-Ruey Hsiang, Joseph S. B. Mitchell, and Marcelo O. Sztainberg 5:30-5:40 Minibreak 5:40-6:30 Open Problem Session 6:30 Dinner Friday, November 15 8:00-9:00 Continental Breakfast 9:00-10:00 Contributed talks: Constructing Hamiltonian Triangle Strips on Quadrilateral Meshes Gabriel Taubin Interpolation over Light Fields with Applications in Computer Graphics F. Betul Atalay and David M. Mount Visible Zone Maintenance for Real-Time Occlusion Culling Olaf Hall-Holt Multi-way Space Partitioning Trees Christian A. Duncan 10:00-10:30 Break 10:30-11:20 Invited Talk: Lydia Kavraki (Rice): Modeling the Conformational Flexibility of Proteins 11:20-11:30 Minibreak 11:30-12:30 Contributed talks: Three Observations on Geometric Permutations Boris Aronov and Shakhar Smorodinsky Cost Optimal Trees for Ray Shooting Herv\'e Br\"onnimann and Marc Glisse The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing Evanthia Papadopoulou and D.T. Lee Optimal Core-Sets for Balls Mihai B\u{a}doiu and Kenneth L. Clarkson 12:30-2:00 Lunch 2:00-2:50 Invited Talk: Piotr Indyk (MIT): Approximate Algorithms for High-Dimensional Geometric Problems 2:50-3:00 Minibreak 3:00-4:00 Contributed talks: The Foldings of a Square to Convex Polyhedra Rebecca Alexander, Heather Dyson, Joseph O'Rourke Tetris is Hard, Even to Approximate Erik Demaine, Susan Hohenberger, and David Liben-Nowell Towards the Visualization of Overlapping Sets Xavier Boyen, Liadan O'Callaghan, and Nina Mishra Can Polynomiography be Useful in Computational Geometry? Bahman Kalantari 4:00-4:30 Break 4:30-5:15 Contributed talks: An Algorithm Oriented Mesh Database (AOMD) Application: Decimation B. Kaan Karamete Hand Recognition Using Geometric Classifiers Yaroslav Bulatov, Sachin Jambawalikar, Piyush Kumar, and Saurabh Sethia Sufficiently Fat Polyhedra are not 2-Castable David Bremner and Alexander Golynski 5:15-5:30 Minibreak 5:30-6:30 Open Problem Session **************************************************************** Registration fees: There are no registration fees for this event. **************************************************************** Information on participation, registration, accommodations, and travel can be found at: http://dimacs.rutgers.edu/Workshops/CompGeom/ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From tamaldey at cis.ohio-state.edu Fri Oct 25 16:01:28 2002 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:08 2006 Subject: Call for participation (DIMACS Implementation Challenge on Surface Reconstruction) Message-ID: <200210251901.g9PJ1TE10873@cis.ohio-state.edu> DIMACS Implementation Challenge on Surface Reconstruction Organizers: Claudio T. Silva (csilva@cse.ogi.edu) Tamal K. Dey (tamaldey@cis.ohio-state.edu) Recent technological and algorithmic advances have improved the process of acquiring discrete sample points from a 3D geometric object. This data acquisition includes scanning the boundary of a real world 3D object with a variety of scanners as well as discrete data points generated by some scientific simulation. Several algorithms have been proposed in recent years to approximate the surface from which the samples are acquired. The ultimate proof of the success of these surface reconstruction algorithms depend on their performance on real data that pose difficulty due to noise, undersampling and size. Goal: The goal of the Implementation Challenge is to determine how algorithms depend on the structure of the underlying data sets, and to determine realistic algorithm performance. Invitation: We invite research groups to participate in this Implementation Challenge. Participants can provide their own data sets which will be added to a pool of test data sets including our own data sets and those provided by all participants. A sample of those datasets will be available from our web site (listed below). Interested person/groups should send their intention in participating in the Challenge by sending an email to the organizers. Results: The results of this challenge will be reported in a session of the DIMACS workshop on surface reconstruction, April 30-May 02, 2003 organized by Nina Amenta and Fausto Bernardini. We will report different results, including (i) Machine performance: speed, memory usage (ii) Output quality: output size, nonmanifold-ness, holes (iii) Scope: Generality. Ideally the codes should run on a PC running Linux and/or Windows with 1GB of RAM, and 120 GB of disk space (single disk). Input: The input datasets will consists of a combination of formats, including unorganized points (without normals), points with normals, and collections of (registered) range scans, and they will range in size from small (few hundred samples) to large (few million samples). (Algorithms do not necessarily need to work on all the data.) Output: The output of the softwares should be in Geomview OFF format. We will annouce other acceptable formats as we hear from the participants. Web site (tentative): http://graphics.cse.ogi.edu/~data ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From icalp2003 at TUE.nl Tue Oct 22 12:36:00 2002 From: icalp2003 at TUE.nl (icalp2003@TUE.nl) Date: Mon Jan 9 13:41:08 2006 Subject: call for papers icalp 2003 Message-ID: > ------------------------------Call For > Papers---------------------------------------------------- > > We apologize for the reception of multiple copies of this message. > -------------------------------------------------------------------------- > ------------------------------ > > ICALP2003 > > Thirtieth International Colloquium on Automata, Languages and > Programming > > > Eindhoven, The Netherlands, June 30 - July 4, 2003 > > The 30th annual meeting of the European Association of Theoretical > Computer > Science will be held in Eindhoven, The Netherlands, at the Technische > Universiteit Eindhoven. > > > As with the journal Theoretical Computer Science (TCS), the scientific > program of the Colloquium will be split into two parts: Track A of the > meeting will cover Algorithms, Automata, Complexity and Games, while Track > B > covers Logic, Semantics and Theory of Programming. > > Topic of interest include but are not limited to: > > * Track A Algebra & circuits, Approximation algorithms, Combinatorial > optimization, Computational biology, Computational geometry, > Evolutionary algorithms, Distributed computing, Graph and network > algorithms, Molecular computing, Neural networks, Online algorithms, > Quantum computing, Randomized algorithms, Routing, Scheduling, > Sorting > & searching, String algorithms; > * Track B Applied logic, Concurrency, Deduction, Hybrid systems, Lambda > calculus, Language theory, Logic, Logic of programs, Model checking, > Probabilistic systems, Process algebra, Regular Languages, Rewriting, > Semantics, Specification & verification, Theorem proving, Theory of > programming, Type theory. > > Submissions > > Authors are invited to submit a paper presenting original contributions to > the theory of computer science. Submissions should consist of: a cover > page, with the author's full name, address, fax number, e-mail address, a > 100-word abstract, keywords and to which track (A or B) the paper is being > submitted. At least one author of an accepted paper should be available to > present it at the conference. Simultaneous submission to other conferences > with published proceedings is not > allowed. Electronic submission of papers through the conference website is > encouraged, see http://www.win.tue.nl/icalp2003/. > > The conference proceedings will be published by Springer Verlag as a > volume in the Lecture Notes in Computer Science series. Hence, authors are > encouraged to use the LNCS-style (see > http://www.springer.de/comp/lncs/authors.html for instructions). The > standard format of an ICALP submission has a textheight of at most 21cm > and a textwidth of at most 15cm. The font is 11pt (and for LaTeX-users, > the textsize is \normalsize, not \small). A submission has at most 12 > pages, possibly followed by an appendix of at most 8 pages. The appendix > may contain sketches of long proofs and additional material, but the > contribution of the paper must be understandable without reading the > appendix. Papers that deviate substantially from this standard format will > be rejected. > > > Important Dates > > * Submissions: January 12, 2003 > * Notification: March 18, 2003 > * Final version: April 13, 2003 > > Conference Chair > > Jos Baeten > > Technische Universiteit Eindhoven > Department of Mathematics and Computing Science > P.O. Box 513 > 5600 MB Eindhoven > The Netherlands > > Program Committee > > Track A > > Harry Buhrman, CWI Amsterdam > Jens Clausen, DTK Lyngby > Martin Dyer, Leeds > Lars Engebretsen, KTH Stockholm > Uri Feige, Weizmann > Philippe Flajolet, INRIA Rocquencourt > Kazuo Iwama, Kyoto > Elias Koutsoupias, UCLA > Jan Karel Lenstra, Georgia Tech, co-chair > Stefano Leonardi, Roma > Rasmus Pagh, Copenhagen > Jean-Eric Pin, CNRS and Paris 7 > Uwe Schoening, Ulm > Jiri Sgall, CAS Praha > Micha Sharir, Tel Aviv > Vijay Vazirani, Georgia Tech > Ingo Wegener, Dortmund > Peter Widmayer, ETH Zuerich > Gerhard Woeginger, Twente, co-chair > > Track B > > Samson Abramsky, Oxford > Eike Best, Oldenburg > Manfred Broy, TU Muenchen > Philippe Darondeau, INRIA Rennes > Rocco De Nicola, Firenze > Rob van Glabbeek, Stanford > Ursula Goltz, Braunschweig > Roberto Gorrieri, Bologna > Robert Harper, Carnegie Mellon > Holger Hermanns, Twente > Kim Larsen, Aalborg > Jean-Jacques Levy, INRIA Rocquencourt > Flemming Nielson, DTU Lyngby > Prakash Panangaden, McGill > Joachim Parrow, Uppsala, chair > Amir Pnueli, Weizmann > Davide Sangiorgi, INRIA Sophia > Bernhard Steffen, Dortmund > Bjorn Victor, Uppsala > > > Workshops and co-located events > > In the weekends preceding and following ICALP several workshops that are > of interest to the EACTS-community will be held at the conference venue. > There will be workshops related to track A as well as workshops related to > Track B of ICALP. A preliminary list of satelite events will become > available on the ICALP 2003 website. In the week preceding ICALP (June > 24-27), two more international conferences in computer science are > organized by the TU/e: the 4th International Conference on Application and > Theory of Petri Nets, ATPN 2003 (http://www.tue.nl/atpn2003/), and the > Conference on Business Process Management, BPM 2003 > (http://tmitwww.tm.tue.nl/bpm2003/). > > > Contact information > > ICALP2003 Office > Technische Universiteit Eindhoven > Department of Mathematics and Computing Science > P.O. Box 513 > 5600MB Eindhoven > The Netherlands > > Telephone: +31 40 2474124 > Fax: +31 40 2475361 > E-mail: icalp2003@tue.nl > URL: www.win.tue.nl/icalp2003/ > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sarahd at dimacs.rutgers.edu Tue Oct 29 16:00:37 2002 From: sarahd at dimacs.rutgers.edu (Sarah Donnelly) Date: Mon Jan 9 13:41:08 2006 Subject: [Sy-cg-global] Program: DIMACS Workshop on Algorithmic Issues in Modeling Motion Message-ID: <200210292100.QAA17237@dimacs.rutgers.edu> DIMACS Workshop on Algorithmic Issues in Modeling Motion November 18 - 20, 2002 DIMACS Center, Rutgers University, Piscataway, NJ Organizers: Pankaj K. Agarwal, Duke University, pankaj@cs.duke.edu Leonidas J. Guibas, Stanford University, guibas@cs.stanford.edu Presented under the auspices of the DIMACS Special Focus on Computational Geometry and Applications. Motion, like shape, is one of the fundamental modalities to be modeled in order to represent and manipulate the physical world in a computer. As such, motion representations and the algorithms that operate on them are central to all computational disciplines dealing with physical objects: computer graphics, computer vision, robotics, etc. Modeling motion is also crucial for other disciplines dealing with temporally varying data, including mobile networks, temporal data bases, etc. Motion algorithms require computational resources, and frequently sensing and communication resources as well, in order to accomplish their task. Despite the prominent position that motion plays in so many computer disciplines, little has been done to date to provide a clean conceptual framework for representing motion, describing algorithms on moving objects, and analyzing their behavior and performance. This workshop aims to bring together people from the different research communities interested in algorithmic issues related to moving objects. The workshop will address core algorithmic issues as well as aspects of modeling and analyzing motion. The goal is to debate and discuss the issues in representing, processing, reasoning, analyzing, searching, and visualizing moving objects; to identify key research issues that need to be addressed, and to help establish relationships which can be used to strengthen and foster collaboration across the different areas. ************************************************************ Program MONDAY November 18 8:15 - 8:55 Breakfast and registration 8:55 - 9:00 Opening remarks Fred Roberts, Director of DIMACS 9:00 - 10:00 Tracking Hands By Recognition Carlo Tomasi, Duke University 10:00 - 10:30 Human Motion Estimation: Visual Cues, Representation, Statistics Dimitris Metaxas, Rutgers University 10:30 - 11:00 Break 11:00 - 11:30 Multiple Motions in 3D Fractured Concrete Specimen Tong Zhang, RPI 11:30 - 12:00 Animation by Example Michael Gleicher, University of Wisconsin, Madison 12:00 - 12:30 3D Radial Decompositions and Their Kinetic Maintenance Samuel Hornus, INRIA 12:30 - 2:00 Lunch 2:00 - 3:00 Motion, Constraints, and Contact Dinesh Pai, Rutgers University 3:00 - 3:30 Point-and Shoot Model Acquisition Elisha Sacks, Purdue University 3:30 - 4:00 Kinetic Data Structures for Collision Detection Bettina Speckmann, ETH Zurich 4:00 - 4:30 Break 4:30 - 5:00 Exact Collision Checking of Robot Paths Jean-Claude Latombe, Stanford University 5:00 - 5:30 Biomolecules in Motion: With or Without Water? Patrice Koehl, Stanford University 5:30 - 6:00 Using Motion Planning to Study Protein Folding with a Case Study of Hairpin Formation in Proteins G & L Nancy Amato, Texas A&M TUESDAY November 19 8:15 - 9:00 Breakfast and registration 9:00 - 10:00 Lower Bounds for Kinetic Data Structures Mark de Berg, TU Eindhoven 10:00 - 10:30 On the Number of Views of Translates of a Cube Boris Aronov, Polytech University 10:30 - 11:00 Break 11:00 - 11:30 Clustering Motion Sariel Har-Peled, UIUC 11:30 - 12:00 Smooth Kinetic Maintenance of Clusters John Hershberger, Mentor Graphics 12:00 - 12:30 Routing in Mobile Wireless Networks Li Zhang, HP Labs 12:30 - 2:00 Lunch 2:00 - 3:00 Incremental Motion and k-Means Clustering David Mount, University of Maryland 3:00 - 3:30 Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-hoc Networks Hai Huang, Arizona State University 3:30 - 4:00 Break 4:00 - 5:00 Distributed Networked Sensing and Information Processing Feng Zhao, Palo Alto Research Center 5:00 - 5:30 Distributed Communication Algorithms for Ad-hoc Mobile Networks Sotiris Nikoletseas and Paul Spirakis, CTI, Patras 5:30 - 6:00 Modeling Motion in Ocelot Ken Clarkson, Bell Labs WEDNESDAY November 20 9:00 - 10:00 Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons Ileana Streinu, Smith College 10:00 - 10:30 Complexity Issues in Chain and Tree Reconfiguration Sue Whitesides, McGill University 10:30 - 11:00 Relaxed Scheduling in Dynamic Skin Triangulation Alper Ungor, Duke University 11:00 - 11:30 Building Space-Time Meshes over Arbitrary Spatial Domains Jeff Erickson, UIUC 11:30 - 12:30 Lunch 12:30 - 1:00 Managing the location of Moving Objects: Linguistic and Performance Issues Ouri Wolfson, University of Illinois 1:00 - 1:30 Indexing Mobile Data Cecilia M. Procopiuc, AT&T Research 1:30 - 2:00 Kinetic Medians and kd-Trees Jie Gao, Stanford University ******************************************************************* Registration Fees: Registration: (Pre-registration date: November 11, 2002) Regular rate Preregister before deadline $120/day After preregistration deadline $140/day Reduced Rate* Preregister before deadline $60/day After preregistration deadline $70/day Postdocs Preregister before deadline $10/day After preregistration deadline $15/day DIMACS Postdocs $0 Non-Local Graduate & Undergraduate students Preregister before deadline $5/day After preregistration deadline $10/day Local Graduate & Undergraduate students $0 (Rutgers & Princeton) DIMACS partner institution employees** $0 DIMACS long-term visitors*** $0 Registration fee to be collected on site, cash, check, VISA/Mastercard accepted. Our funding agencies require that we charge a registration fee for the workshop. Registration fees cover participation in the workshop, all workshop materials, breakfast, lunch, breaks, and any scheduled social events (if applicable). * College/University faculty and employees of non-profit organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the preregistration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, AT&T Labs - Research, Bell Labs, NEC Research Institute and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs and Microsoft Research are also waived. Fees are not waived for IBM Watson Research Center employees (the terms of the IBM membership are different from the Avaya and Microsoft agreements). ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. ******************************************************************* Information on participation, registration, accommodations, and travel can be found at: http://dimacs.rutgers.edu/Workshops/Issues/index.html **PLEASE BE SURE TO PRE-REGISTER EARLY** _______________________________________________ Sy-cg-global mailing list Sy-cg-global@dimax.rutgers.edu http://dimax.rutgers.edu/mailman/listinfo/sy-cg-global From Mariette.Yvinec at sophia.inria.fr Wed Oct 30 11:13:20 2002 From: Mariette.Yvinec at sophia.inria.fr (Mariette Yvinec) Date: Mon Jan 9 13:41:08 2006 Subject: Postdoctoral proposal (fwd) Message-ID: <200210301013.g9UADK3Y023947@abeille.inria.fr> --------------------------------------------------------------------- Mariette Yvinec INRIA Sophia-Antipolis email: Mariette.Yvinec@sophia.inria.fr 2004, Route des Lucioles BP 93 phone: 33 (0)4 92.38.77.49 06902 Sophia-Antipolis Cedex (France) fax : 33 (0)4 92.38.76.43 http://www.inria.fr/prisme/personnel/yvinec/yvinec.html ------- Forwarded Message Return-Path: Chakib.BENNIS@ifp.fr Delivery-Date: Tue Oct 29 16:17:38 2002 Return-Path: Received: from sophia.inria.fr (sophia.inria.fr [138.96.64.20]) by papillon.inria.fr (8.12.5/8.12.5) with ESMTP id g9TFHciE028789 for ; Tue, 29 Oct 2002 16:17:38 +0100 Received: from ifp.ifp.fr (ifp.ifp.fr [156.118.212.2]) by sophia.inria.fr (8.12.5/8.12.5) with ESMTP id g9TFHanb019746 for ; Tue, 29 Oct 2002 16:17:37 +0100 Received: from irsun165.ifp.fr (irsun165.ifp.fr [156.118.22.211]) by ifp.ifp.fr (8.9.3/8.9.3) with ESMTP id QAA12854; Tue, 29 Oct 2002 16:16:18 +0100 (MET) Received: from irnts21.ifp.fr (irnts21 [156.118.15.51]) by irsun165.ifp.fr (8.8.5/8.8.5) with ESMTP id QAA00151; Tue, 29 Oct 2002 16:15:47 +0100 (MET) Received: by irnts21.ifp.fr with Internet Mail Service (5.5.2653.19) id ; Tue, 29 Oct 2002 16:15:46 +0100 Message-ID: <488C02265C6AD611BF200002A542182F56DBEF@irnts22.ifp.fr> From: BENNIS Chakib To: "'nospamjcollins@ERC.MsState.Edu'" Subject: Postdoctoral proposal Date: Tue, 29 Oct 2002 16:15:33 +0100 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: multipart/mixed; boundary="----_=_NextPart_000_01C27F5E.068C5A30" X-Spam-Status: No, hits=0.8 required=5.0 tests=SUSPICIOUS_RECIPS,VERY_SUSP_RECIPS version=2.31 X-Spam-Level: This message is in MIME format. Since your mail reader does not understand this format, some or all of this message may not be legible. - ------_=_NextPart_000_01C27F5E.068C5A30 Content-Type: text/plain; charset="iso-8859-1" Dear Colleagues, Please find attached to this e-mail a proposal of a Postdoctoral at IFP in France. I would be very grateful if you could forward it to any of your colleagues, friends or students that could be interested. Best regards, Chakib Bennis - ------_=_NextPart_000_01C27F5E.068C5A30 Content-Type: application/msword; name="Postdoctoral.doc" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="Postdoctoral.doc" 0M8R4KGxGuEAAAAAAAAAAAAAAAAAAAAAPgADAP7/CQAGAAAAAAAAAAAAAAABAAAAJAAAAAAAAAAA EAAAJgAAAAEAAAD+////AAAAACMAAAD///////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////////////////s pcEAcQAMBAAAABK/AAAAAAAAEAAAAAAABAAAHg0AAA4AYmpianQrdCsAAAAAAAAAAAAAAAAAAAAA AAAMBBYAHhQAABZBAQAWQQEAHgkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD//w8AAAAA AAAAAAD//w8AAAAAAAAAAAD//w8AAAAAAAAAAAAAAAAAAAAAAF0AAAAAAPoAAAAAAAAA+gAAAPoA AAAAAAAA+gAAAAAAAAD6AAAAAAAAAPoAAAAAAAAA+gAAABQAAAAAAAAAAAAAAA4BAAAAAAAADgEA AAAAAAAOAQAAAAAAAA4BAAAAAAAADgEAAAwAAAAaAQAADAAAAA4BAAAAAAAAgQcAALYAAAAyAQAA AAAAADIBAAAAAAAAMgEAAAAAAAAyAQAAAAAAADIBAAAAAAAAMgEAAAAAAAAyAQAAAAAAADIBAAAA AAAARgcAAAIAAABIBwAAAAAAAEgHAAAAAAAASAcAAAAAAABIBwAAAAAAAEgHAAAAAAAASAcAACQA AAA3CAAA9AEAACsKAAB6AAAAbAcAABUAAAAAAAAAAAAAAAAAAAAAAAAA+gAAAAAAAAAyAQAAAAAA AAAAAAAAAAAAAAAAAAAAAAAyAQAAAAAAADIBAAAAAAAAMgEAAAAAAAAyAQAAAAAAAGwHAAAAAAAA wAEAAAAAAAD6AAAAAAAAAPoAAAAAAAAAMgEAAAAAAAAAAAAAAAAAADIBAAAAAAAAMgEAAAAAAADA AQAAAAAAAMABAAAAAAAAwAEAAAAAAAAyAQAAjgAAAPoAAAAAAAAAMgEAAAAAAAD6AAAAAAAAADIB AAAAAAAARgcAAAAAAAAAAAAAAAAAAAAAAAAAAAAADgEAAAAAAAAOAQAAAAAAAPoAAAAAAAAA+gAA AAAAAAD6AAAAAAAAAPoAAAAAAAAAMgEAAAAAAABGBwAAAAAAAMABAACGBQAAwAEAAAAAAAAAAAAA AAAAAEYHAAAAAAAA+gAAAAAAAAD6AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAARgcAAAAAAAAyAQAAAAAAACYBAAAMAAAA4DoU5ol+ wgEOAQAAAAAAAA4BAAAAAAAAwAEAAAAAAABGBwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUG9z dGRvY3RvcmFsIFBvc2l0aW9uIGF0IElGUA0NDVN1YmplY3Q6IEh5YnJpZCBHcmlkIGdlbmVyYXRp b24gZm9yIHJlc2Vydm9pciBmbHVpZCBmbG93IHNpbXVsYXRpb24NDUxvY2F0ZWQgMTBrbXMgKDZt aWxlcykgZnJvbSBQYXJpcywgdGhlIEluc3RpdHV0IEZyYW7nYWlzIGR1IFDpdHJvbGUgKElGUCkg aXMgYSBGcmVuY2ggIGluZHVzdHJpYWwgcmVzZWFyY2gsIGVkdWNhdGlvbiwgYW5kIGluZm9ybWF0 aW9uIGNlbnRlciBhY3RpdmUgaW4gdGhlIGZpZWxkcyBvZiBvaWwsIG5hdHVyYWwgZ2FzLCBhbmQg YXV0b21vYmlsZXMuIFRoZSBtaXNzaW9uIG9mIHRoZSBJRlAgaXMgdG8gZGV2ZWxvcCBpbm5vdmF0 aXZlIHRlY2hub2xvZ2llcyB0aGF0IHdpbGwgYWxsb3cgc3VzdGFpbmFibGUgZ3Jvd3RoIG9mIHRo ZSBoeWRyb2NhcmJvbiBhbmQgYXV0b21vYmlsZSBpbmR1c3RyaWVzIGFuZCBwcmVzZXJ2ZSB0aGUg ZW52aXJvbm1lbnQuIFJlc2VhcmNoIGFuZCBEZXZlbG9wbWVudCAoUiZEKSBhdCB0aGUgSUZQIGlz IGFwcGxpZWQgYW5kIGJ5IHZvY2F0aW9uLCBjb3ZlcmluZyBldmVyeSB0ZWNobmljYWwgZmllbGQg cmVsYXRlZCB0byBvaWwgYW5kIG5hdHVyYWwgZ2FzLCB0aGVpciBkZXJpdmF0aXZlcyBhbmQgc3Vi c3RpdHV0ZXM6IGV4cGxvcmF0aW9uLCBkcmlsbGluZywgcHJvZHVjdGlvbiwgcmVmaW5pbmcsIHBl dHJvY2hlbWljYWxzLCBpbnRlcm5hbCBjb21idXN0aW9uIGVuZ2luZXMgYW5kIHRoZSByYXRpb25h bCB1c2Ugb2YgZW5lcmd5LCB0b2dldGhlciB3aXRoIHRoZSBhc3NvY2lhdGVkIGFzcGVjdHMgb2Yg ZW52aXJvbm1lbnRhbCBwcm90ZWN0aW9uLiBUaGlzIGFwcGxpZWQgcmVzZWFyY2ggaXMgaG93ZXZl ciBiYWNrZWQgdXAgYnkgc3Vic3RhbnRpYWwgZnVuZGFtZW50YWwgcmVzZWFyY2ggd2hpY2ggaXMg dml0YWwgZm9yIHRoZSBjb250aW51ZWQgZGV2ZWxvcG1lbnQgb2YgdGhlIElGUCdzIHNjaWVudGlm aWMgYXNzZXRzLCBhbmQgY29uc2VxdWVudGx5LCBvZiBpdHMgbG9uZyB0ZXJtIGZ1dHVyZSAoZm9y IG1vcmUgaW5mb3JtYXRpb24gYWJvdXQgSUZQIHNlZSBodHRwOi8vd3d3LmlmcC5mciApLiAgDVRo ZSBwcm9wb3NlZCB3b3JrIGlzIHJlbGF0ZWQgdG8gYSByZXNlYXJjaCBwcm9ncmFtIGhlbGQgYXQg dGhlIElGUCBvbiBtdWx0aXBoYXNlIGZsdWlkIGZsb3cgc2ltdWxhdGlvbiAgaW4gcG9yb3VzIG1l ZGlhIGFpbWluZyB0byBvcHRpbWlzZSByZXNlcnZvaXIgb2lsIHByb2R1Y3Rpb24uDUdyaWQgZ2Vu ZXJhdGlvbiBhbmQgbWFuYWdlbWVudCBpcyBhIGtleSBzdGVwIGluIHN1Y2gga2luZHMgb2Ygc2lt dWxhdGlvbi4gUmVjZW50bHkgdGhlIElGUCBoYXMgcHJvcG9zZWQgYW4gb3JpZ2luYWwgaHlicmlk IGdyaWQgbW9kZWxsaW5nIG1ldGhvZG9sb2d5IGZvciBtb3JlIGFjY3VyYXRlIHJlc2Vydm9pciBz aW11bGF0aW9uLiBUaGlzIGFwcHJvYWNoIGhhcyBiZWVuIHN1Y2Nlc3NmdWxseSBkZXZlbG9wZWQg YW5kIHRlc3RlZCBpbiB0aGUgMi41RCBjYXNlLiBUaGUgcmV0YWluZWQgY2FuZGlkYXRlIHdpbGwg am9pbiBhbiBhY3RpdmUgcmVzZWFyY2ggdGVhbSBpbiBjaGFyZ2Ugb2YgdGhlIGV4dGVuc2lvbiBv ZiB0aGlzIGh5YnJpZCBtb2RlbGxpbmcgaW50byBmdWxsIDNELCB3aXRoIHRlc3RzIGFuZCB2YWxp ZGF0aW9uLiBNb3JlIHNwZWNpZmljYWxseSBoZS9zaGUgd2lsbCBiZSBpbnZvbHZlZCB3aXRoIHRo ZSBnZW9tZXRyaWNhbCBhc3BlY3RzIG9mIHRoaXMgM0QgZXh0ZW5zaW9uIHJlbGF0ZWQgdG8gZ3Jp ZCBnZW5lcmF0aW9uIGFuZCBtYW5hZ2VtZW50Lg1UaGUgYXBwbGljYW50IHNob3VsZCBoYXZlIGEg cmVjZW50IFBoLiBELiBhbmQgc29tZSBleHBlcmllbmNlIHdvcmtpbmcgd2l0aCBncmlkIGdlbmVy YXRpb24gYW5kL29yIGNvbXB1dGF0aW9uYWwgZ2VvbWV0cnkgYW5kIHNob3VsZCBiZSBmYW1pbGlh ciB3aXRoIHByb2dyYW1taW5nIGluIEMrKyBhbmQgdGhlIFVuaXggZW52aXJvbm1lbnQuIFRoZSBz YWxhcnkgd2lsbCBiZSBvZiBhYm91dCAyMjAwIEV1cm9zL21vbnRoLiBUaGUgZHVyYXRpb24gaXMg ZnJvbSAxMiB0byAxOCBtb250aHMsIHN0YXJ0aW5nIG9uIEphbnVhcnkgMjAwMy4NDUZvciBhcHBs aWNhdGlvbiBvciBtb3JlIGluZm9ybWF0aW9uIHBsZWFzZSBjb250YWN0IGFuZC9vciBzZW5kIHlv dXIgcmVzdW1lIHRvOg1DaGFraWIgQmVubmlzDTEgJiA0LCBhdmVudWUgZGUgQm9pcy1QculhdQ05 Mjg1MiBSdWVpbC1NYWxtYWlzb24NRnJhbmNlDVBob25lOiArMzMgMSA0NyA1MiA3MSAzMQ1GYXg6 ICszMyAxIDQ3IDUyIDcwIDIyDUUtbWFpbDogQ2hha2liLkJlbm5pc0BpZnAuZnINDQ0NAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAdBAAA HwQAACgEAADhCAAAHg0AAP348vjvAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAEQ0oYAAALNQiBQ0oYAG1ICQgIQ0oYAG1ICQgAAzUIgQAFAAQAAB0EAAAe BAAAHwQAAGMEAABkBAAAPAgAAOEIAAAHCwAANwwAADgMAACHDAAAlQwAALEMAADHDAAAzgwAAOcM AAD+DAAAGw0AABwNAAAdDQAAHg0AAPwAAAAAAAAAAAAAAAD5AAAAAAAAAAAAAAAA+QAAAAAAAAAA AAAAAPkAAAAAAAAAAAAAAAD5AAAAAAAAAAAAAAAA+QAAAAAAAAAAAAAAAPkAAAAAAAAAAAAAAAD3 AAAAAAAAAAAAAAAA9wAAAAAAAAAAAAAAAPcAAAAAAAAAAAAAAAD3AAAAAAAAAAAAAAAA9wAAAAAA AAAAAAAAAPcAAAAAAAAAAAAAAAD3AAAAAAAAAAAAAAAA9wAAAAAAAAAAAAAAAPcAAAAAAAAAAAAA AAD3AAAAAAAAAAAAAAAA9wAAAAAAAAAAAAAAAPcAAAAAAAAAAAAAAAD3AAAAAAAAAAAAAAAA9wAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQ8AAwAAAyQDAwEAAyQBABUABAAAHQQAAB4E AAAfBAAAYwQAAGQEAAA8CAAA4QgAAAcLAAA3DAAAOAwAAIcMAACVDAAAsQwAAMcMAADODAAA5wwA AP4MAAAbDQAAHA0AAB0NAAAeDQAA/Pn28/Dt6ujo6Ojo6Ojo6Ojo6OjoAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMC DwAFBsT7//8FBpz///8FBp3///8FBuH///8FBuL///8FBuP///8FAgEABQAAFRwAH7CCLiCwxkEh sIkFIrCJBSOQiQUkkIkFJbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEgAQAAoAAQBbAA8A AgAAAAAAAAAkAABA8f8CACQAAAAGAE4AbwByAG0AYQBsAAAAAgAAAAQAbUgMBDgAAUABAAIAOAAA AAcAVABpAHQAcgBlACAAMQAAAAgAAQAGJAFAJgAPAENKGABoCABtSAkIbkgMBAAAAAAAAAAAAAAA AAAAAAAAMgBBQPL/oQAyAAAAEQBQAG8AbABpAGMAZQAgAHAAYQByACAAZADpAGYAYQB1AHQAAAAA AAAAAAAAAAAAOABCQAEA8gA4AAAADgBDAG8AcgBwAHMAIABkAGUAIAB0AGUAeAB0AGUAAAAFAA8A AyQDAAQAbUgJCAAAAAAeCQAABQAAFAAABgD/////AAQAAB4NAAAHAAAAAAQAAB4NAAAIAAAAAAQA AB4NAAAJAAAAAAAAAIsAAACTAAAAlAAAAJwAAACgAAAApwAAAOsAAADxAAAAvgMAAMMDAAAqBwAA LAcAAOoHAADvBwAAhwgAAI0IAACOCAAAlAgAAKYIAACwCAAAtwgAAMYIAAAgCQAABwAcAAcAHAAH ABwABwAcAAcAHAAHABwABwAcAAcAHAAHABwABwAcAAcAHAAHAP//FAAAAAYAYgBlAG4AbgBpAHMA JwBEADoAXABVAHMAZQByAFwAVQBTAEUAUgBTAFwAQgBlAG4AbgBpAHMAUABDAFwAUABvAHMAdABk AG8AYwB0AG8AcgBhAGwALgBkAG8AYwAGAGIAZQBuAG4AaQBzACcARAA6AFwAVQBzAGUAcgBcAFUA UwBFAFIAUwBcAEIAZQBuAG4AaQBzAFAAQwBcAFAAbwBzAHQAZABvAGMAdABvAHIAYQBsAC4AZABv AGMABgBiAGUAbgBuAGkAcwAnAEQAOgBcAFUAcwBlAHIAXABVAFMARQBSAFMAXABCAGUAbgBuAGkA cwBQAEMAXABQAG8AcwB0AGQAbwBjAHQAbwByAGEAbAAuAGQAbwBjAAYAYgBlAG4AbgBpAHMANQBE ADoAXABVAHMAZQByAFwARQBuAHIAZQBnAGkAcwB0AHIAZQBtAGUAbgB0ACAAYQB1AHQAbwBtAGEA dABpAHEAdQBlACAAZABlAFAAbwBzAHQAZABvAGMAdABvAHIAYQBsAC4AYQBzAGQABgBiAGUAbgBu AGkAcwBeAEQAOgBcAEQAbwBjAHUAbQBlAG4AdABzACAAYQBuAGQAIABTAGUAdAB0AGkAbgBnAHMA XABiAGUAbgBuAGkAcwBcAEwAbwBjAGEAbAAgAFMAZQB0AHQAaQBuAGcAcwBcAFQAZQBtAHAAbwBy AGEAcgB5ACAASQBuAHQAZQByAG4AZQB0ACAARgBpAGwAZQBzAFwATwBMAEsARQBcAFAAbwBzAHQA ZABvAGMAdABvAHIAYQBsAC4AZABvAGMABgBiAGUAbgBuAGkAcwBeAEQAOgBcAEQAbwBjAHUAbQBl AG4AdABzACAAYQBuAGQAIABTAGUAdAB0AGkAbgBnAHMAXABiAGUAbgBuAGkAcwBcAEwAbwBjAGEA bAAgAFMAZQB0AHQAaQBuAGcAcwBcAFQAZQBtAHAAbwByAGEAcgB5ACAASQBuAHQAZQByAG4AZQB0 ACAARgBpAGwAZQBzAFwATwBMAEsARQBcAFAAbwBzAHQAZABvAGMAdABvAHIAYQBsAC4AZABvAGMA DgBEAGEAcgByAHkAbAAgAEYAZQBuAHcAaQBjAGsANQBEADoAXABUAEUATQBQAFwARQBuAHIAZQBn AGkAcwB0AHIAZQBtAGUAbgB0ACAAYQB1AHQAbwBtAGEAdABpAHEAdQBlACAAZABlAFAAbwBzAHQA ZABvAGMAdABvAHIAYQBsAC4AYQBzAGQADgBEAGEAcgByAHkAbAAgAEYAZQBuAHcAaQBjAGsAMgBD ADoAXABXAEkATgBOAFQAXABQAHIAbwBmAGkAbABlAHMAXABmAGUAbgB3AGkAYwBrAGQAXABCAHUA cgBlAGEAdQBcAFAAbwBzAHQAZABvAGMAdABvAHIAYQBsAC4AZABvAGMABgBiAGUAbgBuAGkAcwA1 AEQAOgBcAFUAcwBlAHIAXABFAG4AcgBlAGcAaQBzAHQAcgBlAG0AZQBuAHQAIABhAHUAdABvAG0A YQB0AGkAcQB1AGUAIABkAGUAUABvAHMAdABkAG8AYwB0AG8AcgBhAGwALgBhAHMAZAAGAGIAZQBu AG4AaQBzAF4ARAA6AFwARABvAGMAdQBtAGUAbgB0AHMAIABhAG4AZAAgAFMAZQB0AHQAaQBuAGcA cwBcAGIAZQBuAG4AaQBzAFwATABvAGMAYQBsACAAUwBlAHQAdABpAG4AZwBzAFwAVABlAG0AcABv AHIAYQByAHkAIABJAG4AdABlAHIAbgBlAHQAIABGAGkAbABlAHMAXABPAEwASwBFAFwAUABvAHMA dABkAG8AYwB0AG8AcgBhAGwALgBkAG8AYwD/QAOAAQA2CAAANggAAHQf4gHsAOwANggAAAAAAAA2 CAAAAAAAAAIQAAAAAAAAAB4JAABQAAAIAEAAAAMAAABHFpABAAACAgYDBQQFAgMEh3oAAAAAAIAI AAAAAAAAAP8AAAAAAAAAVABpAG0AZQBzACAATgBlAHcAIABSAG8AbQBhAG4AAAA1FpABAgAFBQEC AQcGAgUHAAAAAAAAABAAAAAAAAAAAAAAAIAAAAAAUwB5AG0AYgBvAGwAAAAzJpABAAACCwYEAgIC AgIEh3oAAAAAAIAIAAAAAAAAAP8AAAAAAAAAQQByAGkAYQBsAAAAIgAEAHAIjBgAAMQCAACpAQAA AACs4momueNqJtLLaqYDAAsAAABRAQAAhAcAAAEAAwAAAAQAAxAQAAAAAAAAAAAAAAABAAEAAAAB AAAAAAAAACEDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKUGwAe0ALQAgAASMAAAEAAZ AGQAAAAZAAAAOgkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAACAAAAAAD//xIAAAAAAAAAHABQAG8AcwB0AGQAbwBjAHQAbwBy AGEAbAAgAFAAbwBzAGkAdABpAG8AbgAgAGEAdAAgAEkARgBQAAAAAAAAAAYAYgBlAG4AbgBpAHMA BgBiAGUAbgBuAGkAcwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP7/AAAFAAIAAAAAAAAAAAAAAAAA AAAAAAEAAADghZ/y+U9oEKuRCAArJ7PZMAAAAJgBAAASAAAAAQAAAJgAAAACAAAAoAAAAAMAAADI AAAABAAAANQAAAAFAAAA5AAAAAYAAADwAAAABwAAAPwAAAAIAAAAEAEAAAkAAAAgAQAAEgAAACwB AAAKAAAASAEAAAsAAABUAQAADAAAAGABAAANAAAAbAEAAA4AAAB4AQAADwAAAIABAAAQAAAAiAEA ABMAAACQAQAAAgAAAOQEAAAeAAAAHQAAAFBvc3Rkb2N0b3JhbCBQb3NpdGlvbiBhdCBJRlAAAE1p HgAAAAEAAAAAb3N0HgAAAAcAAABiZW5uaXMAdB4AAAABAAAAAGVubh4AAAABAAAAAGVubh4AAAAL AAAATm9ybWFsLmRvdABsHgAAAAcAAABiZW5uaXMAZB4AAAACAAAAMwBubh4AAAATAAAATWljcm9z b2Z0IFdvcmQgOC4wAG9AAAAAAAJkiQEAAABAAAAAANyMUjF8wgFAAAAAADDJimZ+wgFAAAAAAF7F 4ol+wgEDAAAAAQAAAAMAAABRAQAAAwAAAIQHAAADAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD+/wAABQACAAAAAAAAAAAAAAAAAAAAAAACAAAA AtXN1ZwuGxCTlwgAKyz5rkQAAAAF1c3VnC4bEJOXCAArLPmuSAEAAAQBAAAMAAAAAQAAAGgAAAAP AAAAcAAAAAUAAAB8AAAABgAAAIQAAAARAAAAjAAAABcAAACUAAAACwAAAJwAAAAQAAAApAAAABMA AACsAAAAFgAAALQAAAANAAAAvAAAAAwAAADlAAAAAgAAAOQEAAAeAAAABAAAAElGUAADAAAAEAAA AAMAAAADAAAAAwAAADoJAAADAAAAMRUIAAsAAAAAAAAACwAAAAAAAAALAAAAAAAAAAsAAAAAAAAA HhAAAAEAAAAdAAAAUG9zdGRvY3RvcmFsIFBvc2l0aW9uIGF0IElGUAAMEAAAAgAAAB4AAAAGAAAA VGl0cmUAAwAAAAEAAAAAmAAAAAMAAAAAAAAAIAAAAAEAAAA2AAAAAgAAAD4AAAABAAAAAgAAAAoA AABfUElEX0dVSUQAAgAAAOQEAABBAAAATgAAAHsANQAwADUARAA1ADAAMwBBAC0ANAAxAEEARQAt ADQARQBGAEEALQBCADYAQQBGAC0ANgBEADMAQQA0ADEAQgAwADQARQBFADAAfQAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAIAAAADAAAABAAAAAUAAAAGAAAABwAAAAgAAAAJAAAA CgAAAP7///8MAAAADQAAAA4AAAAPAAAAEAAAABEAAAASAAAA/v///xQAAAAVAAAAFgAAABcAAAAY AAAAGQAAABoAAAD+////HAAAAB0AAAAeAAAAHwAAACAAAAAhAAAAIgAAAP7////9////JQAAAP7/ ///+/////v////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////9SAG8AbwB0ACAARQBuAHQAcgB5AAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFgAFAf//////////AwAAAAYJAgAAAAAAwAAAAAAA AEYAAAAAkKGVOHx+wgHAAyXmiX7CAScAAACAAAAAAAAAADEAVABhAGIAbABlAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAOAAIA//////////////// AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACwAAAAAQAAAAAAAAVwBvAHIAZABE AG8AYwB1AG0AZQBuAHQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABoA AgEFAAAA//////////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAHhQA AAAAAAAFAFMAdQBtAG0AYQByAHkASQBuAGYAbwByAG0AYQB0AGkAbwBuAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAKAACAQIAAAAEAAAA/////wAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAABMAAAAAEAAAAAAAAAUARABvAGMAdQBtAGUAbgB0AFMAdQBtAG0AYQByAHkASQBuAGYA bwByAG0AYQB0AGkAbwBuAAAAAAAAAAAAAAA4AAIB////////////////AAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAGwAAAAAQAAAAAAAAAQBDAG8AbQBwAE8AYgBqAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABIAAgEBAAAABgAAAP////8A AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAagAAAAAAAABPAGIAagBlAGMA dABQAG8AbwBsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFgAB AP///////////////wAAAAAAAAAAAAAAAAAAAAAAAAAAwAMl5ol+wgHAAyXmiX7CAQAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAA////////////////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAQAAAP7///////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////8BAP7/AwoAAP////8GCQIAAAAAAMAAAAAAAABGGAAAAERvY3VtZW50 IE1pY3Jvc29mdCBXb3JkAAoAAABNU1dvcmREb2MAEAAAAFdvcmQuRG9jdW1lbnQuOAD0ObJxAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAA== - ------_=_NextPart_000_01C27F5E.068C5A30 Content-Type: text/plain; name="Postdoctoral.txt" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="Postdoctoral.txt" //5QAG8AcwB0AGQAbwBjAHQAbwByAGEAbAAgAFAAbwBzAGkAdABpAG8AbgAgAGEAdAAgAEkARgBQ AA0ACgANAAoADQAKAFMAdQBiAGoAZQBjAHQAOgAgAEgAeQBiAHIAaQBkACAARwByAGkAZAAgAGcA ZQBuAGUAcgBhAHQAaQBvAG4AIABmAG8AcgAgAHIAZQBzAGUAcgB2AG8AaQByACAAZgBsAHUAaQBk ACAAZgBsAG8AdwAgAHMAaQBtAHUAbABhAHQAaQBvAG4ADQAKAA0ACgBMAG8AYwBhAHQAZQBkACAA MQAwAGsAbQBzACAAKAA2ACAAbQBpAGwAZQBzACkAIABmAHIAbwBtACAAUABhAHIAaQBzACwAIAB0 AGgAZQAgAEkAbgBzAHQAaQB0AHUAdAAgAEYAcgBhAG4A5wBhAGkAcwAgAGQAdQAgAFAA6QB0AHIA bwBsAGUAIAAoAEkARgBQACkAIAANAAoAaQBzACAAYQAgAEYAcgBlAG4AYwBoACAAIABpAG4AZAB1 AHMAdAByAGkAYQBsACAAcgBlAHMAZQBhAHIAYwBoACwAIABlAGQAdQBjAGEAdABpAG8AbgAsACAA YQBuAGQAIABpAG4AZgBvAHIAbQBhAHQAaQBvAG4AIABjAGUAbgB0AGUAcgAgAGEAYwB0AGkAdgBl ACAADQAKAGkAbgAgAHQAaABlACAAZgBpAGUAbABkAHMAIABvAGYAIABvAGkAbAAsACAAbgBhAHQA dQByAGEAbAAgAGcAYQBzACwAIABhAG4AZAAgAGEAdQB0AG8AbQBvAGIAaQBsAGUAcwAuACAAVABo AGUAIABtAGkAcwBzAGkAbwBuACAAbwBmACAAdABoAGUAIABJAEYAUAAgAA0ACgBpAHMAIAB0AG8A IABkAGUAdgBlAGwAbwBwACAAaQBuAG4AbwB2AGEAdABpAHYAZQAgAHQAZQBjAGgAbgBvAGwAbwBn AGkAZQBzACAAdABoAGEAdAAgAHcAaQBsAGwAIABhAGwAbABvAHcAIABzAHUAcwB0AGEAaQBuAGEA YgBsAGUAIABnAHIAbwB3AHQAaAAgAA0ACgBvAGYAIAB0AGgAZQAgAGgAeQBkAHIAbwBjAGEAcgBi AG8AbgAgAGEAbgBkACAAYQB1AHQAbwBtAG8AYgBpAGwAZQAgAGkAbgBkAHUAcwB0AHIAaQBlAHMA IABhAG4AZAAgAHAAcgBlAHMAZQByAHYAZQAgAHQAaABlACAAZQBuAHYAaQByAG8AbgBtAGUAbgB0 AC4AIAANAAoAUgBlAHMAZQBhAHIAYwBoACAAYQBuAGQAIABEAGUAdgBlAGwAbwBwAG0AZQBuAHQA IAAoAFIAJgBEACkAIABhAHQAIAB0AGgAZQAgAEkARgBQACAAaQBzACAAYQBwAHAAbABpAGUAZAAg AGEAbgBkACAAYgB5ACAAdgBvAGMAYQB0AGkAbwBuACwAIABjAG8AdgBlAHIAaQBuAGcAIAANAAoA ZQB2AGUAcgB5ACAAdABlAGMAaABuAGkAYwBhAGwAIABmAGkAZQBsAGQAIAByAGUAbABhAHQAZQBk ACAAdABvACAAbwBpAGwAIABhAG4AZAAgAG4AYQB0AHUAcgBhAGwAIABnAGEAcwAsACAAdABoAGUA aQByACAAZABlAHIAaQB2AGEAdABpAHYAZQBzACAAYQBuAGQAIAANAAoAcwB1AGIAcwB0AGkAdAB1 AHQAZQBzADoAIABlAHgAcABsAG8AcgBhAHQAaQBvAG4ALAAgAGQAcgBpAGwAbABpAG4AZwAsACAA cAByAG8AZAB1AGMAdABpAG8AbgAsACAAcgBlAGYAaQBuAGkAbgBnACwAIABwAGUAdAByAG8AYwBo AGUAbQBpAGMAYQBsAHMALAAgAGkAbgB0AGUAcgBuAGEAbAAgAA0ACgBjAG8AbQBiAHUAcwB0AGkA bwBuACAAZQBuAGcAaQBuAGUAcwAgAGEAbgBkACAAdABoAGUAIAByAGEAdABpAG8AbgBhAGwAIAB1 AHMAZQAgAG8AZgAgAGUAbgBlAHIAZwB5ACwAIAB0AG8AZwBlAHQAaABlAHIAIAB3AGkAdABoACAA dABoAGUAIABhAHMAcwBvAGMAaQBhAHQAZQBkACAADQAKAGEAcwBwAGUAYwB0AHMAIABvAGYAIABl AG4AdgBpAHIAbwBuAG0AZQBuAHQAYQBsACAAcAByAG8AdABlAGMAdABpAG8AbgAuACAAVABoAGkA cwAgAGEAcABwAGwAaQBlAGQAIAByAGUAcwBlAGEAcgBjAGgAIABpAHMAIABoAG8AdwBlAHYAZQBy ACAAYgBhAGMAawBlAGQAIAB1AHAADQAKACAAYgB5ACAAcwB1AGIAcwB0AGEAbgB0AGkAYQBsACAA ZgB1AG4AZABhAG0AZQBuAHQAYQBsACAAcgBlAHMAZQBhAHIAYwBoACAAdwBoAGkAYwBoACAAaQBz ACAAdgBpAHQAYQBsACAAZgBvAHIAIAB0AGgAZQAgAGMAbwBuAHQAaQBuAHUAZQBkACAAZABlAHYA ZQBsAG8AcABtAGUAbgB0ACAADQAKAG8AZgAgAHQAaABlACAASQBGAFAAJwBzACAAcwBjAGkAZQBu AHQAaQBmAGkAYwAgAGEAcwBzAGUAdABzACwAIABhAG4AZAAgAGMAbwBuAHMAZQBxAHUAZQBuAHQA bAB5ACwAIABvAGYAIABpAHQAcwAgAGwAbwBuAGcAIAB0AGUAcgBtACAAZgB1AHQAdQByAGUAIAAN AAoAKABmAG8AcgAgAG0AbwByAGUAIABpAG4AZgBvAHIAbQBhAHQAaQBvAG4AIABhAGIAbwB1AHQA IABJAEYAUAAgAHMAZQBlACAAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGkAZgBwAC4AZgByACAAKQAu AA0ACgANAAoAVABoAGUAIABwAHIAbwBwAG8AcwBlAGQAIAB3AG8AcgBrACAAaQBzACAAcgBlAGwA YQB0AGUAZAAgAHQAbwAgAGEAIAByAGUAcwBlAGEAcgBjAGgAIABwAHIAbwBnAHIAYQBtACAAaABl AGwAZAAgAGEAdAAgAHQAaABlACAASQBGAFAAIABvAG4AIABtAHUAbAB0AGkAcABoAGEAcwBlAA0A CgAgAGYAbAB1AGkAZAAgAGYAbABvAHcAIABzAGkAbQB1AGwAYQB0AGkAbwBuACAAIABpAG4AIABw AG8AcgBvAHUAcwAgAG0AZQBkAGkAYQAgAGEAaQBtAGkAbgBnACAAdABvACAAbwBwAHQAaQBtAGkA cwBlACAAcgBlAHMAZQByAHYAbwBpAHIAIABvAGkAbAAgAHAAcgBvAGQAdQBjAHQAaQBvAG4ALgAN AAoARwByAGkAZAAgAGcAZQBuAGUAcgBhAHQAaQBvAG4AIABhAG4AZAAgAG0AYQBuAGEAZwBlAG0A ZQBuAHQAIABpAHMAIABhACAAawBlAHkAIABzAHQAZQBwACAAaQBuACAAcwB1AGMAaAAgAGsAaQBu AGQAcwAgAG8AZgAgAHMAaQBtAHUAbABhAHQAaQBvAG4ALgAgAFIAZQBjAGUAbgB0AGwAeQAgAA0A CgB0AGgAZQAgAEkARgBQACAAaABhAHMAIABwAHIAbwBwAG8AcwBlAGQAIABhAG4AIABvAHIAaQBn AGkAbgBhAGwAIABoAHkAYgByAGkAZAAgAGcAcgBpAGQAIABtAG8AZABlAGwAbABpAG4AZwAgAG0A ZQB0AGgAbwBkAG8AbABvAGcAeQAgAGYAbwByACAAbQBvAHIAZQAgAGEAYwBjAHUAcgBhAHQAZQAN AAoAIAByAGUAcwBlAHIAdgBvAGkAcgAgAHMAaQBtAHUAbABhAHQAaQBvAG4ALgAgAFQAaABpAHMA IABhAHAAcAByAG8AYQBjAGgAIABoAGEAcwAgAGIAZQBlAG4AIABzAHUAYwBjAGUAcwBzAGYAdQBs AGwAeQAgAGQAZQB2AGUAbABvAHAAZQBkACAAYQBuAGQAIAB0AGUAcwB0AGUAZAAgAGkAbgAgAA0A CgB0AGgAZQAgADIALgA1AEQAIABjAGEAcwBlAC4AIABUAGgAZQAgAHIAZQB0AGEAaQBuAGUAZAAg AGMAYQBuAGQAaQBkAGEAdABlACAAdwBpAGwAbAAgAGoAbwBpAG4AIABhAG4AIABhAGMAdABpAHYA ZQAgAHIAZQBzAGUAYQByAGMAaAAgAHQAZQBhAG0AIABpAG4AIABjAGgAYQByAGcAZQAgAA0ACgBv AGYAIAB0AGgAZQAgAGUAeAB0AGUAbgBzAGkAbwBuACAAbwBmACAAdABoAGkAcwAgAGgAeQBiAHIA aQBkACAAbQBvAGQAZQBsAGwAaQBuAGcAIABpAG4AdABvACAAZgB1AGwAbAAgADMARAAsACAAdwBp AHQAaAAgAHQAZQBzAHQAcwAgAGEAbgBkACAAdgBhAGwAaQBkAGEAdABpAG8AbgAuAA0ACgBNAG8A cgBlACAAcwBwAGUAYwBpAGYAaQBjAGEAbABsAHkAIABoAGUALwBzAGgAZQAgAHcAaQBsAGwAIABi AGUAIABpAG4AdgBvAGwAdgBlAGQAIAB3AGkAdABoACAAdABoAGUAIABnAGUAbwBtAGUAdAByAGkA YwBhAGwAIABhAHMAcABlAGMAdABzACAAbwBmACAAdABoAGkAcwAgADMARAAgAA0ACgBlAHgAdABl AG4AcwBpAG8AbgAgAHIAZQBsAGEAdABlAGQAIAB0AG8AIABnAHIAaQBkACAAZwBlAG4AZQByAGEA dABpAG8AbgAgAGEAbgBkACAAbQBhAG4AYQBnAGUAbQBlAG4AdAAuAA0ACgANAAoAVABoAGUAIABh AHAAcABsAGkAYwBhAG4AdAAgAHMAaABvAHUAbABkACAAaABhAHYAZQAgAGEAIAByAGUAYwBlAG4A dAAgAFAAaAAuACAARAAuACAAYQBuAGQAIABzAG8AbQBlACAAZQB4AHAAZQByAGkAZQBuAGMAZQAg AHcAbwByAGsAaQBuAGcAIAB3AGkAdABoACAAZwByAGkAZAANAAoAZwBlAG4AZQByAGEAdABpAG8A bgAgAGEAbgBkAC8AbwByACAAYwBvAG0AcAB1AHQAYQB0AGkAbwBuAGEAbAAgAGcAZQBvAG0AZQB0 AHIAeQAgAGEAbgBkACAAcwBoAG8AdQBsAGQAIABiAGUAIABmAGEAbQBpAGwAaQBhAHIAIAB3AGkA dABoACAAcAByAG8AZwByAGEAbQBtAGkAbgBnACAADQAKAGkAbgAgAEMAKwArACAAYQBuAGQAIAB0 AGgAZQAgAFUAbgBpAHgAIABlAG4AdgBpAHIAbwBuAG0AZQBuAHQALgAgAFQAaABlACAAcwBhAGwA YQByAHkAIAB3AGkAbABsACAAYgBlACAAbwBmACAAYQBiAG8AdQB0ACAAMgAyADAAMAAgAEUAdQBy AG8AcwAvAG0AbwBuAHQAaAAuACAADQAKAFQAaABlACAAZAB1AHIAYQB0AGkAbwBuACAAaQBzACAA ZgByAG8AbQAgADEAMgAgAHQAbwAgADEAOAAgAG0AbwBuAHQAaABzACwAIABzAHQAYQByAHQAaQBu AGcAIABvAG4AIABKAGEAbgB1AGEAcgB5ACAAMgAwADAAMwAuAA0ACgANAAoARgBvAHIAIABhAHAA cABsAGkAYwBhAHQAaQBvAG4AIABvAHIAIABtAG8AcgBlACAAaQBuAGYAbwByAG0AYQB0AGkAbwBu ACAAcABsAGUAYQBzAGUAIABjAG8AbgB0AGEAYwB0ACAAYQBuAGQALwBvAHIAIABzAGUAbgBkACAA eQBvAHUAcgAgAHIAZQBzAHUAbQBlACAAdABvADoADQAKAEMAaABhAGsAaQBiACAAQgBlAG4AbgBp AHMADQAKADEAIAAmACAANAAsACAAYQB2AGUAbgB1AGUAIABkAGUAIABCAG8AaQBzAC0AUAByAOkA YQB1AA0ACgA5ADIAOAA1ADIAIABSAHUAZQBpAGwALQBNAGEAbABtAGEAaQBzAG8AbgANAAoARgBy AGEAbgBjAGUADQAKAFAAaABvAG4AZQA6ACAAKwAzADMAIAAxACAANAA3ACAANQAyACAANwAxACAA MwAxAA0ACgBGAGEAeAA6ACAAKwAzADMAIAAxACAANAA3ACAANQAyACAANwAwACAAMgAyAA0ACgBF AC0AbQBhAGkAbAA6ACAAQwBoAGEAawBpAGIALgBCAGUAbgBuAGkAcwBAAGkAZgBwAC4AZgByAA0A CgANAAoADQAKAA0ACgA= - ------_=_NextPart_000_01C27F5E.068C5A30-- ------- End of Forwarded Message ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From hra at cs.uga.edu Thu Oct 31 12:46:26 2002 From: hra at cs.uga.edu (Hamid Arabnia) Date: Mon Jan 9 13:41:08 2006 Subject: Call For Papers: 2003 Int'l Joint Conf. on CS and CE - Las Vegas, June 23, 2003 Message-ID: <200210311746.MAA09279@apollo.cs.uga.edu> C A L L F O R P A P E R S The 2003 International Multiconference in Computer Science and Computer Engineering (14 Joint Int'l Conferences) Monte Carlo Resort, Las Vegas, Nevada, USA June 23-26, 2003 Dear Colleagues: You are invited to submit a draft paper (see instructions below) and/or a proposal to organize a technical session/workshop. All accepted papers will be published in the respective conference proceedings. The names of technical session/workshop organizers/chairs will appear on the cover of the proceedings/books as Associate Editors. Any help in distributing this announcement would be most appreciated. The 2003 International Multiconference in Computer Science & Computer Engineering is composed of the following 14 conferences. They will be held simultaneously (same location & dates): 1. The 2003 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'03) 2. The 2003 International Conference on Imaging Science, Systems, and Technology (CISST'03) 3. The 2003 International Conference on Artificial Intelligence (IC-AI'03) 4. The 2003 International Conference on Internet Computing (IC'03) 5. The 2003 International Conference on Embedded Systems and Applications (ESA'03) 6. The 2003 International Conference on Wireless Networks (ICWN'03) 7. The 2003 International Conference on Machine Learning; Models, Technologies and Applications (MLMTA) 8. The 2003 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS'03) 9. The 2003 International Conference on Communications in Computing (CIC'03) 10. The 2003 International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'03) 11. The 2003 International Conference on VLSI (VLSI'03) 12. The 2003 International Conference on Information and Knowledge Engineering (IKE'03) 13. The 2003 International Conference on Software Engineering Research and Practice (SERP'03) 14. The 2003 International Conference on Security and Management (SAM'03) (a link to each conference's URL will soon be available from http://www.ashland.edu/~iajwa/conferences - under construction.) Please regard this announcement as General Guidelines. You are requested to send your submission to the Multiconference chair whose address appears below (The Chair may be forwarding the papers to respective conference chairs/committees). CONFERENCES CONTACT: H. R. Arabnia, Ph.D. Chair, The 2003 Int'l Multiconference in CS & CE The University of Georgia Department of Computer Science 415 Graduate Studies Research Center Athens, Georgia 30602-7404, U.S.A. Tel: (706) 542-3480 Fax: (706) 542-2966 email: hra@cs.uga.edu HISTORY: The International Multiconference in Computer Science & Computer Engineering is a major annual international research event. The last Multiconference attracted over 1,550 computer science and Engineering researchers from 72 countries. It is anticipated that The 2003 Int'l Multiconference will attract about 2000 participants. The 2003 event is composed of 14 (planned) major conferences - attendees will have full access to all 14 conferences' sessions & tracks. SUBMISSION OF PAPERS: Prospective authors are invited to submit three copies of their draft paper (about 5 pages - single space, font size of 10 to 12) to H. R. Arabnia by the due date (who may be forwarding the papers to respective conference chairs/committees). E-mail & Fax submissions are also acceptable. The length of the Camera-Ready papers (if accepted) will be limited to 7 (IEEE style) pages. Papers must not have been previously published or currently submitted for publication elsewhere. The first page of the draft paper should include: title of the paper, name, affiliation, postal address, E-mail address, telephone number, & Fax number for each author. The first page should also include the name of the author who will be presenting the paper (if accepted) & a maximum of 5 keywords. EVALUATION PROCESS: Papers will be evaluated for originality, significance, clarity, & soundness. Each paper will be refereed by two researchers in the topical area. The Camera-Ready papers will be reviewed by one person. PUBLICATION: The conference proceedings will be published by CSREA Press (ISBN) in hardcopy. The proceedings will be available at the conference. Some accepted papers will also be considered for journal publication (soon after the conference). (In addition to the hardcopy, it is also planned to publish the papers on a CD.) All conference proceedings published by CSREA Press are considered for inclusion in major database indexes that are designed to provide easy access to the current literature of the sciences (database examples: ISI Thomson Scientific, IEE INSPEC, ...). ORGANIZERS/SPONSORS: A number of university faculty members & their staff in cooperation with the Monte Carlo Resort (Conference Division, Las Vegas ), will be organizing the conference. The conference will be sponsored by World Academy of Sciences & co-sponsored by Computer Science Research, Education, & Applications Press (CSREA: USA Federal EIN # 58-2171953) together with research centers, international associations, international research groups, & developers of high-performance machines & systems. The complete list of sponsors & co-sponsors will be available at a later time. (Previous conferences' sponsors included: CSREA, the National Supercomputing Center for Energy & the Environment - DOE, The Int'l Association for Mathematics & Computers in Simulation, The Int'l Technology Institute (ITI), Java High Performance Computing research group, World Scientific & Engineering Society, Sundance Digital Signal Processing Inc., Computer Vision R&A Tech., Hewlett-Packard Inc., Korea Information Processing Society (KIPS), Society of Japan (SIGMPS/IPSJ), a number of publishers of books & journals, ...) LOCATION OF CONFERENCES: The conference will be held in the Monte Carlo Resort hotel Las Vegas, Nevada, USA (with any overflows at other near-by hotels). The Monte Carlo Resort is a mega hotel with excellent conference facilities & over 3,000 rooms. The hotel is minutes from the Las Vegas airport with 24-hour shuttle service to & from the airport. This hotel has many vacation & recreational attractions, including: waterfalls, casino, spa, pools & kiddie pools, sunning decks, Easy River water ride, wave pool with cascades, lighted tennis courts, health spa (with workout equipment, whirlpool, sauna, ...), arcade virtual reality game rooms, nightly shows, snack bars, a number of restaurants, shopping area, bars, ... Many of these attractions are open 24 hours a day & most are suitable for families & children. The negotiated hotel's room rate for conference attendees is very reasonable. The hotel is within walking distance from most other Las Vegas attractions (major shopping areas, recreational destinations, fine dining & night clubs, free street shows, ...). IMPORTANT DATES: (Some tracks have different deadlines - check the web site) Feb. 17, 2003 (Monday): Draft papers (about 5 pages) due March 21, 2003 (Friday): Notification of acceptance April 22, 2003 (Tuesday): Camera-Ready papers & Prereg. due June 23-26, 2003: All 14 Int'l Conferences Proposals to organize technical sessions should be submitted as soon as possible. PROPOSAL FOR ORGANIZING TECHNICAL SESSIONS: Each technical session will have at least 6 papers. The session chairs will be responsible for all aspects of their sessions; including, soliciting papers, reviewing, selecting, ... The names of session chairs will appear as Associate Editors on the cover of the conference proceedings. After the conference, some sessions will be considered for publication in relevant journals as Special Issues with the session proposer as the Guest Editor of the journal. Proposals to organize technical sessions should include the following information: name & address (+ E-mail) of proposer, title of session, a 100-word description of the topic of the session, & a short description on how the session will be advertised (in most cases, session proposers solicit papers from colleagues & researchers whose work is known to the session proposer). Mail your proposal to H. R. Arabnia; E-mail submissions are preferred. MEMBERS OF PROGRAM & ORGANIZING COMMITTEES: The Program Committees are currently being formed. Those interested in joining the Program Committees should email H. R. Arabnia (hra@cs.uga.edu) the following information: Name, affiliation & position, complete mailing address, email address, tel/fax numbers, name of the conference offering to help with, a short biography together with research interests. EXHIBITION & ROBOTICS COMPETITION: An exhibition is planned for the duration of the conferences. Interested parties should contact H. R. Arabnia (address is given below). All exhibitors will be considered to be the co-sponsors of the conferences. There will also be a Robotics Competition (refer to the following url for regulations and more information: www.cs.uga.edu/~potter/robotics/RoboticsCompetition.htm TOPICAL SCOPE FOR EACH CONFERENCE APPEARS BELOW (the list of topics that appear below should be regarded as a partial list of topics. each conference considers papers in ALL ASPECTS of its domain.) SCOPE OF PDPTA'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Parallel & Distributed Processing Techniques and Applications) O Parallel/Distributed applications O Parallel/Distributed architectures O Building block processors O Networks & Interconnection networks O Reliability & fault-tolerance O Performance analysis, evaluation, prediction, ... O Real-time & embedded systems O Parallel/Distributed algorithms O Mobile computation & communication O Object Oriented Technology & related issues O Multimedia Communications, Systems, & Applications O Software tools & environments for parallel & distributed platforms O High-performance computing in Computational Science O Information & data fusion O Petri Nets: theory, analysis, tools & applications O Web-based simulation & computing O Education: parallel & distributed processing in computer science curriculum O Recent history (last decade) of parallel/distributed processing & what to expect in the next decade: New Horizons O Other aspects & applications relating to high-performance computations SCOPE OF CISST'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Imaging Science, Systems, & Technology) O Image generation, acquisition, & processing O Image display techniques O Image data structures & databases O Convergence of imaging media (video & computer) O Virtual reality O Image compression, coding, & encryption O Multimedia / Applications O Tools for multimedia production & services O Digital imaging for film & television O Visualization O Scene & object modeling O Knowledge acquisition O Visual inspection O Document image understanding O Image algebra O Optical image processing systems O Mathematical morphology O Architecture of imaging & vision systems (including parallel architectures & algorithms) O Neural network techniques & fuzzy logic O Performance analysis & evaluation O Software tools & environments for imaging O Animation O Geometric modeling & Fractals O CAD/CAM systems O Rendering techniques O Applications including: medicine, robotic, GIS, remote sensing, industrial inspection (or machine vision), nondestructive evaluation (or NDE), ... O Multi-resolution & multi-spectral image processing O Image sequence processing O Information fusion O Other aspects & applications relating to imaging science SCOPE OF IC-AI'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Artificial Intelligence) O. Intelligent Information Systems O. Intelligent Software Engineering O. Intelligent Agents O. Intelligent Networks O. Intelligent Databases O. Brain Models O. Evolutionary Algorithms O. Data mining O. Reasoning Strategies O. Automated Problem Solving O. Distributed AI Algorithms & Techniques O. Distributed AI Systems & Architectures O. Expert Systems O. Fuzzy Logic O. Genetic Algorithms O. Heuristic Searching O. Knowledge Acquisition O. Knowledge Discovery O. Knowledge Representation O. Knowledge-Intensive Problem Solving Techniques O. Languages & Programming Techniques for AI O. Software Tools for AI O. Natural Language Processing O. Neural Networks & Applications O. Multisource Information Fusion: Theory & Applications O. Multisource-Multisensor Data Fusion O. Learning & Adaptive Sensor Fusion O. Multisensor Data Fusion Using Neural & Fuzzy Techniques O. Integration of AI with other Technologies O. Evaluation of AI Tools O. Social Impact of AI O. Applications: Computer Vision, Signal Processing, Military, Surveillance, Robotics, Medicine, Pattern Recognition, Face Recognition, Finger Print Recognition, Finance & Marketing, Stock Market, Education, Emerging Applications SCOPE OF IC'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Internet Computing) O Internet Security O Internet Applications & Appliances O Performance Evaluation of the Internet O Resource Management & Location O Design & Analysis of Internet Protocols O Web based computing O Network Management O Network Architectures O Network Computing O Network Operating Systems O Quality of Service O Wide Area Consistency O Electronic Commerce O The WWW & Intranets O Metacomputing O Grid based Computing & Tools O Languages for Distributed Programming O Cooperative Applications O Tele-Medical & other applications O Internet Telephony O Mobile Computing O Educational Applications O Digital Libraries/Digital Image Collections O Web Interfaces to Databases O User-interface/Multimedia/Video/Audio/User Interaction O Markup Languages/HTML/XML/VRML O Java Applications on Internet O Alternative Web lifestyles, role-playing, chat, ... O Caching Algorithms for the Internet O Traffic Models & Statistics O Server Space/Web Server Performance O Web Monitoring O Web Documents Management O Web Site Design & Coordination O Other aspects & applications relating to internet-based computing SCOPE OF ESA'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Embedded Systems and Applications) O Object Oriented Technologies for Embedded Systems O Assemblers & Cross Assemblers O Bluetooth & Embedded Systems O Languages for Embedded Systems O Memory Management Issues in Embedded Systems O Communication Tools O System-on-a-Chip Technologies O Embedded Programming Issues O Designing for Low-Power Operations O Development Tools O Distributed Real-Time Systems O Embedded Processors O Next Generation of Handheld Devices O Embedded Programming Standards O Testing Techniques O Embedded Microcontrollers O Emulators & Simulators O Flash Memory Chips O Managing Embedded Projects O Embedded Engineering O Multitasking Design for Embedded Systems O Embedded Internet Tools O Optimization Issues O Power Management Circuits O Real-Time Kernels O Real-Time Operating Systems O Safety Critical Systems O Signal Processors O System Design Tools O Task Scheduling Techniques O Compilers O DSPs O Debuggers SCOPE OF ICWN'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Wireless Networks) O Wireless & mobile applications O Wireless communications O Multiple access O Routing O Resource management, wireless QoS O Signaling O Mobile Internet O Transport-layer issues O Wireless security O Wireless network architectures O Mobile computing O Modeling, simulation, & measurement of wireless systems/networks O Mobile ad-hoc networks O 3G, 4G, & beyond O Wireless LAN & home networks O Wireless sensor networks O Wireless mobile ATM (wmATM) O MIMO O Adaptive antennas O Coding & modulation O Synchronization O Satellite-based systems O Multi-user detection O Power management & control, low-power protocols O IEEE 802.11, 802.15, 802.16, Bluetooth O OFDM O CDMA, B-CDMA O QoS routing, power-aware routing, location-aware routing O Wireless IP networks, interworking O Wireless multimedia, QoS adaptation O WAP, mobile e-commerce O Location-based service, GPS O Mobile agents O Distributed algorithms for wireless networks SCOPE OF MLMTA'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Machine Learning; Models, Technologies & Applications) O Artificial Neural Networks & Learning O Fuzzy Logic O Fusion & Learning O Information Retrieval & Data Mining O Inductive Learning & Applications O Knowledge Representation & Management O Knowledge Acquisition & Discovery Techniques O Machine Learning in Problem Solving O Statistical Methods in Learning O Evolutionary Algorithms O Bayesian-Based Methodologies O Reinforcement Learning Methods O Grammatical Inference O Learning Models O Multi-Agent Learning O Cognitive Modeling O Hybrid Techniques O Hierarchical Learning Models O Collaborative Filtering O Case-Based Reasoning O Semantic Indexing O Natural Language Processing O Machine Translation O Markov Decision Processes (including Semi-Markov DM) O ODE Methods & Machine Learning O Multi-Criteria Reinforcement Learning O Temporal Abstractions O Relational Learning Models O Feature Selection & Classification O Speedup Learning Techniques O Computational Needs of Learning Models O Learning by Examples O Formal Learning Methods O Graph-Based Learning O Theory Refinement Methodologies O Probabilistic Reasoning O Decision Trees O Learning Based on Adaptive Techniques O Learning Topological Maps O Verification Models O Mobile Robotics O Learning in Planning O Query Learning O Active Learning O Memory-Based Learning O Instance-Based Learning O Self-Adaptation Techniques O Requirements Models O Machine Learning & Software Engineering O Game Playing (Chess, ...) O Performance Analysis O Transformation-Based Learning O Simulated Annealing & Learning O Life-Long Learning O Q-Learning O Predictive Learning Models O Text Categorization & Classification O Machine Learning Applications (Medicine, Games, Biology, Industrial Applications, Robotics, Security & Terrorism Prevention, ...) SCOPE OF METMBS'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Mathematics & Engineering Techniques in Medicine & Biological Sciences) O Bioinformatics O Cheminformatics O Data mining in medicine & biological sciences O Pattern recognition in medicine & biological sciences O Signal processing in medicine & biological sciences O Image processing in medicine & biological sciences O Medical decision-making O Medical Physics O Biomedical Engineering O Biomedical Electronics O Biosignal interpretation O Any application of computers in Medicine & biological sciences (protein structure-function analysis, drug & protein design, molecular modeling & simulation, ...) O Application of information technology in biomedicine (e.g. medical database management, information retrieval & use of computers in hospitals) O Application of Computational Intelligence (artificial neural networks, fuzzy logic, & evolutionary computing) in medicine & biological sciences O Medical & bio-computing O High-performance computing as applied to natural & medical sciences O Computer-based medical systems (automation in medicine, ...) O Recent history (last ten years) of Mathematics & engineering techniques in medicine & biological sciences, & what to expect during the next decade; New horizons. Review articles ... O Other aspects & applications relating to technological advancements in medicine & biological sciences SCOPE OF CIC'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Communications in Computing) O High Performance Applications (e.g. scientific, commercial, ...) O Distributed Systems & Advanced Applications (e.g. multimedia, cooperative systems) O Grid computing O Scalable & Interoperable Systems & Associated Standards O Software Systems (e.g. operating system support, middleware, ...) O Architecture (e.g. VLSI, SIMD, MIMD, vector, systolic, reconfigurable, ...) O Interconnection networks (e.g. bus-based, optical) O ATM based networks O Communications (e.g. routing, wireless, mobile) O Visualization (e.g. scientific visualization, debugging & load balancing tools) O Photonics & Optical Computing O Performance Issues (e.g. benchmarks, performance measurement, evaluation & prediction) O Modeling & Simulation of High Performance Systems O Advanced Compilation Techniques (e.g. parallelizing compilers) O Programming Languages for Parallel & other High Performance Computing O Parallel/Distributed/Vector Algorithms O Reliability & Fault Tolerance O Embedded & Real Time Systems O Digital Signal Processing O Neural Computing, Genetic Algorithms O Issues in High Performance Computing (e.g. evolving paradigms, O Internet & web based processing, E-commerce, telecommunication network, cluster-based computing SCOPE OF ERSA'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Engineering of Reconfigurable Systems & Algorithms) O Theory, Mapping & Parallelization: Theoretical models of computing in space-time & adaptive computing. Mapping algorithms into hardware & synthesis of regular arrays. Parallelization & (space-time) partitioning of algorithms. System architectures using configurable computing platform. Newly developed algorithms for efficient implementation on reconfigurable systems. O Software, CAD & Operating Systems: CAD, specification, partitioning & verification. Hardware compilation, hardware/software codesign, developing correct circuits. High & low-level languages & compilers, design environments. Operating systems & run-time reconfiguring. IP-based & object oriented models & mapping methods. O Adaptive Hardware Architectures: Adaptive & dynamically reconfigurable systems. Reconfigurable processor architectures. Complex systems using reconfigurable processors. Application-tailored reconfigurable Systems-on-Chip. Low power systems on reconfigurable platform. O Applications: Wireless communication systems. Multimedia & virtual reality. Automotive industry. Security systems. Classical image & signal processing. O Focus Sessions: High-level Synthesis of Reconfigurable Systems. Operating System for Reconfigurable Hardware. Java-based Environment for Reconfigurable Systems. Configurable Computing Architectures & Hardware. Configurable Systems-on-Chip. Emerging Devices for Reconfigurable Systems. Low Power Systems Using FPGAs. Reconfigurable Floating Point Processing. Software Defined Radio. Custom Computing Machines for Image Processing. SCOPE OF VLSI'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on VLSI) O Quantum Computing O Nanoelectronics O Molecular & Biological Computing O MEMS O Circuits & Systems O Novel Design & Methodologies O System-on-a-Chip: Design & Methodology O Low Power VLSI System Design O Complexity Issues O Simulation Tools O Algorithm Design Approaches (AI, Genetic, ...) O High-Level Design Methodologies O ASIC Architectures O Reconfigurable Systems Design O Novel Devices & Circuits O Emerging Trends O High-Performance Circuits O Reusable Architectures O Test & Verification O Synthesis O Mixed-Signal Design & Analysis O Electrical/Packaging Designs & Co-Designs O Applications (all applications will be considered) SCOPE OF IKE'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Information and Knowledge Engineering) O Client-Server Architectures O Information & Knowledge Engineering O Mobile Agents O Web-Based Design & Development O Knowledge & Information Management Techniques O Data Mining Techniques O Database Engineering & Systems O Knowledge Delivery Methods O Data Security O Knowledge Life Cycle O Business Architectures O Formal & Visual Specification Languages O Software Tools & Support O Performance Evaluation Techniques O Knowledge-Based Systems O Clustering Techniques O Web Technology & Systems O Dataweb Models & Systems O Data Warehouses O Workflow Management O Knowledge & Information Extraction & Discovery Techniques O Service Recovery O Large-Scale Information Processing Methods O Data & Knowledge Processing O Database Engineering & Systems (Distributed, Video, ...) O Information Quality (Quality Metrics) O E-Libraries (Digital Libraries) O Intelligent Knowledge-Based Systems O Agent-Based Techniques & Systems O Content Management O Information Reliability & Security O Hardware Architectures O Modeling & Simulation O Decision Support Systems O Expert Systems O Aspect-Oriented Programming O Re-usability of Software/Knowledge/Information O Privacy Issues O Interoperability Issues O Object-Oriented Modeling & Systems O Knowledge Classification Tools O Case-Based Reasoning O Bayesian Techniques O Managing Copyright Laws O Digital Watermarking O Data/Information/Knowledge Models O Digital Typography O Electronic Publishing O Data Fusion O Applications (Image Processing, OCR, Artistic Imaging, e-Commerce, Multimedia, Business, GIS, Banking, ...) SCOPE OF SERP'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Software Engineering Research and Practice) O Software architectures O Object-Oriented technology O Measurement, metrics & analysis O Survivable systems O Requirements engineering O Reverse engineering O Software domain modeling O Software process modeling O Workflow - Computer Supported Cooperative Work (CSCW) O Project management issues O Distributed & parallel systems O Legal issues & standards O Configuration management (issues & tools) O Automated software specification O Automated software design & synthesis O Theoretic approaches (formal methods, graph, ...) O Domain modeling & meta-modeling O Evolution & maintenance O Knowledge acquisition O Reflection & metadata methodologies O Artificial intelligence approaches to Software Engineering O Automated software engineering O Component-based engineering O Data mining O Interoperability O Intelligent CASE tools O Multimedia in software engineering O Hypermedia O Software reuse O Verification, validation & quality assurance O Performance critical systems O Engineering practices O Programming languages O Program understanding issues O Education (software engineering curriculum design) O Software engineering versus Systems engineering O Software documentation O Technology adoption O Human-Computer Interaction (HCI) O Architecture tradeoff analysis O Novel software tools & environments SCOPE OF SAM'03 (Topics of interest include, but are not limited to): (The 2003 Int'l Conference on Security and Management) O Security Protocols O Mobility Management O Security Algorithms O Location Management O QoS Management O Key Management Techniques O Security in E-commerce & M-commerce O Security Policies O Resource Management O Mobile Network Security O Channel Management O AAA O Encryption O Security in Mobile IPv4/IPv6 O VPN O Firewall O IDS (Intrusion Detection System) O Digital contents copyright protection techniques O Watermarking O Secure OS O Honeypot O Virus Issues (Detection, Prevention, ...) O Tracing Techniques in Internet O Active Networks O Security in CDN (Contents Distribution Networks) O Hacking Techniques & Related Issues O Security in GRID O Biological Security Technologies O Surveillance Technologies O High-Tech Systems at Airports O Face Recognition Systems O Signature Recognition Systems O Network Management O System Management O Network Security Management O Management in Network Equipments O SAN (Storage Area Networks) Management O GRID Middleware O GRID Applications O GRID Networks O Security for Protocol Management O Management Protocol (SNMP, CMIP, etc) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From markdb at cs.uu.nl Thu Oct 31 11:04:52 2002 From: markdb at cs.uu.nl (Mark de Berg) Date: Mon Jan 9 13:41:08 2006 Subject: Opening for Assistant Professor position in Algorithms Message-ID: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % OPENING for an ASSISTANT PROFESSOR % % % % in the ALGORITHMS GROUP % % % % at the TU EINDHOVEN (THE NETHERLANDS) % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% THE TU EINDHOVEN ----------------- The Technische Universiteit Eindhoven (TU/e) was established in 1956 as a polytechnic. It has grown into a technical university with nine faculties. The TU/e now has approximately 3000 employees and 6000 students. The campus is in the center of Eindhoven. Eindhoven is located in the south of the Netherlands, and is the fifth largest city with about 200,000 inhabitants. THE FACULTY OF MATHEMATICS AND COMPUTER SCIENCE AT THE TU EINDHOVEN ------------------------------------------------------------------- The faculty offers bachelors and master programs in computer science and mathematics. Currently the faculty has more than 600 students, and about 200 employees. The department of computer science has a scientific staff of about 40 people, plus a large number of postdocs and PhD students. THE ALGORITHMS GROUP AT THE TU EINDHOVEN ---------------------------------------- The design and analysis of efficient algorithms and data structures forms an important part of computer science. Recently a new research group working in this area has been established at the department of computer science at the TU Eindhoven. Computational geometry will be one of the focal points of the group, but other areas of algorithms---graph algorithms, approximation algorithms, or randomized algorithms for instance---fall within its area of interest as well. The group consists of prof.dr. Mark de Berg and prof.dr. Otfried Cheong (permanent staff members) and dr. Joachim Gudmundsson (postdoc). Currently there is an opening for an assistent professor in the group. THE POSITION ------------ As an assistent professor you are expected to perform independent, original research in one of the indicated areas. You will teach courses, both in the master programs and in the bachelor program offered by the department. You are expected to supervise master students and PhD students, and apply for research grants to fund students. WE ASK ------ Candidates should have a PhD in computer science. They should have experience in performing algorithms research, and have published in international conferences and journals in the area. Candidates should also have teaching experience and/or be willing to follow didactic courses. WE OFFER -------- You will first be appointed for a two-year period, in order to be evaluated for a permanent position afterwards. Salary will be according to the standard rules (the "CAO Nederlandse Universiteiten"). MORE INFORMATION ---------------- For more information about the position, please contact prof.dr. Mark de Berg, (m.t.d.berg@tue.nl). For more information about the job conditions, please contact W.C.J. Verhoef (w.c.j.verhoef@tue.nl) HOW TO APPLY ------------ Please send your application letter, together with a CV and a list of publications, to: Technische Universiteit Eindhoven t.a.v. mevr. drs. S. Udo directeur bedrijfsvoering van de faculteit Wiskunde en Informatica HG 6.22 Postbus 513 5600 MB Eindhoven. Please mention vacancy no. V32877. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.