From tjtautg at sandia.gov Fri Jul 2 12:46:06 2004 From: tjtautg at sandia.gov (Tim Tautges) Date: Mon Jan 9 13:41:14 2006 Subject: ANNOUNCING THE LGPL RELEASE OF MOAB Message-ID: <40E5914E.40104@sandia.gov> (my apologies if you receive multiple copies of this notice) ANNOUNCING THE LGPL RELEASE OF MOAB MOAB, a Mesh-Oriented datABase, is a software component for creating, storing and accessing finite element mesh data. MOAB is being designed in close collaboration with the SciDAC Terascale Simulation Tools and Technologies (TSTT) Center and with the CUBIT project at Sandia National Laboratories. A few highlights of the capabilities in MOAB include: * Representation of 0-3d elements in the finite element "zoo" (including support for quadratic elements), as well as support for polygon and polyhedron entities * Highly efficient storage and query of structured and unstructured mesh (e.g. a brick-shaped hex mesh requires approximately 25 and 55 MB per million hex elements in the structured and unstructured representations, respectively) * Powerful data model allowing representation of various metadata in the form of "sets" (arbitrary groupings of mesh entities and sets) and "tags" (annotation of entities, sets, and entire mesh) * Open source (LGPL) mesh readers/writers for Sandia ExodusII, CUBIT .cub save/restore, VTK, and other mesh formats * Implementation of the DOE Scidac TSTT center's mesh interface (see www.tstt-scidac.org for more details of this interface) MOAB is available under an LGPL license from Sandia National Laboratories. More information, including instructions for downloading MOAB, are located at http://cubit.sandia.gov/MOAB/. ------------- 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 vsr at ccad.uiowa.edu Fri Jul 9 16:19:50 2004 From: vsr at ccad.uiowa.edu (Virtual Soldier Research) Date: Mon Jan 9 13:41:14 2006 Subject: Real-time Presentation of Human Modeling and Simulation Technologies at SIGGRAPH 2004 Message-ID: <6.0.0.22.2.20040709151853.024f86b8@renoir.ccad.uiowa.edu> The Iowa Virtual Soldier at SIGGRAPH 2004 Iowa City, IA July 4, 2004 The Virtual Soldier Research (VSR) Program at The University of Iowa College of Engineering announced today that their real-time presentation of human modeling and simulation technologies has been accepted for this year's Real Time 3DX: Demo or Die at SIGGRAPH 2004 in Los Angeles, California. This event, which takes place Monday, August 9th, 6 - 8 pm in West Hall A and is organized by Sandy Ressler, National Institute of Standards Technology and Leonard Daly, Daly Realism, will offer attendees a glimpse into the early stages of VSR's research in real-time human simulation. SIGGRAPH's Real Time 3DX event highlights real-time graphics of all types in a fast-paced, fun, and inspiring way. It exhibits the best real-time computer graphics work from industry, universities, and "secret" labs. SIGGRAPH, now in its 31st year, is the most prestigious conference of its types in the world, with the largest audience and the highest quality, state-of-the-art computer graphics publications. VSR is an independent research group within the Center for Computer Aided Design (CCAD) at The University of Iowa. This eight-month young project, funded primarily by the US Army TACOM, conducts basic and applied research for creating new technologies dealing with digital human modeling and simulation. TACOM and the industrial design industry in general are looking for ways to eliminate one of the few remaining reasons to build extremely expensive, real-world prototypes. VSR's objective is to create autonomous, digital humans that can answer human-factors questions in the virtual world. The use of autonomous, virtual soldiers that can experience computer-modeled versions of proposed vehicles and weapons systems in the virtual world - and then provide feedback on those designs - would go a long way towards eliminating the need to produce expensive, real-world prototypes for human factors research. University of Iowa researchers (faculty, staff, scientists, engineers, clinical researchers, and graduate students) from various fields including engineering, gaming, psychology, biomechanics, human factors, computers, optimization, and industrial design have come together to create this new technology. Virtual Soldier Research (VSR) Program Center for Computer Aided Design THE UNIVERSITY OF IOWA Iowa City, IA. 52242 Tel: (319) 335-5722 Fax: (319) 384-0542 vsr@ccad.uiowa.edu www.engineering.uiowa.edu/~amalek/VSR -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040709/14ed1b87/attachment.htm From fd at dehne.net Thu Jul 15 15:34:33 2004 From: fd at dehne.net (Prof. Frank Dehne (www.dehne.net)) Date: Mon Jan 9 13:41:14 2006 Subject: IPDPS 2005 Call for Papers Message-ID: *************************************************************************** * IPDPS 2005 * * * * International Parallel and Distributed Processing Symposium * * * * http://www.ipdps.org/ * * * * =====> CALL FOR PAPERS <===== * * * * FIRM Submission Deadline: October 8, 2004 * * ^^^^^^^^^^^^^^^ * *************************************************************************** 19th IEEE International Parallel & Distributed Processing Symposium www.ipdps.org Monday, 4 April - Friday, 8 April 2005 Omni Interlocken Hotel Denver, Colorado, USA Sponsored by: IEEE Computer Society Technical Committee on Parallel Processing (TCPP) In cooperation with: ACM SIGARCH IEEE Computer Society Technical Committee on Computer Architecture IEEE Computer Society Technical Committee on Distributed Processing Hosted by Colorado State University ================================= IPDPS 2005 CALL FOR PARTICIPATION ================================= IPDPS serves as a forum for engineers and scientists from around the world to present their latest research findings in the fields of parallel processing and distributed computing. The five-day program will follow the usual format of contributed papers, invited speakers, panels, industrial track, and exhibits mid week, framed by workshops held on Monday and Friday. During the week participants will have an opportunity to organize Birds-of-a-Feather (BOF) sessions, and a special tutorial will be offered. Program details will be posted on the Web, so you are encouraged to regularly check the IPDPS Web site at www.ipdps.org for updates. General email inquiries should be addressed to info@ipdps.org. GENERAL CO-CHAIRS * H. J. Siegel, Colorado State University, USA * David A. Bader, University of New Mexico, USA GENERAL VICE CHAIR * Charles Weems, University of Massachusetts at Amherst, USA WORKSHOPS --------- Workshops are an opportunity to explore special topics, and running a workshop in association with IPDPS offers many advantages. Most workshops held at IPDPS 2004 are already planning for continuation in 2005, and several others have been proposed. Contact Workshop Co-Chairs Alan Sussman (als@cs.umd.edu) or Yuanyuan Yang (yang@ece.sunysb.edu) for information on proposing a workshop. For a list of workshops planned for 2005, and to obtain more information on an individual IPDPS workshop, go to the IPDPS Web site at www.ipdps.org. Each workshop has its own requirements and schedule for submissions, and all are linked from the IPDPS Web site. BIRDS-OF-A-FEATHER (BOF) ------------------------ These are informal sessions in which a group of researchers can gather for discussions on a topic of mutual interest. We'll provide the space, you provide the topic and gather the people. You may reserve space in advance by contacting the General Vice Chair Charles Weems at weems@cs.umass.edu. INDUSTRIAL TRACK & COMMERCIAL EXHIBITS -------------------------------------- There will be three days of "walk-up-and-talk" exhibits, where industrial researchers can promote awareness about their products and recent technological advances. In addition, industry exhibitors are invited to give a presentation in a conference Industrial Track session (with a technical article in the proceedings) or offer an evening industrial tutorial that provides orientation and training to conference participants interested in using their technology. Companies interested in participating should contact the Industrial Track Chair John K. Antonio (antonio@ou.edu) as early as possible. ============================ IPDPS 2005 - IMPORTANT DATES ============================ 8 October 2004 Final Deadline for Manuscripts 17 December 2004 Review Decisions Mailed 21 January 2005 Camera-Ready Paper Due =============== CALL FOR PAPERS =============== Authors are invited to submit manuscripts that demonstrate original unpublished research in all areas of parallel and distributed processing, including the development of experimental or commercial systems. Topics of interest include but are not limited to: 1. Parallel and distributed algorithms, including stability and fault tolerance of distributed systems, communication and synchronization protocols, network algorithms, and scheduling and load balancing. 2. Applications of parallel and distributed computing, including web applications, peer-to-peer computing, grid computing, scientific applications, and mobile computing. 3. Parallel and distributed architectures, including shared memory, distributed memory (including petascale system designs, and architectures with instruction-level and thread-level parallelism), special-purpose models (including signal and image processors, network processors, other special purpose processors), nontraditional processor technologies, network and interconnect architecture, parallel I/O and storage systems, system design issues for low power, design for high reliability, and performance modeling and evaluation. 4. Parallel and distributed software, including parallel programming languages and compilers, operating systems, resource management, middleware, libraries, data mining, and programming environments and tools. BEST PAPER AWARDS ----------------- Awards will be given for one best paper in each of the four conference technical tracks: algorithms, applications, architectures, and software. The selected papers also will be considered for possible publication in a special issue of the Journal of Parallel and Distributed Computing. WHAT TO SUBMIT ============== Submitted manuscripts may not exceed 16 single-spaced pages using 12-point size font on 8.5x11 inch pages, including figures and tables. References may be included in addition to the 16 pages. Hardcopy submissions will be accepted, but files in either PostScript (level 2) or PDF format are strongly encouraged. Authors need to make sure that the electronically submitted files are formatted for 8.5x11 inch paper. Submissions will be judged on correctness, originality, technical strength, significance, quality of presentation, and interest and relevance to the conference attendees. Submitted papers may not have appeared in or be under consideration for another conference or a journal. Submission procedures are available via Web access at www.ipdps.org. For those who have only e-mail access, send an e-mail message to for an automatic reply that will contain detailed instructions for submission of manuscripts. If no electronic access is available, contact the Program Chair at the address given below. All manuscripts will be reviewed. Manuscripts must be received by October 8, 2004, by 5 p.m. U.S. Pacific Coast Time. This is a final deadline; to ensure fairness, no extensions will be given. Notification of review decisions will be mailed by December 17, 2004. Camera-ready papers will be due January 21, 2005. IPDPS 2005 Proceedings for both contributed papers and workshops will be published by the IEEE Computer Society Press on CD-ROM and will be distributed at the Symposium along with a hard copy volume of abstracts. PROGRAM CHAIR ============= Jean-Luc Gaudiot, University of California, Irvine, USA Department of Electrical Engineering and Computer Science University of California, Irvine, CA 92697-2625 - USA PROGRAM VICE-CHAIRS =================== * ALGORITHMS Albert Y. Zomaya, University of Sydney, Australia * APPLICATIONS Yves Robert, École Normale Supérieure de Lyon, France * ARCHITECTURES Kemal Ebcioglu, IBM T.J. Watson Research Center, USA * SOFTWARE Dan Reed, University of North Carolina at Chapel Hill, USA PROGRAM COMMITTEE ----------------- Enrique Alba, University of Malaga, Spain Shoukat Ali, University of Missouri-Rolla, USA Olivier Beaumont, LaBRI Bordeaux, France Azzedine Boukerche, Ottawa University, Canada Pascal Bouvry, University of Luxembourg, Luxembourg Marian Bubak, AGH Krakow, Poland Ralph Castain, Los Alamos National Laboratory, USA Amitava Datta, University of Western Australia, Australia Michel Dayde, ENSEEIHT Toulouse, France Tony Drummond, Lawrence Livermore National Laboratory, USA José Duato, Universidad Politecnica de Valencia, Spain Tarek El-Ghazawi, George Washington University, USA Fikret Ercal, University of Missouri-Rolla, USA Mary Eshaghian-Wilner, University of California, Los Angeles, USA John Feo, Cray Inc., USA Robert Fowler, Rice University, USA Dennis Gannon, Indiana University, USA Antonio Gonzalez, UPC & Intel Barcelona Research Center, Spain Minyi Guo, The University of Aizu, Japan Rajesh Gupta, University of California, San Diego, USA John Gurd, University of Manchester, UK Adolfy Hoisie, Los Alamos National Laboratory, USA Jeff Hollingsworth, University of Maryland, USA Susumu Horiguchi, Tohoku University, Japan Joseph JaJa, University of Maryland, USA David Kaeli, Northeastern University, USA Alexey Kalinov, ISP Moscow, Russia Craig Lee, Aerospace Corp., USA Ewing Lusk, Argonne National Laboratory, USA Allen Malony, University of Oregon, USA Celso Mendes, University of Illinois, USA Luc Moreau, University of Southampton, UK Jose Moreira, IBM T.J. Watson Research Center, USA John P. Morrison, University College Cork, Ireland Yoichi Muraoko, Waseda University, Japan Koji Nakano, Hiroshima University, Japan Sotiris Nikoletseas, Patras University, Greece Stephan Olariu, Old Dominion University, USA Yi Pan, Georgia State University, USA Dhabaleswar Panda, Ohio State University, USA Yale Patt, University of Texas, Austin, USA Beth Plale, Indiana University, USA Sushil K. Prasad, Georgia State University, USA Sanguthevar Rajasekaran, University of Connecticut, USA Sanjay Rajopadhye, Colorado State University, USA Sartaj Sahni, University of Florida, Gainesville, USA Karsten Schwan, Georgia Institute of Technology, USA Franciszek Seredynski, Polish Academy of Sciences, Poland Balaram Sinharoy, IBM Research, USA Arun Somani, Iowa State University, USA Rick Stevens, Argonne National Laboratory, USA Ivan Stojmenovic, Ottawa University, Canada Domenico Talia, University of Calabria, Italy Valerie Taylor, Texas A&M University, USA Theo Ungerer, University of Augsburg, Germany Mateo Valero, UPC Barcelona, Spain Jeffrey Vetter, Oak Ridge National Laboratory, USA Jie Wu, Florida Atlantic University, USA Laurence Tianruo Yang, St. Francis Xavier University, Canada Yuanyuan Yang, State University of New York, Stony Brook, USA Bing Bing Zhou, University of Sydney, Australia ============================================================= ==================================================== SADDLE UP FOR THE IPDPS 2005 ROCKY MOUNTAIN ROUND-UP ==================================================== The 19th IEEE International Parallel & Distributed Processing Symposium, hosted by Colorado State University, will be held in Denver, Colorado, at the Omni Interlocken Resort. Midway between downtown Denver and Boulder and fifty miles from Fort Collins, the Interlocken area is a concentration of high-tech corporations, institutions of higher education, and research and development laboratories. The nearby Denver International Airport provides easy access for our worldwide participants. Gateway to the spectacular Rocky Mountains, the area has a multitude of recreational opportunities and is only one hour from the entrance to the Rocky Mountain National Park wilderness forest and wildlife preserves. The Interlocken Hotel is part of a golf resort with three separate nine-hole courses, and across the road is FlatIron Crossing Village, an indoor-outdoor park complex of retail shops, dining, and recreation. Colorado may now be best known for its ski resorts and breweries, but its earlier history of mining, agriculture, and livestock, and its role in the settlement of the American West, is still alive in the character of the university communities of Fort Collins, Boulder, and Golden. So, come April 2005, we invite all you trail blazers in parallel and distributed processing to saddle up and join us at the Rocky Mountain IPDPS round-up. Our IPDPS 2005 host is Colorado State University, and they are planning a special pre-conference Rocky Mountain National Park excursion. Details on this excursion, local accommodations, and travel tips will be posted on the Web, so you are encouraged to regularly check the IPDPS Web site at www.ipdps.org for updates. ======================= IPDPS 2005 ORGANIZATION ======================= GENERAL CO-CHAIRS H.J. Siegel, Colorado State University, USA David A. Bader, University of New Mexico, USA GENERAL VICE CHAIR Charles Weems, University of Massachusetts at Amherst, USA PROGRAM CHAIR Jean-Luc Gaudiot, University of California, Irvine, USA WORKSHOPS CO-CHAIRS Alan Sussman, University of Maryland, USA Yuanyuan Yang, State University of New York, Stony Brook, USA INDUSTRIAL TRACK COMMITTEE Chair: John K. Antonio, University of Oklahoma, USA Wim Böhm, Colorado State University, USA Serge Chaumette, University of Bordeaux 1, France Mitchell D. Theys, University of Illinois at Chicago, USA PROCEEDINGS COMMITTEE Chair: Shoukat Ali, University of Missouri-Rolla, USA Vice-Chair: Stephen L. Scott, Oak Ridge National Laboratory, USA FINANCE CHAIR Bill Pitts, Toshiba America Information Systems, Inc., USA LOCAL ARRANGEMENTS CHAIR Susamma Barua, California State University, Fullerton, USA PRODUCTION CHAIR Sally Jelinek, Electronic Design Associates, Inc., USA PUBLICITY CO-CHAIRS Frank Dehne, Griffith University, Australia Yi Pan, Georgia State University, USA STEERING COMMITTEE Co-Chair: Viktor K. Prasanna, University of Southern California, USA Co-Chair: George B. Westrom, Future Scientists & Engineers of America, USA David A. Bader, University of New Mexico, USA K. Mani Chandy, California Institute of Technology, USA Michel Cosnard, Université de Nice & INRIA Sophia Antipolis, France Jean-Luc Gaudiot, University of California, Irvine, USA Ali R. Hurson, Pennsylvania State University, USA Joseph JaJa, University of Maryland, USA F. Tom Leighton, MIT, USA Burkhard Monien, University of Paderborn, Germany Sotiris E. Nikoletseas, University of Patras, Greece José D.P. Rolim, University of Geneva, Switzerland Arnold L. Rosenberg, University of Massachusetts at Amherst, USA Sartaj Sahni, University of Florida, USA Behrooz Shirazi, University of Texas at Arlington, USA H. J. Siegel, Colorado State University, USA Paul Spirakis, University of Patras, Greece Hal Sudborough, University of Texas at Dallas, USA Charles Weems, University of Massachusetts at Amherst, USA ============================ IPDPS 2005 - IMPORTANT DATES ============================ 8 October 2004 Final Deadline for Manuscripts 17 December 2004 Review Decisions Mailed 21 January 2005 Camera-Ready Paper Due ------------- 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 sheikhtexan at yahoo.com Mon Jul 12 10:23:10 2004 From: sheikhtexan at yahoo.com (Usman Shakil) Date: Mon Jan 9 13:41:15 2006 Subject: Pocket deformation Problem Message-ID: <20040712162310.21779.qmail@web20024.mail.yahoo.com> Given a 3D object (represented by a point set in 3D) with, A flexible pocket that has been deformed n times, {P1, .. Pn} How can we model the deformation of the pocket over time. My approach, Find a set of m speheres {S1, .. Sm} each with center points {c1, .. cm} The spheres are placed in the pockets in a manner such that; d(ci, cj) is preserved for all placements of the spheres, for 1<= i, j<=m The radii are set to maximize the minimum percentage of volume taken up by the spheres while being contained within any one pocket Does any body know of any paper in the literature that deals with a simillar problem? Any pointers in this regard will be highly appreciated. Many thanks Usman --------------------------------- Do you Yahoo!? New and Improved Yahoo! Mail - Send 10MB messages! -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040712/66655fe2/attachment.htm From rudolf at cs.ust.hk Sun Jul 25 22:13:07 2004 From: rudolf at cs.ust.hk (rudolf@cs.ust.hk) Date: Mon Jan 9 13:41:15 2006 Subject: ISAAC 2004 accepted papers Message-ID: <4665.61.170.202.5.1090761187.squirrel@61.170.202.5> The following papers (in random order) were accepted at ISAAC 2004: 1. Xujin Chen, Wenan Zang: An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs 2. Boris Aronov, Tetsuo Asano , Naoki Katoh, Kurt Mehlhorn, Takeshi Tokuyama : Polyline Fitting of Planar Points under Min-Sum Criteria 3. Gruia Calinescu: On approximation algorithms and truthful mechanisms 4. Marcus Brazil, Pawel Winter, Martin Zachariasen: Flexibility of Steiner Trees in Uniform Orientation Metrics 5. Ryuhei Uehara: Canonical Data Structure for Interval Probe Graphs 6. Egon Wanke: Oriented Paths in Mixed Graphs 7. Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos: Poly-APX- and PTAS-completeness in standard and differential approximation 8. Uri Zwick: A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths 9. Lusheng Wang, Liang Dong , Hui Fan: Randomized Algorithms for Motif Detection 10. Artur Pessoa, Eduardo Laber, Criston Souza: Efficient Algorithms for the Hotlink Assignment Problem: the worst case search 11. John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba Toth: Adaptive Spatial Partitioning for Multidimensional Data Streams 12. Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas Nandy, Shinji Sasahara, Takeaki Uno: A Generalization of Magic Squares with Applications to Digital Halftoning 13. Ryuhei Uehara, Yushi Uno: Efficient Algorithms for the Longest Path Problem 14. Jesper Jansson, Wing-Kin Sung: The Maximum Agreement of Two Nested Phylogenetic Networks 15. Kazuyuki Miura, Hiroki Haga, Takao Nishizeki: Inner Rectangular Drawings of Plane Graphs 16. Satoshi Fujita, Toru Araki: Three-Round Adaptive Diagnosis in Binary n-Cubes 17. Dariusz Kowalski, Andrzej Pelc: Polynomial deterministic rendezvous in arbitrary graphs 18. Davide Bilo, Guido Proietti: Augmenting the Edge-Connectivity of a Spider Tree 19. Dominique De Werra, Marc Demange, Bruno Escoffier, Jerome Monnot, Vangelis Th. Paschos: Weighted coloring on planar, bipartite and split graphs : complexity and improved approximation 20. Danny Chen, Xiaobo Hu, Shuang Luan, Shahid Naqvi, Chao Wang, Cedric Yu: Generalized Geometric Approaches for Leaf Sequencing Problems in Radiation Therapy 21. Michael Dom, Jiong Guo, Falk Hueffner, Rolf Niedermeier: Error Compensation in Leaf Root Problems 22. Joachim von zur Gathen, Igor Shparlinski: GCD of Random Linear Forms 23. Artur Pessoa: Planning the Transportation of Multiple Commodities in Bidirectional Pipeline Networks 24. Xuehou Tan: The two-guard problem revisited and its generalization 25. Bin Fu, Richard Beigel: Diagnosis in the Presence of Intermittent Faults 26. Minghui Jiang, Binhai Zhu, Sergey Bereg, Zhongping Qin: New bounds on map labeling with circular labels 27. Peter Hui, Marcus Schaefer: Paired Pointset Traversal 28. Jun Luo, Ovidiu Daescu: Cutting Out Polygons with Lines and Rays 29. Ulrik Brandes, Juergen Lerner: Structural Similarity in Graphs (A Relaxation Approach for Role Assignment) 30. Amitai Armon, Uri Zwick: Multicriteria Global Minimum Cuts 31. Hanno Lefmann: Distributions of Points and Large Quadrangles 32. Ming-Deh Huang: On partial lifting and the elliptic curve discrete logarithm problem 33. Sang Won Bae, Kyung-Yong Chwa: Voronoi Diagrams with a Transportation Network on the Euclidean Plane 34. Christian Schindelhauer, Klaus Volbert, Martin Ziegler: Spanners, Weak Spanners, and Power Spanners for Wireless Networks 35. Jin-Yi Cai, Osamu Watanabe: Random Access to Advice Strings and Collapsing Results 36. Jesper Jansson, Trung Hieu Ngo, Wing-Kin Sung: Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs 37. Hiroshi Nagamochi, Taizo Kawada: Approximating the Minmax Subtree Cover Problem in a Cactus 38. Kuan-Yu Chen, Kun-Mao Chao: On the Range Maximum-Sum Segment Query Problem 39. Qingmin Shi, Joseph JaJa: Techniques for Indexing and Querying Temporal Observations for a Collection of Objects 40. Feodor F. Dragan, Irina Lomonosov: On Compact and Efficient Routing in Certain Graph Classes 41. Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim: Many-to-many disjoint path covers in a graph with faulty elements 42. Marcus Raitner: Dynamic Tree Cross Products 43. Markus Bauer, Gunnar W. Klau: Structural Alignment of Two RNA Sequences with Lagrangian Relaxation 44. Hsin-Fu Chen, Maw-Shang Chang: An efficient exact algorithm for the minimum ultrametric tree problem 45. Timo von Oertzen: Exact computation of Polynomial Zeros expressible by Square Roots 46. Daiji Fukagawa, Tatsuya Akutsu: Fast Algorithm for Comparison of Similar Unordered Trees 47. Igor Nor: Generalized Function Matching 48. Sergey Bereg: Equipartitions of measures by 2-fans 49. Gruia Calinescu, Alexander Zelikovsky: The Polymatroid Steiner Problems 50. Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos: Approximate Distance Oracles for Graphs with Dense Clusters 51. Mordecai Golin, Yiu Cho Leung, Yajun Wang: Counting Spanning Trees and Other Structures in Non-Constant-Jump Circulant Graphs 52. Wun-Tat Chan, Prudence W. H. Wong: On-line Windows Scheduling and Unit Fraction Bin Packing of Temporary Items 53. H. K. Dai, H. C. Su: On $p$-Norm Based Locality Measures of Space-Filling Curves 54. Fredrik Bengtsson, Jingsen Chen: Efficient Algorithms for k Maximum Sums 55. Timothy M. Chan, Bashir S. Sadjad: Geometric Optimization Problems over Sliding Windows 56. David Abraham, Katarina Cechlarova, David Manlove, Kurt Mehlhorn: Pareto-optimality in house allocation problems 57. Zhe Dang, Oscar Ibarra, Jianwen Su: Composability of Infinite-State Activity Automata 58. Kyung-Yong Chwa, Byung-Cheol Jo, Christian Knauer, Esther Moet, Rene van Oostrum, Chan-Su Shin: Guarding Art Galleries by Guarding Witnesses 59. Avraham Goldstein, Petr Kolman, Jie Zheng: Minimum Common String Partition Problem: Hardness and Approximations 60. Jae-Hoon Kim: Optimal Buffer Management via Resource Augmentation 61. Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction 62. Zhenming Chen, Vikas Singh, Jinhui Xu: Efficient Job Scheduling Algorithms with Multi-Type Contentions 63. Darin Goldstein, Kojiro Kobayashi: On the Complexity of Network Synchronization 64. Kazuyuki Amano, Akira Maruoka: On the Monotone Circuit Complexity of Quadratic Boolean Functions 65. Richard J. Nowakowski, Norbert Zeh: Boundary-Optimal Triangulation Flooding 66. Joseph JaJa, Christian Mortensen, Qingmin Shi: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting 67. Zeshan Peng, Hingfung Ting: An O(nlog n)-time algorithm for the maximum constrained agreement subtree problem for binary trees 68. Kazuo Iwama, Akinori Kawachi: Approximated Two Choices in Randomized Load Balancing 69. Boting Yang, Danny Dyer, Brian Alspach: Sweeping graphs with large clique number 70. Jerzy W. Jaromczyk, Zbigniew Lonc: Sequences of radius $k$: how to fetch many huge objects into small memory for pairwise computations 71. Andreas Goerdt, Andre Lanka: On the hardness and easiness of random 4-SAT formulas 72. Vittorio Bilo, Michele Flammini, Giovanna Melideo, Luca Moscardelli: On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks 73. Ho-lun Cheng, Chao Chen: Superimposing Voronoi Complexes for Shape Deformation 74. Jinsong Tan, Louxin Zhang: Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices 75. Amalia Duch: Randomized Insertion and Deletion in Point Quad Trees 76. Veli Makinen, Gonzalo Navarro, Kunihiko Sadakane: Advantages of Backward Searching - Efficient Secondary Memory and Distributed Implementation of Compressed Suffix Arrays I hope to see you in Hong Kong, Dec 20-22. Rudolf Fleischer, PC chair ------------- 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 Natalie.Cooney at nicta.com.au Thu Jul 29 12:17:23 2004 From: Natalie.Cooney at nicta.com.au (Natalie Cooney) Date: Mon Jan 9 13:41:16 2006 Subject: Advertisment for the CompGeom mailing list Message-ID: <09D3F703EF3B0A4CBE28449EA9F3D3206049F2@nicta-atp-mail.in.nicta.com.au> Hello, Please see below advertisement which we would like to appear on your mailing list. Can you please let me know when it will appear and how to direct candidates to it. Many thanks, Natalie Cooney Human Resources Administrator National ICT Australia Limited Phone: 02 9209 4758 Fax: 02 8374 5508 Email: natalie.cooney@nicta.com.au National ICT Australia Limited (NICTA) is seeking applicants from high performing and entrepreneurial researchers in specific programs of Information and Communications Technology (ICT) disciplines for a continuing appointment as Senior Principal Researcher (Level E). This position is within the HUM (Humans Understanding Machines) Program. SENIOR PRINCIPAL RESEARCHER HUMANS UNDERSTANDING MACHINES The aim of the program is to investigate new ways of presenting information to people. A few sample initial projects are: * Graph visualization: making pictures of large scale relational information such as social networks. * Physical interaction metaphors: using familiar paradigms from the physical world to navigate large abstract data sets. * Ambient visualization: enhancing the periphery of the focus of attention with useful information. * Remote collaboration: groups of engineers can collaborate over design problems using networked visualizations. We expect the position to be highly competitive and excellence of research record and potential to contribute to the mission of NICTA will be key factors in selecting applicants. Remuneration will be internationally competitive, and funds will be available also for research support and infrastructure, and international conference travel support. Further information, which details the information required from all applicants, is available on the NICTA website (http://www.nicta.com.au ) and should be accessed before applying. Applications for this position should be submitted to opportunities@nicta.com.au by 10 September 2004. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040729/97548ac6/attachment.htm From vsr at ccad.uiowa.edu Thu Jul 29 10:02:31 2004 From: vsr at ccad.uiowa.edu (Virtual Soldier Research) Date: Mon Jan 9 13:41:16 2006 Subject: Job Posting Announcement Message-ID: <6.0.0.22.2.20040729090145.022a28b8@renoir.ccad.uiowa.edu> Assistant Research Engineer The Center for Computer-Aided Design, The University of Iowa, is seeking qualified applicants for the position of Assistant Research Engineer in support of Virtual Soldier Research Program. Position responsibilities are to perform basic and applied research in digital human modeling and simulation, contributing to development of new theories and methods. Other responsibilities include participation in proposal development for generation of new research funding, development of technical reports, publications, and related media, supervision of student personnel, training junior investigators, and conducting continuing education in digital human modeling methodologies and software tools. Requires Ph.D. in Mechanical Engineering or a related field with focus in kinematics and dynamics, walking/human motion modeling and analysis, optimization, real-time simulation, and/or design of mechanisms plus two years experience in biomechanics of human physiology or equivalent combination of education and experience. Strong publication record and excellent communications skills preferred. Annual salary is $37,608 to commensurate with experience. Initial period of employment is one year with option to extend up to three additional years pending continuation of contract funding. Please forward resume, three letters of reference, and a cover letter describing recent and/or related work experience to: Joel S. Steele, Research and Contracts Administrator, Center for Computer-Aided Design, The University of Iowa, 116 ERF, Iowa City, IA 52242-1000. Applications accepted until 8/13/2004. The University of Iowa is an Equal Opportunity/Affirmative Action Employer. Women and minorities are encouraged to apply. Virtual Soldier Research (VSR) Program Center for Computer Aided Design THE UNIVERSITY OF IOWA Iowa City, IA. 52242 Tel: (319) 335-5722 Fax: (319) 384-0542 vsr@ccad.uiowa.edu www.engineering.uiowa.edu/~amalek/VSR -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20040729/f5dfe0d4/attachment.htm