Thinking and Turing's test

The questions raised by A. M. Turing in his paper on thought and machines are discussed. Human thought is considered in turn as a concept of normal language usage, as a basic concept of psychology, and as the basis of intellectual activity. It is concluded that neither of these notions of thought identifies something specific that a human being can or cannot do. The imitation game proposed by Turing for deciding whether a machine can think is found to result from an arbitrary empoverishment of the channel of communication between the interrogator and the item under investigation. Turing's notions of thinking are shown to lead to logical difficulties. An alternative view of consciousness, that would place it beyond the reach of any finite test, is finally discussed.     

On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.     

A Survey on Explicit Representation Formulae for Fundamental Solutions of Linear Partial Differential Operators

In the present article, we aim at treating the existence of fundamental solutions of linear partial differential operators with constant coefficients from the viewpoint of setting up explicit formulae yielding fundamental solutions.     

同步荧光法测定食品中维生素B1

本文研究了食品中维生素Ｂ１的同步荧光法测定条件，采用氯化钾－乙醇作柱层析洗脱液，碱性介质中氧化后立即调为中性，并加入表面活性剂ＯＰ对体系增稳增敏，取代丁醇萃取，经济方便，用于几种粮食样品的测定，结果满意。     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

Resolution of Secondary α-Ketoalcohols Catalyzed by Lipase and Inversion of Stereochemistry

Several α-ketoalcohols of synthetic value were resolved using lipase as a catalyst. Lipoprotein lipase (LPL) provided the best rate of hydrolysis and kinetic differentiation. One of these optically pure α-ketoalcohol was converted to (5)-ibuprofen in good optical purity. The stereospecific inversion of (R)-alcohol to (S)-alcohol is described.     

弱1—凸对策及其解的性质

本文提出了一类特殊的ｎ人合作对策模型─—弱１—凸对策，研究了弱１—凸对策的解的性质，并证明弱１—凸对策的解满足所有常见的公理化特征．     

Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

A branching process model for sand avalanches

An analytically solvable model for sand avalanches of noninteracting grains of sand, based on the Chapman-Kolmogorov equations, is presented. For a single avalanche, distributions of lifetimes, sizes of overflows and avalanches, and correlation functions are calculated. Some of these are exponentials, some are power laws. Spatially homogeneous distributions of avalanches are also studied. Computer simulations of avalanches of interacting grains of sand are compared to the solutions to the Chapman-Kolmogorov equations. We find that within the range of parameters explored in the simulation, the approximation of noninteracting grains of sand is a good one.