1,550 research outputs found
International trends in early childhood education for sustainability
No full textEarly childhood education for sustainability (ECEfS) is an emerging field within education – a synthesis of early childhood education and education for sustainability. As a distinct field of educational inquiry and practice, it is less than 20 years old in Australia. My personal story is one that emerged from teaching Aboriginal children in an Indigenous community. These experiences made me question the marginalization of Indigenous peoples in Australian society, the colonizing impacts of education, gave me deeper understandings of human-environment interactions, and the effects of poverty and powerlessness on options for Indigenous people in Australia and elsewhere where people and their lands have been exploited. These experiences saw me return to university to undertake a degree in environmental studies to help me better understand the nexus between society, environment and economy. Hence my background in education for sustainability comes as much from the social sciences as from the biological/ecological sciences and shapes my orientation to my work in ECEFS..
Population Protocols for Graph Class Identification Problems
No full textIn 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
Uniform Partition in Population Protocol Model Under Weak Fairness
No full textWe 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)
Constant-Space Population Protocols for Uniform Bipartition
No full textIn this paper, we consider a uniform bipartition problem in a population protocol model. The goal of the uniform bipartition problem is to divide a population into two groups of the same size. We study the problem under various assumptions: 1) a population with or without a base station, 2) weak or global fairness, 3) symmetric or asymmetric protocols, and 4) designated or arbitrary initial states. As a result, we completely clarify constant-space solvability of the uniform bipartition problem and, if solvable, propose space-optimal protocols
Gathering in Carrier Graphs: Meeting via Public Transportation System
No full textThe gathering problem requires multiple mobile agents in a network to meet at a single location. This paper investigates the gathering problem in carrier graphs, a subclass of recurrence of edge class of time-varying graphs. By focusing on three subclasses of single carrier graphs - circular, simple, and arbitrary - we clarify the conditions under which the problem can be solved, considering prior knowledge endowed to agents and obtainable online information, such as the count and identifiers of agents or sites. We propose algorithms for solvable cases and analyze the complexities and we give proofs for the impossibility for unsolvable cases. We also consider general carrier graphs with multiple carriers and propose an algorithm for arbitrary carrier graphs. To the best of our knowledge, this is the first work that investigates the gathering problem in carrier graphs
Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
No full textThe population protocol model is a computational model for passive mobile agents. We address the leader election problem, which determines a unique leader on arbitrary communication graphs starting from any configuration. Unfortunately, self-stabilizing leader election is impossible to be solved without knowing the exact number of agents; thus, we consider loosely-stabilizing leader election, which converges to safe configurations in a relatively short time, and holds the specification (maintains a unique leader) for a relatively long time. When agents have unique identifiers, Sudo {et al. }(2019) proposed a protocol that, given an upper bound N for the number of agents n, converges in O(mNlog n) expected steps, where m is the number of edges. When unique identifiers are not required, they also proposed a protocol that, using random numbers and given N, converges in O(mN²log{N}) expected steps. Both protocols have a holding time of Ω(e^{2N}) expected steps and use O(log{N}) bits of memory. They also showed that the lower bound of the convergence time is Ω(mN) expected steps for protocols with a holding time of Ω(e^N) expected steps given N.
In this paper, we propose protocols that do not require unique identifiers. These protocols achieve convergence times close to the lower bound with increasing memory usage. Specifically, given N and an upper bound Δ for the maximum degree, we propose two protocols whose convergence times are O(mNlog n) and O(mNlog N) both in expectation and with high probability. The former protocol uses random numbers, while the latter does not require them. Both protocols utilize O(Δ log N) bits of memory and hold the specification for Ω(e^{2N}) expected steps
DS1_JVDI_10.1177_1040638718796269 – Supplemental material for Congenital abnormalities in calves associated with Peaton virus infection in Japan
No full textSupplemental material, DS1_JVDI_10.1177_1040638718796269 for Congenital abnormalities in calves associated with Peaton virus infection in Japan by Yoichi Matsumori, Maki Aizawa, Yoshiko Sakai, Daisuke Inoue, Michiko Kodani, Osamu Tsuha, Akira Beppu, Yoshimasa Hirashima, Ryota Kono, Akifumi Ohtani, Tohru Yanase, Hiroaki Shirafuji, Tomoko Kato, Shogo Tanaka and Makoto Yamakawa in Journal of Veterinary Diagnostic Investigation</p
Plug & Test at System Level via Testable TLM Primitives
No full textWith the evolution of Electronic System Level (ESL) design methodologies, we are experiencing an extensive use of Transaction-Level Modeling (TLM). TLM is a high-level approach to modeling digital systems where details of the communication among modules are separated from the those of the implementation of functional units. This paper represents a first step toward the automatic insertion of testing capabilities at the transaction level by definition of testable TLM primitives. The use of testable TLM primitives should help designers to easily get testable transaction level descriptions implementing what we call a "Plug & Test" design methodology. The proposed approach is intended to work both with hardware and software implementations. In particular, in this paper we will focus on the design of a testable FIFO communication channel to show how designers are given the freedom of trading-off complexity, testability levels, and cos
Capacitors
No full textThis webpage is part of a larger site by the author about electronic circuit engineering. This page introduces the reader to capacitors, including the principles behind how they work. Explanations of several different types of capacitors (including Electrolytic, Tantalum, and Mica) are accompanied by detailed color illustrations of the concepts
Lecideoid lichens of Prince Olav Coast and Soya Coast, Enderby Land, East Antarctica
No full textFive species of lecideoid lichens belonging to three genera are reported as new to the flora of the Prince Olav Coast and the Soya Coast, Enderby Land, East Antarctica; they are Carbonea capsulata (DODGE & BAKER) HALE, Lecidea andersonii R. FILSON, Lecidea cancriformis DODGE & BAKER, Lecidea soyaensis M. INOUE and Lecidella siplei (DODGE & BAKER) M. INOUE. All are endemic to Antarctica. An examination was made of the collections from the region, which were collected mainly by the author under the project of the 27th Japanese Antarctic Research Expedition (JARE-27,during January 1986 and February 1987). The type and authentic specimens of possibly related species have been restudied. Lecidea soyaensis M. INOUE is new to science and Lecidella siplei (DODGE & BAKER) M. INOUE is proposed as a new combination. Taxonomic and chemical data as well as a key to the known taxa are provided
- …
