101. The Practice Of Logical Frameworks - Pfenning (ResearchIndex) Comprehensive survey article by Frank Pfenning (1996) discussing the history of work on logical frameworks and their current open problems. http://citeseer.nj.nec.com/pfenning96practice.html

The Practice of Logical Frameworks (1996) (Make Corrections) (19 citations) Frank Pfenning Proceedings of the Colloquium on Trees in Algebra and Programming Home/Search Context Related View or download: cmu.edu/project/fox/mosa caap96.ps.gz cmu.edu/~fp/public/elfp caap96.ps.gz ... cmu.edu/~fp/papers/caap96.ps.gz Cached: PS.gz PS PDF DjVu ... Help From: cmu.edu/project/fox/mo homepage (more) From: cmu.edu/afs/cs/misc/mo Pfenning (Enter author homepages) Rate this article: (best) Comment on this article (Enter summary) Abstract: Introduction Deductive systems, given via axioms and rules of inference, are a common conceptual tool in mathematical logic and computer science. They are used to specify many varieties of logics and logical theories as well as aspects of programming languages such as type systems or operational semantics. A logical framework is a meta-language for the specification of deductive systems. Research on logical frameworks is still in its infancy. Nonetheless, different frameworks have been... (Update) Context of citations to this paper: More (and corresponding inductive principles) 1 Introduction One of the most serious drawbacks of the LF style Logical Frameworks ( ) is their inability to prove metatheorems about encoded systems in a direct way (if at all) Meta level reasoning is, however, very

102. SEMINAL: Open Problems Page SEMINAL open problems Page. This page will contain a list of openproblems. I suggest we record a single sentence which sums up http://www.brunel.ac.uk/~csstmmh2/seminal/open.html

SEMINAL: Open Problems Page This page will contain a list of open problems. I suggest we record a single sentence which sums up the problem together with a brief description which should appear as free text. The presentation will be in the form of a list with two parts. The single sentence and the author. The single sentence will be clickable. On clicking this will produce the free text brief description. The author will be clickable, taking the reader to the author's home page (or a mailto if there is no home page). This information will be entered using a web form and only registered SEMINAL members will be able to use the form.

103. Some Favourite Open Problems Some favourite open problems Disclaimer This page, under construction, will bean eclectic collection of problems, which share the feature that I tried and http://www-ee.technion.ac.il/~zeitouni/openprob.html

Some favourite open problems: Problem number and authors PS Problem 1: S. Mallat and O. Zeitouni, "Optimality of the Karhunen-Loeve basis in nonlinear reconstruction" Problem 2: Conjecture: the (centered) Gaussian measure of the intersection of two convex, symmetric subsets of Euclidean space is greater or equal than the product of the measures of the two subsets. See for a review of the history of this problem and some partial results: Schechtman, G., Schlumprecht, Th., Zinn, J., On the Gaussian measure of the intersection. Ann. Probab. 26 (1998), 346357. MATH REVIEWS LINK. G. Harge A particular case of correlation inequality for the Gaussian measure. Ann. Probab. 27 (1999), 19391951. MATH REVIEWS LINK Problem(s) 3: RWRE questions, conjectures: 0-1 laws and other problems. See for details the review "Random walks in random environments", Proceedings ICM 2002, vol III, pp. 117127. For recent progress on related large deviations questions, see Varadhan's article MATH REVIEWS LINK.

104. FoIKS - Open Problems next FoIKS will be held in february/march 2002, FoIKS Entry open problems, OpenProblems. General overview 56 open problems, 23 solved by 16 MFDBS participants. http://www.informatik.tu-cottbus.de/~foiks/open_prob/

International Symposium on Foundations of Information and Knowledge Systems (FoIKS) next FoIKS will be held in february/march 2002 FoIKS Entry open problems Open Problems General overview: 56 open problems, 23 solved by 16 MFDBS participants Modeling of reality in databases and knowledge bases. Logical foundations of database semantics. Representation of semantics and algebraic problems. Combinatorial problems. Query and update languages. Normalization theory. Admissible semantics. J. Biskup, J. van der Bussche, P. De Bra, J. Demetrovics, G. Gottlob, S. Hegner, A. Heuer, G. Katona, H. Nam Son, J. Paredaens, L. Tenenbaum B. Thalheim P 1. Find a common motivation, a common formal model and a correspondence that justify properties like normal forms, semantics preserving transformations, acyclicity, and formalize characteristics like complete representation, naturalness, minimality, system independence, flexibility, self-explanation, readability, P 2. Find a formalism which can be used to express structure, semantics and behavior of a database in an integrated manner. P 3.1.

105. A New Algorithm And Open Problems In Three-Dimensional Orthogonal A New Algorithm and open problems in ThreeDimensional Orthogonal GraphDrawing (1999) (Make Corrections) (6 citations) David R. Wood. Proc. http://citeseer.ist.psu.edu/wood99new.html

106. Final Remarks And Open Problems Final Remarks and open problems. Venkatesan and Rajagopalan VR92showed that the distributional matrix representability problem http://www.uncg.edu/mat/avg/avgnp/node34.html

Next: References Up: Average-Case Intractable NP Problems Previous: Distributional Matrix Transformation Final Remarks and Open Problems Venkatesan and Rajagopalan showed that the distributional matrix representability problem is complete for DistNP by reducing the distributional Post correspondence problem to it under a randomized reduction. They also attempted to show that the bounded version of Diophantine problem is average-case NP-complete. Their approach, however, depends on a number theoretic conjecture that remains unproven. The unbounded version of the Diophantine problem is essentially Hilbert's tenth problem, which was shown to be undecidable by Matijasevic based on the work of Davis, Putnam, and Robinson . (A simplified proof of this result can be found from ). The bounded version of the Diophantine problem has been studied by Adleman and Manders DISTRIBUTIONAL DIOPHANTINE PROBLEMS Instance . A positive integers , and an integer polynomial of degree with variables, where is a free term. Question . Do there exist non-negative integers such that for , and Distribution . First randomly choose polynomial and then randomly and independently choose with respect to the default random distributions. The polynomial

107. Unsolved Problems 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. A good paper on open and solved cageproblems is. P.K 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. The reconstruction conjecture . (S.M. Ulam, 1960) 2. A graph G is embeddable in a graph H if G is isomorphic to a subgraph of H . Characterise the graphs embeddable in the k -cube. (V.V. Firsov, 1965)

108. 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 , 24 April 2004 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 Short presentation (also available in postscript and pdf formats) Reference manual (also available in postscript pdf text html and info formats) Frequently asked questions Version history Credits We need your help to build a library of examples all GetDP resources documentation mailing lists 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

109. 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+

110. *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:

111. 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/

112. Calculus Competition Contest open to students at Youngstown State University. Includes a collection of past contest problems. http://cc.ysu.edu/~ejwingle/CalcComp/calccomp.htm

Each year the Department of Mathematics and Statistics and Pi Mu Epsilon sponsor a calculus competition, which is open to any undergraduate student at YSU or any high school student enrolled in an undergraduate class at YSU. The first competition was held on February 10, 1990. The winner of the competition receives a $60 cash prize. The second and third place winners receive $40 and $20, respectively. The winner of the 2004 competition , held on April 3, was Jeremy Hamilton . To see a list of past competition winners, click here Next year's competition will be held some time in late March or early April. Check this page periodically for the exact date. If you would like to see what kinds of questions are asked on the competition, you can download copies of the previous competitions (see below). These are available as PDF files, which can be read by the Adobe Acrobat Reader. The Files. Competition 1 Competition 9 Competition 2 Competition 10 ... Competition 8

113. Problems In Topological Graph Theory Abstract. Do you think you ve got problems? I know I do. This paper containsan ongoing list 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!

114. 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.

115. 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 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. Only 15-30 minutes a day! Imagine the pride you'll feel when your child or students start reading their first book to you. " I am THRILLED with it. It is the best thing on the Web yet ". - Kris, North Carolina

116. 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.

117. 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 Eighth Canadian Open Mathematics Challenge (November 26, 2003)

118. SiteLeader Inc. - Domain Name Registration Site - Register For Your Domain Name RPN combines extensive land use planning expertise to solve problems involving open space preservation and/or economic development in rural areas. http://ruralplanning.net

6/6/2004 3:18:34 AM EST Home Services Website Hosting Domain Name ... ns WWW. Search Domain Name availability for Free, then ... domain (URL) forwarding, e-mail services,etc... At SiteLeader.com, we've been making names for the net since 1996 . We understand that you want to take advantage of the benefits of technology. We also understand the process of doing so can be confusing. That's where we come in. With our unparalleled zeal for customer service, we make sure that you can easily and quickly purchase your domain name, and get it up and running on the web within hours. To begin your three-step journey to an Internet identity, begin searching for your domain name now! * All Inclusive Registrar fee! Please read our , and our Service Agreement This site best viewed with Microsoft Internet Explorer Member of the Internet Link Exchange

119. 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/

Weka 3: Data Mining Software in Java Weka is a collection of machine learning algorithms for data mining tasks. The algorithms can either be applied directly to a dataset or called from your own Java code. Weka contains tools for data pre-processing, classification, regression, clustering, association rules, and visualization. It is also well-suited for developing new machine learning schemes. Weka is open source software issued under the GNU General Public License. Take a tour of Weka Click here for screenshots of the Explorer user interface in Weka. Click here for a presentation demonstrating all graphical user interfaces in Weka. ( Powerpoint file Help Please post Weka-related questions, comments, and bug reports to the Weka mailing list Requirements Java 1.4 is required to run Weka. Depending on your computing platform you may have to download and install it separately. It is available for free from Sun Downloading and installing Weka There are different options for downloading and installing Weka 3.4 on your system: Windows Click here to download a self-extracting executable that includes Java VM 1.4

120. University Of Maryland Math Competition open to all high school students in Maryland and the District of Columbia, with past results, problems and solutions. http://www.math.umd.edu/highschool/mathcomp/

THE UNIVERSITY OF MARYLAND HIGH SCHOOL MATHEMATICS COMPETITION Here is the link to the 2003 University of Maryland High School Mathematics Competition Every autumn, the University of Maryland organizes a High School Mathematics Competition, open to high school students enrolled in Maryland or the District of Columbia. The Competition provides students stimulation, feedback and the opportunity for achievement. There are cash prizes and Edward Krahn Scholar opportunities, which vary from year to year. The competition consists of two examinations. Generally, over 2000 students take the Part I examination. Students who score well on the Part I exam are invited to participate in Part II of the Competition (a considerably more challenging exam). The exams require a sound knowledge of high school mathematics up to, but not including, calculus. Both parts require mathematical insight and ingenuity. The Competition began in 1979 under the leadership of Brit Kirwan, then chair of the Mathematics Department. The first Competition was organized by Professor Gertrude Ehrlich. Over the years, the Competition has been graced by many fine students. For recent years, we have more detailed records: Participating High Schools in Lists of Winners in Some previous Competition exams, with solutions

Page 6     101-120 of 151    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7  | 8  | Next 20