Requirements for building information modeling based lean production management systems for construction

Smooth flow of production in construction is hampered by disparity between individual trade teams' goals and the goals of stable production flow for the project as a whole. This is exacerbated by the difficulty of visualizing the flow of work in a construction project. While the addresses some of the issues in Building information modeling provides a powerful platform for visualizing work flow in control systems that also enable pull flow and deeper collaboration between teams on and off site. The requirements for implementation of a BIM-enabled pull flow construction management software system based on the Last Planner System™, called ‘KanBIM’, have been specified, and a set of functional mock-ups of the proposed system has been implemented and evaluated in a series of three focus group workshops. The requirements cover the areas of maintenance of work flow stability, enabling negotiation and commitment between teams, lean production planning with sophisticated pull flow control, and effective communication and visualization of flow. The evaluation results show that the system holds the potential to improve work flow and reduce waste by providing both process and product visualization at the work face

Direct Manipulation-like Tools for Designing Intelligent Virtual Agents

If intelligent virtual agents are to become widely adopted it is vital that they can be designed using the user friendly graphical tools that are used in other areas of graphics. However, extending this sort of tool to autonomous, interactive behaviour, an area with more in common with artificial intelligence, is not trivial. This paper discusses the issues involved in creating user-friendly design tools for IVAs and proposes an extension of the direct manipulation methodology to IVAs. It also presents an initial implementation of this methodology

Visualization of metabolic interaction networks in microbial communities using VisANT 5.0

The complexity of metabolic networks in microbial communities poses an unresolved visualization and interpretation challenge. We address this challenge in the newly expanded version of a software tool for the analysis of biological networks, VisANT 5.0. We focus in particular on facilitating the visual exploration of metabolic interaction between microbes in a community, e.g. as predicted by COMETS (Computation of Microbial Ecosystems in Time and Space), a dynamic stoichiometric modeling framework. Using VisANT's unique metagraph implementation, we show how one can use VisANT 5.0 to explore different time-dependent ecosystem-level metabolic networks. In particular, we analyze the metabolic interaction network between two bacteria previously shown to display an obligate cross-feeding interdependency. In addition, we illustrate how a putative minimal gut microbiome community could be represented in our framework, making it possible to highlight interactions across multiple coexisting species. We envisage that the "symbiotic layout" of VisANT can be employed as a general tool for the analysis of metabolism in complex microbial communities as well as heterogeneous human tissues.This work was supported by the National Institutes of Health, R01GM103502-05 to CD, ZH and DS. Partial support was also provided by grants from the Office of Science (BER), U.S. Department of Energy (DE-SC0004962), the Joslin Diabetes Center (Pilot & Feasibility grant P30 DK036836), the Army Research Office under MURI award W911NF-12-1-0390, National Institutes of Health (1RC2GM092602-01, R01GM089978 and 5R01DE024468), NSF (1457695), and Defense Advanced Research Projects Agency Biological Technologies Office (BTO), Program: Biological Robustness In Complex Settings (BRICS), Purchase Request No. HR0011515303, Program Code: TRS-0 Issued by DARPA/CMO under Contract No. HR0011-15-C-0091. Funding for open access charge: National Institutes of Health. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. (R01GM103502-05 - National Institutes of Health; 1RC2GM092602-01 - National Institutes of Health; R01GM089978 - National Institutes of Health; 5R01DE024468 - National Institutes of Health; DE-SC0004962 - Office of Science (BER), U.S. Department of Energy; P30 DK036836 - Joslin Diabetes Center; W911NF-12-1-0390 - Army Research Office under MURI; 1457695 - NSF; HR0011515303 - Defense Advanced Research Projects Agency Biological Technologies Office (BTO), Program: Biological Robustness In Complex Settings (BRICS); HR0011-15-C-0091 - DARPA/CMO; National Institutes of Health)Published versio

Agent-Based Simulations of Blockchain protocols illustrated via Kadena's Chainweb

While many distributed consensus protocols provide robust liveness and consistency guarantees under the presence of malicious actors, quantitative estimates of how economic incentives affect security are few and far between. In this paper, we describe a system for simulating how adversarial agents, both economically rational and Byzantine, interact with a blockchain protocol. This system provides statistical estimates for the economic difficulty of an attack and how the presence of certain actors influences protocol-level statistics, such as the expected time to regain liveness. This simulation system is influenced by the design of algorithmic trading and reinforcement learning systems that use explicit modeling of an agent's reward mechanism to evaluate and optimize a fully autonomous agent. We implement and apply this simulation framework to Kadena's Chainweb, a parallelized Proof-of-Work system, that contains complexity in how miner incentive compliance affects security and censorship resistance. We provide the first formal description of Chainweb that is in the literature and use this formal description to motivate our simulation design. Our simulation results include a phase transition in block height growth rate as a function of shard connectivity and empirical evidence that censorship in Chainweb is too costly for rational miners to engage in. We conclude with an outlook on how simulation can guide and optimize protocol development in a variety of contexts, including Proof-of-Stake parameter optimization and peer-to-peer networking design.Comment: 10 pages, 7 figures, accepted to the IEEE S&B 2019 conferenc

Robust Cooperative Manipulation without Force/Torque Measurements: Control Design and Experiments

This paper presents two novel control methodologies for the cooperative manipulation of an object by N robotic agents. Firstly, we design an adaptive control protocol which employs quaternion feedback for the object orientation to avoid potential representation singularities. Secondly, we propose a control protocol that guarantees predefined transient and steady-state performance for the object trajectory. Both methodologies are decentralized, since the agents calculate their own signals without communicating with each other, as well as robust to external disturbances and model uncertainties. Moreover, we consider that the grasping points are rigid, and avoid the need for force/torque measurements. Load distribution is also included via a grasp matrix pseudo-inverse to account for potential differences in the agents' power capabilities. Finally, simulation and experimental results with two robotic arms verify the theoretical findings

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

MIMO-OFDM Based Energy Harvesting Cooperative Communications Using Coalitional Game Algorithm

This document is the Accepted Manuscript version. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.In this paper, we consider the problem of cooperative communication between relays and base station in an advanced MIMO-OFDM framework, under the assumption that the relays are supplied by electric power drawn from energy harvesting (EH) sources. In particular, we focus on the relay selection, with the goal to guarantee the required performance in terms of capacity. In order to maximize the data throughput under the EH constraint, we model the transmission scheme as a non-transferable coalition formation game, with characteristic function based on an approximated capacity expression. Then, we introduce a powerful mathematical tool inherent to coalitional game theory, namely: the Shapley value (Sv) to provide a reliable solution concept to the game. The selected relays will form a virtual dynamically-configuredMIMO network that is able to transmit data to destination using efficient space-time coding techniques. Numerical results, obtained by simulating the EH-powered cooperativeMIMO-OFDMtransmission with Algebraic Space-Time Coding (ASTC), prove that the proposed coalitional game-based relay selection allows to achieve performance very close to that obtained by the same system operated by guaranteed power supply. The proposed methodology is finally compared with some recent related state-of-the-art techniques showing clear advantages in terms of link performance and goodput.Peer reviewe