121. 14th Annual Fall Workshop On Computational Geometry 14th Annual Fall Workshop, with a focus on open problems. Massachusetts Institute of Technology, Cambridge, MA, USA; 1920 November 2004. http://cgw2004.csail.mit.edu/

14th Annual Fall Workshop on Computational Geometry with a Focus on Open Problems November 19-20, 2004 Massachusetts Institute of Technology Room 141, Building 32 The Stata Center 32 Vassar Street Cambridge, MA 02139 USA Sponsored by the National Science Foundation Computer Science and Artificial Intelligence Laboratory , and Massachusetts Institute of Technology Program and Proceedings Participants Accepted abstracts ... Blog ] [Registration closed] 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 I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Folding and unfolding Geometric data structures Kinetic data structures Implementation issues Robustness in geometric computations Geometric approximation algorithms Computer vision Robotics Computer-aided design Mesh generation Manufacturing applications of geometry Computational biology and geometric computations Computational statistics Following the tradition of the previous Fall Workshops on Computational Geometry, the format of the workshop will be informal, extending over two days (Friday-Saturday), with several breaks scheduled for discussions. To promote a free exchange of questions and research challenges, there will be a special focus on Open Problems, with a presentation on

122. Open Problems open problems. open problems. There are a variety of natural questions leftunanswered by the work described. Below, we list a few natural directions http://www.usenix.org/publications/library/proceedings/ec98/full_papers/harkavy/

Next: References Up: Electronic Auctions with Private Previous: Error analysis Open Problems There are a variety of natural questions left unanswered by the work described. Below, we list a few natural directions for further work in this area. Work is under way on variations on the protocol which will address tie-breaking issues, reduce communication costs, and Tie-breaking The protocol described does not provide efficient tie-breaking without some loss of privacy. Communication Costs While we believe the communication costs are sufficiently small to make this protocol practical in many situations, low-value auctions are likely to play an increasingly important role in electronic commerce. Efficiency improvements that enable auctions with private bids in these low-value situations could be very useful. Hierarchical Auctions In some situations, it might be advantageous to hold sub-auctions which partially determine the outcome of the auction. For example, each country might hold a sub-auction, with the leading candidates from each country participating in a final auction. In order to preserve privacy, the winners of the sub-auctions and their bids must not be revealed. Double Auctions and Auction Markets A double auction is a more general form of auction where there are multiple sellers and multiple buyers. All parties tender bids and a market clearing price is determined from those bids. A market clearing price is the equilibrium price at which the supply and demand (in units of the good) are equal. An auction market is a generalization of a double auction to continuous time. New bids are added and removed over time, causing the market clearing price to fluctuate. The stock market is a well known example of an auction market. Double auctions and auction markets are powerful market mechanisms, and privacy protecting protocols for these mechanism would be desirable. However, to be useful, such protocols must be highly efficient, particularly in the case of auction markets.

123. Open Algorithmic Problems The problem is open even in the special case where the lines form two pencils,and the source and target points are corners of the distorted grid they form. http://compgeom.cs.uiuc.edu/~jeffe/open/algo.html

Open Algorithmic Problems Minimum-area triangles Given a set of n points in the plane, we can find the minimum area triangle in quadratic time, but the best known lower bound is only Omega(n log n) . Find a subquadratic algorithm, or prove a quadratic lower bound in any model of computation. This problem is clearly SUM -hard , since it's harder than finding colinear triples in the plane. Thus, a subquadratic algorithm seems unlikely. I have established quadratic lower bounds for the colinear points problem in several (slightly) different models of computation, but the minimum-area triangle problem cannot even be solved in the models in which my lower bounds hold. In d dimensions, the minimum volume simplex can be found in O(n d time and O(n space , but again, the best known lower bound is only Omega(n log n) Leonid Khachian [ J. Complexity ] shows that, if the dimension is not fixed, finding the minimum volume simplex, or even approximating its volume to within a factor of poly(n,d) , is NP-hard. [This is the problem that first led me to study lower bounds. I'm not much closer to a solution than when I started!] Complex colinearities David Eppstein Given a set of n points in the complex plane C , how quickly can we determine whether any three lie on a complex line? (Recall that

124. Problems In Topological Graph Theory Do you think you ve got problems? I know I do. This paper contains an ongoinglist of open questions in topological graph theory. http://www.emba.uvm.edu/~archdeac/problems/problems.html

Problems in Topological Graph Theory Go to the Table of Contents Compiled by Dan Archdeacon List Started: August 1995 Converted to the web: September 1998 Extensive revisions: December 2003 E-Mail: dan.archdeacon@uvm.edu Postal Mail: Dan Archdeacon Dept. of Math. and Stat. University of Vermon t Burlington VT USA Abstract Do you think you've got problems? I know I do. This paper contains an ongoing list of open questions in topological graph theory. If you are interested in adding a problem to this list please contact me at the addresses above. The spirit is inclusive-don't submit a problem you're saving for your graduate student. If it appears here, it's fair game. If you solve one of the problems, know some additional history, recognize it as phrased incorrectly, or think it’s just a stupid question, please let me know so that I can keep the list up-to-date. I've taken quite a bit of liberty editing the submissions. I apologize for any errors introduced. My original goal was to update the list monthly, however, that has proven too difficult. There is no guarantee that references are up-to-date. Enjoy my problems-I do!

125. MathWorld Interactive Home Page Participating students from all over the world work on openended word problems called MathWorld Interactive Challenges. During the cycle, students discuss, share ideas, meet each other, and ask questions on the he MathWorld Interactive Message Boards. http://mathforum.org/mathworld/

PROJECT INFORMATION MathWorld Interactive, a project by Carolynn S. Mortensen, began as MathMagic FidoNet in 1991, and was an interactive project on the Math Forum site through May 30, 1999. In June, 2002, Carolynn re-launched the project but found it necessary to close it again in November, 2002. The interactive site was dedicated to helping educators and parents motivate their students to solve open-ended word problems, communicate mathematically, and share cultural and geographical information. Participating were students from all over the world working on open-ended word problems (levels: K-3, 4-6, 7-8, 9-12) called MathWorld Interactive Challenges. The Challenge Cycle started every 12 weeks and the students followed a specific problem-solving format. The archived questions and submitted solutions are available. CHALLENGES AND SOLUTIONS K-3/Age 5-8 Challenge: First Student: responses Challenge: Second Challenge: Third Challenge: Student: responses Challenge: Student: responses Challenge: Challenge: Student: responses 4-6/Age 9-11 Challenge: First Student: responses Challenge: Second Challenge: Third Challenge: Student: responses Challenge: Student: responses Challenge: Challenge: Student: responses 7-8/Age 12-13 Challenge: First Challenge: Second Challenge: Third Challenge: Student: responses Challenge: Challenge: Challenge: Student: responses 9-12/Age 14+

126. GetDP: A General Environment For The Treatment Of Discrete Problems A scientific software environment for the numerical solution of integrodifferential equations, open to the coupling of physical problems (electromagnetic, acoustic, thermal, mechanical, ) as well as of numerical methods (finite element methods, boundary element and integral methods, ). http://www.geuz.org/getdp/

GetDP: a General Environment for the Treatment of Discrete Problems Patrick Dular and Christophe Geuzaine Version 1.1, 21 August 2005 Description Documentation Mailing lists Download ... Links Description GetDP is a general finite element solver using mixed elements to discretize de Rham-type complexes in one, two and three dimensions. The main feature of GetDP is the closeness between the input data defining discrete problems (written by the user in ASCII data files) and the symbolic mathematical expressions of these problems. See GetDP's reference manual for a more thorough overview of GetDP's capabilities Documentation Reference manual (also available in postscript pdf text html and info formats) Short presentation (also available in postscript and pdf formats) Frequently asked questions (FAQ) Version history Credits We need your help to build a library of examples ! (username: getdp, password: wiki) All GetDP resources GetDP documentation GetDP mailing list archives Mailing lists getdp is the public mailing list for GetDP users. You should send all questions, bug reports, requests or pleas for changes related to GetDP to this list. The list is archived here getdp-announce is a moderated (i.e. "read-only") list for announcements about significant GetDP events. You should subscribe to this list to get information about software releases, important bug fixes and other GetDP-specific news. The list is archived

127. XeraPM - Award Winning Web Based Electronic Filing Solution Award winning web based electronic filing solution XeraPM solves your paper problems without changing the way you work. http://www.ocukl.com/

128. *The Open Source Licensing Page Some very interesting articles on free software licensing history, forms, and problems, seen from a commercial view. Links to some license texts and important open source sites. http://www.stromian.com/Open_Source_Licensing.htm

The Open Source Licensing Page Interview with Don Rosenberg on Open Source and business needs On-line Resources: Stromian's Guide to OEM Software Licensing Stromian's Software Marketing Resources Page Open Source Software Licensing Page Consulting Services: OEM Software Licensing, from Strategic Planning to Negotiations and Administration Open Source Licensing Evaluation and Strategy Windows-to-Linux Migration of Operations Open Source Software Licensing Donald K. Rosenberg, Stromian Technologies Open Source software licensing comes with a confusing variety of terms and conditions. Stromian Technologies has been active in this field for four years, working with clients and speaking on Free Software licensing and marketing topics at Linux gatherings and at USENIX, UniForum, and Comdex. This page is intended to provide some background and information on the subject. AN INTRODUCTION TO COPYLEFT An Unofficial History of Linus Torvalds and Linux Copyleft and the Religious Wars of the 21 st Century ... The Economies of Online Cooperation: Gifts and Public Goods in Cyberspace FOUNDATIONS The Cathedral and the Bazaar (XHTML) Open Source Group The Origins and Future of Open Source Software SOME PUBLIC LICENSES CATEGORIZED Evaluation of Public Licenses Open Source Licensing The Copyleft Classics: GNU General Public License GNU Library General Public License Open Source Definition based on the Debian Social Contract Against Commercial Distribution: Aladdin Free Public License Qt Q Public License Allowing distribution of modified code without source:

129. RESEARCH-DG - ELOISE Conference 1999 The European LandOcean Interactions Studies meeting is open to all scientists with an interest in the complex and multiple problems of the coastal zone. At this meeting the scientific results from fifteen major EU projects will be synthesised. http://europa.eu.int/comm/research/eloise/eloise-c99.html

IMPORTANT LEGAL NOTICE - The information on this site is subject to a and a ELOISE - European Land-Ocean Interaction Studies 3rd Open Science Meeting 1-4 December 1999, Noordwijkerhout, The Netherlands ELOISE OPEN SCIENCE MEETING Final programme List of posters GOAL AND SCOPE OF THE MEETING The European Land-Ocean Interactions Studies (ELOISE) project cluster is the largest concerted effort in coastal zone science in the world. It consists of 29 projects sponsored by the European Commission within its programmes Marine Science and Technology (MAST) and Environment and Climate. The major aim of ELOISE is fundamental research on land-ocean interactions within different disciplines, including socio-economics, and to provide a forum for discussion between the different fundamental sciences and their users in society. ELOISE is the contribution of the European Union to LOICZ (Land-Ocean Interactions in the Coastal Zone), a programme of IGBP (International Geosphere-Biosphere Programme). The 3rd ELOISE Open Science Meeting will be held in Noordwijkerhout, in the Netherlands from 1-4 December 1999. The third Open Science Meeting of ELOISE is open to all scientists with an interest in the complex and multiple problems of the coastal zone. At this meeting the scientific results from fifteen major EU projects will be synthesised. During special theme sessions a number of important problems of coastal zone science and management will be discussed. Conference proceedings will be published as a special issue of the Nearshore and Coastal Oceanography series of Continental Shelf Research (Elsevier) following a peer review process.

130. Math, English Software, Games, Worksheets For Grades K-8 - Dositey.com Education Interactive lessons and exercises, openended questions, printable worksheets, and challenging problems sorted by topic and grade range. http://www.dositey.com/

Fun games...exciting excercises...involving interactive lessons to boost a child's success in school. Just 15 minutes a day with Dositey programs or worksheets makes children eager to learn Dositey Products Free Programs Teach your child how to tell time. The Dositey Telling Time mini-course is: interactive, fun, self-guiding , and provides complete auditory support. The full Telling Time has four units featuring HOURS, HALF HOURS, and QUARTER HOURS. Teach your child important money and math skills Unit 1 Pennies - of the Dositey Money Math mini-course is offered for free The full Money Math has six more units just like this one featuring nickels, dimes, quarters, and combination of coins. Teach your child how to read. Introducing the Beginning Readers Course . A remarkable new program that can help your child learn to read in just 3 weeks. Fun, kid-friendly lessons.

131. New Page 1 Counseling forum for users to obtain advice and counseling by posting messages which are answered by Dr. Manaan Kar Ray,SHO. Gives viewers the chance to read other's problems and gain insight into their own. http://www.twilightbridge.com/counselling.htm

This page uses frames, but your browser doesn't support them.

132. The Canadian Open Mathematics Challenge Qualifying round for the Canadian Mathematical Olympiad. Site includes registration and past problems. http://www.cms.math.ca/Competitions/COMC/

home about the CMS media releases search ... other societies The Canadian Open Mathematics Challenge sponsored by the CMS in collaboration with the CENTRE for EDUCATION in MATHEMATICS and COMPUTING (CEMC) It is with pleasure that we announce the annual Canadian Open Mathematics Challenge and extend to you an invitation to enter the students in your school. The Canadian Open Mathematics Challenge is designed for two reasons: To provide an extracurricular mathematics activity during the fall term. It will be attractive to senior level students, and to motivated younger students who have done some enrichment study beyond their school year, and particularly to those enrolled in fall semester courses who are looking for a mathematics enrichment challenge. To act as a qualifying paper for the Canadian Mathematical Olympiad. Invitations to write the The Canadian Mathematical Olympiad are based on the performance in the Canadian Open Mathematics Challenge. It should be stressed that while the Canadian Open Mathematics Challenge is a required step in qualifying to write the Canadian Mathematical Olympiad, it is not designed with this as its only goal. Many of the problems posed are well within the reach of any good student. The Ninth Canadian Open Mathematics Challenge Wednesday, November 23, 2005

133. Weka 3 - Data Mining With Open Source Machine Learning Software In Java Collection of machine learning algorithms for solving data mining problems implemented in Java and open sourced under the GPL. Features documentation and related projects. http://www.cs.waikato.ac.nz/ml/weka/

Home Getting started Requirements Download Documentation Citing Weka Further information Datasets Related Projects Miscellaneous Code Other Literature Developers Development History CVS Contributors

134. PLEAC-Ruby The Perl Cookbook presents a suite of common programming problems solved in that language. This project aims to gather fans of programming to implement solutions in many other languages. open Source http://pleac.sourceforge.net/pleac_ruby/t1.html

PLEAC-Ruby Table of Contents Foreword Strings Numbers Dates and Times ... Web Automation A. Helpers Foreword Following the Perl Cookbook (by Tom Christiansen and Nathan Torkington, published by O'Reilly) spirit, the PLEAC Project aims to gather fans of programming, in order to implement the solutions in other programming languages. In this document, you'll find an implementation of the Solutions of the Perl Cookbook in the Ruby language. Next Strings

135. DeveloperWorks: Open Source Projects Goals solve problems of pthreads library on Linux; add MN threading, raise POSIX compliance and speed in threaded programs, more so under SMP, give threading services more like commercial Unix. Derived from GNU Pth. open Source, LGPL http://www-124.ibm.com/pthreads/

Country/region select All of dW eServer Lotus Rational Tivoli WebSphere Autonomic computing Grid computing Java technology Linux Open source Power Architecture Web architecture Wireless XML dW forums dW Subscription alphaWorks All of IBM Home Products My account developerWorks ... Feedback Related links ISV resources alphaWorks (alpha technologies) Academic program IBM Redbooks ... developerWorks Open source projects We have recently made changes to the IBM developerWorks open source site. The following projects have moved to different locations on the IBM Web site: http://www.ibm.com/alphaworks/tech/4758toolkit AIX Toolbox for Linux Applications: http://www.ibm.com/servers/aix/products/aixos/linux/index.html ExcelAccessor Bean Suite: http://www.ibm.com/alphaworks/alphabeans/excelaccessor FTP Bean Suite: http://www.ibm.com/alphaworks/alphabeans/ftp Grid Toolbox for AIX and Linux: ICU: http://www.ibm.com/software/globalization/icu http://www.ibm.com/developerworks/linux/linux390/index.shtml PDA Packages for J2ME: http://www.ibm.com/developerworks/java/library/j-pda-op/

136. Josh Cooper's Math Pages : Open Combinatorics Problems Offers descriptions of discrepancy, Euclidean Ramsey Theory, geometric graphs and hypergraphs. http://math.nyu.edu/~cooper/combprob.html

Combinatorial Problems I Like Definitions for much of the terminology can be found here or here ) are, as far as I know, mine. Any errors/updates would be welcomed. See my homepage for contact info. Last Edit: July 29, 2005. Discrepancy B n th roots of unity, or even into the complex unit circle.) What if the coloring function must be completely multiplicative, i.e., f nm f n f (m) for all naturals n m Beck: of the integers 1 to n . If we color each number in this range red or blue, call the discrepancy Is it always possible to find a coloring for any three permutations so that the discrepancy is O (1)? (The best known result is O (log n ), then the discrepany of the interval [5,2,7,4] is 1 : Euclidean Ramsey Theory : How many colors is it necessary to use so that, if you paint every single point of the two-dimensional plane some color, no two points which are a distance one from each other are the same color? (That is, what is the chromatic number of the unit distance graph in the plane?) It's not hard to show that the number is between 4 and 7 but nobody has a clue where it falls in between. See this . A related problem, due to Chris Dillard: Consider

137. SIGGRAPH Computer Graphics Newsletter - VisFiles - May 99 What are the visualization problems that must be solved to reach this vision? We as users and developers have the power to demand an open and uniform http://www.siggraph.org/publications/newsletter/v33n2/columns/hibbard.html

DETAILS COLUMNS CONTRIBUTIONS a a a VISFILES Vol.33 No.2 May 1999 ACM SIGGRAPH Top Ten Visualization Problems Bill Hibbard Space Science and Engineering Center University of Wisconsin - Madison May 99 Columns Visfiles First, thanks to Todd Elvins for asking me to take over the VisFiles column. He set a high standard to live up to. I'll start my VisFiles columns by expressing a vision of the future of visualization and discussing the difficult problems that have to be solved to reach that future. This is inspired by Jim Blinn's list of 10 unsolved computer graphics problems - my favorite moment at SIGGRAPH 98. Your comments and thoughts on this column are welcome, as are your suggestions for future columns. (Editor's note: you can review Jim Blinn's SIGGRAPH 98 comments in Computer Graphics 33(1) February 1999 , pps. 43-47.) Change = Fun Computer science and technology are constantly changing, which is what makes them so much fun. The two most important areas of change are: The interface between computers and people - that's where visualization comes in The interface between people and other people created by computer networking.

138. Florida Methadone Advocates Web site about problems and activities of methadone patients in the State of Florida. Numerous relevant links. Including how to open a methadone clinic. http://www.geocities.com/franco33139ca/FMAdvoc.html

NATIONAL ALLIANCE OF METHADONE ADVOCATES Also serving from Georgia thru Louisiana, and South y Puerto Rico(Mississippi has no clinics) ATLANTA, GEORGIA. "THE AMERICAN ASSOCIATION FOR THE TREATMENT OF OPIOID DEPENDENCE WILL HAVE THEIR CONFERENCE IN ATLANTA, GEORGIA APRIL 22 THRU 26,2006" For more information contact AATOD at aatod.mail@verizon.net and their website at www.aatod.org td> Marquee METHADONE ADVOCATE TRAINING, AT THE AATOD CONFERENCE IN ORLANDO.REGISTER NOW...................Make Copy of Poster for your clinic For more information THIS FLORIDA METHADONE PETITION e-mail daelia01@yahoo.com 2003BRAND NEW "THE FLORIDA METHADONE PETITION DRIVE" Please Take Action BRAND NEW2003 Sign This Petition On Line You are visitor number Type or Paste text or Web address (beginning with http://) here: Translate from: English to Chinese English to French English to German English to Italian English to Japanese English to Korean English to Portuguese English to Spanish Chinese to English French to English French to German German to English German to French Italian to English Japanese to English Korean to English Portuguese to English Russian to English Spanish to English Powered by Systran To translate this web site from English to Spanish, Portugues, French and five 5 other languges use this Altavista Electronic Translator. Either, by cut and paste or using the http:// addresse. PARA TRADUCIR ESTE SITIO WEB AL ESPAñOL, PORTUGES, FRANCES Y 5 OTRAS LENGUAS POR FAVOR USEN EL "TRADUCTOR ELECTRONICO DE ALTAVISTA". INCLULLAN LA DIRECCION HTTP:// EN EL CAJA, ESCOJAN SU "LENGUAJE PREFERIDO" Y PULSEN "translate".

139. Unsolved Problems A good paper on open and solved cageproblems is PK Wong, Cages-A Survey,, JGT,Vol.6 (1982) 1-22 Newer results can be found on Gordon Royle s www-Page http://www.math.fau.edu/locke/Unsolved.htm

Unsolved Problems You can contact Stephen C. Locke at LockeS@fau.edu Several people have asked me about unsolved problems. I will take the easy way out: see the list of 50 problems in Bondy and Murty . You can now see the list as it originally appeard in the the text, Graph Theory with Applications . (May, 2004: The authors are writing the next edition of the book.) Some of these problems have been solved (and thus the title is slightly incorrect) and I won't claim to be familiar with all current results. If you find that one of them has been solved (or even that some reasonable progress has been made), please e-mail me . Also, I'm not giving you all of the references in Bondy and Murty . You should get yourself a copy of that book (or look at the online version). Problems 26-56 Problems 57-61 Problems number above 50 on my list are from sources other than the Bondy and Murtry text. Bojan Mohar lists some additional graph theoretic problems. The reconstruction conjecture . (S.M. Ulam, 1960) 2. A graph

140. Problems In Topological Graph Theory Web text by Dan Archdeacon with a list of open questions in topological graph theory. http://www.emba.uvm.edu/~archdeac/newlist/problems.html

Problems in Topological Graph Theory Go to the Table of Contents Compiled by Dan Archdeacon List Started: August 5, 1995 Converted to the web: September 1, 1998 Last modified: November 15, 1998 E-Mail: dan.archdeacon@uvm.edu Postal Mail: Dan Archdeacon Dept. of Math. and Stat. University of Vermon t Burlington VT 05401-1455 USA Abstract Do you think you've got problems? I know I do. This paper contains an ongoing list of open questions in topological graph theory. If you are interested in adding a problem to this list please contact me at the addresses above. The spirit is inclusive-don't submit a problem you're saving for your graduate student. If it appears here, it's fair game. If you solve one of the problems, know some additional history, or recognize it as misphrased or just a stupid question, please let me know so that I can keep the list up-to-date. I've taken quite a bit of liberty editing the submissions. I apologize for any errors introduced. Enjoy my problems-I do! Table of Contents Classical questions on genus Coloring graphs and maps Drawings and crossings Paths, cycles, and matchings

Page 7     121-140 of 174    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | 9  | Next 20