╨╧рб▒с>■    ■                                                                                                                                                                                                                                                                                                                                                                                                                                           ье┴s ┐4▐jbjb└ └ "╘кkкk4┌      ]╪╪╪╪╪╪╪HHHHH TLHg*╝╝╝╝╝╝╝╝$&&&&&&,СЇЕ░R╪╝╝╝╝╝R┤╪╪╝╝╝┤┤┤╝о ╪╝╪╝$ьоЪо╪╪╪╪╝$┤p┤$╪╪$а╠ЮW╕HHj J$ BioInformatics Reviewed Links

BioInformatics Reviewed Links

[PAGE 1 PAGE 2 PAGE3 PAGE4 PAGE5]


Link: http://www.nci.nih.gov/bip/spieppr.htm
 
Reviewed by: Mohammed Kuddus
 
ЖЖЖЖЖЖЖ NCI Initiatives in Computer Aided Diagnosis
 
This paper reports the progress of an image database for lung cancer
screening that uses spiral X-ray CT being investigated by the National
Cancer Institute. The best method of use involves the cooperation of
investigators willing to join a collective of institutions to build a
database for public use and research, such as the National Library of
Medicine Visible Human Project, initiated in 1989, and the Human Brain
Project, begun in 1993. The eventual goal is to build norms for 
generating the database and allow it to be used for assessing computer aided 
diagnosis software methods. Spiral CT of the lung was the initial focus of 
interest to aid early intervention because the imaging database was used for lung 
cancer screening for patients at high risk. The more efficient the screening
becomes, the more potential there is in using Computer Aided Diagnosis
methods for large-scale cancer screenings. Lung imaging offers an ideal
physical model for 3D Computer Aided Diagnosis methods for both 
detection and classification and any change in the CT images over time will 
provide improved early cancer detection or better categorization.
 



 
Link: http://www.techreview.com/magazine/oct01/cohen_pro.asp
 
Reviewed by: Christopher Conway
 
ЖЖЖЖЖЖЖ The Proteomics Payoff
 
This article is an overview of the field of proteomics: the history, 
the potential, the hype and the reality. The discussion centers on the
possibility for a "human proteome project" to follow the mapping of
the genome and proteomics' applications in drug discovery and medical
treatments.
 
The word "proteome" was coined in 1994 to mean "all the proteins 
expressed by a genome, cell or tissue." Since the genome is essentially a 
blueprint for creating proteins, a fully sequenced human genome leads inevitably 
to the question of the proteins coded for within. The p!
roblems of gene
expression, protein formation and structural complexity make "mapping 
theproteome" a much trickier proposition than simply sequencing base pairs 
of DNA. DNA is essentially a linear combination of just four nucleotides 
found in the same form in the same place in every cell of an organism. 
Proteins, in comparison, are expressed selectively in different tissues. They are
formed from combinations of 20 different amino acids and every protein 
has a unique three-dimensional structure. A human proteome map would need 
to identify, sequence and structurally analyze every protein expressed in 
every tissue of the human body.
 
The technology available for protein analysis will not allow f!
or an
undertaking of that scale. Very few automated tools exists for working 
with proteins. Researchers use gel electrophoresis to separate them, mass
spectrometry to analyze their components and x-ray crystallography to
determine their three-dimensional structure. Each of these techniques 
is time-consuming and each of them has its flaws. For instance, x-ray
crystallography relies on the ability to crystallize a protein -- 
something which is often difficult, or perhaps impossible, to do. There exists no
tool for working with proteins that is as efficient as the automated 
DNA sequencer.
 
Given these limitations, researchers are concentrating on relatively 
small slices of the problem. !
The Alliance for Cellular Signaling is working 
to identify the proteins that are involved in the cellular signaling of 
two types of mouse cells within ten years. Large Scale Biology is working 
on a Human Protein Index that will identify significant proteins in 
"medically relevant" tissues. Celera is concentrating on identifying proteins
associated with specific diseases.
 



Link: http://www.wisdom.weizmann.ac.il/~udi/DNA5/turing5.html
 
Reviewed by: Christopher Conway
 
ЖЖЖЖЖЖЖ Blueprint for a Biomolecular Computer
 
 
The paper describes a mechanical device conceived by Ehud Shapiro which 
models Turing machine, i.e., a universal programmable computer. It may 
be possible to implement the device as a biomolecular machine that 
might operate in vivo to construct synthetic polymers based on input from its 
cellular environment.
 
A Turing machine is a conceptual device which consists of a read/write 
head positioned on a linear tape marked with symbols and a set of state 
transition rules of the form (Current State, Current Symbol, New State, 
New Symbol, Move Left/Right). In other words, a Turing machine reading 
an input symbol from a tape can move to a new state, output a new symbol 
to the tape and move the read head left or right. Church's thesis 
conjectures that any function which is computable is computable by a Turing 
machine.
 
Mr. Shapiro's machine uses a polymer of "alphabet molecules" as its 
tape. Each alphabet molecule consists of a side-group representing a symbol 
and left and right links to form the polymer tape. State transitions are 
represented by "transition molecules" consisting of recognition sites 
for the previous symbol (alphabet molecule) and state (transition 
molecule), a side-group representi!
ng the new state, a location site for the new 
symbol (alphabet molecule) and left and right links that allow it to be 
embedded within the polymer tape.
 
A program for the machine consists of a set of "loaded" transition 
molecules (i.e., transition molecules with attached alphabet molecules, 
representing codified state transitions). At any given step in the 
computation, the polymer tape will have a transition molecule embedded 
at some point, with adjacent alphabet molecules to the left and to the 
right allowing for either a left or right state transition (i.e., a 
transition of the form "S0,a->b,S1" (left) or "a,S0->S1,b" (right)). If there is 
at least one transition!
 molecule that accepts either of those states, it 
will bond from above, displacing the previous transition molecule and the 
matched alphabet molecule and incorporating itself into the tape 
polymer. (See figures: http://www.wisdom.weizmann.ac.il/~udi/DNA5/turing5_figures/index.htm) 
 
As the execution states "stack up" a trace polymer is created containing 
every previous state and "erased" symbol. This is not necessary for a 
Turing machine, but it makes the machine's computations reversible, and 
allows for program analysis and error detection.
 



 
Link: http://www.arstechnica.com/reviews/2q00/dna/dna-1.html
 
Reviewed by: Christopher Conway
 
ЖЖЖЖЖЖЖ DNA Computing: A Primer
 
 
The article is a detailed explanation of how Leonard M. Adleman used 
DNA to solve the traveling salesman problem, a popular restatement of the 
directed Hamiltonian path problem. The problem posits a salesman who 
must plan a trip starting in one city, ending in another and visiting once 
-- and only once -- n cities in between. It is a classic example of a 
computationally intractable problem, as its complexity grows 
exponentially with the number of cities. Adleman's strategy was to use biochemical 
methods on DNA to massively parallelize the computation.
 !
Adleman encoded the cities of the problem as unique strands of DNA 20 
base pairs long. He then encoded the paths between cities as the complement 
of the last half of the strand representing the first city and the first 
half of the strand representing the second. So, for instance, if New York 
was encoded as a 6 base pair long strand 'ATGCCG' and Los Angeles was 
encoded as 'GCTACG', the (directed) path between them would be the complement 
of 'CCG' and 'GCT' taken together, or 'GGCCGA'. When these strands of DNA 
hybridize the strand representing the path will glue together the 
strand representing the cities -- DNA hybridizes with its complement. This 
means that if you put the strands representing all of the cities and the 
strands representing!
 all of the paths into a test tube and allow them to 
hybridize,the path strands will connect city strands and you will end up with 
many longer strands of DNA representing potential solutions to the problem. 
this is equivalent to performing an exhaustive search for every 
possible answer to the problem. But whereas on a traditional serial processor 
such a search would be computationally infeasible, DNA by its nature 
performs millions of these "searching operations" simultaneously.
 
Next, Adleman used PCR to selectively amplify only strands that begin 
and end with the correct city encoding. Then he used gel electrophoresis to 
select only strands that were exactly the right length. Finally, he put 
the strands through several stages of affinity purification to
eliminate any strands that did not contain every city. The solution can then be 
read using either a DNA sequencer or graduated PCR to determine the order in 
which city encodings occur in the solution.
 
Adleman used this technique to solve the traveling salesman problem for 
seven cities and it took him sevenЖ days to determine the answer. This 
is not competitive with traditional modern microcomputers. In addition, as 
the number of cities grows the technique begins to require impractical 
quantities of DNA. However the experiment was quite effective in 
demonstrating that, for certain types of problems, DNA can be 
effectively used as a computing medium with the potential for massively parallel 
computation.
 



Link: http://pubs.acs.org/hotartcl/mdd/00/may/razvi.html
 
Reviewed by: Lu Tang 
 
ЖЖЖЖЖЖЖ High-throughput Genomics
 
This article discusses how and why single nucleotide
polymorphisms(SNP) genotyping affects the
pharmaceutical industry. Genomics is fundamental to
the success of the biotechnology industry. SNPs can be
used to enhance drug discovery and development.
Seizing a prominent role in the biopharmaceutical
community, SNPs are binary elements of genetic
variability in the human genome and function as
signatures for different biological traits.
 
SNPs associated with a single disease offer clues
about the underlying pathology of the disease state,
and they can also differentiate separate populations
within what was once considered a single disease. A
major focus of the SNP effort is on using small
variations in gene sequences as makers for defining
populations exhibiting a given phenotype.
Pharmacogenomics is the application of this genetic
knowledge by targeting therapies on the basis of
genomic compositionthe expression of a given
haplotype. The major drivers for the SNP effort in
health care are (1)defining genetic regions and
targets for therapeutics; (2)stratifying patient
populations according to expression of SNP markers
(and corresponding biological
phenotype);(3)positioning drugs into the appropriate
subsectors of patien!
t populations.
 
In the near term, SNPs could potentially help optimize
clinical trials through patient stratification. In
addition to the near-term opportunity for SNP
genotyping, it can be deployed in other market
segments, including pharmacogenomics (which stratifies
patients according to their responder/nonresponder
status to a given drug), molecular diagnostics, and
predictive medicine. We estimate that these segments
represent the long-term upside in the SNP genotyping
marketplace.
 
Instrumentation for SNP discovery, characterization,
and genotyping will be deployed throughout the
pharmaceutical community. Hardware must range from
low-thoughput, sporadic use, to high-throughput,
production-scale instrumentation. Informatics tools
and algorithms enable data manipulation and mining.
Given the amount of data to be manipulated, robust
information technology tools are needed. Wet chemistry
must keep pace with the information deluge that is
likely to result as the private and public genome
projects develop more content. Genotyping is the key
process by which SNPs are harvested into commercially
useful information in the form of biological
associations.
 
DNA arrays are glass slides or membrane filters
containing many immobilized !
DNA samples. DNA
microarrays are best known as tools for monitoring
gene expression. The advantage of microarray
technology is that production is relatively well
defined and automated, which has made it appealing to
those working in the biopharmaceutical community.
 
Mass spectrometry is an accurate and potentially
high-throughput approach to genotyping. It relies on
minute differences in molecular mass to identify DNA
fragments. It maybe possible to bring down individual
genotype costs in the future, and the approach is
flexible and may be automatable for production-scale
genotyping. But it is a complicated system.
 !
High-efficiency fluorescence polarization(HEFP) is a
homogeneous mix-and-read assay process without any
washing or separation steps. HEFP is based on
discriminating the rapid molecular rotation of small
molecules from the slower rotation of larger species.
 
High-throughput screening of SNPs is an important new
field. SNP genotyping technologies are maturing, and
companies are commercializing them in the form of
products. These successful technologies offer proven
and open solutions, deliver robust results, are cost
effective and easy to implement, and yield high value.
 



 
Link: http://www.geml.org/
 
Reviewed by: Christoforos ChristoforouЖЖЖЖЖЖЖЖЖЖЖЖЖ 
 
Introduction to Gene Expression Markup Language.
 
This paper introduces Gene Expression Markup Language
(GEML).
 
GEML is an Extensible Mark Language (XML)-based set of
tags and aims to provide a standard method of
exchanging gene expression data along with associated
gene and experiment annotations. Files with GEML
format can store data about patterns, profiles, and
hybridization information for gene expression
analysis, providing a standard method for collecting
and transferring DNA microarray and gene expression
data.
 
GEML provides standardization for storing and
transferring between different systems and databases.
It also keeps track of the data collection methodology
that was used, enabling normalization, integration and
comparison of data across methodologies. Furthermore,
it is independent of any particular database schema.
 
Given the large amount of data derived from gene
expression studies, the need for this data to be
stored, transferred, and anal!
yzed, has increased.
However, up until now there has been no standard
method of storing and exchanging this data. As further
research is conducted in the area of gene expression,
it becomes more and more important for the fields of
pharmaceuticals and the biotechnology field, and also,
for academic researchers to be able to share data
cooperatively. The need for a standard method of
exchanging the data and the associated annotation has
become paramount. GEML can contribute to the needs and
demands of the field of gene research.
 



 
Link: http://dodo.cpmc.columbia.edu/predictprotein/
 
Reviewed by: Mohammed Kuddus
 
 
ЖЖЖЖЖЖЖ Predicting secondary structure from protein sequences
 
The web page presents predicting secondary structure from protein 
sequences by PHD(Profile network from HeiDelberg) method. Protein structure plays 
an important role for understanding and use of sequence data. A knowledge 
of the protein structure behind the sequences often makes clear what 
mutational constraints are imposed on each position in the sequence and can 
therefore aid in the multiple alignment of sequences and the interpretation of
sequence patterns. Protein structure is intrinsically hierarchic in its
internal organization. The highest level in this hierarchy is 
constituted by complete proteins or assemblies of su!
ch proteins, which become 
subdivided through domains via super-secondary structure to secondary structure at 
the lowest hierarchical level. At the level of protein secondary structure, 
the elements are not only crucially dependent on their amino acid 
compositions, but unlike domain and higher-order structures, are also very much 
context dependent; i.e. they rely critically on the substructures in their
environment. It is because of this context dependency, that predicting
protein secondary structure is a difficult task, which after three 
decades of research has not attained the accuracy on which tertiary structure 
can be based. However, that some successful prediction of higher-order 
structure, based on a knowledge of the secondary structure, have been achieved.
 
Secondary structure prediction has generally been formulated for three
states, helix, strand and coil. This holds also for recent versions of 
the early and popular GOR method, which considers the influence and 
statistics of flanking residues on the conformational state of a selected amino 
acid to be predicted. In 1987, Zvelebil et al. for the first time exploited 
multiple alignments to predict secondary structure automatically by extending 
the GOR method. As s result, the current state-of-the-art methods all use input
information from multiple sequence alignments. Neural network are 
organized as interconnected layers of input and output units, and can also 
contain intermediate (or 'hidden') unit layer!
s. Each unit in a layer receives
information from one or more other connected units and determines its 
output signal based on the weight of the input signals. The PHD method 
(Profile network from HeiDelberg) combines the added information from multiple
sequence information with the optimization strength of the neural 
network formalism. The method makes use of three consecutive complete neural
networks: 
 
(a) The first network produces the first raw 3-state 
prediction for each alignment position. The output of the first network for each
alignment position is three probabilities for three the states (helix,
strand, and coil). 
 
(b) A second netwo!
rk refines the raw predictions of 
the first level by filtering the 3-state probabilities for each alignment
position based on the probabilities of the flanking positions. The 
output of the second network comprises for each alignment position the three 
adjusted state probabilities. 
 
(c) The first two networks perform the basic prediction
of the secondary structure associated with a query multiple alignment.
However, as the networks can be trained in various ways, PHD employs a
number of separately trained consecutive network pairs ((a) and (b)) 
and feeds their predictions (3-state probabilities) into a third network 
for a so-called jury decision.
 
The predictions obtained by the jury undergo a final filtering to 
Delete predicting helices of one or two residues and changing those into coil. 
The method was trained on a non-redundant set of 130 alignments from the 
HSSP database, each containing one sequence with a known structure. If the 
PHD web server is given a single sequence for prediction, it performs a
BLAST-search to find a set of homologous sequences and aligns those 
using the MAXHOM alignment program. The resulting alignment is then fed into 
the actual PHD neural net algorithm.
 
The accuracy of computerized prediction methods can be enhanced further 
if such reasoning with higher order structure is formalized and 
incorporat!
ed in the prediction mechanisms. If some easy benefits comes from the 
steadily increasing structural protein data that can be used to better train and 
tune the statistical methods. The current availability of the prediction 
methods optimizes the chance for development of sensitive consensus methods.
 



Link: http://www.marmulla.com/compengl.htm
 
Reviewed by: Xiaodong (Sheldon) Zou
 
 
ЖЖЖЖЖЖЖЖЖЖЖЖЖcomputer-assisted surgery 
ЖЖ
ЖЖDue to the expanding application of computer
technology in medicine new methods are evolving for
medical diagnosis, education and training, as well
as of surgical treatment planning, assistance and
assessment. The planning of complex surgical
procedures necessitates highly reliable computerized
models of the human anatomy. Repositioning osteotomy
is!
 a frequently used method correcting malpositions
in orthopedic surgery and traumatology. Computer
tomography, stereolithography models and tele-X-rays
are used in planning. However, the precision
achieved in the planning phase is usually not
translated to patients.
Ж The segment navigator SSN is a navigation system
which allows for the computer-assisted correction of
malpositions. It consists of an infrared-positioning
device, two dynamic reference frames DRF, an
infrared-pointer and an infrared-camera. All data
are displayed numerically and graphically on the
monitor of the SSN workstation. 
ЖЖA Laboratory Unit for Computer Assist!
ed Surgery
LUCAS is used for planning surgery in the
laboratory. LUCAS requires only a scout view CT. A
preparatory operation to implant bone markers visible
in X-rays and a further planning CT scan showing the
bone markers - which were necessary in previous
systems - are not required for the LUCAS- and
SSN-system. This reduces significantly the radiation
exposure of the patient and the costs of surgical
planning. Even the measurements of anatomical
landmarks in the surgical site which are time
consuming and reduce the accuracy are not required for
the SSN-system since the position of the
infrared-transmitters is already known during surgical
planning on the LUCAS-workstation. This makes !
the
surgical approach faster and much more precisely. The
surgical planning data are transferred to the surgical
site using a data file and an individual surface
pattern which fits to the surface of the navigated
bone segment:
 
Ж The data file is exported from the LUCAS-workstation
to the SSN-workstation. The planned
spatial displacement of the infrared-transmitters is
saved in this file.
Ж The individual surface pattern carries the
infrared-transmitters. This pattern is the
mechanical interface between infrared-transmitters and
navigated bone segment.
Ж The individual surface pattern can be polymerized
directly on a small stereolithographic model of the
navigated bone segment. The surface pattern can as
well be generated as negative form from a CT data
set using a CAD-CAM-system. To summarize, LUCAS and
SSN allow for the computer-assisted correction of
malpositions, positioning of artificial joints and
implants. In principle, the systems can be used in all
fields of surgery.
Ж The SSN is based on an infrared positioning
device such as the Surgical Tool Navigator (STN) and
the Surgical Microscope Navigator (SMN) manufactured
by
Carl Zeiss.
Ж The infrared positioning device is connected to
a Microsoft Windows NT 4.0 Workstation on a Hewlett
Packard NetServer LD Pro.
Ж The software of the Surgical Segment Navigator
(SSN)and the Laboratory Unit for Computer Assisted
Surgery (LUCAS) is written by R|diger Marmulla and
compiled with Microsoft Visual Studio 6.
Ж The method of computer assisted bone segment
navigation is described with interactive software,
multimedia files, movies and source code on a CD.
 



Link: http://www-2.cs.cmu.edu/People/tissue/layering.html
 
Reviewed by: Changyou Yu
ЖЖЖЖЖЖЖ 
ЖЖЖЖЖЖЖ Tissue Engineered Bone
 
This web page discusses a new Solid Freeform Fabrication assembly 
method that is crucial to create an advanced CAD/CAM bioreactor system capable 
of growing large-scale,customized bone substitutes.This method is 
developed by an interdisciplinary team from The Robotics Institute and The Institute 
for Complex Engineered System of Carnegie Mellon University and the 
University of Pittsburgh Medical Center.
 
To synthesize bone tissue, a CAD model of the desired bone substitute 
would first be derived from CAT or MRI data of the patient. The synthetic 
bone would then be fabricated, in-vitro, in an advanced CAM bioreactor!
 by
depositing layers of biodegradable scaffolding material while 
simultaneously embedding donor cells and growth factors within the layers. Synthetic
vasculature would also be embedded within the scaffold as it is being 
built up. Biological and mechanical stimulus, would be provided to control 
the growth of the tissue until it was mature enough to be removed from the
bioreactor and implanted into the patient.
 
 
The traditional scaffold-guided tissue regeneration method is often 
limited in practical thickness partly due to the difficulty in getting cells 
deep into interior regions of scaffolds. In the new method developed by this
group, thin(!
approx.1 mm thick)and prefabricated cross sections can 
first be seeded with cells and/or growth factors, then these sections are 
stacked up to form 3-D structures by mating them together with biodegradable or
non-biodegradable fasteners. Then normal tissue growth across the 
layers, in vivo, fuses the assembly together as the scaffold degrades.
 
 
In one of the experiments conducted by the group,two 3D constructs were
created, one with 5 seeded layers, the other with 5 unseeded layers. 
They were both implanted into the rectus abdominis muscle of the male New 
Zealand White rabbits. Then the specimens remained implanted for eight weeks. 
The result revealed that ther!
e was a statistically significant greater 
amount of bone formation in the implants seeded with cells than those unseeded
implants.
 
This assembly approach also provides a way to integrate different 
materials with different microstructures, it allows prefabricated vascular 
constructs to be embedded and assembled into the scaffold as it is being built up 
as one source for capillary sprouting. As a result,more complex structures 
such as complete bone, tendon, muscle constructs could be obtained by this
method.
 



 
Link: http://www.robotics.technion.ac.il/
 
Reviewed by: Lu Tang 
 
Registration of 3-D Objects for Computer Integrated Surgery
 
This article describes an efficient registration
method for robotic-assisted surgery. Registration is a
critical stage in robotic-assisted surgery. A
geometric relationship such as position and
orientation of the patient!/s bone relative to the
robot!/s tools is established intra-operatively. In
this article, the registration process uses a surface
matching technique, and thus does not requi!
re any
marker implant.
 
The three ideas simplify this registration process.
First, the robot itself is used as a digitizer
eliminating the need for an extra localizer. Second,
bone modeling is based on the multi-resolution
technique for adaptive registration. Third, an
algorithm to determine the minimal number and location
of sampled points needed for registration was
developed, thus easing the intra-operatively sampling
process. The proposed method was applied to Total Knee
Arthroplasty (TKA) procedure, and special care was
taken in adapting the method to the surgical
application in hand.
 
Using robotic assistance during the execution phase
represents a way to improve the absolute accuracy in
positioning and guiding surgical tools. Robotic
execution of the planned bone resections can ensure
further improvement of the procedure because of the
higher intrinsic geometric accuracy of a robot as
compared to that of a human operator. Based on prior
experiments in orthopedic surgery, it is expected that
a robotic assistant will overcome implant misalignment
which is the major cause for aseptic loosening and
failure in TKA.
 
In the last part, it describes the method of this
registration process. The registration can be
performed directly between the bone and the robot,
which in turn guides the surgical tools. Then they use
the hierarchical multi-resolution approach and a level
of detail data model to speed up the computation. To
ensure the required accuracy of 1 deg ratation and 1mm
translation, they explore the subject of optimal
number of sampling points and their location. The
search for the best sampling points is viewed from the
grasping theory point of view. The contacts between
the fingertips and the grasped object are modeled as
frictionless point contacts. In order to determine the
optimal set of sampling points for each set of points,
they look for the bone motion which is minimally
detected by the sensor. A!
mong these motions, they
choose the set of contact points that are maximally
dislocated by the minimal motion. This configuration
of the grasp gives the best stiffness properties;
hence, the points of contact are the best candidates
for sampling during registration.
 



Link: http://robotics.eecs.berkeley.edu/~mdownes//surgery/surgsim.html
 
Reviewed by: Ying Liu
 
Virtual Environments for Surgical Training and Augmentation(VESTA) 
 
As computer graphics and processor technologies
advance quickly, researchers are trying to increase
high-fidelity computer simulations of surgical
procedures. They developed laparoscopy's surgical
technique that has greatly reduced the time necessary
for the patient to heal after surgery. A laparoscopic
simulation device is an essential component of
surgical simulation that is to model the deforma!
tion
of soft tissue accurately and in real time. You can
move each tool further into or out of its virtual
hole, or twist each tool around its longitudinal axis.
Laproscopic camera training simulation is in minimally
invasive surgery of the abdomen, surgeons watch a
video image from a rigid lens endoscope inserted
through an incision in the skin. Such an endoscope
uses a camera whose lens is aligned with the body of
the scope, and surgeons are fairly well experienced
with using the device. Laparoscopic cholecytectomy
simulation is a laparoscopic surgical procedure to
remove a patient's gallbladder. It provides a virtual
environment for training surgeons for this new
surgical technique. Th!
ey have created realistic
textures for the anatomy in their environment by
capturing images from videos of actual surgical
procedures. The physics model in their system is
modeled as spring-damper matrices in which nodes in
the matrix are masses. 
 
The researchers achieve the proper behavior for
cutting and stapling ducts by altering the mesh for a
duct when it is cut or stapled. They have completed to
design a system suitable for training surgeons to use
the angled lens endoscope. Thus, a physical
environment can beset up to train the surgeons and a
similar environment can be mimicked using their
virtual environment system. They use the physics-b!
ased
models to help of local integration, which is shown to
be a successful way to significantly reduce the time
complexity. But the researchers think that it exists
some problems. The laparoscopic immersion device that
they have used as their interface does not yet support
force-feedback. Without force-feedback it is very
difficult to keep the position of the virtual
instrument calibrated with that of the real device
when the device can move through its entire range of
motion unimpeded. They hope to eventually get a
laparoscopic device that includes force-feedback and
integrate it with our system or experiment with using
Phantoms as input devices. 
 



 
 
 
 
 
 
 
 
 
 
 
 
 

 

--0-1685313462-1009663721=:29492-- 4▐.`Р╣║┴ 3dЦ╧ $GjН▓╗╚Ў'KmЩ╖╫¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤.`Р╣║┴ 3dЦ╧ $GjН▓╗╚Ў'KmЩ╖╫7OiОз╔ " ; N V [ t Э ┤ ┴ ┘ ў * W } Л г ╖ ╒ ш  $ Q k y Х о ╙ у     * B ` s П ╕ ╟ ▄    1 G T f j s М ╗ ъ (FiНХЦхьэO┤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤d7OiОз╔ " ; N V [ t Э ┤ ┴ ┘ ў * W } Л г ╖ ╒ ш  $ ¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤$ Q k y Х о ╙ у     * B ` s П ╕ ╟ ▄    1 G T f j s М ╗ ъ ¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤ъ (FiНХЦхьэO┤`гъ4~┘┌█  34;<¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤┤`гъ4~┘┌█  34;<СrIХЮЯ┼╞a┴в Г$d(Ы*ч*Ё*ё*++3+Х,v0W488Q9Э9ї;A<J<K<q<r<═<7>B∙E┌I╗MИN╘N▌N▐NOO OnPOT0X\Є_╙cОg┌gуgфg h hfhGl(pZsжsпs░s╓s╫s2t╜uЮy}`БAЕ"ЙН╝ОППП8П9ПАПaУBЧ#Ы¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤d<СrIХЮЯ┼╞a┴в Г$d(Ы*ч*Ё*ё*++3+Х,v0W488Q9Э9ї;A<J<¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤J<K<q<r<═<7>B∙E┌I╗MИN╘N▌N▐NOO OnPOT0X\Є_╙cОg┌gуgфg h hfh¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤fhGl(pZsжsпs░s╓s╫s2t╜uЮy}`БAЕ"ЙН╝ОППП8П9ПАПaУBЧ#ЫЯхв椤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤#ЫЯхвжeжnжoжХжЦж▒ж─зиєл╘п╡│ь╢8╖A╖B╖h╖i╖╕х╗╞┐з├И╟F╔Т╔Ы╔Ь╔┬╔├╔▐╔&╩╬ш╤╔╒к┘╕┘┌ ┌┌4┌5┌Г▌Д▌Ї▌ї▌№▌¤▌▐▐▐▐2▐3▐4▐¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤8жeжnжoжХжЦж▒ж─зиєл╘п╡│ь╢8╖A╖B╖h╖i╖╕х╗╞┐з├И╟F╔Т╔Ы╔Ь╔┬╔├╔▐╔¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤▐╔&╩╬ш╤╔╒к┘╕┘┌ ┌┌4┌5┌Г▌Д▌Ї▌ї▌№▌¤▌▐▐▐▐2▐3▐4▐¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤¤√ РА░╨/ ░р=!░'"░'#Ра$Ра%░ [4@ё 4NormalCJOJPJQJmH <A@Є б<Default Paragraph Font4Z`Є4 Plain Text CJOJQJ4┌╘                                                          ¤D)J8╛F0Tуc=qзАёОlЮ╘лБ║Ц╚M╫4┌ е2¤сА Ъ p y с Eq64▐▌$ ъ <J<fhж▐╔4▐▐рстфхцшщ┤#Ы4▐▀уч,.^`О┬╞╠┘▀ь 1489GHZeijyzМЬд╒▌*68CMY[fp|~ЙХбго╛├■  %*2389?AINXp|}ВГЙЛЧЬж║┼┌у:ARYlxСШк╢╠т%9=@DItБНПЬЯв┌ї+IWacnp|й╡╕╙ %CQWYjmwУЫло╖╣╥╒сщ¤C^yИР░{ ~  В З К О Э Ю й ╛ ╔ ╩ ╒ э №         # & * 7 8 C I P Q \ l y |  Г И о ╡ ╣ ┬ ├ ╧ ╨ ┌   = H ў · ¤  # F Z x М ╝ ╨   M a Ч л ├ ╞ ╔ ╠ р ю %1JU╧ручыЁєЎ∙№!'(+.1K\_cglorux#(+.14зкн░  knsv╒╪█▐FILOило▒!$(,147:=Ia╖├),049<?BE"'*-03ВУЦЪЮгжймпя∙$58<@EHKNQНЧзкн░+56>?KКФ■"%(+ASqyИЛОС╝╚эЁєЎTWZ]вйy|В╪█▐с58;>∙№ @HY\_b╣╝┐┬   " & + . 1 4 7 ц щ ь я №! !""""┌6┌┴┬╞ 48eiЧЫ╨╘ "$%GHjkНУ╗╛╔╬Ў∙*+NOpqЬЭ║╗┌█ :;RSlmСТкл╠═&:BDOTVZuЯп╡╗┬╧┌ш° +BXaЕМЩв╔╤═╤Е╥3┌6┌   peter cline(Macintosh HD:Desktop Folder:rlinks5.html @А3┌3┌рО3┌3┌ @№4┌@@GРTimes New Roman5РАSymbol3Р Arial3РTimes?Р Courier New"1М╨h aF aFРь│\$е└┤┤А0Ї▄к  -<html xmlns:v="urn:schemas-microsoft-com:vml" peter cline peter cline■  рЕЯЄ∙OhлС+'│┘0ДИР╚╘шЇ $ @ L Xdlt|'. _PID_GUID'AN{AB5D1101-FEB0-11D5-920A-000502E3D2D7}  !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~АБВГДЕЖЗИЙКЛМНОПРСТУФХЦЧШЩЪЫЬЭЮЯабвгдежзийклмноп░▒▓│┤╡╢╖╕╣║╗╝╜╛┐└┴┬├─┼╞╟╚╔╩╦╠═╬╧╨╤╥╙╘╒╓╫╪┘┌█▄▌▐▀рстуфхцчшщъ■   ьэюяЁёЄєЇї■   ў°∙·√№¤■    ■   ¤   ¤   ¤    ■   ■   ■                                                                                                                                                                                                                                                                                                                                                                                                                                                                               Root Entry         └F& ─╜Т┴ А1Table            ы5WordDocument        "╘SummaryInformation(    ЎDocumentSummaryInformation8            ■CompObj    XObjectPool            & ─╜Т┴& ─╜Т┴            ■                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                           ■      └FMicrosoft Word Document■   NB6WWord.Document.8