Interactions of lactone, carboxylate and self-aggregated forms of camptothecin with human and bovine serum albumins

Highly degenerate primers to conserved regions of the eukaryotic phosphoinositol-specific phospholipase C (PLC) were used to amplify fragments of plant PLCs from Arabidopsis thaliana genomic DNA. Eight completely different fragment sequences that showed high homology to PLCs of both animals and plants were isolated. The variation between these putative PLCs was high and suggests that, like animals, plants have multiple isoforms of PLC. Using one of the PCR clones, we isolated a corresponding full-length Arabidopsis PLC gene (ATHATPLC1G), and sequence analysis indicated that it was most like a delta-type PLC. This gene is 2.5 kb and contains seven introns, all but one of which has intron/exon border sequences that conform to the Arabidopsis consensus. The structural complexity of the gene is relatively simple compared to mammalian beta-type PLCs that can be 15 kb long with up to 30 introns. The plant gene is a single copy and was mapped to four Arabidopsis YACs, one located on chromosome 2. The promoter region contained two TATA-like elements at -43 and -185 and other putative regulatory elements that suggest that this PLC is hormonally regulated. This is the first plant PLC gene and the first delta type-PLC gene from a higher organism to be sequenced.     

Predictors of underlying coronary artery disease in cocaine associated myocardial infarction: a meta-analysis of case reports

A preliminary report presenting the results of fibular strut grafting in the severely resorbed mandibular and maxillary region is presented. Thirteen patients were treated due to severe resorption of alveolar and basilar bone of 49 segments of the mandible and the maxilla. Two patients additionally had pathological fractures of the mandible. In 10 cases the strut graft was harvested by means of a new minimally invasive technique. After modelling the fibular bone it was fixed to the recipient site by miniscrews or implants. After a mean follow-up period of 20 months (max. 31, min. 11 months) a retrospective analysis of clinical and radiological findings was carried out. It showed that a mean augmentation of 16 mm was achieved. Compared to other studies the fibular strut graft was resorbed less, and due to the primary stability it could be used for the treatment of fractures of the mandible. No more than natural resorption was observed when the patients received their prostheses fixed to dental implants.     

Presupposition failure — A comedy of errors

Presuppositions of utterances are the pieces of information you convey with an utterance no matter whether your utterance is true or not. We first study presupposition in a very simple framework of updating propositional information, with examples of how presuppositions of complex propositional updates can be calculated. Next we move on to presuppositions and quantification, in the context of a dynamic version of predicate logic, suitably modified to allow for presupposition failure. In both the propositional and the quantificational case, presupposition failure can be viewed as error abortion of procedures. Thus, a dynamic assertion logic which describes the preconditions for error abortion is the suitable tool for analysing presupposition.     

Performance evaluation of rule grouping on a real-time expertsystem architecture

Uses a Markov process to model a real-time expert system architecture characterized by message passing and event-driven scheduling. The model is applied to the performance evaluation of rule grouping for real-time expert systems running on this architecture. An optimizing algorithm based on Kernighan-Lin heuristic graph partitioning for the real-time architecture is developed and a demonstration system based on the model and algorithm has been developed and tested on a portion of the advanced GPS receiver (AGR) and manned manoeuvring unit (MMU) knowledge bases     

Sort vs. hash revisited

Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine     

Processor membership in asynchronous distributed systems

Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols     

Parallel architecture for fast transforms with trigonometric kernel

We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rⁿ. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms     

Unicast-based multicast communication in wormhole-routed networks

Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log ₂ m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given