Mechanism of the skeletal isomerisation of linear butenes over ferrierite: analysis of side reactions

An investigation of the effect of reaction conditions on product distribution in the skeletal isomerisation reaction of linear butenes has been carried out. The main reaction routes over ferrierite have been identified. Beside the main product isobutene, major by-product formation occurs. The unwanted reactions include dimerisation of butene to form octenes, hydrogen transfer yielding small amounts of saturated C₃ and C₄ hydrocarbons and disproportionation producing propene and pentenes. The most abundant by-products were pentene and propene, though these were not formed in equimolar amounts as could be expected. Oligomerisation experiments of propene over ferrierite produced large amounts of butene and pentene, revealing the presence of adsorbed nonene. The cracking of this surface species to hexene and propene is the most likely reaction route for the excess propene formation. This additional path to propene formation operates mainly at temperatures above 623 K.     

Novel NMDA antagonists: replacement of the pyridinium ring of 6,11-ethanobenzo[b]quinolizinium cations with heteroisoquinolinium cations

Replacement of the pyridinium ring of 6,11-ethanobenzo[b]quinolizinium cations with thiazolium (4a and 4b) and N-methylimidazolium (4c and 4d) resulted in equipotent compounds in the [3H]TCP binding assay. The corresponding N-methyl-1,2,4-triazolium analogs were less potent in this assay. The thiazolium derivative 4b, with a Ki = 2.9 nM, is being evaluated as a possible neuroprotective N-methyl-D-aspartic acid (NMDA) antagonist.     

Simplified method for the measurement of segmental colonic transit time

Segmental colonic transit has been measured in 101 patients. Two MBq of 111Indium absorbed on resin pellets and encapsulated in an enteric coated capsule was given at 7 00 am. Hourly images during the first day, and three images during each subsequent day were acquired for up to three days. Using all scan and patient data the scans were categorised in one of the five patterns of colonic transit: normal, rapid, right delay, left delay, or generalised delay. The geometric centres and per cent activity at each time point was compared between the five groups of colonic transit patients to find the best time for imaging and so to distinguish the five groups. During the first day, early images did not help in diagnosis of patterns of transit, however, in the later images (six hours onwards after the ingestion of the activity) the rapid transit groups could be identified. Images at 27 and 51 hours were both required to distinguish all five groups of patients from each other. Only in the 'normal' transit patients was there some excretion of the activity during the course of the second day, otherwise there was no difference in the images taken in the course of a day (second or third day). A simplified protocol requires a minimum of three images to distinguish all five patterns of colonic transit. The activity should be ingested in the morning (7 00 am) and the first image taken at the end of the working day (8-10 hours after ingestion), the second image on the morning of the second day, and the third image during the course of the third day. This simple protocol would provide all the clinically relevant information necessary for correct classification of the colonic transit.     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996     

Distributed memory systems for simulating artificial neural networks

In executing tasks involving intelligent information processing, the human brain performs better than the digital computer. The human brain derives its power from a large number [O(10¹¹)] of neurons which are interconnected by a dense interconnection network [O(10⁵) connections per neuron]. Artificial neural network (ANN) paradigms adopt the structure of the brain to try to emulate the intelligent information processing methods of the brain. ANN techniques are being employed to solve problems in areas such as pattern recognition, and robotic processing. Simulation of ANNs involves implementation of large number of neurons and a massive interconnection network. In this paper, we discuss various simulation models of ANNs and their implementation on distributed memory systems. Our investigations reveal that communication-efficient networks of distributed memory systems perform better than other topologies in implementing ANNs.