Save X Rays.

How can we save x rays to database?
[56 byte] By [niy8] at [2007-9-26 2:18:45]
# 1
Pb is a good protecton from X Rays.
valjok at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 2
> How can we save x rays to database?X rays? Well, that's pretty interesting. Maybe you should put this on a physics forum. Are you talking a about arrays possibly?
dubwai at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 3
Back in the dawn of PCs, there was a database product called dBase, and when people used its data format they called that "xBase". That sounds like a good place to store x-rays.
DrClap at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 4
also, you could try trapping the x rays in a bag, and then just put the bag in the database.
Kayaman at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 5
Save the X Rays!!!
Kayaman at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 6
Search for articles of Wilhelm Conrad Rontgen.Mr Rontgen is a guru on the theme.";=o)Ragnvald BarthSoftware engineer
Ragnvald at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 7
Maybe there is a substance that works as an X-ray mirror. You could use this substance to cause the X-ray to bounce around in a box forever, or until you need to 'retrieve' them.
dubwai at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 8
1 - create a black hole2 - place the X Ray on the Schwarzschild radius.-> it will circle around the black hole ad infinitumHow does a mathmatican catch an elephant in the desert?
spieler at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 9
> How does a mathmatican catch an elephant in the> desert?I don't know. How?
dubwai at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 10
sorry for teasing you niy8,the problem is nobody knows what you really want to know. Do you want to store x-ray pictures?Please rephrase the question and you'll get answers.serious answeres that is.Spieler
spieler at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 11
Algorithm: Divide the desert into half. Choose the half containing the elephant. Apply the algorithm recursively until the size of the area searched is less than or equal to the size of the elephant.
DrClap at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 12

well if u r serious enough then its right out there for u

x-rays are stored in picture format and to store them u require storrage device.i actually dont know the format of this picturte but say in oracle u have data types as clobs,blobs use them to store x-ray'ed pictures . hope it helps u

mpincoo at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 13

Hello Charlotte

Hmm... well that's an interesting question.

It depends on what you really want to save. It is the actual X-ray pictures or some sort of catalogue of them?

If it's a catalogue then that's easy. If it's the actual pictures then you'd probably need a scanner, a very large disk for storage, someone to scan them in and so on.

Post more details so we know what you want to do.

Regards

Daniel Lam

Daniel_Lam at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 14

Hello Charlotte

Hmm... well that's an interesting question.

It depends on what you really want to save. Is it the actual X-ray pictures or some sort of catalogue of them?

If it's a catalogue then that's easy. If it's the actual pictures then you'd probably need a scanner, a very large disk for storage, someone to scan them in and so on.

Post more details so we know what you want to do.

Regards

Daniel Lam

P.S. If this message has been posted twice, that's because there's been a minor correction to the original. :)

Daniel_Lam at 2007-6-29 9:20:11 > top of Java-index,Core,Core APIs...
# 15

> Algorithm: Divide the desert into half. Choose the

> half containing the elephant. Apply the algorithm

> recursively until the size of the area searched is

> less than or equal to the size of the elephant.

Nope, thats the developer way to do it.

choose a point in the desert.

Build a Fence around it.

check if the elephant is inside.

if not define the outside as inside and your done.

:-)

spieler at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 16
The most topical would be to perform an x-ray scan of the desert to locate the elephant, then store the x-rays in the database, and the elephant is caught.";=0)Ragnvald BarthSoftware engineer[/b]
Ragnvald at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 17
Only if you assume that information about an object and the object itself is the same ...sounds like a proxy object pattern to me ... 8o)
spieler at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 18

Hi,

I found this interesting :) So I searched the web for it. There is something called DABAX, DataBase for X-rays. Check out this site...

http://www.esrf.fr/computing/expg/subgroups/theory/DABAX/dabax.html

Hope this helps. Otherwise we will go back to more teasers. BTW, the elephant one was good :)

Best Regards,

Manish

javax.pert at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 19

> Only if you assume that information about an object

> and the object itself is the same ...

>

> sounds like a proxy object pattern to me ...

No spieler. You see, the x-rays fry the elephant, and the database tells you its location (assuming fried elephants dont move). This is a typical example of replication. The elephant is stored both in the desert and in the database.

//Ragnvald\\

";=0)

Ragnvald at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 20
> How does a mathmatican catch an elephant in the> desert?Stick peanuts on a cactus?
dmbdmb at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 21

HI,

I went through the 19 replies that were posted to your query. Unfortunately all are **** except one with the link.

In any case if you r more interested in this then perhaps I might be able to help. If you want to go ahead then please post a reply and I will get in touch with you...

waiting...

alikamran at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 22
A microsoft developer would find the elephant by taking a second dessert and slam it down to the first one. The bloody spot is the elephant.
joerg.wassmer at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 23
The other bloody spot is the mathematician looking for the elephant.
Spaceman40 at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 24
> The other bloody spot is the mathematician looking for> the elephant.How do you tell which is which?
dmbdmb at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...
# 25
the mathmatician is inside a little crumbled circle ... which was the fence.
spieler at 2007-7-1 1:49:18 > top of Java-index,Core,Core APIs...