Efficient solutions to factored MDPs with imprecise transition probabilities

When modeling real-world decision-theoretic planning problems in the Markov Decision Process (MDP) framework, it is often impossible to obtain a completely accurate estimate of transition probabilities. For example, natural uncertainty arises in the transition specification due to elicitation of MOP transition models from an expert or estimation from data, or non-stationary transition distributions arising from insufficient state knowledge. In the interest of obtaining the most robust policy under transition uncertainty, the Markov Decision Process with Imprecise Transition Probabilities (MDP-IPs) has been introduced to model such scenarios. Unfortunately, while various solution algorithms exist for MDP-IPs, they often require external calls to optimization routines and thus can be extremely time-consuming in practice. To address this deficiency, we introduce the factored MDP-IP and propose efficient dynamic programming methods to exploit its structure. Noting that the key computational bottleneck in the solution of factored MDP-IPs is the need to repeatedly solve nonlinear constrained optimization problems, we show how to target approximation techniques to drastically reduce the computational overhead of the nonlinear solver while producing bounded, approximately optimal solutions. Our results show up to two orders of magnitude speedup in comparison to traditional ""flat"" dynamic programming approaches and up to an order of magnitude speedup over the extension of factored MDP approximate value iteration techniques to MDP-IPs while producing the lowest error of any approximation algorithm evaluated. (C) 2011 Elsevier B.V. All rights reserved.

Efficient solutions to robust, semi-implicit discretizations of the immersed boundary method

The immersed boundary method is a versatile tool for the investigation of flow-structure interaction. In a large number of applications, the immersed boundaries or structures are very stiff and strong tangential forces on these interfaces induce a well-known, severe time-step restriction for explicit discretizations. This excessive stability constraint can be removed with fully implicit or suitable semi-implicit schemes but at a seemingly prohibitive computational cost. While economical alternatives have been proposed recently for some special cases, there is a practical need for a computationally efficient approach that can be applied more broadly. In this context, we revisit a robust semi-implicit discretization introduced by Peskin in the late 1970s which has received renewed attention recently. This discretization, in which the spreading and interpolation operators are lagged. leads to a linear system of equations for the inter-face configuration at the future time, when the interfacial force is linear. However, this linear system is large and dense and thus it is challenging to streamline its solution. Moreover, while the same linear system or one of similar structure could potentially be used in Newton-type iterations, nonlinear and highly stiff immersed structures pose additional challenges to iterative methods. In this work, we address these problems and propose cost-effective computational strategies for solving Peskin`s lagged-operators type of discretization. We do this by first constructing a sufficiently accurate approximation to the system`s matrix and we obtain a rigorous estimate for this approximation. This matrix is expeditiously computed by using a combination of pre-calculated values and interpolation. The availability of a matrix allows for more efficient matrix-vector products and facilitates the design of effective iterative schemes. We propose efficient iterative approaches to deal with both linear and nonlinear interfacial forces and simple or complex immersed structures with tethered or untethered points. One of these iterative approaches employs a splitting in which we first solve a linear problem for the interfacial force and then we use a nonlinear iteration to find the interface configuration corresponding to this force. We demonstrate that the proposed approach is several orders of magnitude more efficient than the standard explicit method. In addition to considering the standard elliptical drop test case, we show both the robustness and efficacy of the proposed methodology with a 2D model of a heart valve. (C) 2009 Elsevier Inc. All rights reserved.

Low Complexity Intra Mode Selection for Efficient Distributed Video Coding

Motion compensated frame interpolation (MCFI) is one of the most efficient solutions to generate side information (SI) in the context of distributed video coding. However, it creates SI with rather significant motion compensated errors for some frame regions while rather small for some other regions depending on the video content. In this paper, a low complexity Infra mode selection algorithm is proposed to select the most 'critical' blocks in the WZ frame and help the decoder with some reliable data for those blocks. For each block, the novel coding mode selection algorithm estimates the encoding rate for the Intra based and WZ coding modes and determines the best coding mode while maintaining a low encoder complexity. The proposed solution is evaluated in terms of rate-distortion performance with improvements up to 1.2 dB regarding a WZ coding mode only solution.

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.

The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved since the advent of the first interpreters. However, higher inference speeds are still required in order to meet the demands of applications such as those contemplated for next generation computer systems. The execution of logic programs in parallel is currently considered a promising strategy for attaining such inference speeds. Logic Programming in turn appears as a suitable programming paradigm for parallel architectures because of the many opportunities for parallel execution present in the implementation of logic programs. This dissertation presents an efficient parallel execution model for logic programs. The model is described from the source language level down to an "Abstract Machine" level suitable for direct implementation on existing parallel systems or for the design of special purpose parallel architectures. Few assumptions are made at the source language level and therefore the techniques developed and the general Abstract Machine design are applicable to a variety of logic (and also functional) languages. These techniques offer efficient solutions to several areas of parallel Logic Programming implementation previously considered problematic or a source of considerable overhead, such as the detection and handling of variable binding conflicts in AND-Parallelism, the specification of control and management of the execution tree, the treatment of distributed backtracking, and goal scheduling and memory management issues, etc. A parallel Abstract Machine design is offered, specifying data areas, operation, and a suitable instruction set. This design is based on extending to a parallel environment the techniques introduced by the Warren Abstract Machine, which have already made very fast and space efficient sequential systems a reality. Therefore, the model herein presented is capable of retaining sequential execution speed similar to that of high performance sequential systems, while extracting additional gains in speed by efficiently implementing parallel execution. These claims are supported by simulations of the Abstract Machine on sample programs.

Robust solutions to multi-objective linear programs with uncertain data

In this paper we examine multi-objective linear programming problems in the face of data uncertainty both in the objective function and the constraints. First, we derive a formula for the radius of robust feasibility guaranteeing constraint feasibility for all possible scenarios within a specified uncertainty set under affine data parametrization. We then present numerically tractable optimality conditions for minmax robust weakly efficient solutions, i.e., the weakly efficient solutions of the robust counterpart. We also consider highly robust weakly efficient solutions, i.e., robust feasible solutions which are weakly efficient for any possible instance of the objective matrix within a specified uncertainty set, providing lower bounds for the radius of highly robust efficiency guaranteeing the existence of this type of solutions under affine and rank-1 objective data uncertainty. Finally, we provide numerically tractable optimality conditions for highly robust weakly efficient solutions.

Efficient Control in Multistage Stochastic Optimization Problem

AMS subject classification: 90C31, 90A09, 49K15, 49L20.

DESIGN OF EFFICIENT IN-NETWORK DATA PROCESSING AND DISSEMINATION FOR VANETS

By providing vehicle-to-vehicle and vehicle-to-infrastructure wireless communications, vehicular ad hoc networks (VANETs), also known as the “networks on wheels”, can greatly enhance traffic safety, traffic efficiency and driving experience for intelligent transportation system (ITS). However, the unique features of VANETs, such as high mobility and uneven distribution of vehicular nodes, impose critical challenges of high efficiency and reliability for the implementation of VANETs. This dissertation is motivated by the great application potentials of VANETs in the design of efficient in-network data processing and dissemination. Considering the significance of message aggregation, data dissemination and data collection, this dissertation research targets at enhancing the traffic safety and traffic efficiency, as well as developing novel commercial applications, based on VANETs, following four aspects: 1) accurate and efficient message aggregation to detect on-road safety relevant events, 2) reliable data dissemination to reliably notify remote vehicles, 3) efficient and reliable spatial data collection from vehicular sensors, and 4) novel promising applications to exploit the commercial potentials of VANETs. Specifically, to enable cooperative detection of safety relevant events on the roads, the structure-less message aggregation (SLMA) scheme is proposed to improve communication efficiency and message accuracy. The scheme of relative position based message dissemination (RPB-MD) is proposed to reliably and efficiently disseminate messages to all intended vehicles in the zone-of-relevance in varying traffic density. Due to numerous vehicular sensor data available based on VANETs, the scheme of compressive sampling based data collection (CS-DC) is proposed to efficiently collect the spatial relevance data in a large scale, especially in the dense traffic. In addition, with novel and efficient solutions proposed for the application specific issues of data dissemination and data collection, several appealing value-added applications for VANETs are developed to exploit the commercial potentials of VANETs, namely general purpose automatic survey (GPAS), VANET-based ambient ad dissemination (VAAD) and VANET based vehicle performance monitoring and analysis (VehicleView). Thus, by improving the efficiency and reliability in in-network data processing and dissemination, including message aggregation, data dissemination and data collection, together with the development of novel promising applications, this dissertation will help push VANETs further to the stage of massive deployment.

Morphological investigations of supported titania photocatalysts

Due in no small part to an increasing need to augment existing water purification strategies, the synthesis of titania photocatalysts has been under considerable examination. However, in order to make the use of titania photocatalysts commercially viable there needs to be an increase in the efficiency of the catalysts while decreasing the potential toxicity. Due to its high porosity and novel optical properties, inverse opal titania derived from colloidal crystal templating offers one of the most efficient solutions. While a number of synthesis methods for inverse opal titania have been presented in the literature, the co�]deposition method offers the most effective method of generating the relative large areas of inverse opal material. The factors which affect the codeposition method and the mechanism by which titania inverse opals form in general remain relatively unstudied. This manuscript presents an examination of the morphology of inverse opals generated by the co�]deposition method while proposing a mechanism by which the inverse structures form.

Evaluation of green public road procurement in Australia : current practices and gaps to fill

Public road authorities have a key responsibility in driving initiatives for reducing greenhouse gas (GHG) emissions in the road construction project lifecycle. A coherent and efficient chain of procurement processes and methods is needed to convert green policies into tangible actions that capture the potential for GHG reduction. Yet, many infrastructure clients lack developed methodologies regarding green procurement practices. Designing more efficient solutions for green procurement requires an evaluation of the current initiatives and stages of development. A mapping of the current GHG reduction initiatives in Australian public road procurement is presented in this paper. The study includes the five largest Australian state road authorities, which cover 94% of the total 817,089 km of Australian main roads (not local) and account for 96% of the total A$13 billion annual major road construction and maintenance expenditure. The state road authorities’ green procurement processes and tools are evaluated based on interviews and a review of documents. Altogether 12 people, comprising 1-3 people of each organisation, participated in the interviews and provided documents. An evaluation matrix was developed for mapping the findings across the lifecycle of road construction project delivery. The results show how Australian state road authorities drive decisions with an impact on GHG emissions on the strategic planning phase, project development phase, and project implementation phase. The road authorities demonstrate varying levels of advancement in their green procurement methodologies. Six major gaps in the current green procurement processes are identified and, respectively, six recommendations for future research and development are suggested. The greatest gaps remain in the project development phase, which has a critical role in fixing the project (GHG reduction) goals, identifying risks and opportunities, and selecting the contractor to deliver the project. Specifically, the role of mass-haul optimisation as a part of GHG minimisation was reviewed, and mass-haul management was found to be an underutilised element with GHG reduction potential.

Realistic irrigation visualization in a surgical wound debridement simulator

Wound debridement refers to the removal of necrotic, devitalized, or contaminated tissue and/or foreign material to promote wound healing. Surgical debridement uses sharp instruments to cut dead tissue from a wound and it is the quickest and most efficient method of debridement. A wound debridement simulator [1,2] can ensure that a medical trainee is competent prior to performing a procedure on a genuine patient. Irrigation is performed at different stages of debridement in order to remove debris and reduce the bacteria count through rinsing the wound. This paper presents a novel approach for realistic irrigation visualization based on texture representations of debris. This approach applies image processing techniques to a series of images, which model the cleanliness of the wound. The active texture is generated and updated dynamically based on the irrigation state, location, and range. Presented results demonstrate that texture mapping and image processing techniques can provide effective and efficient solutions for irrigation visualization in the wound debridement simulator.

NEU-MODEL : a multi-level object-oriented dynamic emulation laboratory

Computational neuroscience aims to elucidate the mechanisms of neural information processing and population dynamics, through a methodology of incorporating biological data into complex mathematical models. Existing simulation environments model at a particular level of detail; none allow a multi-level approach to neural modelling. Moreover, most are not engineered to produce compute-efficient solutions, an important issue because sufficient processing power is a major impediment in the field. This project aims to apply modern software engineering techniques to create a flexible high performance neural modelling environment, which will allow rigorous exploration of model parameter effects, and modelling at multiple levels of abstraction.

Diseño de un aerogenerador de muy baja potencia para la alimentación de sistemas eléctricos aislados

[ES]En este Proyecto se desarrolla el diseño y la optimización de un aerogenerador de muy pequeña potencia enfocado a alimentar sistemas eléctricos aislados; concretamente, un sistema de iluminación. Se analizan todos los componentes del sistema aerogenerador, comparando las diversas alternativas posibles y eligiendo soluciones sencillas, baratas y eficientes para cada uno de ellos. Asimismo, se lleva a cabo un primer dimensionamiento de los mismos. El esfuerzo de diseño se ha centrado en las palas, por considerarse el componente más crítico y menos normalizado. Se han estudiado herramientas para su análisis detallado y su optimización desde el punto de vista aerodinámico, y éstas han sido implementadas en Matlab. Esto ha permitido generar un diseño óptimo ajustado a las necesidades del sistema. Asimismo, se han realizado las correspondientes tareas de planificación, analizado los múltiples beneficios de tipo técnico, económico, social y ambiental que la ejecución del presente Proyecto reportará, haciendo una programación completa del mismo y un análisis de los costes que supondrá.

Análise vibratória de fundações de máquinas sobre estacas.

A análise de fundações sob solicitações dinâmicas é algo sempre presente em projetos na área industrial. É um campo pouco explorado na área de engenharia geotécnica, onde existem relativamente poucas informações no Brasil, de maneira geral. O método mais comum de realizar essas análises é a simplificação de modelos estruturais a partir do uso de molas. Sabe-se que esses coeficientes de reação têm uma variação relativamente grande e que esse enfoque de projeto pode, em alguns casos, mostrar-se contra a segurança ou levar a superdimensionamentos desnecessários. Verifica-se, então, a necessidade de uma avaliação mais criteriosa, utilizando a interação solo x estrutura, onde as molas comumente utilizadas nas análises vibratórias convencionais são substituídas pela rigidez real do solo quando concebido como um meio contínuo, através de sua discretização pelo método dos elementos finitos. A presente dissertação analisa o problema através do módulo de dinâmica do programa Plaxis 2D. Neste tipo de análise, além da modelagem do solo como um meio contínuo, torna-se possível introduzir condições de contorno específicas ao problema em estudo, múltiplas camadas de solo, sejam horizontais ou inclinadas, além da introdução de amortecedores capazes de evitar a reflexão espúria das ondas incidentes nos limites da malha de elementos finitos e assim modelar mais adequadamente a perda de energia por radiação. A presente dissertação compara medições experimentais e soluções eficientes de métodos vibratórios clássicos com a resposta obtida pelo MEF, mostrando resultados bastante satisfatórios tanto pelos métodos clássicos quanto pelo MEF.

Sole plate fixing details for modern methods of timber construction.

In order to resist lateral loads, modern methods of timber construction are reliant on the in-plane shear strength of the walls orientated parallel to the applied action. In closed panel systems, the shear stresses are transferred to the foundations by the sole plate through the sheathing board, which is usually mechanically jointed to the timber frame. Since closed panels are delivered to site as single units, access to the internal bottom rail is rather restricted and novel, efficient solutions to secure the panel to the substrate are required. Sole plate fixing components for open and closed panel systems were tested in isolation and combination in order to validate a simplistic version of the weakest link theory. As a result, findings were embedded into a software database with a direct link to a previously developed sole plate and racking design application. This integrated process facilitates the structural optimization of the sole plate detail.