358 research outputs found
Uniform Partition in Population Protocol Model Under Weak Fairness
We focus on a uniform partition problem in a population protocol model. The uniform partition problem aims to divide a population into k groups of the same size, where k is a given positive integer. In the case of k=2 (called uniform bipartition), a previous work clarified space complexity under various assumptions: 1) an initialized base station (BS) or no BS, 2) weak or global fairness, 3) designated or arbitrary initial states of agents, and 4) symmetric or asymmetric protocols, except for the setting that agents execute a protocol from arbitrary initial states under weak fairness in the model with an initialized base station. In this paper, we clarify the space complexity for this remaining setting. In this setting, we prove that P states are necessary and sufficient to realize asymmetric protocols, and that P+1 states are necessary and sufficient to realize symmetric protocols, where P is the known upper bound of the number of agents. From these results and the previous work, we have clarified the solvability of the uniform bipartition for each combination of assumptions. Additionally, we newly consider an assumption on a model of a non-initialized BS and clarify solvability and space complexity in the assumption. Moreover, the results in this paper can be applied to the case that k is an arbitrary integer (called uniform k-partition)
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of arbitrary communication graphs. As a result, we investigate the solvability of the uniform bipartition problem with arbitrary communication graphs when agents in the population have designated initial states, under various assumptions such as the existence of a base station, symmetry of the protocol, and fairness of the execution. When the problem is solvable, we present protocols for uniform bipartition. When global fairness is assumed, the space complexity of our solutions is tight
Area-Based Medicine
Japan’s health insurance system has reached a critical turning point owing to a decreasing birthrate, increasing longevity, and changes in disease trends. The Japanese government is promoting the establishment of a community-based integrated care system aimed at maintaining the dignity of elderly individuals and supporting independent living. This care system will ensure medical and nursing care, preventive measures, and independent living support. This type of care system should be based on the characteristics of individual geographical areas, as there are marked regional variations in patterns of aging, lifestyle, and the adequacy of local medical care. Therefore, it is important that medical services are tailored to fit the kind of medical care needed by residents of each geographical area and to provide medical services accordingly. In this paper, we propose a need for area-based medicine, whereby medical care is provided according to the characteristics of individual geographical areas in super-ageing societies such as that of Japan
Population Protocols for Graph Class Identification Problems
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identification problem aims to decide whether a given communication graph is in the desired class (e.g. whether the given communication graph is a ring graph). Angluin et al. proposed graph class identification protocols with directed graphs and designated initial states under global fairness [Angluin et al., DCOSS2005]. We consider graph class identification problems for undirected graphs on various assumptions such as initial states of agents, fairness of the execution, and initial knowledge of agents. In particular, we focus on lines, rings, k-regular graphs, stars, trees, and bipartite graphs. With designated initial states, we propose graph class identification protocols for k-regular graphs and trees under global fairness, and propose a graph class identification protocol for stars under weak fairness. Moreover, we show that, even if agents know the number of agents n, there is no graph class identification protocol for lines, rings, k-regular graphs, trees, or bipartite graphs under weak fairness, and no graph class identification for lines, rings, k-regular graphs, stars, trees, or bipartite graphs with arbitrary initial states
Molecular Rheology of Glassy Polymers (FUNDAMENTAL MATERIAL PROPERTIES-Molecular Rheology)
Molecular origin of the viscoelasticity around the glass transition zone is investigated by means of dynamic birefringence and dynamic viscoelasticity measurements. The present study show that the viscoelasticity around the glass transition zone has two molecular origins: One is the orientation relaxation of main chain axis and the other one is the rotational motion of structure units about the main chain axis
- …