Isolation, purification and ultrastructure of bacteriophages from natural mosquito breeding places in Egypt

Two bacteriophages were isolated from field collected samples representing two different mosquito breeding places. The phage AB-1 (isolated from Abheit village, Faiyoum Governorate "seepage water") and the phage GA-2 (isolated from El-Gabal El-Asfer Qualyobia Governorate "sewage drain water") were purified. Both bacteriophages were ultrastructurally described with respect to their morphology, dimensions, phases of bacterial attack and lysogeny. No major differences were observed between both isolated phages in relation to specificity, however; they were isolated from two different types of breeding places and two different geographic areas as well. This study may assume a wide host range of the isolated phages and reflect how bacterial insecticides used for mosquito larval control could be inhibited by such bacteriophage.     

Reduction of disulfide bonds in an amyloidogenic Bence Jones protein leads to formation of "amyloid-like" fibrils in vitro

Motivated by the finding that the amino acid sequence of the Bence Jones protein BJP-DIA was identical to that of the main protein component of the amyloid fibrils obtained from the same patient with AL-amyloidosis, (Klafki, H.-W., Kratzin, H.-D., Pick, A.-I., Eckart, K., Karas, M. & Hilschmann, N. (1992) Biochemistry 31, 3265-3272.), we attempted to create "amyloid-like" fibrils from the Bence Jones protein in vitro, without addition of proteolytic enzymes. Reduction of BJP-DIA, solubilized in PBS, pH 7.4, overnight at 37 degrees C resulted in the formation of a precipitate which had affinity for the dye Congo red. Electron microscopy of negatively stained samples of the reduced protein revealed aggregates of linear unbranched fibrils. SDS-polyacrylamide gel electrophoresis demonstrated that the precipitate consisted almost exclusively of intact light chain molecules. This result makes it possible to deduce a molecular model of these amyloid fibrils generated in vitro.     

Interruptibility as a constraint on hybrid systems

It is widely mooted that a plausible computational cognitive model should involve both symbolic and connectionist components. However, sound principles for combining these components within a hybrid system are currently lacking; the design of such systems is oftenad hoc. In an attempt to ameliorate this we provide a framework of types of hybrid systems and constraints therein, within which to explore the issues. In particular, we suggest the use of system independent constraints, whose source lies in general considerations about cognitive systems, rather than in particular technological or task-based considerations. We illustrate this through a detailed examination of an interruptibility constraint: handling interruptions is a fundamental facet of cognition in a dynamic world. Aspects of interruptions are delineated, as are their precise expression in symbolic and connectionist systems. We illustrate the interaction of the various constraints from interruptibility in the different types of hybrid systems. The picture that emerges of the relationship between the connectionist and the symbolic within a hybrid system provides for sufficient flexibility and complexity to suggest interesting general implications for cognition, thus vindicating the utility of the framework.     

Use of Graduate Study in Psychology as a data source.

Comments on an article by C. M. Stoup and L. T. Benjamin, Jr. (see record 1983-24200-001), in which they used various editions of Graduate Study in Psychology, published by the American Psychological Association (APA), to report the GPAs and Graduate Record Examination scores of master's and doctoral students across various areas of psychology. It is cautioned that the use of Graduate Study in Psychology as a data source calls for skepticism, as there is sufficient reason to question some of the data that are submitted to the APA by psychology departments. (3 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Bayesian recognition of local 3-d shape by approximating image intensity functions with quadric polynomials

The recognition in image data of viewed patches of spheres, cylinders, and planes in the 3-D world is discussed as a first step to complex object recognition or complex object location and orientation estimation. Accordingly, an image is partitioned into small square windows, each of which is a view of a piece of a sphere, or of a cylinder, or of a plane. Windows are processed in parallel for recognition of content. New concepts and techniques include approximations of the image within a window by 2-D quadric polynomials where each approximation is constrained by one of the hypotheses that the 3-D surface shape seen is either planar, cylindrical, or spherical; a recognizer based upon these approximations to determine whether the object patch viewed is a piece of a sphere, or a piece of a cylinder, or a piece of a plane; lowpass filtering of the image by the approximation. The shape recognition is computationally simple, and for large windows is approximately Bayesian minimum-probability-of-error recognition. These classifications are useful for many purposes. One such purpose is to enable a following processor to use an appropriate estimator to estimate shape, and orientation and location parameters for the 3-D surface seen within a window.     

Aromatic Hydrogenation Catalysis: A Review

High aromatic content in diesel fuel has been recognized both to lower the fuel quality and to contribute significantly to the formation of undesired emissions in exhaust gases [1, 2]. Because of the health hazards associated with these emissions, environmental regulations governing the composition of diesel fuels are being tightened in both Europe and the United States, leading to limitations on aromatics [3, 4].     

Complexity and computability of solutions to linear programming systems

Through key examples and constructs, exact and approximate, complexity, computability, and solution of linear programming systems are reexamined in the light of Khachian's new notion of (approximate) solution. Algorithms, basic theorems, and alternate representations are reviewed. It is shown that the Klee-Minty example hasnever been exponential for (exact) adjacent extreme point algorithms and that the Balinski-Gomory (exact) algorithm continues to be polynomial in cases where (approximate) ellipsoidal centered-cutoff algorithms (Levin, Shor, Khachian, Gacs-Lovasz) are exponential. By model approximation, both the Klee-Minty and the new J. Clausen examples are shown to be trivial (explicitly solvable) interval programming problems. A new notion of computable (approximate) solution is proposed together with ana priori regularization for linear programming systems. New polyhedral constraint contraction algorithms are proposed for approximate solution and the relevance of interval programming for good starts or exact solution is brought forth. It is concluded from all this that the imposed problem ignorance of past complexity research is deleterious to research progress on computability or efficiency of computation.This research was partly supported by Project NR047-071, ONR Contract N00014-80-C-0242, and Project NR047-021, ONR Contract N00014-75-C-0569, with the Center for Cybernetic Studies, The University of Texas at Austin.     

The effect of synchronization on the interpretation of flashing lamp displays

The question of whether all the lamps on a display indicating the same state should flash in phase with each other or independently is of interest to display designers. A randomized groups experiment was carried out to answer this question. It was found that a synchronized display was interpreted more quickly and with fewer errors than a display with independently flashing lamps.     

代理盲签名的不可跟踪性分析

张学军在《基于身份的代理盲签名方案的分析与改进》(《计算机工程》,2009年第23期)一文中分析指出,农强等的代理盲签名方案(《计算机应用》,2008年第8期)不具有不可跟踪性。对此,通过反证法证明张学军的方法有误,在此基础上提出一种新的分析方法,利用其证明胡江红的方案(《计算机工程与应用》,2007年第18期)不满足不可跟踪性,并对该方案进行改进,使其满足不可跟踪性且效率得到提高。