Air Quality-Related Health and Environmental Trade-off of Electrification: Evidence from Vietnam

Abundant evidence has shown that expanding access to electricity dramat- ically widens access to education, healthcare, and equality. However, the liter- ature on the direct impacts of electrification on air quality and health is still in its infancy. While electricity access can lead to higher outdoor air pollution due to increased reliance on fossil fuel combustion, its usage lowers indoor air pollution as households switch from burning solid fuels to using electricity and become distanced from the source of pollution. Contributing to the nascent lit- erature, this article represents the first quantitative examination of this trade- off between the overall emission level and the degree of population exposure to pollution due to electrification. The study draws on the representative Vietnam Household Living Standards Surveys to examine environmental and health out- comes and estimates a satellite-based measure of commune electrification rate using the DMSP/OLS nighttime satellite images and Landscan population grid. I find that although electrification increases the probability that air pollution is among the most pressing environmental issues in a commune, it reduces the probability that a commune reports air quality-related illnesses as one of its top three main health concerns. Thus, as hypothesized, this paper presents ev- idence that electrification alleviates air pollution-related health problems even as it worsens outdoor air quality

Sustainable Symbiotic Relationship in The Human Ecosystem in The Development of Public Spaces (Case of Hanoi Historical Inner-City Area)

In the last few years, the concept of the Human Ecosystem has been mentioned a lot frequently in Urban Environments related to social and natural ecosystems. The organization of public spaces cannot help but affect the relationships between human and natural ecology, economy, and culture. Perhaps the human activities have compromised the ecosystem so those relationships can be easily broken down. But it can also be enriched, or recovered from failures by establishing Symbiotic Relationships between natural, economic, and cultural elements in urban ecosystems. The research presents theoretical issues of Human Ecosystems in public space organization and specific applications in the case of Hanoi historical inner-city areas. It focuses on discussing theories of the structure and morphology of Human Ecosystems, the human behavior, the relationship between community behaviors, natural environment, and architecture of public spaces, to organize, enrich, and balance the service ecosystem of public spaces. These features are considered vital by the author in contributing to the preservation of natural resources, urban architectural heritage, creating architectural spaces and planning of public spaces towards ecological and green urban development

Towards Developing the Smart Cultural Heritage Management of the French Colonial Villas in Hanoi, Vietnam

Hanoi city was formed and inherited a unique urban heritage. Among them are the French-colonial Villas, which were constructed in the pre–1954 period. During the development process, the local government and community have always paid special attention to these heritage sites and organized many conservation and research activities. However, the management and preservation of these sites are still facing many challenges under pressure from urbanization, environmental impact, leading to the risk of being invaded and destroyed. The objective of this paper is to discuss the potential of developing the management strategy for French colonial villas in Hanoi within contemporary society using the concept of the Smart Cultural Heritage. The authors believe that will support various cultural services as well as promoting and preserving cultural heritage. It does so by presenting the results of the survey of the status of villas in the French period in Hanoi to classify and evaluate establish the regulation of use management and value conservation, build up the Big Data system. At the same time, the proposal will use smart platforms and participatory processes to encourage community access to raise awareness and assess the villas' value

NITRIFICATION TREATMENT OF AMMONIUM POLLUTED HANOI GROUNDWATER USING A SWIM-BED TECHNOLOGY

Joint Research on Environmental Science and Technology for the Eart

Model Checking of Robot Gathering

Recent advances in distributed computing highlight models and algorithms for autonomous mo- bile robots that self-organize and cooperate together in order to solve a global objective. As results, a large number of algorithms have been proposed. These algorithms are given together with proofs to assess their correctness. However, those proofs are informal, which are error prone. This paper presents our study on formal verification of mobile robot algorithms. We first propose a formal model for mobile robot algorithms on anonymous ring shape network under multiplicity and asynchrony assumptions. We specify this formal model in Maude, a specification and pro- gramming language based on rewriting logic. We then use its model checker to formally verify an algorithm for robot gathering problem on ring enjoys some desired properties. As the result of the model checking, counterexamples have been found. We detect the sources of some unforeseen design errors. We, furthermore, give our interpretations of these errors

A More Faithful Formal Definition of the Desired Property for Distributed Snapshot Algorithms to Model Check the Property

The first distributed snapshot algorithm was invented by Chandy and Lamport: Chandy-Lamport distributed snapshot algorithm (CLDSA). Distributed snapshot algorithms are crucial components to make distributed systems fault tolerant. Such algorithms are extremely important because many modern key software systems are in the form of distributed systems and should be fault tolerant. There are at least two desired properties such algorithms should satisfy: 1) the distributed snapshot reachability property (called the DSR property) and 2) the ability to run concurrently with, but not alter, an underlying distributed system (UDS). This paper identifies subtle errors in a paper on formalization of the DSR property and shows how to correct them. We give a more faithful formal definition of the DSR property; the definition involves two state machines - one state machine M_UDS that formalizes a UDS and the other M_CLDSA that formalizes the UDS on which CLDSA is superimposed (UDS-CLDSA) - and can be used to more precise model checking of the DSR property for CLDSA. We also prove a theorem on equivalence of our new definition and an existing one that only involves M_CLDSA to guarantee the validity of the existing model checking approach. Moreover, we prove the second property, namely that CLDSA does not alter the behaviors of UDS

Meta-APL: a general language for agent programming

A key advantage of BDI-based agent programming is that agents can deliberate about which course of action to adopt to achieve a goal or respond to an event. However while state-of-the-art BDI-based agent programming languages provide flexible support for expressing plans, they are typically limited to a single, hard-coded, deliberation strategy(perhaps with some parameterisation) for all task environments. In this thesis, we describe a novel agent programming language, meta-APL, that allows both agent programs and the agent’s deliberation strategy to be encoded in the same programming language. Key steps in the execution cycle of meta-APL are reflected in the state of the agent and can be queried and updated by meta-APL rules, allowing a wide range of BDI deliberation strategies to be programmed. We give the syntax and the operational semantics of meta-APL, focussing on the connections between the agent’s state and its implementation. Finally, to illustrate the flexibility of meta-APL, we show how Jason and 3APL programs and deliberation strategy can be translated into meta-APL to give equivalent behaviour under weak bisimulation equivalence

DENITIRIFICATION TREATMENT OF NITRIFIED HANOI GROUNDWATER USING SWIM BED TECHNOLOGY

Joint Research on Environmental Science and Technology for the Eart

Verifying heterogeneous multi-agent programs

We present a new approach to verifying heterogeneous multi-agent programs — multi-agent systems in which the agents are implemented in different (BDI-based) agent programming languages. Our approach is based on meta-APL, a BDI-based agent programming language that allows both an agent’s plans and its deliberation strategy to be encoded as part of the agent program. The agent programs comprising a heterogeneous multi-agent program are first translated into meta-APL, and the resulting system is then verified using the Maude term rewriting system. We prove correctness of translations of Jason and 3APL programs and deliberation strategies into meta-APL. Preliminary experimental results indicate that our approach can significantly out-perform previous approaches to verification of heterogeneous multi-agent programs

Meta-APL: a general language for agent programming

A key advantage of BDI-based agent programming is that agents can deliberate about which course of action to adopt to achieve a goal or respond to an event. However while state-of-the-art BDI-based agent programming languages provide flexible support for expressing plans, they are typically limited to a single, hard-coded, deliberation strategy(perhaps with some parameterisation) for all task environments. In this thesis, we describe a novel agent programming language, meta-APL, that allows both agent programs and the agent’s deliberation strategy to be encoded in the same programming language. Key steps in the execution cycle of meta-APL are reflected in the state of the agent and can be queried and updated by meta-APL rules, allowing a wide range of BDI deliberation strategies to be programmed. We give the syntax and the operational semantics of meta-APL, focussing on the connections between the agent’s state and its implementation. Finally, to illustrate the flexibility of meta-APL, we show how Jason and 3APL programs and deliberation strategy can be translated into meta-APL to give equivalent behaviour under weak bisimulation equivalence