The human obesity gene map: the 1997 update

An update of the human obesity gene map incorporating published results up to October 1997 is presented. Evidence from Mendelian disorders exhibiting obesity as a clinical feature; single-gene mutation rodent models; quantitative trait loci uncovered in human genome-wide scans and in crossbreeding experiments with mouse, rat, and pig models; association and case-control studies with candidate genes; and linkage studies with genes and other markers is reviewed. All chromosomal locations of the animal loci are converted into human genome locations based on syntenic relationships between the genomes. A complete listing of all of these loci reveals that all but chromosome Y of the 24 human chromosomes are represented. Some chromosomes show at least three putative loci related to obesity on both arms (1, 2, 6, 8, 11, and 20) and several on one chromosome arm only (3p, 4q, 5q, 7q, 12q, 13q, 15q, 15p, 22q, and Xq). Studies reporting negative association and linkage results are also listed, with the exception of the unlinked markers from genome-wide scans.     

Object boundary location by region and contour deformation

Many applications in image analysis need to distinguish an object from its surroundings. The `snake' method (Kass, 1987) is a well known method to solve such problems by locating the object boundary from an initial plan, but it has the limitation that the distance between the initial plan and the object boundary should be `very small'. The authors present a two-step method, which combines region and contour deformation, to locate the boundary of an object from a designated initial boundary plan. First, they propose a new deformable region model to represent an object, and use the model to locate the boundary of the object by region deformation. This step fills the gap between a fairly rough initial plan and the `snake' method. The resulting boundary is then used as the initial plan of a `snake' method to further refine the boundary. The results of the method are shown in simulated images and MRI images of brain tumour patients     

Image compression in digital mammography: effects on computerized detection of subtle microcalcifications

Our previous receiver operating characteristic (ROC) study indicated that the detection accuracy of microcalcifications by radiologists is significantly reduced if mammograms are digitized at 0.1 mm x 0.1 mm. Our recent study also showed that detection accuracy by computer decreases as the pixel size increases from 0.035 mm x 0.035 mm. It is evident that very large matrix sizes have to be used for digitizing mammograms in order to preserve the information in the image. Efficient compression techniques will be needed to facilitate communication and archiving of digital mammograms. In this study, we evaluated two compression techniques: full frame discrete cosine transform (DCT) with entropy coding and Laplacian pyramid hierarchical coding (LPHC). The dependence of their efficiency on the compression parameters was investigated. The techniques were compared in terms of the trade-off between the bit rate and the detection accuracy of subtle microcalcifications by an automated detection algorithm. The mean-square errors in the reconstructed images were determined and the visual quality of the error images was examined. It was found that with the LPHC method, the highest compression ratio achieved without a significant degradation in the detectability was 3.6:1. The full frame DCT method with entropy coding provided a higher compression efficiency of 9.6:1 at comparable detection accuracy. The mean-square errors did not correlate with the detection accuracy of the microcalcifications. This study demonstrated the importance of determining the quality of the decompressed images by the specific requirements of the task for which the decompressed images are to be used. Further investigation is needed for selection of optimal compression technique for digital mammograms.     

Endothelin-1 concentrations and optimisation of arterial oxygenation and venous admixture by selective pulmonary artery infusion of prostaglandin E1 during thoracotomy

PURPOSE: To demonstrate a superselective intraarterial chemotherapy as a therapeutic alternative in the treatment of previously treated recurrent lymph node metastases in breast cancer. METHODS: 14 patients with recurrent lymph node metastases in cases of breast cancer were presented to be treated by intraarterial chemotherapy of 25 mg mitoxantrone/m2 over a period of 24 hours. In two patients with superclavicular lymph node involvement an intraarterial therapy could not be carried out because of a vascular connection to the anterior spinal artery. Involved lymph stations could be reached in superselective technique by side branches of the subclavian artery. Heparin coverage was given intravenously. Every patient had had surgery, radiation, systemic chemo- and hormonal therapy before and was now graded as inoperable. Therapy indication was given by local tumour-induced symptoms. RESULTS: In the 12 treated cases complete remission was seen in three, partial remission in 4, a steady state in two and a progressive disease in three. There were no complications or severe side effects. CONCLUSION: Intraarterial chemotherapy is an effective and well tolerated treatment in recurrent lymph node metastases in cases of breast cancer even if conventional therapies can no longer be used.     

Hash function based on block cipher

A new 2m-bit iterated hash function based on an m-bit block cipher with a 2m-bit key is presented. The results of security analysis show that the hash function can be expected to have ideal computational security against the five attacks when the underlying cipher is assumed to have no weakness     

Reliability Modeling and Analysis of Communication Networks with Dependent Failures

This paper presents a new model to study the reliability of communication networks in which link failures are statistically dependent. The approach tries to identify and model explicitly the events that cause communication link failures. No conditional probabilities are needed, and so two major difficulties inherent to them, namely, an exponential number of conditional probabilities to deal with and a consistency requirement to satisfy, are avoided. For reliability computations, some existing algorithms for finding network reliability can be used with minor modifications and no significant increase in computational complexity.     

Protocol design for scalable and reliable group rekeying

We present the design and specification of a protocol for scalable and reliable group rekeying together with performance evaluation results. The protocol is based upon the use of key trees for secure groups and periodic batch rekeying. At the beginning of each rekey interval, the key server sends a rekey message to all users consisting of encrypted new keys (encryptions, in short) carried in a sequence of packets. We present a scheme for identifying keys, encryptions, and users, and a key assignment algorithm that ensures that the encryptions needed by a user are in the same packet. Our protocol provides reliable delivery of new keys to all users eventually. It also attempts to deliver new keys to all users with a high probability by the end of the rekey interval. For each rekey message, the protocol runs in two steps: a multicast step followed by a unicast step. Proactive forward error correction (FEC) multicast is used to reduce delivery latency. Our experiments show that a small FEC block size can be used to reduce encoding time at the server without increasing server bandwidth overhead. Early transition to unicast, after at most two multicast rounds, further reduces the worst-case delivery latency as well as user bandwidth requirement. The key server adaptively adjusts the proactivity factor based upon past feedback information; our experiments show that the number of NACKs after a multicast round can be effectively controlled around a target number. Throughout the protocol design, we strive to minimize processing and bandwidth requirements for both the key server and users.