Malignant bone pain: pathophysiology and treatment

2-acetyl aminofluorene (AAF) reacts in acidic conditions with nitrous fume yielding N-nitroso-AAF (N-NO-AAF), as previously described, that exerts more toxic and mutagenic effects than its parental compound. In this study, the effect of sodium nitrite (NaNO2) on the tumorigenicity of AAF in rats fed with AAF and NaNO2 was observed. Wistar rats were divided into five groups: group I served as control; group II were treated with NaNO2 (0.3%); group III was given 0.02% AAF alone; groups IV and V received both AAF and NaNO2 (0.2 and 0.3% respectively) in their diet for 12 weeks. At the end of the experiment, all rats in groups III, IV and V developed early stage phenomena of hepatocellular carcinoma, including hepatomegaly with variable-sized foci and neoplastic nodules. Severe damage was observed in the rats treated with AAF and NaNO2. Feeding of AAF (0.02%) for 3 months elevated the levels of c-Fos, c-Jun and c-Myc proteins in the rat livers. The AAF-induced c-Jun, c-Fos and c-Myc expressions were significantly magnified (P < 0.001) by NaNO2. These data confirmed that the strengthening of AAF-induced hepatocarcinogenesis by NaNO2 should be associated with its enhancing effect on the AAF-induced increases in the expressions of c-Jun, c-Fos and c-Myc.     

Error in the UNITY substitution rule for subscripted operators

UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent.     

Prolog/Rex-a way to extend Prolog for better knowledgerepresentation

Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitrary user-defined relations among entities, annotated values (demons), incomplete knowledge, etc. A flexible rule language helps the knowledge engineer capture human expertise and provide flexible control of the reasoning process. Additional Prolog/Rex strength that cannot be found in any other hybrid language made on top of Prolog is language level support for keeping many potentially contradictory solutions to a problem, allowing possible solutions and their implications to be automatically generated and completely explored before they are committed. The same mechanism is used to model time-states, which are useful in planning and scheduling applications of Prolog/Rex     

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     

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