Coffee|Code : Dan Scott, Caffeinated Librarian Geek - Comments

Dan Scott: Northern Ontario scenery

dan@coffeecode.net (Dan Scott) — Sat, 28 Jun 2008 23:31:59 -0400

Hi Bruce: Sorry for the massive delay in replying. For the past three years, I've purchased all of my beans from Birds'N'Beans (http://www.birdsandbeans.ca) - they supply high-quality green beans that are all either fair trade, organic, bird-friendly, or shade-grown at very reasonable prices. They also supply roasted beans, but I haven't tried those so I can't comment on their roasting capabilities.

Dan Scott: Today's trivial tech tip: Getting RSS feeds from diaryland.com blogs

dan@coffeecode.net (Dan Scott) — Sat, 28 Jun 2008 23:28:09 -0400

Yep, it still works - just went to your blog and saw that you had the feed working, so I guess you figured it out.

Dan Scott: Apache Derby tutorial (OSCON 2005) materials

dan@coffeecode.net (Dan Scott) — Sat, 28 Jun 2008 23:24:58 -0400

Hi David: Thanks for reporting the problem; I moved my blog over to a new site and was missing a dependency for some of the older content. It's fixed now. Due to a change of position and responsibilities, I haven't tried running Derby with PHP for over a year now, I'm afraid, so I don't have any up to date resources on the subject. Theoretically, though, you should be able to use the IBM DB2 9.5 Data Server Driver for ODBC and CLI (~14.0 MB download from http://www-1.ibm.com/support/docview.wss?rs=71&uid=swg21287889) to compile the PDO_IBM driver (http://php.net/manual/en/ref.pdo-ibm.php) and connect from that to the Derby Network Server.

David Rekowski: Apache Derby tutorial (OSCON 2005) materials

dan@coffeecode.net (David Rekowski) — Fri, 27 Jun 2008 08:25:19 -0400

The Presentations link is broken, I get PHP error output. Also it would be great if you could post any links to up to date references on how to make php work with derby. It seems there are few resources on that topic, be it PDO_ODBC or ibm_db2 as drivers for php.

Matt Herbey: Get out of jail, go free, part I

dan@coffeecode.net (Matt Herbey) — Wed, 18 Jun 2008 15:13:14 -0400

Looks like you are popular! Check the comments http://www.marshallnews.com/story/1437369.html

cloudy: Introduction to Evergreen at eIFL-FOSS ILS workshop

dan@coffeecode.net (cloudy) — Tue, 17 Jun 2008 13:55:00 -0400

What was Armenia like?

Stephen Akintunde: Introduction to Evergreen at eIFL-FOSS ILS workshop

dan@coffeecode.net (Stephen Akintunde) — Tue, 17 Jun 2008 08:07:11 -0400

Just went through your Power Point presentation for the Evergreen Workshop. I was really educated. I never really got near Evergreen before. Your presentation made it clear and a software worth trying.

Gabriel Sean Farrell: Get out of jail, go free, part I

dan@coffeecode.net (Gabriel Sean Farrell) — Mon, 16 Jun 2008 18:22:34 -0400

Attack the pressure points of their system with your shobo, Daniel-san!

nadine: Today's trivial tech tip: Getting RSS feeds from diaryland.com blogs

dan@coffeecode.net (nadine) — Sun, 18 May 2008 07:08:56 -0400

does this still work? i tried pasting the code in feedburner but it didn't work..

Bruce: Northern Ontario scenery

dan@coffeecode.net (Bruce) — Sat, 17 May 2008 12:53:23 -0400

Hi Dan. My name's Bruce I'm a barista from Australia. I just moved to Windsor, I've been put in charge of making a restraunt a cafe aswell. Do you recommend any coffee roasters or suppliers in Ontario. Thanks

Colleen: Two! 2! Too! Tu! Tout!

dan@coffeecode.net (Colleen) — Mon, 12 May 2008 12:24:31 -0400

Yea! Yea! Yea! I am so happy to see photos of your beautiful little girl. Look at her so cute and turning TWO! The cat cake is spectacular.

Dan Scott: Weeding 2.0

dan@coffeecode.net (Dan Scott) — Mon, 12 May 2008 09:05:09 -0400

Ah yes - we (well to be honest mostly Lynn) have been avid users of that device for a couple of years now - and it certainly falls into the "2.0" category, albeit of the more literal sort of weeding activity! We're mostly successful in keeping ahead of the weeds on our lawn because the ground seems to be toxic enough that very little (including grass) willingly grows on it. I think the previous owners forced growth by heavy dosages of fertilizer - we're taking the much slower nitrogenification method of encouraging clover to take over. In the mean time, of course, we'll be the scandalous talk of the neighbourhood.

Mike Z: Weeding 2.0

dan@coffeecode.net (Mike Z) — Mon, 12 May 2008 00:45:18 -0400

Silly me, I thought it might be about some outdoor activity where one pulls weeds from the lawn. (I'm having some success with this device [see "Homepage" link] on dandelions and thistles - although it would be faster if I wasn't keeping Luca from running out of the backyard, or encouraging Matteo to NOT push his brother down the slide or fall off the top of the playset.) Might have something to do with the time of day (night)...

Mita: Weeding 2.0

dan@coffeecode.net (Mita) — Sun, 11 May 2008 20:50:21 -0400

Hey Dan, Just a quick note of support and encouragement to nurture your idea! I also think a "use dashboard" would be mighty handy tool. Its curious that academic libraries have developed all sorts of standardized workflows around the acquisition of books but the when and how weeding is done tends to be left up to the individual collection librarian.

Lissa: Weeding 2.0

dan@coffeecode.net (Lissa) — Sun, 11 May 2008 20:38:30 -0400

Makes sense. Of course, as a denizen of the PL world, I'm picturing the ability to specify that all members of the group "travel guide" (possibly could be set by a combination of MARC tags, locations, something) are kept for 3 years, so when the new copy comes, put a hold on the oldest and route it to the pages. FRBR would help, maybe, but I'm not holding my breath on that one. In the PL world, we'd need number of circs and last circ date, as well as last copy. I'm not a fan of faceted searching, but, in theory, you could grab a few virtual shelves of books, then use facets to create different kinds of subsets, which you can either send to various purgatories. All this assumes the catalog reflects reality fairly well (not a given, and a distant fantasy where I work), so there is still going to have to be some stack time, I fear. Interesting idea, Dan.