考虑在一种新的生物计算装置(即脉冲神经膜系统)上处理任意两个自然数的乘积问题.首先给出了具有单个输入神经元的脉冲神经膜系统,它可以求解n-addition问题(即n个自然数的求和);其次,构造了一族脉冲神经膜系统,使该族中的每个系统可以...考虑在一种新的生物计算装置(即脉冲神经膜系统)上处理任意两个自然数的乘积问题.首先给出了具有单个输入神经元的脉冲神经膜系统,它可以求解n-addition问题(即n个自然数的求和);其次,构造了一族脉冲神经膜系统,使该族中的每个系统可以求解给定二进制位长度的任意两个自然数的乘积.文中解决了Miguel A Gutirrez-Naranjo和Alberto Leporati提出的一个公开问题.展开更多
Let G be a 2-connected graph of order n(greater than or equal to 3). If I(u,upsilon) greater than or equal to S(u,upsilon) or max {d(u), d(upsilon)} greater than or equal to n/2 for any two vertices u, upsilon at dist...Let G be a 2-connected graph of order n(greater than or equal to 3). If I(u,upsilon) greater than or equal to S(u,upsilon) or max {d(u), d(upsilon)} greater than or equal to n/2 for any two vertices u, upsilon at distance two in an induced subgraph K-1,K-3,3 or P-3 of G, then G is hamiltonian. Here I(u,upsilon) = \N(u) boolean AND N(upsilon)\, S(u,nu) denotes the number of edges of maximum star containing u, upsilon as an induced subgraph in G.展开更多
文摘考虑在一种新的生物计算装置(即脉冲神经膜系统)上处理任意两个自然数的乘积问题.首先给出了具有单个输入神经元的脉冲神经膜系统,它可以求解n-addition问题(即n个自然数的求和);其次,构造了一族脉冲神经膜系统,使该族中的每个系统可以求解给定二进制位长度的任意两个自然数的乘积.文中解决了Miguel A Gutirrez-Naranjo和Alberto Leporati提出的一个公开问题.
文摘Let G be a 2-connected graph of order n(greater than or equal to 3). If I(u,upsilon) greater than or equal to S(u,upsilon) or max {d(u), d(upsilon)} greater than or equal to n/2 for any two vertices u, upsilon at distance two in an induced subgraph K-1,K-3,3 or P-3 of G, then G is hamiltonian. Here I(u,upsilon) = \N(u) boolean AND N(upsilon)\, S(u,nu) denotes the number of edges of maximum star containing u, upsilon as an induced subgraph in G.