Informatik - Universität Des Saarlandes - Saarbrücken Department of computer Science. Areas of research include combinatorics, computational geometry, compilers for realtime embedded systems, formal modelling of circuits, computer architecture, description and planning logics, formal grammars, cryptography, and distributed algorithms. http://www.cs.uni-sb.de/
Extractions: This is a rough draft of my class notes on computer animation. It does contain typos and some mistakes, so 'buyer beware'. I've had this up on the web for some time and had hoped that when people saw it, they would contribute links or other information that would make this truly a web-book. This never really happened, so it looks like I'm going to bite the bullet and actually make this into a 'real' book. As a result I haven't been concerned with correcting these notes or updating them. The book incorporates most of the information here as well as a bunch more. The book offers additional electronic information in the form of web pages. The book is published by Morgan-Kaufmann. Rick Parent, Computer Animation: Algorithms and Techniques Morgan-Kaufmann, Interested readers might also take a look at my resource page which has a lot of links to information related to computer animation (also linked to by www.computeranimation.org). Go to Table of Contents
Computer Methods For Mathematical Computations Code from the book, translated to ELF, a Fortran 90 subset. algorithms for calculations in science and engineering, including linear equations, spline interpolation, integration, differential equations, zero finding, minimization and singular value decomposition. http://www.pdas.com/fmm.htm
Extractions: PDAS home Public Domain Aeronautical Software (PDAS) Computer Methods for Mathematical Computations by George Forsythe, Michael Malcolm and Cleve Moler is one of the great classic textbooks of numerical methods for scientists and engineers. Many people (myself included) have used the book as a reference and used the programs as tools for a variety of computing projects. Although the algorithms are still usable in their original pre-Fortran 77 format, the readability and usability is greatly enhanced by using the coding style of modern Fortran. I have rewritten the procedures in modern Fortran. In particular, the library will now compile correctly using Lahey Essential Fortran (ELF), which is a subset of the general Fortran language. Successful compilation with ELF is a virtual guarantee that you are not using any proprietary Fortran extensions that might affect the portability of your code. These codes are on the current (version 8) disc. I intend to replace the routines that were originally included with some of the aeronautical programs with the counterparts from this library.
INI Programme CMP Research programme at the Isaac Newton Institute, Cambridge UK. Themes include Randomised algorithms; Phase transitions in statistical physics and computer science; Random graphs and structures. August December 2002. http://www.newton.cam.ac.uk/programs/CMP/cmp.html
Extractions: Background 29 Jul - 20 Dec 2002 Organisers : Professor Martin Dyer ( Leeds ), Professor Mark Jerrum ( Edinburgh ), Dr Peter Winkler ( Bell Labs Programme theme As Computer Science has matured as a discipline, its relationships with mathematics have become both more wide ranging and more profound. The programme will explore two particularly fruitful interfaces between computer science and mathematics, namely those with combinatorics and probability theory. Although no interdisciplinary work within the broad area delineated by the title will be excluded, the following themes will receive special emphasis. Randomised algorithms. The design and analysis of algorithms that make random choices; also deterministic algorithms when run on random instances.The theoretical basis here includes the study of parameters connected with random walks on graphs and the relationships between them. "Phase transitions" in statistical physics and computer science.
Rostock, University computer Science Department. Research areas include theoretical computer science, algorithms and theory of programming, computer architecture, information and communication services, parallel and super computing. databases and information systems, programming languages and compilers, simulation, software techniques, and computer graphics. http://www.informatik.uni-rostock.de/en/
Welcome To LaBRI Bordeaux. Researchers at the LaBRI are organized into five research teams Combinatorics and Algorithmics (Enumerative combinatorics, maps, physics; Random generation and visualization; Graphs and applications; Distributed algorithms); Logic, Formal Languages, and Applications (Graphs and logic; Formal languages; Rewriting, Databases); Modeling, Verifying and Testing Computerized Systems; Parallel and Distributed Computing;Image and Sound (Image analysis; Image synthesis) http://www.labri.u-bordeaux.fr/index-en.htm
Institute Of Computer Science Institute of computer Science. Research covers applied computer science, neural networks, parallel genetic algorithms, and fluid dynamics on parallel systems. http://www.informatik.uni-osnabrueck.de/index.php
Digraphs, Theory, Algorithms, Applications A comprehensive source of results, notions and open problems on directed graphs, with 12 chapters, 754 pages, 186 figures and 705 exercises. The book is aimed at undergraduate and graduate students, mathematicians, computer scientists and operational researchers. Site has preface, contents, chapter 1 and other extracts (PS) with errata, updates and ordering information. http://www.imada.sdu.dk/Research/Digraphs/
Extractions: 754 pages; 186 figures; 705 exercises Second printing has been released from Springer in April 2001. Softcover version is available as of May 2002 at 29.50 British Pounds. The ISBN number is 1852336110. This page contains some useful information about the book. The page will be updated frequently. Should you have questions, please contact one of the authors by email jbj@imada.sdu.dk gutin@cs.rhul.ac.uk You may also consult Springer's catalogue page for the book at Springer's book catalogue Selected parts of the book (postscript). Preface List of Contents Subject index Chapter 1 ... Pages 658-659 Mathematics Subjects Classifications: 05C20, 05C38, 05C40, 05C45, 05C70, 05C85, 05C90, 05C99, 68R10, 68Q25, 68W05, 68W40 90B06, 90B70, 90C35, 94C15 Springer's book catalogue Amazon.co.uk
University Of Trier (Trèves) / CS Homepage computer Science Department. Research groups cover stochastic modelling and computer networks, theoretical computer science, programming languages and compilers, databases and information systems, system software and distributed systems algorithms and data structures. http://www.informatik.uni-trier.de/
Extractions: Department News Information for new students (german) Prof. Dr. sc. Christoph Meinel Internet Security I - Internet Technology on-demand for the internet bridge Trier - Beijing Prof. Dr. sc. Christoph Meinel Internet Security I - Internet Technology on-demand for students from Trier and ULI Prof. Dr. sc.
Complexity Of Algorithms, Contents A list of topics from a computer Science course involving complexity of algorithms. HTML and PS format. http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html
Extractions: (Topic outline) Finite automata Turing machines Random Access Machines ... 2.1 Regular languages Recursive and recursively enumerable languages Other algorithmically undecidable problems Logically undecidable problems Exercises ... Exercises Non-deterministic Turing machines The complexity of non-deterministic algorithms Languages in NP ... 8.1 Classical methods Pseudo-random numbers One-way functions Exercises 8.1 Parallel random access machines 8.2 The class NC Exercises 9.1 Algorithms decision trees: sorting and searching 9.2 Non-deterministic decision trees 9.3 Lower bounds on the depth of decision trees Exercises 10.1 Communicaton matrix and protocol-tree 10.2 Non-deterministic communication complexity 10.3 Randomized protocols Exercises 12. The complexity of algebraic computations
Evolutionary Algorithms In Computer-Aided Molecular Design Evolutionary algorithms in computerAided Molecular Design. Desjarlais, JR and Clarke, ND computer Search algorithms in Protein Modification and Design. http://panizzi.shef.ac.uk/cisrg/links/ea_bib.html
Extractions: GENERAL EA REFERENCES - BOOKS Clark, D.E. (Ed). Evolutionary Algorithms in Molecular Design . Wiley-VCH, Weinheim, 2000. Michalewicz, Z. and Fogel, D.B. How to Solve it: Modern Heuristics. Springer-Verlag, 2000. Bentley, P.J. (Ed.) Evolutionary Design by Computers. Morgan Kaufmann, 1999. Koza, J.R., Bennett, F.H., Andre, D. and Keane, M.A. Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufman, 1999. Coley, D.A. Introduction to Genetic Algorithms for Scientists and Engineers. World Scientific, 1999. Fogel, D.B. (Ed.) Evolutionary Computation: The Fossil Record. IEEE Press, Piscataway (NJ), 1998 (ISBN: 0-7803-3481-7). Falkenauer, E. Genetic Algorithms and Grouping Problems , Wiley, Chichester, 1997. Banzhaf, W., Nordin, P., Keller, R.E. and Francone, F.D. Genetic Programming: An Introduction on the Automatic Evolution of Computer Programs and its Applications , Morgan Kaufmann, San Francisco, 1997.
TUM Informatik - Faculty of Informatics. Research groups focus on programming, distributed systems, formal languages, compiler construction, database systems, engineering applications of computer science, numerical methods, real time systems, robotics, theoretical computer science, artificial intelligence, communication, deduction, knowledge based systems, image processing, computer architecture, applied computer science, operating systems, networks, and algorithms. http://www.informatik.tu-muenchen.de/index_en.html
Extractions: Welcome to the Department of Informatics! ACADEMIC The lectures of Summer Semester 2004 start Monday, 19/04/2004 and finish Friday, 23/07/2004. This site provides information for and much more. Starting with the Winter Semester 2002/2003 the department offers special programs for gifted students . Beginners and students starting their third semester in Informatics may apply for this programs until October/01/2003. FACULTY Campus Garching DREHSCHEIBE Current Events TU-Film: Nicht Auflegen! Festveranstaltung: Friedrich L. Bauer 80 Jahre Vortrag: Ein mögliches Szenario für den PC um 2010 und seine Bedeutung für unser Leben TU-Film: Findet Nemo (Open Air in Garching) New Announcements Vortrag: Ein mögliches Szenario für den PC um 2010 und seine Bedeutung für unser Leben Sonderkolloquium: Actor-Oriented Design: Concurrent Models as Programs Festveranstaltung: Friedrich L. Bauer 80 Jahre Deutsch-italienische Hochschultage ... ... More ... Search in Announcements Courses Persons Rooms Web-Pages Student in München? Check out
Illinois Genetic Algorithms Laboratory IlliGAL studies nature's search algorithm of choice, genetics and evolution, as a practical approach to solving difficult problems on a computer. Research at IlliGAL has concentrated on the development of a design theory for selectorecombinative GAs, their competent design and implementation, GAs using selection and recombination that solve hard problems, quickly, reliably, and accurately, and the analysis and design of efficiency enhancement measures through parallelization, time utilization, hybridization, and evaluation relaxation. http://www-illigal.ge.uiuc.edu/
Jeffrey D. Ullman J.D. Ullman He is a famous author of computer science books, on algorithms Discrete Mathematics . http://www-db.stanford.edu/~ullman/
Extractions: Jeffrey D. Ullman Jeff Ullman is the Stanford W. Ascherman Professor of Computer Science (Emeritus). His interests include database theory, database integration, data mining, and education using the information infrastructure. What's New Polemics Publications Books ... Biographical Information What's New I'm a founder of Gradiance Corporation , whose goal is to provide better, cheaper homework and programming-lab support for college courses. Our first offering is support for database courses, but we hope to be covering all of computer science, and more soon. I taught CS345 in Spring 2003 as a mixture of database theory and data-mining algorithms. The Main CS345 Page has been updated to include new materials and Powerpoint slides. In the Fall of 2002 I developed a set of Powerpoint slides with voiceover. I have made them available to anyone who would like to use them. However, these are large files, about 20MB on average. The slides are also available in GIF or Powerpoint, without the voiceover, for those who prefer slides that don't talk at them and that download a lot faster. Here is the Directory of Available Slide Sets These Slides are from a survey talk given at the 2003 DASFAA Conference in Kyoto.
University Of Konstanz, Department Of Computer And Information Science Department of computer Information Science. Research topics include VLSI, algorithms for planar networks, discrete algorithms, software engineering, network design, railroad applications, graph visualization, and optimization in object databases. http://www.inf.uni-konstanz.de/index.html.en
CERL Sound Group The CERL Sound Group is an informal research group that undertakes hardware/software development in digital audio signal processing and computer music. Current research areas include realtime algorithms, sinusoidal modeling, user interface hardware/software for music performance, airflow, and music notation. http://www.cerlsoundgroup.org/
Department Of Computer Science, The University Of Tennessee At Knoxville Offers B.S., M.S., and Ph.D. degrees in computer science. Research interests include algorithms and computability, scientific computing, genetic algorithms, image analysis, and neural networks. Online resources include UTK news reports and study abroad opportunities for computer science majors. http://www.cs.utk.edu/
Extractions: University Links About the University Academic Programs Administration Libraries Research Support UT The University System A-Z Index WebMail Dept. Directory Select type of search People Search Campus Search System Search Admissions Undergraduate Admissions Graduate Admissions Transfer Students ... Contact Us Dr. Bob Ward thanks Ken and Jeane Vann at the annual 2004 ACM Banquet. [ more info... Sumarni Kemala Email: info@cs.utk.edu Welcome Message On behalf of the faculty, I welcome you to the Department of Computer Science at the University of Tennessee at Knoxville - the flagship research university of the State of Tennessee. The department's mission is to produce scholars capable of creative work in computer science. [ more...
Improving Computer Control Of Batch Dyeing Operations Presentation of novel control algorithms, and specific simulation and experimental results for fuzzy logic and adaptive control systems in textile dye houses. Authors Brent Smith and Jun Lu. PDF document. http://www.p2pays.org/ref/03/02348.pdf
Algorithms And Data Structures In F And Fortran By Robin Vowels (Unicomp). Emphasizes fundamentals of structured programming through study of F and Fortran 90/95. It is designed for a reader's second exposure to computer programming, whether it be through selfstudy or a course in computer science. Site describes book, lists contents, and provides code examples. http://www.swcp.com/~walt/fortran_store/Html/Info/books/adsff.html
Extractions: ISBN 0-9640135-4-1 Algorithms and Data Structures in F and Fortran emphasizes fundamentals of structured programming through study of F and Fortran 90/95. It is designed for a reader's second exposure to computer programming, whether it be through self-study or a course in computer science. The book is not just algorithms. Additional F/Fortran topics are included: separate theme chapter are devoted to complex arithmetic, file processing, list processing (the extensive chapter includes binary search trees), text processing including string searching, and recursion. Chapters can be studied in any order, as they are mostly independent; They can be selected at will according the reader's interests. The book is backed up by comprehensive appendices on the built-in procedures and summaries of the F and Fortran statements. It is recommended, although not essential, that the reader be familiar with the F or Fortrran 90/95 programming language, prior to using this text. One excellent introduction to F is Programmer's Guide to F The programs in the book are available here in zip format The programs in the book are available here in tar format A detailed table of contents is here The chapters are: Sorting Recursion Linked Lists and Trees Complex Arithmetic Using Published Algorithms Text Processing Files Solving Simultaneous Equations Graphics Searching Numerical Methods Whole Array Operations
