Graphical models for interactive POMDPs: representations and solutions

We develop new graphical representations for the problem of sequential decision making in partially observable multiagent environments, as formalized by interactive partially observable Markov decision processes (I-POMDPs). The graphical models called interactive influence diagrams (I-IDs) and their dynamic counterparts, interactive dynamic influence diagrams (I-DIDs), seek to explicitly model the structure that is often present in real-world problems by decomposing the situation into chance and decision variables, and the dependencies between the variables. I-DIDs generalize DIDs, which may be viewed as graphical representations of POMDPs, to multiagent settings in the same way that I-POMDPs generalize POMDPs. I-DIDs may be used to compute the policy of an agent given its belief as the agent acts and observes in a setting that is populated by other interacting agents. Using several examples, we show how I-IDs and I-DIDs may be applied and demonstrate their usefulness. We also show how the models may be solved using the standard algorithms that are applicable to DIDs. Solving I-DIDs exactly involves knowing the solutions of possible models of the other agents. The space of models grows exponentially with the number of time steps. We present a method of solving I-DIDs approximately by limiting the number of other agents’ candidate models at each time step to a constant. We do this by clustering models that are likely to be behaviorally equivalent and selecting a representative set from the clusters. We discuss the error bound of the approximation technique and demonstrate its empirical performance.     

NodeWiz: Fault-tolerant grid information service

Large scale grid computing systems may provide multitudinous services, from different providers, whose quality of service will vary. Moreover, services are deployed and undeployed in the grid with no central coordination. Thus, to find out the most suitable service to fulfill their needs, or to find the most suitable set of resources on which to deploy their services, grid users must resort to a Grid Information Service (GIS). This service allows users to submit rich queries that are normally composed of multiple attributes and range operations. The ability to efficiently execute complex searches in a scalable and reliable way is a key challenge for current GIS designs. Scalability issues are normally dealt with by using peer-to-peer technologies. However, the more reliable peer-to-peer approaches do not cater for rich queries in a natural way. On the other hand, approaches that can easily support these rich queries are less robust in the presence of failures. In this paper we present the design of NodeWiz, a GIS that allows multi-attribute range queries to be performed efficiently in a distributed manner, while maintaining load balance and resilience to failures.     

Error compensation in machine tools: a neural network approach

For a non-idealized machine tool, each point in the workspace is associated with a tool point positioning error vector. If this error map can be determined, then it is possible to substantially improve the positioning performance of the machine by introducing suitable compensation into the control loop. This paper explores the possibility of using an artifical neural network (ANN) to compute this mapping. The training set for the ANN is obtained by mounting a physical artifact whose dimensions are precisely known in the machine's workspace. The machine, equipped with a touch trigger probe, measures the positions of features on the artifact. The difference between the machine reading and the known dimension is the machine error at that point in the workspace. Using standard modeling techniques, the kinematic error model for a CNC turning center was developed. This model was parameterized by measurement of the parametric error functions using a laser interferometer, electronic levels and a precision square. The kinematic model was then used to simulate the artifact-measuring process and develop the ANN training set. The effect of changing artifact geometry was explored and a machining operation was simulated using the ANN output to provide compensation. The results show that the ANN is capable of learning the error map of a real machine, and that ANN-based compensation can significantly reduce part-dimensional errors.     

ENROUTE: An Entropy Aware Routing Scheme for Information-Centric Networks (ICN)

With the exponential growth of end users and web data, the internet is undergoing the change of paradigm from a user-centric model to a content-centric one, popularly known as information-centric networks (ICN). Current ICN research evolves around three key-issues namely (i) content request searching, (ii) content routing, and (iii) in-network caching scheme to deliver the requested content to the end user. This would improve the user experience to obtain requested content because it lowers the download delay and provides higher throughput. Existing researches have mainly focused on on-path congestion or expected delivery time of a content to determine the optimized path towards custodian. However, it ignores the cumulative effect of the link-state parameters and the state of the cache, and consequently it leads to degrade the delay performance. In order to overcome this shortfall, we consider both the congestion of a link and the state of on-path caches to determine the best possible routes. We introduce a generic term entropy to quantify the effects of link congestion and state of on-path caches. Thereafter, we develop a novel entropy dependent algorithm namely ENROUTE for searching of content request triggered by any user, routing of this content, and caching for the delivery this requested content to the user. The entropy value of an intra-domain node indicates how many popular contents are already cached in the node, which, in turn, signifies the degree of enrichment of that node with the popular contents. On the other hand, the entropy for a link indicates how much the link is congested with the traversal of contents. In order to have reduced delay, we enhance the entropy of caches in nodes, and also use path with low entropy for downloading contents. We evaluate the performance of our proposed ENROUTE algorithm against state-of-the-art schemes for various network parameters and observe an improvement of 29–52% in delay, 12–39% in hit rate, and 4–39% in throughput.

     

Reliable before-fabrication forecasting of MEMS piezoresistive pressure sensor: mathematical modelling and numerical simulation

Microsystem Technologies - Micro-mechanical systems (MEMS) based piezoresistive pressure sensors have significant importance in several pressure sensor devices in real world, i.e., aviation, IoT...     

Taming the killer in the kitchen: mitigating household air pollution from solid-fuel cookstoves through building design

In this study, we attempt to mitigate household air pollution (HAP) through improved kitchen design. Field surveys were conducted in ten kitchens of rural western India, which were then modelled and simulated for dynamic indoor airflow network analysis. The simulated results were statistically clustered using principal component analysis and hierarchical agglomerative clustering, to construct a cumulative built environment parameter called ‘Built Factor’ for each kitchen, and subsequently a derivative matrix was developed. Categorization of better performing kitchens from this derivative matrix enabled in deriving the built parameter thresholds for a ‘better’ kitchen design. This derived kitchen showed 60 % reduction in PM2.5 peak concentration during cooking hours. The evaluation described here is essentially a “proof of concept”, that effective building design can be an alternative way to reduce HAP without the introduction of chimneys, improved cookstoves or shifting to cleaner fuel.     

All‐Organic Dual Spin Valves with Well‐Resolved Four Resistive‐States

The formation of all‐organic dual spin valves (DSVs) with three organic spin‐selective layers, that is, spin‐injection, spin‐detection, and an additional spin‐filtering layer at the intermediate, is reported. As spin‐selective layers, manganese‐ and cobalt phthalocyanines, which are well‐known single‐molecule magnets, are used in their immobilized forms, so that all‐organic DSVs can be prefabricated for characterization. The three spin‐selective layers have provided four configurations with at most two spin‐flip interfaces enforcing spin‐flipping at the two nonmagnetic organic spacer layers, for which copper phthalocyanine is used. Since a couple of the four configurations have exhibited similar resistivities, the degeneracy in the resistive‐states is broken through asymmetric spin‐injection and spin‐detection layers and also through asymmetric thickness of the nonmagnetic spacer layers. When both the spin‐flip interfaces are made operative independently, a 2‐bit logic with four distinct resistive states can be achieved.     

Life cycle energy and carbon footprint analysis of photovoltaic battery microgrid system in India

Electricity supply in India is from a centralized grid. Many parts of the country experience grid interruptions. Life cycle energy and environmental analysis has been done for a 27 kWp photovoltaic system which acts as grid backup for 3 h outage in an Indian urban residential scenario. This paper discusses energy requirements and carbon emission for a PV storage system for five different battery technologies in Indian context. This can be used as a metric for comparative analysis for new batteries, with an undeveloped market. The energy requirements for the components are quantified and are compared in terms of energy payback time (EPBT) and Net Energy Ratio (NER). All the calculations are done for Indian context. EPBT is found to be in the range of 2–4.5 years for all the systems, while NER is in the range of 6.6–2.52. NaS has the highest emission factor of 0.67 kgCO₂/kWh and the least for NiCd (0.091 kgCO₂/kWh). These factors can be used to select a PV battery option and to target selection of materials and systems based on the reported values.