tag:blogger.com,1999:blog-103816462011-07-28T14:05:26.878-06:00CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.comBlogger301100tag:blogger.com,1999:blog-10381646.post-1114452523031464182005-04-25T12:07:00.000-06:002005-04-25T12:09:18.076-06:00

I found a short paper that has a decent introduction to the concepts of Genetic Programming.

Bob Wallhttp://www.blogger.com/profile/07035263339121602867noreply@blogger.com45tag:blogger.com,1999:blog-10381646.post-1114380511979395832005-04-24T16:02:00.000-06:002005-04-24T16:08:31.980-06:00

I thought this week I would continue in the same general topic I started last week - evolutionary computing. This week I'd like to talk a little about genetic programming, how it differs from genetic algorithms, and then look at the paper Evolving Computer Programs using Rapidly Reconfigurable Field-Programmable Gate Arrays and Genetic Programming. Don't worry - the length of the name isn't

Bob Wallhttp://www.blogger.com/profile/07035263339121602867noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1113842704067695102005-04-18T10:23:00.000-06:002005-04-18T11:15:58.926-06:00

Ad-hoc networks are self organising networks requiring no pre-established infrastructure. Lots of research and efforts have been put into designing an effective routing protocol to effectively determine a route from source to destination. Various table driven, source initiated and position based routing protocol have been proposed. After a quick introduction to ad-hoc networks, if not everyone is

Gaurav Dawrahttp://www.blogger.com/profile/01854129457579306773noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1113632337660163262005-04-15T23:47:00.000-06:002005-04-16T00:18:57.660-06:00

Next Monday, I'll be talking about cell placement in VLSI circuits. I'll do a quick overview of what the problem is and some techniques for performing cell placement, then I will talk about the following paper: Genetic Algorithm for Cell Placement. As part of this, I can give a quick overview of genetic algorithms, if not everyone is familiar with them.If you are interested in this topic and

Bob Wallhttp://www.blogger.com/profile/07035263339121602867noreply@blogger.com2tag:blogger.com,1999:blog-10381646.post-1113284713701736662005-04-11T23:37:00.000-06:002005-04-11T23:45:13.703-06:00

The powerpoint slides are up on my CS homepage. Here is the LinkI have written answers to some of the questions and listed some relevant URLs. So please take a look at them.

Alokhttp://www.blogger.com/profile/13549908268976229364noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1113248727705267732005-04-11T13:44:00.000-06:002005-04-11T13:45:27.706-06:00

last but not least, I'll be talking about parallel sorting algorithms. while there might be papers out there that could give you an introduction, I think that sorting is pretty self-explanatory, so just come as you are.anthony

Anthonyhttp://www.blogger.com/profile/02191557927422958433noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1113234627492776282005-04-11T09:49:00.000-06:002005-04-11T09:50:27.493-06:00

Today [April 11], I will be talking about the parallel S-trees.After a quick introduction to S-trees, i'll present the parallel build and search techniques along with some test results. Most of the content is from the paper Performance Evaluation of Parallel S-trees-Alok

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1113199585488316722005-04-10T23:54:00.000-06:002005-04-11T00:06:25.490-06:00

I'll be stretching the definition of parallel computation for Monday the 11th's class by discussing two papers covering distributed computing. First, I'll cover the Folding@Home and Genome@Home projects from a high level, looking at what they do and the changes that were required to their algorithms in order to utilize distributed computing. Here's the paper.Second I'll offer the complement to

Leif Wicklandhttp://www.blogger.com/profile/01820541736912004507noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1112754585875656712005-04-05T20:24:00.000-06:002005-04-05T20:29:45.876-06:00

This (see link below) is a recent article from IBM about AltiVec vector processing support in PowerPC chips in comparison to AMD and Intel chips, and is relevant with respect to the question about the MMX instruction set that came up during my presentation. AltiVec

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1112720263570987872005-04-05T10:55:00.000-06:002005-04-05T10:57:43.570-06:00

Since a few people were asking about the Google File System, I thought I'd put a link to the reference below...- ChrisGoogle File System

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1112682867642297902005-04-05T00:31:00.000-06:002005-04-05T00:34:27.643-06:00

I have uploaded my presentation slides for the Google MapReduce and MPI if anyone is interested. Here are the links...Google MapReduce Intro to MPI - Chris

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1112386425219958712005-04-01T13:07:00.000-07:002005-04-01T13:13:45.220-07:00

Please take a look at the attached a paper about Google's MapReduce. It talks about a method that Google uses for certain indexing/search/etc. tasks and how it is distributed across a large number of machines. I'll be presenting it in next weeks class along with a very basic introduction to parallel programming with MPI. Enjoy!- Chris MapReduce

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com1tag:blogger.com,1999:blog-10381646.post-1111957505602343282005-03-27T13:42:00.000-07:002005-03-27T14:05:05.603-07:00

Two short papers on optimization in photoreceptors... they're more biological than computational, but "evolutionary efficiency" is assumed in many of the computational alogrithms for biology. Hopefully this will lead to a more generic idea of optimization vs. constraints in any system.One An older paper, but easier to follow - optimization of the length of a photoreceptor for receiving

Nathanielhttp://www.blogger.com/profile/09509772151767623811noreply@blogger.com1tag:blogger.com,1999:blog-10381646.post-1111787097867731422005-03-25T13:33:00.000-07:002005-03-25T14:44:57.870-07:00

I may be able to talk about deterministic annealingI guess one simple read is following unpublished work

zgeckonoreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1111522531836962172005-03-22T13:14:00.000-07:002005-03-22T13:15:31.836-07:00

Here is the paper I referenced on Mondayhttp://www.cs.montana.edu/~gradl/randproj_kdd.pdf

Timhttp://www.blogger.com/profile/04587832387136382328noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1111441370338104462005-03-21T14:41:00.000-07:002005-03-21T14:42:50.340-07:00

I've posted a couple papers to the CS 580 course web on neural coding. We will discuss these tonight and next week.Brendan

Brendanhttp://www.blogger.com/profile/01124456120987930584noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1109894095147515382005-03-03T16:50:00.000-07:002005-03-03T16:54:55.150-07:00

Forgot to post the links !!Genome Rearragmentshttp://shiva.msu.montana.edu/~vijayr/Pevzner.pdfShotGun Sequencinghttp://shiva.msu.montana.edu/~vijayr/myers.pdf-Vijay

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1109893780528554342005-03-03T16:49:00.000-07:002005-03-03T16:49:40.526-07:00

CS 580 - Computational Science Blog Hello All, I will be presenting two papers one on Genome Rearragement another one on Shot Gun Sequencing in next class. Here are the links to papers Genome Rearragement Shot Gun Sequencing -Vijay

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1109737188888376142005-03-01T21:15:00.000-07:002005-03-02T06:50:44.176-07:00

The slides for the sequence alignment presentation I gave on Monday are available in PDF, PowerPoint, and OpenOffice formats.

Leif Wicklandhttp://www.blogger.com/profile/01820541736912004507noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1109310929648695262005-02-24T22:14:00.000-07:002005-02-24T22:59:16.793-07:00

On Monday, January 28, I'll present on multiple sequence alignment. Wikipedia has a nice overview of sequence alignment. In a nutshell, multiple sequence alignment is approximate string matching across many strings. It is commonly employed in computational biology to detect similar sequences in different species to aid molecular evolutionary analysis.I'll look at the specifics of a pair of

Leif Wicklandhttp://www.blogger.com/profile/01820541736912004507noreply@blogger.com1tag:blogger.com,1999:blog-10381646.post-1108056957386193502005-02-10T10:33:00.000-07:002005-02-10T10:35:57.386-07:00

I've posted a couple new papers to the 580 website on computational biology. These are ones that I've written on two problems: clustering microarray data and mapping the surfaces of proteins. Please take a look. I will discuss the first paper on Monday and Nathaniel will discuss the second.

Brendanhttp://www.blogger.com/profile/01124456120987930584noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1107886727460586752005-02-08T11:16:00.000-07:002005-02-08T11:20:21.666-07:00

I came across this Applet while trying to find out a "visual" description of the algorithm in 2D. Hope this helps. http://research.compaq.com/SRC/JCAT/jdk10/closestpair/index.html

Gaurav Dawrahttp://www.blogger.com/profile/01854129457579306773noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1107802960425315862005-02-07T13:00:00.000-07:002005-02-07T12:02:40.426-07:00

New paper on numerical cosmology up on the course web: http://www.cs.montana.edu/courses/580/papers/p13-bryan.pdf Aaron is presenting this tonight.

Brendanhttp://www.blogger.com/profile/01124456120987930584noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1107704355713709542005-02-06T08:27:00.000-07:002005-02-06T08:40:54.833-07:00

Sorry guys, I seem to be having trouble signing up as an individual, so I'm posting as the administrator. On the line of processing large datasets, I have looked up a few useful algorithms. I decided on the topic of integration in large datasets because this is something I've done recently. Numerical Recipes in C provides some fabulous information, so I thought I'd discuss a few sections of

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1107467763612132892005-02-03T14:56:00.000-07:002005-02-03T14:56:03.613-07:00

here is link to the paper I promissed http://ai.rightnow.com/colloquium/papers/kleinberg_clustering_impossibility.pdf

zgeckonoreply@blogger.com1tag:blogger.com,1999:blog-10381646.post-1107465567380582012005-02-03T13:47:00.000-07:002005-02-03T15:05:19.970-07:00

Closest point problems holds in finding the closest point among the points in the d-dimension space. Closest point problem and its useful arises in areas like molecular biology, pattern recognition, clustering and many more useful applications. Closest point problem falls in the domain of well studied and classical proximity problems. This paper highlights some of the problems and successes in

Gaurav Dawrahttp://www.blogger.com/profile/01854129457579306773noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1107385436976290812005-02-02T15:55:00.000-07:002005-02-02T16:03:56.976-07:00

I stumbled on this today. The article talks about some bounds for a NNS algorithm in high dimentions via a reduction to the "Point Location in Equal Balls" problem. I didn't read it in great detail, but it appeared to a more generalized algorithm than the specific cases discussed in the Arya paper that was linked. www.cs.montana.edu/~gradl/indyk98approximate.pdf -Tim

Timhttp://www.blogger.com/profile/04587832387136382328noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1106850307174300052005-01-27T11:22:00.000-07:002005-01-27T12:03:07.210-07:00

To continue discussion with anthony's posting. Nearest neighbor search in high dimensional spaces is an interesting and important. There are many versions of nearest neighbor search out there. Before delve into the detail of the nearest neighbor. I was looking for PhD. Thesis of Sunil Arya ( One of the Sunil Arya's Paper is also posted by Anthony), could not able to find it. Finding the closest

Gaurav Dawrahttp://www.blogger.com/profile/01854129457579306773noreply@blogger.com0tag:blogger.com,1999:blog-10381646.post-1106783600361397302005-01-26T16:52:00.000-07:002005-01-26T16:53:20.360-07:00

Nearest neighbor problems exist in both holding the nearest neightbor data, and the algorithmic time to actually create this data structure. This paper has a good introduction that highlights some of the problems and successes in this area. Also, the paper improves on some of the existing approximation algorithms. The paper is dated 1999, so it's a little more current than what we've looked at

Anthonyhttp://www.blogger.com/profile/02191557927422958433noreply@blogger.com3tag:blogger.com,1999:blog-10381646.post-1106627162261010002005-01-24T21:22:00.000-07:002005-01-25T10:51:49.260-07:00

Hello friends: Welcome to the WebBlog of CS580-Computational Science taught by Brendan. We will be discussing lots of Physical sciences areas where computational science can be applied. To start with it, we are exploring various papers on: -- N-Body Simulations --Computational Science application in Astro physics

CS 580 Memberhttp://www.blogger.com/profile/17997889057989165517noreply@blogger.com2