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.     

Robust named entity detection from optical character recognition output

In this paper, we focus on information extraction from optical character recognition (OCR) output. Since the content from OCR inherently has many errors, we present robust algorithms for information extraction from OCR lattices instead of merely looking them up in the top-choice (1-best) OCR output. Specifically, we address the challenge of named entity detection in noisy OCR output and show that searching for named entities in the recognition lattice significantly improves detection accuracy over 1-best search. While lattice-based named entity (NE) detection improves NE recall from OCR output, there are two problems with this approach: (1) the number of false alarms can be prohibitive for certain applications and (2) lattice-based search is computationally more expensive than 1-best NE lookup. To mitigate the above challenges, we present techniques for reducing false alarms using confidence measures and for reducing the amount of computation involved in performing the NE search. Furthermore, to demonstrate that our techniques are applicable across multiple domains and languages, we experiment with optical character recognition systems for videotext in English and scanned handwritten text in Arabic.     

Detection and quantification of valve stiction by the method of unknown input estimation

Valve stiction is one of the most common causes of oscillations in industrial process control loops. Such oscillations can degrade the overall performance of the loop and eventually the final product quality. The detection and quantification of valve stiction in industrial process control loops is thus important. From previous studies in the literature, a sticky valve has been shown to have a distinct signature of the stiction phenomena in its valve positioner data. However, the position of the modulating control valves is seldom available. We consider the problem of estimating the valve position as an unknown input estimation problem. In this work, we propose a novel application of the unknown input estimator in order to estimate the valve position given the process model and the data of the process variable and controller output. Using the estimated valve position, we can detect and also quantify the amount of stiction. We demonstrate the efficacy of the method through simulation examples where a sticky valve is deliberately introduced in the closed loop using a two-parameter stiction model available in the literature. Application of the proposed methodology to a laboratory scale flow control loop is presented. An industrial case study is also presented in which the algorithm accurately detects and quantifies stiction in the level control loop of a power plant.     

FMS scheduling with knowledge based genetic algorithm approach

In this paper a complex scheduling problem in flexible manufacturing system (FMS) has been addressed with a novel approach called knowledge based genetic algorithm (KBGA). The literature review indicates that meta-heuristics may be used for combinatorial decision-making problem in FMS and simple genetic algorithm (SGA) is one of the meta-heuristics that has attracted many researchers. This novel approach combines KB (which uses the power of tacit and implicit expert knowledge) and inherent quality of SGA for searching the optima simultaneously. In this novel approach, the knowledge has been used on four different stages of SGA: initialization, selection, crossover, and mutation. Two objective functions known as throughput and mean flow time, have been taken to measure the performance of the FMS. The usefulness of the algorithm has been measured on the basis of number of generations used for achieving better results than SGA. To show the efficacy of the proposed algorithm, a numerical example of scheduling data set has been tested. The KBGA was also tested on 10 different moderate size of data set to show its robustness for large sized problems involving flexibility (that offers multiple options) in FMS.     

A virtual RV-M1 robot system

Exploring a virtual model under simulated environments is the best way to learn about a real system. This is particularly true in robotics where it is quite expensive to provide the system to each individual. The interdisciplinary area of robotics is being studied commonly in various fields like electrical, computer, mechanical engineering, nanotechnology, etc. A virtual robot system can help one fully understand the controls and working of a robot. The system may also be helpful to design the path and plan the trajectory of a robot in an industrial environment or other robotics application. Virtual model of RV-M1 robot has been developed in the MATLAB environment. The virtual system performs forward kinematics and inverse kinematics in addition to providing a simulation of the robot teachbox.     

Automated process planning method to machine A B-Spline free-form feature on a mill–turn center

In this paper, we present a methodology for automating the process planning and NC code generation for a widely encountered class of free-form features that can be machined on a 3-axis mill–turn center. The free-form feature family that is considered is that of extruded protrusions whose cross-section is a closed, periodic B-Spline curve. In this methodology, for machining a part with B-Spline protrusion located at the free end, the part is first rough turned to the maximum profile diameter of the B-Spline, followed by rough profile cutting and finish profiling with axially mounted end mill tools. The identification and sequencing of machining volumes is completely automated, as is the generation of actual NC code. The approach supports both convex and non-convex profiles. In the case of non-convex profiles, the process planning algorithm ensures that there is no gouging of the work piece by the tool. The algorithm also identifies when sections of the tool path lie outside the work piece and utilizes rapid traverses in these regions to reduce cutting time. This methodology presents an integrated turn–mill process planning where by making the process fully automated from design with no user intervention making the overall process planning efficient. The algorithm was tested on several examples and test parts using the unmodified NC code obtained from the implementation were run on a Moriseiki mill–turn center. The parts that were produced met the dimensional specifications of the desired part.     

Worst-case optimal algorithm for XPath evaluation over XML streams

We consider the XPath evaluation problem: Evaluate an XPath query Q on a streaming XML document D; i.e., determine the set Q(D) of document elements selected by Q. We mainly consider Conjunctive XPath queries that involve only the child and descendant axes. Previously known in-memory algorithms for this problem use O(|D|) space and O(|Q||D|) time. Several previously known algorithms for the streaming version use Ω(dn) space and Ω(dn|D|) time in the worst case; d denotes the depth of D, and n denotes the number of location steps in Q. Their exponential space requirement could well exceed the O(|D|) space used by the in-memory algorithms. We present an efficient algorithm that uses O(d|Q|+nc) space and O((|Q|+dn)|D|) time in the worst case; c denotes the maximum number of elements of D that can be candidates for output, at any one instant. For some worst case Q and D, the memory space used by our algorithm matches our lower bound proved in a different paper; so, our algorithm uses optimal memory space in the worst case.     

A survey and taxonomy on energy efficient resource allocation techniques for cloud computing systems

In a cloud computing paradigm, energy efficient allocation of different virtualized ICT resources (servers, storage disks, and networks, and the like) is a complex problem due to the presence of heterogeneous application (e.g., content delivery networks, MapReduce, web applications, and the like) workloads having contentious allocation requirements in terms of ICT resource capacities (e.g., network bandwidth, processing speed, response time, etc.). Several recent papers have tried to address the issue of improving energy efficiency in allocating cloud resources to applications with varying degree of success. However, to the best of our knowledge there is no published literature on this subject that clearly articulates the research problem and provides research taxonomy for succinct classification of existing techniques. Hence, the main aim of this paper is to identify open challenges associated with energy efficient resource allocation. In this regard, the study, first, outlines the problem and existing hardware and software-based techniques available for this purpose. Furthermore, available techniques already presented in the literature are summarized based on the energy-efficient research dimension taxonomy. The advantages and disadvantages of the existing techniques are comprehensively analyzed against the proposed research dimension taxonomy namely: resource adaption policy, objective function, allocation method, allocation operation, and interoperability.     

Modelling microtubules in the brain as n-qudit quantum Hopfield network and beyond

The scientific approach to understand the nature of consciousness revolves around the study of the human brain. Neurobiological studies that compare the nervous system of different species have accorded the highest place to humans on account of various factors that include a highly developed cortical area comprising of approximately 100 billion neurons, that are intrinsically connected to form a highly complex network. Quantum theories of consciousness are based on mathematical abstraction and the Penrose–Hameroff Orch-OR theory is one of the most promising ones. Inspired by the Penrose–Hameroff Orch-OR theory, Behrman et al. have simulated a quantum Hopfield neural network with the structure of a microtubule. They have used an extremely simplified model of the tubulin dimers with each dimer represented simply as a qubit, a single quantum two-state system. The extension of this model to n-dimensional quantum states or n-qudits presented in this work holds considerable promise for even higher mathematical abstraction in modelling consciousness systems.