Search

In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes (nodes where a robot exists) constitutes one connected graph, robots reach a configuration such that the maximum distance between two robots is minimized. For the case of seven robots, gathering is achieved when one robot has six adjacent robot nodes (they form a shape like a hexagon). In this paper, we aim to clarify the relationship between the capability of robots and the solvability of the gathering problem on a triangular grid. In particular, we focus on visibility range of robots. To discuss the solvability of the problem in terms of the visibility range, we consider strong assumptions except for visibility range. Concretely, we assume that robots are fully synchronous and they agree on the direction and orientation of the $x$-axis, and chirality on the triangular grid. In this setting, we first consider the weakest assumption about visibility range, i.e., robots with visibility range 1. In this case, we show that there exists no collision-free algorithm to solve the gathering problem. Next, we extend the visibility range to 2. In this case, we show that our algorithm can solve the problem from any connected initial configuration. Thus, the proposed algorithm is optimal in terms of visibility range., 23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM2021), May 17, 2021, to be held in conjunction with 35th IEEE International Parallel and Distributed Processing Symposium (IPDPS2021), May 17-21, 2021, Portland, Oregon, USA

In the population protocol model, many problems cannot be solved in a self-stabilizing manner. However, global knowledge, such as the number of nodes in a network, sometimes enables the design of a self-stabilizing protocol for such problems. For example, it is known that we can solve the self-stabilizing leader election in complete graphs if and only if every node knows the exact number of nodes. In this article, we investigate the effect of global knowledge on the possibility of self-stabilizing population protocols in arbitrary graphs. Specifically, we clarify the solvability of the leader election problem, the ranking problem, the degree recognition problem, and the neighbor recognition problem by self-stabilizing population protocols with knowledge of the number of nodes and/or the number of edges in a network.

We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist $k$ agents with unique identifiers (IDs) in the network, and $f$ of them are weakly Byzantine agents, which behave arbitrarily except for falsifying their IDs. The agents behave in synchronous rounds, and each node does not have any memory like a whiteboard. In the literature, there exists a gathering algorithm that tolerates any number of Byzantine agents, while the fastest gathering algorithm requires $\Omega(f^2)$ non-Byzantine agents. This paper proposes an algorithm that solves the gathering problem efficiently with $\Omega(f)$ non-Byzantine agents since there is a large gap between the number of non-Byzantine agents in previous works. The proposed algorithm achieves the gathering in $O(f\cdot|\Lambda_{good}|\cdot X(N))$ rounds in case of $9f+8\leq k$ and simultaneous startup if $N$ is given to agents, where $|\Lambda_{good}|$ is the length of the largest ID among non-Byzantine agents, and $X(n)$ is the number of rounds required to explore any network composed of $n$ nodes. This algorithm is faster than the most fault-tolerant existing algorithm and requires fewer non-Byzantine agents than the fastest algorithm if $n$ is given to agents, although the guarantees on simultaneous termination and startup delay are not the same. To achieve this property, we propose a new technique to simulate a Byzantine consensus algorithm for synchronous message-passing systems on agent systems., Comment: 29 pages, 2 figures, 2 tables, and 6 pseudo-codes

There is increasing demand for High-Performance Computing (HPC) cluster systems because more and more computational resources are necessary to carry out large-scale simulations and machine learning which are a crucial part of research and business today. There are two choices of HPC cluster systems: academic HPC cluster systems and public cloud services. Academic HPC cluster systems can be used with reasonable usage fees, although they take a long time until the cluster system is ready to use, because of its user registration procedure. On the other hand, public cloud services, such as Amazon Web Services, can be used immediately, but the utilization fees are expensive compared with those for academic systems. To fill the gaps between them, we propose an academic HPC cluster system with automated user registration that allows users to utilize the HPC cluster on demand.

Previous research studies mostly focused on enhancing the security of radio frequency identification (RFID) protocols for various RFID applications that rely on a centralized database. However, blockchain technology is quickly emerging as a novel distributed and decentralized alternative that provides higher data protection, reliability, immutability, transparency, and lower management costs compared with a conventional centralized database. These properties make it extremely suitable for integration in a supply chain management system. In order to successfully fuse RFID and blockchain technologies together, a secure method of communication is required between the RFID tagged goods and the blockchain nodes. Therefore, this paper proposes a robust ultra-lightweight mutual authentication RFID protocol that works together with a decentralized database to create a secure blockchain-enabled supply chain management system. Detailed security analysis is performed to prove that the proposed protocol is secure from key disclosure, replay, man-in-the-middle, de-synchronization, and tracking attacks. In addition to that, a formal analysis is conducted using Gong, Needham, and Yahalom logic and automated validation of internet security protocols and applications tool to verify the security of the proposed protocol. The protocol is proven to be efficient with respect to storage, computational, and communication costs. In addition to that, a further step is taken to ensure the robustness of the protocol by analyzing the probability of data collision written to the blockchain.

Walking is a fundamental physical activity in humans. Various virtual walking systems have been developed using treadmill or leg-support devices. Using optic flow, foot vibrations simulating footsteps, and a walking avatar, we propose a virtual walking system that does not require limb action for seated users. We aim to investigate whether a full-body or hands-and-feet-only walking avatar with either the first-person (experiment 1) or third-person (experiment 2) perspective can convey the sensation of walking in a virtual environment through optic flows and foot vibrations. The viewing direction of the virtual camera and the head of the full-body avatar were linked to the actual user's head motion. We discovered that the full-body avatar with the first-person perspective enhanced the sensations of walking, leg action, and telepresence, either through synchronous or asynchronous foot vibrations. Although the hands-and-feet-only avatar with the first-person perspective enhanced the walking sensation and telepresence, compared with the no-avatar condition, its effect was less prominent than that of the full-body avatar. However, the full-body avatar with the third-person perspective did not enhance the sensations of walking and leg action; rather, it impaired the sensations of self-motion and telepresence. Synchronous or rhythmic foot vibrations enhanced the sensations of self-motion, waking, leg action, and telepresence, irrespective of the avatar condition. These results suggest that the full-body or hands-and-feet avatar is effective for creating virtual walking experiences from the first-person perspective, but not the third-person perspective, and that the foot vibrations simulating footsteps are effective, regardless of the avatar condition.

Background: Based on the results of the PACIFIC study, chemoradiotherapy followed by 1-year consolidation therapy with durvalumab was established as the standard of care for unresectable, locally advanced non-small-cell lung cancer (LA-NSCLC). However, some topics not foreseen in that design can be explored, including progression-free survival (PFS) and overall survival (OS) after the start of chemoradiotherapy, the proportion of patients who proceeded to consolidation therapy with durvalumab, and the optimal chemotherapeutic regimens. In Japan, the combination regimen of S-1 + cisplatin (SP), for which the results of multiple clinical studies have suggested a good balance of efficacy and tolerability, is frequently selected in clinical settings. However, the efficacy and safety of consolidation therapy with durvalumab following this SP regimen have not been evaluated. We therefore planned a multicenter, prospective, single-arm, phase II study. Methods: In treatment-naïve LA-NSCLC, two cycles of combination chemotherapy with S-1 (80–120 mg/body, Days 1–14) + cisplatin (60 mg/m2, Day 1) will be administered at an interval of 4 weeks, with concurrent thoracic radiotherapy (60 Gy). Responders will then receive durvalumab every 2 weeks for up to 1 year. The primary endpoint is 1-year PFS rate. Discussion: Compared with the conventional standard regimen in Japan, the SP regimen is expected to be associated with lower incidences of pneumonitis, esophagitis, and febrile neutropenia, which complicate the initiation of consolidation therapy with durvalumab, and have higher antitumor efficacy during chemoradiotherapy. Therefore, SP-based chemoradiotherapy is expected to be successfully followed by consolidation therapy with durvalumab in more patients, resulting in prolonged PFS and OS. Toxicity and efficacy results of the SP regimen in this study will also provide information important to the future establishment of the concurrent combination of chemoradiotherapy and durvalumab. Trial registration: Japan Registry of Clinical Trials, jRCTs031190127, registered 1 November 2019, https://jrct.niph.go.jp/latest-detail/jRCTs031190127

In this paper, we consider the gathering problem of seven autonomous mobile robots on triangular grids. The gathering problem requires that, starting from any connected initial configuration where a subgraph induced by all robot nodes (nodes where a robot exists) constitutes one connected graph, robots reach a configuration such that the maximum distance between two robots is minimized. For the case of seven robots, gathering is achieved when one robot has six adjacent robot nodes (they form a shape like a hexagon). In this paper, we aim to clarify the relationship between the capability of robots and the solvability of gathering on a triangular grid. In particular, we focus on visibility range of robots. To discuss the solvability of the problem in terms of the visibility range, we consider strong assumptions except for visibility range. Concretely, we assume that robots are fully synchronous and they agree on the direction and orientation of the x-axis, and chirality in the triangular grid. In this setting, we first consider the weakest assumption about visibility range, i.e., robots with visibility range 1. In this case, we show that there exists no collision-free algorithm to solve the gathering problem. Next, we extend the visibility range to 2. In this case, we show that our algorithm can solve the problem from any connected initial configuration. Thus, the proposed algorithm is optimal in terms of visibility range., 23rd Workshop on Advances in Parallel and Distributed Computational Models (APDCM2021), May 17, 2021, to be held in conjunction with 35th IEEE International Parallel and Distributed Processing Symposium (IPDPS2021), May 17-21, 2021, Portland, Oregon, USA

We present a new state transfer method for geographic State Machine Replication (SMR) that dynamically allocates the state to be transferred among replicas according to changes in communication bandwidths. SMR is a method that improves fault tolerance by replicating a service to multiple replicas. When a replica is newly added or is recovered from a failure, the other replicas transfer the current state of the service to it. However, in geographic SMR, the communication bandwidths of replicas are different and constantly changing. Therefore, existing state transfer methods cannot fully utilize the available bandwidth, and their state transfer time becomes long. To overcome this problem, our method divides the state into multiple chunks and assigns them to replicas based on each replica's bandwidth so that the broader a replica's bandwidth is, the more chunks it transfers. The number of assigned chunks is dynamically updated based on the currently estimated bandwidth. The performance evaluation on Amazon EC2 shows that the proposed method reduces the state transfer time by up to 47% compared with the existing one., Comment: This manuscript was submitted to the Ninth International Symposium on Computing and Networking (CANDAR 2021)

We propose a self-stabilizing algorithm to construct a minimal weakly $\mathcal{ST}$-reachable directed acyclic graph (DAG), which is suited for routing messages on wireless networks. Given an arbitrary, simple, connected, and undirected graph $G=(V, E)$ and two sets of nodes, senders $\mathcal{S} (\subset V)$ and targets $\mathcal{T} (\subset V)$, a directed subgraph $\vec{G}$ of $G$ is a weakly $\mathcal{ST}$-reachable DAG on $G$, if $\vec{G}$ is a DAG and every sender can reach at least one target, and every target is reachable from at least one sender in $\vec{G}$. We say that a weakly $\mathcal{ST}$-reachable DAG $\vec{G}$ on $G$ is minimal if any proper subgraph of $\vec{G}$ is no longer a weakly $\mathcal{ST}$-reachable DAG. This DAG is a relaxed version of the original (or strongly) $\mathcal{ST}$-reachable DAG, where every target is reachable from every sender. This is because a strongly $\mathcal{ST}$-reachable DAG $G$ does not always exist; some graph has no strongly $\mathcal{ST}$-reachable DAG even in the case $|\mathcal{S}|=|\mathcal{T}|=2$. On the other hand, the proposed algorithm always constructs a weakly $\mathcal{ST}$-reachable DAG for any $|\mathcal{S}|$ and $|\mathcal{T}|$. Furthermore, the proposed algorithm is self-stabilizing; even if the constructed DAG deviates from the reachability requirement by a breakdown or exhausting the battery of a node having an arc in the DAG, this algorithm automatically reconstructs the DAG to satisfy the requirement again. The convergence time of the algorithm is $O(D)$ asynchronous rounds, where $D$ is the diameter of a given graph. We conduct small simulations to evaluate the performance of the proposed algorithm. The simulation result indicates that its execution time decreases when the number of sender nodes or target nodes is large.

A distributed system consisting of a huge number of computational entities is prone to faults, because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint-rollback recovery is a universal and representative technique for fault tolerance; it periodically records the entire system state (configuration) to non-volatile storage, and the system restores itself using the recorded configuration when the system fails. To record a configuration of a distributed system, a specific algorithm known as a snapshot algorithm is required. However, many snapshot algorithms require coordination among all nodes in the system; thus, frequent executions of snapshot algorithms require unacceptable communication cost, especially if the systems are large. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a partial snapshot (instead of a global snapshot). However, if two or more partial snapshot algorithms are concurrently executed, and their snapshot domains overlap, they should coordinate, so that the partial snapshots (taken by the algorithms) are consistent. In this paper, we propose a new efficient partial snapshot algorithm with the aim of reducing communication for the coordination. In a simulation, we show that the proposed algorithm drastically outperforms the existing partial snapshot algorithm, in terms of message and time complexity.

We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of $k$ agents with unique identifiers (IDs), and $f$ of them are weakly Byzantine agents, which behave arbitrarily except falsifying their identifiers. The agents move in synchronous rounds and cannot leave any information on nodes. If the number of nodes $n$ is given to agents, the existing fastest algorithm tolerates any number of weakly Byzantine agents and achieves gathering with simultaneous termination in $O(n^4\cdot|\Lambda_{good}|\cdot X(n))$ rounds, where $|\Lambda_{good}|$ is the length of the maximum ID of non-Byzantine agents and $X(n)$ is the number of rounds required to explore any network composed of $n$ nodes. In this paper, we ask the question of whether we can reduce the time complexity if we have a strong team, i.e., a team with a few Byzantine agents, because not so many agents are subject to faults in practice. We give a positive answer to this question by proposing two algorithms in the case where at least $4f^2+9f+4$ agents exist. Both the algorithms take the upper bound $N$ of $n$ as input. The first algorithm achieves gathering with non-simultaneous termination in $O((f+|\Lambda_{good}|)\cdot X(N))$ rounds. The second algorithm achieves gathering with simultaneous termination in $O((f+|\Lambda_{all}|)\cdot X(N))$ rounds, where $|\Lambda_{all}|$ is the length of the maximum ID of all agents. The second algorithm significantly reduces the time complexity compared to the existing one if $n$ is given to agents and $|\Lambda_{all}|=O(|\Lambda_{good}|)$ holds., Comment: 20 pages, 1 figure, 2 tables, 5 pseudo-codes

A Ti5Si3-containing multiphase MoSiBTiC alloy with a composition of 38Mo–30Ti–17Si–10C–5B (at.%) was designed and produced by arc-melting. The alloy was composed of five phases—Mo solid solution (Moss), Mo3Si, Mo5SiB2 (T2), Ti5Si3 and TiC—and consistently has good thermal stability at least up to 1700 °C. The density of the alloy was ∼7.0 g/cm3, which is considerably smaller than that of Ni-base superalloys. Microstructure was carefully examined and microstructural anisotropy was confirmed. The anisotropy was considered to be generated by thermal gradient during the solidification process. Microcracking was remarkable across the primary Ti5Si3 phase, which was caused by thermal expansion anisotropy of the Ti5Si3 phase. High-temperature deformability was examined by high-temperature compression tests at 1500 °C. Two kinds of loading axes were chosen for the compression tests with respect to the microstructural anisotropy. The alloy exhibited a peak stress of 450–550 MPa, followed by good deformability at the testing temperature. Microstructure refinement and reduction in microcrack density were observed after hot working. Oxidation tests were conducted on the alloy at 1100 °C and 1300 °C for 24 h. The oxidation curves demonstrated that rapid mass loss finished within several minutes. After that, the mass loss began to slow down and then the specimens' mass decreased almost linearly with increasing testing time. Cross-section observation indicated that oxygen propagated through Moss, whereas T2 and Ti5Si3 phases acted as barriers against oxygen attack during the tests. In addition, it was found that the alloy gained better oxidation resistance after high-temperature deformation, suggesting a positive effect of phase refinement on its high-temperature oxidation resistance.

Room-temperature fracture toughnesses of TiC-added Mo-Si-B alloys were evaluated for samples of three different compositions prepared using a conventional Ar arc-melting technique. The first alloy (TiCp) had a primary phase during solidification of NaCl-type TiC including an amount of Mo, with a Mo solid solution (Mo ss ) volume fraction of approximately 49% and a TiC volume fraction of approximately 19%, while the volume fraction of Mo 5 SiB 2 (T 2 ) was approximately 31% and the remaining 1% was Mo 2 C including an amount of Ti. The second alloy (T2p) had a primary phase of T 2 , with volume fractions of Mo ss , TiC, Mo 5 SiB 2 (T 2 ), and Mo 2 C of approximately 38%, 4%, 45%, and 13%, respectively. The third alloy (Mop) had a primary phase of Mo ss , with volume fractions of Mo ss , TiC, Mo 5 SiB 2 (T 2 ), and Mo 2 C of approximately 55%, 8%, 32%, and 6%, respectively. Room-temperature fracture toughness was evaluated by three different bending tests using Chevron-notched specimens. Fracture toughness values obtained by the three methods were relatively close with good reproducibility. Consequently, the fracture toughness values of TiCp, T2p, and Mop were evaluated to be ∼15.2 MPa(m) 1/2 , ∼10.5 MPa(m) 1/2 , and ∼13.6 MPa(m) 1/2 , respectively. Fracture surface observations indicated that the Mo ss phase is subject to severe plastic deformation during the fracture process. The TiC phase was also noted to leave river patterns behind through crack propagation. These fractographic results suggest that not only the ductile-phase toughening by the Mo ss phase but also an extra-toughening mechanism by the TiC phase are responsible for the goodness of the room-temperature fracture toughness of the MoSiBTiC alloys.

The microstructures and mechanical properties of as-cast Ti-Mo-Al alloys with various compositions were systematically investigated in this study, aiming to explore the potentials of B2-ordered phase (β 2 ) in high temperature applications. According to the experimental results, these as-cast Ti-Mo-Al alloys were mainly composed of β 2 phase and contained a large number of dislocation walls and sub-grain boundaries. Overall they exhibited a high level of compressive strength at 1073 K, with the maximum value approaching ∼879 MPa. The impressive mechanical properties of β 2 -dominating Ti-Mo-Al alloys are related to the excellent stability of B2 structure and extensive dislocation entanglements at elevated temperature.

It is argued that, in $H\ensuremath{\rightarrow}\text{invisibles}$ searches with $Z(\ensuremath{\ell}\ensuremath{\ell})H$ associated production at the LHC, the signal efficiency can be sensibly improved via a detailed study of the $Z$ boson polarization, discriminating between the signal and the dominant-irreducible $Z(\ensuremath{\ell}\ensuremath{\ell})Z(\ensuremath{\nu}\ensuremath{\nu})$ background. We first present a comprehensive polarization study, obtaining the complete set of angular coefficients ${A}_{i}$ in the Collins-Soper reference frame and identifying the dominant phenomenological effects. Then, we show the results for a realistic Monte Carlo study to $H\ensuremath{\rightarrow}\text{invisibles}$, taking the polarization analysis into account. We obtain about 20% improvement in the upper bound for the branching ratio of the Higgs boson to invisible particles, assuming $300\text{ }\text{ }{\mathrm{fb}}^{\ensuremath{-}1}$ of data at the 13 TeV LHC.

Information on spatiotemporal metabolic behavior is indispensable for a precise understanding of physiological changes and responses, including those of ripening processes and wounding stress, in fruit, but such information is still limited. Here, we visualized the spatial distribution of metabolites within tissue sections of tomato (Solanum lycopersicum L.) fruit using a matrix-assisted laser desorption/ionization–mass spectrometry imaging (MALDI–MSI) technique combined with a matrix sublimation/recrystallization method. This technique elucidated the unique distribution patterns of more than 30 metabolite-derived ions, including primary and secondary metabolites, simultaneously. To investigate spatiotemporal metabolic alterations during physiological changes at the whole-tissue level, MALDI–MSI was performed using the different ripening phenotypes of mature green and mature red tomato fruits. Although apparent alterations in the localization and intensity of many detected metabolites were not observed between the two tomatoes, the amounts of glutamate and adenosine monophosphate, umami compounds, increased in both mesocarp and locule regions during the ripening process. In contrast, malate, a sour compound, decreased in both regions. MALDI–MSI was also applied to evaluate more local metabolic responses to wounding stress. Accumulations of a glycoalkaloid, tomatine, and a low level of its glycosylated metabolite, esculeoside A, were found in the wound region where cell death had been induced. Their inverse levels were observed in non-wounded regions. Furthermore, the amounts of both compounds differed in the developmental stages. Thus, our MALDI–MSI technique increased the understanding of the physiological changes and responses of tomato fruit through the determination of spatiotemporally resolved metabolic alterations. Graphical abstractᅟ Electronic supplementary material The online version of this article (doi:10.1007/s00216-016-0118-4) contains supplementary material, which is available to authorized users.

TiC-added Mo-Si-B alloys are stably composed of Mo ss , Mo 5 SiB 2 , (Ti, Mo)C, and (Mo, Ti) 2 C phases. In the alloys, interfacial cracking mainly occurred at the interface between Mo ss and Mo 5 SiB 2 (T 2 ). Thus, other interfaces such as between Mo ss , (Ti, Mo)C and (Mo, Ti) 2 C were investigated for understanding the mechanical properties. The above three kinds of the interfaces have special atomistic structures probably favorable to the mechanical properties. At the interface of Mo ss /(Mo, Ti) 2 C, (Mo, Ti) 2 C decomposes into Mo ss and (Ti, Mo)C, and then serrated, blade-shaped interfaces are formed. The Mo ss /(Ti, Mo)C interface has an orientation relationship of (110) Mo //(111) (Ti, Mo)C . The (Ti, Mo)C/(Mo, Ti) 2 C interface forms a ledge and terrace semi-coherent structure, and its orientation relationship is (111) (Ti, Mo)C //(100) (Mo, Ti) 2 C and [0 1 ¯ 1] (Ti, Mo)C //[010] (Mo, Ti) 2 C . Therefore, Mo ss , (Ti, Mo)C and (Mo, Ti) 2 C have good coherency in the MoSiBTiC alloy. (119 words)

It is widely known that the $ZH$ production channel provides a promising probe to the $H\ensuremath{\rightarrow}b\overline{b}$ decay at the LHC, when the Higgs and the $Z$ bosons are highly boosted along the transverse direction. We show how information on the $Z$ boson polarization---that is disregarded in the current LHC analyses---can relevantly improve the signal from background discrimination, helping us to observe and achieve a larger precision for the $H\ensuremath{\rightarrow}b\overline{b}$ measurement in the $Z(\ensuremath{\ell}\ensuremath{\ell})H$ channel.

Consequences of non-standard Higgs couplings in the final-state distributions of the process $e^+_{}e^-_{} \to ZHH$ are studied. We derive an analytic expression for the differential cross section, which has in the most general case 9 non-zero functions. These functions are the coefficients of 9 angular terms, depend on the Higgs couplings, and can be experimentally measured as observables. Symmetry properties of these 9 functions are carefully discussed, and they are divided into 4 categories under CP and $\mathrm{CP\tilde{T}}$. The relations between our observables and the observables which exist in the literature are also clarified. We numerically study the dependence of our observables on the parameters in an effective Lagrangian for the Higgs couplings. It is shown that these new observables depend on most of the effective Lagrangian parameters in different ways from the total cross section. A benefit from longitudinally polarized $e^+_{}e^-_{}$ beams is also discussed.

A potato fraction library was constructed to investigate functional secondary metabolites from 8 cultivars: Kitahime, Pilka, Sakurafubuki, Atlantic, Toyoshiro, Snowden, Kitamurasaki, and Northern Ruby, which were divided into flower, leaf, stem, roots, tuber peel, and tuber. Each fraction was a semi-purified extract and about 800 fractions were prepared for the library. They were analyzed by DAD-LC/MS to obtain structural information and were evaluated for various biological activities. LC/MS data showed that each part had a specific characteristic for their constituents supported by principal component analysis (PCA). Approximately 40% of fractions showed significant biological activities at 30 μg/mL, especially the flower fractions showed strong cytotoxicity. PCAs based on the activity and LC/MS data suggested that the strong cytotoxicity of flowers was derived from a complex mixture of potato glycoalkaloids. In addition, tuber peel fractions showed strong antimalarial activity, which had not been reported before. Also, some fractions showed significant antibacterial activities. Potato fraction library was constructed to search for functional secondary metabolites. Flower and tuber-peel fractions showed potent cytotoxicity and antimalarial activity, respectively.

We consider the exploration problem with a single agent in an undirected graph. The problem requires the agent starting from an arbitrary node to explore all the nodes and edges in the graph and return to the starting node. Our goal is to minimize both the number of agent moves and the memory size of the agent, which dominate the amount of communication during the exploration. We focus on the local memory called the whiteboard of each node. There are several exploration algorithms which are very fast (i.e. the exploration is completed within a small number of agent moves such as 2m and m+3n) and do not use whiteboards. These algorithms, however, require large agent memory because the agent must keep the entire information in its memory to explore a graph. We achieve the above goal by reducing the agent memory size of such algorithms with using whiteboards. Specifically, we present two algorithms with no agent memory based on the traditional depth-first traversal and two algorithms with O(n) and O(nlog n) space of agent memory respectively based on the fastest algorithms in the literature by Panaite and Pelc [J. Alg., Vol.33 No.2, 1999].