CTSC:ARRA.020811

From NAMIC Wiki
Revision as of 15:48, 8 February 2011 by RandyGollub (talk | contribs) (Created page with 'Back to CTSC:ARRA supplement <br> <br> == Harvard Catalyst Medical Informatics group Meeting Minutes February 08, 2011 == In attendance: * Bill Wang * Shawn Murphy * Vinc…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
Home < CTSC:ARRA.020811

Back to CTSC:ARRA supplement



Harvard Catalyst Medical Informatics group Meeting Minutes February 08, 2011

In attendance:

  • Bill Wang
  • Shawn Murphy
  • Vincent Roch
  • Darren Sack
  • Bill Tellier
  • Randy Gollub
  • Chris Herrick
  • Yong Gao
  • Jesse Wei (phone)
  • Mark Anderson (phone)
  • Alex Zeitsev


  • Charles McGow
  • Steve Pieper
  • Paul Lamonica (phone)
  • Kathy Andriole (phone)


mi2b2 software update

Working to resolve the incompatibility issue at MGH site (was problem on both initial laptop and new desktop servers) where C-move requests for data sets with more than 2000 images fail because the fetch fails after 2000 images. Tried DCMtk and it worked. Not sure why. This doesn't happen at CHB or BWH or BIDMC.


query process

At CHB, BWH and BIDMC there is a single gateway for query. At MGH, it is a multi-node PACS.

Policies and Procedures for PACS access at each institution

  • Continued discussion about position the C-moves in a friendly way with the Radiology PACS. For each AE address it is "sufficient' to pull images between X time and X time on X day of the week at a rate of XX images/10 minutes per thread with a limit of X threads. Jesse suggests having some sort of dynamic parameter that will regulate the pulls by a factor that is responsive to the busy-ness of the PACS such as a ratio of 5x the pull return time before the next pull could be sent. Shawn points out that the limit to the number of threads in fact may accomplish this goal. This plan is simple and will be easier to test, build trust in and adjust as needed both increasing and decreasing parameters per site. Shawn expressed concern about complex algorithms as they are highly prone to fail.