Interacting neural networks and the emergence of social structure

The article describes a computational model for the simulation of the emergence of social structure or social order, respectively. The model is theoretically based on the theory of social typifying by Berger and Luckmann. It consists of interacting artificial actors (agents), which are represented by two neural networks, an action net, and a perception net. By mutually adjusting of their actions, the agents are able to constitute a self‐organized social order in dependency of their personal characteristics and certain features of their environment. A fictitious example demonstrates the applicability of the model to problems of extra‐terrestrial robotics. © 2007 Wiley Periodicals, Inc. Complexity 12: 41–52, 2007     

一类网络最优路径的双向模拟扩散算法

基于模拟扩散算法的基本原理,文中提出了一种双向寻求网络最优路径的扩散算法,并介绍了该算法原理和具体计算过程,验证了该算法的正确性和合理性。该算法具有并行计算的能力,适合于分布式计算机,寻求大型复杂网络的最优路径。     

Frame-Based Ray Search Algorithms in Unconstrained Optimization

This paper describes a class of frame-based direct search methods for unconstrained optimization without derivatives. A template for convergent direct search methods is developed, some requiring only the relative ordering of function values. At each iteration, the template considers a number of search steps which form a positive basis and conducts a ray search along a step giving adequate decrease. Various ray search strategies are possible, including discrete equivalents of the Goldstein–Armijo and one-sided Wolfe–Powell ray searches. Convergence is shown under mild conditions which allow successive frames to be rotated, translated, and scaled relative to one another.     

一种物理实验教学网络系统

利用网络技术建立了物理实验网络，提高了教学质量。     

基于BP算法神经网络的物理实验曲线拟合

介绍了人工神经元网络的基本原理和BP算法神经网络。将BP算法神经网络应用于物理实验中的幅频特性曲线拟合，在MATLAB下通过训练和仿真验证了应用BP算法神经网络拟合实验曲线的优越性。     

Uniqueness of the solution for optimal static routing in open BCMP queueing networks

Optimal static routing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. They include static routing problems in communication networks and optimal static load balancing problems in distributed computer systems. We consider an overall optimal policy that is the routing policy whereby the overall mean response (or sojourn) time of a job is minimized. We obtain the routing decisions of the overall optimal policy and show that they may not be unique, but that the utilization of each service center is uniquely determined by the overall optimal policy. We also consider an individually optimal policy whereby jobs are routed so that each job may feel that its own expected response time is minimized if it knows the mean delay time for each path.     

一种新的思维模型:多节拍主从结构离散神经网络(英)

本文基于McCulloch和Pitts提出的二值神经元阈值模型，以Hopfield联想神经网络为核心，加上两个从网络，构造了一个由节拍各异的三个离散网络组成的神经网络系统．本文分析了该系统的稳定性，并定性讨论了其联想思维功能．     

基于匹配网络若干问题的推论

深入分析了匹配网络中存在的基本问题，并归纳出６个推论。     

Conditions for swappability of records in a microdata set when some marginals are fixed

We consider swapping of two records in a microdata set for the purpose of disclosure control. We give some necessary and sufficient conditions that some observations can be swapped between two records under the restriction that a given set of marginals are fixed. We also give an algorithm to find another record for swapping if one wants to swap out some observations from a particular record.