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     

Algebra of algorithms and Kaluzhnin's graphschemas

This research was supported under project No. 6.02.02/128-93 as part of the state scientific-technical program on future information technologies and systems by the Ukrainian State Committee, of Science and Technology.     

Components of random generation by normal subjects and patients with dysexecutive syndrome

The study presents a hypothesis on how randomness could be simulated by human subjects. Three sources of deviation from randomness are predicted: (1) the preferred application of overlearned production schemata for producing sequences of digits, (2) a wrong concept of randomness, and (3) the impossibility to monitor for redundancies of higher- than those of first-order. Deviations of random generation of digits produced by healthy subjects, patients with chronic frontal lobe damage, and patients with Parkinson's disease from random sequences produced by a computer program can be explained by the differential influence of these factors. Whereas incorrect concepts of randomness and limits on monitoring capacity distinguished all sequences produced by humans from actual random sequences, persistence on a single production strategy distinguished brain-damaged patients from controls. Random generation of digits appears to be a theoretically transparent and clinically useful test of executive function.     

Insertional re-activation of a chloramphenicol acetyltransferase misfolding mutant protein

The deletion of nine residues from the C-terminus of the bacterialchloramphenicol acetyltransferase (CAT) results in depositionof the mutant protein in cytoplasmic inclusion bodies and lossof chloramphenicol resistance in Escherichia coli. This foldingdefect is relieved by C-terminal fusion of the polypeptide withas few as two residues. Based on these observations, efficientpositive selection for the cloning of DNA fragments has beendemonstrated. The cloning vector encodes a C-terminally truncatedCAT protein. Restriction sites in front of the stop codon allowthe insertion of target DNA, resulting in the production ofproperly folded CAT fusion proteins and regained chloramphenicolresistance. The positive selection of recombinants is accomplishedby growth of transformants on chloramphenicol-containing agarplates. The method appears particularly convenient for the cloningof DNA fragments amplified by the PCR because minimal informationto restore CAT folding can be included in the primers. The cloningof random sequences shows that the folding defect can be relievedby fusion to a wide variety of peptides, providing great flexibilityto the positive selection system. This vector may also contributeto the determination of the role of the C-terminus in CAT folding.