Matching algorithm has been used in broad domains of assignment problems because of its simplicity and efficiency. We also studied a probabilistic matching focusing on the application to digital systems including IoT. This note reports a modification of the probabilistic matching aiming application to the dynamic assignment of computational resources and devices This note discusses the dynamic assignment between servers and containers. Container technology is widely used because of its simplicity and efficiency compared with the virtual machines. This note reports the merit and demerit of using the dynamic matching with the simulation of the scenario using CPU resource and memory as dynamic parameters reflecting the changing environment.

The world has become flat through the Web and the recent proliferation of social network services, allowing anyone to be a news writer without requiring much effort, thus creating an epidemic of fake news (microblogs in particular). This note proposes a bottom up approach with relative, mutual, and dynamic credibility evaluation using a dynamic relational network (or mutual evaluation model), where each node can evaluate and in turn be evaluated by other nodes for credibility based on the consistency of the content of the node. Our stance is that 1) it would be difficult to evaluate credibility of news solely on the content of the news (except obvious ones using fake photos and images); 2) hence, allow related news articles to mutually evaluate each other based on the facts’ (5W1H— who, what, where, when, why, and how) consistency; 3) however, this poses the problem of fake evaluation, thus allowing any users to build their own evaluation network for fairness.

Free will is an important component of consciousness. Modeling an artificial consciousness requires clarifying the significance and the definition of free will. This study proposes a definition of free will similar to the epsilon-delta definition of continuous space (e.g., real numbers). Selection capability and frame expanding potential (i.e., the ability to allow for the exploration of further options), which are significant functions of free will, are discussed in the problem-solving context. We also propose a Turing test with multiple agents in which the intelligence of humans and machines will be relatively scored based on chats in a mixed community of humans and machines. Agents (machines) fail in the multiple agents Turing test because they lack the ability to evaluate chats with another agent, as well as chats between two other agents.

A number of studies have revealed and investigated how the clusters organized by cooperators emerge in a spatial prisoner’s dilemma. However, a qualitative analysis of the clusters formed by the cooperators has not yet been studied. This paper aims to propose a new technique for quantifying clusters that consist of players with cooperative strategies. The proposed method can be applied to the spatial prisoner’s dilemma in a square lattice network. In the proposed method, a minimum cluster is defined as a group of the cooperators based on a small square (2 by 2). This paper also defines a degree of the clusters by extending the small squares that based on how the players organize themselves into coordinated groups. The authors analyze and compare with typical examples of the clusters in the spatial prisoner’s dilemma. By analyzing the examples, this paper demonstrates that the proposed method quantifies the degree of the clusters organized by the cooperators. The authors also examine the significance of the proposed method by the simulations of the spatial prisoner’s dilemma.

In this paper, we propose “social diversity” which is an integrated satellite telemetry receiving system with volunteers. In the proposed system, a number of volunteer receivers catch the satellite signals with a simplified cheap receiver, instead of using a comprehensive and expensive antenna receiving station. Although such signals may contain various errors or may be lost, the intelligent information techniques can compensate such signals by using a number of simultaneously received signals and profiled data. For the purpose of the whole system developments, we tackle mainly three issues. Firstly, we develop a simple receiver for the amateur bands radio waves. Secondly, we design the receiving data format for the transfer and server-client web receiving system. Finally, we thrash out suitable intelligent information techniques for our system. Here we report a development status of our whole satellite telemetry system. Especially, this report focuses on the simple SDR (Software-Defined Radio) receiver for the voluntary observers and a prototype of the web system for collecting a number of satellite telemetry data and compensating the incomplete telemetry data.

This paper proposes a framework for a new quantum computation based on the Feynman's path integral. The Feynman's path integral has been studied in quantum physics, however, the computational machinery may be used in universal computations. The light path design will be done in a light geometric automaton. As examples, we will present the primality test of an integer (for the deterministic case of light particle) and the stable marriage problem (for the probabilistic case of light wave).

This paper proposes a new diagram for a specific matching problem: the stable marriage problem. The diagram allows us to elicit not only the structure of with a blocking relation among the nodes representing pairs, but also asymmetry in the actions of the DA algorithm (Gale-Shapley algorithm). Symmetry and asymmetry of the stable marriage problems permit us to deduce strategies of whether or not and when proposals should be made. Some implications to the asymmetry in rewarding and penalty in the game theoretic model are also discussed.

This paper describes a novel, cyber attack-resilient server using hybrid virtualization that can reduce the downtime of the server and enhance the diversity of operating systems by adding a Linux virtual machine. The hybrid virtualization consists of machine- and application-level virtualization. The prototype system virtualizes a machine using VMware ESXi, while the prototype system virtualizes a server application using Docker on a Linux virtual machine. Docker increases the speed at which a server application starts while requiring fewer resources such as memory and storage. Performance tests showed that the prototype system reduced the downtime of the DNS service by exploiting a vulnerability with no false positive detections compared with our previous work.

The Virtual machine monitor and container is an example of virtualization engine technologies that are currently in wide use. Both types of virtualization engines have vulnerabilities that could hamper a virtual machine. In our previous work, we created a resilient server using virtualization technologies with a single virtualization engine. To improve the resilience of the server, we use two different types of virtualization engines that monitor and respond by the SRN manager. The experiments results show that using multiple virtualization engines could cover their vulnerabilities against limited scenarios of failure.

This note reports on interdisciplinary approaches to model consciousness, an aspect of self-awareness in particular, aiming at artificial consciousness that can be mounted on an autonomous and mobile robot. For self-awareness to emerge, the self-identification process plays an important role. Self-awareness would emerge when self-locating in a self-created map in robot navigation; when solving self-related problems in (a self-related version of) the frame problem; and when a singularity arises in mapping the reference point in mathematical mappings.

This paper proposes a framework for web intelligence based on virtual sensor networks on the web. “Strong AI” requires a framework that allows the AI to make inferences using incomplete, dynamic and growing data on the web. An example of such inferences may be found in the human reasoning known as the “Fermi estimate”. However, the huge amounts of data available through the internet necessitate an appropriate reasoning engine. The Fermi estimate is reformulated to be used in a virtual sensor network and several examples are discussed.

This paper proposes a matching model to build resilient and robust systems. Current systems require huge amounts of information that may not be available in a disaster situation. Also, many systems depend on solutions finely tuned under the assumption that information is available. We propose a matching model based on matching problems such as the stable marriage problem and the roommate problem. The matching model allows us to include the preferences of agents and other qualitatively different viewpoints in advance. It provides a natural way of diversifying solutions based on stable matching and will exhibit resilience when one solution ceases to be optimal or even to be feasible. An example application of evacuation route assignment (as opposed to optimal route search) with multiple starting points to a target point (a shelter) is used.

This paper attempts to construct a resilient sensor network model for space weather forecasting. The proposed model is based on a dynamic relational network. A space weather forecasting is vital for a satellite operation because an operational team needs to make a decision for providing its satellite service. The proposed model is resilient for failures of sensors/missing data due to the satellite operation. In the proposed model, the missing data of a sensor is interpolated by other sensors associated. This paper demonstrates an example of the space weather forecasting involving the missing of the observation in a test case. In this example, the sensor network of the space weather forecasting continues a diagnosis by replacing faulted sensors with imaginary ones. The demonstrations showed that the proposed model is resilient against sensor failures due to suspend of hardware failures or technical reasons.

Since servers play a critical role in data processing and data transmission for serving many clients, failures in servers cause not only performance degradation of the server itself but also threats to all the computers connected to the server. Resilient servers that can self-recognize failures, self-repair failures and self-replace failed parts are required when computer systems and networks become such huge-scale as witnessed by data centers and the cloud computing. As a preliminary study, we report simulations restricting ourselves to demonstrate the self-repair network (SRN) model in a homogeneous environment realized by a virtualization technique. Simulations are conducted using native and hosted VMM on a single physical computer. Three scenarios: hang faulty, DoS attack and virus infection, are simulated. These simulations demonstrated how a server with a homogeneous environment (realized by the self-repair network model using the virtualization technique) can or cannot keep the resilience, and even suggested a possibility and necessity of using a self-reconfiguration model to create diversity.

Stable Marriage Problem (SMP) is a matching problem which seeks a stable matching between in N women and N men. We propose a Lotka-Volterra Model(LVM) mapped from SMP. Further, we show the equilibria of LVM mapped from the stable matchings of SMP are stable and those not corresponding to the stable matchings are unstable by the local stability analysis.

If the measure of computational complexity, defined as the computation time required to solve a problem, is independent from the computer used, the measure reflects the complexity of the algorithm and the problem instance. If the measure further does not depend on the algorithm, it purely reflects the complexity of the problem instance. Focusing on the stable marriage problem, we propose a mapping from problem instances to dynamical systems. The computational time required for a dynamical system to reach equilibrium is used to measure the complexity. A diagram similar to a phase diagram of dynamical systems is proposed to indicate the structure of stable manifolds of dynamical systems. Based on computer simulations, we conjecture that the diagram is qualitatively invariant to the mapping and naturally reflects the complexity of the problem instance. The diagram indicates not only that the stable equilibrium corresponds to the stable matchings but also that the contour structure corresponds to the discrete structure of the lattice formed by the stable matchings.

This note proposes a symmetric majority network as an energy function in discrete problem solving. As in the Lyapunov function in non-linear dynamical systems, the energy function can show convergence on stable fixed points. Similarly, the symmetric majority network, when mapped properly, can show convergence on the solution. The state transition process to the solution can also indicate a problem-solving process. As an example of discrete problem solving, a matching problem is adopted and the problem-solving process will be visualized by a simulation of a mapped majority network. The stable marriage problem, size 3 and size 4 in part, is considered and the majority network is extended to solve it.

One of the most important activities for satisfying relief demand during disaster relief operations is logistic and inventory. To fulfill the relief demand after the disaster, pre-positioning inventory is prepared in each shelter before the disaster. However, their amount of inventory is only enough for fulfilling the demand in short period after disaster. Due to chaotic condition at that moment, relief inventory level at each inventory location (shelter) also vary significantly and some of them may short of important items. In that situation, there is a need to leverage the level of inventory between shelters with lateral transshipment operations. Lateral transshipment within inventory system is a stock movement between locations of relief inventory storage of the same echelon level. In this operation, interconnection between shelters can be assumed as a network having self-supply capability that each of them is able to redistribute stock to their neighboring locations. However, lateral transshipment may contribute to further discrepancy of inventory level if it is not managed carefully. We proposed a method of improving the performance of lateral transshipment operations through cluster formation of shelters before the disaster event occurs. The clusters formation is based on the algorithm of stable roommate problem. To support validity of our model, the numerical simulation of volcanic eruption disaster is used. The results show that the cluster formation contributes to better performance of relief logistic and inventory.

This note characterizes the dynamic structure of stable matchings of the stable marriage problem (SMP). The characterization focuses on the dynamic process of how the stable matching will be attained. To this end, the discrete problem of the SMP will be mapped to nonlinear dynamical models whose attractors include the counterparts of the stable matchings in the original SMP. A simple measure of decision-making difficulty is introduced. We use two types of diagram: a cross section diagram (and its 3D imaging) of a lattice to visualize the decision-making difficulty, and a radiation diagram to visualize the time evolution to a matching. Both diagrams are used to examine the dynamic structure of the neighborhood of an attractor and its basin as well as the region between basins in the dynamical model mapped from the SMP.

This study proposes an idea of improving SME's resource productivity and supplier selection under disruption risk. We discuss a framework of small medium enterprise (SME) management system for producing customized small size discrete manufacturing component that involves activities of shop floor production, monitoring, and controlling. As a company that positioned at third or even lower layer of supply chain, they try to catch up production level by an increasing number of working hours, which is also increasing manufacturing cost simultaneously. Furthermore, they are subject to a wide range of risks, such as natural disasters, terrorist attacks, and supply uncertainty. For them, integrated automation, supplier collaboration, and risk management against facility disruption are difficult challenges. We use graphical view of Petri net as an event based model, followed by a proposal of enabling technologies for integrated automation and credibility analysis for supplier selection. Finally, the numerical example and software prototype validate the effectiveness of the proposed system.

Since matching problems are discrete combinatorial problems, the algorithms proposed so far are sequential. In reality, however, pairing includes parallel and continuous aspect. The Stable Marriage Problem(SMP) is a matching problem to find stable matchings among combinatorially possible matchings between n women and n men. We propose a dynamic problem solving by mapping SMP to a dynamical system, in this case we use Lotka-Volterra model(LV-model). Predator-Prey relation is used to exclude blocking pairs as well as prohibited pairs (pairs sharing the same person). All attractors are investigated for the SMP with size of three.

The East Japan Earthquake on March 11 and the ensuing tsunami and nuclear power plant catastrophe showed the urgent need for reconciliation between humans and nature. We consider that today's engineering and supporting sciences may require reconsideration in evaluating robustness, and focus on a system reliability approach and optimization framework. Since information networks such as the Internet and sensor networks have expanded to such an extent that they can be considered similar to the neural systems of humans, we need to design a defensive system comparable to immune systems. This paper revisits a design paradigm of immunity-based systems and explores solutions for the reconciliation problem.

Important problems can be solved by mapping them to dynamical systems, which also confers several advantages such as robustness to model assumptions and clarification of stability and adaptability, which may not be obtained by conventional algorithmic solutions. This paper proposes a mapping framework focusing on bipartite matching problems, and discusses applications to support recovery economics.

Recent expansion of the computer network opened a possibility of explosive spread of computer viruses. We propose a distributed approach against computer virus using also the computer network that allows distributed and agent-based approach. Our anti-virus system consists of several heterogeneous agents similarly to the immune system. Among these agents, antibody agents use the information of "self" (files of host computer) rather than the information of "non-self" (computer viruses). After detection and neutralization of computer viruses, the anti-virus system tries to recover original files that are distributed over the uninfected hosts connected by LAN. This recovery is also done by several heterogeneous agents. As a whole, the proposed anti-virus system can be regarded a backup system with computer network. We implemented the antivirus system with JAVA, and tested against some existing viruses.

We discuss the features of the immune system; its system aspect (compatible with Jerne's network view), its process aspect, and its design aspect (compatible with Metchinikoff's self-defining view). Our applications of these three aspects are also presented briefly. Since these features of the immune system agree with the concept of autonomous decentralized systems, we suggest that the immune system can be a typical model for autonomous decentralized systems. In the self-defining process, agents can refer to the self-information, and can interact with the environment. We propose that this self-defining process extracted from the immune system can be a candidate for design paradigm for autonomous decentralized systems where full specification of the total system is not only unavailable but also inadequate. We also suggest that the Internet would be a typical example designed by this paradigm.

A new information processing architecture is extracted from the immune system. By focusing on informational features of the immune system (i.e. specificity, diversity, tolerance, and memory), an immune algorithm is proposed. The algorithm proceeds in three steps: diversity generation, establishment of self-tolerance, and memorizing non-self. The algorithm may be used typically to model the system by distributed agents where the system (the self) as well as the environment (the non-self) are unknown or cannot be modeled. Agent-based architecture based on the local memory hypothesis and network-based architecture based on the network hypothesis are discussed. Agent-based architecture is elaborated with the application to an adaptive system where the knowledge about environment is not available. Adaptive noise neutralization is formalized and simulated for a simple plant.

Taking inspiration from the immune system mechanism, an application which identifies faulty sensors in the firing section of a cement plant by mutual recognition is presented. Some improvements of existing algorithms are described. Results using simulated data are reported and discussed.>

Discusses a specific type of spatial reasoning which may be used for robots to recognize and manipulate the spatially entangled objects. The author first expresses knots and links symbolically. On the symbolic expressions, rule-based spatial reasoning is performed for unknotting knots or for separating links. Finally, the author takes up a Japanese puzzle ring as an example of using this symbolic expression. The state of the puzzle ring is changed by several operations defined on the expressions.>

Based on the strong analogy between neural networks and distributed diagnosis models, diagnostic algorithms are presented which are similar to the learning algorithm used in neural networks. Diagnostic implications of convergence theorems proved by the Lyapunov function are also discussed. Regarding diagnosis process as a recalling process in the associative memory, a diagnostic method of associative diagnosis is also presented. A good guess of diagnosis is given as a key to recalling the correct diagnosis. The authors regard the distributed diagnosis as an immune network model, a novel PDP (parallel distributed processing) model. This models the recognition capability emergent from cooperative recognition of interconnected units

A failure diagnosis model which consists of a set of units that are faulty, a set of measurements to detect a faulty unit, and an incidence matrix representing the binary relation between these two sets is presented. A binary relation is defined by whether or not a fault of one unit is detected by a measurement. Considering this failure diagnosis model as a simplicial complex in topological geometry, the relationship between the diagnostic aspects of the model and the topological properties of the corresponding simplicial complex is studied. The diagnosability of a failure diagnosis model with multiple faults is expressed as a covering property of each simplex in a simplicial complex. The capability of distinguishing a faulty unit by a given number of measurement is determined by examining the global connective structure of the simplicial complex. This analysis of connectivity is done by performingq-analysis on a simplicial complex. It is noted hat all possible combinations of fault patterns are considered under a permissible number of faults. However, in actual systems, only restricted fault patterns are possible in which faulty units are functionally connected with each other, even in multiple fault situations.